| /linux-4.4.14/fs/btrfs/ |
| D | dir-item.c | 44 struct extent_buffer *leaf; in insert_with_overflow() local
56 leaf = path->nodes[0]; in insert_with_overflow()
58 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
59 BUG_ON(data_size > btrfs_item_size(leaf, item)); in insert_with_overflow()
60 ptr += btrfs_item_size(leaf, item) - data_size; in insert_with_overflow()
79 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
95 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
97 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
98 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
99 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
|
| D | inode-item.c | 28 struct extent_buffer *leaf; in find_name_in_backref() local
36 leaf = path->nodes[0]; in find_name_in_backref()
37 item_size = btrfs_item_size_nr(leaf, path->slots[0]); in find_name_in_backref()
38 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in find_name_in_backref()
41 len = btrfs_inode_ref_name_len(leaf, ref); in find_name_in_backref()
46 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) { in find_name_in_backref()
58 struct extent_buffer *leaf; in btrfs_find_name_in_ext_backref() local
66 leaf = path->nodes[0]; in btrfs_find_name_in_ext_backref()
67 item_size = btrfs_item_size_nr(leaf, path->slots[0]); in btrfs_find_name_in_ext_backref()
68 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in btrfs_find_name_in_ext_backref()
[all …]
|
| D | file-item.c | 51 struct extent_buffer *leaf; in btrfs_insert_file_extent() local
66 leaf = path->nodes[0]; in btrfs_insert_file_extent()
67 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_file_extent()
69 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset); in btrfs_insert_file_extent()
70 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes); in btrfs_insert_file_extent()
71 btrfs_set_file_extent_offset(leaf, item, offset); in btrfs_insert_file_extent()
72 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_file_extent()
73 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes); in btrfs_insert_file_extent()
74 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_file_extent()
75 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_file_extent()
[all …]
|
| D | xattr.c | 41 struct extent_buffer *leaf; in __btrfs_getxattr() local
60 leaf = path->nodes[0]; in __btrfs_getxattr()
63 ret = btrfs_dir_data_len(leaf, di); in __btrfs_getxattr()
68 if (btrfs_dir_data_len(leaf, di) > size) { in __btrfs_getxattr()
81 btrfs_dir_name_len(leaf, di)); in __btrfs_getxattr()
82 read_extent_buffer(leaf, buffer, data_ptr, in __btrfs_getxattr()
83 btrfs_dir_data_len(leaf, di)); in __btrfs_getxattr()
84 ret = btrfs_dir_data_len(leaf, di); in __btrfs_getxattr()
179 struct extent_buffer *leaf = path->nodes[0]; in do_setxattr() local
180 const u16 old_data_len = btrfs_dir_data_len(leaf, di); in do_setxattr()
[all …]
|
| D | file.c | 699 struct extent_buffer *leaf; in __btrfs_drop_extents() local
734 leaf = path->nodes[0]; in __btrfs_drop_extents()
735 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in __btrfs_drop_extents()
743 leaf = path->nodes[0]; in __btrfs_drop_extents()
744 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in __btrfs_drop_extents()
754 leaf = path->nodes[0]; in __btrfs_drop_extents()
758 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in __btrfs_drop_extents()
771 fi = btrfs_item_ptr(leaf, path->slots[0], in __btrfs_drop_extents()
773 extent_type = btrfs_file_extent_type(leaf, fi); in __btrfs_drop_extents()
777 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in __btrfs_drop_extents()
[all …]
|
| D | root-tree.c | 225 struct extent_buffer *leaf; in btrfs_find_orphan_roots() local
255 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
256 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_find_orphan_roots()
262 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
265 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_find_orphan_roots()
365 struct extent_buffer *leaf; in btrfs_del_root_ref() local
382 leaf = path->nodes[0]; in btrfs_del_root_ref()
383 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_del_root_ref()
386 WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid); in btrfs_del_root_ref()
387 WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len); in btrfs_del_root_ref()
[all …]
|
| D | ctree.c | 1734 struct extent_buffer *leaf) in leaf_data_end() argument
1736 u32 nr = btrfs_header_nritems(leaf); in leaf_data_end()
1739 return btrfs_item_offset_nr(leaf, nr - 1); in leaf_data_end()
3067 struct extent_buffer *leaf; in btrfs_search_slot_for_read() local
3080 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3083 if (p->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_search_slot_for_read()
3104 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
3105 if (p->slots[0] == btrfs_header_nritems(leaf)) in btrfs_search_slot_for_read()
3574 struct extent_buffer *leaf) in btrfs_leaf_free_space() argument
3576 int nritems = btrfs_header_nritems(leaf); in btrfs_leaf_free_space()
[all …]
|
| D | export.c | 158 struct extent_buffer *leaf; in btrfs_get_parent() local
190 leaf = path->nodes[0]; in btrfs_get_parent()
192 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_get_parent()
199 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_parent()
201 key.objectid = btrfs_root_ref_dirid(leaf, ref); in btrfs_get_parent()
229 struct extent_buffer *leaf; in btrfs_get_name() local
272 leaf = path->nodes[0]; in btrfs_get_name()
275 rref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
278 name_len = btrfs_root_ref_name_len(leaf, rref); in btrfs_get_name()
280 iref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
[all …]
|
| D | inode.c | 143 struct extent_buffer *leaf; in insert_inline_extent() local
175 leaf = path->nodes[0]; in insert_inline_extent()
176 ei = btrfs_item_ptr(leaf, path->slots[0], in insert_inline_extent()
178 btrfs_set_file_extent_generation(leaf, ei, trans->transid); in insert_inline_extent()
179 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); in insert_inline_extent()
180 btrfs_set_file_extent_encryption(leaf, ei, 0); in insert_inline_extent()
181 btrfs_set_file_extent_other_encoding(leaf, ei, 0); in insert_inline_extent()
182 btrfs_set_file_extent_ram_bytes(leaf, ei, size); in insert_inline_extent()
194 write_extent_buffer(leaf, kaddr, ptr, cur_size); in insert_inline_extent()
201 btrfs_set_file_extent_compression(leaf, ei, in insert_inline_extent()
[all …]
|
| D | props.c | 175 struct extent_buffer *leaf; in iterate_object_props() local
181 leaf = path->nodes[0]; in iterate_object_props()
183 if (slot >= btrfs_header_nritems(leaf)) { in iterate_object_props()
192 btrfs_item_key_to_cpu(leaf, &key, slot); in iterate_object_props()
202 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item); in iterate_object_props()
204 total_len = btrfs_item_size_nr(leaf, slot); in iterate_object_props()
207 u32 name_len = btrfs_dir_name_len(leaf, di); in iterate_object_props()
208 u32 data_len = btrfs_dir_data_len(leaf, di); in iterate_object_props()
217 memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX, in iterate_object_props()
231 read_extent_buffer(leaf, name_buf, name_ptr, name_len); in iterate_object_props()
[all …]
|
| D | extent-tree.c | 87 struct extent_buffer *leaf,
405 struct extent_buffer *leaf; in caching_thread() local
456 leaf = path->nodes[0]; in caching_thread()
457 nritems = btrfs_header_nritems(leaf); in caching_thread()
466 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in caching_thread()
488 leaf = path->nodes[0]; in caching_thread()
489 nritems = btrfs_header_nritems(leaf); in caching_thread()
813 struct extent_buffer *leaf; in btrfs_lookup_extent_info() local
864 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
865 item_size = btrfs_item_size_nr(leaf, path->slots[0]); in btrfs_lookup_extent_info()
[all …]
|
| D | volumes.c | 1424 struct extent_buffer *leaf = NULL; in btrfs_free_dev_extent() local
1441 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1442 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_free_dev_extent()
1443 extent = btrfs_item_ptr(leaf, path->slots[0], in btrfs_free_dev_extent()
1446 btrfs_dev_extent_length(leaf, extent) < start); in btrfs_free_dev_extent()
1451 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1452 extent = btrfs_item_ptr(leaf, path->slots[0], in btrfs_free_dev_extent()
1459 *dev_extent_len = btrfs_dev_extent_length(leaf, extent); in btrfs_free_dev_extent()
1482 struct extent_buffer *leaf; in btrfs_alloc_dev_extent() local
1499 leaf = path->nodes[0]; in btrfs_alloc_dev_extent()
[all …]
|
| D | backref.c | 721 struct extent_buffer *leaf; in __add_inline_refs() local
733 leaf = path->nodes[0]; in __add_inline_refs()
736 item_size = btrfs_item_size_nr(leaf, slot); in __add_inline_refs()
739 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); in __add_inline_refs()
740 flags = btrfs_extent_flags(leaf, ei); in __add_inline_refs()
741 *total_refs += btrfs_extent_refs(leaf, ei); in __add_inline_refs()
742 btrfs_item_key_to_cpu(leaf, &found_key, slot); in __add_inline_refs()
752 *info_level = btrfs_tree_block_level(leaf, info); in __add_inline_refs()
767 type = btrfs_extent_inline_ref_type(leaf, iref); in __add_inline_refs()
768 offset = btrfs_extent_inline_ref_offset(leaf, iref); in __add_inline_refs()
[all …]
|
| D | tree-log.c | 635 struct extent_buffer *leaf; in replay_one_extent() local
637 leaf = path->nodes[0]; in replay_one_extent()
638 existing = btrfs_item_ptr(leaf, path->slots[0], in replay_one_extent()
643 read_extent_buffer(leaf, &cmp2, (unsigned long)existing, in replay_one_extent()
830 struct extent_buffer *leaf; in drop_one_dir_item() local
834 leaf = path->nodes[0]; in drop_one_dir_item()
836 btrfs_dir_item_key_to_cpu(leaf, di, &location); in drop_one_dir_item()
837 name_len = btrfs_dir_name_len(leaf, di); in drop_one_dir_item()
842 read_extent_buffer(leaf, name, (unsigned long)(di + 1), name_len); in drop_one_dir_item()
980 struct extent_buffer *leaf; in __add_inode_ref() local
[all …]
|
| D | relocation.c | 601 struct extent_buffer *leaf, in find_tree_root() argument
605 u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); in find_tree_root()
606 u64 generation = btrfs_ref_generation_v0(leaf, ref0); in find_tree_root()
622 int find_inline_backref(struct extent_buffer *leaf, int slot, in find_inline_backref() argument
630 btrfs_item_key_to_cpu(leaf, &key, slot); in find_inline_backref()
632 item_size = btrfs_item_size_nr(leaf, slot); in find_inline_backref()
639 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); in find_inline_backref()
640 WARN_ON(!(btrfs_extent_flags(leaf, ei) & in find_inline_backref()
1583 struct extent_buffer *leaf; local
1600 leaf = path->nodes[0];
[all …]
|
| D | uuid-tree.c | 266 struct extent_buffer *leaf; in btrfs_uuid_tree_iterate() local
291 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
293 btrfs_item_key_to_cpu(leaf, &key, slot); in btrfs_uuid_tree_iterate()
299 offset = btrfs_item_ptr_offset(leaf, slot); in btrfs_uuid_tree_iterate()
300 item_size = btrfs_item_size_nr(leaf, slot); in btrfs_uuid_tree_iterate()
313 read_extent_buffer(leaf, &subid_le, offset, in btrfs_uuid_tree_iterate()
|
| D | inode-map.c | 36 struct extent_buffer *leaf; in caching_kthread() local
68 leaf = path->nodes[0]; in caching_kthread()
70 if (slot >= btrfs_header_nritems(leaf)) { in caching_kthread()
79 leaf = path->nodes[0]; in caching_kthread()
81 if (WARN_ON(btrfs_header_nritems(leaf) == 0)) in caching_kthread()
88 btrfs_item_key_to_cpu(leaf, &key, 0); in caching_kthread()
98 btrfs_item_key_to_cpu(leaf, &key, slot); in caching_kthread()
|
| D | delayed-inode.c | 730 struct extent_buffer *leaf; in btrfs_batch_insert_items() local
742 leaf = path->nodes[0]; in btrfs_batch_insert_items()
743 free_space = btrfs_leaf_free_space(root, leaf); in btrfs_batch_insert_items()
810 data_ptr = btrfs_item_ptr(leaf, slot, char); in btrfs_batch_insert_items()
811 write_extent_buffer(leaf, &curr->data, in btrfs_batch_insert_items()
838 struct extent_buffer *leaf; in btrfs_insert_delayed_item() local
847 leaf = path->nodes[0]; in btrfs_insert_delayed_item()
849 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in btrfs_insert_delayed_item()
851 write_extent_buffer(leaf, delayed_item->data, (unsigned long)ptr, in btrfs_insert_delayed_item()
853 btrfs_mark_buffer_dirty(leaf); in btrfs_insert_delayed_item()
[all …]
|
| D | qgroup.c | 571 struct extent_buffer *leaf; in add_qgroup_item() local
596 leaf = path->nodes[0]; in add_qgroup_item()
597 qgroup_info = btrfs_item_ptr(leaf, path->slots[0], in add_qgroup_item()
599 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid); in add_qgroup_item()
600 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0); in add_qgroup_item()
601 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0); in add_qgroup_item()
602 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0); in add_qgroup_item()
603 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0); in add_qgroup_item()
605 btrfs_mark_buffer_dirty(leaf); in add_qgroup_item()
615 leaf = path->nodes[0]; in add_qgroup_item()
[all …]
|
| D | disk-io.c | 539 struct extent_buffer *leaf) in check_leaf() argument
543 u32 nritems = btrfs_header_nritems(leaf); in check_leaf()
550 if (btrfs_item_offset_nr(leaf, 0) + btrfs_item_size_nr(leaf, 0) != in check_leaf()
552 CORRUPT("invalid item offset size pair", leaf, root, 0); in check_leaf()
564 btrfs_item_key_to_cpu(leaf, &leaf_key, slot); in check_leaf()
565 btrfs_item_key_to_cpu(leaf, &key, slot + 1); in check_leaf()
569 CORRUPT("bad key order", leaf, root, slot); in check_leaf()
578 if (btrfs_item_offset_nr(leaf, slot) != in check_leaf()
579 btrfs_item_end_nr(leaf, slot + 1)) { in check_leaf()
580 CORRUPT("slot offset bad", leaf, root, slot); in check_leaf()
[all …]
|
| D | free-space-cache.c | 54 struct extent_buffer *leaf; in __lookup_free_space_inode() local
70 leaf = path->nodes[0]; in __lookup_free_space_inode()
71 header = btrfs_item_ptr(leaf, path->slots[0], in __lookup_free_space_inode()
73 btrfs_free_space_key(leaf, header, &disk_key); in __lookup_free_space_inode()
140 struct extent_buffer *leaf; in __create_free_space_inode() local
152 leaf = path->nodes[0]; in __create_free_space_inode()
153 inode_item = btrfs_item_ptr(leaf, path->slots[0], in __create_free_space_inode()
155 btrfs_item_key(leaf, &disk_key, path->slots[0]); in __create_free_space_inode()
156 memset_extent_buffer(leaf, 0, (unsigned long)inode_item, in __create_free_space_inode()
158 btrfs_set_inode_generation(leaf, inode_item, trans->transid); in __create_free_space_inode()
[all …]
|
| D | ioctl.c | 442 struct extent_buffer *leaf; in create_subvol() local
491 leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0); in create_subvol()
492 if (IS_ERR(leaf)) { in create_subvol()
493 ret = PTR_ERR(leaf); in create_subvol()
497 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header)); in create_subvol()
498 btrfs_set_header_bytenr(leaf, leaf->start); in create_subvol()
499 btrfs_set_header_generation(leaf, trans->transid); in create_subvol()
500 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV); in create_subvol()
501 btrfs_set_header_owner(leaf, objectid); in create_subvol()
503 write_extent_buffer(leaf, root->fs_info->fsid, btrfs_header_fsid(), in create_subvol()
[all …]
|
| D | send.c | 2310 struct extent_buffer *leaf; in send_subvol_begin() local
2337 leaf = path->nodes[0]; in send_subvol_begin()
2338 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in send_subvol_begin()
2344 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); in send_subvol_begin()
2345 namelen = btrfs_root_ref_name_len(leaf, ref); in send_subvol_begin()
2346 read_extent_buffer(leaf, name, (unsigned long)(ref + 1), namelen); in send_subvol_begin()
4776 struct extent_buffer *leaf = path->nodes[0]; in clone_range() local
4783 if (slot >= btrfs_header_nritems(leaf)) { in clone_range()
4792 btrfs_item_key_to_cpu(leaf, &key, slot); in clone_range()
4802 ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); in clone_range()
[all …]
|
| D | ctree.h | 3354 #define btrfs_item_ptr(leaf, slot, type) \ argument
3355 ((type *)(btrfs_leaf_data(leaf) + \
3356 btrfs_item_offset_nr(leaf, slot)))
3358 #define btrfs_item_ptr_offset(leaf, slot) \ argument
3359 ((unsigned long)(btrfs_leaf_data(leaf) + \
3360 btrfs_item_offset_nr(leaf, slot)))
3701 int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf);
3832 struct extent_buffer *leaf,
|
| /linux-4.4.14/drivers/net/ethernet/dec/tulip/ |
| D | eeprom.c | 244 struct medialeaf *leaf = &mtable->mleaf[i]; in tulip_parse_eeprom() local
247 leaf->type = 0; in tulip_parse_eeprom()
248 leaf->media = p[0] & 0x3f; in tulip_parse_eeprom()
249 leaf->leafdata = p; in tulip_parse_eeprom()
254 leaf->type = p[1]; in tulip_parse_eeprom()
257 leaf->media = p[2] & 0x0f; in tulip_parse_eeprom()
263 leaf->leafdata = p + 2; in tulip_parse_eeprom()
270 leaf->media = 11; in tulip_parse_eeprom()
276 leaf->media = p[2] & MEDIA_MASK; in tulip_parse_eeprom()
278 if (tp->chip_id == DM910X && leaf->media == 1) in tulip_parse_eeprom()
[all …]
|
| /linux-4.4.14/fs/xfs/libxfs/ |
| D | xfs_dir2_leaf.c | 64 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf1_check() local
67 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); in xfs_dir3_leaf1_check()
76 return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf); in xfs_dir3_leaf1_check()
87 struct xfs_dir2_leaf *leaf) in xfs_dir3_leaf_check_int() argument
104 ops->leaf_hdr_from_disk(&leafhdr, leaf); in xfs_dir3_leaf_check_int()
108 ents = ops->leaf_ents_p(leaf); in xfs_dir3_leaf_check_int()
109 ltp = xfs_dir2_leaf_tail_p(geo, leaf); in xfs_dir3_leaf_check_int()
151 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf_verify() local
171 if (leaf->hdr.info.magic != cpu_to_be16(magic)) in xfs_dir3_leaf_verify()
175 return xfs_dir3_leaf_check_int(mp, NULL, NULL, leaf); in xfs_dir3_leaf_verify()
[all …]
|
| D | xfs_attr_leaf.c | 88 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
255 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
258 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
834 struct xfs_attr_leafblock *leaf; in xfs_attr_shortform_allfit() local
842 leaf = bp->b_addr; in xfs_attr_shortform_allfit()
843 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); in xfs_attr_shortform_allfit()
844 entry = xfs_attr3_leaf_entryp(leaf); in xfs_attr_shortform_allfit()
852 name_loc = xfs_attr3_leaf_name_local(leaf, i); in xfs_attr_shortform_allfit()
877 struct xfs_attr_leafblock *leaf; in xfs_attr3_leaf_to_shortform() local
895 leaf = (xfs_attr_leafblock_t *)tmpbuffer; in xfs_attr3_leaf_to_shortform()
[all …]
|
| D | xfs_dir2_node.c | 67 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leafn_check() local
70 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); in xfs_dir3_leafn_check()
79 return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf); in xfs_dir3_leafn_check()
300 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_leaf_to_node() local
328 leaf = lbp->b_addr; in xfs_dir2_leaf_to_node()
329 ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); in xfs_dir2_leaf_to_node()
361 if (leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC)) in xfs_dir2_leaf_to_node()
362 leaf->hdr.info.magic = cpu_to_be16(XFS_DIR2_LEAFN_MAGIC); in xfs_dir2_leaf_to_node()
364 leaf->hdr.info.magic = cpu_to_be16(XFS_DIR3_LEAFN_MAGIC); in xfs_dir2_leaf_to_node()
385 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_leafn_add() local
[all …]
|
| D | xfs_bmap_btree.h | 133 extern int xfs_bmdr_maxrecs(int blocklen, int leaf);
134 extern int xfs_bmbt_maxrecs(struct xfs_mount *, int blocklen, int leaf);
|
| D | xfs_attr_leaf.h | 74 int xfs_attr3_leaf_lookup_int(struct xfs_buf *leaf,
|
| D | xfs_bmap_btree.c | 819 int leaf) in xfs_bmbt_maxrecs() argument
823 if (leaf) in xfs_bmbt_maxrecs()
834 int leaf) in xfs_bmdr_maxrecs() argument
838 if (leaf) in xfs_bmdr_maxrecs()
|
| D | xfs_dir2_block.c | 914 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_leaf_to_block() local
933 leaf = lbp->b_addr; in xfs_dir2_leaf_to_block()
934 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); in xfs_dir2_leaf_to_block()
935 ents = dp->d_ops->leaf_ents_p(leaf); in xfs_dir2_leaf_to_block()
936 ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); in xfs_dir2_leaf_to_block()
|
| D | xfs_ialloc_btree.c | 423 int leaf) in xfs_inobt_maxrecs() argument
427 if (leaf) in xfs_inobt_maxrecs()
|
| D | xfs_dir2_priv.h | 92 struct xfs_dir3_icleaf_hdr *hdr, struct xfs_dir2_leaf *leaf);
|
| D | xfs_alloc_btree.c | 497 int leaf) in xfs_allocbt_maxrecs() argument
501 if (leaf) in xfs_allocbt_maxrecs()
|
| D | xfs_da_btree.c | 521 struct xfs_dir2_leaf *leaf; in xfs_da3_root_split() local
563 leaf = (xfs_dir2_leaf_t *)oldroot; in xfs_da3_root_split()
564 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); in xfs_da3_root_split()
565 ents = dp->d_ops->leaf_ents_p(leaf); in xfs_da3_root_split()
569 size = (int)((char *)&ents[leafhdr.count] - (char *)leaf); in xfs_da3_root_split()
|
| /linux-4.4.14/net/ipv6/ |
| D | ip6_fib.c | 221 table->tb6_root.leaf = net->ipv6.ip6_null_entry; in fib6_alloc_table()
314 for (rt = w->leaf; rt; rt = rt->dst.rt6_next) { in fib6_dump_node()
318 w->leaf = rt; in fib6_dump_node()
322 w->leaf = NULL; in fib6_dump_node()
479 key = (struct rt6key *)((u8 *)fn->leaf + offset); in fib6_add_1()
503 rt6_release(fn->leaf); in fib6_add_1()
504 fn->leaf = NULL; in fib6_add_1()
608 in->leaf = fn->leaf; in fib6_add_1()
609 atomic_inc(&in->leaf->rt6i_ref); in fib6_add_1()
716 if (!(fn->fn_flags & RTN_RTINFO) && fn->leaf == rt) { in fib6_purge_rt()
[all …]
|
| D | route.c | 703 for (rt = fn->leaf; rt && rt != rr_head; rt = rt->dst.rt6_next) { in find_rr_leaf()
729 fn->rr_ptr = rt0 = fn->leaf; in rt6_select()
739 next = fn->leaf; in rt6_select()
857 rt = fn->leaf; in ip6_pol_route_lookup()
1444 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) { in __ip6_route_redirect()
2074 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) { in ip6_route_del()
2268 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) { in rt6_get_route_info()
2323 for (rt = table->tb6_root.leaf; rt; rt = rt->dst.rt6_next) { in rt6_get_dflt_router()
2369 for (rt = table->tb6_root.leaf; rt; rt = rt->dst.rt6_next) { in rt6_purge_dflt_routers()
|
| D | addrconf.c | 2202 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) { in addrconf_get_prefix_route()
|
| /linux-4.4.14/arch/arm64/kernel/ |
| D | topology.c | 52 bool leaf = true; in parse_core() local
61 leaf = false; in parse_core()
80 if (!leaf) { in parse_core()
88 } else if (leaf) { in parse_core()
99 bool leaf = true; in parse_cluster() local
116 leaf = false; in parse_cluster()
140 if (leaf) { in parse_cluster()
155 if (leaf && !has_cores) in parse_cluster()
158 if (leaf) in parse_cluster()
|
| /linux-4.4.14/net/sched/ |
| D | sch_htb.c | 132 } leaf; member
547 WARN_ON(cl->level || !cl->un.leaf.q || !cl->un.leaf.q->q.qlen); in htb_activate()
552 list_add_tail(&cl->un.leaf.drop_list, in htb_activate()
569 list_del_init(&cl->un.leaf.drop_list); in htb_deactivate()
593 } else if ((ret = qdisc_enqueue(skb, cl->un.leaf.q)) != NET_XMIT_SUCCESS) { in htb_enqueue()
834 if (unlikely(cl->un.leaf.q->q.qlen == 0)) { in htb_dequeue_tree()
850 skb = cl->un.leaf.q->dequeue(cl->un.leaf.q); in htb_dequeue_tree()
854 qdisc_warn_nonwc("htb", cl->un.leaf.q); in htb_dequeue_tree()
863 cl->un.leaf.deficit[level] -= qdisc_pkt_len(skb); in htb_dequeue_tree()
864 if (cl->un.leaf.deficit[level] < 0) { in htb_dequeue_tree()
[all …]
|
| D | sch_api.c | 164 if (!(cops->get && cops->put && cops->walk && cops->leaf)) in register_qdisc()
315 struct Qdisc *leaf; in qdisc_leaf() local
324 leaf = cops->leaf(p, cl); in qdisc_leaf()
326 return leaf; in qdisc_leaf()
1093 struct Qdisc *leaf; in check_loop_fn() local
1097 leaf = cops->leaf(q, cl); in check_loop_fn()
1098 if (leaf) { in check_loop_fn()
1099 if (leaf == arg->p || arg->depth > 7) in check_loop_fn()
1101 return check_loop(leaf, arg->p, arg->depth + 1); in check_loop_fn()
|
| D | sch_ingress.c | 83 .leaf = ingress_leaf,
|
| D | sch_mq.c | 229 .leaf = mq_leaf,
|
| D | sch_multiq.c | 399 .leaf = multiq_leaf,
|
| D | sch_prio.c | 362 .leaf = prio_leaf,
|
| D | sch_red.c | 350 .leaf = red_leaf,
|
| D | sch_mqprio.c | 396 .leaf = mqprio_leaf,
|
| D | sch_dsmark.c | 472 .leaf = dsmark_leaf,
|
| D | sch_tbf.c | 541 .leaf = tbf_leaf,
|
| D | sch_drr.c | 493 .leaf = drr_class_leaf,
|
| D | sch_atm.c | 654 .leaf = atm_tc_leaf,
|
| D | sch_fq_codel.c | 621 .leaf = fq_codel_leaf,
|
| D | sch_sfb.c | 672 .leaf = sfb_leaf,
|
| D | sch_sfq.c | 881 .leaf = sfq_leaf,
|
| D | sch_netem.c | 1131 .leaf = netem_leaf,
|
| D | sch_qfq.c | 1549 .leaf = qfq_class_leaf,
|
| D | sch_hfsc.c | 1709 .leaf = hfsc_class_leaf,
|
| D | Kconfig | 59 want to use as leaf disciplines.
|
| D | sch_cbq.c | 2016 .leaf = cbq_leaf,
|
| /linux-4.4.14/fs/gfs2/ |
| D | dir.c | 780 struct gfs2_leaf *leaf; in gfs2_dirent_search() local
798 leaf = (struct gfs2_leaf *)bh->b_data; in gfs2_dirent_search()
799 ln = be64_to_cpu(leaf->lf_next); in gfs2_dirent_search()
831 struct gfs2_leaf *leaf; in new_leaf() local
846 leaf = (struct gfs2_leaf *)bh->b_data; in new_leaf()
847 leaf->lf_depth = cpu_to_be16(depth); in new_leaf()
848 leaf->lf_entries = 0; in new_leaf()
849 leaf->lf_dirent_format = cpu_to_be32(GFS2_FORMAT_DE); in new_leaf()
850 leaf->lf_next = 0; in new_leaf()
851 leaf->lf_inode = cpu_to_be64(ip->i_no_addr); in new_leaf()
[all …]
|
| /linux-4.4.14/fs/btrfs/tests/ |
| D | qgroup-tests.c | 42 struct extent_buffer *leaf; in insert_normal_tree_ref() local
67 leaf = path->nodes[0]; in insert_normal_tree_ref()
68 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); in insert_normal_tree_ref()
69 btrfs_set_extent_refs(leaf, item, 1); in insert_normal_tree_ref()
70 btrfs_set_extent_generation(leaf, item, 1); in insert_normal_tree_ref()
71 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_TREE_BLOCK); in insert_normal_tree_ref()
73 btrfs_set_tree_block_level(leaf, block_info, 1); in insert_normal_tree_ref()
76 btrfs_set_extent_inline_ref_type(leaf, iref, in insert_normal_tree_ref()
78 btrfs_set_extent_inline_ref_offset(leaf, iref, parent); in insert_normal_tree_ref()
80 btrfs_set_extent_inline_ref_type(leaf, iref, BTRFS_TREE_BLOCK_REF_KEY); in insert_normal_tree_ref()
[all …]
|
| D | inode-tests.c | 32 struct extent_buffer *leaf = root->node; in insert_extent() local
40 path.nodes[0] = leaf; in insert_extent()
49 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); in insert_extent()
50 btrfs_set_file_extent_generation(leaf, fi, 1); in insert_extent()
51 btrfs_set_file_extent_type(leaf, fi, type); in insert_extent()
52 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr); in insert_extent()
53 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_len); in insert_extent()
54 btrfs_set_file_extent_offset(leaf, fi, offset); in insert_extent()
55 btrfs_set_file_extent_num_bytes(leaf, fi, len); in insert_extent()
56 btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes); in insert_extent()
[all …]
|
| /linux-4.4.14/drivers/net/can/usb/ |
| D | kvaser_usb.c | 264 } __packed leaf; member
406 } __packed leaf; member
437 } leaf; member
663 dev->fw_version = le32_to_cpu(msg.u.leaf.softinfo.fw_version); in kvaser_usb_get_software_info()
665 le16_to_cpu(msg.u.leaf.softinfo.max_outstanding_tx); in kvaser_usb_get_software_info()
866 if (es->leaf.error_factor) { in kvaser_usb_rx_error_update_can_state()
943 if (es->leaf.error_factor) { in kvaser_usb_rx_error()
946 if (es->leaf.error_factor & M16C_EF_ACKE) in kvaser_usb_rx_error()
948 if (es->leaf.error_factor & M16C_EF_CRCE) in kvaser_usb_rx_error()
950 if (es->leaf.error_factor & M16C_EF_FORME) in kvaser_usb_rx_error()
[all …]
|
| /linux-4.4.14/fs/xfs/ |
| D | xfs_attr_list.c | 222 xfs_attr_leafblock_t *leaf; in xfs_attr_node_list() local
261 leaf = bp->b_addr; in xfs_attr_node_list()
263 &leafhdr, leaf); in xfs_attr_node_list()
264 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr_node_list()
341 leaf = bp->b_addr; in xfs_attr_node_list()
347 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); in xfs_attr_node_list()
369 struct xfs_attr_leafblock *leaf; in xfs_attr3_leaf_list_int() local
379 leaf = bp->b_addr; in xfs_attr3_leaf_list_int()
380 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_list_int()
381 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_list_int()
[all …]
|
| D | xfs_attr_inactive.c | 124 struct xfs_attr_leafblock *leaf; in xfs_attr3_leaf_inactive() local
137 leaf = bp->b_addr; in xfs_attr3_leaf_inactive()
138 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_inactive()
144 entry = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_inactive()
148 name_rmt = xfs_attr3_leaf_name_remote(leaf, i); in xfs_attr3_leaf_inactive()
172 entry = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_inactive()
176 name_rmt = xfs_attr3_leaf_name_remote(leaf, i); in xfs_attr3_leaf_inactive()
|
| /linux-4.4.14/ipc/ |
| D | mqueue.c | 123 struct posix_msg_tree_node *leaf; in msg_insert() local
128 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); in msg_insert()
130 if (likely(leaf->priority == msg->m_type)) in msg_insert()
132 else if (msg->m_type < leaf->priority) in msg_insert()
138 leaf = info->node_cache; in msg_insert()
141 leaf = kmalloc(sizeof(*leaf), GFP_ATOMIC); in msg_insert()
142 if (!leaf) in msg_insert()
144 INIT_LIST_HEAD(&leaf->msg_list); in msg_insert()
146 leaf->priority = msg->m_type; in msg_insert()
147 rb_link_node(&leaf->rb_node, parent, p); in msg_insert()
[all …]
|
| /linux-4.4.14/Documentation/devicetree/bindings/clock/ |
| D | brcm,iproc-clocks.txt | 9 comprises of several leaf clocks
11 Required properties for a PLL and its leaf clocks:
18 Have a value of <1> since there are more than 1 leaf clock of a given PLL
89 PLL and leaf clock compatible strings for Cygnus are:
136 PLL and leaf clock compatible strings for Northstar and Northstar Plus are:
166 PLL and leaf clock compatible strings for Northstar 2 are:
|
| /linux-4.4.14/Documentation/networking/ |
| D | fib_trie.txt | 5 leaf
8 See struct leaf and struct leaf_info.
11 An internal node, holding an array of child (leaf or tnode) pointers,
67 Inserts a new leaf node in the trie. This is bit more complicated than
120 trie, key segment by key segment, until we find a leaf. check_leaf() does
121 the fib_semantic_match in the leaf's sorted prefix hlist.
128 prefix. The goal is always to reach a leaf and get a positive result from the
|
| D | arcnet-hardware.txt | 2368 The board itself has a maple leaf stamped just above the irq jumpers
|
| /linux-4.4.14/fs/jfs/ |
| D | jfs_dmap.c | 1130 s8 *leaf; in dbAllocNext() local
1140 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1157 if (leaf[word] == NOFREE) in dbAllocNext()
1204 if (leaf[word] < BUDMIN) in dbAllocNext()
1211 min_t(int, leaf[word], NLSTOL2BSZ(nwords)); in dbAllocNext()
1261 s8 *leaf; in dbAllocNear() local
1268 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1282 if (leaf[word] < l2nb) in dbAllocNear()
1295 if (leaf[word] < BUDMIN) in dbAllocNear()
2183 s8 *leaf; in dbAllocBits() local
[all …]
|
| D | jfs_dtree.h | 32 } leaf; member
|
| D | jfs_dtree.c | 854 data.leaf.tid = tid; in dtInsert()
855 data.leaf.ip = ip; in dtInsert()
858 data.leaf.ip = NULL; /* signifies legacy directory format */ in dtInsert()
860 data.leaf.ino = *fsn; in dtInsert()
3944 lh->inumber = cpu_to_le32(data->leaf.ino); in dtInsertEntry()
3947 if (data->leaf.ip) { in dtInsertEntry()
3951 lh->index = cpu_to_le32(add_index(data->leaf.tid, in dtInsertEntry()
3952 data->leaf.ip, in dtInsertEntry()
4031 if ((p->header.flag & BT_LEAF) && data->leaf.ip) { in dtInsertEntry()
4041 modify_index(data->leaf.tid, data->leaf.ip, in dtInsertEntry()
|
| /linux-4.4.14/net/ipv4/ |
| D | fib_trie.c | 105 struct hlist_head leaf; member
344 INIT_HLIST_HEAD(&l->leaf); in leaf_new()
345 hlist_add_head(&fa->fa_list, &l->leaf); in leaf_new()
1056 hlist_for_each_entry(last, &l->leaf, fa_list) { in fib_insert_alias()
1068 hlist_add_head_rcu(&new->fa_list, &l->leaf); in fib_insert_alias()
1111 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority, in fib_table_insert()
1395 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { in fib_table_lookup()
1444 res->fa_head = &n->leaf; in fib_table_lookup()
1473 if (hlist_empty(&l->leaf)) { in fib_remove_alias()
1512 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id); in fib_table_delete()
[all …]
|
| /linux-4.4.14/Documentation/block/ |
| D | cfq-iosched.txt | 159 an implicit leaf child node which hosts all the tasks whose weight is
180 A B leaf
183 AA AB leaf
192 root-leaf : 125 / 875 =~ 14%
194 B(-leaf) : 250 / 875 =~ 28%
197 the implicit leaf node. The total active weight at this level is
198 AA:500 + AB:1000 + A-leaf:750 = 2250.
200 A-leaf : ( 750 / 2250) * A =~ 19%
201 AA(-leaf) : ( 500 / 2250) * A =~ 12%
202 AB(-leaf) : (1000 / 2250) * A =~ 25%
|
| /linux-4.4.14/Documentation/devicetree/bindings/arm/ |
| D | topology.txt | 110 A cluster node can not be a leaf node.
123 nodes are leaf nodes, otherwise they become containers of
128 A core node must be a leaf node if SMT is not supported.
130 Properties for core nodes that are leaf nodes:
138 If a core node is not a leaf node (CPUs supporting SMT) a core node's
149 always leaf nodes in the device tree.
153 A thread node must be a leaf node.
|
| /linux-4.4.14/lib/ |
| D | assoc_array.c | 25 int (*iterator)(const void *leaf, in assoc_array_subtree_iterate() argument
326 const void *leaf; in assoc_array_find() local
346 leaf = assoc_array_ptr_to_leaf(ptr); in assoc_array_find()
348 if (ops->compare_object(leaf, index_key)) in assoc_array_find()
349 return (void *)leaf; in assoc_array_find()
1018 edit->leaf = assoc_array_leaf_to_ptr(object); in assoc_array_insert()
1066 edit->leaf = assoc_array_leaf_to_ptr(object); in assoc_array_insert_set_object()
1078 static int assoc_array_delete_collapse_iterator(const void *leaf, in assoc_array_delete_collapse_iterator() argument
1083 if (leaf == collapse->skip_leaf) in assoc_array_delete_collapse_iterator()
1088 collapse->node->slots[collapse->slot++] = assoc_array_leaf_to_ptr(leaf); in assoc_array_delete_collapse_iterator()
[all …]
|
| /linux-4.4.14/Documentation/ABI/stable/ |
| D | sysfs-bus-firewire | 89 Contents of a respective textual descriptor leaf.
95 Contents of a respective textual descriptor leaf.
106 Contents of a respective textual descriptor leaf.
|
| /linux-4.4.14/arch/mips/kernel/ |
| D | process.c | 442 int leaf; in unwind_stack_by_address() local
481 leaf = get_frame_info(&info); in unwind_stack_by_address()
482 if (leaf < 0) in unwind_stack_by_address()
489 if (leaf) in unwind_stack_by_address()
|
| /linux-4.4.14/drivers/md/persistent-data/ |
| D | dm-array.h | 161 int (*fn)(void *context, uint64_t key, void *leaf),
|
| D | dm-btree.h | 176 int (*fn)(void *context, uint64_t *keys, void *leaf),
|
| D | dm-array.c | 773 int (*fn)(void *context, uint64_t key, void *leaf);
777 static int walk_ablock(void *context, uint64_t *keys, void *leaf) in walk_ablock() argument
788 memcpy(&block_le, leaf, sizeof(block_le)); in walk_ablock()
808 int (*fn)(void *, uint64_t key, void *leaf), in dm_array_walk() argument
|
| D | dm-btree.c | 945 int (*fn)(void *context, uint64_t *keys, void *leaf), in walk_node() argument
980 int (*fn)(void *context, uint64_t *keys, void *leaf), in dm_btree_walk() argument
|
| /linux-4.4.14/include/net/ |
| D | ip6_fib.h | 65 struct rt6_info *leaf; member
199 struct rt6_info *leaf; member
|
| D | sch_generic.h | 158 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl); member
|
| /linux-4.4.14/drivers/iommu/ |
| D | io-pgtable.h | 29 void (*tlb_add_flush)(unsigned long iova, size_t size, bool leaf,
|
| D | arm-smmu-v3.c | 452 bool leaf; member
466 bool leaf; member
789 cmd[1] |= ent->cfgi.leaf ? CMDQ_CFGI_1_LEAF : 0; in arm_smmu_cmdq_build_cmd()
797 cmd[1] |= ent->tlbi.leaf ? CMDQ_TLBI_1_LEAF : 0; in arm_smmu_cmdq_build_cmd()
802 cmd[1] |= ent->tlbi.leaf ? CMDQ_TLBI_1_LEAF : 0; in arm_smmu_cmdq_build_cmd()
980 .leaf = true, in arm_smmu_sync_ste_for_sid()
1338 bool leaf, void *cookie) in arm_smmu_tlb_inv_range_nosync() argument
1344 .leaf = leaf, in arm_smmu_tlb_inv_range_nosync()
|
| D | arm-smmu.c | 585 bool leaf, void *cookie) in arm_smmu_tlb_inv_range_nosync() argument
595 reg += leaf ? ARM_SMMU_CB_S1_TLBIVAL : ARM_SMMU_CB_S1_TLBIVA; in arm_smmu_tlb_inv_range_nosync()
611 reg += leaf ? ARM_SMMU_CB_S2_TLBIIPAS2L : in arm_smmu_tlb_inv_range_nosync()
|
| D | ipmmu-vmsa.c | 280 static void ipmmu_tlb_add_flush(unsigned long iova, size_t size, bool leaf, in ipmmu_tlb_add_flush() argument
|
| D | io-pgtable-arm.c | 893 static void dummy_tlb_add_flush(unsigned long iova, size_t size, bool leaf, in dummy_tlb_add_flush() argument
|
| /linux-4.4.14/Documentation/virtual/kvm/ |
| D | msr.txt | 48 leaf prior to usage.
111 of specific flags has to be checked in 0x40000001 cpuid leaf.
126 leaf prior to usage.
137 leaf prior to usage.
147 leaf prior to usage.
|
| D | cpuid.txt | 18 The value in eax corresponds to the maximum cpuid function present in this leaf,
|
| D | mmu.txt | 106 shadow page contains 512 sptes, which can be either leaf or nonleaf sptes. A
107 shadow page may contain a mix of leaf and nonleaf sptes.
109 A nonleaf spte allows the hardware mmu to reach the leaf pages and
112 A leaf spte corresponds to either one or two translations encoded into
117 The following table shows translations encoded by leaf ptes, with higher-level
136 If set, leaf sptes reachable from this page are for a linear range.
215 other means. Valid for leaf pages.
426 information in leaf sptes. When a new memslot is added or an existing
|
| D | api.txt | 1266 The TSC deadline timer feature (CPUID leaf 1, ecx[24]) is always returned
|
| /linux-4.4.14/fs/ubifs/ |
| D | tnc.c | 319 ubifs_assert(!zbr->leaf); in lnc_add()
335 zbr->leaf = lnc_node; in lnc_add()
353 ubifs_assert(!zbr->leaf); in lnc_add_directly()
363 zbr->leaf = node; in lnc_add_directly()
374 if (!zbr->leaf) in lnc_free()
376 kfree(zbr->leaf); in lnc_free()
377 zbr->leaf = NULL; in lnc_free()
398 if (zbr->leaf) { in tnc_read_node_nm()
401 memcpy(node, zbr->leaf, zbr->len); in tnc_read_node_nm()
528 if (!zbr->leaf) { in matches_name()
[all …]
|
| D | ubifs.h | 752 void *leaf; member
|
| /linux-4.4.14/Documentation/ |
| D | assoc_array.txt | 70 pack leaf object pointers into spare space in the node rather than making an
378 (*) A pointer to an object (a leaf).
461 metadata pointer. If the metadata pointer is there, any leaf whose key matches
503 If the leaves in a full node and the leaf that is being inserted are
528 matching leaf pointer with the pointer to the new leaf after a barrier.
529 The metadata blocks don't change otherwise. An old leaf won't be freed
532 (2) Simple delete. This involves just clearing an old matching leaf. The
533 metadata blocks don't change otherwise. The old leaf won't be freed until
|
| D | kernel-parameters.txt | 3117 leaf rcu_node structure. Useful for very
|
| /linux-4.4.14/arch/metag/ |
| D | Makefile | 32 cflags-$(CONFIG_METAG_FUNCTION_TRACE) += -mhwtrace-leaf -mhwtrace-retpc
|
| /linux-4.4.14/include/linux/ |
| D | assoc_array_priv.h | 83 struct assoc_array_ptr *leaf; member
|
| /linux-4.4.14/drivers/staging/skein/ |
| D | skein_base.h | 225 #define SKEIN_CFG_TREE_INFO(leaf, node, max_lvl) \ argument
226 ((((u64)(leaf)) << SKEIN_CFG_TREE_LEAF_SIZE_POS) | \
|
| /linux-4.4.14/arch/x86/kernel/cpu/ |
| D | intel_cacheinfo.c | 224 amd_cpuid4(int leaf, union _cpuid4_leaf_eax *eax, in amd_cpuid4() argument
242 switch (leaf) { in amd_cpuid4()
279 eax->split.type = types[leaf]; in amd_cpuid4()
280 eax->split.level = levels[leaf]; in amd_cpuid4()
|
| D | perf_event_intel_pt.c | 57 [PT_CAP_ ## _n] = { .name = __stringify(_n), .leaf = _l, \
62 u32 leaf; member
82 u32 c = pt_pmu.caps[cd->leaf * PT_CPUID_REGS_NUM + cd->reg]; in pt_cap_get()
|
| /linux-4.4.14/arch/c6x/lib/ |
| D | divi.S | 27 ;; In our implementation, divu and remu are leaf functions,
|
| D | remi.S | 27 ;; In our implementation, divu and remu are leaf functions,
|
| D | remu.S | 27 ;; In our implementation, divu and remu are leaf functions,
|
| D | divu.S | 27 ;; In our implementation, divu and remu are leaf functions,
|
| /linux-4.4.14/drivers/md/ |
| D | dm-cache-metadata.c | 1174 static int __load_mapping(void *context, uint64_t cblock, void *leaf) in __load_mapping() argument
1185 memcpy(&value, leaf, sizeof(value)); in __load_mapping()
1233 static int __dump_mapping(void *context, uint64_t cblock, void *leaf) in __dump_mapping() argument
1240 memcpy(&value, leaf, sizeof(value)); in __dump_mapping()
|
| /linux-4.4.14/arch/x86/xen/ |
| D | p2m.c | 156 static void p2m_mid_mfn_init(unsigned long *mid, unsigned long *leaf) in p2m_mid_mfn_init() argument
161 mid[i] = virt_to_mfn(leaf); in p2m_mid_mfn_init()
|
| /linux-4.4.14/drivers/firewire/ |
| D | sbp2.c | 1010 const u32 *leaf) in sbp2_get_unit_unique_id() argument
1012 if ((leaf[0] & 0xffff0000) == 0x00020000) in sbp2_get_unit_unique_id()
1013 tgt->guid = (u64)leaf[1] << 32 | leaf[2]; in sbp2_get_unit_unique_id()
|
| D | core-device.c | 125 const u32 *leaf = search_leaf(directory, key); in fw_csr_string() local
126 if (!leaf) in fw_csr_string()
129 return textual_leaf_to_string(leaf, buf, size); in fw_csr_string()
|
| /linux-4.4.14/Documentation/filesystems/ |
| D | btrfs.txt | 135 a metadata B-tree leaf. The value is specified in bytes, optionally
138 to leaf headers. For a 4k sector size, max inline data is ~3900 bytes.
|
| D | hpfs.txt | 147 (returning error ENOSPC). That's because file in non-leaf node in directory tree
152 to delete other files that are leaf (probability that the file is non-leaf is
|
| D | logfs.txt | 78 leaf nodes of the inode files are inodes.
|
| D | f2fs.txt | 435 leaf data writes.
|
| /linux-4.4.14/Documentation/x86/ |
| D | intel_mpx.txt | 70 * Checks for hardware MPX support in cpuid leaf
76 * Checks for hardware MPX support in cpuid leaf
|
| /linux-4.4.14/Documentation/cgroups/ |
| D | blkio-controller.txt | 7 both at leaf nodes as well as at intermediate nodes in a storage hierarchy.
13 this policy takes effect only on leaf nodes when CFQ is being used. The second
16 used on leaf nodes as well as higher level logical devices like device mapper.
|
| D | unified-hierarchy.txt | 81 be collapsed from leaf towards root when viewed from specific
200 The io controller implicitly creates a hidden leaf node for each
201 cgroup to host the tasks. The hidden leaf has its own copies of all
453 tasks, leaf weights are meaningless. The operation model is
|
| D | memcg_test.txt | 94 Shmem's page (just leaf page, not direct/indirect block) can be on
|
| /linux-4.4.14/Documentation/ABI/testing/ |
| D | sysfs-block-bcache | 134 For a cache, height of the btree excluding leaf nodes (i.e. a
|
| /linux-4.4.14/Documentation/device-mapper/ |
| D | verity.txt | 104 Each node in the tree is a cryptographic hash. If it is a leaf node, the hash
|
| /linux-4.4.14/Documentation/devicetree/ |
| D | of_unittest.txt | 190 order to remove the device nodes attached initially (first the leaf nodes are
|
| /linux-4.4.14/drivers/scsi/ |
| D | sg.c | 2410 const struct sg_proc_leaf *leaf = &sg_proc_leaf_arr[k]; in sg_proc_init() local
2411 umode_t mask = leaf->fops->write ? S_IRUGO | S_IWUSR : S_IRUGO; in sg_proc_init()
2412 proc_create(leaf->name, mask, sg_proc_sgp, leaf->fops); in sg_proc_init()
|
| /linux-4.4.14/arch/x86/kvm/ |
| D | mmu.c | 3322 int root, leaf; in walk_shadow_page_get_mmio_spte() local
3331 leaf = root = iterator.level; in walk_shadow_page_get_mmio_spte()
3336 sptes[leaf - 1] = spte; in walk_shadow_page_get_mmio_spte()
3337 leaf--; in walk_shadow_page_get_mmio_spte()
3351 while (root > leaf) { in walk_shadow_page_get_mmio_spte()
|
| /linux-4.4.14/kernel/locking/ |
| D | lockdep.c | 1408 print_shortest_lock_dependencies(struct lock_list *leaf, in print_shortest_lock_dependencies() argument
1411 struct lock_list *entry = leaf; in print_shortest_lock_dependencies()
1415 depth = get_lock_depth(leaf); in print_shortest_lock_dependencies()
|
| /linux-4.4.14/fs/ext4/ |
| D | extents.c | 2359 ext4_fsblk_t leaf; in ext4_ext_rm_idx() local
2364 leaf = ext4_idx_pblock(path->p_idx); in ext4_ext_rm_idx()
2383 ext_debug("index is empty, remove it, free block %llu\n", leaf); in ext4_ext_rm_idx()
2384 trace_ext4_ext_rm_idx(inode, leaf); in ext4_ext_rm_idx()
2386 ext4_free_blocks(handle, inode, NULL, leaf, 1, in ext4_ext_rm_idx()
|
| /linux-4.4.14/kernel/trace/ |
| D | trace_events_filter.c | 2206 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf) in ftrace_function_check_pred() argument
2210 if (leaf) { in ftrace_function_check_pred()
|
| /linux-4.4.14/init/ |
| D | Kconfig | 589 int "Tree-based hierarchical RCU leaf-level fanout value"
595 This option controls the leaf-level fanout of hierarchical
599 want the default because the smaller leaf-level fanout keeps
607 leaf-level fanouts work well.
|
| /linux-4.4.14/arch/s390/ |
| D | Kconfig | 525 frame size. With an old compiler a non-leaf function needs a
|
| /linux-4.4.14/Documentation/RCU/ |
| D | trace.txt | 434 corresponds to a leaf rcu_node structure. The fields are as follows:
|
| /linux-4.4.14/tools/perf/Documentation/ |
| D | intel-pt.txt | 311 can be related to TSC via values provided in cpuid leaf 0x15.
|
| /linux-4.4.14/Documentation/trace/ |
| D | ftrace.txt | 1940 than the current function in case of a leaf one. It is default
2891 they set up the stack frame. This means that leaf level functions
|
| /linux-4.4.14/Documentation/power/ |
| D | pci.txt | 460 in the device tree from the root bridge to a leaf device contains both of them).
|