Home
last modified time | relevance | path

Searched refs:node (Results 1 – 23 of 23) sorted by relevance

/kernel/object/
A Dfutex_node.cpp49 if (node->queue_next_ == node) { in RemoveNodeFromList()
50 DEBUG_ASSERT(node->queue_prev_ == node); in RemoveNodeFromList()
62 node->queue_next_->queue_prev_ = node->queue_prev_; in RemoveNodeFromList()
63 node->queue_prev_->queue_next_ = node->queue_next_; in RemoveNodeFromList()
65 node->MarkAsNotInQueue(); in RemoveNodeFromList()
80 ASSERT(node); in WakeThreads()
93 node->WakeThread(); in WakeThreads()
101 node = next; in WakeThreads()
106 return node; in WakeThreads()
132 node = node->queue_next_; in RemoveFromHead()
[all …]
A Dfutex_context.cpp61 FutexNode node; in FutexWait() local
62 node.set_hash_key(futex_key); in FutexWait()
63 node.SetAsSingletonList(); in FutexWait()
65 QueueNodesLocked(&node); in FutexWait()
125 if (!node) { in FutexWake()
180 if (!node) { in FutexRequeue()
190 node = FutexNode::WakeThreads(node, wake_count, wake_key); in FutexRequeue()
194 if (node != nullptr) { in FutexRequeue()
198 node = FutexNode::RemoveFromHead(node, requeue_count, in FutexRequeue()
208 if (node != nullptr) { in FutexRequeue()
[all …]
/kernel/lib/topology/
A Dsystem-topology.cpp26 Node* node = nullptr; in Update() local
30 node = &nodes_[i]; in Update()
32 node->entity_type = flat_node->entity_type; in Update()
35 switch (node->entity_type) { in Update()
39 processors_.push_back(node, &checker); in Update()
72 node->parent->children.push_back(node, &checker); in Update()
92 zbi_topology_node_t* node; in Validate() local
94 node = &nodes[current_index]; in Validate()
97 current_type = node->entity_type; in Validate()
100 if (current_type != node->entity_type) { in Validate()
[all …]
A Dsystem-topology_test.cpp40 system_topology::Node* node; in test_flat_to_heap_simple() local
41 ASSERT_EQ(ZX_OK, graph.ProcessorByLogicalId(1, &node)); in test_flat_to_heap_simple()
42 ASSERT_EQ(ZBI_TOPOLOGY_ENTITY_PROCESSOR, node->entity_type); in test_flat_to_heap_simple()
43 ASSERT_EQ(ZBI_TOPOLOGY_PROCESSOR_PRIMARY, node->entity.processor.flags); in test_flat_to_heap_simple()
44 ASSERT_EQ(ZBI_TOPOLOGY_ENTITY_CLUSTER, node->parent->entity_type); in test_flat_to_heap_simple()
45 ASSERT_EQ(1, node->parent->entity.cluster.performance_class); in test_flat_to_heap_simple()
/kernel/lib/pow2_range_allocator/
A Dpow2_range_allocator.cpp22 struct list_node node; member
28 struct list_node node; member
75 list_add_before(&after->node, &block->node); in p2ra_return_free_block()
80 after = list_next_type(l, &after->node, p2ra_block_t, node); in p2ra_return_free_block()
85 list_add_tail(l, &block->node); in p2ra_return_free_block()
97 first = list_prev_type(l, &block->node, p2ra_block_t, node); in p2ra_return_free_block()
101 second = list_next_type(l, &block->node, p2ra_block_t, node); in p2ra_return_free_block()
115 list_delete(&first->node); in p2ra_return_free_block()
116 list_delete(&second->node); in p2ra_return_free_block()
382 list_delete(&block->node); in p2ra_free_range()
[all …]
/kernel/kernel/
A Dtimer.cpp105 list_for_every_entry (&percpu[cpu].timer_queue, entry, timer_t, node) { in insert_timer_in_queue()
113 list_add_before(&entry->node, &timer->node); in insert_timer_in_queue()
126 list_add_after(&entry->node, &timer->node); in insert_timer_in_queue()
147 list_next_type(&percpu[cpu].timer_queue, &entry->node, timer_t, node); in insert_timer_in_queue()
190 list_add_after(&entry->node, &timer->node); in insert_timer_in_queue()
196 list_add_tail(&percpu[cpu].timer_queue, &timer->node); in insert_timer_in_queue()
209 if (list_in_list(&timer->node)) { in timer_set()
319 if (list_in_list(&timer->node)) { in timer_cancel()
326 list_delete(&timer->node); in timer_cancel()
403 list_delete(&timer->node); in timer_tick()
[all …]
A Ddpc.cpp28 if (list_in_list(&dpc->node)) { in dpc_queue()
36 list_add_tail(&cpu->dpc_list, &dpc->node); in dpc_queue()
52 if (list_in_list(&dpc->node)) { in dpc_queue_thread_locked()
60 list_add_tail(&cpu->dpc_list, &dpc->node); in dpc_queue_thread_locked()
112 while ((dpc = list_remove_head_type(src_list, dpc_t, node))) { in dpc_shutdown_transition_off_cpu()
113 list_add_tail(dst_list, &dpc->node); in dpc_shutdown_transition_off_cpu()
149 dpc_t* dpc = list_remove_head_type(list, dpc_t, node); in dpc_thread()
A Dmp.cpp159 list_add_tail(&mp.ipi_task_list[cpu_id], &sync_tasks[cpu_id].node); in mp_sync_exec()
216 if (list_in_list(&sync_tasks[i].node)) { in mp_sync_exec()
217 list_delete(&sync_tasks[i].node); in mp_sync_exec()
403 task = list_remove_head_type(&mp.ipi_task_list[local_cpu], struct mp_ipi_task, node); in mp_mbx_generic_irq()
/kernel/lib/heap/
A Dheap_wrapper.cpp47 list_node node; member
71 list_for_every_entry (&stat_list, s, alloc_stat, node) { in add_stat()
74 list_delete(&s->node); in add_stat()
75 list_add_head(&stat_list, &s->node); in add_stat()
88 list_add_head(&stat_list, &s->node); in add_stat()
100 while ((s = list_remove_head_type(&stat_list, alloc_stat, node))) in dump_stats()
106 list_for_every_entry (&stat_list, s, alloc_stat, node) { in dump_stats()
108 list_add_before(&s->node, &stats[i].node); in dump_stats()
115 list_add_tail(&stat_list, &stats[i].node); in dump_stats()
120 list_for_every_entry (&stat_list, s, alloc_stat, node) { in dump_stats()
/kernel/include/kernel/
A Ddpc.h22 struct list_node node; member
30 .node = LIST_INITIAL_CLEARED_VALUE, \
A Dtimer.h28 struct list_node node; member
43 .node = LIST_INITIAL_CLEARED_VALUE, \
A Dmp.h86 struct list_node node; member
/kernel/object/include/object/
A Dfutex_node.h35 static FutexNode* RemoveNodeFromList(FutexNode* list_head, FutexNode* node);
37 static FutexNode* WakeThreads(FutexNode* node, uint32_t count,
A Dfutex_context.h84 bool UnqueueNodeLocked(FutexNode* node) TA_REQ(lock_);
/kernel/target/arm64/boot-shim/
A Dboot-shim.c59 node_t node; member
79 ctx->node = NODE_CHOSEN; in node_callback()
81 ctx->node = NODE_MEMORY; in node_callback()
83 ctx->node = NODE_CPU; in node_callback()
86 ctx->node = NODE_INTC; in node_callback()
88 ctx->node = NODE_NONE; in node_callback()
104 switch (ctx->node) { in prop_callback()
159 ctx->node = NODE_NONE; in read_device_tree()
/kernel/lib/lockdep/
A Dlock_dep.cpp176 for (auto& node : lockdep::LockClassState::Iter()) { in SystemCircularLockDependencyDetected() local
177 if (node.connected_set() == connected_set_root) in SystemCircularLockDependencyDetected()
178 printf(" %s\n", node.name()); in SystemCircularLockDependencyDetected()
/kernel/lib/fbl/
A Darena.cpp244 Node* node = free_.pop_front(); in Alloc() local
245 auto slot = node->slot; in Alloc()
246 control_.Push(node); in Alloc()
264 Node* node = new (reinterpret_cast<void*>(control_.Pop())) Node{addr}; in Free()
265 free_.push_front(node); in Free()
/kernel/lib/counters/
A Dcounters.cpp29 list_node node; member
207 list_for_every_entry (&watcher_list, wc, watched_counter_t, node) { in watcher_thread_fn()
273 &watcher_list, watched_counter_t, node)) != nullptr) { in watch_counter()
301 list_add_head(&watcher_list, &wc->node); in watch_counter()
/kernel/vm/
A Dpmm_arena.h25 zx_status_t Init(const pmm_arena_info_t* info, PmmNode* node);
A Dpmm_arena.cpp23 zx_status_t PmmArena::Init(const pmm_arena_info_t* info, PmmNode* node) { in Init() argument
80 node->AddFreePages(&list); in Init()
A Dvm_page_list.cpp260 ktl::unique_ptr<VmPageListNode> node = list_.erase(offset_to_node_offset(offset)); in TakePages() local
261 if (node) { in TakePages()
262 res.middle_.insert(ktl::move(node)); in TakePages()
/kernel/lib/debuglog/include/lib/
A Ddebuglog.h40 struct list_node node; member
/kernel/lib/debuglog/
A Ddebuglog.cpp261 list_add_tail(&log->readers, &rdr->node); in dlog_reader_init()
284 list_delete(&rdr->node); in dlog_reader_destroy()
303 list_for_every_entry (&log->readers, rdr, dlog_reader_t, node) { in debuglog_notifier()

Completed in 33 milliseconds