Searched refs:node (Results 1 – 5 of 5) sorted by relevance
| /examples/utest/testcases/drivers/serial_bypass/ |
| A D | bypass_register.c | 56 rt_list_t* node = _serial0->bypass->upper_h->head.next; in bypass_register_001() local
59 rt_list_t* next = node->next; in bypass_register_001()
60 … struct rt_serial_bypass_func* temp = rt_container_of(node, struct rt_serial_bypass_func, node); in bypass_register_001()
63 node = next; in bypass_register_001()
81 rt_list_t* next = node->next; in bypass_register_002()
82 … struct rt_serial_bypass_func* temp = rt_container_of(node, struct rt_serial_bypass_func, node); in bypass_register_002()
85 node = next; in bypass_register_002()
87 node = _serial0->bypass->lower_h->head.next; in bypass_register_002()
90 rt_list_t* next = node->next; in bypass_register_002()
91 … struct rt_serial_bypass_func* temp = rt_container_of(node, struct rt_serial_bypass_func, node); in bypass_register_002()
[all …]
|
| /examples/test/ |
| A D | avl.c | 30 rt_varea_t lchild = VAREA_ENTRY(varea->node.node.avl_left); in _print_varea()
60 rt_varea_t lchild = VAREA_ENTRY(varea->node.node.avl_left); in _is_bst()
61 rt_varea_t rchild = VAREA_ENTRY(varea->node.node.avl_right); in _is_bst()
64 RT_ASSERT(lchild->node.node.parent == &varea->node.node); in _is_bst()
69 RT_ASSERT(rchild->node.node.parent == &varea->node.node); in _is_bst()
373 node = node->avl_left; in search()
377 node = node->avl_right; in search()
414 node = node->avl_left; in _aspace_bst_search_exceed()
418 node = node->avl_right; in _aspace_bst_search_exceed()
465 util_avl_link(&varea->node.node, current, next); in _aspace_bst_insert()
[all …]
|
| /examples/utest/testcases/kernel/ |
| A D | slab_tc.c | 29 rt_list_t node; member
89 ctx = rt_list_first_entry(&head.list, struct slab_alloc_context, node); in slab_alloc_test()
90 rt_list_remove(&ctx->node); in slab_alloc_test()
109 rt_list_init(&ctx->node); in slab_alloc_test()
116 rt_list_insert_after(&head.list, &ctx->node); in slab_alloc_test()
123 ctx = rt_list_first_entry(&head.list, struct slab_alloc_context, node); in slab_alloc_test()
124 rt_list_remove(&ctx->node); in slab_alloc_test()
140 ctx = rt_list_first_entry(&head.list, struct slab_alloc_context, node); in slab_alloc_test()
141 rt_list_remove(&ctx->node); in slab_alloc_test()
|
| A D | mem_tc.c | 284 rt_list_t node; member
346 ctx = rt_list_first_entry(&head.list, struct mem_alloc_context, node); in mem_alloc_test()
347 rt_list_remove(&ctx->node); in mem_alloc_test()
366 rt_list_init(&ctx->node); in mem_alloc_test()
373 rt_list_insert_after(&head.list, &ctx->node); in mem_alloc_test()
380 ctx = rt_list_first_entry(&head.list, struct mem_alloc_context, node); in mem_alloc_test()
381 rt_list_remove(&ctx->node); in mem_alloc_test()
397 ctx = rt_list_first_entry(&head.list, struct mem_alloc_context, node); in mem_alloc_test()
398 rt_list_remove(&ctx->node); in mem_alloc_test()
|
| /examples/utest/testcases/mm/ |
| A D | mm_memblock_tc.c | 32 rt_slist_for_each_entry(ret, &(memblock->reg_list), node) in _nth_reg()
46 rt_slist_for_each_entry(reg, &(memblock->reg_list), node) in _reg_cnt()
58 rt_slist_for_each_entry(reg, &(mmblk_memory->reg_list), node) in _reset_memblock()
62 rt_slist_for_each_entry(reg, &(mmblk_reserved->reg_list), node) in _reset_memblock()
|
Completed in 8 milliseconds