5269   struct s_x1node **ht;  /* Hash table for lookups */  member
5297       x1a->ht = (x1node**)&(x1a->tbl[1024]);  in Strsafe_init()
5298       for(i=0; i<1024; i++) x1a->ht[i] = 0;  in Strsafe_init()
5313   np = x1a->ht[h];  in Strsafe_insert()
5330     array.ht = (x1node**)&(array.tbl[arrSize]);  in Strsafe_insert()
5331     for(i=0; i<arrSize; i++) array.ht[i] = 0;  in Strsafe_insert()
5337       if( array.ht[h] ) array.ht[h]->from = &(newnp->next);  in Strsafe_insert()
5338       newnp->next = array.ht[h];  in Strsafe_insert()
5340       newnp->from = &(array.ht[h]);  in Strsafe_insert()
5341       array.ht[h] = newnp;  in Strsafe_insert()
5351   if( x1a->ht[h] ) x1a->ht[h]->from = &(np->next);  in Strsafe_insert()
5352   np->next = x1a->ht[h];  in Strsafe_insert()
5353   x1a->ht[h] = np;  in Strsafe_insert()
5354   np->from = &(x1a->ht[h]);  in Strsafe_insert()
5367   np = x1a->ht[h];  in Strsafe_find()
5436   struct s_x2node **ht;  /* Hash table for lookups */  member
5465       x2a->ht = (x2node**)&(x2a->tbl[128]);  in Symbol_init()
5466       for(i=0; i<128; i++) x2a->ht[i] = 0;  in Symbol_init()
5481   np = x2a->ht[h];  in Symbol_insert()
5498     array.ht = (x2node**)&(array.tbl[arrSize]);  in Symbol_insert()
5499     for(i=0; i<arrSize; i++) array.ht[i] = 0;  in Symbol_insert()
5505       if( array.ht[h] ) array.ht[h]->from = &(newnp->next);  in Symbol_insert()
5506       newnp->next = array.ht[h];  in Symbol_insert()
5509       newnp->from = &(array.ht[h]);  in Symbol_insert()
5510       array.ht[h] = newnp;  in Symbol_insert()
5522   if( x2a->ht[h] ) x2a->ht[h]->from = &(np->next);  in Symbol_insert()
5523   np->next = x2a->ht[h];  in Symbol_insert()
5524   x2a->ht[h] = np;  in Symbol_insert()
5525   np->from = &(x2a->ht[h]);  in Symbol_insert()
5538   np = x2a->ht[h];  in Symbol_find()
5635   struct s_x3node **ht;  /* Hash table for lookups */  member
5664       x3a->ht = (x3node**)&(x3a->tbl[128]);  in State_init()
5665       for(i=0; i<128; i++) x3a->ht[i] = 0;  in State_init()
5680   np = x3a->ht[h];  in State_insert()
5697     array.ht = (x3node**)&(array.tbl[arrSize]);  in State_insert()
5698     for(i=0; i<arrSize; i++) array.ht[i] = 0;  in State_insert()
5704       if( array.ht[h] ) array.ht[h]->from = &(newnp->next);  in State_insert()
5705       newnp->next = array.ht[h];  in State_insert()
5708       newnp->from = &(array.ht[h]);  in State_insert()
5709       array.ht[h] = newnp;  in State_insert()
5719   if( x3a->ht[h] ) x3a->ht[h]->from = &(np->next);  in State_insert()
5720   np->next = x3a->ht[h];  in State_insert()
5721   x3a->ht[h] = np;  in State_insert()
5722   np->from = &(x3a->ht[h]);  in State_insert()
5735   np = x3a->ht[h];  in State_find()
5776   struct s_x4node **ht;  /* Hash table for lookups */  member
5804       x4a->ht = (x4node**)&(x4a->tbl[64]);  in Configtable_init()
5805       for(i=0; i<64; i++) x4a->ht[i] = 0;  in Configtable_init()
5820   np = x4a->ht[h];  in Configtable_insert()
5837     array.ht = (x4node**)&(array.tbl[arrSize]);  in Configtable_insert()
5838     for(i=0; i<arrSize; i++) array.ht[i] = 0;  in Configtable_insert()
5844       if( array.ht[h] ) array.ht[h]->from = &(newnp->next);  in Configtable_insert()
5845       newnp->next = array.ht[h];  in Configtable_insert()
5847       newnp->from = &(array.ht[h]);  in Configtable_insert()
5848       array.ht[h] = newnp;  in Configtable_insert()
5859   if( x4a->ht[h] ) x4a->ht[h]->from = &(np->next);  in Configtable_insert()
5860   np->next = x4a->ht[h];  in Configtable_insert()
5861   x4a->ht[h] = np;  in Configtable_insert()
5862   np->from = &(x4a->ht[h]);  in Configtable_insert()
5875   np = x4a->ht[h];  in Configtable_find()
5890   for(i=0; i<x4a->size; i++) x4a->ht[i] = 0;  in Configtable_clear()