nysol-take 3.0.0

data/ext/sspcrun/src/itemset.h

@@ -0,0 +1,170 @@
+/*  itemset search input/output common routines
+            25/Nov/2007   by Takeaki Uno  e-mail:uno@nii.jp, 
+    homepage:   http://research.nii.ac.jp/~uno/index.html  */
+/* This program is available for only academic use, basically.
+   Anyone can modify this program, but he/she has to write down 
+    the change of the modification on the top of the source code.
+   Neither contact nor appointment to Takeaki Uno is needed.
+   If one wants to re-distribute this code, please
+    refer the newest code, and show the link to homepage of 
+    Takeaki Uno, to notify the news about the codes for the users. */
+
+/* routines for itemset mining */
+
+#ifndef _itemset_h_
+#define _itemset_h_
+
+#include"stdlib2.h"
+#include"queue.h"
+#define AHEAP_KEY_WEIGHT
+#include"aheap.h"
+
+
+typedef struct {
+//  int a;
+  QUEUE itemset;   // current operating itemset
+  QUEUE add;       // for equisupport (hypercube decomposition)
+  int ub, lb;   // upper/lower bounds for the itemset size
+  WEIGHT frq, pfrq, frq_ub, frq_lb;  // upper/lower bounds for the frequency
+  WEIGHT rposi_lb, rposi_ub, posi_lb, posi_ub, nega_ub, nega_lb;  // upper/lower bounds for the sum of positive/negative weights
+  WEIGHT setrule_lb;  // frequency lower bound for set rule
+  double ratio, prob, th;   // confidence and independent probability of the current pattern
+  double ratio_ub, ratio_lb, prob_ub, prob_lb;   // upper/lower bounds for confidence and independent probability
+  QUEUE_INT target;  // target item for rule mining
+  char *itemflag;       // 1 if it is include in the pattern (and 2 if included in add)
+  WEIGHT *item_frq;    // frequency of each item
+  WEIGHT total_weight;  // total weight of the input database
+  int len_ub, len_lb;   // upper/lower bounds for the length of the pattern
+  int gap_ub, gap_lb;   // upper/lower bounds for the gaps in the pattern
+  LONG *sc, *sc2;    // #itemsets classified by the sizes / frequencies
+  QUEUE_INT item_max, item_max_org;  // (original) maximum item
+  AHEAP topk, *itemtopk;  // heap for topk mining. valid if topk->h is not NULL
+  LONG itemtopk_end, itemtopk_item, itemtopk_item2; // the size of itemtopk heaps; specify topkheap to be used/the size of each in the initiaization
+  char topk_sign, itemtopk_sign;  // determine min/max (1, -1) for topk/itemtopk heaps 
+  QUEUE_INT **itemtopk_ary;  // topk solutions for each item
+  LONG topk_k, topk_frq;   // counter for topk bucket and #remainings
+  int flag, flag2;    // flag for various functions
+  PERM *perm;   // permutation array for output itemset: item => original item
+  FILE *fp;    // file pointer to the output file
+  char separator; // separator of items output
+  int digits;  // #decimals to be output, for non-natural numbers
+  int progress;
+  LONG iters, iters2, iters3;  //iterations
+  LONG solutions, solutions2;  // number of solutions output
+  LONG outputs, outputs2;    // #calls of ITEMSET_output_itemse3t or ITEMSET_solusion
+  LONG max_solutions; // maximum solutions to be output
+  void *X;  // pointer to the original data
+  int dir;  // direction flag for AGRAPH & SGRAPH
+
+  int multi_core;  // number of processors
+  LONG *multi_iters, *multi_iters2, *multi_iters3;  //iterations
+  LONG *multi_solutions, *multi_solutions2;  // number of solutions output
+  LONG *multi_outputs, *multi_outputs2;    // #calls of ITEMSET_output_itemset or ITEMSET_solusion
+  FILE2 *multi_fp;  // output file2 pointer for multi-core mode
+  WEIGHT *set_weight;  // the frequency of each prefix of current itemset
+  QUEUE **set_occ;    // the occurrence of each prefix of current itemset
+
+  IHEAP minh, maxh;  // for 2D LAMP mode
+  LONG *patn;  // cardinarity of each patten group
+
+#ifdef MULTI_CORE
+  pthread_spinlock_t lock_counter;   // couneter locker for jump counter
+  pthread_spinlock_t lock_sc;   // couneter locker for score counter
+  pthread_spinlock_t lock_output;   // couneter locker for #output 
+#endif
+} ITEMSET;
+
+/* parameters for ITEMSET.flag */
+
+#define ITEMSET_ITERS2 4  // output #iters2
+#define ITEMSET_PRE_FREQ 8  // output frequency preceding to each itemset
+#define ITEMSET_FREQ 16  // output frequency following to each itemset
+#define ITEMSET_ALL 32 // concat all combinations of "add" to each itemset
+
+#define ITEMSET_TRSACT_ID 64  // output transaction ID's in occurrences
+#define ITEMSET_OUTPUT_EDGE 128  // output itemset as edge set (refer AGRAPH)
+#define ITEMSET_IGNORE_BOUND 256 // ignore constraint for frequency
+#define ITEMSET_RM_DUP_TRSACT 512 // remove duplicated transaction ID's
+#define ITEMSET_MULTI_OCC_PRINT 1024 //print each component of occ
+   // TRSACT_ID+MULTI_OCC_PRINT means print first two components of occ
+#define ITEMSET_NOT_ITEMSET  2048 // do not print itemset to the output file
+#define ITEMSET_RULE_SUPP  4096 // output confidence and item frquency by abusolute value
+#define ITEMSET_OUTPUT_POSINEGA  8192 // output negative/positive frequencies
+#define ITEMSET_MULTI_OUTPUT 16384 // for multi-core mode
+#define ITEMSET_USE_ORG 32768 // use item_max_org to the size of use
+#define ITEMSET_ITEMFRQ 65536 // allocate item_frq
+#define ITEMSET_ADD 131072    // allocate add
+
+#define ITEMSET_RULE_FRQ 262144
+#define ITEMSET_RULE_INFRQ 524288
+#define ITEMSET_RULE_RFRQ 1048576
+#define ITEMSET_RULE_RINFRQ 2097152
+#define ITEMSET_RFRQ 4194304
+#define ITEMSET_RINFRQ 8388608
+#define ITEMSET_POSI_RATIO 16777216
+#define ITEMSET_SET_RULE 134217728
+
+#define ITEMSET_APPEND 268435456   // append the output to the fiile
+#define ITEMSET_RULE_ADD 536870912   // append items in add to the solution, for rule output
+#define ITEMSET_SC2 1073741824   // count #items classified by frequencies
+
+
+#define ITEMSET_LAMP 256   // LAMP mode
+#define ITEMSET_LAMP2 512   // 2D LAMP mode
+
+//#define ITEMSET_RULE (ITEMSET_RULE_FRQ + ITEMSET_RULE_INFRQ + ITEMSET_RULE_RFRQ + ITEMSET_RULE_RINFRQ + ITEMSET_RFRQ + ITEMSET_RINFRQ + ITEMSET_SET_RULE)  // for check any rule is true
+#define ITEMSET_RULE (ITEMSET_RULE_FRQ + ITEMSET_RULE_INFRQ + ITEMSET_RULE_RFRQ + ITEMSET_RULE_RINFRQ + ITEMSET_SET_RULE)  // for check any rule is true
+
+#ifndef ITEMSET_INTERVAL
+#define ITEMSET_INTERVAL 500000
+#endif
+
+/* Output information about ITEMSET structure. flag&1: print frequency constraint */
+void ITEMSET_print (ITEMSET *II, int flag);
+
+/* topk.end>0 => initialize heap for topk mining */
+/* all pointers will be set to 0, but not for */
+/* if topK mining, set topk.end to "K" */
+void ITEMSET_init (ITEMSET *I);
+void ITEMSET_alloc (ITEMSET *I, char *fname, PERM *perm, QUEUE_INT item_max, size_t item_max_org);
+void ITEMSET_end (ITEMSET *I);
+
+/* sum the counters computed by each thread */
+void ITEMSET_merge_counters (ITEMSET *I);
+
+/*******************************************************************/
+/* output at the termination of the algorithm */
+/* print #of itemsets of size k, for each k */
+/*******************************************************************/
+void ITEMSET_last_output (ITEMSET *I);
+
+/* output frequency, coverage */
+void ITEMSET_output_frequency (ITEMSET *I, int core_id);
+
+/* output an itemset to the output file */
+void ITEMSET_output_itemset (ITEMSET *I, QUEUE *occ, int core_id);
+
+/* output itemsets with adding all combination of "add"
+   at the first call, i has to be "add->t" */
+void ITEMSET_solution (ITEMSET *I, QUEUE *occ, int core_id);
+
+/*************************************************************************/
+/* ourput a rule */
+/*************************************************************************/
+void ITEMSET_output_rule (ITEMSET *I, QUEUE *occ, double p1, double p2, size_t item, int core_id);
+
+/*************************************************************************/
+/* check all rules for a pair of itemset and item */
+/*************************************************************************/
+void ITEMSET_check_rule (ITEMSET *I, WEIGHT *w, QUEUE *occ, size_t item, int core_id);
+
+/*************************************************************************/
+/* check all rules for an itemset and all items */
+/*************************************************************************/
+void ITEMSET_check_all_rule (ITEMSET *I, WEIGHT *w, QUEUE *occ, QUEUE *jump, WEIGHT total, int core_id);
+
+#endif
+
+
+
+

