| /linux/fs/btrfs/ |
| H A D | tree-checker.c | 10 * 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), (fi)), \
[all …]
|
| H A D | fiemap.c | 129 * For example we are in leaf X processing its last item, which is the in emit_fiemap_extent()
135 * range [768K, 2M[, which may end up as the last item of leaf X or as in emit_fiemap_extent()
136 * the first item of the next leaf - in either case btrfs_next_leaf() in emit_fiemap_extent()
404 * We clone the leaf and use it during fiemap. This is because while in fiemap_search_slot()
405 * using the leaf we do expensive things like checking if an extent is in fiemap_search_slot()
407 * other tasks for too long, we use a clone of the leaf. We have locked in fiemap_search_slot()
410 * want to insert items for other inodes in the same leaf or b+tree in fiemap_search_slot()
412 * to push items into this leaf when trying to insert an item in a in fiemap_search_slot()
413 * neighbour leaf). in fiemap_search_slot()
417 * lock the same leaf we are processing. in fiemap_search_slot()
[all …]
|
| /linux/include/linux/ |
| H A D | leafops.h | 4 * 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 D | xfs_iext_tree.c | 98 * 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 = xfs_iext_find_last_leaf(ifp); in xfs_iext_last()
213 if (!cur->leaf) { in xfs_iext_last()
[all …]
|
| H A D | xfs_attr_leaf.c | 38 * 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, in xfs_attr3_leaf_verify_entry() argument
270 lentry = xfs_attr3_leaf_name_local(leaf, idx); in xfs_attr3_leaf_verify_entry()
277 rentry = xfs_attr3_leaf_name_remote(leaf, idx); in xfs_attr3_leaf_verify_entry()
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 block;
[all …]
|
| H A D | xfs_attr.h | 15 * 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 node? │
[all …]
|
| /linux/Documentation/arch/x86/ |
| H A D | topology.rst | 156 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 D | kcpuid.c | 59 /* 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 D | intr.c | 30 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 D | cache.c | 44 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()
94 populate_cache_properties(cfg0,cdesc,level,leaf) global() argument
117 unsigned int leaf = 0, level = 1; cpu_cache_init() local
[all...] |
| /linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/ |
| H A D | nv04.c | 75 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 D | tu102.c | 29 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/drivers/net/can/usb/kvaser_usb/ |
| H A D | kvaser_usb_leaf.c | 3 * - 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/arch/x86/kernel/cpu/ |
| H A D | topology_ext.c | 45 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 D | topology_amd.c | 38 * 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 D | cpuid.h | 46 * 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/fs/unicode/ |
| H A D | mkutf8data.c | 123 * 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/drivers/gpu/drm/i915/selftests/ |
| H A D | i915_syncmap.c | 146 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/arch/mips/kernel/ |
| H A D | cacheinfo.c | 7 /* 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/net/ipv6/ |
| H A D | ip6_fib.c | 240 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
1639 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_node_lookup_1() local
1722 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_locate_1() local
1965 struct fib6_info *leaf, *replace_rt = NULL; fib6_del_route() local
[all...] |
| /linux/fs/gfs2/ |
| H A D | dir.c | 34 * 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 D | test_cpu.c | 486 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 D | eeprom.c | 65 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/net/sched/ |
| H A D | sch_htb.c | 49 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 …]
|
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | xdpwall.c | 118 __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()
|