]> git.proxmox.com Git - mirror_edk2.git/blame - MdePkg/Library/BaseMemoryLibMmx/ScanMem8Wrapper.c
MdePkg: Clean up source files
[mirror_edk2.git] / MdePkg / Library / BaseMemoryLibMmx / ScanMem8Wrapper.c
CommitLineData
c5ecf6c1 1/** @file\r
f7753a96 2 ScanMem8() and ScanMemN() implementation.\r
c5ecf6c1 3\r
2bfb6009 4 The following BaseMemoryLib instances contain the same copy of this file:\r
eb1c78db 5\r
c5ecf6c1 6 BaseMemoryLib\r
7 BaseMemoryLibMmx\r
8 BaseMemoryLibSse2\r
9 BaseMemoryLibRepStr\r
2bfb6009
LG
10 BaseMemoryLibOptDxe\r
11 BaseMemoryLibOptPei\r
c5ecf6c1 12 PeiMemoryLib\r
1fef058f 13 UefiMemoryLib\r
c5ecf6c1 14\r
9095d37b 15 Copyright (c) 2006 - 2018, Intel Corporation. All rights reserved.<BR>\r
085c3968 16 This program and the accompanying materials\r
d531bfee 17 are licensed and made available under the terms and conditions of the BSD License\r
18 which accompanies this distribution. The full text of the license may be found at\r
15c952e7 19 http://opensource.org/licenses/bsd-license.php.\r
d531bfee 20\r
21 THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
22 WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r
23\r
c5ecf6c1 24**/\r
25\r
26#include "MemLibInternals.h"\r
27\r
28/**\r
29 Scans a target buffer for an 8-bit value, and returns a pointer to the matching 8-bit value\r
30 in the target buffer.\r
31\r
56385d49 32 This function searches the target buffer specified by Buffer and Length from the lowest\r
c5ecf6c1 33 address to the highest address for an 8-bit value that matches Value. If a match is found,\r
34 then a pointer to the matching byte in the target buffer is returned. If no match is found,\r
35 then NULL is returned. If Length is 0, then NULL is returned.\r
9095d37b 36\r
c5ecf6c1 37 If Length > 0 and Buffer is NULL, then ASSERT().\r
eb1c78db 38 If Length is greater than (MAX_ADDRESS - Buffer + 1), then ASSERT().\r
c5ecf6c1 39\r
15c952e7 40 @param Buffer The pointer to the target buffer to scan.\r
41 @param Length The number of bytes in Buffer to scan.\r
42 @param Value The value to search for in the target buffer.\r
c5ecf6c1 43\r
44 @return A pointer to the matching byte in the target buffer or NULL otherwise.\r
45\r
46**/\r
47VOID *\r
48EFIAPI\r
49ScanMem8 (\r
50 IN CONST VOID *Buffer,\r
51 IN UINTN Length,\r
52 IN UINT8 Value\r
53 )\r
54{\r
2bfb6009 55 if (Length == 0) {\r
c5ecf6c1 56 return NULL;\r
57 }\r
58 ASSERT (Buffer != NULL);\r
59 ASSERT ((Length - 1) <= (MAX_ADDRESS - (UINTN)Buffer));\r
9095d37b 60\r
c5ecf6c1 61 return (VOID*)InternalMemScanMem8 (Buffer, Length, Value);\r
62}\r
f7753a96 63\r
64/**\r
9095d37b 65 Scans a target buffer for a UINTN sized value, and returns a pointer to the matching\r
f7753a96 66 UINTN sized value in the target buffer.\r
67\r
56385d49 68 This function searches the target buffer specified by Buffer and Length from the lowest\r
f7753a96 69 address to the highest address for a UINTN sized value that matches Value. If a match is found,\r
70 then a pointer to the matching byte in the target buffer is returned. If no match is found,\r
71 then NULL is returned. If Length is 0, then NULL is returned.\r
9095d37b 72\r
f7753a96 73 If Length > 0 and Buffer is NULL, then ASSERT().\r
74 If Buffer is not aligned on a UINTN boundary, then ASSERT().\r
75 If Length is not aligned on a UINTN boundary, then ASSERT().\r
76 If Length is greater than (MAX_ADDRESS - Buffer + 1), then ASSERT().\r
77\r
15c952e7 78 @param Buffer The pointer to the target buffer to scan.\r
79 @param Length The number of bytes in Buffer to scan.\r
80 @param Value The value to search for in the target buffer.\r
f7753a96 81\r
82 @return A pointer to the matching byte in the target buffer or NULL otherwise.\r
83\r
84**/\r
85VOID *\r
86EFIAPI\r
87ScanMemN (\r
88 IN CONST VOID *Buffer,\r
89 IN UINTN Length,\r
90 IN UINTN Value\r
91 )\r
92{\r
93 if (sizeof (UINTN) == sizeof (UINT64)) {\r
94 return ScanMem64 (Buffer, Length, (UINT64)Value);\r
56385d49 95 } else {\r
96 return ScanMem32 (Buffer, Length, (UINT32)Value);\r
f7753a96 97 }\r
f7753a96 98}\r
99\r