ListDeinit

Documentation

API Reference

ListDeinit

Description

Release a list’s nodes and zero its handle. Calls any configured copy_deinit hook on each live element before freeing storage.

Parameters

Name	Direction	Description
`l`	in,out	Pointer to a `List(T)` handle.

Success

Returns to the caller. The handle is zeroed; all node storage reclaimed through the configured allocator.

Failure

ValidateList aborts via LOG_FATAL when l is NULL or uninitialised.

Usage example (Cross-references)

Usage examples (Cross-references)

In ListInt.c:24:

    
    void deinit_int_list(IntList *list) {
        ListDeinit(list);
    }

In ListInt.c:212:

    
                ListMergeR(list, &temp);
                ListDeinit(&temp); // Clean up temp to prevent memory leak
                break;
            }

In List.Insert.c:112:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {60, 80, 40, 10, 30, 20, 50, 90, 70}, 9);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Insert.c:131:

        result      = result && (arr[0] == 0) && (arr[1] == 0) && (arr[2] == 0);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Insert.c:151:

        result      = result && (arr[0] == 4) && (arr[1] == 5) && (arr[2] == 6);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Insert.c:176:

        result      = result && list_matches(GENERIC_LIST(&list), (const int[]) {1007, 1007, 1008, 1009}, 4);
    
        ListDeinit(&list);
        result = result && (g_copy_deinit_count == 4);
        DefaultAllocatorDeinit(&alloc);

In List.Insert.c:205:

        result = result && list_matches(GENERIC_LIST(&src), (const int[]) {1005}, 1);
    
        ListDeinit(&dest);
        ListDeinit(&src);
        result = result && (g_copy_deinit_count == 1);

In List.Insert.c:206:

    
        ListDeinit(&dest);
        ListDeinit(&src);
        result = result && (g_copy_deinit_count == 1);
        DefaultAllocatorDeinit(&alloc);

In List.Insert.c:248:

        result      = result && (ListLen(&src_a) == 0) && (ListHead(&src_a) == NULL) && (ListTail(&src_a) == NULL);
    
        ListDeinit(&dest_l);
        ListDeinit(&src_l);
        ListDeinit(&dest_r);

In List.Insert.c:249:

    
        ListDeinit(&dest_l);
        ListDeinit(&src_l);
        ListDeinit(&dest_r);
        ListDeinit(&src_r);

In List.Insert.c:250:

        ListDeinit(&dest_l);
        ListDeinit(&src_l);
        ListDeinit(&dest_r);
        ListDeinit(&src_r);
        ListDeinit(&dest_a);

In List.Insert.c:251:

        ListDeinit(&src_l);
        ListDeinit(&dest_r);
        ListDeinit(&src_r);
        ListDeinit(&dest_a);
        ListDeinit(&src_a);

In List.Insert.c:252:

        ListDeinit(&dest_r);
        ListDeinit(&src_r);
        ListDeinit(&dest_a);
        ListDeinit(&src_a);
        DefaultAllocatorDeinit(&alloc);

In List.Insert.c:253:

        ListDeinit(&src_r);
        ListDeinit(&dest_a);
        ListDeinit(&src_a);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Insert.c:281:

        result      = result && (ListLen(&empty_dest) == 0) && (ListLen(&empty_src) == 0);
    
        ListDeinit(&deep_dest);
        ListDeinit(&shallow_src);
        ListDeinit(&empty_dest);

In List.Insert.c:282:

    
        ListDeinit(&deep_dest);
        ListDeinit(&shallow_src);
        ListDeinit(&empty_dest);
        ListDeinit(&empty_src);

In List.Insert.c:283:

        ListDeinit(&deep_dest);
        ListDeinit(&shallow_src);
        ListDeinit(&empty_dest);
        ListDeinit(&empty_src);
        result = result && (g_copy_deinit_count == 2);

In List.Insert.c:284:

        ListDeinit(&shallow_src);
        ListDeinit(&empty_dest);
        ListDeinit(&empty_src);
        result = result && (g_copy_deinit_count == 2);
        DefaultAllocatorDeinit(&alloc);

In List.Insert.c:310:

        result      = result && (ListAt(&list, 2) == 9);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Insert.c:352:

    
        s_copy_fail_at = UINT64_MAX;
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:72:

        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 30);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:106:

        result = result && (ListLen(&list) == 0) && (ListHead(&list) == NULL) && (ListTail(&list) == NULL);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:138:

        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 4);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:160:

        result      = result && (ListLen(&list) == 0) && (ListHead(&list) == NULL) && (ListTail(&list) == NULL);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:199:

        result = result && (ListLen(&list) == 0) && (ListHead(&list) == NULL) && (ListTail(&list) == NULL);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Remove.c:225:

        result      = result && list_matches(GENERIC_LIST(&list), (const int[]) {4}, 1);
    
        ListDeinit(&list);
        result = result && (g_copy_deinit_count == 1);
        DefaultAllocatorDeinit(&alloc);

