Home
last modified time | relevance | path

Searched refs:data_sizes (Results 1 – 6 of 6) sorted by relevance

/linux/tools/testing/selftests/bpf/prog_tests/
H A Dtest_bpf_ma.c28 for (i = 0; i < ARRAY_SIZE(skel->rodata->data_sizes); i++) { in do_bpf_ma_test()
29 snprintf(tname, sizeof(tname), "bin_data_%u", skel->rodata->data_sizes[i]); in do_bpf_ma_test()
/linux/fs/btrfs/
H A Dctree.h627 const u32 *data_sizes; member
630 * setting up the data_sizes array, so it ends up being more efficient
638 /* Size of the keys and data_sizes arrays (number of items in the batch). */
663 batch.data_sizes = &data_size; in btrfs_insert_empty_item()
H A Ddelayed-inode.c708 batch.data_sizes = &first_data_size; in btrfs_insert_delayed_item()
723 batch.data_sizes = ins_sizes; in btrfs_insert_delayed_item()
H A Dctree.c4227 data_end -= batch->data_sizes[i]; in setup_items_for_insert()
4229 btrfs_set_item_size(leaf, slot + i, batch->data_sizes[i]); in setup_items_for_insert()
4259 batch.data_sizes = &data_size; in btrfs_setup_item_for_insert()
H A Dtree-log.c3660 batch.data_sizes = &item_size; in flush_dir_items_batch()
3674 batch.data_sizes = ins_sizes; in flush_dir_items_batch()
4438 batch.data_sizes = ins_sizes; in copy_items()
6141 batch.data_sizes = ins_sizes; in log_delayed_insertion_items()
H A Dinode.c6506 batch.data_sizes = &sizes[0]; in btrfs_create_new_inode()