Home
last modified time | relevance | path

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

/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.c21 struct list_node node; member
54 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_update()
57 mru_update(&arp->node); in arp_cache_update()
74 list_add_head(&arp_list, &arp->node); in arp_cache_update()
90 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_lookup()
92 mru_update(&arp->node); in arp_cache_lookup()
107 list_for_every_entry(&arp_list, arp, arp_entry_t, node) { in arp_cache_dump()
A Dminip-internal.h127 struct list_node node; member
A Dtcp.c77 struct list_node node; member
226 list_for_every_entry(&tcp_socket_list, s, tcp_socket_t, node) { in lookup_socket()
241 list_for_every_entry(&tcp_socket_list, s, tcp_socket_t, node) { in lookup_socket()
269 list_add_head(&tcp_socket_list, &s->node); in add_socket_to_list()
280 DEBUG_ASSERT(list_in_list(&s->node)); in remove_socket_from_list()
281 list_delete(&s->node); in remove_socket_from_list()
1295 list_for_every_entry(&tcp_socket_list, s, tcp_socket_t, node) { in cmd_tcp()
/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 …]
/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()
/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 …]
/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()
/lib/heap/
A Dheap_wrapper.c128 struct list_node *node; in heap_free_delayed_list() local
129 while ((node = list_remove_head(&delayed_free_list))) { in heap_free_delayed_list()
130 list_add_head(&list, node); in heap_free_delayed_list()
134 while ((node = list_remove_head(&list))) { in heap_free_delayed_list()
135 LTRACEF("freeing node %p\n", node); in heap_free_delayed_list()
136 HEAP_FREE(node); in heap_free_delayed_list()
223 struct list_node *node = (struct list_node *)ptr; in heap_delayed_free() local
227 list_add_head(&delayed_free_list, node); in heap_delayed_free()
237 struct list_node *node; in heap_dump() local
238 list_for_every(&delayed_free_list, node) { in heap_dump()
[all …]
/lib/uefi/
A Devents.cpp58 if (event->node.prev != nullptr && event->node.next != nullptr) { in delete_if_in_list()
59 list_delete(&event->node); in delete_if_in_list()
69 list_for_every_entry_safe(&pending_events, ev, tmp_ev, EfiEventImpl, node) { in process_pending_events()
72 list_add_tail(&completed_events, &ev->node); in process_pending_events()
76 list_for_every_entry(&completed_events, ev, EfiEventImpl, node) { in process_pending_events()
173 list_add_tail(&pending_events, &ev->node); in create_event()
A Dvariable_mem.cpp31 struct list_node node; member
46 list_for_every_entry(&variables_in_mem, var, struct EfiVariable, node) { in search_existing_variable()
94 var->node = LIST_INITIAL_CLEARED_VALUE; in efi_set_variable()
99 list_add_tail(&variables_in_mem, &var->node); in efi_set_variable()
119 list_for_every_entry(&variables_in_mem, var, struct EfiVariable, node) { in efi_list_variable()
A Devents.h33 struct list_node node; member
A Dmemory_protocols.cpp238 list_for_every_entry(get_arena_list(), a, pmm_arena_t, node) { in get_physical_memory_map()
249 list_for_every_entry(get_arena_list(), a, pmm_arena_t, node) { in get_physical_memory_map()
/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 …]
/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()
/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 …]
/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 …]
/lib/fs/9p/
A Dv9fs_priv.h54 struct list_node node; member
75 struct list_node node; member
A Ddir.c120 list_add_tail(&v9fs->dirs, &dir->node); in v9fs_open_dir()
298 list_delete(&dir->node); in v9fs_close_dir()
A Dfile.c105 list_add_tail(&v9fs->files, &file->node); in v9fs_open_file()
206 list_add_tail(&v9fs->files, &file->node); in v9fs_create_file()
468 list_delete(&file->node); in v9fs_close_file()
/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()
470 list_clear_node(&dev->node); in bio_initialize_bdev()
540 list_add_tail(&bdevs.list, &dev->node); in bio_register_device()
551 list_delete(&dev->node); in bio_unregister_device()
560 list_for_every_entry(&bdevs.list, entry, bdev_t, node) { in bio_iter_devices()
572 list_for_every_entry(&bdevs.list, entry, bdev_t, node) { in bio_dump_devices()
/lib/fs/fat/
A Ddir.cpp33 struct list_node node; member
345 list_add_tail(&cookies_, &dir_cookie->node); in opendir_priv()
482 DEBUG_ASSERT(list_in_list(&cookie->node)); in closedir_priv()
483 list_delete(&cookie->node); in closedir_priv()
/lib/fs/
A Dfs.c23 struct list_node node; member
70 list_for_every_entry(&mounts, mount, struct fs_mount, node) { in fs_dump_mounts()
87 list_for_every_entry(&mounts, mount, struct fs_mount, node) { in find_mount()
132 list_delete(&mount->node); in put_mount()
195 list_add_head(&mounts, &mount->node); in mount()
/lib/bio/include/lib/
A Dbio.h30 struct list_node node; member

Completed in 52 milliseconds