Lines Matching defs:node
50 // Doubly linked list node.
64 ListNode node; // Node within list of all allocated blocks.
117 static ListNode* list_initialize(ListNode * const node);
122 ListNode * const node, const CleanupListValue cleanup_value,
125 ListNode * const node, const CleanupListValue cleanup_value,
309 // Initialize a list node.
310 static ListNode* list_initialize(ListNode * const node) {
311 node->value = NULL;
312 node->next = node;
313 node->prev = node;
314 node->refcount = 1;
315 return node;
320 * The node referencing the value is allocated from the heap. */
344 // Remove a node from a list.
346 ListNode * const node, const CleanupListValue cleanup_value,
348 assert_true(node);
349 node->prev->next = node->next;
350 node->next->prev = node->prev;
352 cleanup_value(node->value, cleanup_value_data);
354 return node;
358 /* Remove a list node from a list and free the node. */
360 ListNode * const node, const CleanupListValue cleanup_value,
362 assert_true(node);
363 free(list_remove(node, cleanup_value, cleanup_value_data));
391 /* Find a value in the list using the equal_func to compare each node with the
407 // Returns the first node of a list
487 * node's old refcount value if a value is found, 0 otherwise.
488 * This means that a return value of 1 indicates the node was just removed from
1279 block_info->node.value = block_info;
1280 list_add(block_list, &block_info->node);
1326 list_remove(&block_info->node, NULL, NULL);
1345 const ListNode *node;
1350 for (node = check_point->next; node != head; node = node->next) {
1351 const MallocBlockInfo * const block_info = node->value;
1369 const ListNode *node;
1372 node = check_point->next;
1373 assert_true(node);
1375 while (node != head) {
1376 MallocBlockInfo * const block_info = (MallocBlockInfo*)node->value;
1377 node = node->next;
