Lines Matching refs:item
120 ENTRY item;
136 static unsigned int prcnt; /* Number of probes this item */
243 * Find or insert the item into the table
245 * item: Item to be inserted or found
249 hsearch(ENTRY item, ACTION action)
257 i = HASH(item.key); /* Primary hash on key */
266 else if(COMPARE(table[i].key, item.key) == 0) /* Match? */
270 c = HASH2(item.key); /* No match => compute secondary hash */
283 else if(COMPARE(table[i].key, item.key) == 0) /* Match? */
300 { unsigned int p0 = HASH(item.key); /* First probe index */
301 unsigned int c0 = HASH2(item.key); /* Main branch increment */
336 table[i] = item; /* Save item */
337 return(&table[i]); /* Address of item is returned */
367 * item: Item to be inserted or found
371 hsearch(ENTRY item, ACTION action)
380 i = HASH(item.key); /* Table[i] contains list head */
386 return(build(&table[i], (NODE *) NULL, item));
391 while(p != NULL && (res = STRCMP(item.key, p->item.key))) {
398 return(&(p->item));
404 return(build(&table[i], table[i], item));
406 return(build(q, p, item));
413 * last: Where to store in last list item
414 * next: Link to next list item
415 * item: Item to be kept in node
418 build(NODE **last, NODE *next, ENTRY item)
423 p->item = item;
426 return(&(p->item));
540 *a->item.data, a, a->item.key);