Lines Matching refs:cur_node
173 DAT_DICTIONARY_NODE *cur_node;
178 cur_node = p_dictionary->head;
179 p_dictionary->head = cur_node->next;
181 dat_os_free(cur_node, sizeof (DAT_DICTIONARY_NODE));
262 DAT_DICTIONARY_NODE *cur_node, *prev_node, *next_node;
267 cur_node = entry;
274 dat_status = dat_dictionary_key_dup(key, &cur_node->key);
283 cur_node->data = data;
284 cur_node->next = next_node;
285 cur_node->prev = prev_node;
287 prev_node->next = cur_node;
288 next_node->prev = cur_node;
307 DAT_DICTIONARY_NODE *cur_node;
314 for (cur_node = p_dictionary->head->next;
315 p_dictionary->tail != cur_node;
316 cur_node = cur_node->next) {
317 if (DAT_TRUE == dat_dictionary_key_is_equal(&cur_node->key,
320 *p_data = cur_node->data;
343 DAT_DICTIONARY_NODE *cur_node;
357 for (cur_node = p_dictionary->head->next, i = 0;
358 p_dictionary->tail != cur_node;
359 cur_node = cur_node->next, i++) {
360 array[i] = cur_node->data;
379 DAT_DICTIONARY_NODE *cur_node, *prev_node, *next_node;
387 for (cur_node = p_dictionary->head->next;
388 p_dictionary->tail != cur_node;
389 cur_node = cur_node->next) {
390 if (DAT_TRUE == dat_dictionary_key_is_equal(&cur_node->key,
393 *p_data = cur_node->data;
396 prev_node = cur_node->prev;
397 next_node = cur_node->next;
402 *p_entry = cur_node;