Lines Matching defs:node

38     struct UTILS_DL_LIST *pstPrev; /* < Current node's pointer to the previous node */

39 struct UTILS_DL_LIST *pstNext; /* < Current node's pointer to the next node */
67 * @brief Point to the next node pointed to by the current node.
71 * <li>This API is used to point to the next node pointed to by the current node.</li>
93 * <li>This API is used to test node is the end of the list.</li>
107 #define UTILS_DL_LIST_IS_END(list, node) ((list) == (node) ? TRUE : FALSE)
115 * <li>This API is used to test node is on the list.</li>
129 #define UTILS_DL_LIST_IS_ON_QUEUE(node) ((node)->pstPrev != NULL && (node)->pstNext != NULL)
133 * @brief Point to the previous node pointed to by the current node.
137 * <li>This API is used to point to the previous node pointed to by the current node.</li>
155 * @brief Insert a new node to a doubly linked list.
158 * This API is used to insert a new node to a doubly linked list.
164 * @param list [IN] Doubly linked list where the new node is inserted.
165 * @param node [IN] New node to be inserted.
172 static inline void UtilsListAdd(UTILS_DL_LIST *list, UTILS_DL_LIST *node)
174 node->pstNext = list->pstNext;
175 node->pstPrev = list;
176 list->pstNext->pstPrev = node;
177 list->pstNext = node;
182 * @brief Insert a node to the tail of a doubly linked list.
185 * This API is used to insert a new node to the tail of a doubly linked list.
191 * @param list [IN] Doubly linked list where the new node is inserted.
192 * @param node [IN] New node to be inserted.
199 static inline void UtilsListTailInsert(UTILS_DL_LIST *list, UTILS_DL_LIST *node)
201 UtilsListAdd(list->pstPrev, node);
206 * @brief Insert a node to the head of a doubly linked list.
209 * This API is used to insert a new node to the head of a doubly linked list.
215 * @param list [IN] Doubly linked list where the new node is inserted.
216 * @param node [IN] New node to be inserted.
223 static inline void UtilsListHeadInsert(UTILS_DL_LIST *list, UTILS_DL_LIST *node)
225 UtilsListAdd(list, node);
233 * <li>This API is used to delete a specified node from a doubly linked list.</li>
240 * @param node [IN] Node to be deleted.
247 static inline void UtilsListDelete(UTILS_DL_LIST *node)
249 node->pstNext->pstPrev = node->pstPrev;
250 node->pstPrev->pstNext = node->pstNext;
251 node->pstNext = NULL;
252 node->pstPrev = NULL;
419 * @param item [IN] Current node's pointer to the next node.
469 * @param next [IN] Save the next node.
546 * @param next [IN] Save the next node.