Searched refs:leaf (Results 1 - 17 of 17) sorted by relevance

/u-boot/fs/btrfs/
H A Ddir-item.c12 struct extent_buffer *leaf,
16 u8 type = btrfs_dir_type(leaf, dir_item);
21 if (btrfs_dir_name_len(leaf, dir_item) > namelen) {
23 (unsigned)btrfs_dir_data_len(leaf, dir_item));
28 if ((btrfs_dir_data_len(leaf, dir_item) +
29 btrfs_dir_name_len(leaf, dir_item)) >
32 (unsigned)btrfs_dir_name_len(leaf, dir_item),
33 (unsigned)btrfs_dir_data_len(leaf, dir_item));
49 struct extent_buffer *leaf; local
51 leaf
11 verify_dir_item(struct btrfs_root *root, struct extent_buffer *leaf, struct btrfs_dir_item *dir_item) argument
90 struct extent_buffer *leaf; local
[all...]
H A Dvolumes.c386 struct extent_buffer *leaf,
403 btrfs_item_size_nr(leaf, slot) < sizeof(struct btrfs_chunk)) {
405 btrfs_item_size_nr(leaf, slot),
410 length = btrfs_chunk_length(leaf, chunk);
411 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
412 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
413 sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
414 type = btrfs_chunk_type(leaf, chunk);
422 btrfs_item_size_nr(leaf, slot)) {
424 btrfs_item_size_nr(leaf, slo
385 btrfs_check_chunk_valid(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_chunk *chunk, int slot, u64 logical) argument
515 read_one_chunk(struct btrfs_fs_info *fs_info, struct btrfs_key *key, struct extent_buffer *leaf, struct btrfs_chunk *chunk, int slot) argument
591 fill_device_from_item(struct extent_buffer *leaf, struct btrfs_dev_item *dev_item, struct btrfs_device *device) argument
611 read_one_dev(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_dev_item *dev_item) argument
743 struct extent_buffer *leaf; local
808 btrfs_stripe_length(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_chunk *chunk) argument
[all...]
H A Dinode.c364 struct extent_buffer *leaf = path->nodes[0]; local
372 csize = btrfs_file_extent_inline_item_len(leaf, btrfs_item_nr(slot));
373 if (btrfs_file_extent_compression(leaf, fi) == BTRFS_COMPRESS_NONE) {
375 read_extent_buffer(leaf, dest,
382 dsize = btrfs_file_extent_ram_bytes(leaf, fi);
389 read_extent_buffer(leaf, cbuf, btrfs_file_extent_inline_start(fi),
391 ret = btrfs_decompress(btrfs_file_extent_compression(leaf, fi),
424 struct extent_buffer *leaf = path->nodes[0]; local
425 struct btrfs_fs_info *fs_info = leaf->fs_info;
440 btrfs_item_key_to_cpu(leaf,
626 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Dctree.c148 fprintf(stderr, "leaf is not a leaf %llu\n",
154 fprintf(stderr, "leaf free space incorrect %llu %d\n",
167 fprintf(stderr, "leaf parent key incorrect %llu\n",
202 fprintf(stderr, "slot end outside of leaf %llu > %llu\n",
375 * if key is found, we return zero and you can find the item in the leaf
502 struct extent_buffer *leaf; local
511 * case the previous item is the last in a leaf, path points to the
512 * first free slot in the previous leaf, i.e. at an invalid item.
514 leaf
583 btrfs_leaf_free_space(struct extent_buffer *leaf) argument
713 struct extent_buffer *leaf; local
[all...]
H A Dvolumes.h198 struct extent_buffer *leaf,
202 struct extent_buffer *leaf,
H A Dctree.h1177 /* helper function to cast into the data area of the leaf. */
1178 #define btrfs_item_ptr(leaf, slot, type) \
1179 ((type *)(btrfs_leaf_data(leaf) + \
1180 btrfs_item_offset_nr(leaf, slot)))
1182 #define btrfs_item_ptr_offset(leaf, slot) \
1183 ((unsigned long)(btrfs_leaf_data(leaf) + \
1184 btrfs_item_offset_nr(leaf, slot)))
1202 struct btrfs_leaf leaf; member in union:btrfs_tree_node
1255 * Walk up the tree as far as necessary to find the next leaf.
1277 int btrfs_leaf_free_space(struct extent_buffer *leaf);
[all...]
/u-boot/test/py/tests/
H A Dtest_bind.py11 leaf = ''
13 leaf = ' ' + ' ' * (depth - 1)
15 leaf = leaf + r'\|'
17 leaf = leaf + '`'
19 leaf = leaf + '-- ' + name
21 .format(uclass, drv, leaf))
H A Dtest_fit.py122 def make_fname(leaf):
126 leaf: Leaf name of file to create (within temporary directory)
130 return os.path.join(cons.config.build_dir, leaf)
/u-boot/scripts/
H A Dstyle.py59 def process_caller(data, conv, module_name, leaf):
72 leaf: Leaf module name, e.g. 'command'
81 newdata, count = re.subn(fr'{leaf}.{name}\(',
82 f'{leaf}.{new_name}(', data)
103 newdata, count = re.subn(fr"{leaf}, '{name}'",
104 f"{leaf}, '{new_name}'", data)
124 module_name, leaf, prog = get_module_name(srcfile)
152 newdata = process_caller(fname, conv, module_name, leaf)
/u-boot/scripts/dtc/libfdt/
H A Dfdt_ro.c316 * give only the leaf name (after all /). The actual tree
319 const char *leaf; local
320 leaf = strrchr(nameptr, '/');
321 if (leaf == NULL) {
325 nameptr = leaf+1;
/u-boot/tools/u_boot_pylib/
H A Dtools.py564 leaf = url.split('/')[-1]
567 fname = os.path.join(tmpdir, leaf)
/u-boot/fs/ubifs/
H A Dtnc.c298 * lnc_add - add a leaf node to the leaf node cache.
300 * @zbr: zbranch of leaf node
301 * @node: leaf node
304 * purpose of the leaf node cache is to save re-reading the same leaf node over
307 * present implementation of the leaf node cache is extremely simple, and
324 ubifs_assert(!zbr->leaf);
340 zbr->leaf = lnc_node;
345 * lnc_add_directly - add a leaf nod
[all...]
H A Dubifs.h1156 * struct ubifs_pnode - LEB Properties Tree leaf node.
1344 void *leaf; member in union:ubifs_zbranch::__anon140
/u-boot/tools/patman/
H A Dgitutil.py151 leaf = merge.split('/', maxsplit=2)[2:]
152 return '%s/%s' % (remote, '/'.join(leaf)), None
/u-boot/tools/buildman/
H A Dboards.py238 leaf = os.path.basename(defconfig)
239 expect_target, match, rear = leaf.partition('_defconfig')
240 assert match and not rear, f'{leaf} : invalid defconfig'
265 f'WARNING: {leaf}: Duplicate TARGET_xxx: {target} and {tname}')
271 warnings.append(f'WARNING: {leaf}: No TARGET_{cfg_name} enabled')
H A Dbuilder.py1738 leaf = dirname[len(self.base_dir) + 1:]
1739 m = re.match('[0-9]+_g[0-9a-f]+_.*', leaf)
/u-boot/tools/
H A Dqconfig.py1380 dirname, leaf = os.path.split(fname)
1381 root, ext = os.path.splitext(leaf)

Completed in 274 milliseconds