ListNodeData

Documentation

API Reference

ListNodeData

Description

Payload pointer carried by a list node. Bare field read; the caller owns the null-check decision (use ListNodeNext / ListNodePrev chasing if NULL-tolerant traversal is wanted).

Parameters

Name	Direction	Description
`node`	in	List node to query.

Usage example (Cross-references)

Usage examples (Cross-references)

In List.Access.c:110:

        ListNode(int) *null_node = NULL;
    
        bool result = node1 && ListNodeData(node1) && (*(int *)ListNodeData(node1) == 20);
        result      = result && begin && ListNodeData(begin) && (*(int *)ListNodeData(begin) == 10);
        result      = result && end && ListNodeData(end) && (*(int *)ListNodeData(end) == 40);

In List.Access.c:111:

    
        bool result = node1 && ListNodeData(node1) && (*(int *)ListNodeData(node1) == 20);
        result      = result && begin && ListNodeData(begin) && (*(int *)ListNodeData(begin) == 10);
        result      = result && end && ListNodeData(end) && (*(int *)ListNodeData(end) == 40);
        result      = result && ListNodeData(&ListNodeAt(&list, 2)) && (*ListNodeData(&ListNodeAt(&list, 2)) == 30);

In List.Access.c:112:

        bool result = node1 && ListNodeData(node1) && (*(int *)ListNodeData(node1) == 20);
        result      = result && begin && ListNodeData(begin) && (*(int *)ListNodeData(begin) == 10);
        result      = result && end && ListNodeData(end) && (*(int *)ListNodeData(end) == 40);
        result      = result && ListNodeData(&ListNodeAt(&list, 2)) && (*ListNodeData(&ListNodeAt(&list, 2)) == 30);
        result      = result && ListNodeData(&ListNodeFirst(&list)) && (*ListNodeData(&ListNodeFirst(&list)) == 10);

In List.Access.c:113:

        result      = result && begin && ListNodeData(begin) && (*(int *)ListNodeData(begin) == 10);
        result      = result && end && ListNodeData(end) && (*(int *)ListNodeData(end) == 40);
        result      = result && ListNodeData(&ListNodeAt(&list, 2)) && (*ListNodeData(&ListNodeAt(&list, 2)) == 30);
        result      = result && ListNodeData(&ListNodeFirst(&list)) && (*ListNodeData(&ListNodeFirst(&list)) == 10);
        result      = result && ListNodeData(&ListNodeLast(&list)) && (*ListNodeData(&ListNodeLast(&list)) == 40);

In List.Access.c:114:

        result      = result && end && ListNodeData(end) && (*(int *)ListNodeData(end) == 40);
        result      = result && ListNodeData(&ListNodeAt(&list, 2)) && (*ListNodeData(&ListNodeAt(&list, 2)) == 30);
        result      = result && ListNodeData(&ListNodeFirst(&list)) && (*ListNodeData(&ListNodeFirst(&list)) == 10);
        result      = result && ListNodeData(&ListNodeLast(&list)) && (*ListNodeData(&ListNodeLast(&list)) == 40);
        result      = result && ListNodeNext(ListNodeBegin(&list)) && ListNodeData(ListNodeNext(ListNodeBegin(&list))) &&

In List.Access.c:115:

        result      = result && ListNodeData(&ListNodeAt(&list, 2)) && (*ListNodeData(&ListNodeAt(&list, 2)) == 30);
        result      = result && ListNodeData(&ListNodeFirst(&list)) && (*ListNodeData(&ListNodeFirst(&list)) == 10);
        result      = result && ListNodeData(&ListNodeLast(&list)) && (*ListNodeData(&ListNodeLast(&list)) == 40);
        result      = result && ListNodeNext(ListNodeBegin(&list)) && ListNodeData(ListNodeNext(ListNodeBegin(&list))) &&
                 (*ListNodeData(ListNodeNext(ListNodeBegin(&list))) == 20);

In List.Access.c:116:

        result      = result && ListNodeData(&ListNodeFirst(&list)) && (*ListNodeData(&ListNodeFirst(&list)) == 10);
        result      = result && ListNodeData(&ListNodeLast(&list)) && (*ListNodeData(&ListNodeLast(&list)) == 40);
        result      = result && ListNodeNext(ListNodeBegin(&list)) && ListNodeData(ListNodeNext(ListNodeBegin(&list))) &&
                 (*ListNodeData(ListNodeNext(ListNodeBegin(&list))) == 20);
        result = result && ListNodePrev(ListNodeEnd(&list)) && ListNodeData(ListNodePrev(ListNodeEnd(&list))) &&

