Home
last modified time | relevance | path

Searched refs:item2 (Results 1 – 3 of 3) sorted by relevance

/Linux-v4.19/tools/testing/radix-tree/
Dmultiorder.c151 struct item *item2 = item_create(min, order); in multiorder_check() local
168 assert(radix_tree_insert(&tree, i, item2) == -EEXIST); in multiorder_check()
172 radix_tree_replace_slot(&tree, slot, item2); in multiorder_check()
368 void *item, *item2 = item_create(index + 1, order1); in multiorder_join1() local
373 radix_tree_join(&tree, index + 1, order1, item2); in multiorder_join1()
378 assert(item == item2); in multiorder_join1()
391 void *item2; in multiorder_join2() local
395 item2 = __radix_tree_lookup(&tree, 1 << order2, &node, NULL); in multiorder_join2()
396 assert(item2 == (void *)0x12UL); in multiorder_join2()
399 item2 = radix_tree_lookup(&tree, 0); in multiorder_join2()
[all …]
Dbenchmark.c195 void *item, *item2 = item_create(index + 1, order1); in __benchmark_join() local
202 radix_tree_join(&tree, index + 1, order1, item2); in __benchmark_join()
/Linux-v4.19/fs/btrfs/
Ddelayed-inode.c54 struct btrfs_delayed_item *item2) in btrfs_is_continuous_delayed_item() argument
57 item1->key.objectid == item2->key.objectid && in btrfs_is_continuous_delayed_item()
58 item1->key.type == item2->key.type && in btrfs_is_continuous_delayed_item()
59 item1->key.offset + 1 == item2->key.offset) in btrfs_is_continuous_delayed_item()