UefiCpuPkg: Move AsmRelocateApLoopStart from Mpfuncs.nasm to AmdSev.nasm

[mirror_edk2.git] / CryptoPkg / Library / BaseCryptLib / SysCall / CrtWrapper.c

/** @file\r
  C Run-Time Libraries (CRT) Wrapper Implementation for OpenSSL-based\r
  Cryptographic Library.\r
\r
Copyright (c) 2009 - 2017, Intel Corporation. All rights reserved.<BR>\r
SPDX-License-Identifier: BSD-2-Clause-Patent\r
\r
**/\r
\r
#include <CrtLibSupport.h>\r
\r
int  errno = 0;\r
\r
FILE  *stderr = NULL;\r
FILE  *stdin  = NULL;\r
FILE  *stdout = NULL;\r
\r
typedef\r
int\r
(*SORT_COMPARE)(\r
  IN  VOID  *Buffer1,\r
  IN  VOID  *Buffer2\r
  );\r
\r
//\r
// Duplicated from EDKII BaseSortLib for qsort() wrapper\r
//\r
STATIC\r
VOID\r
QuickSortWorker (\r
  IN OUT    VOID          *BufferToSort,\r
  IN CONST  UINTN         Count,\r
  IN CONST  UINTN         ElementSize,\r
  IN        SORT_COMPARE  CompareFunction,\r
  IN        VOID          *Buffer\r
  )\r
{\r
  VOID   *Pivot;\r
  UINTN  LoopCount;\r
  UINTN  NextSwapLocation;\r
\r
  ASSERT (BufferToSort    != NULL);\r
  ASSERT (CompareFunction != NULL);\r
  ASSERT (Buffer          != NULL);\r
\r
  if ((Count < 2) || (ElementSize  < 1)) {\r
    return;\r
  }\r
\r
  NextSwapLocation = 0;\r
\r
  //\r
  // Pick a pivot (we choose last element)\r
  //\r
  Pivot = ((UINT8 *)BufferToSort + ((Count - 1) * ElementSize));\r
\r
  //\r
  // Now get the pivot such that all on "left" are below it\r
  // and everything "right" are above it\r
  //\r
  for (LoopCount = 0; LoopCount < Count - 1; LoopCount++) {\r
    //\r
    // If the element is less than the pivot\r
    //\r
    if (CompareFunction ((VOID *)((UINT8 *)BufferToSort + ((LoopCount) * ElementSize)), Pivot) <= 0) {\r
      //\r
      // Swap\r
      //\r
      CopyMem (Buffer, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);\r
      CopyMem ((UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), (UINT8 *)BufferToSort + ((LoopCount) * ElementSize), ElementSize);\r
      CopyMem ((UINT8 *)BufferToSort + ((LoopCount) * ElementSize), Buffer, ElementSize);\r
\r
      //\r
      // Increment NextSwapLocation\r
      //\r
      NextSwapLocation++;\r
    }\r
  }\r
\r
  //\r
  // Swap pivot to its final position (NextSwapLocation)\r
  //\r
  CopyMem (Buffer, Pivot, ElementSize);\r
  CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);\r
  CopyMem ((UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), Buffer, ElementSize);\r
\r
  //\r
  // Now recurse on 2 partial 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
    CompareFunction,\r
    Buffer\r
    );\r
\r
  QuickSortWorker (\r
    (UINT8 *)BufferToSort + (NextSwapLocation + 1) * ElementSize,\r
    Count - NextSwapLocation - 1,\r
    ElementSize,\r
    CompareFunction,\r
    Buffer\r
    );\r
\r
  return;\r
}\r
\r
// ---------------------------------------------------------\r
// Standard C Run-time Library Interface Wrapper\r
// ---------------------------------------------------------\r
\r
//\r
// -- String Manipulation Routines --\r
//\r
\r
char *\r
strchr (\r
  const char  *str,\r
  int         ch\r
  )\r
{\r
  return ScanMem8 (str, AsciiStrSize (str), (UINT8)ch);\r
}\r
\r
/* Scan a string for the last occurrence of a character */\r
char *\r
strrchr (\r
  const char  *str,\r
  int         c\r
  )\r
{\r
  char  *save;\r
\r
  for (save = NULL; ; ++str) {\r
    if (*str == c) {\r
      save = (char *)str;\r
    }\r
\r
    if (*str == 0) {\r
      return (save);\r
    }\r
  }\r
}\r
\r
/* Compare first n bytes of string s1 with string s2, ignoring case */\r
int\r
strncasecmp (\r
  const char  *s1,\r
  const char  *s2,\r
  size_t      n\r
  )\r
{\r
  int  Val;\r
\r
  ASSERT (s1 != NULL);\r
  ASSERT (s2 != NULL);\r
\r
  if (n != 0) {\r
    do {\r
      Val = tolower (*s1) - tolower (*s2);\r
      if (Val != 0) {\r
        return Val;\r
      }\r
\r
      ++s1;\r
      ++s2;\r
      if (*s1 == '\0') {\r
        break;\r
      }\r
    } while (--n != 0);\r
  }\r
\r
  return 0;\r
}\r
\r
/* Read formatted data from a string */\r
int\r
sscanf (\r
  const char  *buffer,\r
  const char  *format,\r
  ...\r
  )\r
{\r
  //\r
  // Null sscanf() function implementation to satisfy the linker, since\r
  // no direct functionality logic dependency in present UEFI cases.\r
  //\r
  return 0;\r
}\r
\r
/* Maps errnum to an error-message string */\r
char *\r
strerror (\r
  int  errnum\r
  )\r
{\r
  return NULL;\r
}\r
\r
/* Computes the length of the maximum initial segment of the string pointed to by s1\r
   which consists entirely of characters from the string pointed to by s2. */\r
