Home
last modified time | relevance | path

Searched refs:leaf (Results 1 – 25 of 240) sorted by relevance

12345678910

/linux/fs/btrfs/
H A Dtree-checker.c109 #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 Ddir-item.c33 struct extent_buffer *leaf; in insert_with_overflow() local
45 leaf = path->nodes[0]; in insert_with_overflow()
46 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
47 ASSERT(data_size <= btrfs_item_size(leaf, path->slots[0])); in insert_with_overflow()
48 ptr += btrfs_item_size(leaf, path->slots[0]) - data_size; in insert_with_overflow()
67 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
84 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
86 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
87 btrfs_set_dir_flags(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
88 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
H A Dinode-item.c17 struct btrfs_inode_ref *btrfs_find_name_in_backref(const struct extent_buffer *leaf, in btrfs_find_name_in_backref() argument
28 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_backref()
29 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_backref()
32 len = btrfs_inode_ref_name_len(leaf, ref); in btrfs_find_name_in_backref()
37 if (memcmp_extent_buffer(leaf, name->name, name_ptr, in btrfs_find_name_in_backref()
45 const struct extent_buffer *leaf, int slot, u64 ref_objectid, in btrfs_find_name_in_ext_backref() argument
55 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_ext_backref()
56 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_ext_backref()
67 ref_name_len = btrfs_inode_extref_name_len(leaf, extref); in btrfs_find_name_in_ext_backref()
70 btrfs_inode_extref_parent(leaf, extref) == ref_objectid && in btrfs_find_name_in_ext_backref()
[all …]
H A Dfile-item.c167 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 Draid-stripe-tree.c23 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()
50 phys = btrfs_raid_stride_physical(leaf, stride) + frontpad; in btrfs_partially_delete_raid_extent()
68 struct extent_buffer *leaf; in btrfs_delete_raid_extent() local
107 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
109 btrfs_item_key_to_cpu(leaf, &key, slot); in btrfs_delete_raid_extent()
137 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
139 btrfs_item_key_to_cpu(leaf, &key, slot); in btrfs_delete_raid_extent()
[all …]
H A Dctree.c44 static unsigned int leaf_data_end(const struct extent_buffer *leaf) in leaf_data_end() argument
46 u32 nr = btrfs_header_nritems(leaf); in leaf_data_end()
49 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info); in leaf_data_end()
50 return btrfs_item_offset(leaf, nr - 1); in leaf_data_end()
66 static inline void memmove_leaf_data(const struct extent_buffer *leaf, in memmove_leaf_data() argument
71 memmove_extent_buffer(leaf, btrfs_item_nr_offset(leaf, 0) + dst_offset, in memmove_leaf_data()
72 btrfs_item_nr_offset(leaf, 0) + src_offset, len); in memmove_leaf_data()
109 static inline void memmove_leaf_items(const struct extent_buffer *leaf, in memmove_leaf_items() argument
112 memmove_extent_buffer(leaf, btrfs_item_nr_offset(leaf, dst_item), in memmove_leaf_items()
113 btrfs_item_nr_offset(leaf, src_item), in memmove_leaf_items()
[all …]
H A Dxattr.c33 struct extent_buffer *leaf; in btrfs_getxattr() local
48 leaf = path->nodes[0]; in btrfs_getxattr()
51 return btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
54 if (btrfs_dir_data_len(leaf, di) > size) in btrfs_getxattr()
65 btrfs_dir_name_len(leaf, di)); in btrfs_getxattr()
66 read_extent_buffer(leaf, buffer, data_ptr, in btrfs_getxattr()
67 btrfs_dir_data_len(leaf, di)); in btrfs_getxattr()
68 return btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
160 struct extent_buffer *leaf = path->nodes[0]; in btrfs_setxattr() local
161 const u16 old_data_len = btrfs_dir_data_len(leaf, di); in btrfs_setxattr()
[all …]
H A Dfile.c143 struct extent_buffer *leaf; in btrfs_drop_extents() local
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, fi); in btrfs_drop_extents()
[all …]
H A Droot-tree.c216 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 …]
/linux/arch/x86/boot/startup/
H A Dsev-shared.c169 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/fs/xfs/libxfs/
H A Dxfs_iext_tree.c142 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 Dxfs_dir2_leaf.c105 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf1_check() local
108 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); in xfs_dir3_leaf1_check()
117 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false); in xfs_dir3_leaf1_check()
143 struct xfs_dir2_leaf *leaf, in xfs_dir3_leaf_check_int() argument
153 ltp = xfs_dir2_leaf_tail_p(geo, leaf); in xfs_dir3_leaf_check_int()
364 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf_init() local
380 memset(leaf, 0, sizeof(*leaf)); in xfs_dir3_leaf_init()
381 leaf->hdr.info.magic = cpu_to_be16(type); in xfs_dir3_leaf_init()
391 ltp = xfs_dir2_leaf_tail_p(mp->m_dir_geo, leaf); in xfs_dir3_leaf_init()
447 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_block_to_leaf() local
[all …]
H A Dxfs_attr_leaf.c76 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
82 const struct xfs_attr_leafblock *leaf) in xfs_attr_leaf_entries_end() argument
85 xfs_attr3_leaf_hdr_size(leaf); in xfs_attr_leaf_entries_end()
109 const struct xfs_attr_leafblock *leaf) in xfs_attr_leaf_ichdr_freemaps_verify() argument
112 xfs_attr_leaf_entries_end(ichdr->count, leaf); in xfs_attr_leaf_ichdr_freemaps_verify()
299 struct xfs_attr_leafblock *leaf, in xfs_attr3_leaf_verify_entry() argument
327 lentry = xfs_attr3_leaf_name_local(leaf, idx); in xfs_attr3_leaf_verify_entry()
334 rentry = xfs_attr3_leaf_name_remote(leaf, idx); in xfs_attr3_leaf_verify_entry()
373 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
382 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
[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/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/tools/arch/x86/kcpuid/
H A Dkcpuid.c139 #define cpuid(leaf, a, b, c, d) \ argument
140 __cpuid_count(leaf, 0, a, b, c, d)
142 #define cpuid_count(leaf, subleaf, a, b, c, d) \ argument
143 __cpuid_count(leaf, subleaf, a, b, c, d)
160 static void leaf_print_raw(struct subleaf *leaf) in leaf_print_raw() argument
162 if (has_subleafs(leaf->index)) { in leaf_print_raw()
163 if (leaf->sub == 0) in leaf_print_raw()
164 printf("0x%08x: subleafs:\n", leaf->index); in leaf_print_raw()
166 printf(" %2d: EAX=0x%08x, EBX=0x%08x, ECX=0x%08x, EDX=0x%08x\n", leaf->sub, in leaf_print_raw()
167 leaf->output[0], leaf->output[1], leaf->output[2], leaf->output[3]); in leaf_print_raw()
[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/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/drivers/net/ethernet/dec/tulip/
H A Deeprom.c243 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 Dkvaser_usb_leaf.c202 } __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 Dmkutf8data.c383 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 …]
H A Dutf8-norm.c389 utf8leaf_t *leaf; in utf8nlen() local
394 leaf = utf8nlookup(um, n, hangul, s, len); in utf8nlen()
395 if (!leaf) in utf8nlen()
397 if (um->tables->utf8agetab[LEAF_GEN(leaf)] > in utf8nlen()
400 else if (LEAF_CCC(leaf) == DECOMPOSE) in utf8nlen()
401 ret += strlen(LEAF_STR(leaf)); in utf8nlen()
473 utf8leaf_t *leaf; in utf8byte() local
500 leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s); in utf8byte()
502 leaf = utf8nlookup(u8c->um, u8c->n, u8c->hangul, in utf8byte()
507 if (!leaf) in utf8byte()
[all …]
/linux/arch/x86/include/asm/cpuid/
H A Dapi.h127 static inline void __cpuid_read(u32 leaf, u32 subleaf, u32 *regs) in __cpuid_read() argument
129 regs[CPUID_EAX] = leaf; in __cpuid_read()
134 #define cpuid_subleaf(leaf, subleaf, regs) { \ argument
136 __cpuid_read(leaf, subleaf, (u32 *)(regs)); \
139 #define cpuid_leaf(leaf, regs) { \ argument
141 __cpuid_read(leaf, 0, (u32 *)(regs)); \
144 static inline void __cpuid_read_reg(u32 leaf, u32 subleaf, in __cpuid_read_reg() argument
149 __cpuid_read(leaf, subleaf, regs); in __cpuid_read_reg()
153 #define cpuid_subleaf_reg(leaf, subleaf, regidx, reg) { \ argument
155 __cpuid_read_reg(leaf, subleaf, regidx, (u32 *)(reg)); \
[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/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()
781 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1()
783 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
809 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
810 fib6_info_release(leaf); in fib6_add_1()
773 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_add_1() local
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...]

12345678910