In List.Access.c:117:

        result      = result && ListNodeData(&ListNodeLast(&list)) && (*ListNodeData(&ListNodeLast(&list)) == 40);
        result      = result && ListNodeNext(ListNodeBegin(&list)) && ListNodeData(ListNodeNext(ListNodeBegin(&list))) &&
                 (*ListNodeData(ListNodeNext(ListNodeBegin(&list))) == 20);
        result = result && ListNodePrev(ListNodeEnd(&list)) && ListNodeData(ListNodePrev(ListNodeEnd(&list))) &&
                 (*ListNodeData(ListNodePrev(ListNodeEnd(&list))) == 30);

In List.Access.c:118:

        result      = result && ListNodeNext(ListNodeBegin(&list)) && ListNodeData(ListNodeNext(ListNodeBegin(&list))) &&
                 (*ListNodeData(ListNodeNext(ListNodeBegin(&list))) == 20);
        result = result && ListNodePrev(ListNodeEnd(&list)) && ListNodeData(ListNodePrev(ListNodeEnd(&list))) &&
                 (*ListNodeData(ListNodePrev(ListNodeEnd(&list))) == 30);
        result = result && (same == begin);

In List.Access.c:119:

                 (*ListNodeData(ListNodeNext(ListNodeBegin(&list))) == 20);
        result = result && ListNodePrev(ListNodeEnd(&list)) && ListNodeData(ListNodePrev(ListNodeEnd(&list))) &&
                 (*ListNodeData(ListNodePrev(ListNodeEnd(&list))) == 30);
        result = result && (same == begin);
        result = result && rel_f2 && ListNodeData(rel_f2) && (*(int *)ListNodeData(rel_f2) == 30);

In List.Access.c:121:

                 (*ListNodeData(ListNodePrev(ListNodeEnd(&list))) == 30);
        result = result && (same == begin);
        result = result && rel_f2 && ListNodeData(rel_f2) && (*(int *)ListNodeData(rel_f2) == 30);
        result = result && rel_b2 && ListNodeData(rel_b2) && (*(int *)ListNodeData(rel_b2) == 20);
        result = result && (ListNodeRelative(ListNodeBegin(&list), -1) == NULL);

In List.Access.c:122:

        result = result && (same == begin);
        result = result && rel_f2 && ListNodeData(rel_f2) && (*(int *)ListNodeData(rel_f2) == 30);
        result = result && rel_b2 && ListNodeData(rel_b2) && (*(int *)ListNodeData(rel_b2) == 20);
        result = result && (ListNodeRelative(ListNodeBegin(&list), -1) == NULL);
        result = result && (ListNodeRelative(ListNodeEnd(&list), 1) == NULL);

In List.Remove.c:69:

        result = result && (removed == 40);
        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {30}, 1);
        result = result && ListHead(&list) && ListNodeData(ListHead(&list)) && (*ListNodeData(ListHead(&list)) == 30);
        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 30);

In List.Remove.c:70:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {30}, 1);
        result = result && ListHead(&list) && ListNodeData(ListHead(&list)) && (*ListNodeData(ListHead(&list)) == 30);
        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 30);
    
        ListDeinit(&list);

In List.Remove.c:135:

        result = result && (suffix[0] == 5) && (suffix[1] == 6);
        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {3, 4}, 2);
        result = result && ListHead(&list) && ListNodeData(ListHead(&list)) && (*ListNodeData(ListHead(&list)) == 3);
        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 4);

In List.Remove.c:136:

        result = result && list_matches(GENERIC_LIST(&list), (const int[]) {3, 4}, 2);
        result = result && ListHead(&list) && ListNodeData(ListHead(&list)) && (*ListNodeData(ListHead(&list)) == 3);
        result = result && ListTail(&list) && ListNodeData(ListTail(&list)) && (*ListNodeData(ListTail(&list)) == 4);
    
        ListDeinit(&list);

Last updated on May 27, 2026

ListNodeBegin ListNodeEnd