|
AquilaOS documentation
How it works, and its code
|
A hash table's node: an entry, with its key's hash. More...
#include <hashmap.h>
Data Fields | |
| hash_t | hash |
| void * | entry |
| struct qnode * | qnode |
| void* hashmap_node::entry |
Definition at line 45 of file hashmap.h.
Referenced by bcache_dirty(), bcache_find(), bcache_remove(), hashmap_insert(), hashmap_lookup(), hashmap_replace(), pf_anon(), pf_present(), tcp_lookup(), vcache_find(), vm_anon_copy_arefs(), vm_anon_destroy(), vm_object_page(), vnode_page_in(), vnode_pages_free(), and vnode_pages_update().
| hash_t hashmap_node::hash |
Definition at line 44 of file hashmap.h.
Referenced by bcache_dirty(), bcache_find(), bcache_remove(), hashmap_grow(), hashmap_insert(), hashmap_lookup(), hashmap_node_remove(), hashmap_replace(), vcache_find(), vcache_remove(), vm_anon_copy_arefs(), vm_object_page(), vnode_page_in(), and vnode_pages_update().
| struct qnode* hashmap_node::qnode |
Definition at line 46 of file hashmap.h.
Referenced by hashmap_insert(), and hashmap_node_remove().