Home
last modified time | relevance | path

Searched refs:queue_node (Results 1 – 17 of 17) sorted by relevance

/kernel/vm/
A Dpmm_node.cpp86 list_delete(&page->queue_node); in AddFreePages()
87 list_add_tail(&free_list_, &page->queue_node); in AddFreePages()
158 list_add_tail(list, &page->queue_node); in AllocPages()
193 list_delete(&page->queue_node); in AllocRange()
197 list_add_tail(list, &page->queue_node); in AllocRange()
246 DEBUG_ASSERT(list_in_list(&p->queue_node)); in AllocContiguous()
248 list_delete(&p->queue_node); in AllocContiguous()
259 list_add_tail(list, &p->queue_node); in AllocContiguous()
280 if (list_in_list(&page->queue_node)) { in FreePageLocked()
281 list_delete(&page->queue_node); in FreePageLocked()
[all …]
A Dpmm.cpp87 list_add_tail(list, &page->queue_node); in pmm_alloc_contiguous()
A Dbootreserve.cpp83 list_for_every_entry (&reserved_page_list, p, vm_page_t, queue_node) { in boot_reserve_wire()
A Dvm_page_list.cpp191 list_add_tail(&list, &p->queue_node); in FreePages()
221 list_add_tail(&list, &p->queue_node); in FreeAllPages()
A Dpmm_arena.cpp76 list_add_tail(&list, &p.queue_node); in Init()
A Dvm.cpp58 list_for_every_entry (&list, p, vm_page_t, queue_node) { in MarkPagesInUsePhys()
A Dvm_object_paged.cpp168 vm_page_t* p = list_remove_head_type(&page_list, vm_page_t, queue_node); in CreateContiguous()
462 p_clone = list_remove_head_type(free_list, vm_page, queue_node); in GetPageLocked()
522 p = list_remove_head_type(free_list, vm_page, queue_node); in GetPageLocked()
A Dvm_unittest.cpp984 list_for_every_entry (&phys_list, p, vm_page_t, queue_node) { in arch_noncontiguous_map()
/kernel/kernel/
A Dwait.cpp83 list_for_every_entry (&temp->queue_node, temp2, thread_t, queue_node) { in wait_queue_validate_queue()
99 list_initialize(&t->queue_node); in wait_queue_insert()
109 list_initialize(&t->queue_node); in wait_queue_insert()
114 list_add_tail(&temp->queue_node, &t->queue_node); in wait_queue_insert()
121 list_initialize(&t->queue_node); in wait_queue_insert()
130 if (list_is_empty(&t->queue_node)) { in remove_queue_head()
133 list_clear_node(&t->queue_node); in remove_queue_head()
136 thread_t* newhead = list_peek_head_type(&t->queue_node, thread_t, queue_node); in remove_queue_head()
137 list_delete(&t->queue_node); in remove_queue_head()
162 list_delete(&t->queue_node); in wait_queue_remove_thread()
[all …]
A Dsched.cpp217 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in insert_in_run_queue_head()
219 list_add_head(&percpu[cpu].run_queue[t->effec_priority], &t->queue_node); in insert_in_run_queue_head()
227 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in insert_in_run_queue_tail()
229 list_add_tail(&percpu[cpu].run_queue[t->effec_priority], &t->queue_node); in insert_in_run_queue_tail()
241 list_delete(&t->queue_node); in remove_from_run_queue()
264 … thread_t* newthread = list_remove_head_type(&c->run_queue[highest_queue], thread_t, queue_node); in sched_get_top_thread()
364 while ((t = list_remove_tail_type(list, thread_t, queue_node))) { in sched_unblock_list()
529 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in sched_transition_off_cpu()
530 list_add_head(&pinned_threads, &t->queue_node); in sched_transition_off_cpu()
535 while ((t = list_remove_head_type(&pinned_threads, thread_t, queue_node)) != NULL) { in sched_transition_off_cpu()
[all …]
A Dthread.cpp424 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in thread_join()
536 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in thread_forget()
/kernel/vm/include/vm/
A Dpage.h34 struct list_node queue_node; member
/kernel/lib/heap/
A Dheap_wrapper.cpp270 list_for_every_entry_safe (&list, p, temp, vm_page_t, queue_node) { in heap_page_alloc()
271 list_delete(&p->queue_node); in heap_page_alloc()
295 DEBUG_ASSERT(!list_in_list(&p->queue_node)); in heap_page_free()
297 list_add_tail(&list, &p->queue_node); in heap_page_free()
/kernel/object/include/object/
A Dbuffer_chain.h104 list_for_every_entry (&pages, page, vm_page_t, queue_node) { in Alloc()
/kernel/include/kernel/
A Dthread.h93 struct list_node queue_node; member
/kernel/arch/x86/page_tables/
A Dpage_tables.cpp181 list_add_tail(&to_free_, &page->queue_node); in queue_free()
520 DEBUG_ASSERT(!list_in_list(&page->queue_node)); in RemoveMapping()
/kernel/platform/pc/
A Dplatform.cpp630 list_for_every_entry (&list, p, vm_page_t, queue_node) { in alloc_pages_greater_than()

Completed in 69 milliseconds