fixed license header / copyright date on all files.

[mirror_edk2.git] / ShellPkg / Library / UefiSortLib / UefiSortLib.c

diff --git a/ShellPkg/Library/UefiSortLib/UefiSortLib.c b/ShellPkg/Library/UefiSortLib/UefiSortLib.c
index 2a65f36507d09eee8ec04f6e2309903c28b8e5df..26654a9fcf7d1403f993f6c58873b60255360e23 100644 (file)
--- a/ShellPkg/Library/UefiSortLib/UefiSortLib.c
+++ b/ShellPkg/Library/UefiSortLib/UefiSortLib.c
@@ -1,14 +1,14 @@
 /** @file\r
   Library used for sorting routines.\r
 \r
-Copyright (c) 2009, Intel Corporation<BR>\r
-All rights reserved. This program and the accompanying materials\r
-are licensed and made available under the terms and conditions of the BSD License\r
-which accompanies this distribution.  The full text of the license may be found at\r
-http://opensource.org/licenses/bsd-license.php\r
+  Copyright (c) 2009-2010, Intel Corporation. All rights reserved. <BR>\r
+  This program and the accompanying materials\r
+  are licensed and made available under the terms and conditions of the BSD License\r
+  which accompanies this distribution.  The full text of the license may be found at\r
+  http://opensource.org/licenses/bsd-license.php\r
 \r
-THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
-WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r
+  THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
+  WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r
 \r
 **/\r
 \r
@@ -23,15 +23,15 @@ WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
 #include <Library/BaseMemoryLib.h>\r
 #include <Library/DebugLib.h>\r
 #include <Library/MemoryAllocationLib.h>\r
-#include <Library/SortLib.h> \r
+#include <Library/SortLib.h>\r
 \r
 STATIC EFI_DEVICE_PATH_TO_TEXT_PROTOCOL *mDevicePathToText = NULL;\r
 STATIC EFI_UNICODE_COLLATION_PROTOCOL   *mUnicodeCollation = NULL;\r
 \r
 \r
 /**\r
-  Worker function for QuickSorting.  This function is identical to PerformQuickSort, \r
-  except that is uses the pre-allocated buffer so the in place sorting does not need to \r
+  Worker function for QuickSorting.  This function is identical to PerformQuickSort,\r
+  except that is uses the pre-allocated buffer so the in place sorting does not need to\r
   allocate and free buffers constantly.\r
 \r
   Each element must be equal sized.\r
@@ -47,7 +47,7 @@ STATIC EFI_UNICODE_COLLATION_PROTOCOL   *mUnicodeCollation = NULL;
                                 on return a buffer of sorted elements\r
   @param[in] Count              the number of elements in the buffer to sort\r
   @param[in] ElementSize        Size of an element in bytes\r
-  @param[in] CompareFunction    The function to call to perform the comparison \r
+  @param[in] CompareFunction    The function to call to perform the comparison\r
                                 of any 2 elements\r
   @param[in] Buffer             Buffer of size ElementSize for use in swapping\r
 **/\r
