| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A 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()
112 * end_key.k_offset is set so, that we will always have found 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()
[all...] |
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A 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()
112 * end_key.k_offset is set so, that we will always have found 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()
[all...] |
| /kernel/linux/linux-5.10/tools/testing/selftests/bpf/ |
| H A D | test_lru_map.c | 250 unsigned long long key, end_key, value[nr_cpus]; in test_lru_sanity1() local
278 end_key = 1 + tgt_free; in test_lru_sanity1()
279 for (key = 1; key < end_key; key++) in test_lru_sanity1()
284 end_key = 1 + batch_size; in test_lru_sanity1()
285 for (key = 1; key < end_key; key++) { in test_lru_sanity1()
296 end_key = key + tgt_free; in test_lru_sanity1()
297 for (; key < end_key; key++) { in test_lru_sanity1()
327 unsigned long long end_key; in test_lru_sanity2() local
355 end_key = 1 + tgt_free; in test_lru_sanity2()
356 for (key = 1; key < end_key; ke in test_lru_sanity2()
434 unsigned long long key, end_key, value[nr_cpus]; test_lru_sanity3() local
500 unsigned long long end_key; test_lru_sanity4() local
[all...] |
| /kernel/linux/linux-6.6/tools/testing/selftests/bpf/ |
| H A 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; ke in test_lru_sanity2()
424 unsigned long long key, end_key, value[nr_cpus]; test_lru_sanity3() local
490 unsigned long long end_key; test_lru_sanity4() local
[all...] |
| /kernel/linux/linux-5.10/drivers/md/persistent-data/ |
| H A D | dm-btree-remove.c | 616 uint64_t *keys, uint64_t end_key, in remove_one()
654 if (k >= keys[last_level] && k < end_key) { in remove_one()
673 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves()
680 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
615 remove_one(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, uint64_t end_key, dm_block_t *new_root, unsigned *nr_removed) remove_one() argument
672 dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, uint64_t *first_key, uint64_t end_key, dm_block_t *new_root, unsigned *nr_removed) dm_btree_remove_leaves() argument
|
| H A D | dm-btree.h | 147 * 'end_key'). 'end_key' is the one-past-the-end value. 'keys' may be
151 uint64_t *keys, uint64_t end_key,
|
| /kernel/linux/linux-5.10/samples/bpf/ |
| H A D | test_lru_dist.c | 358 int start_key, end_key; in test_lru_loss0() local
363 end_key = min(key, 900); in test_lru_loss0()
365 while (start_key <= end_key) { in test_lru_loss0()
|
| /kernel/linux/linux-6.6/samples/bpf/ |
| H A D | test_lru_dist.c | 355 int start_key, end_key; in test_lru_loss0() local
360 end_key = min(key, 900); in test_lru_loss0()
362 while (start_key <= end_key) { in test_lru_loss0()
|
| /kernel/linux/linux-6.6/drivers/md/persistent-data/ |
| H A D | dm-btree.h | 148 * 'end_key'). 'end_key' is the one-past-the-end value. 'keys' may be
152 uint64_t *keys, uint64_t end_key,
|
| H A D | dm-btree-remove.c | 693 uint64_t *keys, uint64_t end_key, in remove_one()
731 if (k >= keys[last_level] && k < end_key) { in remove_one()
750 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves()
757 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
692 remove_one(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, uint64_t end_key, dm_block_t *new_root, unsigned int *nr_removed) remove_one() argument
749 dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, uint64_t *first_key, uint64_t end_key, dm_block_t *new_root, unsigned int *nr_removed) dm_btree_remove_leaves() argument
|
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| H A D | xfs_btree.c | 5031 union xfs_btree_key end_key; member
5130 xfs_btree_key_from_irec(cur, &info.end_key, high); in xfs_btree_has_records()
5147 if (xfs_btree_masked_keycmp_ge(cur, &info.high_key, &info.end_key, in xfs_btree_has_records()
|