| /OK3568_Linux_fs/kernel/fs/btrfs/ |
| H A D | tree-checker.c | 101 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \ argument
103 if (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))) \
104 file_extent_err((leaf), (slot), \
106 (#name), btrfs_file_extent_##name((leaf), (fi)), \
108 (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
111 static u64 file_extent_end(struct extent_buffer *leaf, in file_extent_end() argument
118 if (btrfs_file_extent_type(leaf, extent) == BTRFS_FILE_EXTENT_INLINE) { in file_extent_end()
119 len = btrfs_file_extent_ram_bytes(leaf, extent); in file_extent_end()
120 end = ALIGN(key->offset + len, leaf->fs_info->sectorsize); in file_extent_end()
122 len = btrfs_file_extent_num_bytes(leaf, extent); in file_extent_end()
[all …]
|
| H A D | dir-item.c | 31 struct extent_buffer *leaf; in insert_with_overflow() local
43 leaf = path->nodes[0]; in insert_with_overflow()
45 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
46 BUG_ON(data_size > btrfs_item_size(leaf, item)); in insert_with_overflow()
47 ptr += btrfs_item_size(leaf, item) - data_size; in insert_with_overflow()
66 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
85 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
86 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
87 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
|
| H A D | file-item.c | 136 struct extent_buffer *leaf; in btrfs_insert_file_extent() local
151 leaf = path->nodes[0]; in btrfs_insert_file_extent()
152 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_file_extent()
154 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset); in btrfs_insert_file_extent()
155 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes); in btrfs_insert_file_extent()
156 btrfs_set_file_extent_offset(leaf, item, offset); in btrfs_insert_file_extent()
157 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_file_extent()
158 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes); in btrfs_insert_file_extent()
159 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_file_extent()
160 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_file_extent()
[all …]
|
| H A D | inode-item.c | 11 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf, in btrfs_find_name_in_backref() argument
22 item_size = btrfs_item_size_nr(leaf, slot); in btrfs_find_name_in_backref()
23 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_backref()
26 len = btrfs_inode_ref_name_len(leaf, ref); in btrfs_find_name_in_backref()
31 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) in btrfs_find_name_in_backref()
38 struct extent_buffer *leaf, int slot, u64 ref_objectid, in btrfs_find_name_in_ext_backref() argument
48 item_size = btrfs_item_size_nr(leaf, slot); in btrfs_find_name_in_ext_backref()
49 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_ext_backref()
60 ref_name_len = btrfs_inode_extref_name_len(leaf, extref); in btrfs_find_name_in_ext_backref()
63 btrfs_inode_extref_parent(leaf, extref) == ref_objectid && in btrfs_find_name_in_ext_backref()
[all …]
|
| H A D | xattr.c | 29 struct extent_buffer *leaf; in btrfs_getxattr() local
48 leaf = path->nodes[0]; in btrfs_getxattr()
51 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
56 if (btrfs_dir_data_len(leaf, di) > size) { in btrfs_getxattr()
69 btrfs_dir_name_len(leaf, di)); in btrfs_getxattr()
70 read_extent_buffer(leaf, buffer, data_ptr, in btrfs_getxattr()
71 btrfs_dir_data_len(leaf, di)); in btrfs_getxattr()
72 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
169 struct extent_buffer *leaf = path->nodes[0]; in btrfs_setxattr() local
170 const u16 old_data_len = btrfs_dir_data_len(leaf, di); in btrfs_setxattr()
[all …]
|
| H A D | file.c | 684 struct extent_buffer *leaf; in __btrfs_drop_extents() local
721 leaf = path->nodes[0]; in __btrfs_drop_extents()
722 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in __btrfs_drop_extents()
730 leaf = path->nodes[0]; in __btrfs_drop_extents()
731 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in __btrfs_drop_extents()
741 leaf = path->nodes[0]; in __btrfs_drop_extents()
745 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in __btrfs_drop_extents()
758 fi = btrfs_item_ptr(leaf, path->slots[0], in __btrfs_drop_extents()
760 extent_type = btrfs_file_extent_type(leaf, fi); in __btrfs_drop_extents()
764 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in __btrfs_drop_extents()
[all …]
|
| H A D | extent-tree.c | 47 struct extent_buffer *leaf,
121 struct extent_buffer *leaf; in btrfs_lookup_extent_info() local
171 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
172 item_size = btrfs_item_size_nr(leaf, path->slots[0]); in btrfs_lookup_extent_info()
174 ei = btrfs_item_ptr(leaf, path->slots[0], in btrfs_lookup_extent_info()
176 num_refs = btrfs_extent_refs(leaf, ei); in btrfs_lookup_extent_info()
177 extent_flags = btrfs_extent_flags(leaf, ei); in btrfs_lookup_extent_info()
419 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf, in hash_extent_data_ref_item() argument
422 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref), in hash_extent_data_ref_item()
423 btrfs_extent_data_ref_objectid(leaf, ref), in hash_extent_data_ref_item()
[all …]
|
| H A D | root-tree.c | 210 struct extent_buffer *leaf; in btrfs_find_orphan_roots() local
234 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
235 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_find_orphan_roots()
241 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
244 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_find_orphan_roots()
324 struct extent_buffer *leaf; in btrfs_del_root_ref() local
343 leaf = path->nodes[0]; in btrfs_del_root_ref()
344 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_del_root_ref()
347 if ((btrfs_root_ref_dirid(leaf, ref) != dirid) || in btrfs_del_root_ref()
348 (btrfs_root_ref_name_len(leaf, ref) != name_len) || in btrfs_del_root_ref()
[all …]
|
| H A D | ctree.c | 3078 struct extent_buffer *leaf; in btrfs_search_slot_for_read() local
3091 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3094 if (p->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_search_slot_for_read()
3115 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3116 if (p->slots[0] == btrfs_header_nritems(leaf)) in btrfs_search_slot_for_read()
3652 noinline int btrfs_leaf_free_space(struct extent_buffer *leaf) in btrfs_leaf_free_space() argument
3654 struct btrfs_fs_info *fs_info = leaf->fs_info; in btrfs_leaf_free_space()
3655 int nritems = btrfs_header_nritems(leaf); in btrfs_leaf_free_space()
3658 ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems); in btrfs_leaf_free_space()
3664 leaf_space_used(leaf, 0, nritems), nritems); in btrfs_leaf_free_space()
[all …]
|
| H A D | export.c | 140 struct extent_buffer *leaf; in btrfs_get_parent() local
172 leaf = path->nodes[0]; in btrfs_get_parent()
174 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_get_parent()
181 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_parent()
183 key.objectid = btrfs_root_ref_dirid(leaf, ref); in btrfs_get_parent()
210 struct extent_buffer *leaf; in btrfs_get_name() local
250 leaf = path->nodes[0]; in btrfs_get_name()
253 rref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
256 name_len = btrfs_root_ref_name_len(leaf, rref); in btrfs_get_name()
258 iref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
[all …]
|
| H A D | free-space-tree.c | 57 struct extent_buffer *leaf; in add_new_free_space_info() local
68 leaf = path->nodes[0]; in add_new_free_space_info()
69 info = btrfs_item_ptr(leaf, path->slots[0], in add_new_free_space_info()
71 btrfs_set_free_space_extent_count(leaf, info, 0); in add_new_free_space_info()
72 btrfs_set_free_space_flags(leaf, info, 0); in add_new_free_space_info()
73 btrfs_mark_buffer_dirty(leaf); in add_new_free_space_info()
193 struct extent_buffer *leaf; in convert_free_space_to_bitmaps() local
223 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
227 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in convert_free_space_to_bitmaps()
266 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
[all …]
|
| /OK3568_Linux_fs/kernel/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_dir2_leaf.c | 104 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf1_check() local
107 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); in xfs_dir3_leaf1_check()
116 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf); in xfs_dir3_leaf1_check()
142 struct xfs_dir2_leaf *leaf) in xfs_dir3_leaf_check_int() argument
149 ltp = xfs_dir2_leaf_tail_p(geo, leaf); in xfs_dir3_leaf_check_int()
303 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf_init() local
319 memset(leaf, 0, sizeof(*leaf)); in xfs_dir3_leaf_init()
320 leaf->hdr.info.magic = cpu_to_be16(type); in xfs_dir3_leaf_init()
330 ltp = xfs_dir2_leaf_tail_p(mp->m_dir_geo, leaf); in xfs_dir3_leaf_init()
387 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_block_to_leaf() local
[all …]
|
| H A D | xfs_attr_leaf.c | 73 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
239 struct xfs_attr_leafblock *leaf, in xfs_attr3_leaf_verify_entry() argument
267 lentry = xfs_attr3_leaf_name_local(leaf, idx); in xfs_attr3_leaf_verify_entry()
274 rentry = xfs_attr3_leaf_name_remote(leaf, idx); in xfs_attr3_leaf_verify_entry()
296 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
305 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
317 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) in xfs_attr3_leaf_verify()
335 fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, in xfs_attr3_leaf_verify()
978 struct xfs_attr_leafblock *leaf; in xfs_attr_shortform_allfit() local
986 leaf = bp->b_addr; in xfs_attr_shortform_allfit()
[all …]
|
| /OK3568_Linux_fs/kernel/fs/unicode/ |
| H A D | utf8-norm.c | 408 utf8leaf_t *leaf; in utf8agemax() local
417 leaf = utf8lookup(data, hangul, s); in utf8agemax()
418 if (!leaf) in utf8agemax()
421 leaf_age = utf8agetab[LEAF_GEN(leaf)]; in utf8agemax()
437 utf8leaf_t *leaf; in utf8agemin() local
446 leaf = utf8lookup(data, hangul, s); in utf8agemin()
447 if (!leaf) in utf8agemin()
449 leaf_age = utf8agetab[LEAF_GEN(leaf)]; in utf8agemin()
464 utf8leaf_t *leaf; in utf8nagemax() local
473 leaf = utf8nlookup(data, hangul, s, len); in utf8nagemax()
[all …]
|
| 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 …]
|
| /OK3568_Linux_fs/kernel/drivers/net/ethernet/dec/tulip/ |
| H A D | eeprom.c | 242 struct medialeaf *leaf = &mtable->mleaf[i]; in tulip_parse_eeprom() local
245 leaf->type = 0; in tulip_parse_eeprom()
246 leaf->media = p[0] & 0x3f; in tulip_parse_eeprom()
247 leaf->leafdata = p; in tulip_parse_eeprom()
252 leaf->type = p[1]; in tulip_parse_eeprom()
255 leaf->media = p[2] & 0x0f; in tulip_parse_eeprom()
261 leaf->leafdata = p + 2; in tulip_parse_eeprom()
268 leaf->media = 11; in tulip_parse_eeprom()
274 leaf->media = p[2] & MEDIA_MASK; in tulip_parse_eeprom()
276 if (tp->chip_id == DM910X && leaf->media == 1) in tulip_parse_eeprom()
[all …]
|
| /OK3568_Linux_fs/kernel/arch/x86/kernel/cpu/ |
| H A D | topology.c | 35 static int check_extended_topology_leaf(int leaf) in check_extended_topology_leaf() argument
39 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in check_extended_topology_leaf()
69 int leaf; in detect_extended_topology_early() local
71 leaf = detect_extended_topology_leaf(c); in detect_extended_topology_early()
72 if (leaf < 0) in detect_extended_topology_early()
77 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in detect_extended_topology_early()
101 int leaf; in detect_extended_topology() local
103 leaf = detect_extended_topology_leaf(c); in detect_extended_topology()
104 if (leaf < 0) in detect_extended_topology()
110 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in detect_extended_topology()
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | traits.hpp | 78 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 …typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_con…
90 …typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iter…
125 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
130 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | traits.hpp | 78 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 …typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_con…
90 …typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iter…
125 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
130 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
[all …]
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/binutils/binutils/ |
| H A D | 0020-CVE-2023-22608-1.patch | 62 + and when we get to a leaf, we scan through it linearly. Interior nodes
66 + until we hit a leaf. (Nodes are, in general, leaves until they exceed the
73 + For a binary with few ranges, we will in practice only have a single leaf
78 +/* Experiments have shown 16 to be a memory-efficient default leaf size.
79 + The only case where a leaf will hold more memory than this, is at the
81 + the leaf to be able to hold more ranges if needed.
90 + Otherwise, how many ranges we have room for in this leaf. */
112 + struct trie_leaf *leaf =
114 + if (leaf == NULL)
116 + leaf->head.num_room_in_leaf = TRIE_LEAF_SIZE;
[all …]
|
| /OK3568_Linux_fs/kernel/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++; \
|
| /OK3568_Linux_fs/kernel/net/ipv6/ |
| H A D | ip6_fib.c | 244 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
460 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
461 w->leaf = NULL; in fib6_node_dump()
522 w->leaf = rt; in fib6_dump_node()
543 w->leaf = NULL; in fib6_dump_node()
759 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
761 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
787 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
788 fib6_info_release(leaf); in fib6_add_1()
791 rcu_access_pointer(fn->leaf) == in fib6_add_1()
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/infiniband/hw/i40iw/ |
| H A D | i40iw_pble.c | 427 struct i40iw_pble_info *leaf = lvl2->leaf; in free_lvl2() local
431 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in free_lvl2()
432 if (leaf->addr) in free_lvl2()
433 gen_pool_free(pool, leaf->addr, (leaf->cnt << 3)); in free_lvl2()
441 kfree(lvl2->leaf); in free_lvl2()
442 lvl2->leaf = NULL; in free_lvl2()
460 struct i40iw_pble_info *leaf; in get_lvl2_pble() local
468 leaf = kzalloc((sizeof(*leaf) * total), GFP_ATOMIC); in get_lvl2_pble()
469 if (!leaf) in get_lvl2_pble()
471 lvl2->leaf = leaf; in get_lvl2_pble()
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/net/can/usb/kvaser_usb/ |
| H A D | kvaser_usb_leaf.c | 174 } __packed leaf; member
297 } __packed leaf; member
320 [CMD_GET_SOFTWARE_INFO_REPLY] = kvaser_fsize(u.leaf.softinfo),
321 [CMD_RX_STD_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
322 [CMD_RX_EXT_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
323 [CMD_LEAF_LOG_MESSAGE] = kvaser_fsize(u.leaf.log_message),
324 [CMD_CHIP_STATE_EVENT] = kvaser_fsize(u.leaf.chip_state_event),
325 [CMD_CAN_ERROR_EVENT] = kvaser_fsize(u.leaf.error_event),
359 } leaf; member
489 cmd_tx_can_flags = &cmd->u.tx_can.leaf.flags; in kvaser_usb_leaf_frame_to_cmd()
[all …]
|