return NULL;
if (nsearched > table->maxnsearched) table->maxnsearched = nsearched;  return work;
cache_search (request_type type, void *key, size_t len, struct database *table,	      uid_t owner){  unsigned long int hash = __nis_hash (key, len) % table->module;  struct hashentry *work;  work = table->array[hash];  while (work != NULL)    {      if (type == work->type && len == work->len	  && memcmp (key, work->key, len) == 0 && work->owner == owner)	{	  /* We found the entry.  Increment the appropriate counter.  */	  if (work->data == (void *) -1)	    ++table->neghit;	  else	    ++table->poshit;	  return work;	}      work = work->next;    }  return NULL;}