Lines Matching full:hash
31 /* Ok, in order to use the hash, we have to support n-len strings
37 * Since HASH doesn't maintain any data placed in it, merely pointers to
39 * comp/hash functions which just use the name/name_len as the key.
157 if (myhdf->hash != NULL)
159 ne_hash_destroy(&myhdf->hash);
240 if (parent && parent->hash)
244 hp = ne_hash_lookup(parent->hash, &hash_key);
559 err = ne_hash_init(&(hdf->hash), hash_hdf_hash, hash_hdf_comp);
565 err = ne_hash_insert(hdf->hash, child, child);
681 if (hn->hash != NULL)
685 hp = ne_hash_lookup(hn->hash, &hash_key);
735 /* This is the point at which we convert to a hash table
737 if (count > FORCE_HASH_AT && hn->hash == NULL)
742 else if (hn->hash != NULL)
744 err = ne_hash_insert(hn->hash, hp, hp);
994 if (lp->hash != NULL)
996 ne_hash_remove(lp->hash, hp);
1002 * repoint so hash table inserts will go to the right place */
