RedfishPkg: Apply uncrustify changes

[mirror_edk2.git] / RedfishPkg / PrivateLibrary / RedfishLib / edk2libredfish / src / redpath.c

/** @file\r
  This file is cloned from DMTF libredfish library tag v1.0.0 and maintained\r
  by EDKII.\r
\r
//----------------------------------------------------------------------------\r
// Copyright Notice:\r
// Copyright 2017 Distributed Management Task Force, Inc. All rights reserved.\r
// License: BSD 3-Clause License. For full text see link: https://github.com/DMTF/libredfish/LICENSE.md\r
//----------------------------------------------------------------------------\r
\r
  Copyright (c) 2019, Intel Corporation. All rights reserved.<BR>\r
  (C) Copyright 2021 Hewlett Packard Enterprise Development LP<BR>\r
\r
  SPDX-License-Identifier: BSD-2-Clause-Patent\r
\r
**/\r
#include <redpath.h>\r
\r
static char *\r
getVersion (\r
  const char  *path,\r
  char        **end\r
  );\r
\r
static void\r
parseNode (\r
  const char   *path,\r
  redPathNode  *node,\r
  redPathNode  **end\r
  );\r
\r
static char *\r
getStringTill (\r
  const char  *string,\r
  const char  *terminator,\r
  char        **retEnd\r
  );\r
\r
redPathNode *\r
parseRedPath (\r
  const char  *path\r
  )\r
{\r
  redPathNode  *node;\r
  redPathNode  *endNode;\r
  char         *curPath;\r
  char         *end;\r
\r
  if (!path || (strlen (path) == 0)) {\r
    return NULL;\r
  }\r
\r
  node = (redPathNode *)calloc (1, sizeof (redPathNode));\r
  if (!node) {\r
    return NULL;\r
  }\r
\r
  if (path[0] == '/') {\r
    node->isRoot = true;\r
    if (path[1] == 'v') {\r
      node->version = getVersion (path+1, &curPath);\r
      if (curPath == NULL) {\r
        return node;\r
      }\r
\r
      if (curPath[0] == '/') {\r
        curPath++;\r
      }\r
\r
      node->next = parseRedPath (curPath);\r
    } else {\r
      node->next = parseRedPath (path+1);\r
    }\r
\r
    return node;\r
  }\r
\r
  node->isRoot = false;\r
  curPath      = getStringTill (path, "/", &end);\r
  endNode      = node;\r
  parseNode (curPath, node, &endNode);\r
  free (curPath);\r
  if (end != NULL) {\r
    endNode->next = parseRedPath (end+1);\r
  }\r
\r
  return node;\r
}\r
\r
void\r
cleanupRedPath (\r
  redPathNode  *node\r
  )\r
{\r
  if (!node) {\r
    return;\r
  }\r
\r
  cleanupRedPath (node->next);\r
  node->next = NULL;\r
  if (node->version) {\r
    free (node->version);\r
  }\r
\r
  if (node->nodeName) {\r
    free (node->nodeName);\r
  }\r
\r
  if (node->op) {\r
    free (node->op);\r
  }\r
\r
  if (node->propName) {\r
    free (node->propName);\r
  }\r
\r
  if (node->value) {\r
    free (node->value);\r
  }\r
\r
  free (node);\r
}\r
\r
static char *\r
getVersion (\r
  const char  *path,\r
  char        **end\r
  )\r
{\r
  return getStringTill (path, "/", end);\r
}\r
\r
static void\r
parseNode (\r
  const char   *path,\r
  redPathNode  *node,\r
  redPathNode  **end\r
  )\r
{\r
  char    *indexStart;\r
  char    *index;\r
  char    *indexEnd;\r
  char    *nodeName = getStringTill (path, "[", &indexStart);\r
  size_t  tmpIndex;\r
  char    *opChars;\r
\r
  node->nodeName = nodeName;\r
  if (indexStart == NULL) {\r
    *end = node;\r
    return;\r
  }\r
\r
  node->next = (redPathNode *)calloc (1, sizeof (redPathNode));\r
  if (!node->next) {\r
    return;\r
  }\r
\r
  // Skip past [\r
  indexStart++;\r
  *end     = node->next;\r
  index    = getStringTill (indexStart, "]", NULL);\r
  tmpIndex = (size_t)strtoull (index, &indexEnd, 0);\r
  if (indexEnd != index) {\r
    free (index);\r
    node->next->index   = tmpIndex;\r
    node->next->isIndex = true;\r
    return;\r
  }\r
\r
  opChars = strpbrk (index, "<>=~");\r
  if (opChars == NULL) {\r
    // TODO handle last() and position()\r
    node->next->op       = strdup ("exists");\r
    node->next->propName = index;\r
    return;\r
  }\r
\r
  node->next->propName = (char *)malloc ((opChars - index)+1);\r
  memcpy (node->next->propName, index, (opChars - index));\r
  node->next->propName[(opChars - index)] = 0;\r
\r
  tmpIndex = 1;\r
  while (1) {\r
    if ((opChars[tmpIndex] == '=') || (opChars[tmpIndex] == '<') || (opChars[tmpIndex] == '>') || (opChars[tmpIndex] == '~')) {\r
      tmpIndex++;\r
      continue;\r
    }\r
\r
    break;\r
  }\r
\r
  node->next->op = (char *)malloc (tmpIndex+1);\r
  memcpy (node->next->op, opChars, tmpIndex);\r
  node->next->op[tmpIndex] = 0;\r
\r
  node->next->value = strdup (opChars+tmpIndex);\r
  free (index);\r
}\r
\r
static char *\r
getStringTill (\r
  const char  *string,\r
  const char  *terminator,\r
  char        **retEnd\r
  )\r
{\r
  char  *ret;\r
  char  *end;\r
\r
  end = strstr ((char *)string, terminator);\r
  if (retEnd) {\r
    *retEnd = end;\r
  }\r
\r
  if (end == NULL) {\r
    // No terminator\r
    return strdup (string);\r
  }\r
\r
  ret = (char *)malloc ((end-string)+1);\r
  memcpy (ret, string, (end-string));\r
  ret[(end-string)] = 0;\r
  return ret;\r
}\r