| /linux/fs/btrfs/ |
| H A D | tree-checker.c | 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)), \
117 (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
120 static u64 file_extent_end(struct extent_buffer *leaf, in file_extent_end() argument
127 if (btrfs_file_extent_type(leaf, extent) == BTRFS_FILE_EXTENT_INLINE) { in file_extent_end()
128 len = btrfs_file_extent_ram_bytes(leaf, extent); in file_extent_end()
129 end = ALIGN(key->offset + len, leaf->fs_info->sectorsize); in file_extent_end()
131 len = btrfs_file_extent_num_bytes(leaf, extent); in file_extent_end()
[all …]
|
| H A D | export.c | 159 struct extent_buffer *leaf; in btrfs_get_parent() local
198 leaf = path->nodes[0]; in btrfs_get_parent()
200 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_get_parent()
207 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_parent()
209 key.objectid = btrfs_root_ref_dirid(leaf, ref); in btrfs_get_parent()
240 struct extent_buffer *leaf; in btrfs_get_name() local
276 leaf = path->nodes[0]; in btrfs_get_name()
279 rref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
282 name_len = btrfs_root_ref_name_len(leaf, rref); in btrfs_get_name()
284 iref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
[all …]
|
| H A D | fiemap.c | 560 struct extent_buffer *leaf; in fiemap_find_last_extent_offset() local
584 leaf = path->nodes[0]; in fiemap_find_last_extent_offset()
585 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in fiemap_find_last_extent_offset()
597 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); in fiemap_find_last_extent_offset()
598 if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_INLINE) { in fiemap_find_last_extent_offset()
610 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei); in fiemap_find_last_extent_offset()
620 leaf = path->nodes[0]; in fiemap_find_last_extent_offset()
621 ei = btrfs_item_ptr(leaf, path->slots[0], in fiemap_find_last_extent_offset()
623 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei); in fiemap_find_last_extent_offset()
685 struct extent_buffer *leaf = path->nodes[0]; in extent_fiemap() local
[all …]
|
| H A D | free-space-tree.c | 76 struct extent_buffer *leaf; in add_new_free_space_info() local
87 leaf = path->nodes[0]; in add_new_free_space_info()
88 info = btrfs_item_ptr(leaf, path->slots[0], in add_new_free_space_info()
90 btrfs_set_free_space_extent_count(leaf, info, 0); in add_new_free_space_info()
91 btrfs_set_free_space_flags(leaf, info, 0); in add_new_free_space_info()
207 struct extent_buffer *leaf; in btrfs_convert_free_space_to_bitmaps() local
236 leaf = path->nodes[0]; in btrfs_convert_free_space_to_bitmaps()
240 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in btrfs_convert_free_space_to_bitmaps()
282 leaf = path->nodes[0]; in btrfs_convert_free_space_to_bitmaps()
283 flags = btrfs_free_space_flags(leaf, info); in btrfs_convert_free_space_to_bitmaps()
[all …]
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_iext_tree.c | 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()
219 if (xfs_iext_rec_is_empty(&cur->leaf->recs[i])) in xfs_iext_last()
230 if (!cur->leaf) { in xfs_iext_next()
241 cur->leaf->next) { in xfs_iext_next()
242 cur->leaf = cur->leaf->next; in xfs_iext_next()
252 if (!cur->leaf) { in xfs_iext_prev()
[all …]
|
| H A D | xfs_attr_leaf.c | 76 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
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()
316 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
325 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
337 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) in xfs_attr3_leaf_verify()
355 fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, in xfs_attr3_leaf_verify()
1006 struct xfs_attr_leafblock *leaf; in xfs_attr_shortform_allfit() local
1014 leaf = bp->b_addr; in xfs_attr_shortform_allfit()
[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/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()
79 flush_cache_leaf(leaf); in __flush_cache_all()
94 #define populate_cache_properties(cfg0, cdesc, level, leaf) \ argument
[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/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/ethernet/dec/tulip/ |
| H A D | eeprom.c | 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()
277 if (tp->chip_id == DM910X && leaf->media == 1) in tulip_parse_eeprom()
[all …]
|
| /linux/drivers/net/can/usb/kvaser_usb/ |
| H A D | kvaser_usb_leaf.c | 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),
424 [CMD_LEAF_LOG_MESSAGE] = kvaser_fsize(u.leaf.log_message),
425 [CMD_CHIP_STATE_EVENT] = kvaser_fsize(u.leaf.chip_state_event),
426 [CMD_CAN_ERROR_EVENT] = kvaser_fsize(u.leaf.can_error_event),
427 [CMD_GET_CAPABILITIES_RESP] = kvaser_fsize(u.leaf.cap_res),
[all …]
|
| /linux/fs/unicode/ |
| H A D | mkutf8data.c | 383 void *leaf = NULL; in lookup() local
386 while (!leaf && node) { in lookup()
394 leaf = node->right; in lookup()
403 leaf = node->left; in lookup()
410 return leaf; in lookup()
533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() argument
559 *cursor = leaf; in insert()
577 leaf = node->left; in insert()
582 tree->root = leaf; in insert()
585 parent->left = leaf; in insert()
[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/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
66 switch (leaf) { in topo_subleaf()
73 cpuid_subleaf(leaf, subleaf, &sl); in topo_subleaf()
80 leaf, subleaf, sl.type); 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()
125 leaf, tscan->dom_ncpus[TOPO_SMT_DOMAIN]); in parse_topology_leaf()
|
| H A D | topology_amd.c | 77 } leaf; in parse_8000_001e() local
82 cpuid_leaf(0x8000001e, &leaf); in parse_8000_001e()
89 tscan->c->topo.initial_apicid = leaf.ext_apic_id; 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()
|
| /linux/arch/mips/kernel/ |
| H A D | cacheinfo.c | 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/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/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/drivers/infiniband/hw/irdma/ |
| H A D | pble.c | 320 struct irdma_pble_info *leaf = lvl2->leaf; in free_lvl2() local
322 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in free_lvl2()
323 if (leaf->addr) in free_lvl2()
325 &leaf->chunkinfo); in free_lvl2()
334 lvl2->leaf = NULL; in free_lvl2()
350 struct irdma_pble_info *leaf; in get_lvl2_pble() local
360 lvl2->leafmem.size = (sizeof(*leaf) * total); in get_lvl2_pble()
365 lvl2->leaf = lvl2->leafmem.va; in get_lvl2_pble()
366 leaf = lvl2->leaf; in get_lvl2_pble()
371 lvl2->leaf = NULL; in get_lvl2_pble()
[all …]
|
| /linux/drivers/gpu/drm/nouveau/include/nvkm/core/ |
| H A D | intr.h | 24 void (*block)(struct nvkm_intr *, int leaf, u32 mask);
25 void (*allow)(struct nvkm_intr *, int leaf, u32 mask);
26 void (*reset)(struct nvkm_intr *, int leaf, u32 mask);
31 int leaf; member
60 int leaf; member
|
| /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()
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()
508 struct i915_syncmap *leaf = __sync_child(sync)[idx]; in igt_syncmap_compact() local
510 if (leaf->height) { in igt_syncmap_compact()
516 if (leaf->parent != sync) { in igt_syncmap_compact()
523 if (!is_power_of_2(leaf->bitmap)) { in igt_syncmap_compact()
525 idx, leaf->bitmap, hweight32(leaf->bitmap)); in igt_syncmap_compact()
[all …]
|
| /linux/net/sched/ |
| H A D | sch_htb.c | 128 } leaf; member
595 WARN_ON(cl->level || !cl->leaf.q); in htb_activate()
642 } else if ((ret = qdisc_enqueue(skb, cl->leaf.q, in htb_enqueue()
895 if (unlikely(cl->leaf.q->q.qlen == 0)) { in htb_dequeue_tree()
911 skb = cl->leaf.q->dequeue(cl->leaf.q); in htb_dequeue_tree()
915 qdisc_warn_nonwc("htb", cl->leaf.q); in htb_dequeue_tree()
924 cl->leaf.deficit[level] -= qdisc_pkt_len(skb); in htb_dequeue_tree()
925 if (cl->leaf.deficit[level] < 0) { in htb_dequeue_tree()
926 cl->leaf.deficit[level] += cl->quantum; in htb_dequeue_tree()
933 if (!cl->leaf.q->q.qlen) in htb_dequeue_tree()
[all …]
|