size_t\r
strspn (\r
  const char  *s1,\r
  const char  *s2\r
  )\r
{\r
  UINT8   Map[32];\r
  UINT32  Index;\r
  size_t  Count;\r
\r
  for (Index = 0; Index < 32; Index++) {\r
    Map[Index] = 0;\r
  }\r
\r
  while (*s2) {\r
    Map[*s2 >> 3] |= (1 << (*s2 & 7));\r
    s2++;\r
  }\r
\r
  if (*s1) {\r
    Count = 0;\r
    while (Map[*s1 >> 3] & (1 << (*s1 & 7))) {\r
      Count++;\r
      s1++;\r
    }\r
\r
    return Count;\r
  }\r
\r
  return 0;\r
}\r
\r
/* Computes the length of the maximum initial segment of the string pointed to by s1\r
   which consists entirely of characters not from the string pointed to by s2. */\r
size_t\r
strcspn (\r
  const char  *s1,\r
  const char  *s2\r
  )\r
{\r
  UINT8   Map[32];\r
  UINT32  Index;\r
  size_t  Count;\r
\r
  for (Index = 0; Index < 32; Index++) {\r
    Map[Index] = 0;\r
  }\r
\r
  while (*s2) {\r
    Map[*s2 >> 3] |= (1 << (*s2 & 7));\r
    s2++;\r
  }\r
\r
  Map[0] |= 1;\r
\r
  Count = 0;\r
  while (!(Map[*s1 >> 3] & (1 << (*s1 & 7)))) {\r
    Count++;\r
    s1++;\r
  }\r
\r
  return Count;\r
}\r
\r
char *\r
strcpy (\r
  char        *strDest,\r
  const char  *strSource\r
  )\r
{\r
  AsciiStrCpyS (strDest, MAX_STRING_SIZE, strSource);\r
  return strDest;\r
}\r
\r
//\r
// -- Character Classification Routines --\r
//\r
\r
/* Determines if a particular character is a decimal-digit character */\r
int\r
isdigit (\r
  int  c\r
  )\r
{\r
  //\r
  // <digit> ::= [0-9]\r
  //\r
  return (('0' <= (c)) && ((c) <= '9'));\r
}\r
\r
/* Determine if an integer represents character that is a hex digit */\r
int\r
isxdigit (\r
  int  c\r
  )\r
{\r
  //\r
  // <hexdigit> ::= [0-9] | [a-f] | [A-F]\r
  //\r
  return ((('0' <= (c)) && ((c) <= '9')) ||\r
          (('a' <= (c)) && ((c) <= 'f')) ||\r
          (('A' <= (c)) && ((c) <= 'F')));\r
}\r
\r
/* Determines if a particular character represents a space character */\r
int\r
isspace (\r
  int  c\r
  )\r
{\r
  //\r
  // <space> ::= [ ]\r
  //\r
  return ((c) == ' ');\r
}\r
\r
/* Determine if a particular character is an alphanumeric character */\r
int\r
isalnum (\r
  int  c\r
  )\r
{\r
  //\r
  // <alnum> ::= [0-9] | [a-z] | [A-Z]\r
  //\r
  return ((('0' <= (c)) && ((c) <= '9')) ||\r
          (('a' <= (c)) && ((c) <= 'z')) ||\r
          (('A' <= (c)) && ((c) <= 'Z')));\r
}\r
\r
/* Determines if a particular character is in upper case */\r
int\r
isupper (\r
  int  c\r
  )\r
{\r
  //\r
  // <uppercase letter> := [A-Z]\r
  //\r
  return (('A' <= (c)) && ((c) <= 'Z'));\r
}\r
\r
//\r
// -- Data Conversion Routines --\r
//\r
\r
/* Convert strings to a long-integer value */\r
long\r
strtol (\r
  const char  *nptr,\r
  char        **endptr,\r
  int         base\r
  )\r
{\r
  //\r
  // Null strtol() function implementation to satisfy the linker, since there is\r
  // no direct functionality logic dependency in present UEFI cases.\r
  //\r
  return 0;\r
}\r
\r
/* Convert strings to an unsigned long-integer value */\r
unsigned long\r
strtoul (\r
  const char  *nptr,\r
  char        **endptr,\r
  int         base\r
  )\r
{\r
  //\r
  // Null strtoul() function implementation to satisfy the linker, since there is\r
  // no direct functionality logic dependency in present UEFI cases.\r
  //\r
  return 0;\r
}\r
\r
/* Convert character to lowercase */\r
int\r
tolower (\r
  int  c\r
  )\r
{\r
  if (('A' <= (c)) && ((c) <= 'Z')) {\r
    return (c - ('A' - 'a'));\r
  }\r
\r
  return (c);\r
}\r
\r
//\r
// -- Searching and Sorting Routines --\r
//\r
\r
/* Performs a quick sort */\r
void\r
qsort (\r
  void *base,\r
  size_t num,\r
  size_t width,\r
  int ( *compare )(const void *, const void *)\r
  )\r
{\r
  VOID  *Buffer;\r
\r
  ASSERT (base    != NULL);\r
  ASSERT (compare != NULL);\r
\r
  //\r
  // Use CRT-style malloc to cover BS and RT memory allocation.\r
  //\r
  Buffer = malloc (width);\r
  ASSERT (Buffer != NULL);\r
\r
  //\r
  // Re-use PerformQuickSort() function Implementation in EDKII BaseSortLib.\r
  //\r
  QuickSortWorker (base, (UINTN)num, (UINTN)width, (SORT_COMPARE)compare, Buffer);\r
\r
  free (Buffer);\r
  return;\r
}\r
\r
//\r
// -- Process and Environment Control Routines --\r
//\r
\r
/* Get a value from the current environment */\r
char *\r
getenv (\r
  const char  *varname\r
  )\r
{\r
  //\r
  // Null getenv() function implementation to satisfy the linker, since there is\r
  // no direct functionality logic dependency in present UEFI cases.\r
  //\r
  return NULL;\r
}\r
\r
/* Get a value from the current environment */\r
char *\r
secure_getenv (\r
  const char  *varname\r
  )\r
{\r
  //\r
  // Null secure_getenv() function implementation to satisfy the linker, since\r
  // there is no direct functionality logic dependency in present UEFI cases.\r
  //\r
  // From the secure_getenv() manual: 'just like getenv() except that it\r
  // returns NULL in cases where "secure execution" is required'.\r
  //\r
  return NULL;\r
}\r
\r
//\r
// -- Stream I/O Routines --\r
//\r
\r
/* Write data to a stream */\r
size_t\r
fwrite (\r
  const void  *buffer,\r
  size_t      size,\r
  size_t      count,\r
  FILE        *stream\r
  )\r
{\r
  return 0;\r
}\r
\r
//\r
//  -- Dummy OpenSSL Support Routines --\r
//\r
\r
int\r
BIO_printf (\r
  void        *bio,\r
  const char  *format,\r
  ...\r
  )\r
{\r
  return 0;\r
}\r
\r
int\r
BIO_snprintf (\r
  char        *buf,\r
  size_t      n,\r
  const char  *format,\r
  ...\r
  )\r
{\r
  // Because the function does not actually print anything to buf, it returns -1 as error.\r
  // Otherwise, the consumer may think that the buf is valid and parse the buffer.\r
  return -1;\r
}\r
\r
#ifdef __GNUC__\r
\r
typedef\r
VOID\r
(EFIAPI *NoReturnFuncPtr)(\r
  VOID\r
  ) __attribute__ ((__noreturn__));\r
