Merge branch 'omap-pool'

[linux-2.6-omap-h63xx.git] / drivers / staging / rt3070 / link_list.h

diff --git a/drivers/staging/rt3070/link_list.h b/drivers/staging/rt3070/link_list.h
new file mode 100644 (file)
index 0000000..f652113
--- /dev/null
+++ b/drivers/staging/rt3070/link_list.h
@@ -0,0 +1,134 @@
+/*
+ *************************************************************************
+ * Ralink Tech Inc.
+ * 5F., No.36, Taiyuan St., Jhubei City,
+ * Hsinchu County 302,
+ * Taiwan, R.O.C.
+ *
+ * (c) Copyright 2002-2007, Ralink Technology, Inc.
+ *
+ * This program is free software; you can redistribute it and/or modify  *
+ * it under the terms of the GNU General Public License as published by  *
+ * the Free Software Foundation; either version 2 of the License, or     *
+ * (at your option) any later version.                                   *
+ *                                                                       *
+ * This program is distributed in the hope that it will be useful,       *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of        *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
+ * GNU General Public License for more details.                          *
+ *                                                                       *
+ * You should have received a copy of the GNU General Public License     *
+ * along with this program; if not, write to the                         *
+ * Free Software Foundation, Inc.,                                       *
+ * 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
+ *                                                                       *
+ *************************************************************************
+ */
+
+#ifndef __LINK_LIST_H__
+#define __LINK_LIST_H__
+
+typedef struct _LIST_ENTRY
+{
+       struct _LIST_ENTRY *pNext;
+} LIST_ENTRY, *PLIST_ENTRY;
+
+typedef struct _LIST_HEADR
+{
+       PLIST_ENTRY pHead;
+       PLIST_ENTRY pTail;
+       UCHAR size;
+} LIST_HEADER, *PLIST_HEADER;
+
+static inline VOID initList(
+       IN PLIST_HEADER pList)
+{
+       pList->pHead = pList->pTail = NULL;
+       pList->size = 0;
+       return;
+}
+
+static inline VOID insertTailList(
+       IN PLIST_HEADER pList,
+       IN PLIST_ENTRY pEntry)
+{
+       pEntry->pNext = NULL;
+       if (pList->pTail)
+               pList->pTail->pNext = pEntry;
+       else
+               pList->pHead = pEntry;
+       pList->pTail = pEntry;
+       pList->size++;
+
+       return;
+}
+
+static inline PLIST_ENTRY removeHeadList(
+       IN PLIST_HEADER pList)
+{
+       PLIST_ENTRY pNext;
+       PLIST_ENTRY pEntry;
+
+       pEntry = pList->pHead;
+       if (pList->pHead != NULL)
+       {
+               pNext = pList->pHead->pNext;
+               pList->pHead = pNext;
+               if (pNext == NULL)
+                       pList->pTail = NULL;
+               pList->size--;
+       }
+       return pEntry;
+}
+
+static inline int getListSize(
+       IN PLIST_HEADER pList)
+{
+       return pList->size;
+}
+
+static inline PLIST_ENTRY delEntryList(
+       IN PLIST_HEADER pList,
+       IN PLIST_ENTRY pEntry)
+{
+       PLIST_ENTRY pCurEntry;
+       PLIST_ENTRY pPrvEntry;
+
+       if(pList->pHead == NULL)
+               return NULL;
+
+       if(pEntry == pList->pHead)
+       {
+               pCurEntry = pList->pHead;
+               pList->pHead = pCurEntry->pNext;
+
+               if(pList->pHead == NULL)
+                       pList->pTail = NULL;
+
+               pList->size--;
+               return pCurEntry;
+       }
+
+       pPrvEntry = pList->pHead;
+       pCurEntry = pPrvEntry->pNext;
+       while(pCurEntry != NULL)
+       {
+               if (pEntry == pCurEntry)
+               {
+                       pPrvEntry->pNext = pCurEntry->pNext;
+
+                       if(pEntry == pList->pTail)
+                               pList->pTail = pPrvEntry;
+
+                       pList->size--;
+                       break;
+               }
+               pPrvEntry = pCurEntry;
+               pCurEntry = pPrvEntry->pNext;
+       }
+
+       return pCurEntry;
+}
+
+#endif // ___LINK_LIST_H__ //
+