MdePkg: Apply uncrustify changes

[mirror_edk2.git] / MdePkg / Library / BaseLib / LinkedList.c

diff --git a/MdePkg/Library/BaseLib/LinkedList.c b/MdePkg/Library/BaseLib/LinkedList.c
index 5648c18771aaf720cb1e817bec953e0d8b3ecc84..3aa20ef8a1341e3ca55fce6e5cc372a0325035b2 100644 (file)
--- a/MdePkg/Library/BaseLib/LinkedList.c
+++ b/MdePkg/Library/BaseLib/LinkedList.c
@@ -28,7 +28,7 @@
 \r
 **/\r
 #if !defined (MDEPKG_NDEBUG)\r
-  #define ASSERT_VERIFY_NODE_IN_VALID_LIST(FirstEntry, SecondEntry, InList)  \\r
+#define ASSERT_VERIFY_NODE_IN_VALID_LIST(FirstEntry, SecondEntry, InList)  \\r
     do {                                                                     \\r
       if (FeaturePcdGet (PcdVerifyNodeInList)) {                             \\r
         ASSERT (InList == IsNodeInList ((FirstEntry), (SecondEntry)));       \\r
@@ -37,7 +37,7 @@
       }                                                                      \\r
     } while (FALSE)\r
 #else\r
