Home
last modified time | relevance | path

Searched refs:node (Results 26 – 50 of 5906) sorted by relevance

12345678910>>...237

/linux-6.15/kernel/bpf/
H A Dlpm_trie.c282 node = rcu_dereference_check(node->child[next_bit], in trie_lookup_elem()
299 if (!node) in lpm_trie_node_alloc()
308 return node; in lpm_trie_node_alloc()
498 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
524 !node->child[0] && !node->child[1]) { in trie_delete_elem()
693 for (node = search_root; node;) { in trie_get_next_key()
701 node = rcu_dereference(node->child[next_bit]); in trie_get_next_key()
703 if (!node || node->prefixlen != matchlen || in trie_get_next_key()
735 for (node = search_root; node;) { in trie_get_next_key()
737 node = rcu_dereference(node->child[0]); in trie_get_next_key()
[all …]
/linux-6.15/lib/
H A Dbtree.c210 unsigned long *node = head->node; in btree_last() local
216 node = bval(geo, node, 0); in btree_last()
244 unsigned long *node = head->node; in btree_lookup_node() local
255 node = bval(geo, node, i); in btree_lookup_node()
322 node = head->node; in btree_get_prev()
330 node = bval(geo, node, i); in btree_get_prev()
402 node = bval(geo, node, i); in find_level()
422 head->node = node; in btree_grow()
435 node = head->node; in btree_shrink()
438 head->node = bval(geo, node, 0); in btree_shrink()
[all …]
H A Drbtree.c162 parent = node; in __rb_insert()
504 node = node->rb_right; in rb_next()
506 node = node->rb_left; in rb_next()
518 node = parent; in rb_next()
536 node = node->rb_left; in rb_prev()
538 node = node->rb_right; in rb_prev()
546 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
547 node = parent; in rb_prev()
596 node = node->rb_left; in rb_left_deepest_node()
598 node = node->rb_right; in rb_left_deepest_node()
[all …]
H A Dxarray.c453 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
496 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
763 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in update_node()
803 if (node && (xas->xa_shift < node->shift)) in xas_store()
828 if (xa_is_node(next) && (!node || node->shift)) in xas_store()
896 node = xa_parent_locked(xas->xa, node); in xas_set_mark()
928 node = xa_parent_locked(xas->xa, node); in xas_clear_mark()
2359 .xa_node = xa_parent_locked(node->array, node), in xa_delete_node()
2411 node, node->parent ? "offset" : "max", node->offset, in xa_dump_node()
2412 node->parent, node->shift, node->count, node->nr_values, in xa_dump_node()
[all …]
/linux-6.15/tools/lib/
H A Drbtree.c162 parent = node; in __rb_insert()
498 node = node->rb_right; in rb_next()
500 node = node->rb_left; in rb_next()
512 node = parent; in rb_next()
529 node = node->rb_left; in rb_prev()
531 node = node->rb_right; in rb_prev()
539 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
540 node = parent; in rb_prev()
565 node = node->rb_left; in rb_left_deepest_node()
567 node = node->rb_right; in rb_left_deepest_node()
[all …]
/linux-6.15/drivers/base/test/
H A Dproperty-entry-test.c20 struct fwnode_handle *node; in pe_test_uints() local
28 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in pe_test_uints()
114 fwnode_remove_software_node(node); in pe_test_uints()
131 struct fwnode_handle *node; in pe_test_uint_arrays() local
249 fwnode_remove_software_node(node); in pe_test_uint_arrays()
266 struct fwnode_handle *node; in pe_test_strings() local
321 fwnode_remove_software_node(node); in pe_test_strings()
331 struct fwnode_handle *node; in pe_test_bool() local
339 fwnode_remove_software_node(node); in pe_test_bool()
424 struct fwnode_handle *node; in pe_test_reference() local
[all …]
/linux-6.15/arch/x86/platform/olpc/
H A Dolpc_dt.c27 if ((s32)node == -1) in olpc_dt_getsibling()
33 return node; in olpc_dt_getsibling()
41 if ((s32)node == -1) in olpc_dt_getchild()
49 return node; in olpc_dt_getchild()
58 if ((s32)node == -1) in olpc_dt_getproplen()
164 phandle node; in olpc_dt_finddevice() local
176 return node; in olpc_dt_finddevice()
199 phandle node; in olpc_dt_get_board_revision() local
204 if (!node) in olpc_dt_get_board_revision()
234 phandle node; in olpc_dt_fixup() local
[all …]
/linux-6.15/tools/perf/tests/
H A Dhists_output.c185 node = rb_next(node); in test1()
191 node = rb_next(node); in test1()
197 node = rb_next(node); in test1()
203 node = rb_next(node); in test1()
209 node = rb_next(node); in test1()
215 node = rb_next(node); in test1()
221 node = rb_next(node); in test1()
227 node = rb_next(node); in test1()
284 node = rb_next(node); in test2()
339 node = rb_next(node); in test3()
[all …]
/linux-6.15/arch/sparc/prom/
H A Dtree_32.c44 if ((s32)node == -1) in prom_getchild()
76 if ((s32)node == -1) in prom_getsibling()
95 if((!node) || (!prop)) in prom_getproplen()
223 if (node == 0 || (s32)node == -1) in prom_nextprop()
240 node = prom_getchild(node); in prom_finddevice()
246 node = prom_searchsiblings(node, nbuf); in prom_finddevice()
247 if (!node) in prom_finddevice()
256 node2 = node; in prom_finddevice()
274 return node; in prom_finddevice()
300 phandle node; in prom_inst2pkg() local
[all …]
H A Dtree_64.c27 args[3] = (unsigned int) node; in prom_node_to_node()
47 if ((s32)node == -1) in prom_getchild()
60 if ((s32)node == -1) in prom_getparent()
80 if ((s32)node == -1) in prom_getsibling()
97 if (!node || !prop) in prom_getproplen()
244 if ((s32)node == -1) in prom_firstprop()
270 if ((s32)node == -1) { in prom_nextprop()
362 phandle node; in prom_inst2pkg() local
372 node = (int) args[4]; in prom_inst2pkg()
373 if ((s32)node == -1) in prom_inst2pkg()
[all …]
/linux-6.15/scripts/dtc/
H A Ddtc.h272 struct node *name_node(struct node *node, const char *name);
273 struct node *omit_node_if_unused(struct node *node);
274 struct node *reference_node(struct node *node);
275 struct node *chain_node(struct node *first, struct node *list);
276 struct node *merge_nodes(struct node *old_node, struct node *new_node);
284 void delete_node(struct node *node);
285 void append_to_property(struct node *node,
289 const char *get_unitname(struct node *node);
294 struct node **node);
297 struct node *get_subnode(struct node *node, const char *nodename);
[all …]
/linux-6.15/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_interrupt.c57 r = kfifo_alloc(&node->ih_fifo, in kfd_interrupt_init()
65 if (!node->kfd->ih_wq) { in kfd_interrupt_init()
67 node->kfd->num_nodes); in kfd_interrupt_init()
68 if (unlikely(!node->kfd->ih_wq)) { in kfd_interrupt_init()
69 kfifo_free(&node->ih_fifo); in kfd_interrupt_init()
78 node->interrupts_active = true; in kfd_interrupt_init()
100 node->interrupts_active = false; in kfd_interrupt_exit()
102 kfifo_free(&node->ih_fifo); in kfd_interrupt_exit()
112 node->node_id); in enqueue_ih_ring_entry()
116 kfifo_in(&node->ih_fifo, ih_ring_entry, node->kfd->device_info.ih_ring_entry_size); in enqueue_ih_ring_entry()
[all …]
/linux-6.15/drivers/firmware/efi/
H A Ddev-path-parser.c22 if (node->header.length != 12) in parse_acpi_path()
26 'A' + ((node->acpi.hid >> 10) & 0x1f) - 1, in parse_acpi_path()
27 'A' + ((node->acpi.hid >> 5) & 0x1f) - 1, in parse_acpi_path()
28 'A' + ((node->acpi.hid >> 0) & 0x1f) - 1, in parse_acpi_path()
29 node->acpi.hid >> 16); in parse_acpi_path()
62 if (node->header.length != 6) in parse_pci_path()
67 devfn = PCI_DEVFN(node->pci.dev, node->pci.fn); in parse_pci_path()
96 if (node->header.length != 4) in parse_end_path()
105 return node->header.sub_type; in parse_end_path()
173 *node = (void *)*node + (*node)->header.length; in efi_get_device_by_path()
[all …]
/linux-6.15/include/drm/
H A Ddrm_vma_manager.h74 struct drm_vma_offset_node *node);
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
103 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
150 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
151 node->vm_files = RB_ROOT; in drm_vma_node_reset()
152 rwlock_init(&node->vm_lock); in drm_vma_node_reset()
171 return node->vm_node.start; in drm_vma_node_start()
188 return node->vm_node.size; in drm_vma_node_size()
223 if (drm_mm_node_allocated(&node->vm_node)) in drm_vma_node_unmap()
225 drm_vma_node_offset_addr(node), in drm_vma_node_unmap()
[all …]
/linux-6.15/drivers/scsi/elx/libefc/
H A Defc_node.h26 struct efc_node *node = ctx->app; in efc_node_evt_set() local
32 memcpy(node->prev_state_name, node->current_state_name, in efc_node_evt_set()
33 sizeof(node->prev_state_name)); in efc_node_evt_set()
37 node->prev_evt = node->current_evt; in efc_node_evt_set()
38 node->current_evt = evt; in efc_node_evt_set()
51 node->hold_frames = true; in efc_node_hold_frames()
64 node->hold_frames = false; in efc_node_accept_frames()
98 if (node->nport->enable_ini) in efc_node_get_enable()
100 if (node->nport->enable_tgt) in efc_node_get_enable()
102 if (node->init) in efc_node_get_enable()
[all …]
H A Defc_els.h17 struct efc_node *node; member
42 efc_send_plogi(struct efc_node *node);
44 efc_send_flogi(struct efc_node *node);
46 efc_send_fdisc(struct efc_node *node);
48 efc_send_prli(struct efc_node *node);
50 efc_send_prlo(struct efc_node *node);
52 efc_send_logo(struct efc_node *node);
54 efc_send_adisc(struct efc_node *node);
56 efc_send_pdisc(struct efc_node *node);
58 efc_send_scr(struct efc_node *node);
[all …]
/linux-6.15/fs/unicode/
H A Dmkutf8data.c382 struct node *node; in lookup() local
401 node = node->left; in lookup()
419 struct node *node; in tree_walk() local
494 struct node *node; in alloc_node() local
535 struct node *node; in insert() local
656 struct node *node; in prune() local
795 node = node->left; in prune()
817 struct node *node; in mark_nodes() local
944 struct node *node; in index_nodes() local
1051 struct node *node; in size_nodes() local
[all …]
/linux-6.15/drivers/media/platform/raspberrypi/rp1-cfe/
H A Dcfe.c185 #define is_csi2_node(node) (!is_fe_node(node)) argument
530 struct cfe_node *node = &cfe->node[i]; in cfe_schedule_next_csi2_job() local
564 struct cfe_node *node = &cfe->node[i]; in cfe_schedule_next_pisp_job() local
586 struct cfe_node *node = &cfe->node[i]; in cfe_check_job_ready() local
648 node->cur_frm = node->next_frm; in cfe_sof_isr()
661 node->ts = cfe->node[i].ts; in cfe_sof_isr()
715 struct cfe_node *node = &cfe->node[i]; in cfe_isr() local
1000 if (node->next_frm && node->cur_frm != node->next_frm) { in cfe_return_buffers()
1950 struct cfe_node *node = &cfe->node[id]; in cfe_register_node() local
2065 struct cfe_node *node = &cfe->node[i]; in cfe_unregister_nodes() local
[all …]
/linux-6.15/fs/ocfs2/cluster/
H A Dquorum.c187 node, qs->qs_holds); in o2quo_clear_hold()
195 void o2quo_hb_up(u8 node) in o2quo_hb_up() argument
204 mlog_bug_on_msg(test_bit(node, qs->qs_hb_bm), "node %u\n", node); in o2quo_hb_up()
210 o2quo_set_hold(qs, node); in o2quo_hb_up()
219 void o2quo_hb_down(u8 node) in o2quo_hb_down() argument
229 mlog_bug_on_msg(!test_bit(node, qs->qs_hb_bm), "node %u\n", node); in o2quo_hb_down()
234 o2quo_clear_hold(qs, node); in o2quo_hb_down()
250 mlog(0, "node %u\n", node); in o2quo_hb_still_up()
263 void o2quo_conn_up(u8 node) in o2quo_conn_up() argument
272 mlog_bug_on_msg(test_bit(node, qs->qs_conn_bm), "node %u\n", node); in o2quo_conn_up()
[all …]
/linux-6.15/drivers/acpi/acpica/
H A Dnsobject.c49 if (!node) { in acpi_ns_attach_object()
71 node, acpi_ut_get_descriptor_name(node))); in acpi_ns_attach_object()
80 object, node)); in acpi_ns_attach_object()
119 obj_desc, node, acpi_ut_get_node_name(node))); in acpi_ns_attach_object()
123 if (node->object) { in acpi_ns_attach_object()
195 node->object = NULL; in acpi_ns_detach_object()
204 if (node->object && in acpi_ns_detach_object()
206 node->object = node->object->common.next_object; in acpi_ns_detach_object()
225 node, acpi_ut_get_node_name(node), obj_desc)); in acpi_ns_detach_object()
248 *node) in acpi_ns_get_attached_object()
[all …]
H A Ddsargs.c93 op->common.node = node; in acpi_ds_execute_arguments()
161 node = obj_desc->buffer_field.node; in acpi_ds_get_buffer_field_arguments()
171 status = acpi_ds_execute_arguments(node, node->parent, in acpi_ds_get_buffer_field_arguments()
206 node = obj_desc->bank_field.node; in acpi_ds_get_bank_field_arguments()
216 status = acpi_ds_execute_arguments(node, node->parent, in acpi_ds_get_bank_field_arguments()
255 node = obj_desc->buffer.node; in acpi_ds_get_buffer_arguments()
256 if (!node) { in acpi_ds_get_buffer_arguments()
267 status = acpi_ds_execute_arguments(node, node, in acpi_ds_get_buffer_arguments()
299 node = obj_desc->package.node; in acpi_ds_get_package_arguments()
312 status = acpi_ds_execute_arguments(node, node, in acpi_ds_get_package_arguments()
[all …]
/linux-6.15/tools/include/linux/
H A Dinterval_tree_generic.h42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
59 node->ITSUBTREE = last; \
88 if (node->ITRB.rb_left) { \
100 node = left; \
107 if (node->ITRB.rb_right) { \
108 node = rb_entry(node->ITRB.rb_right, \
122 ITSTRUCT *node, *leftmost; \
141 if (node->ITSUBTREE < start) \
176 prev = &node->ITRB; \
178 rb = node->ITRB.rb_right; \
[all …]
/linux-6.15/drivers/gpu/drm/nouveau/nvkm/subdev/instmem/
H A Dgk20a.c209 node->base.vaddr = vmap(node->pages, size >> PAGE_SHIFT, VM_MAP, in gk20a_instobj_acquire_iommu()
222 node->use_cpt++; in gk20a_instobj_acquire_iommu()
305 node->base.vaddr, node->handle, imem->attrs); in gk20a_instobj_dtor_dma()
308 return node; in gk20a_instobj_dtor_dma()
349 return node; in gk20a_instobj_dtor_iommu()
390 if (!(node = kzalloc(sizeof(*node), GFP_KERNEL))) in gk20a_instobj_ctor_dma()
413 node->r.offset = node->handle >> 12; in gk20a_instobj_ctor_dma()
416 node->base.mn = &node->r; in gk20a_instobj_ctor_dma()
435 if (!(node = kzalloc(sizeof(*node) + ((sizeof(node->pages[0]) + in gk20a_instobj_ctor_iommu()
439 node->dma_addrs = (void *)(node->pages + npages); in gk20a_instobj_ctor_iommu()
[all …]
/linux-6.15/drivers/interconnect/
H A Dcore.c184 path->reqs[i].node = node; in path_init()
188 node = node->reverse; in path_init()
294 node->avg_bw = max(node->avg_bw, node->init_avg); in aggregate_requests()
295 node->peak_bw = max(node->peak_bw, node->init_peak); in aggregate_requests()
390 node = data->node; in of_icc_get_from_provider()
412 data->node = node; in of_icc_get_from_provider()
711 node = path->reqs[i].node; in icc_set_bw()
729 node = path->reqs[i].node; in icc_set_bw()
802 node = path->reqs[i].node; in icc_put()
957 provider->get_bw(node, &node->init_avg, &node->init_peak); in icc_node_add()
[all …]
/linux-6.15/fs/hfs/
H A Dbtree.c152 node->tree->cnid, node->this, in hfs_btree_close()
169 if (IS_ERR(node)) in hfs_btree_write()
199 if (IS_ERR(node)) in hfs_bmap_new_bmap()
200 return node; in hfs_bmap_new_bmap()
223 return node; in hfs_bmap_new_bmap()
267 if (IS_ERR(node)) in hfs_bmap_alloc()
268 return node; in hfs_bmap_alloc()
343 i = node->next; in hfs_bmap_free()
347 node->this); in hfs_bmap_free()
358 node->this, node->type); in hfs_bmap_free()
[all …]

12345678910>>...237