Home
last modified time | relevance | path

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

/openbmc/linux/drivers/acpi/riscv/
H A Drhct.c39 struct acpi_rhct_node_header *node, *ref_node, *end; in acpi_get_riscv_isa() local
70 ref_node = ACPI_ADD_PTR(struct acpi_rhct_node_header, in acpi_get_riscv_isa()
72 if (ref_node->type == ACPI_RHCT_NODE_TYPE_ISA_STRING) { in acpi_get_riscv_isa()
74 ref_node, size_hdr); in acpi_get_riscv_isa()
/openbmc/linux/io_uring/
H A Drsrc.c199 struct io_rsrc_node *ref_node; in io_rsrc_node_alloc() local
204 ref_node = container_of(entry, struct io_rsrc_node, cache); in io_rsrc_node_alloc()
206 ref_node = kzalloc(sizeof(*ref_node), GFP_KERNEL); in io_rsrc_node_alloc()
207 if (!ref_node) in io_rsrc_node_alloc()
211 ref_node->ctx = ctx; in io_rsrc_node_alloc()
212 ref_node->empty = 0; in io_rsrc_node_alloc()
213 ref_node->refs = 1; in io_rsrc_node_alloc()
214 return ref_node; in io_rsrc_node_alloc()
H A Drsrc.h61 void io_rsrc_node_destroy(struct io_ring_ctx *ctx, struct io_rsrc_node *ref_node);
/openbmc/linux/fs/btrfs/
H A Ddelayed-ref.c324 struct rb_node *node = &ins->ref_node; in tree_insert()
334 ref_node); in tree_insert()
430 rb_erase_cached(&ref->ref_node, &head->ref_tree); in drop_delayed_ref()
431 RB_CLEAR_NODE(&ref->ref_node); in drop_delayed_ref()
444 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
450 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in merge_ref()
505 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in btrfs_merge_delayed_refs()
884 RB_CLEAR_NODE(&ref->ref_node); in init_delayed_ref_common()
H A Ddelayed-ref.h18 struct rb_node ref_node; member
343 WARN_ON(!RB_EMPTY_NODE(&ref->ref_node)); in btrfs_put_delayed_ref()
H A Dbackref.c904 ref_node); in add_delayed_refs()
2415 struct ulist_node *ref_node; in iterate_extent_inodes() local
2452 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { in iterate_extent_inodes()
2453 const u64 leaf_bytenr = ref_node->val; in iterate_extent_inodes()
2458 inode_list = (struct extent_inode_elem *)(uintptr_t)ref_node->aux; in iterate_extent_inodes()
2502 root_node->val, ref_node->val, in iterate_extent_inodes()
2503 ref_node->aux); in iterate_extent_inodes()
H A Drelocation.c3386 struct ulist_node *ref_node = NULL; in add_data_references() local
3401 while ((ref_node = ulist_next(ctx.refs, &leaf_uiter))) { in add_data_references()
3405 eb = read_tree_block(ctx.fs_info, ref_node->val, &check); in add_data_references()
3415 ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); in add_data_references()
H A Dextent-tree.c1800 struct btrfs_delayed_ref_node, ref_node); in select_delayed_ref()
1977 rb_erase_cached(&ref->ref_node, &locked_ref->ref_tree); in btrfs_run_delayed_refs_for_head()
1978 RB_CLEAR_NODE(&ref->ref_node); in btrfs_run_delayed_refs_for_head()
2296 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in check_delayed_ref()
H A Ddisk-io.c4627 ref_node); in btrfs_destroy_delayed_refs()
4628 rb_erase_cached(&ref->ref_node, &head->ref_tree); in btrfs_destroy_delayed_refs()
4629 RB_CLEAR_NODE(&ref->ref_node); in btrfs_destroy_delayed_refs()