Home
last modified time | relevance | path

Searched refs:ref_node (Results 1 – 7 of 7) sorted by relevance

/linux/drivers/acpi/riscv/
H A Drhct.c40 struct acpi_rhct_node_header *node, *ref_node, *end; in acpi_get_riscv_isa() local
71 ref_node = ACPI_ADD_PTR(struct acpi_rhct_node_header, in acpi_get_riscv_isa()
73 if (ref_node->type == ACPI_RHCT_NODE_TYPE_ISA_STRING) { in acpi_get_riscv_isa()
75 ref_node, size_hdr); in acpi_get_riscv_isa()
92 struct acpi_rhct_node_header *ref_node; in acpi_parse_hart_info_cmo_node() local
98 ref_node = ACPI_ADD_PTR(struct acpi_rhct_node_header, in acpi_parse_hart_info_cmo_node()
100 if (ref_node->type == ACPI_RHCT_NODE_TYPE_CMO) { in acpi_parse_hart_info_cmo_node()
102 ref_node, size_hdr); in acpi_parse_hart_info_cmo_node()
/linux/fs/btrfs/
H A Ddelayed-ref.c323 rb_entry(new, struct btrfs_delayed_ref_node, ref_node); in cmp_refs_node()
325 rb_entry(exist, struct btrfs_delayed_ref_node, ref_node); in cmp_refs_node()
333 struct rb_node *node = &ins->ref_node; in tree_insert()
336 return rb_entry_safe(exist, struct btrfs_delayed_ref_node, ref_node); in tree_insert()
376 rb_erase_cached(&ref->ref_node, &head->ref_tree); in drop_delayed_ref()
377 RB_CLEAR_NODE(&ref->ref_node); in drop_delayed_ref()
391 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
397 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in merge_ref()
452 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in btrfs_merge_delayed_refs()
570 struct btrfs_delayed_ref_node, ref_node); in btrfs_select_delayed_ref()
[all …]
H A Ddelayed-ref.h62 struct rb_node ref_node; member
H A Dbackref.c900 ref_node); in add_delayed_refs()
2413 struct ulist_node *ref_node; in iterate_extent_inodes() local
2450 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { in iterate_extent_inodes()
2451 const u64 leaf_bytenr = ref_node->val; in iterate_extent_inodes()
2456 inode_list = (struct extent_inode_elem *)(uintptr_t)ref_node->aux; in iterate_extent_inodes()
2500 root_node->val, ref_node->val, in iterate_extent_inodes()
2501 ref_node->aux); in iterate_extent_inodes()
H A Drelocation.c3297 struct ulist_node *ref_node = NULL; in add_data_references() local
3312 while ((ref_node = ulist_next(ctx.refs, &leaf_uiter))) { in add_data_references()
3316 eb = read_tree_block(ctx.fs_info, ref_node->val, &check); in add_data_references()
3326 ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); in add_data_references()
H A Dextent-tree.c1935 rb_erase_cached(&ref->ref_node, &locked_ref->ref_tree); in btrfs_run_delayed_refs_for_head()
1936 RB_CLEAR_NODE(&ref->ref_node); in btrfs_run_delayed_refs_for_head()
2266 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in check_delayed_ref()
/linux/fs/btrfs/tests/
H A Ddelayed-refs-tests.c63 rb_erase_cached(&node->ref_node, &head->ref_tree); in delete_delayed_ref_node()
64 RB_CLEAR_NODE(&node->ref_node); in delete_delayed_ref_node()