Home
last modified time | relevance | path

Searched refs:next (Results 1 – 10 of 10) sorted by relevance

/src/
A Dmemheap.c53 next_ptr->prev->next = next_ptr->next; in _remove_next_ptr()
137 item = item->next; in rt_memheap_init()
266 new_ptr->next = header_ptr->next; in rt_memheap_alloc()
465 next_ptr->next = header_ptr->next; in rt_memheap_realloc()
541 new_ptr->next = header_ptr->next; in rt_memheap_realloc()
558 new_ptr->next = free_ptr->next; in rt_memheap_realloc()
657 (header_ptr->prev)->next = header_ptr->next; in rt_memheap_free()
679 header_ptr->next = new_ptr->next; in rt_memheap_free()
879 for (node = list->next; node != list; node = node->next) in memheapcheck()
911 if (item->next == item->next->prev) in memheapcheck()
[all …]
A Dmem.c140 mem->next = nmem->next; in plug_holes()
154 pmem->next = mem->next; in plug_holes()
328 mem2->next = mem->next; in rt_smem_alloc()
335 mem->next = ptr2; in rt_smem_alloc()
442 size = mem->next - ptr - SIZEOF_STRUCT_MEM; in rt_smem_realloc()
457 mem2->next = mem->next; in rt_smem_realloc()
462 mem->next = ptr2; in rt_smem_realloc()
561 for (node = information->object_list.next; in memcheck()
563 node = node->next) in memcheck()
614 for (node = information->object_list.next; in memtrace()
[all …]
A Dslab.c182 struct rt_slab_page *next; /**< next valid page */ member
225 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_alloc()
231 n->next = b->next; in rt_slab_page_alloc()
240 *prev = b->next; in rt_slab_page_alloc()
269 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_free()
276 if (b + (b->page += npages) == b->next) in rt_slab_page_free()
278 b->page += b->next->page; in rt_slab_page_free()
279 b->next = b->next->next; in rt_slab_page_free()
287 n->next = b->next; in rt_slab_page_free()
297 n->next = b; in rt_slab_page_free()
A Dsignal.c412 if (si_prev) si_prev->list.next = si_node->list.next; in rt_signal_wait()
417 if (si_node->list.next) in rt_signal_wait()
419 … node_next = (void *)rt_slist_entry(si_node->list.next, struct siginfo_node, list); in rt_signal_wait()
435 if (si_node->list.next) in rt_signal_wait()
437 si_node = (void *)rt_slist_entry(si_node->list.next, struct siginfo_node, list); in rt_signal_wait()
474 if (si_node->list.next == RT_NULL) in rt_thread_handle_sig()
477 … tid->si_list = (void *)rt_slist_entry(si_node->list.next, struct siginfo_node, list); in rt_thread_handle_sig()
568 node = node->next; in rt_thread_free_sig()
618 for (; (node) != RT_NULL; node = node->next) in rt_thread_kill()
A Dipc.c257 for (n = susp_list->next; n != susp_list; n = n->next) in rt_susp_list_enqueue()
299 for (node = list->next; node != list; node = node->next) in rt_susp_list_print()
304 if (node->next != list) in rt_susp_list_print()
2029 n = n->next; in rt_event_send()
3486 mq->msg_queue_free = msg->next; in _rt_mq_send_wait()
3491 msg->next = RT_NULL; in _rt_mq_send_wait()
3514 msg->next = node; in _rt_mq_send_wait()
3517 if (node->next == RT_NULL) in _rt_mq_send_wait()
3520 node->next = msg; in _rt_mq_send_wait()
3680 mq->msg_queue_free = msg->next; in rt_mq_urgent()
[all …]
A Dtimer.c178 timer = rt_list_entry(timer_list[RT_TIMER_SKIP_LIST_LEVEL - 1].next, in _timer_list_next_timeout()
229 for (list = timer_heads[RT_TIMER_SKIP_LIST_LEVEL - 1].next; in rt_timer_dump()
231 list = list->next) in rt_timer_dump()
429 row_head[row_lvl] = row_head[row_lvl]->next) in _timer_start()
432 rt_list_t *p = row_head[row_lvl]->next; in _timer_start()
503 t = rt_list_entry(timer_list[RT_TIMER_SKIP_LIST_LEVEL - 1].next, in _timer_check()
A Ddefunct.c56 thread = RT_THREAD_LIST_NODE_ENTRY(l->next); in rt_thread_defunct_dequeue()
A Dobject.c381 for (node = information->object_list.next; in rt_object_init()
383 node = node->next) in rt_object_init()
A Dscheduler_up.c110 …priority_thread = RT_THREAD_LIST_NODE_ENTRY(rt_thread_priority_table[highest_ready_priority].next); in _scheduler_get_highest_priority_thread()
A Dscheduler_mp.c246 rt_thread_priority_table[highest_ready_priority].next); in _scheduler_get_highest_priority_thread()
254 pcpu->priority_table[local_highest_ready_priority].next); in _scheduler_get_highest_priority_thread()

Completed in 21 milliseconds