2 Library used for sorting routines.
4 Copyright (c) 2009 - 2014, Intel Corporation. All rights reserved. <BR>
5 This program and the accompanying materials
6 are licensed and made available under the terms and conditions of the BSD License
7 which accompanies this distribution. The full text of the license may be found at
8 http://opensource.org/licenses/bsd-license.php
10 THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
11 WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
16 #include <Library/BaseLib.h>
17 #include <Library/BaseMemoryLib.h>
18 #include <Library/DebugLib.h>
19 #include <Library/MemoryAllocationLib.h>
20 #include <Library/SortLib.h>
23 Worker function for QuickSorting. This function is identical to PerformQuickSort,
24 except that is uses the pre-allocated buffer so the in place sorting does not need to
25 allocate and free buffers constantly.
27 Each element must be equal sized.
29 if BufferToSort is NULL, then ASSERT.
30 if CompareFunction is NULL, then ASSERT.
31 if Buffer is NULL, then ASSERT.
33 if Count is < 2 then perform no action.
34 if Size is < 1 then perform no action.
36 @param[in, out] BufferToSort on call a Buffer of (possibly sorted) elements
37 on return a buffer of sorted elements
38 @param[in] Count the number of elements in the buffer to sort
39 @param[in] ElementSize Size of an element in bytes
40 @param[in] CompareFunction The function to call to perform the comparison
42 @param[in] Buffer Buffer of size ElementSize for use in swapping
47 IN OUT VOID
*BufferToSort
,
49 IN CONST UINTN ElementSize
,
50 IN SORT_COMPARE CompareFunction
,
56 UINTN NextSwapLocation
;
58 ASSERT(BufferToSort
!= NULL
);
59 ASSERT(CompareFunction
!= NULL
);
60 ASSERT(Buffer
!= NULL
);
71 // pick a pivot (we choose last element)
73 Pivot
= ((UINT8
*)BufferToSort
+((Count
-1)*ElementSize
));
76 // Now get the pivot such that all on "left" are below it
77 // and everything "right" are above it
80 ; LoopCount
< Count
-1
84 // if the element is less than the pivot
86 if (CompareFunction((VOID
*)((UINT8
*)BufferToSort
+((LoopCount
)*ElementSize
)),Pivot
) <= 0){
90 CopyMem (Buffer
, (UINT8
*)BufferToSort
+(NextSwapLocation
*ElementSize
), ElementSize
);
91 CopyMem ((UINT8
*)BufferToSort
+(NextSwapLocation
*ElementSize
), (UINT8
*)BufferToSort
+((LoopCount
)*ElementSize
), ElementSize
);
92 CopyMem ((UINT8
*)BufferToSort
+((LoopCount
)*ElementSize
), Buffer
, ElementSize
);
95 // increment NextSwapLocation
101 // swap pivot to it's final position (NextSwapLocaiton)
103 CopyMem (Buffer
, Pivot
, ElementSize
);
104 CopyMem (Pivot
, (UINT8
*)BufferToSort
+(NextSwapLocation
*ElementSize
), ElementSize
);
105 CopyMem ((UINT8
*)BufferToSort
+(NextSwapLocation
*ElementSize
), Buffer
, ElementSize
);
108 // Now recurse on 2 paritial lists. neither of these will have the 'pivot' element
109 // IE list is sorted left half, pivot element, sorted right half...
111 if (NextSwapLocation
>= 2) {
120 if ((Count
- NextSwapLocation
- 1) >= 2) {
122 (UINT8
*)BufferToSort
+ (NextSwapLocation
+1) * ElementSize
,
123 Count
- NextSwapLocation
- 1,
131 Function to perform a Quick Sort alogrithm on a buffer of comparable elements.
133 Each element must be equal sized.
135 if BufferToSort is NULL, then ASSERT.
136 if CompareFunction is NULL, then ASSERT.
138 if Count is < 2 then perform no action.
139 if Size is < 1 then perform no action.
141 @param[in, out] BufferToSort on call a Buffer of (possibly sorted) elements
142 on return a buffer of sorted elements
143 @param[in] Count the number of elements in the buffer to sort
144 @param[in] ElementSize Size of an element in bytes
145 @param[in] CompareFunction The function to call to perform the comparison
151 IN OUT VOID
*BufferToSort
,
152 IN CONST UINTN Count
,
153 IN CONST UINTN ElementSize
,
154 IN SORT_COMPARE CompareFunction
159 ASSERT(BufferToSort
!= NULL
);
160 ASSERT(CompareFunction
!= NULL
);
162 Buffer
= AllocateZeroPool(ElementSize
);
163 ASSERT(Buffer
!= NULL
);
177 Not supported in Base version.
179 @param[in] Buffer1 Ignored.
180 @param[in] Buffer2 Ignored.
187 IN CONST VOID
*Buffer1
,
188 IN CONST VOID
*Buffer2
196 Function to compare 2 strings without regard to case of the characters.
198 @param[in] Buffer1 Pointer to String to compare.
199 @param[in] Buffer2 Pointer to second String to compare.
201 @retval 0 Buffer1 equal to Buffer2.
202 @return < 0 Buffer1 is less than Buffer2.
203 @return > 0 Buffer1 is greater than Buffer2.
207 StringNoCaseCompare (
208 IN CONST VOID
*Buffer1
,
209 IN CONST VOID
*Buffer2
218 Function to compare 2 strings.
220 @param[in] Buffer1 Pointer to String to compare (CHAR16**).
221 @param[in] Buffer2 Pointer to second String to compare (CHAR16**).
223 @retval 0 Buffer1 equal to Buffer2.
224 @return < 0 Buffer1 is less than Buffer2.
225 @return > 0 Buffer1 is greater than Buffer2.
230 IN CONST VOID
*Buffer1
,
231 IN CONST VOID
*Buffer2