118 	ENTRY item;  member
282 *hsearch(ENTRY item, ACTION action)  in hsearch()  argument
293 	i = HASH(item.key);	/* Primary hash on key */  in hsearch()
302 	else if (COMPARE(table[i].key, item.key) == 0)	/* Match? */  in hsearch()
306 	c = HASH2(item.key);	/* No match => compute secondary hash */  in hsearch()
319 	else if (COMPARE(table[i].key, item.key) == 0)	/* Match? */  in hsearch()
338 	unsigned int p0 = HASH(item.key);   /* First probe index */  in hsearch()
339 	unsigned int c0 = HASH2(item.key);  /* Main branch increment */  in hsearch()
378 	table[i] = item;		/* Save item */  in hsearch()
411 *hsearch(item, action)	/* Chained search with sorted lists */  in hsearch()  argument
412 ENTRY item;		/* Item to be inserted or found */  in hsearch()
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)  in build()  argument
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);  in hdump()