2009-07-13 21:33:35 +02:00
|
|
|
/** @file
|
2009-11-18 22:36:50 +01:00
|
|
|
Library used for sorting and comparison routines.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2010-09-14 14:22:42 +02:00
|
|
|
Copyright (c) 2009 - 2010, Intel Corporation. All rights reserved. <BR>
|
2010-01-25 21:05:08 +01:00
|
|
|
This program and the accompanying materials
|
|
|
|
are licensed and made available under the terms and conditions of the BSD License
|
|
|
|
which accompanies this distribution. The full text of the license may be found at
|
|
|
|
http://opensource.org/licenses/bsd-license.php
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2010-01-25 21:05:08 +01:00
|
|
|
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
|
|
|
|
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
|
|
|
**/
|
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
#ifndef __SORT_LIB_H__
|
2009-07-13 21:33:35 +02:00
|
|
|
#define __SORT_LIB_H__
|
|
|
|
|
|
|
|
/**
|
2010-09-14 07:18:09 +02:00
|
|
|
Prototype for comparison function for any two element types.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
@param[in] Buffer1 The pointer to first buffer.
|
|
|
|
@param[in] Buffer2 The pointer to second buffer.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2009-11-20 19:21:03 +01:00
|
|
|
@retval 0 Buffer1 equal to Buffer2.
|
2010-09-14 07:18:09 +02:00
|
|
|
@return <0 Buffer1 is less than Buffer2.
|
|
|
|
@return >0 Buffer1 is greater than Buffer2.
|
2009-07-13 21:33:35 +02:00
|
|
|
**/
|
|
|
|
typedef
|
|
|
|
INTN
|
|
|
|
(EFIAPI *SORT_COMPARE)(
|
2010-01-11 22:49:04 +01:00
|
|
|
IN CONST VOID *Buffer1,
|
|
|
|
IN CONST VOID *Buffer2
|
2009-07-13 21:33:35 +02:00
|
|
|
);
|
|
|
|
|
|
|
|
/**
|
|
|
|
Function to perform a Quick Sort on a buffer of comparable elements.
|
|
|
|
|
|
|
|
Each element must be equally sized.
|
|
|
|
|
2009-11-20 19:21:03 +01:00
|
|
|
If BufferToSort is NULL, then ASSERT.
|
|
|
|
If CompareFunction is NULL, then ASSERT.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
If Count is < 2 , then perform no action.
|
|
|
|
If Size is < 1 , then perform no action.
|
2009-07-13 21:33:35 +02:00
|
|
|
|
2011-09-02 10:05:34 +02:00
|
|
|
@param[in, out] BufferToSort On call, a Buffer of (possibly sorted) elements;
|
|
|
|
on return, a buffer of sorted elements.
|
|
|
|
@param[in] Count The number of elements in the buffer to sort.
|
|
|
|
@param[in] ElementSize The size of an element in bytes.
|
|
|
|
@param[in] CompareFunction The function to call to perform the comparison
|
|
|
|
of any two elements.
|
2009-07-13 21:33:35 +02:00
|
|
|
**/
|
|
|
|
VOID
|
|
|
|
EFIAPI
|
|
|
|
PerformQuickSort (
|
2010-01-11 22:49:04 +01:00
|
|
|
IN OUT VOID *BufferToSort,
|
|
|
|
IN CONST UINTN Count,
|
|
|
|
IN CONST UINTN ElementSize,
|
|
|
|
IN SORT_COMPARE CompareFunction
|
2009-07-13 21:33:35 +02:00
|
|
|
);
|
|
|
|
|
2009-11-18 22:36:50 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
Function to compare 2 device paths for use as CompareFunction.
|
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
@param[in] Buffer1 The pointer to Device Path to compare.
|
|
|
|
@param[in] Buffer2 The pointer to second DevicePath to compare.
|
2009-11-18 22:36:50 +01:00
|
|
|
|
2009-12-07 19:04:03 +01:00
|
|
|
@retval 0 Buffer1 equal to Buffer2.
|
|
|
|
@return < 0 Buffer1 is less than Buffer2.
|
2010-01-25 21:05:08 +01:00
|
|
|
@return > 0 Buffer1 is greater than Buffer2.
|
2009-11-18 22:36:50 +01:00
|
|
|
**/
|
|
|
|
INTN
|
2009-12-07 19:04:03 +01:00
|
|
|
EFIAPI
|
2009-11-18 22:36:50 +01:00
|
|
|
DevicePathCompare (
|
2010-01-11 22:49:04 +01:00
|
|
|
IN CONST VOID *Buffer1,
|
|
|
|
IN CONST VOID *Buffer2
|
2009-11-18 22:36:50 +01:00
|
|
|
);
|
2009-12-07 19:04:03 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
Function to compare 2 strings without regard to case of the characters.
|
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
@param[in] Buffer1 The pointer to String to compare (CHAR16**).
|
|
|
|
@param[in] Buffer2 The pointer to second String to compare (CHAR16**).
|
2009-12-07 19:04:03 +01:00
|
|
|
|
|
|
|
@retval 0 Buffer1 equal to Buffer2.
|
|
|
|
@return < 0 Buffer1 is less than Buffer2.
|
2010-01-25 21:05:08 +01:00
|
|
|
@return > 0 Buffer1 is greater than Buffer2.
|
2009-12-07 19:04:03 +01:00
|
|
|
**/
|
|
|
|
INTN
|
|
|
|
EFIAPI
|
|
|
|
StringNoCaseCompare (
|
2010-01-11 22:49:04 +01:00
|
|
|
IN CONST VOID *Buffer1,
|
|
|
|
IN CONST VOID *Buffer2
|
2009-12-07 19:04:03 +01:00
|
|
|
);
|
|
|
|
|
2010-09-14 07:18:09 +02:00
|
|
|
/**
|
|
|
|
Function to compare 2 strings.
|
|
|
|
|
|
|
|
@param[in] Buffer1 The pointer to String to compare (CHAR16**).
|
|
|
|
@param[in] Buffer2 The pointer to second String to compare (CHAR16**).
|
|
|
|
|
|
|
|
@retval 0 Buffer1 equal to Buffer2.
|
|
|
|
@return < 0 Buffer1 is less than Buffer2.
|
|
|
|
@return > 0 Buffer1 is greater than Buffer2.
|
|
|
|
**/
|
|
|
|
INTN
|
|
|
|
EFIAPI
|
|
|
|
StringCompare (
|
|
|
|
IN CONST VOID *Buffer1,
|
|
|
|
IN CONST VOID *Buffer2
|
|
|
|
);
|
|
|
|
|
2009-07-13 21:33:35 +02:00
|
|
|
#endif //__SORT_LIB_H__
|