Searched refs:leaf (Results 26 - 50 of 174) sorted by relevance

1234567

/linux-master/fs/proc/
H A Dbootconfig.c28 struct xbc_node *leaf, *vnode; local
38 xbc_for_each_key_value(leaf, val) {
39 ret = xbc_node_compose_key(leaf, key, XBC_KEYLEN_MAX);
46 vnode = xbc_node_get_child(leaf);
/linux-master/fs/btrfs/
H A Draid-stripe-tree.c22 struct extent_buffer *leaf; local
51 leaf = path->nodes[0];
53 btrfs_item_key_to_cpu(leaf, &key, slot);
159 struct extent_buffer *leaf; local
192 leaf = path->nodes[0];
195 btrfs_item_key_to_cpu(leaf, &found_key, slot);
223 num_stripes = btrfs_num_raid_stripes(btrfs_item_size(leaf, slot));
224 stripe_extent = btrfs_item_ptr(leaf, slot, struct btrfs_stripe_extent);
225 encoding = btrfs_stripe_extent_encoding(leaf, stripe_extent);
238 u64 devid = btrfs_raid_stride_devid(leaf, strid
[all...]
H A Droot-tree.c219 struct extent_buffer *leaf; local
243 leaf = path->nodes[0];
244 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
250 leaf = path->nodes[0];
253 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
350 struct extent_buffer *leaf; local
367 leaf = path->nodes[0];
368 ref = btrfs_item_ptr(leaf, path->slots[0],
371 if ((btrfs_root_ref_dirid(leaf, ref) != dirid) ||
372 (btrfs_root_ref_name_len(leaf, re
424 struct extent_buffer *leaf; local
[all...]
H A Dctree.c54 * The leaf data grows from end-to-front in the node. this returns the address
55 * of the start of the last item, which is the stop of the leaf data stack.
57 static unsigned int leaf_data_end(const struct extent_buffer *leaf) argument
59 u32 nr = btrfs_header_nritems(leaf);
62 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info);
63 return btrfs_item_offset(leaf, nr - 1);
67 * Move data in a @leaf (using memmove, safe for overlapping ranges).
69 * @leaf: leaf that we're doing a memmove on
75 * the leaf
79 memmove_leaf_data(const struct extent_buffer *leaf, unsigned long dst_offset, unsigned long src_offset, unsigned long len) argument
122 memmove_leaf_items(const struct extent_buffer *leaf, int dst_item, int src_item, int nr_items) argument
1842 struct extent_buffer *leaf = path->nodes[0]; local
2437 struct extent_buffer *leaf; local
3081 btrfs_leaf_free_space(const struct extent_buffer *leaf) argument
3837 struct extent_buffer *leaf; local
3903 struct extent_buffer *leaf; local
4006 struct extent_buffer *leaf; local
4098 struct extent_buffer *leaf; local
4173 struct extent_buffer *leaf; local
4318 struct extent_buffer *leaf; local
4348 struct extent_buffer *leaf; local
4434 btrfs_del_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *leaf) argument
4467 struct extent_buffer *leaf; local
5011 struct extent_buffer *leaf; local
5052 struct extent_buffer *leaf; local
[all...]
H A Dexport.c152 struct extent_buffer *leaf; local
191 leaf = path->nodes[0];
193 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
200 ref = btrfs_item_ptr(leaf, path->slots[0],
202 key.objectid = btrfs_root_ref_dirid(leaf, ref);
229 struct extent_buffer *leaf; local
268 leaf = path->nodes[0];
271 rref = btrfs_item_ptr(leaf, path->slots[0],
274 name_len = btrfs_root_ref_name_len(leaf, rref);
276 iref = btrfs_item_ptr(leaf, pat
[all...]
H A Dextent-tree.c52 struct extent_buffer *leaf,
108 struct extent_buffer *leaf; local
160 leaf = path->nodes[0];
161 item_size = btrfs_item_size(leaf, path->slots[0]);
163 ei = btrfs_item_ptr(leaf, path->slots[0],
165 num_refs = btrfs_extent_refs(leaf, ei);
166 extent_flags = btrfs_extent_flags(leaf, ei);
167 owner = btrfs_get_extent_owner_root(fs_info, leaf,
312 * - number of pointers in the tree leaf
315 * the tree leaf
419 hash_extent_data_ref_item(struct extent_buffer *leaf, struct btrfs_extent_data_ref *ref) argument
427 match_extent_data_ref(struct extent_buffer *leaf, struct btrfs_extent_data_ref *ref, u64 root_objectid, u64 owner, u64 offset) argument
447 struct extent_buffer *leaf; local
520 struct extent_buffer *leaf; local
599 struct extent_buffer *leaf; local
641 struct extent_buffer *leaf; local
787 struct extent_buffer *leaf; local
994 struct extent_buffer *leaf; local
1084 struct extent_buffer *leaf = path->nodes[0]; local
1470 struct extent_buffer *leaf; local
1589 __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, struct extent_buffer *leaf, struct btrfs_extent_item *ei) argument
1616 struct extent_buffer *leaf; local
2349 struct extent_buffer *leaf; local
2925 btrfs_get_extent_owner_root(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, int slot) argument
3076 struct extent_buffer *leaf; local
4790 struct extent_buffer *leaf; local
4865 struct extent_buffer *leaf; local
[all...]
H A Dfile.c207 struct extent_buffer *leaf; local
256 leaf = path->nodes[0];
257 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
264 leaf = path->nodes[0];
265 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
274 leaf = path->nodes[0];
278 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
291 fi = btrfs_item_ptr(leaf, path->slots[0],
293 extent_type = btrfs_file_extent_type(leaf, fi);
297 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, f
561 extent_mergeable(struct extent_buffer *leaf, int slot, u64 objectid, u64 bytenr, u64 orig_offset, u64 *start, u64 *end) argument
605 struct extent_buffer *leaf; local
2227 hole_mergeable(struct btrfs_inode *inode, struct extent_buffer *leaf, int slot, u64 start, u64 end) argument
2262 struct extent_buffer *leaf; local
2434 struct extent_buffer *leaf; local
3728 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Dprops.c164 struct extent_buffer *leaf; local
170 leaf = path->nodes[0];
172 if (slot >= btrfs_header_nritems(leaf)) {
181 btrfs_item_key_to_cpu(leaf, &key, slot);
191 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
193 total_len = btrfs_item_size(leaf, slot);
196 u32 name_len = btrfs_dir_name_len(leaf, di);
197 u32 data_len = btrfs_dir_data_len(leaf, di);
206 memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX,
220 read_extent_buffer(leaf, name_bu
[all...]
H A Dinode-item.h112 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf,
116 struct extent_buffer *leaf, int slot, u64 ref_objectid,
H A Dfree-space-tree.c76 struct extent_buffer *leaf; local
87 leaf = path->nodes[0];
88 info = btrfs_item_ptr(leaf, path->slots[0],
90 btrfs_set_free_space_extent_count(leaf, info, 0);
91 btrfs_set_free_space_flags(leaf, info, 0);
92 btrfs_mark_buffer_dirty(trans, leaf);
213 struct extent_buffer *leaf; local
242 leaf = path->nodes[0];
246 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1);
285 leaf
351 struct extent_buffer *leaf; local
517 struct extent_buffer *leaf; local
542 struct extent_buffer *leaf; local
1414 struct extent_buffer *leaf; local
[all...]
H A Dverity.c222 struct extent_buffer *leaf; local
246 * Insert 2K at a time mostly to be friendly for smaller leaf
257 leaf = path->nodes[0];
259 data = btrfs_item_ptr(leaf, path->slots[0], void);
260 write_extent_buffer(leaf, src + src_offset,
301 struct extent_buffer *leaf; local
335 leaf = path->nodes[0];
336 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
341 item_end = btrfs_item_size(leaf, path->slots[0]) + key.offset;
377 data = btrfs_item_ptr(leaf, pat
[all...]
/linux-master/fs/unicode/
H A Dmkutf8data.c123 * node, otherwise it is a leaf node
148 * leaf[0]: The unicode version, stored as a generation number that is
152 * leaf[1]: Canonical Combining Class. During normalization, we need
160 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
383 void *leaf = NULL; local
386 while (!leaf && node) {
394 leaf = node->right;
403 leaf
533 insert(struct tree *tree, char *key, int keylen, void *leaf) argument
1417 struct unicode_data *leaf = l; local
1432 struct unicode_data *leaf = l; local
1453 struct unicode_data *leaf = l; local
1462 struct unicode_data *leaf = l; local
1469 struct unicode_data *leaf = l; local
1481 struct unicode_data *leaf = l; local
1495 struct unicode_data *leaf = l; local
1502 struct unicode_data *leaf = l; local
1509 struct unicode_data *leaf = l; local
1530 struct unicode_data *leaf = l; local
1748 utf8leaf_t *leaf; local
2805 utf8leaf_t *leaf; local
2832 utf8leaf_t *leaf; local
2858 utf8leaf_t *leaf; local
2885 utf8leaf_t *leaf; local
2914 utf8leaf_t *leaf; local
2941 utf8leaf_t *leaf; local
3059 utf8leaf_t *leaf; local
[all...]
/linux-master/tools/testing/selftests/bpf/progs/
H A Dxdpwall.c118 __u8 *leaf; local
120 leaf = bpf_map_lookup_elem(&v6_addr_map, ipv6addr);
122 return leaf ? *leaf : 0;
127 __u8 *leaf; local
129 leaf = bpf_map_lookup_elem(&v4_addr_map, &ipaddr);
131 return leaf ? *leaf : 0;
221 __u8 *leaf = bpf_map_lookup_elem(&tcp_port_map, &port); local
223 return leaf
228 __u16 *leaf = bpf_map_lookup_elem(&udp_port_map, &port); local
[all...]
/linux-master/drivers/net/can/usb/kvaser_usb/
H A Dkvaser_usb_leaf.c3 * - Kvaser linux leaf driver (version 4.78)
180 } __packed leaf; member in union:kvaser_cmd_tx_can::__anon1598
350 } __packed leaf; member in union:kvaser_cmd::__anon1601
374 [CMD_GET_SOFTWARE_INFO_REPLY] = kvaser_fsize(u.leaf.softinfo),
375 [CMD_RX_STD_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
376 [CMD_RX_EXT_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
377 [CMD_LEAF_LOG_MESSAGE] = kvaser_fsize(u.leaf.log_message),
378 [CMD_CHIP_STATE_EVENT] = kvaser_fsize(u.leaf.chip_state_event),
379 [CMD_CAN_ERROR_EVENT] = kvaser_fsize(u.leaf.can_error_event),
380 [CMD_GET_CAPABILITIES_RESP] = kvaser_fsize(u.leaf
417 } leaf; member in union:kvaser_usb_err_summary::__anon1604
958 struct kvaser_usb_net_leaf_priv *leaf = local
971 struct kvaser_usb_net_leaf_priv *leaf = priv->sub_priv; local
1054 struct kvaser_usb_net_leaf_priv *leaf; local
1635 struct kvaser_usb_net_leaf_priv *leaf = priv->sub_priv; local
1656 struct kvaser_usb_net_leaf_priv *leaf = priv->sub_priv; local
1711 struct kvaser_usb_net_leaf_priv *leaf; local
1728 struct kvaser_usb_net_leaf_priv *leaf = priv->sub_priv; local
1784 struct kvaser_usb_net_leaf_priv *leaf = priv->sub_priv; local
[all...]
/linux-master/drivers/infiniband/hw/irdma/
H A Dpble.c312 struct irdma_pble_info *leaf = lvl2->leaf; local
314 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) {
315 if (leaf->addr)
317 &leaf->chunkinfo);
326 lvl2->leaf = NULL;
342 struct irdma_pble_info *leaf; local
352 lvl2->leafmem.size = (sizeof(*leaf) * total);
357 lvl2->leaf = lvl2->leafmem.va;
358 leaf
[all...]
/linux-master/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c38 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
76 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
82 * of an attr leaf block. The region starts at the tail of the block and expands
84 * size for an empty leaf block and is reduced from there.
242 struct xfs_attr_leafblock *leaf,
270 lentry = xfs_attr3_leaf_name_local(leaf, idx);
277 rentry = xfs_attr3_leaf_name_remote(leaf, idx);
294 * Validate an attribute leaf block.
296 * Empty leaf blocks can occur under the following circumstances:
301 * 4. The attribute is small enough to fit in a leaf bloc
239 xfs_attr3_leaf_verify_entry( struct xfs_mount *mp, char *buf_end, struct xfs_attr_leafblock *leaf, struct xfs_attr3_icleaf_hdr *leafhdr, struct xfs_attr_leaf_entry *ent, int idx, __u32 *last_hashval) argument
316 struct xfs_attr_leafblock *leaf = bp->b_addr; local
1019 struct xfs_attr_leafblock *leaf; local
1129 struct xfs_attr_leafblock *leaf; local
1219 struct xfs_attr_leafblock *leaf; local
1293 struct xfs_attr_leafblock *leaf; local
1404 struct xfs_attr_leafblock *leaf; local
1485 struct xfs_attr_leafblock *leaf; local
2004 struct xfs_attr_leafblock *leaf; local
2131 struct xfs_attr_leafblock *leaf; local
2410 struct xfs_attr_leafblock *leaf; local
2525 struct xfs_attr_leafblock *leaf; local
2732 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) argument
2787 struct xfs_attr_leafblock *leaf; local
2854 struct xfs_attr_leafblock *leaf; local
[all...]
H A Dxfs_dir2_leaf.c105 struct xfs_dir2_leaf *leaf = bp->b_addr; local
108 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf);
117 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false);
143 struct xfs_dir2_leaf *leaf,
153 ltp = xfs_dir2_leaf_tail_p(geo, leaf);
163 /* Leaves and bests don't overlap in leaf format. */
191 * We verify the magic numbers before decoding the leaf header so that on debug
354 * Initialize a new leaf block, leaf1 or leafn magic accepted.
364 struct xfs_dir2_leaf *leaf = bp->b_addr; local
380 memset(leaf,
140 xfs_dir3_leaf_check_int( struct xfs_mount *mp, struct xfs_dir3_icleaf_hdr *hdr, struct xfs_dir2_leaf *leaf, bool expensive_checking) argument
447 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
674 struct xfs_dir2_leaf *leaf; /* leaf structure */ local
978 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1123 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1150 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1172 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1192 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1281 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1412 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1660 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1746 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
/linux-master/tools/testing/selftests/cgroup/
H A Dtest_cpu.c411 struct cpu_hogger leaf[3] = {}; local
442 for (i = 0; i < ARRAY_SIZE(leaf); i++) {
453 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i);
454 if (!leaf[i].cgroup)
457 if (cg_create(leaf[i].cgroup))
460 if (cg_write_numeric(leaf[i].cgroup, "cpu.weight", weight))
464 for (i = 0; i < ARRAY_SIZE(leaf); i++) {
475 pid = cg_run_nowait(leaf[i].cgroup, hog_cpus_timed,
479 leaf[i].pid = pid;
482 for (i = 0; i < ARRAY_SIZE(leaf);
[all...]
/linux-master/arch/loongarch/include/asm/
H A Dcacheflush.h57 static inline void flush_cache_line(int leaf, unsigned long addr) argument
59 switch (leaf) {
/linux-master/fs/xfs/scrub/
H A Dlistxattr.c52 /* Call a function for every entry in this xattr leaf block. */
63 struct xfs_attr_leafblock *leaf = bp->b_addr; local
68 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
69 entry = xfs_attr3_leaf_entryp(leaf);
79 name_loc = xfs_attr3_leaf_name_local(leaf, i);
87 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
105 * Call a function for every entry in a leaf-format xattr structure. Avoid
127 /* Find the leftmost leaf in the xattr dabtree. */
205 /* Remember that we've seen this leaf. */
230 struct xfs_attr_leafblock *leaf; local
[all...]
/linux-master/net/ipv6/
H A Dip6_fib.c247 rcu_assign_pointer(table->tb6_root.leaf,
464 err = fib6_rt_dump(w->leaf, w->args);
465 w->leaf = NULL;
527 w->leaf = rt;
548 w->leaf = NULL;
766 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, local
768 key = (struct rt6key *)((u8 *)leaf + offset);
794 RCU_INIT_POINTER(fn->leaf, NULL);
795 fib6_info_release(leaf);
1051 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, local
1078 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, local
1596 struct fib6_info *leaf = rcu_dereference(fn->leaf); local
1679 struct fib6_info *leaf = rcu_dereference(fn->leaf); local
1922 struct fib6_info *leaf, *replace_rt = NULL; local
[all...]
/linux-master/drivers/gpu/drm/i915/selftests/
H A Di915_syncmap.c146 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno) argument
148 if (leaf->height) {
149 pr_err("%s: not a leaf, height is %d\n",
150 __func__, leaf->height);
154 if (__sync_seqno(leaf)[idx] != seqno) {
156 __func__, idx, __sync_seqno(leaf)[idx], seqno);
172 pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n",
211 * Check that inserting a new id, creates a leaf and only that leaf.
247 pr_err("Inserting context=%llx did not return leaf (heigh
508 struct i915_syncmap *leaf = __sync_child(sync)[idx]; local
[all...]
/linux-master/fs/btrfs/tests/
H A Dqgroup-tests.c24 struct extent_buffer *leaf; local
48 leaf = path->nodes[0];
49 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
50 btrfs_set_extent_refs(leaf, item, 1);
51 btrfs_set_extent_generation(leaf, item, 1);
52 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_TREE_BLOCK);
54 btrfs_set_tree_block_level(leaf, block_info, 0);
57 btrfs_set_extent_inline_ref_type(leaf, iref,
59 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
61 btrfs_set_extent_inline_ref_type(leaf, ire
[all...]
/linux-master/fs/gfs2/
H A Ddir.c34 * beginning of the leaf block. The dirents reside in leaves when
41 * used as an array of 64-bit block pointers pointing to the leaf blocks. The
43 * block pointer in the array that points to the same leaf. In fact, when a
45 * point to the same leaf.
47 * When a leaf is completely full, the size of the hash table can be
773 * get_leaf_nr - Get a leaf number associated with the index
775 * @index: hash table index of the targeted leaf
776 * @leaf_out: Resulting leaf block number
819 struct gfs2_leaf *leaf; local
837 leaf
870 struct gfs2_leaf *leaf; local
914 struct gfs2_leaf *leaf; local
1378 unsigned leaves = 0, leaf = 0, offset, sort_offset; local
1730 struct gfs2_leaf *leaf, *oleaf; local
1805 struct gfs2_leaf *leaf; local
1904 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data; local
2106 struct gfs2_leaf *leaf; local
[all...]
/linux-master/arch/x86/kvm/vmx/
H A Dsgx.c359 static inline bool encls_leaf_enabled_in_guest(struct kvm_vcpu *vcpu, u32 leaf) argument
365 if (leaf >= ECREATE && leaf <= ETRACK)
368 if (leaf >= EAUG && leaf <= EMODT)
383 u32 leaf = (u32)kvm_rax_read(vcpu); local
388 } else if (!encls_leaf_enabled_in_guest(vcpu, leaf) ||
392 if (leaf == ECREATE)
394 if (leaf == EINIT)
396 WARN_ONCE(1, "unexpected exit on ENCLS[%u]", leaf);
[all...]

Completed in 430 milliseconds

1234567