data/ext/sspcrun/src/problem.c

@@ -0,0 +1,415 @@
+/*  Common problem input/output routines /structure
+            25/Nov/2007   by Takeaki Uno  e-mail:uno@nii.jp, 
+    homepage:   http://research.nii.ac.jp/~uno/index.html  */
+/* This program is available for only academic use, basically.
+   Anyone can modify this program, but he/she has to write down 
+    the change of the modification on the top of the source code.
+   Neither contact nor appointment to Takeaki Uno is needed.
+   If one wants to re-distribute this code, please
+    refer the newest code, and show the link to homepage of 
+    Takeaki Uno, to notify the news about the codes for the users. */
+
+/***************************************************/
+
+#ifndef _problem_c_
+#define _problem_c_
+
+#include"problem.h"
+
+#include"stdlib2.c"
+#include"queue.c"
+#include"itemset.c"
+
+void PROBLEM_error (){
+  ERROR_MES = "command explanation";
+  EXIT;
+}
+
+/*************************************************************************/
+/* PROBLEM and ITEMSET initialization */
+/*************************************************************************/
+void PROBLEM_init (PROBLEM *P){
+  P->start_time = clock();
+  RAND_INIT;
+  //ERROR_MES = NULL;
+
+#ifdef _FILE2_LOAD_FROM_MEMORY_
+  __load_from_memory_org2__ = __load_from_memory__ = __load_from_memory_org__;
+#endif
+
+  P->problem = P->problem2 = 0;
+  P->prog = 0;
+  P->prog2 = 0;
+  P->input_fname = P->input_fname2 = P->output_fname = P->output_fname2 = NULL;
+  P->workdir = P->workdir2 = NULL;
+  P->weight_fname = P->header_fname = P->table_fname = P->sc_fname = NULL;
+  P->position_fname = P->position2_fname = NULL;
+  P->outperm_fname = NULL;
+
+  P->root = 0;
+  P->dir = P->edge_dir = 0;
+  P->th = P->th2 = P->th3 = 0;
+  P->ratio = P->ratio2 = 0;
+  P->num = P->siz = P->dim = P->len = P->width = P->height = 0;
+  P->rows = 0;
+  P->clms = 0;
+  P->gap_ub = INTHUGE;
+  P->gap_lb = 0;
+  P->xmax = P->ymax = P->pxmax = P->pymax = 0;
+  P->tmax = P->tmin = 0;
+  P->cost = P->cost2 = 0;
+  
+  ITEMSET_init (&P->II);
+  ITEMSET_init (&P->II2);
+
+  P->vf = P->dep = NULL;
+  P->ff = INIT_QUEUE;
+
+  P->shift = NULL;
+  P->occ_w = P->occ_pw = P->occ_w2 = P->occ_pw2 = NULL;
+  P->buf = P->buf_org = NULL;
+  P->buf_end = 0;
+  
+  P->itemjump = P->itemcand = P->vecjump = P->veccand = INIT_QUEUE;  // for delivery
+  P->itemchr = P->vecchr = NULL;
+  P->OQ = P->OQ2 = P->VQ = P->VQ2 = NULL;   // for delivery
+  P->itemary = NULL;
+  P->itemmark = P->itemflag = P->vecmark = P->vecflag = NULL;  // mark for vector
+  P->occ_t = P->vecary = NULL;
+  P->oo = INIT_QUEUE;
+  P->vecw = NULL;
+  
+  P->pat = NULL;
+  P->plen = P->perr = 0;
+
+#ifdef _base_h_
+  P->B = INIT_BASE;
+#endif
+
+#ifdef _alist_h_
+  P->occ = INIT_MALIST;
+  P->itemlist = INIT_ALIST;
+  P->veclist = INIT_ALIST;
+#endif
+
+#ifdef _trsact_h_
+  TRSACT_init (&P->TT);
+  TRSACT_init (&P->TT2);
+#endif
+#ifdef _sgraph_h_
+  P->SG = INIT_SGRAPH;
+  P->SG2 = INIT_SGRAPH;
+#endif
+#ifdef _agraph_h_
+  P->AG = INIT_AGRAPH;
+  P->AG2 = INIT_AGRAPH;
+#endif
+#ifdef _seq_h_
+  SEQ_init (&P->SS);
+  SEQ_init (&P->SS2);
+#endif
+#ifdef _pos_h_
+  POS_init (&P->PS);
+  POS_init (&P->PS2);
+  P->PS.S = &P->SS;
+  P->PS2.S = &P->SS2;
+  P->PS.I = &P->II;
+  P->PS2.I = &P->II;
+#endif
+#ifdef _fstar_h_
+  P->FS = INIT_FSTAR;
+  P->FS2 = INIT_FSTAR;
+#endif
+
+#ifdef _vec_h_
+  P->MM = INIT_MAT;
+  P->MM2 = INIT_MAT;
+  P->SM = INIT_SMAT;
+  P->SM2 = INIT_SMAT;
+  P->FF = INIT_SETFAMILY;
+  P->FF2 = INIT_SETFAMILY;
+#endif
+
+#ifdef _barray_h_
+  P->BA = INIT_BARRAY;
+  P->BA2 = INIT_BARRAY;
+#endif
+}
+
+/*************************************************************************/
+/* PROBLEM load */
+/*************************************************************************/
+void PROBLEM_load (PROBLEM *P){
+  int f=0;
+  ITEMSET *II = &P->II;
+/******************************/
+#ifdef _trsact_h_
+  if ( P->TT.fname ){ TRSACT_load (&P->TT);       if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->TT2.fname ){ TRSACT_load (&P->TT2);       if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _sgraph_h_
+  if ( P->SG.fname ){ SGRAPH_load (&P->SG);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->SG2.fname ){ SGRAPH_load (&P->SG);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _agraph_h_
+  if ( P->AG.fname ){ AGRAPH_load (&P->AG);    if (ERROR_MES) goto ERR;}
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->AG2.fname ){ AGRAPH_load (&P->AG2);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _fstar_h_
+  if ( P->FS.fname ){ FSTAR_load (&P->FS);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->FS2.fname ){ FSTAR_load (&P->FS2);     if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _vec_h_
+  if ( P->MM.fname ){ MAT_load (&P->MM);   if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->MM2.fname ){ MAT_load (&P->MM2);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->SM.fname ){ SMAT_load (&P->SM);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->SM2.fname ){ SMAT_load (&P->SM2);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->FF.fname ){ SETFAMILY_load (&P->FF);   if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->FF2.fname ){ SETFAMILY_load (&P->FF2);   if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _seq_h_
+  if ( P->SS.fname ){ SEQ_load (&P->SS);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->SS2.fname ){ SEQ_load (&P->SS2);     if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+#ifdef _barray_h_
+  if ( P->BA.fname ){ BARRAY_load (&P->BA);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+  if ( P->BA2.fname ){ BARRAY_load (&P->BA2);    if (ERROR_MES) goto ERR; }
+ #ifdef _FILE2_LOAD_FROM_MEMORY_
+   __load_from_memory_org__ = __load_from_memory__;
+ #endif
+#endif
+
+  if (P->input_fname){ f=1; print_mes (II, " input: %s", P->input_fname); }
+  if (P->weight_fname){ f=1; print_mes (II, " weight: %s", P->weight_fname); }
+  if (P->output_fname){ f=1; print_mes (II, " output to: %s",P->output_fname); }
+  if ( f ) print_mes (II, "\n");
+
+/******************************/
+
+  if ( !ERROR_MES ) return;
+  ERR:;
+  PROBLEM_end (P);
+  EXIT;
+}
+
+/* termination of problem */
+void PROBLEM_end (PROBLEM *P){
+  ITEMSET *II = &P->II;
+
+#ifdef _trsact_h_
+  TRSACT_end (&P->TT);
+  TRSACT_end (&P->TT2);
+#endif
+#ifdef _sgraph_h_
+  SGRAPH_end (&P->SG);
+  SGRAPH_end (&P->SG2);
+#endif
+#ifdef _agraph_h_
+  AGRAPH_end (&P->AG);
+  AGRAPH_end (&P->AG2);
+#endif
+#ifdef _seq_h_
+  SEQ_end (&P->SS);
+  SEQ_end (&P->SS2);
+#endif
+#ifdef _fstar_h_
+  FSTAR_end (&P->FS);
+  FSTAR_end (&P->FS2);
+#endif
+#ifdef _vec_h_
+  MAT_end (&P->MM);
+  MAT_end (&P->MM2);
+  SMAT_end (&P->SM);
+  SMAT_end (&P->SM2);
+  SETFAMILY_end (&P->FF);
+  SETFAMILY_end (&P->FF2);
+#endif
+#ifdef _pos_h_
+  POS_end (&P->PS);
+  POS_end (&P->PS2);
+#endif
+#ifdef _barray_h_
+  BARRAY_end (&P->BA);
+  BARRAY_end (&P->BA2);
+#endif
+
+/******************************/
+
+  mfree (P->vf, P->dep);
+  QUEUE_end (&P->ff);
+
+  ITEMSET_end (II);
+  ITEMSET_end (&P->II2);
+
+  if ( P->occ_pw2 != P->occ_pw && P->occ_pw2 != P->occ_w2 ) free2 (P->occ_pw2);
+  if ( P->occ_w2 != P->occ_w ) free2 (P->occ_w2);
+  if ( P->occ_pw != P->occ_w ) free2 (P->occ_pw);
+  mfree (P->shift, P->occ_t, P->occ_w);
+
+  if ( P->OQ ) free2 (P->OQ[0].v);
+  if ( P->OQ2 ) free2 (P->OQ2[0].v);
+  if ( P->VQ ) free2 (P->VQ[0].v);
+  if ( P->VQ2 ) free2 (P->VQ2[0].v);
+  mfree (P->OQ, P->OQ2, P->VQ, P->VQ2, P->itemchr, P->vecchr);
+
+  mfree (P->itemary, P->itemflag, P->itemmark, P->vecary, P->vecflag, P->vecmark, P->vecw);
+  QUEUE_end (&P->itemcand);
+  QUEUE_end (&P->itemjump);
+
+  QUEUE_end (&P->veccand);
+  QUEUE_end (&P->vecjump);
+  QUEUE_end (&P->oo);
+
+  free2 (P->buf_org);
+ 
+#ifdef _alist_h_
+  MALIST_end (&P->occ);
+  ALIST_end (&P->itemlist);
+  ALIST_end (&P->veclist);
+#endif
+
+#ifdef _undo_h_
+  ALISTundo_end ();
+#endif
+
+  P->end_time = clock();
+  if ( print_time_flag )
+   print_mes (II, "computation_time= %3f\n", ((double)(P->end_time-P->start_time))/CLOCKS_PER_SEC);
+
+#ifdef _FILE2_LOAD_FROM_MEMORY_
+  __load_from_memory_org__ = __load_from_memory_org2__;
+  __write_to_memory__ = __write_to_memory_org__;
+#endif
+
+  PROBLEM_init (P);
+}
+
+/* allocate arrays and structures */
+void PROBLEM_alloc (PROBLEM *P, QUEUE_ID siz, QUEUE_ID siz2, size_t siz3, PERM *perm, int f){
+  PERM *p;
+#ifdef _alist_h_
+  ALIST_ID i=0;
+#endif
+  int j;
+
+  if ( f&PROBLEM_SHIFT ) calloc2 (P->shift, siz+2, goto ERR);
+  if ( f&PROBLEM_OCC_T ) calloc2 (P->occ_t, siz+2, goto ERR);
+  if ( f&(PROBLEM_OCC_W+PROBLEM_OCC_PW) ) calloc2 (P->occ_w, siz+2, goto ERR);
+  if ( f&PROBLEM_OCC_PW ) calloc2 (P->occ_pw, siz+2, goto ERR);
+  else P->occ_pw = P->occ_w;
+  if ( f&PROBLEM_OCC_W2 ){
+    calloc2 (P->occ_w2, siz+2, goto ERR);
+    if ( f&PROBLEM_OCC_PW ) calloc2 (P->occ_pw2, siz+2, goto ERR);
+    else P->occ_pw2 = P->occ_w2;
+  } else { P->occ_w2 = P->occ_w; P->occ_pw2 = P->occ_pw; }
+
+  if ( f&PROBLEM_ITEMFLAG ) calloc2 (P->itemflag, siz+2, goto ERR);
+  if ( f&PROBLEM_ITEMMARK ) calloc2 (P->itemmark, siz+2, goto ERR);
+  if ( f&PROBLEM_ITEMARY ) calloc2(P->itemary, siz+2, goto ERR);
+  if ( f&PROBLEM_ITEMCHR ) calloc2(P->itemchr, siz+2, goto ERR);
+  if ( f&PROBLEM_ITEMJUMP ) QUEUE_alloc (&P->itemjump, siz+2);
+  if ( f&PROBLEM_ITEMCAND ) QUEUE_alloc (&P->itemcand, siz+2);
+
+  if ( f&PROBLEM_VECFLAG ) calloc2 (P->vecflag, siz2+2, goto ERR);
+  if ( f&PROBLEM_VECMARK ) calloc2 (P->vecmark, siz2+2, goto ERR);
+  if ( f&PROBLEM_VECARY ) calloc2 (P->vecary, siz2+2, goto ERR);
+  if ( f&PROBLEM_VECCHR ) calloc2 (P->vecchr, siz2+2, goto ERR);
+  if ( f&PROBLEM_VECJUMP ) QUEUE_alloc (&P->vecjump, siz2+2);
+  if ( f&PROBLEM_VECCAND ) QUEUE_alloc (&P->veccand, siz2+2);
+  if ( f&PROBLEM_VECW ) calloc2 (P->vecw, siz2+2, goto ERR);
+
+#ifdef _alist_h_
+  if ( f&PROBLEM_ITEMLIST ) ALIST_alloc (&P->itemlist, siz+2);
+  if ( f&PROBLEM_VECLIST ) ALIST_alloc (&P->veclist, siz2+2);
+
+  if ( f&PROBLEM_OCC3 ){
+    MALIST_alloc (&P->occ, siz, siz2+2); // element=>
+if ( ERROR_MES ) goto ERR;
+    if ( f&PROBLEM_OCC2 ){
+      FLOOP (i, 0, siz) MALIST_ins_tail (&P->occ, (f&PROBLEM_OCC1)?siz2: 0, i, 0);
+    }
+  }
+#endif
+
+    // set outperm
+  if ( P->outperm_fname ){
+    ARY_LOAD (p, int, j, P->outperm_fname, 1, EXIT);
+    if ( perm ){
+      FLOOP (j, 0, siz) perm[j] = p[perm[j]];
+      free2 (p);
+    } else perm = p;
+  }
+  ITEMSET_alloc (&P->II, P->output_fname, perm, siz, siz3);
+  if ( P->II.target<siz && P->II.perm )
+      FLOOP (j, 0, P->II.item_max){ if ( P->II.target == P->II.perm[j] ){ P->II.target = j; break; } }
+
+#ifdef _undo_h_
+  ALISTundo_init ();
+#endif
+
+  return;
+  ERR:;
+  PROBLEM_end (P);
+  EXIT;
+}
+
+#endif
+
+