TD-34

src/util/inc/tlist.h

@@ -19,6 +19,11 @@
 extern "C" {
 #endif
 
+typedef enum {
+  TD_LIST_FORWARD,
+  TD_LIST_BACKWARD
+} TD_LIST_DIRECTION_T;
+
 typedef struct _list_node {
   struct _list_node *next;
   struct _list_node *prev;
@@ -33,7 +38,8 @@ typedef struct {
 } SList;
 
 typedef struct {
-  SListNode *node;
+  SListNode *         next;
+  TD_LIST_DIRECTION_T direction;
 } SListIter;
 
 #define listHead(l) (l)->head
@@ -53,6 +59,8 @@ SListNode *tdListPopTail(SList *list);
 SListNode *tdListPopNode(SList *list, SListNode *node);
 
 void       tdListNodeGetData(SList *list, SListNode *node, void *target);
+void       tdListInitIter(SList *list, SListIter *pIter, TD_LIST_DIRECTION_T direction);
+SListNode *tdListNext(SListIter *pIter);
 
 #ifdef __cplusplus
 }

src/util/src/tlist.c

@@ -123,3 +123,24 @@ SListNode *tdListPopNode(SList *list, SListNode *node) {
 }
 
 void tdListNodeGetData(SList *list, SListNode *node, void *target) { memcpy(node->data, target, list->eleSize); }
+
+void tdListInitIter(SList *list, SListIter *pIter, TD_LIST_DIRECTION_T direction) {
+  pIter->direction = direction;
+  if (direction == TD_LIST_FORWARD) {
+    pIter->next = list->head;
+  } else {
+    pIter->next = list->tail;
+  }
+}
+
+SListNode *tdListNext(SListIter *pIter) {
+  SListNode *node = pIter->next;
+  if (node == NULL) return NULL;
+  if (pIter->direction == TD_LIST_FORWARD) {
+    pIter->next = node->next;
+  } else {
+    pIter->next = node->prev;
+  }
+
+  return node;
+}