HomeSort by: relevance | last modified time | path
    Searched refs:bin_find_entry (Results 1 - 3 of 3) sorted by relevancy

  /src/external/bsd/unbound/dist/testcode/
unitlruhash.c 79 /** test bin_find_entry function and bin_overflow_remove */
97 unit_assert( bin_find_entry(table, &bin, h, k, NULL) == NULL );
105 unit_assert( bin_find_entry(table, &bin, myhash(13), k, NULL) == NULL );
109 unit_assert( bin_find_entry(table, &bin, h, k2, NULL) == NULL );
112 unit_assert( bin_find_entry(table, &bin, h, k, NULL) == &k->entry );
118 unit_assert( bin_find_entry(table, &bin, h, k, NULL) == NULL );
130 unit_assert( bin_find_entry(table, &bin, myhash(13), k, NULL) == NULL );
134 unit_assert( bin_find_entry(table, &bin, h, k2, NULL) == NULL );
137 unit_assert( bin_find_entry(table, &bin, h, k, NULL) == &k->entry );
140 unit_assert( bin_find_entry(table, &bin, k4->entry.hash, k4, NULL
    [all...]
  /src/external/bsd/unbound/dist/util/storage/
lruhash.h 386 struct lruhash_entry* bin_find_entry(struct lruhash* table,
lruhash.c 219 bin_find_entry(struct lruhash* table, function
326 if(!(found=bin_find_entry(table, bin, hash, entry->key, &collisions))) {
373 if((entry=bin_find_entry(table, bin, hash, key, NULL)))
400 if((entry=bin_find_entry(table, bin, hash, key, NULL))) {
669 if ((found = bin_find_entry(table, bin, hash, entry->key, &collisions)) != NULL) {

Completed in 18 milliseconds