5282 static struct s_x1 *x1a;  variable
5286   if( x1a ) return;  in Strsafe_init()
5287   x1a = (struct s_x1*)malloc( sizeof(struct s_x1) );  in Strsafe_init()
5288   if( x1a ){  in Strsafe_init()
5289     x1a->size = 1024;  in Strsafe_init()
5290     x1a->count = 0;  in Strsafe_init()
5291     x1a->tbl = (x1node*)calloc(1024, sizeof(x1node) + sizeof(x1node*));  in Strsafe_init()
5292     if( x1a->tbl==0 ){  in Strsafe_init()
5293       free(x1a);  in Strsafe_init()
5294       x1a = 0;  in Strsafe_init()
5297       x1a->ht = (x1node**)&(x1a->tbl[1024]);  in Strsafe_init()
5298       for(i=0; i<1024; i++) x1a->ht[i] = 0;  in Strsafe_init()
5310   if( x1a==0 ) return 0;  in Strsafe_insert()
5312   h = ph & (x1a->size-1);  in Strsafe_insert()
5313   np = x1a->ht[h];  in Strsafe_insert()
5322   if( x1a->count>=x1a->size ){  in Strsafe_insert()
5326     array.size = arrSize = x1a->size*2;  in Strsafe_insert()
5327     array.count = x1a->count;  in Strsafe_insert()
5332     for(i=0; i<x1a->count; i++){  in Strsafe_insert()
5334       oldnp = &(x1a->tbl[i]);  in Strsafe_insert()
5345     *x1a = array;  in Strsafe_insert()
5348   h = ph & (x1a->size-1);  in Strsafe_insert()
5349   np = &(x1a->tbl[x1a->count++]);  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()
5365   if( x1a==0 ) return 0;  in Strsafe_find()
5366   h = strhash(key) & (x1a->size-1);  in Strsafe_find()
5367   np = x1a->ht[h];  in Strsafe_find()