In List.Blind.c:62:

        bool result = got && (node_value(got) == 80);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Blind.c:107:

        bool result = true;
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Blind.c:134:

        // Unreachable on real code (LOG_FATAL longjmps out). If the mutant
        // swallows the guard we fall through here; clean up and return.
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return true;

In List.Init.c:49:

        result = result && (ListCopyInit(&list_d) == tracked_copy_init) && (ListCopyDeinit(&list_d) == tracked_copy_deinit);
    
        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);

In List.Init.c:50:

    
        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);

In List.Init.c:51:

        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);
        DefaultAllocatorDeinit(&alloc);

In List.Init.c:52:

        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Init.c:81:

        result = result && (ListCopyInit(&list_c) == tracked_copy_init) && (ListCopyDeinit(&list_d) == tracked_copy_deinit);
    
        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);

In List.Init.c:82:

    
        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);

In List.Init.c:83:

        ListDeinit(&list_a);
        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);
        DefaultAllocatorDeinit(&alloc);

In List.Init.c:84:

        ListDeinit(&list_b);
        ListDeinit(&list_c);
        ListDeinit(&list_d);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Init.c:90:

    
    static bool test_list_deinit_with_deep_copy(void) {
        WriteFmt("Testing ListDeinit with deep copy\n");
    
        DefaultAllocator alloc = DefaultAllocatorInit();

In List.Init.c:105:

        result      = result && (ListAt(&list, 1) == 1009);
    
        ListDeinit(&list);
    
        result = result && (g_copy_deinit_count == 2);

In List.Type.c:23:

                      (ListCopyDeinit(&list) == NULL) && (ListLen(&list) == 0) && MAGIC_MATCHES(list.__magic, LIST_MAGIC);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Ops.c:106:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {9}, 1);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Ops.c:131:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {4, 3, 2, 2, 1}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Ops.c:154:

        result      = result && list_matches(GENERIC_LIST(&singleton), (const int[]) {42}, 1);
    
        ListDeinit(&empty);
        ListDeinit(&singleton);
        DefaultAllocatorDeinit(&alloc);

In List.Ops.c:155:

    
        ListDeinit(&empty);
        ListDeinit(&singleton);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Ops.c:182:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {9}, 1);
    
        ListDeinit(&list);
        result = result && (g_copy_deinit_count == 3);
        DefaultAllocatorDeinit(&alloc);

In List.Ops.c:207:

        result      = result && (ListAt(&list, 1) == 2);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Ops.c:255:

    
        s_copy_fail_at = UINT64_MAX;
        ListDeinit(&dst);
        ListDeinit(&src);
        DefaultAllocatorDeinit(&alloc);

In List.Ops.c:256:

        s_copy_fail_at = UINT64_MAX;
        ListDeinit(&dst);
        ListDeinit(&src);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:66:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 20, 30, 40, 50}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:103:

        result      = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 20, 30, 40, 50}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:152:

        result      = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 20, 30, 40, 50}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:196:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 20, 30, 40, 50}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:256:

        result      = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 20, 30, 40, 50}, 5);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Foreach.c:334:

        }
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return count == 0;

In List.Access.c:85:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {30}, 1);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:115:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {10, 40, 30, 20}, 4);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:159:

        result = result && (ListNodePrev(null_node) == NULL);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:187:

        result = result && (ListFind(&list, &missing, compare_ints) == SIZE_MAX);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:244:

        bool result = (jumped_idx == 95) && (jumped_value == 95);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:267:

        bool result = got && (node_value(got) == 50);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:289:

        bool result = got && (node_value(got) == 30);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:309:

        bool result = got && (node_value(got) == 50);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:331:

        bool result = got && got->data && (*(int *)got->data == 30);
    
        ListDeinit(&list);
        return result;
    }

In List.Access.c:352:

        bool result = got && got->data && (*(int *)got->data == 40);
    
        ListDeinit(&list);
        return result;
    }

In List.Access.c:373:

        }
    
        ListDeinit(&list);
        return result;
    }

In List.Access.c:401:

        bool             result = node && node->data && (*(int *)node->data == 30);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:428:

        bool             result = node && node->data && (*(int *)node->data == 40);
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In List.Access.c:462:

        result = result && (head_via_back == GENERIC_LIST_NODE(ListNodeBegin(&list)));
    
        ListDeinit(&list);
        DefaultAllocatorDeinit(&alloc);
        return result;

In BitVec.Foreach.Deadend.c:151:

            (void)i;
        }
        ListDeinit(&li);
        DefaultAllocatorDeinit(&alloc);

Last updated on June 28, 2026

ListCopyInit ListDelete