GENERIC_LIST_NODE

    /// TAGS: List, Node, Access
    ///
    #define ListNodeRelative(base_node, ridx) get_node_relative_to_list_node(GENERIC_LIST_NODE(base_node), (i64)(ridx))
    
    #endif // MISRA_STD_CONTAINER_LIST_ACCESS_H

        ListPushBackR(&list, 40);
    
        GenericListNode *node1   = GENERIC_LIST_NODE(ListNodePtrAt(&list, 1));
        GenericListNode *begin   = GENERIC_LIST_NODE(ListNodeBegin(&list));
        GenericListNode *end     = GENERIC_LIST_NODE(ListNodeEnd(&list));

    
        GenericListNode *node1   = GENERIC_LIST_NODE(ListNodePtrAt(&list, 1));
        GenericListNode *begin   = GENERIC_LIST_NODE(ListNodeBegin(&list));
        GenericListNode *end     = GENERIC_LIST_NODE(ListNodeEnd(&list));
        GenericListNode *same    = ListNodeRelative(ListNodeBegin(&list), 0);

        GenericListNode *node1   = GENERIC_LIST_NODE(ListNodePtrAt(&list, 1));
        GenericListNode *begin   = GENERIC_LIST_NODE(ListNodeBegin(&list));
        GenericListNode *end     = GENERIC_LIST_NODE(ListNodeEnd(&list));
        GenericListNode *same    = ListNodeRelative(ListNodeBegin(&list), 0);
        GenericListNode *rel_f2  = ListNodeRelative(ListNodeBegin(&list), 2);

    
        // Cross-check: the same node reached forward from head index 0.
        result = result && (head_via_back == GENERIC_LIST_NODE(ListNodeBegin(&list)));
    
        ListDeinit(&list);