Home
last modified time | relevance | path

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

/src/
A Dobject.c277 struct rt_list_node *node = RT_NULL; in rt_object_get_length() local
284 rt_list_for_each(node, &(information->object_list)) in rt_object_get_length()
313 struct rt_list_node *node = RT_NULL; in rt_object_get_pointers() local
323 rt_list_for_each(node, &(information->object_list)) in rt_object_get_pointers()
364 struct rt_list_node *node = RT_NULL; in rt_object_init() local
381 for (node = information->object_list.next; in rt_object_init()
382 node != &(information->object_list); in rt_object_init()
383 node = node->next) in rt_object_init()
387 obj = rt_list_entry(node, struct rt_object, list); in rt_object_init()
641 struct rt_list_node *node = RT_NULL; in rt_object_for_each() local
[all …]
A Dsignal.c560 struct rt_slist_node *node; in rt_thread_free_sig() local
564 node = &(si_node->list); in rt_thread_free_sig()
567 node_to_free = node; in rt_thread_free_sig()
568 node = node->next; in rt_thread_free_sig()
571 } while (node); in rt_thread_free_sig()
608 struct rt_slist_node *node; in rt_thread_kill() local
613 node = (struct rt_slist_node *)&si_node->list; in rt_thread_kill()
615 node = RT_NULL; in rt_thread_kill()
618 for (; (node) != RT_NULL; node = node->next) in rt_thread_kill()
620 entry = rt_slist_entry(node, struct siginfo_node, list); in rt_thread_kill()
A Dmemheap.c783 struct rt_list_node *node; in _memheap_alloc() local
790 for (node = information->object_list.next; in _memheap_alloc()
791 node != &(information->object_list); in _memheap_alloc()
792 node = node->next) in _memheap_alloc()
794 object = rt_list_entry(node, struct rt_object, list); in _memheap_alloc()
869 struct rt_list_node *node; in memheapcheck() local
879 for (node = list->next; node != list; node = node->next) in memheapcheck()
881 heap = (struct rt_memheap *)rt_list_entry(node, struct rt_object, list); in memheapcheck()
934 struct rt_list_node *node; in memheaptrace() local
940 for (node = list->next; node != list; node = node->next) in memheaptrace()
[all …]
A Dmem.c553 struct rt_list_node *node; in memcheck() local
561 for (node = information->object_list.next; in memcheck()
562 node != &(information->object_list); in memcheck()
563 node = node->next) in memcheck()
565 object = rt_list_entry(node, struct rt_object, list); in memcheck()
607 struct rt_list_node *node; in memtrace() local
614 for (node = information->object_list.next; in memtrace()
615 node != &(information->object_list); in memtrace()
616 node = node->next) in memtrace()
618 object = rt_list_entry(node, struct rt_object, list); in memtrace()
A Dirq.c77 rt_slist_insert(&this_cpu->irq_ctx_head, &this_ctx->node); in rt_interrupt_context_push()
89 … return rt_slist_first_entry(&this_cpu->irq_ctx_head, struct rt_interrupt_context, node)->context; in rt_interrupt_context_get()
A Dipc.c295 struct rt_list_node *node; in rt_susp_list_print() local
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()
847 rt_list_t *node = RT_NULL; in _thread_get_mutex_priority() local
3506 for (node = mq->msg_queue_head; node != RT_NULL; node = node->next) in _rt_mq_send_wait()
3508 if (node->prio < msg->prio) 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()
3519 if (node != msg) in _rt_mq_send_wait()
3520 node->next = msg; in _rt_mq_send_wait()
[all …]
A Dthread.c82 rt_list_t *node; in _thread_detach_from_mutex() local
100 rt_list_for_each_safe(node, tmp_list, &(thread->taken_object_list)) in _thread_detach_from_mutex()
102 mutex = rt_list_entry(node, struct rt_mutex, taken_list); in _thread_detach_from_mutex()

Completed in 17 milliseconds