Xin Zhang
/
azure-iot-c-sdk-f767zi
Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
serializer/src/multitree.c@0:f7f1f0d76dd6, 2018-08-23 (annotated)
- Committer:
- XinZhangMS
- Date:
- Thu Aug 23 06:52:14 2018 +0000
- Revision:
- 0:f7f1f0d76dd6
azure-c-sdk for mbed os supporting NUCLEO_F767ZI
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| XinZhangMS | 0:f7f1f0d76dd6 | 1 | // Copyright (c) Microsoft. All rights reserved. |
| XinZhangMS | 0:f7f1f0d76dd6 | 2 | // Licensed under the MIT license. See LICENSE file in the project root for full license information. |
| XinZhangMS | 0:f7f1f0d76dd6 | 3 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 4 | #include <stdlib.h> |
| XinZhangMS | 0:f7f1f0d76dd6 | 5 | #include "azure_c_shared_utility/gballoc.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 6 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 7 | #include "multitree.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 8 | #include <string.h> |
| XinZhangMS | 0:f7f1f0d76dd6 | 9 | #include "azure_c_shared_utility/crt_abstractions.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 10 | #include "azure_c_shared_utility/xlogging.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 11 | #include "azure_c_shared_utility/macro_utils.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 12 | #include "azure_c_shared_utility/const_defines.h" |
| XinZhangMS | 0:f7f1f0d76dd6 | 13 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 14 | /*assume a name cannot be longer than 100 characters*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 15 | #define INNER_NODE_NAME_SIZE 128 |
| XinZhangMS | 0:f7f1f0d76dd6 | 16 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 17 | DEFINE_ENUM_STRINGS(MULTITREE_RESULT, MULTITREE_RESULT_VALUES); |
| XinZhangMS | 0:f7f1f0d76dd6 | 18 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 19 | typedef struct MULTITREE_HANDLE_DATA_TAG |
| XinZhangMS | 0:f7f1f0d76dd6 | 20 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 21 | char* name; |
| XinZhangMS | 0:f7f1f0d76dd6 | 22 | void* value; |
| XinZhangMS | 0:f7f1f0d76dd6 | 23 | MULTITREE_CLONE_FUNCTION cloneFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 24 | MULTITREE_FREE_FUNCTION freeFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 25 | size_t nChildren; |
| XinZhangMS | 0:f7f1f0d76dd6 | 26 | struct MULTITREE_HANDLE_DATA_TAG** children; /*an array of nChildren count of MULTITREE_HANDLE_DATA* */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 27 | }MULTITREE_HANDLE_DATA; |
| XinZhangMS | 0:f7f1f0d76dd6 | 28 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 29 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 30 | MULTITREE_HANDLE MultiTree_Create(MULTITREE_CLONE_FUNCTION cloneFunction, MULTITREE_FREE_FUNCTION freeFunction) |
| XinZhangMS | 0:f7f1f0d76dd6 | 31 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 32 | MULTITREE_HANDLE_DATA* result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 33 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 34 | /* Codes_SRS_MULTITREE_99_052:[If any of the arguments passed to MultiTree_Create is NULL, the call shall return NULL.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 35 | if ((cloneFunction == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 36 | (freeFunction == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 37 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 38 | LogError("CloneFunction or FreeFunction is Null."); |
| XinZhangMS | 0:f7f1f0d76dd6 | 39 | result = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 40 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 41 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 42 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 43 | /*Codes_SRS_MULTITREE_99_005:[ MultiTree_Create creates a new tree.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 44 | /*Codes_SRS_MULTITREE_99_006:[MultiTree_Create returns a non - NULL pointer if the tree has been successfully created.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 45 | /*Codes_SRS_MULTITREE_99_007:[MultiTree_Create returns NULL if the tree has not been successfully created.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 46 | result = (MULTITREE_HANDLE_DATA*)malloc(sizeof(MULTITREE_HANDLE_DATA)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 47 | if (result != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 48 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 49 | result->name = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 50 | result->value = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 51 | result->cloneFunction = cloneFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 52 | result->freeFunction = freeFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 53 | result->nChildren = 0; |
| XinZhangMS | 0:f7f1f0d76dd6 | 54 | result->children = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 55 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 56 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 57 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 58 | LogError("MultiTree_Create failed because malloc failed"); |
| XinZhangMS | 0:f7f1f0d76dd6 | 59 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 60 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 61 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 62 | return (MULTITREE_HANDLE)result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 63 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 64 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 65 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 66 | /*return NULL if a child with the name "name" doesn't exists*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 67 | /*returns a pointer to the existing child (if any)*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 68 | static MULTITREE_HANDLE_DATA* getChildByName(MULTITREE_HANDLE_DATA* node, const char* name) |
| XinZhangMS | 0:f7f1f0d76dd6 | 69 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 70 | MULTITREE_HANDLE_DATA* result = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 71 | size_t i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 72 | for (i = 0; i < node->nChildren; i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 73 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 74 | if (strcmp(node->children[i]->name, name) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 75 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 76 | result = node->children[i]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 77 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 78 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 79 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 80 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 81 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 82 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 83 | /*helper function to create a child immediately under this node*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 84 | /*return 0 if it created it, any other number is error*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 85 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 86 | typedef enum CREATELEAF_RESULT_TAG |
| XinZhangMS | 0:f7f1f0d76dd6 | 87 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 88 | CREATELEAF_OK, |
| XinZhangMS | 0:f7f1f0d76dd6 | 89 | CREATELEAF_ALREADY_EXISTS, |
| XinZhangMS | 0:f7f1f0d76dd6 | 90 | CREATELEAF_EMPTY_NAME, |
| XinZhangMS | 0:f7f1f0d76dd6 | 91 | CREATELEAF_ERROR, |
| XinZhangMS | 0:f7f1f0d76dd6 | 92 | CREATELEAF_RESULT_COUNT // Used to track the number of elements in the enum |
| XinZhangMS | 0:f7f1f0d76dd6 | 93 | // Do not remove, or add new enum values below this one |
| XinZhangMS | 0:f7f1f0d76dd6 | 94 | }CREATELEAF_RESULT; |
| XinZhangMS | 0:f7f1f0d76dd6 | 95 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 96 | static STATIC_VAR_UNUSED const char* CreateLeaf_ResultAsString[CREATELEAF_RESULT_COUNT] = |
| XinZhangMS | 0:f7f1f0d76dd6 | 97 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 98 | TOSTRING(CREATELEAF_OK), |
| XinZhangMS | 0:f7f1f0d76dd6 | 99 | TOSTRING(CREATELEAF_ALREADY_EXISTS), |
| XinZhangMS | 0:f7f1f0d76dd6 | 100 | TOSTRING(CREATELEAF_EMPTY_NAME), |
| XinZhangMS | 0:f7f1f0d76dd6 | 101 | TOSTRING(CREATELEAF_ERROR) |
| XinZhangMS | 0:f7f1f0d76dd6 | 102 | }; |
| XinZhangMS | 0:f7f1f0d76dd6 | 103 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 104 | /*name cannot be empty, value can be empty or NULL*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 105 | #ifdef __APPLE__ |
| XinZhangMS | 0:f7f1f0d76dd6 | 106 | #pragma clang diagnostic push |
| XinZhangMS | 0:f7f1f0d76dd6 | 107 | #pragma clang diagnostic ignored "-Wconditional-uninitialized" |
| XinZhangMS | 0:f7f1f0d76dd6 | 108 | #endif |
| XinZhangMS | 0:f7f1f0d76dd6 | 109 | #ifdef _MSC_VER |
| XinZhangMS | 0:f7f1f0d76dd6 | 110 | #pragma warning(disable: 4701) /* potentially uninitialized local variable 'result' used */ /* the scanner cannot track linked "newNode" and "result" therefore the warning*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 111 | #endif |
| XinZhangMS | 0:f7f1f0d76dd6 | 112 | static CREATELEAF_RESULT createLeaf(MULTITREE_HANDLE_DATA* node, const char*name, const char*value, MULTITREE_HANDLE_DATA** childNode) |
| XinZhangMS | 0:f7f1f0d76dd6 | 113 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 114 | CREATELEAF_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 115 | /*can only create it if it doesn't exist*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 116 | if (strlen(name) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 117 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 118 | /*Codes_SRS_MULTITREE_99_024:[ if a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 119 | result = CREATELEAF_EMPTY_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 120 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 121 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 122 | else if (getChildByName(node, name) != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 123 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 124 | result = CREATELEAF_ALREADY_EXISTS; |
| XinZhangMS | 0:f7f1f0d76dd6 | 125 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 126 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 127 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 128 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 129 | MULTITREE_HANDLE_DATA* newNode = (MULTITREE_HANDLE_DATA*)malloc(sizeof(MULTITREE_HANDLE_DATA)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 130 | if (newNode == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 131 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 132 | result = CREATELEAF_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 133 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 134 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 135 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 136 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 137 | newNode->nChildren = 0; |
| XinZhangMS | 0:f7f1f0d76dd6 | 138 | newNode->children = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 139 | if (mallocAndStrcpy_s(&(newNode->name), name) != 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 140 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 141 | /*not nice*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 142 | free(newNode); |
| XinZhangMS | 0:f7f1f0d76dd6 | 143 | newNode = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 144 | result = CREATELEAF_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 145 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 146 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 147 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 148 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 149 | newNode->cloneFunction = node->cloneFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 150 | newNode->freeFunction = node->freeFunction; |
| XinZhangMS | 0:f7f1f0d76dd6 | 151 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 152 | if (value == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 153 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 154 | newNode->value = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 155 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 156 | else if (node->cloneFunction(&(newNode->value), value) != 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 157 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 158 | free(newNode->name); |
| XinZhangMS | 0:f7f1f0d76dd6 | 159 | newNode->name = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 160 | free(newNode); |
| XinZhangMS | 0:f7f1f0d76dd6 | 161 | newNode = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 162 | result = CREATELEAF_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 163 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 164 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 165 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 166 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 167 | /*all is fine until now*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 168 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 169 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 170 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 171 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 172 | if (newNode!=NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 173 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 174 | /*allocate space in the father node*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 175 | MULTITREE_HANDLE_DATA** newChildren = (MULTITREE_HANDLE_DATA**)realloc(node->children, (node->nChildren + 1)*sizeof(MULTITREE_HANDLE_DATA*)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 176 | if (newChildren == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 177 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 178 | /*no space for the new node*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 179 | newNode->value = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 180 | free(newNode->name); |
| XinZhangMS | 0:f7f1f0d76dd6 | 181 | newNode->name = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 182 | free(newNode); |
| XinZhangMS | 0:f7f1f0d76dd6 | 183 | newNode = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 184 | result = CREATELEAF_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 185 | LogError("(result = %s)", CreateLeaf_ResultAsString[result]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 186 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 187 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 188 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 189 | node->children = newChildren; |
| XinZhangMS | 0:f7f1f0d76dd6 | 190 | node->children[node->nChildren] = newNode; |
| XinZhangMS | 0:f7f1f0d76dd6 | 191 | node->nChildren++; |
| XinZhangMS | 0:f7f1f0d76dd6 | 192 | if (childNode != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 193 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 194 | *childNode = newNode; |
| XinZhangMS | 0:f7f1f0d76dd6 | 195 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 196 | result = CREATELEAF_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 197 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 198 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 199 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 200 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 201 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 202 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 203 | #ifdef _MSC_VER |
| XinZhangMS | 0:f7f1f0d76dd6 | 204 | #pragma warning(default: 4701) /* potentially uninitialized local variable 'result' used */ /* the scanner cannot track linked "newNode" and "result" therefore the warning*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 205 | #endif |
| XinZhangMS | 0:f7f1f0d76dd6 | 206 | #ifdef __APPLE__ |
| XinZhangMS | 0:f7f1f0d76dd6 | 207 | #pragma clang diagnostic pop |
| XinZhangMS | 0:f7f1f0d76dd6 | 208 | #endif |
| XinZhangMS | 0:f7f1f0d76dd6 | 209 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 210 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 211 | MULTITREE_RESULT MultiTree_AddLeaf(MULTITREE_HANDLE treeHandle, const char* destinationPath, const void* value) |
| XinZhangMS | 0:f7f1f0d76dd6 | 212 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 213 | /*codes_SRS_MULTITREE_99_018:[ If the treeHandle parameter is NULL, MULTITREE_INVALID_ARG shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 214 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 215 | if (treeHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 216 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 217 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 218 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 219 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 220 | /*Codes_SRS_MULTITREE_99_019:[ If parameter destinationPath is NULL, MULTITREE_INVALID_ARG shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 221 | else if (destinationPath == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 222 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 223 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 224 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 225 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 226 | /*Codes_SRS_MULTITREE_99_020:[ If parameter value is NULL, MULTITREE_INVALID_ARG shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 227 | else if (value == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 228 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 229 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 230 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 231 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 232 | /*Codes_SRS_MULTITREE_99_050:[ If destinationPath a string with zero characters, MULTITREE_INVALID_ARG shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 233 | else if (strlen(destinationPath) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 234 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 235 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 236 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 237 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 238 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 239 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 240 | /*break the path into components*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 241 | /*find the first child name*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 242 | MULTITREE_HANDLE_DATA * node = (MULTITREE_HANDLE_DATA *)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 243 | char * whereIsDelimiter; |
| XinZhangMS | 0:f7f1f0d76dd6 | 244 | /*if first character is / then skip it*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 245 | /*Codes_SRS_MULTITREE_99_014:[DestinationPath is a string in the following format: /child1/child12 or child1/child12] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 246 | if (destinationPath[0] == '/') |
| XinZhangMS | 0:f7f1f0d76dd6 | 247 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 248 | destinationPath++; |
| XinZhangMS | 0:f7f1f0d76dd6 | 249 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 250 | /*if there's just a string, it needs to be created here*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 251 | whereIsDelimiter = (char*)strchr(destinationPath, '/'); |
| XinZhangMS | 0:f7f1f0d76dd6 | 252 | if (whereIsDelimiter == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 253 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 254 | /*Codes_SRS_MULTITREE_99_017:[ Subsequent names designate hierarchical children in the tree. The last child designates the child that will receive the value.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 255 | CREATELEAF_RESULT res = createLeaf(node, destinationPath, (const char*)value, NULL); |
| XinZhangMS | 0:f7f1f0d76dd6 | 256 | switch (res) |
| XinZhangMS | 0:f7f1f0d76dd6 | 257 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 258 | default: |
| XinZhangMS | 0:f7f1f0d76dd6 | 259 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 260 | /*Codes_SRS_MULTITREE_99_025:[The function shall return MULTITREE_ERROR to indicate any other error not specified here.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 261 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 262 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 263 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 264 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 265 | case CREATELEAF_ALREADY_EXISTS: |
| XinZhangMS | 0:f7f1f0d76dd6 | 266 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 267 | /*Codes_SRS_MULTITREE_99_021:[ If the node already has a value assigned to it, MULTITREE_ALREADY_HAS_A_VALUE shall be returned and the existing value shall not be changed.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 268 | result = MULTITREE_ALREADY_HAS_A_VALUE; |
| XinZhangMS | 0:f7f1f0d76dd6 | 269 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 270 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 271 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 272 | case CREATELEAF_OK: |
| XinZhangMS | 0:f7f1f0d76dd6 | 273 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 274 | /*Codes_SRS_MULTITREE_99_034:[ The function returns MULTITREE_OK when data has been stored in the tree.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 275 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 276 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 277 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 278 | case CREATELEAF_EMPTY_NAME: |
| XinZhangMS | 0:f7f1f0d76dd6 | 279 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 280 | /*Codes_SRS_MULTITREE_99_024:[ if a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 281 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 282 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 283 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 284 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 285 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 286 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 287 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 288 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 289 | /*if there's more or 1 delimiter in the path... */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 290 | /*Codes_SRS_MULTITREE_99_017:[ Subsequent names designate hierarchical children in the tree. The last child designates the child that will receive the value.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 291 | char firstInnerNodeName[INNER_NODE_NAME_SIZE]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 292 | if (strncpy_s(firstInnerNodeName, INNER_NODE_NAME_SIZE, destinationPath, whereIsDelimiter - destinationPath) != 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 293 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 294 | /*Codes_SRS_MULTITREE_99_025:[ The function shall return MULTITREE_ERROR to indicate any other error not specified here.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 295 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 296 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 297 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 298 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 299 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 300 | MULTITREE_HANDLE_DATA *child = getChildByName(node, firstInnerNodeName); |
| XinZhangMS | 0:f7f1f0d76dd6 | 301 | if (child == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 302 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 303 | /*Codes_SRS_MULTITREE_99_022:[ If a child along the path does not exist, it shall be created.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 304 | /*Codes_SRS_MULTITREE_99_023:[ The newly created children along the path shall have a NULL value by default.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 305 | CREATELEAF_RESULT res = createLeaf(node, firstInnerNodeName, NULL, NULL); |
| XinZhangMS | 0:f7f1f0d76dd6 | 306 | switch (res) |
| XinZhangMS | 0:f7f1f0d76dd6 | 307 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 308 | default: |
| XinZhangMS | 0:f7f1f0d76dd6 | 309 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 310 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 311 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 312 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 313 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 314 | case(CREATELEAF_EMPTY_NAME): |
| XinZhangMS | 0:f7f1f0d76dd6 | 315 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 316 | /*Codes_SRS_MULTITREE_99_024:[ if a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 317 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 318 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 319 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 320 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 321 | case(CREATELEAF_OK): |
| XinZhangMS | 0:f7f1f0d76dd6 | 322 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 323 | MULTITREE_HANDLE_DATA *createdChild = getChildByName(node, firstInnerNodeName); |
| XinZhangMS | 0:f7f1f0d76dd6 | 324 | result = MultiTree_AddLeaf(createdChild, whereIsDelimiter, value); |
| XinZhangMS | 0:f7f1f0d76dd6 | 325 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 326 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 327 | }; |
| XinZhangMS | 0:f7f1f0d76dd6 | 328 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 329 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 330 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 331 | result = MultiTree_AddLeaf(child, whereIsDelimiter, value); |
| XinZhangMS | 0:f7f1f0d76dd6 | 332 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 333 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 334 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 335 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 336 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 337 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 338 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 339 | /* Codes_SRS_MULTITREE_99_053:[ MultiTree_AddChild shall add a new node with the name childName to the multi tree node identified by treeHandle] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 340 | MULTITREE_RESULT MultiTree_AddChild(MULTITREE_HANDLE treeHandle, const char* childName, MULTITREE_HANDLE* childHandle) |
| XinZhangMS | 0:f7f1f0d76dd6 | 341 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 342 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 343 | /* Codes_SRS_MULTITREE_99_055:[ If any argument is NULL, MultiTree_AddChild shall return MULTITREE_INVALID_ARG.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 344 | if ((treeHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 345 | (childName == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 346 | (childHandle == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 347 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 348 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 349 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 350 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 351 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 352 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 353 | MULTITREE_HANDLE_DATA* childNode; |
| XinZhangMS | 0:f7f1f0d76dd6 | 354 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 355 | /* Codes_SRS_MULTITREE_99_060:[ The value associated with the new node shall be NULL.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 356 | CREATELEAF_RESULT res = createLeaf((MULTITREE_HANDLE_DATA*)treeHandle, childName, NULL, &childNode); |
| XinZhangMS | 0:f7f1f0d76dd6 | 357 | switch (res) |
| XinZhangMS | 0:f7f1f0d76dd6 | 358 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 359 | default: |
| XinZhangMS | 0:f7f1f0d76dd6 | 360 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 361 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 362 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 363 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 364 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 365 | case CREATELEAF_ALREADY_EXISTS: |
| XinZhangMS | 0:f7f1f0d76dd6 | 366 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 367 | /* Codes_SRS_MULTITREE_99_061:[ If a child node with the same name already exists, MultiTree_AddChild shall return MULTITREE_ALREADY_HAS_A_VALUE.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 368 | result = MULTITREE_ALREADY_HAS_A_VALUE; |
| XinZhangMS | 0:f7f1f0d76dd6 | 369 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 370 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 371 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 372 | case CREATELEAF_OK: |
| XinZhangMS | 0:f7f1f0d76dd6 | 373 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 374 | /* Codes_SRS_MULTITREE_99_062:[ The new node handle shall be returned in the childHandle argument.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 375 | *childHandle = childNode; |
| XinZhangMS | 0:f7f1f0d76dd6 | 376 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 377 | /* Codes_SRS_MULTITREE_99_054:[ On success, MultiTree_AddChild shall return MULTITREE_OK.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 378 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 379 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 380 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 381 | case CREATELEAF_EMPTY_NAME: |
| XinZhangMS | 0:f7f1f0d76dd6 | 382 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 383 | /* Tests_SRS_MULTITREE_99_066:[ If the childName argument is an empty string, MultiTree_AddChild shall return MULTITREE_EMPTY_CHILD_NAME.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 384 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 385 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 386 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 387 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 388 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 389 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 390 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 391 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 392 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 393 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 394 | MULTITREE_RESULT MultiTree_GetChildCount(MULTITREE_HANDLE treeHandle, size_t* count) |
| XinZhangMS | 0:f7f1f0d76dd6 | 395 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 396 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 397 | /*Codes_SRS_MULTITREE_99_027:[If treeHandle is NULL, the function returns MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 398 | if (treeHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 399 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 400 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 401 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 402 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 403 | /*Codes_SRS_MULTITREE_99_028:[ If parameter count is NULL, the function returns MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 404 | else if (count == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 405 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 406 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 407 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 408 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 409 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 410 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 411 | /*Codes_SRS_MULTITREE_99_029:[ This function writes in *count the number of direct children for a tree node specified by the parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 412 | *count = ((MULTITREE_HANDLE_DATA*)treeHandle)->nChildren; |
| XinZhangMS | 0:f7f1f0d76dd6 | 413 | /*Codes_SRS_MULTITREE_99_035:[ The function shall return MULTITREE_OK when *count contains the number of children of the node pointed to be parameter treeHandle.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 414 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 415 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 416 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 417 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 418 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 419 | MULTITREE_RESULT MultiTree_GetChild(MULTITREE_HANDLE treeHandle, size_t index, MULTITREE_HANDLE *childHandle) |
| XinZhangMS | 0:f7f1f0d76dd6 | 420 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 421 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 422 | /*Codes_SRS_MULTITREE_99_031:[ If parameter treeHandle is NULL, the function returns MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 423 | if (treeHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 424 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 425 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 426 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 427 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 428 | /*Codes_SRS_MULTITREE_99_033:[ If parameter childHandle is NULL, the function shall return MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 429 | else if (childHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 430 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 431 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 432 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 433 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 434 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 435 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 436 | MULTITREE_HANDLE_DATA * node = (MULTITREE_HANDLE_DATA *)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 437 | /*Codes_SRS_MULTITREE_99_032:[If parameter index is out of range, the function shall return MULTITREE_OUT_OF_RANGE_INDEX]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 438 | if (node->nChildren <= index) |
| XinZhangMS | 0:f7f1f0d76dd6 | 439 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 440 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 441 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 442 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 443 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 444 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 445 | /*Codes_SRS_MULTITREE_99_030:[ This function writes in *childHandle parameter the "index"th child of the node pointed to by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 446 | /*Codes_SRS_MULTITREE_99_035:[ The function returns MULTITREE_OK when *childHandle contains a handle to the "index"th child of the tree designated by parameter treeHandle.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 447 | *childHandle = node->children[index]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 448 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 449 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 450 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 451 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 452 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 453 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 454 | MULTITREE_RESULT MultiTree_GetName(MULTITREE_HANDLE treeHandle, STRING_HANDLE destination) |
| XinZhangMS | 0:f7f1f0d76dd6 | 455 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 456 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 457 | /*Codes_SRS_MULTITREE_99_037:[ If treeHandle is NULL, the function shall return MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 458 | if (treeHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 459 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 460 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 461 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 462 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 463 | /*Codes_SRS_MULTITREE_99_038:[If destination is NULL, the function shall return MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 464 | else if (destination == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 465 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 466 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 467 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 468 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 469 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 470 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 471 | MULTITREE_HANDLE_DATA *node = (MULTITREE_HANDLE_DATA*)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 472 | /*Codes_SRS_MULTITREE_99_051:[ The function returns MULTITREE_EMPTY_CHILD_NAME when used with the root of the tree.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 473 | if (node->name == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 474 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 475 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 476 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 477 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 478 | /*Codes_SRS_MULTITREE_99_036:[ This function fills the buffer pointed to by parameter destination with the name of the root node of the tree designated by parameter treeHandle.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 479 | else if (STRING_concat(destination, node->name)!=0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 480 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 481 | /*Codes_SRS_MULTITREE_99_040:[ The function returns MULTITREE_ERROR to indicate any other error.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 482 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 483 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 484 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 485 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 486 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 487 | /*Codes_SRS_MULTITREE_99_039:[ The function returns MULTITREE_OK when destination contains the name of the root node of the tree designated by treeHandle parameter.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 488 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 489 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 490 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 491 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 492 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 493 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 494 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 495 | /* Codes_SRS_MULTITREE_99_063:[ MultiTree_GetChildByName shall retrieve the handle of the child node childName from the treeNode node.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 496 | MULTITREE_RESULT MultiTree_GetChildByName(MULTITREE_HANDLE treeHandle, const char* childName, MULTITREE_HANDLE *childHandle) |
| XinZhangMS | 0:f7f1f0d76dd6 | 497 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 498 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 499 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 500 | /* Codes_SRS_MULTITREE_99_065:[ If any argument is NULL, MultiTree_GetChildByName shall return MULTITREE_INVALID_ARG.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 501 | if ((treeHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 502 | (childHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 503 | (childName == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 504 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 505 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 506 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 507 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 508 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 509 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 510 | MULTITREE_HANDLE_DATA * node = (MULTITREE_HANDLE_DATA *)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 511 | size_t i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 512 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 513 | for (i = 0; i < node->nChildren; i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 514 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 515 | if (strcmp(node->children[i]->name, childName) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 516 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 517 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 518 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 519 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 520 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 521 | if (i == node->nChildren) |
| XinZhangMS | 0:f7f1f0d76dd6 | 522 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 523 | /* Codes_SRS_MULTITREE_99_068:[ If the specified child is not found, MultiTree_GetChildByName shall return MULTITREE_CHILD_NOT_FOUND.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 524 | result = MULTITREE_CHILD_NOT_FOUND; |
| XinZhangMS | 0:f7f1f0d76dd6 | 525 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 526 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 527 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 528 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 529 | /* Codes_SRS_MULTITREE_99_067:[ The child node handle shall be returned in the childHandle argument.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 530 | *childHandle = node->children[i]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 531 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 532 | /* Codes_SRS_MULTITREE_99_064:[ On success, MultiTree_GetChildByName shall return MULTITREE_OK.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 533 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 534 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 535 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 536 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 537 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 538 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 539 | MULTITREE_RESULT MultiTree_GetValue(MULTITREE_HANDLE treeHandle, const void** destination) |
| XinZhangMS | 0:f7f1f0d76dd6 | 540 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 541 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 542 | /*Codes_SRS_MULTITREE_99_042:[If treeHandle is NULL, the function shall return MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 543 | if (treeHandle == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 544 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 545 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 546 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 547 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 548 | /*Codes_SRS_MULTITREE_99_043:[ If destination is NULL, the function shall return MULTITREE_INVALID_ARG.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 549 | else if (destination == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 550 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 551 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 552 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 553 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 554 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 555 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 556 | MULTITREE_HANDLE_DATA * node = (MULTITREE_HANDLE_DATA*)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 557 | /*Codes_SRS_MULTITREE_99_044:[ If there is no value in the node then MULTITREE_EMPTY_VALUE shall be returned.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 558 | if (node->value == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 559 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 560 | result = MULTITREE_EMPTY_VALUE; |
| XinZhangMS | 0:f7f1f0d76dd6 | 561 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 562 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 563 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 564 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 565 | /*Codes_SRS_MULTITREE_99_041:[This function updates the *destination parameter to the internally stored value.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 566 | *destination = node->value; |
| XinZhangMS | 0:f7f1f0d76dd6 | 567 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 568 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 569 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 570 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 571 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 572 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 573 | MULTITREE_RESULT MultiTree_SetValue(MULTITREE_HANDLE treeHandle, void* value) |
| XinZhangMS | 0:f7f1f0d76dd6 | 574 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 575 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 576 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 577 | /* Codes_SRS_MULTITREE_99_074:[ If any argument is NULL, MultiTree_SetValue shall return MULTITREE_INVALID_ARG.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 578 | if ((treeHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 579 | (value == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 580 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 581 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 582 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 583 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 584 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 585 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 586 | MULTITREE_HANDLE_DATA * node = (MULTITREE_HANDLE_DATA*)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 587 | if (node->value != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 588 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 589 | /* Codes_SRS_MULTITREE_99_076:[ If the node already has a value then MultiTree_SetValue shall return MULTITREE_ALREADY_HAS_A_VALUE.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 590 | result = MULTITREE_ALREADY_HAS_A_VALUE; |
| XinZhangMS | 0:f7f1f0d76dd6 | 591 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 592 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 593 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 594 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 595 | /* Codes_SRS_MULTITREE_99_072:[ MultiTree_SetValue shall set the value of the node indicated by the treeHandle argument to the value of the argument value.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 596 | if (node->cloneFunction(&node->value, value) != 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 597 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 598 | /* Codes_SRS_MULTITREE_99_075:[ MultiTree_SetValue shall return MULTITREE_ERROR to indicate any other error.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 599 | result = MULTITREE_ERROR; |
| XinZhangMS | 0:f7f1f0d76dd6 | 600 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 601 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 602 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 603 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 604 | /* Codes_SRS_MULTITREE_99_073:[ On success, MultiTree_SetValue shall return MULTITREE_OK.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 605 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 606 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 607 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 608 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 609 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 610 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 611 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 612 | void MultiTree_Destroy(MULTITREE_HANDLE treeHandle) |
| XinZhangMS | 0:f7f1f0d76dd6 | 613 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 614 | if (treeHandle != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 615 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 616 | MULTITREE_HANDLE_DATA* node = (MULTITREE_HANDLE_DATA*)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 617 | size_t i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 618 | for (i = 0; i < node->nChildren;i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 619 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 620 | /*Codes_SRS_MULTITREE_99_047:[ This function frees any system resource used by the tree designated by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 621 | MultiTree_Destroy(node->children[i]); |
| XinZhangMS | 0:f7f1f0d76dd6 | 622 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 623 | /*Codes_SRS_MULTITREE_99_047:[ This function frees any system resource used by the tree designated by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 624 | if (node->children != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 625 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 626 | free(node->children); |
| XinZhangMS | 0:f7f1f0d76dd6 | 627 | node->children = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 628 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 629 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 630 | /*Codes_SRS_MULTITREE_99_047:[ This function frees any system resource used by the tree designated by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 631 | if (node->name != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 632 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 633 | free(node->name); |
| XinZhangMS | 0:f7f1f0d76dd6 | 634 | node->name = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 635 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 636 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 637 | /*Codes_SRS_MULTITREE_99_047:[ This function frees any system resource used by the tree designated by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 638 | if (node->value != NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 639 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 640 | node->freeFunction(node->value); |
| XinZhangMS | 0:f7f1f0d76dd6 | 641 | node->value = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 642 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 643 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 644 | /*Codes_SRS_MULTITREE_99_047:[ This function frees any system resource used by the tree designated by parameter treeHandle]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 645 | free(node); |
| XinZhangMS | 0:f7f1f0d76dd6 | 646 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 647 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 648 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 649 | MULTITREE_RESULT MultiTree_GetLeafValue(MULTITREE_HANDLE treeHandle, const char* leafPath, const void** destination) |
| XinZhangMS | 0:f7f1f0d76dd6 | 650 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 651 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 652 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 653 | /* Codes_SRS_MULTITREE_99_055:[ If any argument is NULL, MultiTree_GetLeafValue shall return MULTITREE_INVALID_ARG.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 654 | if ((treeHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 655 | (leafPath == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 656 | (destination == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 657 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 658 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 659 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 660 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 661 | /* Codes_SRS_MULTITREE_99_058:[ The last child designates the child that will receive the value. If a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 662 | else if (strlen(leafPath) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 663 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 664 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 665 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 666 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 667 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 668 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 669 | /*break the path into components*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 670 | /*find the first child name*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 671 | MULTITREE_HANDLE_DATA* node = (MULTITREE_HANDLE_DATA *)treeHandle; |
| XinZhangMS | 0:f7f1f0d76dd6 | 672 | const char* pos = leafPath; |
| XinZhangMS | 0:f7f1f0d76dd6 | 673 | const char * whereIsDelimiter; |
| XinZhangMS | 0:f7f1f0d76dd6 | 674 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 675 | /*if first character is / then skip it*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 676 | if (*pos == '/') |
| XinZhangMS | 0:f7f1f0d76dd6 | 677 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 678 | pos++; |
| XinZhangMS | 0:f7f1f0d76dd6 | 679 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 680 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 681 | if (*pos == '\0') |
| XinZhangMS | 0:f7f1f0d76dd6 | 682 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 683 | /* Codes_SRS_MULTITREE_99_069:[ If a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 684 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 685 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 686 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 687 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 688 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 689 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 690 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 691 | /* Codes_SRS_MULTITREE_99_056:[ The leafPath argument is a string in the following format: /child1/child12 or child1/child12.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 692 | /* Codes_SRS_MULTITREE_99_058:[ The last child designates the child that will receive the value.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 693 | while (*pos != '\0') |
| XinZhangMS | 0:f7f1f0d76dd6 | 694 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 695 | size_t i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 696 | size_t childCount = node->nChildren; |
| XinZhangMS | 0:f7f1f0d76dd6 | 697 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 698 | whereIsDelimiter = pos; |
| XinZhangMS | 0:f7f1f0d76dd6 | 699 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 700 | while ((*whereIsDelimiter != '/') && (*whereIsDelimiter != '\0')) |
| XinZhangMS | 0:f7f1f0d76dd6 | 701 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 702 | whereIsDelimiter++; |
| XinZhangMS | 0:f7f1f0d76dd6 | 703 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 704 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 705 | if (whereIsDelimiter == pos) |
| XinZhangMS | 0:f7f1f0d76dd6 | 706 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 707 | /* Codes_SRS_MULTITREE_99_069:[ If a child name is empty (such as in "/child1//child12"), MULTITREE_EMPTY_CHILD_NAME shall be returned.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 708 | result = MULTITREE_EMPTY_CHILD_NAME; |
| XinZhangMS | 0:f7f1f0d76dd6 | 709 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 710 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 711 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 712 | else if (childCount == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 713 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 714 | /* Codes_SRS_MULTITREE_99_071:[ When the child node is not found, MultiTree_GetLeafValue shall return MULTITREE_CHILD_NOT_FOUND.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 715 | result = MULTITREE_CHILD_NOT_FOUND; |
| XinZhangMS | 0:f7f1f0d76dd6 | 716 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 717 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 718 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 719 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 720 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 721 | for (i = 0; i < childCount; i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 722 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 723 | if (strncmp(node->children[i]->name, pos, whereIsDelimiter - pos) == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 724 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 725 | /* Codes_SRS_MULTITREE_99_057:[ Subsequent names designate hierarchical children in the tree.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 726 | node = node->children[i]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 727 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 728 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 729 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 730 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 731 | if (i == childCount) |
| XinZhangMS | 0:f7f1f0d76dd6 | 732 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 733 | /* Codes_SRS_MULTITREE_99_071:[ When the child node is not found, MultiTree_GetLeafValue shall return MULTITREE_CHILD_NOT_FOUND.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 734 | result = MULTITREE_CHILD_NOT_FOUND; |
| XinZhangMS | 0:f7f1f0d76dd6 | 735 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 736 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 737 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 738 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 739 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 740 | if (*whereIsDelimiter == '/') |
| XinZhangMS | 0:f7f1f0d76dd6 | 741 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 742 | pos = whereIsDelimiter + 1; |
| XinZhangMS | 0:f7f1f0d76dd6 | 743 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 744 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 745 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 746 | /* end of path */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 747 | pos = whereIsDelimiter; |
| XinZhangMS | 0:f7f1f0d76dd6 | 748 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 749 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 750 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 751 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 752 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 753 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 754 | if (*pos == 0) |
| XinZhangMS | 0:f7f1f0d76dd6 | 755 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 756 | if (node->value == NULL) |
| XinZhangMS | 0:f7f1f0d76dd6 | 757 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 758 | /* Codes_SRS_MULTITREE_99_070:[ If an attempt is made to get the value for a node that does not have a value set, then MultiTree_GetLeafValue shall return MULTITREE_EMPTY_VALUE.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 759 | result = MULTITREE_EMPTY_VALUE; |
| XinZhangMS | 0:f7f1f0d76dd6 | 760 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 761 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 762 | /*Codes_SRS_MULTITREE_99_053:[ MultiTree_GetLeafValue shall copy into the *destination argument the value of the node identified by the leafPath argument.]*/ |
| XinZhangMS | 0:f7f1f0d76dd6 | 763 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 764 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 765 | *destination = node->value; |
| XinZhangMS | 0:f7f1f0d76dd6 | 766 | /* Codes_SRS_MULTITREE_99_054:[ On success, MultiTree_GetLeafValue shall return MULTITREE_OK.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 767 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 768 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 769 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 770 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 771 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 772 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 773 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 774 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 775 | /* Codes_SRS_MULTITREE_99_077:[ MultiTree_DeleteChild shall remove the direct children node (no recursive search) set by childName.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 776 | MULTITREE_RESULT MultiTree_DeleteChild(MULTITREE_HANDLE treeHandle, const char* childName) |
| XinZhangMS | 0:f7f1f0d76dd6 | 777 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 778 | MULTITREE_RESULT result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 779 | /* Codes_SRS_MULTITREE_99_077:[ If any argument is NULL, MultiTree_DeleteChild shall return MULTITREE_INVALID_ARG.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 780 | if ((treeHandle == NULL) || |
| XinZhangMS | 0:f7f1f0d76dd6 | 781 | (childName == NULL)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 782 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 783 | result = MULTITREE_INVALID_ARG; |
| XinZhangMS | 0:f7f1f0d76dd6 | 784 | LogError("(result = %s)", ENUM_TO_STRING(MULTITREE_RESULT, result)); |
| XinZhangMS | 0:f7f1f0d76dd6 | 785 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 786 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 787 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 788 | size_t i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 789 | size_t childToRemove = treeHandle->nChildren; |
| XinZhangMS | 0:f7f1f0d76dd6 | 790 | MULTITREE_HANDLE treeToRemove = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 791 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 792 | for (i = 0; i < treeHandle->nChildren; i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 793 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 794 | if (0 == strcmp(treeHandle->children[i]->name, childName)) |
| XinZhangMS | 0:f7f1f0d76dd6 | 795 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 796 | childToRemove = i; |
| XinZhangMS | 0:f7f1f0d76dd6 | 797 | treeToRemove = treeHandle->children[childToRemove]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 798 | break; |
| XinZhangMS | 0:f7f1f0d76dd6 | 799 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 800 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 801 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 802 | if (i == treeHandle->nChildren) |
| XinZhangMS | 0:f7f1f0d76dd6 | 803 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 804 | /* Codes_SRS_MULTITREE_99_079:[If childName is not found, MultiTree_DeleteChild shall return MULTITREE_CHILD_NOT_FOUND.] */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 805 | result = MULTITREE_CHILD_NOT_FOUND; |
| XinZhangMS | 0:f7f1f0d76dd6 | 806 | // Don't log error; this function is best effort only. Caller will determine actual error state. |
| XinZhangMS | 0:f7f1f0d76dd6 | 807 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 808 | else |
| XinZhangMS | 0:f7f1f0d76dd6 | 809 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 810 | for (i = childToRemove; i < treeHandle->nChildren - 1; i++) |
| XinZhangMS | 0:f7f1f0d76dd6 | 811 | { |
| XinZhangMS | 0:f7f1f0d76dd6 | 812 | treeHandle->children[i] = treeHandle->children[i+1]; |
| XinZhangMS | 0:f7f1f0d76dd6 | 813 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 814 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 815 | /* Codes_SRS_MULTITREE_99_077:[ MultiTree_DeleteChild shall remove the direct children node (no recursive search) set by childName */ |
| XinZhangMS | 0:f7f1f0d76dd6 | 816 | MultiTree_Destroy(treeToRemove); |
| XinZhangMS | 0:f7f1f0d76dd6 | 817 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 818 | // Even though this isn't reachable anymore after decrementing count, NULL out for cleanliness |
| XinZhangMS | 0:f7f1f0d76dd6 | 819 | treeHandle->children[treeHandle->nChildren - 1] = NULL; |
| XinZhangMS | 0:f7f1f0d76dd6 | 820 | treeHandle->nChildren = treeHandle->nChildren - 1; |
| XinZhangMS | 0:f7f1f0d76dd6 | 821 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 822 | result = MULTITREE_OK; |
| XinZhangMS | 0:f7f1f0d76dd6 | 823 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 824 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 825 | |
| XinZhangMS | 0:f7f1f0d76dd6 | 826 | return result; |
| XinZhangMS | 0:f7f1f0d76dd6 | 827 | } |
| XinZhangMS | 0:f7f1f0d76dd6 | 828 |