\r
STATIC\r
VOID\r
EFIAPI\r
NopFunction (\r
  VOID\r
  )\r
{\r
}\r
\r
void\r
abort (\r
  void\r
  )\r
{\r
  NoReturnFuncPtr  NoReturnFunc;\r
\r
  NoReturnFunc = (NoReturnFuncPtr)NopFunction;\r
\r
  NoReturnFunc ();\r
}\r
\r
#else\r
\r
void\r
abort (\r
  void\r
  )\r
{\r
  // Do nothing\r
}\r
\r
#endif\r
\r
int\r
fclose (\r
  FILE  *f\r
  )\r
{\r
  return 0;\r
}\r
\r
FILE *\r
fopen (\r
  const char  *c,\r
  const char  *m\r
  )\r
{\r
  return NULL;\r
}\r
\r
size_t\r
fread (\r
  void    *b,\r
  size_t  c,\r
  size_t  i,\r
  FILE    *f\r
  )\r
{\r
  return 0;\r
}\r
\r
uid_t\r
getuid (\r
  void\r
  )\r
{\r
  return 0;\r
}\r
\r
uid_t\r
geteuid (\r
  void\r
  )\r
{\r
  return 0;\r
}\r
\r
gid_t\r
getgid (\r
  void\r
  )\r
{\r
  return 0;\r
}\r
\r
gid_t\r
getegid (\r
  void\r
  )\r
{\r
  return 0;\r
}\r
\r
int\r
printf (\r
  char const  *fmt,\r
  ...\r
  )\r
{\r
  return 0;\r
}\r