Lines Matching refs:node
34 * └------prev-| node |<-prev-| node |<-prev-| node |<-prev----|
42 * ListNode node;
59 * static int TestListItemCompareProc(ListNode *node, ListNode *newNode)
61 * TEST_LIST_ITEM *left = (TEST_LIST_ITEM *)node;
69 * @brief Double linked list node
76 #define ListEmpty(node) ((node).next == &(node) && (node).prev == &(node))
78 #define ForEachListEntry(list, node) for (node = (list)->next; node != (list); node = node->next)
91 * @brief Add a node to the end of the list
94 * @param item new node to be added
100 * @brief Remove a node from the list
102 * @param item the node to be removed from the list.
111 * @param node ListNode to be compared.
114 * <0 if node < newNode
115 * =0 if node = newNode
118 typedef int (*ListCompareProc)(ListNode *node, ListNode *newNode);
121 * @brief Add a node to the list with order
124 * @param item new node to be added
125 * @param compareProc comparison function for adding node
136 * @param node ListNode to be compared.
139 * return 0 if node value equals data for OH_ListFind
141 typedef int (*ListTraversalProc)(ListNode *node, void *data);
144 * @brief Find a node by traversing the list
149 * @return the found node; return NULL if none is found.
165 * TRAVERSE_REVERSE_ORDER: traversing from last node to first node;
166 * default behaviour is from first node to last node
177 * @param node ListNode to be destroyed.
180 typedef void (*ListDestroyProc)(ListNode *node);
183 * @brief Find a node by traversing the list
186 * @param destroyProc destroy function; if NULL, it will free each node by default.