Searched refs:leaf (Results 1 - 25 of 172) sorted by last modified time

1234567

/linux-master/net/sched/
H A Dsch_taprio.c2505 .leaf = taprio_leaf,
H A Dsch_sfq.c58 should be used as leaf of CBQ or P3, which put interactive traffic
909 .leaf = sfq_leaf,
H A Dsch_skbprio.c276 .leaf = skbprio_leaf,
H A Dsch_htb.c90 /* interior & leaf nodes; props specific to leaves are marked L:
101 int quantum; /* but stored for parent-to-leaf return */
128 } leaf; member in union:htb_class::__anon3448
211 * should be passed directly thru. In all other cases leaf class is returned.
216 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
238 /* Start with inner filter chain if a non-leaf class is selected */
266 return cl; /* we hit leaf; return it */
584 * htb_activate - inserts leaf cl into appropriate active feeds
588 * Routine learns (new) priority of leaf an
[all...]
H A Dsch_mqprio.c756 .leaf = mqprio_leaf,
H A Dsch_hfsc.c125 struct Qdisc *qdisc; /* leaf qdisc */
296 * get the leaf class with the minimum vt in the hierarchy
1169 return cl; /* hit leaf class */
1656 .leaf = hfsc_class_leaf,
H A Dsch_fq_codel.c708 .leaf = fq_codel_leaf,
H A Dsch_ets.c793 .leaf = ets_class_leaf,
H A Dsch_cake.c3097 .leaf = cake_leaf,
H A Dsch_cbs.c529 .leaf = cbs_leaf,
H A Dsch_api.c155 if (!(cops->find && cops->walk && cops->leaf))
348 return cops->leaf(p, cl);
1475 struct Qdisc *leaf; local
1479 leaf = cops->leaf(q, cl);
1480 if (leaf) {
1481 if (leaf == arg->p || arg->depth > 7)
1483 return check_loop(leaf, arg->p, arg->depth + 1);
/linux-master/net/ipv6/
H A Droute.c844 static void find_rr_leaf(struct fib6_node *fn, struct fib6_info *leaf, argument
855 __find_rr_leaf(leaf, rr_head, metric, res, &cont,
868 struct fib6_info *leaf = rcu_dereference(fn->leaf); local
876 if (!leaf || leaf == net->ipv6.fib6_null_entry)
881 rt0 = leaf;
884 * and fn->leaf does not points to its child's leaf
896 find_rr_leaf(fn, leaf, rt
5207 struct fib6_info *leaf; local
[all...]
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/include/net/
H A Dsch_generic.h253 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl); member in struct:Qdisc_class_ops
H A Dip6_fib.h74 struct fib6_info __rcu *leaf; member in struct:fib6_node
230 for (rt = rcu_dereference((fn)->leaf); rt; \
234 for (rt = (w)->leaf; rt; \
360 struct fib6_info *leaf; member in struct:fib6_walker
/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/fs/btrfs/
H A Dxattr.c33 struct extent_buffer *leaf; local
52 leaf = path->nodes[0];
55 ret = btrfs_dir_data_len(leaf, di);
60 if (btrfs_dir_data_len(leaf, di) > size) {
66 * The way things are packed into the leaf is like this
70 * where the data starts in the in memory leaf
73 btrfs_dir_name_len(leaf, di));
74 read_extent_buffer(leaf, buffer, data_ptr,
75 btrfs_dir_data_len(leaf, di));
76 ret = btrfs_dir_data_len(leaf, d
173 struct extent_buffer *leaf = path->nodes[0]; local
304 struct extent_buffer *leaf; local
[all...]
H A Dvolumes.c1766 struct extent_buffer *leaf = NULL; local
1783 leaf = path->nodes[0];
1784 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1785 extent = btrfs_item_ptr(leaf, path->slots[0],
1788 btrfs_dev_extent_length(leaf, extent) < start);
1793 leaf = path->nodes[0];
1794 extent = btrfs_item_ptr(leaf, path->slots[0],
1800 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1881 struct extent_buffer *leaf; local
1900 leaf
2565 struct extent_buffer *leaf; local
2888 struct extent_buffer *leaf; local
3424 struct extent_buffer *leaf; local
3593 struct extent_buffer *leaf; local
3812 chunk_devid_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3839 chunk_drange_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3875 chunk_vrange_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, u64 chunk_offset, struct btrfs_balance_args *bargs) argument
3888 chunk_stripes_range_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3916 should_balance_chunk(struct extent_buffer *leaf, struct btrfs_chunk *chunk, u64 chunk_offset) argument
4014 struct extent_buffer *leaf; local
4639 struct extent_buffer *leaf; local
7045 read_one_chunk(struct btrfs_key *key, struct extent_buffer *leaf, struct btrfs_chunk *chunk) argument
7149 fill_device_from_item(struct extent_buffer *leaf, struct btrfs_dev_item *dev_item, struct btrfs_device *device) argument
7226 read_one_dev(struct extent_buffer *leaf, struct btrfs_dev_item *dev_item) argument
7513 struct extent_buffer *leaf; local
8156 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Dtree-log.c390 * we'll have to clone the leaf in the path, release the path and use
391 * the leaf before writing into the log tree. See the comments at
682 struct extent_buffer *leaf; local
684 leaf = path->nodes[0];
685 existing = btrfs_item_ptr(leaf, path->slots[0],
690 read_extent_buffer(leaf, &cmp2, (unsigned long)existing,
934 struct extent_buffer *leaf; local
938 leaf = path->nodes[0];
940 btrfs_dir_item_key_to_cpu(leaf, di, &location);
941 ret = read_alloc_one_name(leaf, d
1060 struct extent_buffer *leaf; local
1497 struct extent_buffer *leaf; local
4169 fill_inode_item(struct btrfs_trans_handle *trans, struct extent_buffer *leaf, struct btrfs_inode_item *item, struct inode *inode, int log_inode_only, u64 logged_isize) argument
4688 struct extent_buffer *leaf; local
4782 struct extent_buffer *leaf; local
5073 struct extent_buffer *leaf = path->nodes[0]; local
5149 struct extent_buffer *leaf = path->nodes[0]; local
5473 struct extent_buffer *leaf = path->nodes[0]; local
6186 struct extent_buffer *leaf = path->nodes[0]; local
6748 struct extent_buffer *leaf = path->nodes[0]; local
6856 struct extent_buffer *leaf; local
6981 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Dtree-checker.c10 * The objective is to do leaf/node validation checks when tree block is read
38 * @type: leaf or node
39 * @identifier: the necessary info to locate the leaf/node.
51 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
71 btrfs_header_level(eb) == 0 ? "leaf" : "node",
99 btrfs_header_level(eb) == 0 ? "leaf" : "node",
109 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \
111 if (unlikely(!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), \
113 file_extent_err((leaf), (slot), \
115 (#name), btrfs_file_extent_##name((leaf), (f
120 file_extent_end(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_file_extent_item *extent) argument
175 check_prev_ino(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
206 check_extent_data_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
346 check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
392 check_inode_key(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
444 check_root_key(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
502 check_dir_item(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) argument
662 check_block_group_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
750 chunk_err(const struct extent_buffer *leaf, const struct btrfs_chunk *chunk, u64 logical, const char *fmt, ...) argument
799 btrfs_check_chunk_valid(struct extent_buffer *leaf, struct btrfs_chunk *chunk, u64 logical) argument
963 check_leaf_chunk_item(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_key *key, int slot) argument
1019 check_dev_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
1066 check_inode_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
1155 check_root_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
1274 check_extent_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
1560 check_simple_keyed_refs(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
1591 check_extent_data_ref(struct extent_buffer *leaf, struct btrfs_key *key, int slot) argument
1632 check_inode_ref(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) argument
1682 check_raid_stripe_extent(const struct extent_buffer *leaf, const struct btrfs_key *key, int slot) argument
1723 check_leaf_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
1784 __btrfs_check_leaf(struct extent_buffer *leaf) argument
1935 btrfs_check_leaf(struct extent_buffer *leaf) argument
[all...]
H A Dsend.c92 * cloning roots that lead down to a leaf is more than 17.
104 * A backref cache entry maps a leaf to a list of IDs of roots from which the
105 * leaf is accessible and we can use for clone operations.
1138 * space, which can happen for xattrs on a fs with a leaf size greater
1499 * backref walking to determine which roots have a path to the leaf.
1523 const struct extent_buffer *leaf, void *ctx)
1525 const u64 refs = btrfs_extent_refs(leaf, ei);
1530 const u64 flags = btrfs_extent_flags(leaf, ei);
1671 * ranges can't overlap and in case the leaf is shared through a subtree
2520 struct extent_buffer *leaf; local
1522 check_extent_item(u64 bytenr, const struct btrfs_extent_item *ei, const struct extent_buffer *leaf, void *ctx) argument
3918 struct extent_buffer *leaf = path->nodes[0]; local
5546 struct extent_buffer *leaf = path->nodes[0]; local
5611 struct extent_buffer *leaf = path->nodes[0]; local
5713 struct extent_buffer *leaf = path->nodes[0]; local
5837 struct extent_buffer *leaf; local
5962 struct extent_buffer *leaf = path->nodes[0]; local
6428 struct extent_buffer *leaf = path->nodes[0]; local
7174 struct extent_buffer *leaf; local
[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 Drelocation.c958 struct extent_buffer *leaf; local
975 leaf = path->nodes[0];
976 fi = btrfs_item_ptr(leaf, path->slots[0],
979 BUG_ON(btrfs_file_extent_offset(leaf, fi) ||
980 btrfs_file_extent_compression(leaf, fi) ||
981 btrfs_file_extent_encryption(leaf, fi) ||
982 btrfs_file_extent_other_encoding(leaf, fi));
984 if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) {
989 *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
997 * update file extent items in the tree leaf t
1001 replace_file_extents(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *root, struct extent_buffer *leaf) argument
1666 struct extent_buffer *leaf; local
3401 delete_v1_space_cache(struct extent_buffer *leaf, struct btrfs_block_group *block_group, u64 data_bytenr) argument
3497 struct extent_buffer *leaf; local
3828 struct extent_buffer *leaf; local
4221 struct extent_buffer *leaf; local
[all...]
H A Dreflink.c254 * If we end up here it means were copy the inline extent into a leaf
315 * write to the same leaf or an ordered extent completion needs to write
316 * to the same leaf.
342 struct extent_buffer *leaf; local
408 leaf = path->nodes[0];
411 btrfs_item_key_to_cpu(leaf, &key, slot);
418 extent = btrfs_item_ptr(leaf, slot,
420 extent_gen = btrfs_file_extent_generation(leaf, extent);
421 comp = btrfs_file_extent_compression(leaf, extent);
422 type = btrfs_file_extent_type(leaf, exten
[all...]
H A Dref-verify.c387 struct extent_buffer *leaf,
394 u64 ref_root = btrfs_extent_data_ref_root(leaf, dref);
395 u64 owner = btrfs_extent_data_ref_objectid(leaf, dref);
396 u64 offset = btrfs_extent_data_ref_offset(leaf, dref);
397 u32 num_refs = btrfs_extent_data_ref_count(leaf, dref);
440 struct extent_buffer *leaf = path->nodes[0]; local
441 u32 item_size = btrfs_item_size(leaf, slot);
446 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
447 flags = btrfs_extent_flags(leaf, ei);
454 *tree_block_level = btrfs_tree_block_level(leaf, inf
386 add_extent_data_ref(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_extent_data_ref *dref, u64 bytenr, u64 num_bytes) argument
508 struct extent_buffer *leaf = path->nodes[0]; local
[all...]

Completed in 778 milliseconds

1234567