Searched refs:end_key (Results 1 – 5 of 5) sorted by relevance
| /linux-6.1.9/fs/reiserfs/ |
| D | tail_conversion.c | 35 struct cpu_key end_key; in direct2indirect() local
63 make_cpu_key(&end_key, inode, tail_offset, TYPE_INDIRECT, 4); in direct2indirect()
66 if (search_for_position_by_key(sb, &end_key, path) == POSITION_FOUND) { in direct2indirect()
69 "the tree %K. Use fsck to repair.", &end_key); in direct2indirect()
84 reiserfs_insert_item(th, path, &end_key, &ind_ih, inode, in direct2indirect()
88 retval = reiserfs_paste_into_item(th, path, &end_key, inode, in direct2indirect()
101 make_cpu_key(&end_key, inode, max_reiserfs_offset(inode), TYPE_DIRECT, in direct2indirect()
115 if (search_for_position_by_key(sb, &end_key, path) == in direct2indirect()
118 "direct item (%K) not found", &end_key); in direct2indirect()
122 &end_key, p_le_ih); in direct2indirect()
[all …]
|
| /linux-6.1.9/tools/testing/selftests/bpf/ |
| D | test_lru_map.c | 241 unsigned long long key, end_key, value[nr_cpus]; in test_lru_sanity1() local
269 end_key = 1 + tgt_free; in test_lru_sanity1()
270 for (key = 1; key < end_key; key++) in test_lru_sanity1()
275 end_key = 1 + batch_size; in test_lru_sanity1()
276 for (key = 1; key < end_key; key++) { in test_lru_sanity1()
287 end_key = key + tgt_free; in test_lru_sanity1()
288 for (; key < end_key; key++) { in test_lru_sanity1()
318 unsigned long long end_key; in test_lru_sanity2() local
346 end_key = 1 + tgt_free; in test_lru_sanity2()
347 for (key = 1; key < end_key; key++) in test_lru_sanity2()
[all …]
|
| /linux-6.1.9/samples/bpf/ |
| D | test_lru_dist.c | 360 int start_key, end_key; in test_lru_loss0() local
365 end_key = min(key, 900); in test_lru_loss0()
367 while (start_key <= end_key) { in test_lru_loss0()
|
| /linux-6.1.9/drivers/md/persistent-data/ |
| D | dm-btree-remove.c | 687 uint64_t *keys, uint64_t end_key, in remove_one() argument
725 if (k >= keys[last_level] && k < end_key) { in remove_one()
744 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves() argument
751 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
|
| D | dm-btree.h | 151 uint64_t *keys, uint64_t end_key,
|