Home
last modified time | relevance | path

Searched full:leaf (Results 1 – 25 of 503) sorted by relevance

12345678910>>...21

/linux/fs/btrfs/
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", in generic_err()
99 btrfs_header_level(eb) == 0 ? "leaf" : "node", in file_extent_err()
109 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \ argument
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) file_extent_end() argument
175 check_prev_ino(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_prev_ino() argument
207 check_extent_data_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_extent_data_item() argument
365 check_csum_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_csum_item() argument
411 check_inode_key(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_inode_key() argument
463 check_root_key(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_root_key() argument
521 check_dir_item(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_dir_item() argument
682 check_block_group_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_block_group_item() argument
771 chunk_err(const struct btrfs_fs_info * fs_info,const struct extent_buffer * leaf,const struct btrfs_chunk * chunk,u64 logical,const char * fmt,...) chunk_err() argument
820 btrfs_check_chunk_valid(const struct btrfs_fs_info * fs_info,const struct extent_buffer * leaf,const struct btrfs_chunk * chunk,u64 logical,u32 sectorsize) btrfs_check_chunk_valid() argument
993 check_leaf_chunk_item(struct extent_buffer * leaf,struct btrfs_chunk * chunk,struct btrfs_key * key,int slot) check_leaf_chunk_item() argument
1051 check_dev_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_dev_item() argument
1098 check_inode_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_inode_item() argument
1187 check_root_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_root_item() argument
1319 check_extent_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_extent_item() argument
1631 check_simple_keyed_refs(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_simple_keyed_refs() argument
1672 check_extent_data_ref(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_extent_data_ref() argument
1735 check_inode_ref(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_inode_ref() argument
1785 check_inode_extref(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_inode_extref() argument
1818 check_raid_stripe_extent(const struct extent_buffer * leaf,const struct btrfs_key * key,int slot) check_raid_stripe_extent() argument
1837 check_dev_extent_item(const struct extent_buffer * leaf,const struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_dev_extent_item() argument
1906 check_leaf_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_leaf_item() argument
1973 __btrfs_check_leaf(struct extent_buffer * leaf) __btrfs_check_leaf() argument
2123 btrfs_check_leaf(struct extent_buffer * leaf) btrfs_check_leaf() argument
[all...]
H A Dfile.c143 struct extent_buffer *leaf; in btrfs_drop_extents()
192 leaf = path->nodes[0]; in btrfs_drop_extents()
193 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_drop_extents()
200 leaf = path->nodes[0]; in btrfs_drop_extents()
201 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_drop_extents()
203 btrfs_print_leaf(leaf); in btrfs_drop_extents()
214 leaf = path->nodes[0]; in btrfs_drop_extents()
218 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_drop_extents()
231 fi = btrfs_item_ptr(leaf, path->slots[0], in btrfs_drop_extents()
233 extent_type = btrfs_file_extent_type(leaf, f in btrfs_drop_extents()
142 struct extent_buffer *leaf; btrfs_drop_extents() local
509 extent_mergeable(struct extent_buffer * leaf,int slot,u64 objectid,u64 bytenr,u64 orig_offset,u64 * start,u64 * end) extent_mergeable() argument
552 struct extent_buffer *leaf; btrfs_mark_extent_written() local
2059 hole_mergeable(struct btrfs_inode * inode,struct extent_buffer * leaf,int slot,u64 start,u64 end) hole_mergeable() argument
2094 struct extent_buffer *leaf; fill_holes() local
2312 struct extent_buffer *leaf; btrfs_insert_replace_extent() local
3642 struct extent_buffer *leaf = path->nodes[0]; find_desired_extent() local
[all...]
/linux/include/linux/
H A Dleafops.h4 * leaf entries. These are abstracted from the hardware page table entries
38 * softleaf_mk_none() - Create an empty ('none') leaf entry.
39 * Returns: empty leaf entry.
47 * softleaf_from_pte() - Obtain a leaf entry from a PTE entry.
50 * If @pte is present (therefore not a leaf entry) the function returns an empty
51 * leaf entry. Otherwise, it returns a leaf entry.
53 * Returns: Leaf entry.
70 * softleaf_to_pte() - Obtain a PTE entry from a leaf entry.
71 * @entry: Leaf entry.
74 * encode the metadata the leaf entry encodes.
[all …]
/linux/fs/xfs/libxfs/
H A Dxfs_iext_tree.c98 * There are two types of blocks in the btree: leaf and inner (non-leaf) blocks.
100 * The leaf blocks are made up by %KEYS_PER_NODE extent records, which each
103 * leaf blocks (if there are any).
105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
109 * Leaf: | rec 1 | rec 2 | rec 3 | rec 4 | rec N | prev-ptr | next-ptr |
142 return &cur->leaf->recs[cur->pos]; in cur_rec()
148 if (!cur->leaf) in xfs_iext_valid()
202 cur->leaf = xfs_iext_find_first_leaf(ifp); in xfs_iext_first()
212 cur->leaf in xfs_iext_last()
376 xfs_iext_leaf_nr_entries(struct xfs_ifork * ifp,struct xfs_iext_leaf * leaf,int start) xfs_iext_leaf_nr_entries() argument
391 xfs_iext_leaf_key(struct xfs_iext_leaf * leaf,int n) xfs_iext_leaf_key() argument
551 struct xfs_iext_leaf *leaf = cur->leaf; xfs_iext_split_leaf() local
808 xfs_iext_rebalance_leaf(struct xfs_ifork * ifp,struct xfs_iext_cursor * cur,struct xfs_iext_leaf * leaf,xfs_fileoff_t offset,int nr_entries) xfs_iext_rebalance_leaf() argument
885 struct xfs_iext_leaf *leaf = cur->leaf; xfs_iext_remove() local
[all...]
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);
78 /* Compute the byte offset of the end of the leaf entry array. */
82 const struct xfs_attr_leafblock *leaf)
85 xfs_attr3_leaf_hdr_size(leaf);
109 const struct xfs_attr_leafblock *leaf) in xfs_attr3_leaf_firstused_from_disk()
112 xfs_attr_leaf_entries_end(ichdr->count, leaf); in xfs_attr3_leaf_firstused_from_disk()
135 * of an attr leaf block. The region starts at the tail of the block and expands in xfs_attr3_leaf_firstused_to_disk()
137 * size for an empty leaf block and is reduced from there. in xfs_attr3_leaf_firstused_to_disk()
299 struct xfs_attr_leafblock *leaf,
242 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) xfs_attr3_leaf_verify_entry() argument
316 struct xfs_attr_leafblock *leaf = bp->b_addr; xfs_attr3_leaf_verify() local
1006 struct xfs_attr_leafblock *leaf; xfs_attr_shortform_allfit() local
1115 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_to_shortform() local
1201 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_to_node() local
1275 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_create() local
1392 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_add() local
1474 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_add_work() local
1992 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_toosmall() local
2119 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_remove() local
2398 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_lookup_int() local
2513 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_getvalue() local
2720 xfs_attr_leaf_entsize(xfs_attr_leafblock_t * leaf,int index) xfs_attr_leaf_entsize() argument
2775 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_clearflag() local
2842 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_setflag() local
[all...]
H A Dxfs_attr.h15 * elements are in the leaf nodes. Attribute names are hashed into an int,
106 * are we leaf form? ──y──> xfs_attr_leaf_removename ──> done
143 * remove leaf and
154 * join leaf │
215 * │ transform to leaf
218 * │ hold the leaf buffer
223 * │ leaf form
225 * └─> release leaf buffer
260 * fits in a node leaf? ────n─────┐ │
262 * │ │ single leaf nod
[all...]
/linux/Documentation/arch/x86/
H A Dtopology.rst156 1) CPUID leaf 0x80000026 [Extended CPU Topology] (Core::X86::Cpuid::ExCpuTopology)
158 The extended CPUID leaf 0x80000026 is the extension of the CPUID leaf 0xB
162 Support for the leaf is discovered by checking if the maximum extended
174 CPUID leaf 0x80000026 also provides more information regarding the power
178 If CPUID leaf 0x80000026 is supported, further parsing is not required.
180 2) CPUID leaf 0x0000000B [Extended Topology Enumeration] (Core::X86::Cpuid::ExtTopEnum)
182 The extended CPUID leaf 0x0000000B is the predecessor on the extended
183 CPUID leaf 0x80000026 and only describes the core, and the socket domains
186 The support for the leaf is discovered by checking if the maximum supported
198 If CPUID leaf 0xB is supported, further parsing is not required.
[all …]
/linux/tools/arch/x86/kcpuid/
H A Dkcpuid.c59 /* Represent one leaf (basic or extended) */
63 * then the leafs[0] is the main leaf
139 #define cpuid(leaf, a, b, c, d) \ in cpuid_store()
140 __cpuid_count(leaf, 0, a, b, c, d) in cpuid_store()
142 #define cpuid_count(leaf, subleaf, a, b, c, d) \ in cpuid_store()
143 __cpuid_count(leaf, subleaf, a, b, c, d) in cpuid_store()
160 static void leaf_print_raw(struct subleaf *leaf) in cpuid_store()
162 if (has_subleafs(leaf->index)) { in cpuid_store()
163 if (leaf->sub == 0) in cpuid_store()
164 printf("0x%08x: subleafs:\n", leaf in cpuid_store()
114 leaf_print_raw(struct subleaf * leaf) leaf_print_raw() argument
133 struct subleaf *leaf; cpuid_store() local
289 struct subleaf *leaf; parse_line() local
483 show_leaf(struct subleaf * leaf) show_leaf() argument
[all...]
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dintr.c30 enum nvkm_intr_type type, int *leaf, u32 *mask) in nvkm_intr_xlat() argument
46 *leaf = data->leaf; in nvkm_intr_xlat()
54 *leaf = data->leaf; in nvkm_intr_xlat()
66 *leaf = type / 32; in nvkm_intr_xlat()
76 nvkm_intr_find(struct nvkm_subdev *subdev, enum nvkm_intr_type type, int *leaf, u32 *mask) in nvkm_intr_find() argument
82 ret = nvkm_intr_xlat(subdev, intr, type, leaf, mask); in nvkm_intr_find()
91 nvkm_intr_allow_locked(struct nvkm_intr *intr, int leaf, u32 mask) in nvkm_intr_allow_locked() argument
93 intr->mask[leaf] |= mask; in nvkm_intr_allow_locked()
96 intr->func->reset(intr, leaf, mask); in nvkm_intr_allow_locked()
97 intr->func->allow(intr, leaf, mask); in nvkm_intr_allow_locked()
[all …]
/linux/arch/loongarch/mm/
H A Dcache.c44 static void flush_cache_leaf(unsigned int leaf) in flush_cache_leaf() argument
48 struct cache_desc *cdesc = current_cpu_data.cache_leaves + leaf; in flush_cache_leaf()
55 flush_cache_line(leaf, addr); in flush_cache_leaf()
68 int leaf; in __flush_cache_all() local
72 leaf = cache_present - 1; in __flush_cache_all()
73 if (cache_inclusive(cdesc + leaf)) { in __flush_cache_all()
74 flush_cache_leaf(leaf); in __flush_cache_all()
78 for (leaf = 0; leaf < cache_present; leaf++) in __flush_cache_all()
79 flush_cache_leaf(leaf); in __flush_cache_all()
94 #define populate_cache_properties(cfg0, cdesc, level, leaf) \ argument
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/
H A Dnv04.c75 int leaf; in nv04_mc_intr_rearm() local
77 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_rearm()
78 nvkm_wr32(mc->subdev.device, 0x000140 + (leaf * 4), 0x00000001); in nv04_mc_intr_rearm()
85 int leaf; in nv04_mc_intr_unarm() local
87 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_unarm()
88 nvkm_wr32(mc->subdev.device, 0x000140 + (leaf * 4), 0x00000000); in nv04_mc_intr_unarm()
98 int leaf; in nv04_mc_intr_pending() local
100 for (leaf = 0; leaf < intr->leaves; leaf++) { in nv04_mc_intr_pending()
101 intr->stat[leaf] = nvkm_rd32(mc->subdev.device, 0x000100 + (leaf * 4)); in nv04_mc_intr_pending()
102 if (intr->stat[leaf]) in nv04_mc_intr_pending()
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/vfn/
H A Dtu102.c29 tu102_vfn_intr_reset(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_reset() argument
33 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1000 + (leaf * 4), mask); in tu102_vfn_intr_reset()
37 tu102_vfn_intr_allow(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_allow() argument
41 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1200 + (leaf * 4), mask); in tu102_vfn_intr_allow()
45 tu102_vfn_intr_block(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_block() argument
49 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1400 + (leaf * 4), mask); in tu102_vfn_intr_block()
74 int pending = 0, leaf; in tu102_vfn_intr_pending() local
76 for (leaf = 0; leaf < 8; leaf++) { in tu102_vfn_intr_pending()
77 if (intr_top & BIT(leaf / 2)) { in tu102_vfn_intr_pending()
78 intr->stat[leaf] = nvkm_rd32(device, vfn->addr.priv + 0x1000 + (leaf * 4)); in tu102_vfn_intr_pending()
[all …]
/linux/arch/x86/kernel/cpu/
H A Dtopology_ext.c45 static inline bool topo_subleaf(struct topo_scan *tscan, u32 leaf, u32 subleaf, in topo_subleaf() argument
59 u32 level : 8, // Current topology level. Same as sub leaf number in topo_subleaf()
66 switch (leaf) { in topo_subleaf()
73 cpuid_subleaf(leaf, subleaf, &sl); in topo_subleaf()
79 pr_err_once("Topology: leaf 0x%x:%d Unknown domain type %u\n", in topo_subleaf()
80 leaf, subleaf, sl.type); in topo_subleaf()
96 pr_warn_once(FW_BUG "CPUID leaf 0x%x subleaf %d APIC ID mismatch %x != %x\n", in topo_subleaf()
97 leaf, subleaf, tscan->c->topo.initial_apicid, sl.x2apic_id); in topo_subleaf()
104 static bool parse_topology_leaf(struct topo_scan *tscan, u32 leaf) in parse_topology_leaf() argument
110 for (subleaf = 0, last_dom = 0; topo_subleaf(tscan, leaf, subleaf, &last_dom); subleaf++); in parse_topology_leaf()
[all …]
H A Dtopology_amd.c38 * this leaf, just set the CORE domain shift and let the later in parse_8000_0008()
77 } leaf; in parse_8000_001e() local
82 cpuid_leaf(0x8000001e, &leaf); in parse_8000_001e()
85 * If leaf 0xb/0x26 is available, then the APIC ID and the domain in parse_8000_001e()
89 tscan->c->topo.initial_apicid = leaf.ext_apic_id; in parse_8000_001e()
92 * Leaf 0x8000008 sets the CORE domain shift but not the in parse_8000_001e()
98 unsigned int nthreads = leaf.core_nthreads + 1; in parse_8000_001e()
105 store_node(tscan, leaf.nnodes_per_socket + 1, leaf.node_id); in parse_8000_001e()
109 tscan->c->topo.cu_id = leaf.core_id; in parse_8000_001e()
111 cacheinfo_amd_init_llc_id(tscan->c, leaf.node_id); in parse_8000_001e()
[all …]
/linux/arch/x86/include/asm/xen/
H A Dcpuid.h46 * Leaf 1 (0x40000x00)
47 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
57 * Leaf 2 (0x40000x01)
64 * Leaf 3 (0x40000x02)
77 * Leaf 4 (0x40000x03)
78 * Sub-leaf 0: EAX: bit 0: emulated tsc
85 * Sub-leaf 1: EAX: tsc offset low part
89 * Sub-leaf 2: EAX: host tsc frequency in kHz
102 * Leaf 5 (0x40000x04)
104 * Sub-leaf 0: EAX: Features
[all …]
/linux/drivers/net/can/usb/kvaser_usb/
H A Dkvaser_usb_leaf.c3 * - Kvaser linux leaf driver (version 4.78)
55 /* Leaf/usbcan command ids */
90 /* Leaf frequency options */
108 /* Only Leaf-based devices can report M16C error factors,
202 } __packed leaf; member
395 } __packed leaf; member
420 [CMD_TX_ACKNOWLEDGE] = kvaser_fsize(u.leaf.tx_ack),
421 [CMD_GET_SOFTWARE_INFO_REPLY] = kvaser_fsize(u.leaf.softinfo),
422 [CMD_RX_STD_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
423 [CMD_RX_EXT_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
[all …]
/linux/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
175 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
176 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
177 #define LEAF_STR(LEAF) ((const char*)((LEAF) + 2)) argument
343 #define LEAF 0 macro
383 void *leaf = NULL; in lookup() local
386 while (!leaf && node) { in lookup()
[all …]
/linux/arch/mips/kernel/
H A Dcacheinfo.c7 /* Populates leaf and increments to next leaf */
8 #define populate_cache(cache, leaf, c_level, c_type) \ argument
10 leaf->type = c_type; \
11 leaf->level = c_level; \
12 leaf->coherency_line_size = c->cache.linesz; \
13 leaf->number_of_sets = c->cache.sets; \
14 leaf->ways_of_associativity = c->cache.ways; \
15 leaf->size = c->cache.linesz * c->cache.sets * \
17 leaf++; \
/linux/drivers/gpu/drm/i915/selftests/
H A Di915_syncmap.c146 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno) in check_seqno() argument
148 if (leaf->height) { in check_seqno()
149 pr_err("%s: not a leaf, height is %d\n", in check_seqno()
150 __func__, leaf->height); in check_seqno()
154 if (__sync_seqno(leaf)[idx] != seqno) { in check_seqno() local
156 __func__, idx, __sync_seqno(leaf)[idx], seqno); in check_seqno()
172 pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n", in check_one()
211 * Check that inserting a new id, creates a leaf and only that leaf. in igt_syncmap_one()
247 pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n", in check_leaf()
253 …pr_err("First entry into leaf (context=%llx) does not contain a single entry, found %x (count=%d)!… in check_leaf()
[all …]
/linux/net/ipv6/
H A Dip6_fib.c240 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
471 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
472 w->leaf = NULL; in fib6_node_dump()
534 w->leaf = rt; in fib6_dump_node()
555 w->leaf = NULL; in fib6_dump_node()
773 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
775 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
801 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
802 fib6_info_release(leaf); in fib6_add_1()
1057 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_purge_rt() local
1084 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_add_rt2node() local
1644 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_node_lookup_1() local
1727 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_locate_1() local
1970 struct fib6_info *leaf, *replace_rt = NULL; fib6_del_route() local
[all...]
/linux/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
774 * get_leaf_nr - Get a leaf number associated with the index
776 * @index: hash table index of the targeted leaf
777 * @leaf_out: Resulting leaf block number
820 struct gfs2_leaf *leaf; in gfs2_dirent_search() local
838 leaf = (struct gfs2_leaf *)bh->b_data; in gfs2_dirent_search()
[all …]
/linux/tools/testing/selftests/cgroup/
H A Dtest_cpu.c486 struct cpu_hogger leaf[3] = {}; in run_cpucg_nested_weight_test() local
517 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
528 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i); in run_cpucg_nested_weight_test()
529 if (!leaf[i].cgroup) in run_cpucg_nested_weight_test()
532 if (cg_create(leaf[i].cgroup)) in run_cpucg_nested_weight_test()
535 if (cg_write_numeric(leaf[i].cgroup, "cpu.weight", weight)) in run_cpucg_nested_weight_test()
539 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
550 pid = cg_run_nowait(leaf[i].cgroup, hog_cpus_timed, in run_cpucg_nested_weight_test()
554 leaf[i].pid = pid; in run_cpucg_nested_weight_test()
557 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
[all …]
/linux/drivers/net/ethernet/dec/tulip/
H A Deeprom.c65 0x8001, /* 1 leaf, extended type, bogus len */
243 struct medialeaf *leaf = &mtable->mleaf[i]; in tulip_parse_eeprom() local
246 leaf->type = 0; in tulip_parse_eeprom()
247 leaf->media = p[0] & 0x3f; in tulip_parse_eeprom()
248 leaf->leafdata = p; in tulip_parse_eeprom()
253 leaf->type = p[1]; in tulip_parse_eeprom()
256 leaf->media = p[2] & 0x0f; in tulip_parse_eeprom()
262 leaf->leafdata = p + 2; in tulip_parse_eeprom()
269 leaf->media = 11; in tulip_parse_eeprom()
275 leaf->media = p[2] & MEDIA_MASK; in tulip_parse_eeprom()
[all …]
/linux/tools/testing/selftests/bpf/progs/
H A Dxdpwall.c118 __u8 *leaf; in filter_ipv6_addr() local
120 leaf = bpf_map_lookup_elem(&v6_addr_map, ipv6addr); in filter_ipv6_addr()
122 return leaf ? *leaf : 0; in filter_ipv6_addr()
127 __u8 *leaf; in filter_ipv4_addr() local
129 leaf = bpf_map_lookup_elem(&v4_addr_map, &ipaddr); in filter_ipv4_addr()
131 return leaf ? *leaf : 0; in filter_ipv4_addr()
221 __u8 *leaf = bpf_map_lookup_elem(&tcp_port_map, &port); in filter_tcp_port() local
223 return leaf ? *leaf : 0; in filter_tcp_port()
228 __u16 *leaf = bpf_map_lookup_elem(&udp_port_map, &port); in filter_udp_port() local
230 return leaf ? *leaf : 0; in filter_udp_port()
/linux/net/sched/
H A Dsch_htb.c49 Each class is assigned level. Leaf has ALWAYS level 0 and root
90 /* interior & leaf nodes; props specific to leaves are marked L:
101 int quantum; /* but stored for parent-to-leaf return */
128 } leaf; member
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 */ in htb_classify()
266 return cl; /* we hit leaf; return it */ in htb_classify()
585 * htb_activate - inserts leaf cl into appropriate active feeds
589 * Routine learns (new) priority of leaf and activates feed chain
[all …]

12345678910>>...21