Lines Matching refs:element
51 * A hash table element
105 DAPL_HASH_ELEM *element = \
107 if (NO_DATUM(element->datum)) { \
109 } else if (element->key == (DAPL_HASH_KEY) (in_key)) { \
110 (out_datum) = element->datum; \
111 (bucket_head) = (void *)element; \
112 } else if (element->next_element) { \
113 dapli_hash_rehash(element, \
132 * Inputs: element element to rehash key
138 DAPL_HASH_ELEM *element,
144 * assume we looked at the contents of element already,
145 * and start with the next element.
147 dapl_os_assert(element->next_element);
148 dapl_os_assert(!NO_DATUM(element->datum));
150 *head = element;
153 element = element->next_element;
154 if (!element) {
157 if (element->key == key) {
158 *datum = element->datum;
237 * Add an element to the end of the chain
279 * Remove element from hash bucket
282 * element, key to be deleted
287 dapl_hash_delete_element(DAPL_HASH_ELEM * element,
295 for (curelement = element; curelement;
317 * If there is a next element, copy its
319 * original next element.
536 * Iterates through the entire hash table return one element at a time.
583 /* iterator points to the element to be returned */
596 /* re-position iterator to point to the next valid element */
597 if (curr->next_element != NULL) { /* found the next element */