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

  /src/sys/kern/
kern_fileassoc.c 78 struct fileassoc_hash_entry *tbl_hash; member in struct:fileassoc_table
196 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
202 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
319 hash_entry = &(tbl->tbl_hash[indx]);
365 newtbl->tbl_hash = hashinit(newtbl->tbl_nslots, HASH_LIST,
375 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
382 hash_entry = &(newtbl->tbl_hash[indx]);
395 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
418 tbl->tbl_hash = hashinit(tbl->tbl_nslots, HASH_LIST, true,
463 LIST_FOREACH(faf, &tbl->tbl_hash[i], faf_list)
    [all...]
kern_fileassoc.c 78 struct fileassoc_hash_entry *tbl_hash; member in struct:fileassoc_table
196 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
202 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
319 hash_entry = &(tbl->tbl_hash[indx]);
365 newtbl->tbl_hash = hashinit(newtbl->tbl_nslots, HASH_LIST,
375 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
382 hash_entry = &(newtbl->tbl_hash[indx]);
395 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
418 tbl->tbl_hash = hashinit(tbl->tbl_nslots, HASH_LIST, true,
463 LIST_FOREACH(faf, &tbl->tbl_hash[i], faf_list)
    [all...]
kern_fileassoc.c 78 struct fileassoc_hash_entry *tbl_hash; member in struct:fileassoc_table
196 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
202 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
319 hash_entry = &(tbl->tbl_hash[indx]);
365 newtbl->tbl_hash = hashinit(newtbl->tbl_nslots, HASH_LIST,
375 while ((faf = LIST_FIRST(&tbl->tbl_hash[i])) != NULL) {
382 hash_entry = &(newtbl->tbl_hash[indx]);
395 hashdone(tbl->tbl_hash, HASH_LIST, tbl->tbl_mask);
418 tbl->tbl_hash = hashinit(tbl->tbl_nslots, HASH_LIST, true,
463 LIST_FOREACH(faf, &tbl->tbl_hash[i], faf_list)
    [all...]

Completed in 32 milliseconds