Lines Matching refs:item
118 ENTRY item;
134 static unsigned int prcnt; /* Number of probes this item */
280 /* Find or insert the item into the table */
282 *hsearch(ENTRY item, ACTION action)
283 /* "item" to be inserted or found */
293 i = HASH(item.key); /* Primary hash on key */
302 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */
306 c = HASH2(item.key); /* No match => compute secondary hash */
319 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */
338 unsigned int p0 = HASH(item.key); /* First probe index */
339 unsigned int c0 = HASH2(item.key); /* Main branch increment */
378 table[i] = item; /* Save item */
381 return (&table[i]); /* Address of item is returned */
411 *hsearch(item, action) /* Chained search with sorted lists */
412 ENTRY item; /* Item to be inserted or found */
423 i = HASH(item.key); /* Table[i] contains list head */
429 RETURN(build(&table[i], (NODE *) NULL, item));
433 while (p != NULL && (res = STRCMP(item.key, p->item.key))) {
440 RETURN(&(p->item));
446 RETURN(build(&table[i], table[i], item));
448 RETURN(build(q, p, item));
455 *build(last, next, item)
456 NODE **last; /* Where to store in last list item */
457 NODE *next; /* Link to next list item */
458 ENTRY item; /* Item to be kept in node */
467 p->item = item;
470 return (&(p->item));
568 *a->item.data, a, a->item.key);