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
76 ref_node = ACPI_ADD_PTR(struct acpi_rhct_node_header, in acpi_get_riscv_isa()
78 if (ref_node->type == ACPI_RHCT_NODE_TYPE_ISA_STRING) { in acpi_get_riscv_isa()
80 ref_node, size_hdr); in acpi_get_riscv_isa()
97 struct acpi_rhct_node_header *ref_node; in acpi_parse_hart_info_cmo_node()
103 ref_node = ACPI_ADD_PTR(struct acpi_rhct_node_header, in acpi_parse_hart_info_cmo_node()
105 if (ref_node->type == ACPI_RHCT_NODE_TYPE_CMO) { in acpi_parse_hart_info_cmo_node()
107 ref_node, size_hdr); in acpi_parse_hart_info_cmo_node()
92 struct acpi_rhct_node_header *ref_node; acpi_parse_hart_info_cmo_node() local
/linux/fs/btrfs/
H A Ddelayed-ref.c351 rb_entry(new, struct btrfs_delayed_ref_node, ref_node); in btrfs_delayed_ref_lock()
353 rb_entry(exist, struct btrfs_delayed_ref_node, ref_node); in btrfs_delayed_ref_lock()
361 struct rb_node *node = &ins->ref_node; in btrfs_delayed_ref_lock()
364 return rb_entry_safe(exist, struct btrfs_delayed_ref_node, ref_node); in btrfs_delayed_ref_lock()
404 rb_erase_cached(&ref->ref_node, &head->ref_tree); in merge_ref()
405 RB_CLEAR_NODE(&ref->ref_node); in merge_ref()
419 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
425 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in merge_ref()
480 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in btrfs_select_ref_head()
598 struct btrfs_delayed_ref_node, ref_node); in insert_delayed_ref()
[all...]
H A Ddelayed-ref.h62 struct rb_node ref_node; member
H A Dbackref.c894 ref_node); in add_delayed_refs()
2416 struct ulist_node *ref_node;
2453 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { in iterate_extent_inodes()
2454 const u64 leaf_bytenr = ref_node->val; in iterate_extent_inodes()
2459 inode_list = (struct extent_inode_elem *)(uintptr_t)ref_node->aux; in iterate_extent_inodes()
2503 root_node->val, ref_node->val, in iterate_extent_inodes()
2504 ref_node->aux); in iterate_extent_inodes()
2426 struct ulist_node *ref_node; iterate_extent_inodes() local
H A Drelocation.c3292 struct ulist_node *ref_node = NULL; in add_data_references()
3307 while ((ref_node = ulist_next(ctx.refs, &leaf_uiter))) { in add_data_references()
3311 eb = read_tree_block(ctx.fs_info, ref_node->val, &check); in add_data_references()
3321 ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); in add_data_references()
3295 struct ulist_node *ref_node = NULL; add_data_references() local
H A Dextent-tree.c2021 rb_erase_cached(&ref->ref_node, &locked_ref->ref_tree); in btrfs_run_delayed_refs_for_head()
2022 RB_CLEAR_NODE(&ref->ref_node); in btrfs_run_delayed_refs_for_head()
2352 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()