@@ -69,7 +69,7 @@ QuickSortWorker (
   ASSERT(CompareFunction  != NULL);\r
   ASSERT(Buffer  != NULL);\r
 \r
-  if ( Count < 2 \r
+  if ( Count < 2\r
     || ElementSize  < 1\r
     ){\r
     return;\r
@@ -87,7 +87,7 @@ QuickSortWorker (
   // and everything "right" are above it\r
   //\r
   for ( LoopCount = 0\r
-      ; LoopCount < Count -1 \r
+      ; LoopCount < Count -1\r
       ; LoopCount++\r
       ){\r
     //\r
@@ -95,7 +95,7 @@ QuickSortWorker (
     //\r
     if (CompareFunction((VOID*)((UINT8*)BufferToSort+((LoopCount)*ElementSize)),Pivot) <= 0){\r
       //\r
-      // swap \r
+      // swap\r
       //\r
       CopyMem (Buffer, (UINT8*)BufferToSort+(NextSwapLocation*ElementSize), ElementSize);\r
       CopyMem ((UINT8*)BufferToSort+(NextSwapLocation*ElementSize), (UINT8*)BufferToSort+((LoopCount)*ElementSize), ElementSize);\r
@@ -103,7 +103,7 @@ QuickSortWorker (
 \r
       //\r
       // increment NextSwapLocation\r
-      // \r
+      //\r
       NextSwapLocation++;\r
     }\r
   }\r
@@ -115,20 +115,20 @@ QuickSortWorker (
   CopyMem ((UINT8*)BufferToSort+(NextSwapLocation*ElementSize), Buffer, ElementSize);\r
 \r
   //\r
-  // Now recurse on 2 paritial lists.  neither of these will have the 'pivot' element \r
+  // Now recurse on 2 paritial lists.  neither of these will have the 'pivot' element\r
   // IE list is sorted left half, pivot element, sorted right half...\r
   //\r
   QuickSortWorker(\r
-    BufferToSort, \r
-    NextSwapLocation, \r
-    ElementSize, \r
+    BufferToSort,\r
+    NextSwapLocation,\r
+    ElementSize,\r
     CompareFunction,\r
     Buffer);\r
 \r
   QuickSortWorker(\r
     (UINT8 *)BufferToSort + (NextSwapLocation+1) * ElementSize,\r
-    Count - NextSwapLocation - 1, \r
-    ElementSize, \r
+    Count - NextSwapLocation - 1,\r
+    ElementSize,\r
     CompareFunction,\r
     Buffer);\r
 \r
@@ -149,7 +149,7 @@ QuickSortWorker (
                                 on return a buffer of sorted elements\r
   @param[in] Count              the number of elements in the buffer to sort\r
   @param[in] ElementSize        Size of an element in bytes\r
-  @param[in] CompareFunction    The function to call to perform the comparison \r
+  @param[in] CompareFunction    The function to call to perform the comparison\r
                                 of any 2 elements\r
 **/\r
 VOID\r
@@ -188,7 +188,7 @@ PerformQuickSort (
 \r
   @retval 0                     Buffer1 equal to Buffer2\r
   @return < 0                   Buffer1 is less than Buffer2\r
-  @return > 0                   Buffer1 is greater than Buffer2                     \r
+  @return > 0                   Buffer1 is greater than Buffer2\r
 **/\r
 INTN\r
 DevicePathCompare (\r
@@ -202,7 +202,7 @@ DevicePathCompare (
   CHAR16                    *TextPath2;\r
   EFI_STATUS                Status;\r
   INTN                      RetVal;\r
-   \r
+\r
   DevicePath1 = *(EFI_DEVICE_PATH_PROTOCOL**)Buffer1;\r
   DevicePath2 = *(EFI_DEVICE_PATH_PROTOCOL**)Buffer2;\r
 \r
@@ -217,7 +217,7 @@ DevicePathCompare (
   if (DevicePath2 == NULL) {\r
     return 1;\r
   }\r
-  \r
+\r
   if (mDevicePathToText == NULL) {\r
     Status = gBS->LocateProtocol(\r
       &gEfiDevicePathToTextProtocolGuid,\r
@@ -245,7 +245,7 @@ DevicePathCompare (
     DevicePath2,\r
     FALSE,\r
     FALSE);\r
-  \r
+\r
   RetVal = mUnicodeCollation->StriColl(\r
     mUnicodeCollation,\r
     TextPath1,\r
@@ -265,7 +265,7 @@ DevicePathCompare (
 \r
   @retval 0                     Buffer1 equal to Buffer2.\r
   @return < 0                   Buffer1 is less than Buffer2.\r
-  @return > 0                   Buffer1 is greater than Buffer2.                 \r
+  @return > 0                   Buffer1 is greater than Buffer2.\r
 **/\r
 INTN\r
 EFIAPI\r