-  #define ASSERT_VERIFY_NODE_IN_VALID_LIST(FirstEntry, SecondEntry, InList)\r
+#define ASSERT_VERIFY_NODE_IN_VALID_LIST(FirstEntry, SecondEntry, InList)\r
 #endif\r
 \r
 /**\r
@@ -119,8 +119,8 @@ InternalBaseLibIsListValid (
 BOOLEAN\r
 EFIAPI\r
 IsNodeInList (\r
-  IN      CONST LIST_ENTRY      *FirstEntry,\r
-  IN      CONST LIST_ENTRY      *SecondEntry\r
+  IN      CONST LIST_ENTRY  *FirstEntry,\r
+  IN      CONST LIST_ENTRY  *SecondEntry\r
   )\r
 {\r
   UINTN             Count;\r
@@ -180,14 +180,14 @@ IsNodeInList (
 LIST_ENTRY *\r
 EFIAPI\r
 InitializeListHead (\r
-  IN OUT  LIST_ENTRY                *ListHead\r
+  IN OUT  LIST_ENTRY  *ListHead\r
   )\r
 \r
 {\r
   ASSERT (ListHead != NULL);\r
 \r
   ListHead->ForwardLink = ListHead;\r
-  ListHead->BackLink = ListHead;\r
+  ListHead->BackLink    = ListHead;\r
   return ListHead;\r
 }\r
 \r
@@ -216,8 +216,8 @@ InitializeListHead (
 LIST_ENTRY *\r
 EFIAPI\r
 InsertHeadList (\r
-  IN OUT  LIST_ENTRY                *ListHead,\r
-  IN OUT  LIST_ENTRY                *Entry\r
+  IN OUT  LIST_ENTRY  *ListHead,\r
+  IN OUT  LIST_ENTRY  *Entry\r
   )\r
 {\r
   //\r
@@ -225,10 +225,10 @@ InsertHeadList (
   //\r
   ASSERT_VERIFY_NODE_IN_VALID_LIST (ListHead, Entry, FALSE);\r
 \r
-  Entry->ForwardLink = ListHead->ForwardLink;\r
-  Entry->BackLink = ListHead;\r
+  Entry->ForwardLink           = ListHead->ForwardLink;\r
+  Entry->BackLink              = ListHead;\r
   Entry->ForwardLink->BackLink = Entry;\r
-  ListHead->ForwardLink = Entry;\r
+  ListHead->ForwardLink        = Entry;\r
   return ListHead;\r
 }\r
 \r
@@ -257,8 +257,8 @@ InsertHeadList (
 LIST_ENTRY *\r
 EFIAPI\r
 InsertTailList (\r
-  IN OUT  LIST_ENTRY                *ListHead,\r
-  IN OUT  LIST_ENTRY                *Entry\r
+  IN OUT  LIST_ENTRY  *ListHead,\r
+  IN OUT  LIST_ENTRY  *Entry\r
   )\r
 {\r
   //\r
@@ -266,10 +266,10 @@ InsertTailList (
   //\r
   ASSERT_VERIFY_NODE_IN_VALID_LIST (ListHead, Entry, FALSE);\r
 \r
-  Entry->ForwardLink = ListHead;\r
-  Entry->BackLink = ListHead->BackLink;\r
+  Entry->ForwardLink           = ListHead;\r
+  Entry->BackLink              = ListHead->BackLink;\r
   Entry->BackLink->ForwardLink = Entry;\r
-  ListHead->BackLink = Entry;\r
+  ListHead->BackLink           = Entry;\r
   return ListHead;\r
 }\r
 \r
@@ -296,7 +296,7 @@ InsertTailList (
 LIST_ENTRY *\r
 EFIAPI\r
 GetFirstNode (\r
-  IN      CONST LIST_ENTRY          *List\r
+  IN      CONST LIST_ENTRY  *List\r
   )\r
 {\r
   //\r
@@ -331,8 +331,8 @@ GetFirstNode (
 LIST_ENTRY *\r
 EFIAPI\r
 GetNextNode (\r
-  IN      CONST LIST_ENTRY          *List,\r
-  IN      CONST LIST_ENTRY          *Node\r
+  IN      CONST LIST_ENTRY  *List,\r
+  IN      CONST LIST_ENTRY  *Node\r
   )\r
 {\r
   //\r
@@ -367,8 +367,8 @@ GetNextNode (
 LIST_ENTRY *\r
 EFIAPI\r
 GetPreviousNode (\r
-  IN      CONST LIST_ENTRY          *List,\r
-  IN      CONST LIST_ENTRY          *Node\r
+  IN      CONST LIST_ENTRY  *List,\r
+  IN      CONST LIST_ENTRY  *Node\r
   )\r
 {\r
   //\r
@@ -401,7 +401,7 @@ GetPreviousNode (
 BOOLEAN\r
 EFIAPI\r
 IsListEmpty (\r
-  IN      CONST LIST_ENTRY          *ListHead\r
+  IN      CONST LIST_ENTRY  *ListHead\r
   )\r
 {\r
   //\r
@@ -441,8 +441,8 @@ IsListEmpty (
 BOOLEAN\r
 EFIAPI\r
 IsNull (\r
-  IN      CONST LIST_ENTRY          *List,\r
-  IN      CONST LIST_ENTRY          *Node\r
+  IN      CONST LIST_ENTRY  *List,\r
+  IN      CONST LIST_ENTRY  *Node\r
   )\r
 {\r
   //\r
@@ -479,8 +479,8 @@ IsNull (
 BOOLEAN\r
 EFIAPI\r
 IsNodeAtEnd (\r
-  IN      CONST LIST_ENTRY          *List,\r
-  IN      CONST LIST_ENTRY          *Node\r
+  IN      CONST LIST_ENTRY  *List,\r
+  IN      CONST LIST_ENTRY  *Node\r
   )\r
 {\r
   //\r
@@ -520,11 +520,11 @@ IsNodeAtEnd (
 LIST_ENTRY *\r
 EFIAPI\r
 SwapListEntries (\r
-  IN OUT  LIST_ENTRY                *FirstEntry,\r
-  IN OUT  LIST_ENTRY                *SecondEntry\r
+  IN OUT  LIST_ENTRY  *FirstEntry,\r
+  IN OUT  LIST_ENTRY  *SecondEntry\r
   )\r
 {\r
-  LIST_ENTRY                    *Ptr;\r
+  LIST_ENTRY  *Ptr;\r
 \r
   if (FirstEntry == SecondEntry) {\r
     return SecondEntry;\r
@@ -588,7 +588,7 @@ SwapListEntries (
 LIST_ENTRY *\r
 EFIAPI\r
 RemoveEntryList (\r
-  IN      CONST LIST_ENTRY          *Entry\r
+  IN      CONST LIST_ENTRY  *Entry\r
   )\r
 {\r
   ASSERT (!IsListEmpty (Entry));\r