Lines Matching refs:table
122 static NODE **table; /* The address of the hash table */ variable
127 static TABELEM *table; /* The address of the hash table */ variable
230 old_table = table; in hcreate()
231 table = local_table; in hcreate()
250 if (table[i] != (NODE *)NULL) { in hdestroy()
251 p = table[i]; in hdestroy()
264 local_table = (POINTER)table; in hdestroy()
265 table = 0; in hdestroy()
300 if (table[i].key == NULL) /* Empty slot? */ in hsearch()
302 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */ in hsearch()
303 RETURN(&table[i]); in hsearch()
317 if (table[i].key == NULL) /* Empty slot? */ in hsearch()
319 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */ in hsearch()
320 RETURN(&table[i]) in hsearch()
352 cj = HASH2(table[pj].key); /* Secondary branch incr. */ in hsearch()
357 if (table[pjk].key == NULL) { in hsearch()
367 table[curpos] = table[curj]; /* Old key to new site */ in hsearch()
378 table[i] = item; /* Save item */ in hsearch()
381 return (&table[i]); /* Address of item is returned */ in hsearch()
425 if (table[i] == (NODE*)NULL) { /* List has not yet been begun */
429 RETURN(build(&table[i], (NODE *) NULL, item));
431 q = &table[i];
432 p = table[i];
446 RETURN(build(&table[i], table[i], item));
547 if (table[i].key == NULL) in hdump()
553 hsearch(table[i], FIND); in hdump()
556 *table[i].data, prcnt, table[i].key); in hdump()
562 if (table[i] == NULL) in hdump()
566 for (a = table[i]; a != NULL; a = a->next) in hdump()