Home
last modified time | relevance | path

Searched refs:node (Results 201 - 225 of 6932) sorted by relevance

12345678910>>...278

/kernel/liteos_m/kernel/src/mm/
H A Dlos_memory.c202 #define OS_MEM_NEXT_NODE(node) \
203 ((struct OsMemNodeHead *)(VOID *)((UINT8 *)(node) + OS_MEM_NODE_GET_SIZE((node)->sizeAndFlag)))
214 #define OS_MEM_SET_MAGIC(node) ((node)->magic = OS_MEM_NODE_MAGIC)
215 #define OS_MEM_MAGIC_VALID(node) ((node)->magic == OS_MEM_NODE_MAGIC)
217 #define OS_MEM_SET_MAGIC(node)
218 #define OS_MEM_MAGIC_VALID(node) TRUE
224 * the gap between two memory regions is marked as a used OsMemNodeHead node
243 OsMemNodeSetTaskID(struct OsMemUsedNodeHead *node) OsMemNodeSetTaskID() argument
329 struct OsMemNodeHead *node = NULL; global() local
382 OsMemSentinelNodeGet(struct OsMemNodeHead *node) global() argument
391 PreSentinelNodeGet(const VOID *pool, const struct OsMemNodeHead *node) global() argument
414 TryShrinkPool(const VOID *pool, const struct OsMemNodeHead *node) global() argument
497 OsLmsFirstNodeMark(VOID *pool, struct OsMemNodeHead *node) global() argument
529 OsLmsReallocMergeNodeMark(struct OsMemNodeHead *node) global() argument
539 OsLmsReallocSplitNodeMark(struct OsMemNodeHead *node) global() argument
551 OsLmsReallocResizeMark(struct OsMemNodeHead *node, UINT32 resize) global() argument
563 struct OsMemNodeHead *node; global() member
570 OsMemLeakCheckInfoRecord(struct OsMemNodeHead *node) global() argument
592 OsMemLinkRegisterRecord(struct OsMemNodeHead *node) global() argument
598 OsMemUsedNodePrint(struct OsMemNodeHead *node) global() argument
613 OsMemUsedNodePrintHandle(struct OsMemNodeHead *node, VOID *arg) global() argument
667 struct OsMemFreeNodeHead *node = NULL; global() local
748 OsMemListAdd(struct OsMemPoolHead *pool, UINT32 listIndex, struct OsMemFreeNodeHead *node) global() argument
761 OsMemListDelete(struct OsMemPoolHead *pool, UINT32 listIndex, struct OsMemFreeNodeHead *node) global() argument
779 OsMemFreeNodeAdd(VOID *pool, struct OsMemFreeNodeHead *node) global() argument
788 OsMemFreeNodeDelete(VOID *pool, struct OsMemFreeNodeHead *node) global() argument
808 OsMemMergeNode(struct OsMemNodeHead *node) global() argument
842 struct OsMemUsedNodeHead *node = (struct OsMemUsedNodeHead *)addr; global() local
1200 struct OsMemNodeHead *node = NULL; global() local
1214 OsMemIsNodeValid(const struct OsMemNodeHead *node, const struct OsMemNodeHead *startNode, const struct OsMemNodeHead *endNode, const struct OsMemPoolHead *poolInfo) global() argument
1236 OsMemCheckUsedNode(const struct OsMemPoolHead *pool, const struct OsMemNodeHead *node) global() argument
1291 OsMemFree(struct OsMemPoolHead *pool, struct OsMemNodeHead *node) global() argument
1381 struct OsMemNodeHead *node = NULL; global() local
1398 OsMemReAllocSmaller(VOID *pool, UINT32 allocSize, struct OsMemNodeHead *node, UINT32 nodeSize) global() argument
1421 OsMemMergeNodeForReAllocBigger(VOID *pool, UINT32 allocSize, struct OsMemNodeHead *node, UINT32 nodeSize, struct OsMemNodeHead *nextNode) global() argument
1445 OsMemRealloc(struct OsMemPoolHead *pool, const VOID *ptr, struct OsMemNodeHead *node, UINT32 size, UINT32 intSave) global() argument
1500 struct OsMemNodeHead *node = NULL; global() local
1529 struct OsMemUsedNodeHead *node = NULL; global() local
1573 struct OsMemNodeHead *node = NULL; global() local
1661 OsMemFreeListNodeCheck(const struct OsMemPoolHead *pool, const struct OsMemFreeNodeHead *node) global() argument
1710 struct OsMemNodeHead *node = NULL; global() local
1910 OsMemInfoGet(struct OsMemNodeHead *node, LOS_MEM_POOL_STATUS *poolStatus) global() argument
2022 struct OsMemFreeNodeHead *node = NULL; global() local
[all...]
/kernel/linux/linux-5.10/arch/sparc/kernel/
H A Dauxio_32.c32 phandle node, auxio_nd; in auxio_probe() local
43 node = prom_getchild(prom_root_node); in auxio_probe()
44 auxio_nd = prom_searchsiblings(node, "auxiliary-io"); in auxio_probe()
46 node = prom_searchsiblings(node, "obio"); in auxio_probe()
47 node = prom_getchild(node); in auxio_probe()
48 auxio_nd = prom_searchsiblings(node, "auxio"); in auxio_probe()
54 if(prom_searchsiblings(node, "leds")) { in auxio_probe()
58 prom_printf("Cannot find auxio node, canno in auxio_probe()
115 phandle node; auxio_power_probe() local
[all...]
/kernel/linux/linux-6.6/arch/sparc/kernel/
H A Dauxio_32.c31 phandle node, auxio_nd; in auxio_probe() local
42 node = prom_getchild(prom_root_node); in auxio_probe()
43 auxio_nd = prom_searchsiblings(node, "auxiliary-io"); in auxio_probe()
45 node = prom_searchsiblings(node, "obio"); in auxio_probe()
46 node = prom_getchild(node); in auxio_probe()
47 auxio_nd = prom_searchsiblings(node, "auxio"); in auxio_probe()
53 if(prom_searchsiblings(node, "leds")) { in auxio_probe()
57 prom_printf("Cannot find auxio node, canno in auxio_probe()
114 phandle node; auxio_power_probe() local
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dmisc.h69 struct rb_node *node = root->rb_node; in rb_simple_search() local
72 while (node) { in rb_simple_search()
73 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
76 node = node->rb_left; in rb_simple_search()
78 node = node->rb_right; in rb_simple_search()
80 return node; in rb_simple_search()
97 struct rb_node *node = root->rb_node, *ret = NULL; in rb_simple_search_first() local
100 while (node) { in rb_simple_search_first()
120 rb_simple_insert(struct rb_root *root, u64 bytenr, struct rb_node *node) rb_simple_insert() argument
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dtopology.h39 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node))
42 #define for_each_node_with_cpus(node) \
43 for_each_online_node(node) \
44 if (nr_cpus_node(node))
66 * The following tunable allows platforms to override the default node
101 static inline void set_numa_node(int node) in set_numa_node() argument
103 this_cpu_write(numa_node, node); in set_numa_node()
108 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
110 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
136 set_numa_mem(int node) set_numa_mem() argument
158 set_cpu_numa_mem(int cpu, int node) set_cpu_numa_mem() argument
252 sched_numa_find_nth_cpu(const struct cpumask *cpus, int cpu, int node) sched_numa_find_nth_cpu() argument
258 sched_numa_hop_mask(unsigned int node, unsigned int hops) sched_numa_hop_mask() argument
[all...]
H A Dtimerqueue.h10 struct rb_node node; member
20 struct timerqueue_node *node);
22 struct timerqueue_node *node);
24 struct timerqueue_node *node);
31 * Returns a pointer to the timer node that has the earliest expiration time.
38 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
41 static inline void timerqueue_init(struct timerqueue_node *node) in timerqueue_init() argument
43 RB_CLEAR_NODE(&node->node); in timerqueue_init()
46 static inline bool timerqueue_node_queued(struct timerqueue_node *node) in timerqueue_node_queued() argument
51 timerqueue_node_expires(struct timerqueue_node *node) timerqueue_node_expires() argument
[all...]
H A Dof_graph.h30 * for_each_endpoint_of_node - iterate over every endpoint in a device node
31 * @parent: parent device node containing ports and endpoints
32 * @child: loop variable pointing to the current endpoint node
41 bool of_graph_is_present(const struct device_node *node);
42 int of_graph_parse_endpoint(const struct device_node *node,
45 struct device_node *of_graph_get_port_by_id(struct device_node *node, u32 id);
51 const struct device_node *node);
52 struct device_node *of_graph_get_port_parent(struct device_node *node);
54 const struct device_node *node);
55 struct device_node *of_graph_get_remote_port(const struct device_node *node);
60 of_graph_is_present(const struct device_node *node) of_graph_is_present() argument
65 of_graph_parse_endpoint(const struct device_node *node, struct of_endpoint *endpoint) of_graph_parse_endpoint() argument
76 of_graph_get_port_by_id( struct device_node *node, u32 id) of_graph_get_port_by_id() argument
95 of_graph_get_remote_endpoint( const struct device_node *node) of_graph_get_remote_endpoint() argument
101 of_graph_get_port_parent( struct device_node *node) of_graph_get_port_parent() argument
107 of_graph_get_remote_port_parent( const struct device_node *node) of_graph_get_remote_port_parent() argument
113 of_graph_get_remote_port( const struct device_node *node) of_graph_get_remote_port() argument
118 of_graph_get_remote_node( const struct device_node *node, u32 port, u32 endpoint) of_graph_get_remote_node() argument
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_res_cursor.h40 void *node; member
60 struct drm_mm_node *node; in amdgpu_res_first() local
90 cur->node = block; in amdgpu_res_first()
94 node = to_ttm_range_mgr_node(res)->mm_nodes; in amdgpu_res_first()
95 while (start >= node->size << PAGE_SHIFT) in amdgpu_res_first()
96 start -= node++->size << PAGE_SHIFT; in amdgpu_res_first()
98 cur->start = (node->start << PAGE_SHIFT) + start; in amdgpu_res_first()
99 cur->size = min((node->size << PAGE_SHIFT) - start, size); in amdgpu_res_first()
101 cur->node = node; in amdgpu_res_first()
129 struct drm_mm_node *node; amdgpu_res_next() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gvt/
H A Ddebugfs.c36 struct list_head node; member
49 ma = container_of(a, struct diff_mmio, node); in mmio_offset_compare()
50 mb = container_of(b, struct diff_mmio, node); in mmio_offset_compare()
62 struct diff_mmio *node; in mmio_diff_handler() local
69 node = kmalloc(sizeof(*node), GFP_ATOMIC); in mmio_diff_handler()
70 if (!node) in mmio_diff_handler()
73 node->offset = offset; in mmio_diff_handler()
74 node->preg = preg; in mmio_diff_handler()
75 node in mmio_diff_handler()
93 struct diff_mmio *node, *next; vgpu_mmio_diff_show() local
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/hw/hfi1/
H A Dpin_system.c23 static bool sdma_rb_filter(struct mmu_rb_node *node, unsigned long addr,
72 static inline struct mm_struct *mm_from_sdma_node(struct sdma_mmu_node *node) in mm_from_sdma_node() argument
74 return node->rb.handler->mn.mm; in mm_from_sdma_node()
77 static void free_system_node(struct sdma_mmu_node *node) in free_system_node() argument
79 if (node->npages) { in free_system_node()
80 unpin_vector_pages(mm_from_sdma_node(node), node->pages, 0, in free_system_node()
81 node->npages); in free_system_node()
82 atomic_sub(node->npages, &node in free_system_node()
114 pin_system_pages(struct user_sdma_request *req, uintptr_t start_address, size_t length, struct sdma_mmu_node *node, int npages) pin_system_pages() argument
173 struct sdma_mmu_node *node; add_system_pinning() local
221 struct sdma_mmu_node *node = get_system_cache_entry() local
270 struct mmu_rb_node *node = ctx; sdma_mmu_rb_node_get() local
277 struct sdma_mmu_node *node = ctx; sdma_mmu_rb_node_put() local
440 sdma_rb_filter(struct mmu_rb_node *node, unsigned long addr, unsigned long len) sdma_rb_filter() argument
454 struct sdma_mmu_node *node = sdma_rb_evict() local
470 struct sdma_mmu_node *node = sdma_rb_remove() local
[all...]
H A Duser_exp_rcv.c35 struct tid_rb_node *node);
36 static void clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node);
134 struct tid_rb_node *node, in unpin_rcv_pages()
144 dma_unmap_single(&dd->pcidev->dev, node->dma_addr, in unpin_rcv_pages()
145 node->npages * PAGE_SIZE, DMA_FROM_DEVICE); in unpin_rcv_pages()
146 pages = &node->pages[idx]; in unpin_rcv_pages()
147 mm = mm_from_tid_node(node); in unpin_rcv_pages()
730 struct tid_rb_node *node; in set_rcvarray_entry() local
736 * Allocate the node first so we can handle a potential in set_rcvarray_entry()
739 node in set_rcvarray_entry()
132 unpin_rcv_pages(struct hfi1_filedata *fd, struct tid_user_buf *tidbuf, struct tid_rb_node *node, unsigned int idx, unsigned int npages, bool mapped) unpin_rcv_pages() argument
792 struct tid_rb_node *node; unprogram_rcvarray() local
818 __clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node) __clear_tid_node() argument
841 clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node) clear_tid_node() argument
876 struct tid_rb_node *node; unlock_exp_tids() local
896 struct tid_rb_node *node = tid_rb_invalidate() local
[all...]
/kernel/linux/linux-5.10/drivers/base/
H A Ddevres.c28 struct devres_node node; member
40 struct devres_node node[2]; member
50 static void set_node_dbginfo(struct devres_node *node, const char *name, in set_node_dbginfo() argument
53 node->name = name; in set_node_dbginfo()
54 node->size = size; in set_node_dbginfo()
57 static void devres_log(struct device *dev, struct devres_node *node, in devres_log() argument
62 op, node, node->name, (unsigned long)node->size); in devres_log()
65 #define set_node_dbginfo(node,
83 node_to_group(struct devres_node *node) node_to_group() argument
122 add_dr(struct device *dev, struct devres_node *node) add_dr() argument
197 struct devres_node *node; devres_for_each_res() local
259 struct devres_node *node; find_dr() local
449 struct devres_node *node; remove_nodes() local
480 struct devres_node *node; remove_nodes() local
591 struct devres_node *node; find_group() local
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dtimerqueue.h10 struct rb_node node; member
20 struct timerqueue_node *node);
22 struct timerqueue_node *node);
24 struct timerqueue_node *node);
31 * Returns a pointer to the timer node that has the earliest expiration time.
38 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
41 static inline void timerqueue_init(struct timerqueue_node *node) in timerqueue_init() argument
43 RB_CLEAR_NODE(&node->node); in timerqueue_init()
46 static inline bool timerqueue_node_queued(struct timerqueue_node *node) in timerqueue_node_queued() argument
51 timerqueue_node_expires(struct timerqueue_node *node) timerqueue_node_expires() argument
[all...]
H A Dof_graph.h30 * for_each_endpoint_of_node - iterate over every endpoint in a device node
31 * @parent: parent device node containing ports and endpoints
32 * @child: loop variable pointing to the current endpoint node
41 bool of_graph_is_present(const struct device_node *node);
42 int of_graph_parse_endpoint(const struct device_node *node,
45 struct device_node *of_graph_get_port_by_id(struct device_node *node, u32 id);
51 const struct device_node *node);
52 struct device_node *of_graph_get_port_parent(struct device_node *node);
54 const struct device_node *node);
55 struct device_node *of_graph_get_remote_port(const struct device_node *node);
60 of_graph_is_present(const struct device_node *node) of_graph_is_present() argument
65 of_graph_parse_endpoint(const struct device_node *node, struct of_endpoint *endpoint) of_graph_parse_endpoint() argument
76 of_graph_get_port_by_id( struct device_node *node, u32 id) of_graph_get_port_by_id() argument
95 of_graph_get_remote_endpoint( const struct device_node *node) of_graph_get_remote_endpoint() argument
101 of_graph_get_port_parent( struct device_node *node) of_graph_get_port_parent() argument
107 of_graph_get_remote_port_parent( const struct device_node *node) of_graph_get_remote_port_parent() argument
113 of_graph_get_remote_port( const struct device_node *node) of_graph_get_remote_port() argument
118 of_graph_get_remote_node( const struct device_node *node, u32 port, u32 endpoint) of_graph_get_remote_node() argument
[all...]
/kernel/linux/linux-5.10/arch/mips/loongson64/
H A Dnuma.c101 static void __init szmem(unsigned int node) in szmem() argument
110 if (node_id != node) in szmem()
128 PFN_PHYS(node_psize), node); in szmem() local
140 PFN_PHYS(node_psize), node); in szmem() local
152 static void __init node_mem_init(unsigned int node) in node_mem_init() argument
157 node_addrspace_offset = nid_to_addrbase(node); in node_mem_init()
159 node, node_addrspace_offset); in node_mem_init()
161 get_pfn_range_for_nid(node, &start_pfn, &end_pfn); in node_mem_init()
163 node, start_pfn, end_pfn); in node_mem_init()
165 __node_data[node] in node_mem_init()
193 unsigned int node, cpu, active_cpu = 0; prom_meminit() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dplist.c68 * plist_add - add @node to @head
70 * @node: &struct plist_node pointer
73 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add() argument
79 WARN_ON(!plist_node_empty(node)); in plist_add()
80 WARN_ON(!list_empty(&node->prio_list)); in plist_add()
88 if (node->prio < iter->prio) { in plist_add()
98 if (!prev || prev->prio != node->prio) in plist_add()
99 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
101 list_add_tail(&node->node_list, node_next); in plist_add()
107 * plist_del - Remove a @node fro
112 plist_del(struct plist_node *node, struct plist_head *head) plist_del() argument
145 plist_requeue(struct plist_node *node, struct plist_head *head) plist_requeue() argument
212 plist_test_requeue(struct plist_node *node) plist_test_requeue() argument
[all...]
H A Drbtree_test.c32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() argument
35 u32 key = node->key; in insert()
45 rb_link_node(&node->rb, parent, new); in insert()
46 rb_insert_color(&node->rb, &root->rb_root); in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() argument
52 u32 key = node->key; in insert_cached()
65 rb_link_node(&node->rb, parent, new); in insert_cached()
66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() argument
71 rb_erase(&node in erase()
74 erase_cached(struct test_node *node, struct rb_root_cached *root) erase_cached() argument
85 insert_augmented(struct test_node *node, struct rb_root_cached *root) insert_augmented() argument
109 insert_augmented_cached(struct test_node *node, struct rb_root_cached *root) insert_augmented_cached() argument
138 erase_augmented(struct test_node *node, struct rb_root_cached *root) erase_augmented() argument
143 erase_augmented_cached(struct test_node *node, struct rb_root_cached *root) erase_augmented_cached() argument
198 struct test_node *node = rb_entry(rb, struct test_node, rb); check() local
224 struct test_node *node = rb_entry(rb, struct test_node, rb); check_augmented() local
246 struct rb_node *node; rbtree_test_init() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dplist.c68 * plist_add - add @node to @head
70 * @node: &struct plist_node pointer
73 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add() argument
79 WARN_ON(!plist_node_empty(node)); in plist_add()
80 WARN_ON(!list_empty(&node->prio_list)); in plist_add()
88 if (node->prio < iter->prio) { in plist_add()
98 if (!prev || prev->prio != node->prio) in plist_add()
99 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
101 list_add_tail(&node->node_list, node_next); in plist_add()
107 * plist_del - Remove a @node fro
112 plist_del(struct plist_node *node, struct plist_head *head) plist_del() argument
145 plist_requeue(struct plist_node *node, struct plist_head *head) plist_requeue() argument
212 plist_test_requeue(struct plist_node *node) plist_test_requeue() argument
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Dnssearch.c22 struct acpi_namespace_node *node,
31 * parent_node - Starting node where search will begin
64 struct acpi_namespace_node *node; in acpi_ns_search_one_scope() local
89 node = parent_node->child; in acpi_ns_search_one_scope()
90 while (node) { in acpi_ns_search_one_scope()
94 if (node->name.integer == target_name) { in acpi_ns_search_one_scope()
98 if (acpi_ns_get_type(node) == in acpi_ns_search_one_scope()
100 node = in acpi_ns_search_one_scope()
102 node->object); in acpi_ns_search_one_scope()
110 acpi_ut_get_type_name(node in acpi_ns_search_one_scope()
163 acpi_ns_search_parent_tree(u32 target_name, struct acpi_namespace_node *node, acpi_object_type type, struct acpi_namespace_node **return_node) acpi_ns_search_parent_tree() argument
251 acpi_ns_search_and_enter(u32 target_name, struct acpi_walk_state *walk_state, struct acpi_namespace_node *node, acpi_interpreter_mode interpreter_mode, acpi_object_type type, u32 flags, struct acpi_namespace_node **return_node) acpi_ns_search_and_enter() argument
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Dnssearch.c22 struct acpi_namespace_node *node,
31 * parent_node - Starting node where search will begin
64 struct acpi_namespace_node *node; in acpi_ns_search_one_scope() local
89 node = parent_node->child; in acpi_ns_search_one_scope()
90 while (node) { in acpi_ns_search_one_scope()
94 if (node->name.integer == target_name) { in acpi_ns_search_one_scope()
98 if (acpi_ns_get_type(node) == in acpi_ns_search_one_scope()
100 node = in acpi_ns_search_one_scope()
102 node->object); in acpi_ns_search_one_scope()
110 acpi_ut_get_type_name(node in acpi_ns_search_one_scope()
163 acpi_ns_search_parent_tree(u32 target_name, struct acpi_namespace_node *node, acpi_object_type type, struct acpi_namespace_node **return_node) acpi_ns_search_parent_tree() argument
251 acpi_ns_search_and_enter(u32 target_name, struct acpi_walk_state *walk_state, struct acpi_namespace_node *node, acpi_interpreter_mode interpreter_mode, acpi_object_type type, u32 flags, struct acpi_namespace_node **return_node) acpi_ns_search_and_enter() argument
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/hfi1/
H A Duser_exp_rcv.c78 struct tid_rb_node *node);
79 static void clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node);
177 struct tid_rb_node *node, in unpin_rcv_pages()
187 pci_unmap_single(dd->pcidev, node->dma_addr, in unpin_rcv_pages()
188 node->npages * PAGE_SIZE, PCI_DMA_FROMDEVICE); in unpin_rcv_pages()
189 pages = &node->pages[idx]; in unpin_rcv_pages()
190 mm = mm_from_tid_node(node); in unpin_rcv_pages()
777 struct tid_rb_node *node; in set_rcvarray_entry() local
783 * Allocate the node first so we can handle a potential in set_rcvarray_entry()
786 node in set_rcvarray_entry()
175 unpin_rcv_pages(struct hfi1_filedata *fd, struct tid_user_buf *tidbuf, struct tid_rb_node *node, unsigned int idx, unsigned int npages, bool mapped) unpin_rcv_pages() argument
841 struct tid_rb_node *node; unprogram_rcvarray() local
867 __clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node) __clear_tid_node() argument
890 clear_tid_node(struct hfi1_filedata *fd, struct tid_rb_node *node) clear_tid_node() argument
925 struct tid_rb_node *node; unlock_exp_tids() local
945 struct tid_rb_node *node = tid_rb_invalidate() local
[all...]
/kernel/linux/linux-6.6/net/qrtr/
H A Dns.c61 unsigned int node; member
74 struct qrtr_node *node; in node_get() local
76 node = xa_load(&nodes, node_id); in node_get()
77 if (node) in node_get()
78 return node; in node_get()
80 /* If node didn't exist, allocate and insert it to the tree */ in node_get()
81 node = kzalloc(sizeof(*node), GFP_KERNEL); in node_get()
82 if (!node) in node_get()
85 node in node_get()
198 struct qrtr_node *node; announce_servers() local
224 struct qrtr_node *node; server_add() local
264 server_del(struct qrtr_node *node, unsigned int port, bool bcast) server_del() argument
338 struct qrtr_node *node; ctrl_cmd_bye() local
389 struct qrtr_node *node; ctrl_cmd_del_client() local
499 struct qrtr_node *node; ctrl_cmd_del_server() local
526 struct qrtr_node *node; ctrl_cmd_new_lookup() local
[all...]
/kernel/linux/linux-6.6/arch/powerpc/sysdev/
H A Dfsl_soc.c87 struct device_node *node; in get_brgfreq() local
92 node = of_find_compatible_node(NULL, NULL, "fsl,cpm-brg"); in get_brgfreq()
93 if (node) { in get_brgfreq()
94 of_property_read_u32(node, "clock-frequency", &brgfreq); in get_brgfreq()
95 of_node_put(node); in get_brgfreq()
100 node = of_find_node_by_type(NULL, "cpm"); in get_brgfreq()
101 if (!node) in get_brgfreq()
102 node = of_find_compatible_node(NULL, NULL, "fsl,qe"); in get_brgfreq()
103 if (!node) in get_brgfreq()
104 node in get_brgfreq()
123 struct device_node *node; get_baudrate() local
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dintlist.c18 struct int_node *node = malloc(sizeof(*node)); in intlist__node_new() local
20 if (node != NULL) { in intlist__node_new()
21 node->i = i; in intlist__node_new()
22 node->priv = NULL; in intlist__node_new()
23 rc = &node->rb_node; in intlist__node_new()
37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete() local
39 int_node__delete(node); in intlist__node_delete()
45 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp() local
47 if (node in intlist__node_cmp()
60 intlist__remove(struct intlist *ilist, struct int_node *node) intlist__remove() argument
68 struct int_node *node = NULL; __intlist__findnew() local
142 struct int_node *node = NULL; intlist__entry() local
[all...]
/kernel/liteos_m/utils/
H A Dlos_list.h50 * Structure of a node in a doubly linked list.
53 struct LOS_DL_LIST *pstPrev; /**< Current node's pointer to the previous node */
54 struct LOS_DL_LIST *pstNext; /**< Current node's pointer to the next node */
83 * @brief Point to the next node pointed to by the current node.
87 * <li>This API is used to point to the next node pointed to by the current node.</li>
105 * @brief Insert a new node t
122 LOS_ListAdd(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListAdd() argument
149 LOS_ListTailInsert(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListTailInsert() argument
173 LOS_ListHeadInsert(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListHeadInsert() argument
198 LOS_ListDelete(LOS_DL_LIST *node) LOS_ListDelete() argument
227 LOS_ListEmpty(LOS_DL_LIST *node) LOS_ListEmpty() argument
[all...]

Completed in 13 milliseconds

12345678910>>...278