Home
last modified time | relevance | path

Searched refs:chash (Results 1 – 4 of 4) sorted by relevance

/linux-4.4.14/drivers/md/
Ddm-cache-policy-cleaner.c53 struct hash chash; member
111 r = alloc_hash(&p->chash, from_cblock(cache_size)); in alloc_cache_blocks_with_hash()
121 free_hash(&p->chash); in free_cache_blocks_and_hash()
142 struct hash *hash = &p->chash; in lookup_cache_entry()
161 unsigned h = hash_64(from_oblock(e->oblock), p->chash.hash_bits); in insert_cache_hash_entry()
163 hlist_add_head(&e->hlist, &p->chash.table[h]); in insert_cache_hash_entry()
/linux-4.4.14/fs/f2fs/
Ddir.c202 if (!de && room && F2FS_I(dir)->chash != namehash) { in find_in_level()
203 F2FS_I(dir)->chash = namehash; in find_in_level()
553 if (F2FS_I(dir)->chash == dentry_hash) { in __f2fs_add_link()
555 F2FS_I(dir)->chash = 0; in __f2fs_add_link()
Df2fs.h433 f2fs_hash_t chash; /* hash value of given file name */ member
/linux-4.4.14/tools/perf/util/
Dmachine.c1643 unsigned char chash[CHASHSZ]; in remove_loops() local
1645 memset(chash, NO_ENTRY, sizeof(chash)); in remove_loops()
1653 if (chash[h] == NO_ENTRY) { in remove_loops()
1654 chash[h] = i; in remove_loops()
1655 } else if (l[chash[h]].from == l[i].from) { in remove_loops()
1659 for (j = chash[h]; j < i && i + off < nr; j++, off++) in remove_loops()