Lines Matching full:node
25 /** the type of index (node number), list are implemented through index */
27 /** the type store node number */
32 /* there is (bucket factor * nr node) entry in hash table, this can seem
41 /** a db hash node */
49 * properly the data base, following this header is the node array then
50 * the hash table (when growing we avoid to copy node array)
53 odb_node_nr_t size; /**< in node nr (power of two) */
54 odb_node_nr_t current_size; /**< nr used node + 1, node 0 unused */
71 * the node array: (descr->size * sizeof(odb_node_t) entries
72 * the hash table: array of odb_index_t indexing the node array
81 unsigned int offset_node; /**< from base_memory to node array */
140 * node. Take care all node pointer can be invalidated by this call.
142 * Node allocation is done in a two step way 1st) ensure a free node exist
143 * eventually, caller can setup it, 2nd) commit the node allocation with
145 * This is done in this way to ensure node setup is visible from another
154 * commit a previously successfull node reservation. This can't fail.
161 /** "immpossible" node number to indicate an error from odb_hash_add_node() */
176 * if the key does not exist a new node is created and the value associated
190 * if the key does not exist a new node is created and the value associated
199 /** Add a new node w/o regarding if a node with the same key already exists
207 * return a base pointer to the node array and number of node in this array
211 * odb_node_t * node = odb_get_iterator(odb, &node_nr);
