Home
last modified time | relevance | path

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

12

/lk-master/kernel/vm/
A Dpmm.c73 list_add_before(&a->node, &arena->node); in pmm_add_arena()
79 list_add_tail(&arena_list, &arena->node); in pmm_add_arena()
129 list_add_tail(list, &page->node); in pmm_alloc_pages()
182 list_delete(&page->node); in pmm_alloc_range()
184 list_add_tail(list, &page->node); in pmm_alloc_range()
235 list_add_head(&list, &page->node); in pmm_free_page()
273 list_add_tail(&list, &p->node); in pmm_free_kpages()
337 list_delete(&p->node); in pmm_alloc_contiguous()
437 struct list_node *node; in cmd_pmm() local
462 struct list_node *node; in cmd_pmm() local
[all …]
A Dvmm.c139 … vmm_region_t *next = list_next_type(&aspace->region_list, &last->node, vmm_region_t, node); in add_region_to_aspace()
142 list_add_after(&last->node, &r->node); in add_region_to_aspace()
233 list_next_type(&aspace->region_list, &r->node, vmm_region_t, node), in alloc_spot()
282 list_add_after(before, &r->node); in alloc_region()
443 list_add_tail(&r->page_list, &p->node); in vmm_alloc_contiguous()
527 list_add_tail(&r->page_list, &p->node); in vmm_alloc()
569 list_delete(&r->node); in vmm_free_region()
615 list_clear_node(&aspace->node); in vmm_create_aspace()
630 if (!list_in_list(&aspace->node)) { in vmm_free_aspace()
634 list_delete(&aspace->node); in vmm_free_aspace()
[all …]
/lk-master/lib/minip/
A Dnet_timer.c31 list_for_every_entry(&net_timer_list, e, net_timer_t, node) { in add_to_queue()
33 list_add_before(&e->node, &t->node); in add_to_queue()
38 list_add_tail(&net_timer_list, &t->node); in add_to_queue()
48 if (list_in_list(&t->node)) { in net_timer_set()
49 list_delete(&t->node); in net_timer_set()
71 if (list_in_list(&t->node)) { in net_timer_cancel()
72 list_delete(&t->node); in net_timer_cancel()
90 e = list_peek_head_type(&net_timer_list, net_timer_t, node); in net_timer_work_routine()
101 list_delete(&e->node); in net_timer_work_routine()
A Darp.c27 struct list_node node; member
61 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_update()
64 mru_update(&arp->node); in arp_cache_update()
81 list_add_head(&arp_list, &arp->node); in arp_cache_update()
97 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_lookup()
99 mru_update(&arp->node); in arp_cache_lookup()
114 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_dump()
/lk-master/external/lib/lwip/core/snmp/
A Dmib_structs.c64 push_node(struct nse* node) in push_node() argument
79 pop_node(struct nse* node) in pop_node() argument
458 while (node != NULL) in snmp_search_tree()
492 node = an->nptr[i]; in snmp_search_tree()
539 node = ln->nptr; in snmp_search_tree()
645 if (node != NULL) in empty_table()
690 while (node != NULL) in snmp_expand_tree()
773 node = an->nptr[i]; in snmp_expand_tree()
889 node = ln->nptr; in snmp_expand_tree()
922 node = jn->nptr; in snmp_expand_tree()
[all …]
/lk-master/external/platform/pico/common/pico_util/
A Dpheap.c82 pheap_node_t *node = ph_get_node(heap, id); in ph_delete() local
83 if (!node->parent) return false; // not in tree in ph_delete()
84 pheap_node_t *parent = ph_get_node(heap, node->parent); in ph_delete()
86 parent->child = node->sibling; in ph_delete()
93 prev_sibling->sibling = node->sibling; in ph_delete()
101 node->sibling = node->parent = 0; in ph_delete()
117 pheap_node_t *node = ph_get_node(heap, id); in ph_dump_node() local
118 printf("%d (c=%d s=%d p=%d) ", id, node->child, node->sibling, node->parent); in ph_dump_node()
121 count += ph_dump_node(heap, node->child, dump_key, user_data, indent + 1); in ph_dump_node()
122 count += ph_dump_node(heap, node->sibling, dump_key, user_data, indent); in ph_dump_node()
/lk-master/kernel/
A Dtimer.c60 list_for_every_entry(&timers[cpu].timer_queue, entry, timer_t, node) { in insert_timer_in_queue()
62 list_add_before(&entry->node, &timer->node); in insert_timer_in_queue()
68 list_add_tail(&timers[cpu].timer_queue, &timer->node); in insert_timer_in_queue()
78 if (list_in_list(&timer->node)) { in timer_set()
97 if (list_peek_head_type(&timers[cpu].timer_queue, timer_t, node) == timer) { in timer_set()
162 if (list_in_list(&timer->node)) in timer_cancel()
163 list_delete(&timer->node); in timer_cancel()
213 timer = list_peek_head_type(&timers[cpu].timer_queue, timer_t, node); in timer_tick()
223 list_delete(&timer->node); in timer_tick()
245 if (periodic && !list_in_list(&timer->node) && timer->periodic_time > 0) { in timer_tick()
[all …]
A Dport.c52 struct list_node node; member
138 list_for_every_entry(&write_port_list, wp, write_port_t, node) { in port_create()
173 list_add_tail(&write_port_list, &wp->node); in port_create()
207 list_for_every_entry(&write_port_list, wp, write_port_t, node) { in port_open()
482 list_delete(&wp->node); in port_destroy()
/lk-master/lib/heap/miniheap/
A Dminiheap.c39 struct list_node node; member
108 list_add_before(&next_chunk->node, &chunk->node); in heap_insert_free_chunk()
115 list_add_tail(&theheap.free_list, &chunk->node); in heap_insert_free_chunk()
119 last_chunk = list_prev_type(&theheap.free_list, &chunk->node, struct free_heap_chunk, node); in heap_insert_free_chunk()
126 list_delete(&chunk->node); in heap_insert_free_chunk()
141 list_delete(&next_chunk->node); in heap_insert_free_chunk()
217 list_delete(&chunk->node); in miniheap_alloc()
228 list_add_before(next_node, &newchunk->node); in miniheap_alloc()
378 list_delete(&chunk->node); in miniheap_trim()
411 list_add_after(&chunk->node, &new_chunk->node); in miniheap_trim()
[all …]
/lk-master/top/include/lk/
A Dlist.h215 #define list_for_every(list, node) \ argument
216 for(node = (list)->next; node != (list); node = node->next)
220 #define list_for_every_safe(list, node, temp_node) \ argument
221 for(node = (list)->next, temp_node = (node)->next;\
222 node != (list);\
223 node = temp_node, temp_node = (node)->next)
245 struct list_node *node = list; in list_length() local
246 list_for_every(list, node) { in list_length()
/lk-master/lib/bcache/
A Dbcache.c21 struct list_node node; member
68 list_add_head(&cache->free_list, &cache->blocks[i].node); in bcache_create()
115 list_for_every_entry(&cache->lru_list, block, struct bcache_block, node) { in find_block()
120 list_delete(&block->node); in find_block()
121 list_add_tail(&cache->lru_list, &block->node); in find_block()
141 list_add_tail(&cache->lru_list, &block->node); in alloc_block()
147 list_for_every_entry(&cache->lru_list, block, struct bcache_block, node) { in alloc_block()
157 list_delete(&block->node); in alloc_block()
158 list_add_tail(&cache->lru_list, &block->node); in alloc_block()
186 list_add_tail(&cache->free_list, &block->node); in find_or_fill_block()
[all …]
/lk-master/lib/heap/
A Dheap_wrapper.c127 struct list_node *node; in heap_free_delayed_list() local
128 while ((node = list_remove_head(&delayed_free_list))) { in heap_free_delayed_list()
129 list_add_head(&list, node); in heap_free_delayed_list()
133 while ((node = list_remove_head(&list))) { in heap_free_delayed_list()
134 LTRACEF("freeing node %p\n", node); in heap_free_delayed_list()
135 HEAP_FREE(node); in heap_free_delayed_list()
222 struct list_node *node = (struct list_node *)ptr; in heap_delayed_free() local
226 list_add_head(&delayed_free_list, node); in heap_delayed_free()
236 struct list_node *node; in heap_dump() local
237 list_for_every(&delayed_free_list, node) { in heap_dump()
[all …]
/lk-master/lib/fs/spifs/
A Dspifs.c89 struct list_node node; member
95 struct list_node node; member
202 list_next_type(&spifs->files, &file->node, spifs_file_t, node); in find_open_run()
242 list_next_type(&spifs->files, &file->node, spifs_file_t, node); in consistency_check()
307 file = list_next_type(&spifs->files, &file->node, spifs_file_t, node); in spifs_commit_toc()
345 list_add_before(&file->node, &target->node); in spifs_add_ascending()
350 list_add_tail(&spifs->files, &target->node); in spifs_add_ascending()
786 list_delete(&file->node); in spifs_create()
861 list_delete(&file->node); in spifs_remove()
1096 spifs_file_t, node); in spifs_readdir()
[all …]
/lk-master/lib/fs/memfs/
A Dmemfs.c29 struct list_node node; member
41 struct list_node node; member
50 list_for_every_entry(&mem->files, file, memfs_file_t, node) { in find_file()
89 while ((file = list_remove_head_type(&mem->files, memfs_file_t, node))) { in memfs_unmount()
145 list_add_tail(&mem->files, &file->node); in memfs_create()
188 list_delete(&file->node); in memfs_remove()
330 dir->next_file = list_peek_head_type(&mem->files, memfs_file_t, node); in memfs_opendir()
331 list_add_head(&mem->dcookies, &dir->node); in memfs_opendir()
352 …ie->next_file = list_next_type(&dcookie->fs->files, &dcookie->next_file->node, memfs_file_t, node); in memfs_readdir()
368 list_delete(&dcookie->node); in memfs_closedir()
/lk-master/lib/text/
A Dtext.c38 struct list_node node; member
53 list_add_head(&text_list, &line->node); in text_draw()
70 list_for_every_entry(&text_list, line, struct text_line, node) { in text_update()
/lk-master/lib/dpc/
A Ddpc.c19 struct list_node node; member
41 list_add_tail(&dpc_list, &dpc->node); in dpc_queue()
53 struct dpc *dpc = list_remove_head_type(&dpc_list, struct dpc, node); in dpc_thread_routine()
/lk-master/lib/ptable/
A Dptable.c37 struct list_node node; member
85 struct list_node *node; in ptable_write() local
86 list_for_every(&ptable.list, node) { in ptable_write()
114 list_for_every_entry(&ptable.list, mentry, struct ptable_mem_entry, node) { in ptable_write()
177 if (list_in_list(&mentry->node)) in ptable_unpublish()
178 list_delete(&mentry->node); in ptable_unpublish()
211 list_add_before(&it_mentry->node, &mentry->node); in ptable_push_entry()
219 list_add_tail(&ptable.list, &mentry->node); in ptable_push_entry()
419 list_for_every_entry(&ptable.list, mentry, struct ptable_mem_entry, node) { in ptable_allocate()
538 list_for_every_entry(&ptable.list, mentry, struct ptable_mem_entry, node) { in ptable_allocate_at()
[all …]
/lk-master/external/lib/fdt/
A Dfdt_overlay.c116 static int overlay_phandle_add_offset(void *fdt, int node, in overlay_phandle_add_offset() argument
123 val = fdt_getprop(fdt, node, name, &len); in overlay_phandle_add_offset()
138 return fdt_setprop_inplace_u32(fdt, node, name, adj_val); in overlay_phandle_add_offset()
156 static int overlay_adjust_node_phandles(void *fdto, int node, in overlay_adjust_node_phandles() argument
162 ret = overlay_phandle_add_offset(fdto, node, "phandle", delta); in overlay_adjust_node_phandles()
166 ret = overlay_phandle_add_offset(fdto, node, "linux,phandle", delta); in overlay_adjust_node_phandles()
170 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
557 void *fdto, int node) in overlay_apply_node() argument
562 fdt_for_each_property_offset(property, fdto, node) { in overlay_apply_node()
580 fdt_for_each_subnode(subnode, fdto, node) { in overlay_apply_node()
/lk-master/kernel/include/kernel/
A Dtimer.h25 struct list_node node; member
37 .node = LIST_INITIAL_CLEARED_VALUE, \
A Dvm.h72 struct list_node node; member
110 struct list_node node; member
186 struct list_node node; member
202 struct list_node node; member
/lk-master/lib/sysparam/
A Dsysparam.c48 struct list_node node; member
141 list_for_every_entry(&params.list, param, struct sysparam, node) { in sysparam_find()
219 list_add_tail(&params.list, &param->node); in sysparam_scan()
239 list_for_every_entry_safe(&params.list, param, temp, struct sysparam, node) { in sysparam_reload()
240 list_delete(&param->node); in sysparam_reload()
308 list_for_every_entry(&params.list, param, struct sysparam, node) { in sysparam_write()
334 list_for_every_entry(&params.list, param, struct sysparam, node) { in sysparam_write()
391 list_add_tail(&params.list, &param->node); in sysparam_add()
408 list_delete(&param->node); in sysparam_remove()
445 list_for_every_entry(&params.list, param, struct sysparam, node) { in sysparam_dump()
[all …]
/lk-master/external/lib/fdt/include/
A Dlibfdt.h226 #define fdt_for_each_subnode(node, fdt, parent) \ argument
227 for (node = fdt_first_subnode(fdt, parent); \
228 node >= 0; \
229 node = fdt_next_subnode(fdt, node))
606 #define fdt_for_each_property_offset(property, fdt, node) \ argument
607 for (property = fdt_first_property_offset(fdt, node); \
/lk-master/arch/test/
A Dmmu.c45 list_for_every_entry(&pages, p, vm_page_t, node) { in map_user_pages()
53 list_for_every_entry(&pages, p, vm_page_t, node) { in map_user_pages()
/lk-master/lib/bio/
A Dbio.c294 DEBUG_ASSERT(!list_in_list(&dev->node)); in bdev_dec_ref()
339 list_for_every_entry(&bdevs.list, entry, bdev_t, node) { in bio_open()
450 list_clear_node(&dev->node); in bio_initialize_bdev()
520 list_add_tail(&bdevs.list, &dev->node); in bio_register_device()
531 list_delete(&dev->node); in bio_unregister_device()
541 list_for_every_entry(&bdevs.list, entry, bdev_t, node) { in bio_dump_devices()
/lk-master/dev/usb/
A Dusb.c43 struct list_node node; member
183 list_add_tail(&usb.cb_list, &c->node); in usb_register_callback()
190 list_for_every_entry(&usb.cb_list, c, usb_callback_container_t, node) { in usb_do_callbacks()

Completed in 36 milliseconds

12