| /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 | raid-stripe-tree.c | 23 struct extent_buffer *leaf; in btrfs_partially_delete_raid_extent() local
36 leaf = path->nodes[0]; in btrfs_partially_delete_raid_extent()
38 item_size = btrfs_item_size(leaf, slot); in btrfs_partially_delete_raid_extent()
44 extent = btrfs_item_ptr(leaf, slot, struct btrfs_stripe_extent); in btrfs_partially_delete_raid_extent()
51 devid = btrfs_raid_stride_devid(leaf, stride); in btrfs_partially_delete_raid_extent()
53 phys = btrfs_raid_stride_physical(leaf, stride) + frontpad; in btrfs_partially_delete_raid_extent()
71 struct extent_buffer *leaf; in btrfs_delete_raid_extent() local
109 * leaf even when the target entry is the first item on a leaf. in btrfs_delete_raid_extent()
112 * past the end of the leaf if that entry is the last item). in btrfs_delete_raid_extent()
122 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
[all …]
|
| H A D | ctree.c | 42 * The leaf data grows from end-to-front in the node. this returns the address
43 * of the start of the last item, which is the stop of the leaf data stack.
45 static unsigned int leaf_data_end(const struct extent_buffer *leaf) in leaf_data_end() argument
47 u32 nr = btrfs_header_nritems(leaf); in leaf_data_end()
50 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info); in leaf_data_end()
51 return btrfs_item_offset(leaf, nr - 1); in leaf_data_end()
55 * Move data in a @leaf (using memmove, safe for overlapping ranges).
57 * @leaf: leaf that we're doing a memmove on
63 * the leaf. The btrfs_item offset's start directly after the header, so we
64 * have to adjust any offsets to account for the header in the leaf. This
[all …]
|
| H A D | file-item.c | 167 struct extent_buffer *leaf; in btrfs_insert_hole_extent() local
181 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
182 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
184 btrfs_set_file_extent_disk_bytenr(leaf, item, 0); in btrfs_insert_hole_extent()
185 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); in btrfs_insert_hole_extent()
186 btrfs_set_file_extent_offset(leaf, item, 0); in btrfs_insert_hole_extent()
187 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
188 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
189 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_hole_extent()
190 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_hole_extent()
[all …]
|
| H A D | file.c | 126 struct extent_buffer *leaf; in btrfs_drop_extents() local
175 leaf = path->nodes[0]; in btrfs_drop_extents()
176 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_drop_extents()
183 leaf = path->nodes[0]; in btrfs_drop_extents()
184 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_drop_extents()
186 btrfs_print_leaf(leaf); in btrfs_drop_extents()
197 leaf = path->nodes[0]; in btrfs_drop_extents()
201 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_drop_extents()
214 fi = btrfs_item_ptr(leaf, path->slots[0], in btrfs_drop_extents()
216 extent_type = btrfs_file_extent_type(leaf, fi); in btrfs_drop_extents()
[all …]
|
| H A D | root-tree.c | 216 struct extent_buffer *leaf; in btrfs_find_orphan_roots() local
237 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
238 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_find_orphan_roots()
244 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
247 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_find_orphan_roots()
336 struct extent_buffer *leaf; in btrfs_del_root_ref() local
353 leaf = path->nodes[0]; in btrfs_del_root_ref()
354 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_del_root_ref()
357 if ((btrfs_root_ref_dirid(leaf, ref) != dirid) || in btrfs_del_root_ref()
358 (btrfs_root_ref_name_len(leaf, ref) != name->len) || in btrfs_del_root_ref()
[all …]
|
| H A D | extent-tree.c | 54 struct extent_buffer *leaf,
163 struct extent_buffer *leaf = path->nodes[0]; in btrfs_lookup_extent_info() local
165 const u32 item_size = btrfs_item_size(leaf, path->slots[0]); in btrfs_lookup_extent_info()
176 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); in btrfs_lookup_extent_info()
177 num_refs = btrfs_extent_refs(leaf, ei); in btrfs_lookup_extent_info()
186 extent_flags = btrfs_extent_flags(leaf, ei); in btrfs_lookup_extent_info()
187 owner = btrfs_get_extent_owner_root(fs_info, leaf, path->slots[0]); in btrfs_lookup_extent_info()
311 * - number of pointers in the tree leaf
314 * the tree leaf
324 * (btrfs_header_owner(leaf), inode objectid, offset in file)
[all …]
|
| /linux/arch/x86/boot/startup/ |
| H A D | sev-shared.c | 169 static int __sev_cpuid_hv_msr(struct cpuid_leaf *leaf) in __sev_cpuid_hv_msr() argument
181 if (cpuid_function_is_indexed(leaf->fn) && leaf->subfn) in __sev_cpuid_hv_msr()
184 ret = __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EAX, &leaf->eax); in __sev_cpuid_hv_msr()
185 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EBX, &leaf->ebx); in __sev_cpuid_hv_msr()
186 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_ECX, &leaf->ecx); in __sev_cpuid_hv_msr()
187 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EDX, &leaf->edx); in __sev_cpuid_hv_msr()
262 snp_cpuid_get_validated_func(struct cpuid_leaf *leaf) in snp_cpuid_get_validated_func() argument
270 if (e->eax_in != leaf->fn) in snp_cpuid_get_validated_func()
273 if (cpuid_function_is_indexed(leaf->fn) && e->ecx_in != leaf->subfn) in snp_cpuid_get_validated_func()
286 leaf->eax = e->eax; in snp_cpuid_get_validated_func()
[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 | 34 static void flush_cache_leaf(unsigned int leaf) in flush_cache_leaf() argument
38 struct cache_desc *cdesc = current_cpu_data.cache_leaves + leaf; in flush_cache_leaf()
45 flush_cache_line(leaf, addr); in flush_cache_leaf()
58 int leaf; in __flush_cache_all() local
62 leaf = cache_present - 1; in __flush_cache_all()
63 if (cache_inclusive(cdesc + leaf)) { in __flush_cache_all()
64 flush_cache_leaf(leaf); in __flush_cache_all()
68 for (leaf = 0; leaf < cache_present; leaf++) in __flush_cache_all()
69 flush_cache_leaf(leaf); in __flush_cache_all()
84 #define populate_cache_properties(cfg0, cdesc, level, leaf) \ argument
[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/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/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 */
129 } leaf; member
212 * should be passed directly thru. In all other cases leaf class is returned.
217 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
240 /* Start with inner filter chain if a non-leaf class is selected */ in htb_classify()
268 return cl; /* we hit leaf; return it */ in htb_classify()
591 * htb_activate - inserts leaf c
[all...] |
| /linux/net/ipv6/ |
| H A D | ip6_fib.c | 240 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
474 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
475 w->leaf = NULL; in fib6_node_dump()
537 w->leaf = rt; in fib6_dump_node()
558 w->leaf = NULL; in fib6_dump_node()
782 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
784 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
810 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
811 fib6_info_release(leaf); in fib6_add_1()
814 rcu_access_pointer(fn->leaf) == in fib6_add_1()
[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()
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_attr.h | 15 * elements are in the leaf nodes. Attribute names are hashed into an int,
107 * are we leaf form? ──y──> xfs_attr_leaf_removename ──> done
144 * remove leaf and
155 * join leaf │
216 * │ transform to leaf
219 * │ hold the leaf buffer
224 * │ leaf form
226 * └─> release leaf buffer
261 * fits in a node leaf? ────n─────┐ │
263 * │ │ single leaf node? │
[all …]
|
| /linux/tools/testing/selftests/cgroup/ |
| H A D | test_cpu.c | 488 struct cpu_hogger leaf[3] = {}; in run_cpucg_nested_weight_test() local
519 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
530 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i); in run_cpucg_nested_weight_test()
531 if (!leaf[i].cgroup) in run_cpucg_nested_weight_test()
534 if (cg_create(leaf[i].cgroup)) in run_cpucg_nested_weight_test()
537 if (cg_write_numeric(leaf[i].cgroup, "cpu.weight", weight)) in run_cpucg_nested_weight_test()
541 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
552 pid = cg_run_nowait(leaf[i].cgroup, hog_cpus_timed, in run_cpucg_nested_weight_test()
556 leaf[i].pid = pid; in run_cpucg_nested_weight_test()
559 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
[all …]
|