ua_nodes.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584
  1. /* This Source Code Form is subject to the terms of the Mozilla Public
  2. * License, v. 2.0. If a copy of the MPL was not distributed with this
  3. * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
  4. #include "ua_server_internal.h"
  5. #include "ua_types_encoding_binary.h"
  6. /* There is no UA_Node_new() method here. Creating nodes is part of the
  7. * NodeStore layer */
  8. void UA_Node_deleteMembers(UA_Node *node) {
  9. /* Delete standard content */
  10. UA_NodeId_deleteMembers(&node->nodeId);
  11. UA_QualifiedName_deleteMembers(&node->browseName);
  12. UA_LocalizedText_deleteMembers(&node->displayName);
  13. UA_LocalizedText_deleteMembers(&node->description);
  14. /* Delete references */
  15. UA_Node_deleteReferences(node);
  16. /* Delete unique content of the nodeclass */
  17. switch(node->nodeClass) {
  18. case UA_NODECLASS_OBJECT:
  19. break;
  20. case UA_NODECLASS_METHOD:
  21. break;
  22. case UA_NODECLASS_OBJECTTYPE:
  23. break;
  24. case UA_NODECLASS_VARIABLE:
  25. case UA_NODECLASS_VARIABLETYPE: {
  26. UA_VariableNode *p = (UA_VariableNode*)node;
  27. UA_NodeId_deleteMembers(&p->dataType);
  28. UA_Array_delete(p->arrayDimensions, p->arrayDimensionsSize,
  29. &UA_TYPES[UA_TYPES_INT32]);
  30. p->arrayDimensions = NULL;
  31. p->arrayDimensionsSize = 0;
  32. if(p->valueSource == UA_VALUESOURCE_DATA)
  33. UA_DataValue_deleteMembers(&p->value.data.value);
  34. break;
  35. }
  36. case UA_NODECLASS_REFERENCETYPE: {
  37. UA_ReferenceTypeNode *p = (UA_ReferenceTypeNode*)node;
  38. UA_LocalizedText_deleteMembers(&p->inverseName);
  39. break;
  40. }
  41. case UA_NODECLASS_DATATYPE:
  42. break;
  43. case UA_NODECLASS_VIEW:
  44. break;
  45. default:
  46. break;
  47. }
  48. }
  49. static UA_StatusCode
  50. UA_ObjectNode_copy(const UA_ObjectNode *src, UA_ObjectNode *dst) {
  51. dst->eventNotifier = src->eventNotifier;
  52. return UA_STATUSCODE_GOOD;
  53. }
  54. static UA_StatusCode
  55. UA_CommonVariableNode_copy(const UA_VariableNode *src, UA_VariableNode *dst) {
  56. UA_StatusCode retval = UA_Array_copy(src->arrayDimensions,
  57. src->arrayDimensionsSize,
  58. (void**)&dst->arrayDimensions,
  59. &UA_TYPES[UA_TYPES_INT32]);
  60. if(retval != UA_STATUSCODE_GOOD)
  61. return retval;
  62. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  63. retval = UA_NodeId_copy(&src->dataType, &dst->dataType);
  64. dst->valueRank = src->valueRank;
  65. dst->valueSource = src->valueSource;
  66. if(src->valueSource == UA_VALUESOURCE_DATA) {
  67. retval |= UA_DataValue_copy(&src->value.data.value,
  68. &dst->value.data.value);
  69. dst->value.data.callback = src->value.data.callback;
  70. } else
  71. dst->value.dataSource = src->value.dataSource;
  72. return retval;
  73. }
  74. static UA_StatusCode
  75. UA_VariableNode_copy(const UA_VariableNode *src, UA_VariableNode *dst) {
  76. UA_StatusCode retval = UA_CommonVariableNode_copy(src, dst);
  77. dst->accessLevel = src->accessLevel;
  78. dst->minimumSamplingInterval = src->minimumSamplingInterval;
  79. dst->historizing = src->historizing;
  80. return retval;
  81. }
  82. static UA_StatusCode
  83. UA_VariableTypeNode_copy(const UA_VariableTypeNode *src,
  84. UA_VariableTypeNode *dst) {
  85. UA_StatusCode retval = UA_CommonVariableNode_copy((const UA_VariableNode*)src,
  86. (UA_VariableNode*)dst);
  87. dst->isAbstract = src->isAbstract;
  88. return retval;
  89. }
  90. static UA_StatusCode
  91. UA_MethodNode_copy(const UA_MethodNode *src, UA_MethodNode *dst) {
  92. dst->executable = src->executable;
  93. dst->method = src->method;
  94. return UA_STATUSCODE_GOOD;
  95. }
  96. static UA_StatusCode
  97. UA_ObjectTypeNode_copy(const UA_ObjectTypeNode *src, UA_ObjectTypeNode *dst) {
  98. dst->isAbstract = src->isAbstract;
  99. dst->lifecycle = src->lifecycle;
  100. return UA_STATUSCODE_GOOD;
  101. }
  102. static UA_StatusCode
  103. UA_ReferenceTypeNode_copy(const UA_ReferenceTypeNode *src,
  104. UA_ReferenceTypeNode *dst) {
  105. UA_StatusCode retval = UA_LocalizedText_copy(&src->inverseName,
  106. &dst->inverseName);
  107. dst->isAbstract = src->isAbstract;
  108. dst->symmetric = src->symmetric;
  109. return retval;
  110. }
  111. static UA_StatusCode
  112. UA_DataTypeNode_copy(const UA_DataTypeNode *src, UA_DataTypeNode *dst) {
  113. dst->isAbstract = src->isAbstract;
  114. return UA_STATUSCODE_GOOD;
  115. }
  116. static UA_StatusCode
  117. UA_ViewNode_copy(const UA_ViewNode *src, UA_ViewNode *dst) {
  118. dst->containsNoLoops = src->containsNoLoops;
  119. dst->eventNotifier = src->eventNotifier;
  120. return UA_STATUSCODE_GOOD;
  121. }
  122. UA_StatusCode
  123. UA_Node_copy(const UA_Node *src, UA_Node *dst) {
  124. if(src->nodeClass != dst->nodeClass)
  125. return UA_STATUSCODE_BADINTERNALERROR;
  126. /* Copy standard content */
  127. UA_StatusCode retval = UA_NodeId_copy(&src->nodeId, &dst->nodeId);
  128. retval |= UA_QualifiedName_copy(&src->browseName, &dst->browseName);
  129. retval |= UA_LocalizedText_copy(&src->displayName, &dst->displayName);
  130. retval |= UA_LocalizedText_copy(&src->description, &dst->description);
  131. dst->writeMask = src->writeMask;
  132. dst->context = src->context;
  133. if(retval != UA_STATUSCODE_GOOD) {
  134. UA_Node_deleteMembers(dst);
  135. return retval;
  136. }
  137. /* Copy the references */
  138. dst->references = NULL;
  139. if(src->referencesSize > 0) {
  140. dst->references = (UA_NodeReferenceKind*)
  141. UA_calloc(src->referencesSize, sizeof(UA_NodeReferenceKind));
  142. if(!dst->references) {
  143. UA_Node_deleteMembers(dst);
  144. return UA_STATUSCODE_BADOUTOFMEMORY;
  145. }
  146. dst->referencesSize = src->referencesSize;
  147. for(size_t i = 0; i < src->referencesSize; ++i) {
  148. UA_NodeReferenceKind *srefs = &src->references[i];
  149. UA_NodeReferenceKind *drefs = &dst->references[i];
  150. drefs->isInverse = srefs->isInverse;
  151. retval = UA_NodeId_copy(&srefs->referenceTypeId, &drefs->referenceTypeId);
  152. if(retval != UA_STATUSCODE_GOOD)
  153. break;
  154. retval = UA_Array_copy(srefs->targetIds, srefs->targetIdsSize,
  155. (void**)&drefs->targetIds,
  156. &UA_TYPES[UA_TYPES_EXPANDEDNODEID]);
  157. if(retval != UA_STATUSCODE_GOOD)
  158. break;
  159. drefs->targetIdsSize = srefs->targetIdsSize;
  160. }
  161. if(retval != UA_STATUSCODE_GOOD) {
  162. UA_Node_deleteMembers(dst);
  163. return retval;
  164. }
  165. }
  166. /* Copy unique content of the nodeclass */
  167. switch(src->nodeClass) {
  168. case UA_NODECLASS_OBJECT:
  169. retval = UA_ObjectNode_copy((const UA_ObjectNode*)src, (UA_ObjectNode*)dst);
  170. break;
  171. case UA_NODECLASS_VARIABLE:
  172. retval = UA_VariableNode_copy((const UA_VariableNode*)src, (UA_VariableNode*)dst);
  173. break;
  174. case UA_NODECLASS_METHOD:
  175. retval = UA_MethodNode_copy((const UA_MethodNode*)src, (UA_MethodNode*)dst);
  176. break;
  177. case UA_NODECLASS_OBJECTTYPE:
  178. retval = UA_ObjectTypeNode_copy((const UA_ObjectTypeNode*)src, (UA_ObjectTypeNode*)dst);
  179. break;
  180. case UA_NODECLASS_VARIABLETYPE:
  181. retval = UA_VariableTypeNode_copy((const UA_VariableTypeNode*)src, (UA_VariableTypeNode*)dst);
  182. break;
  183. case UA_NODECLASS_REFERENCETYPE:
  184. retval = UA_ReferenceTypeNode_copy((const UA_ReferenceTypeNode*)src, (UA_ReferenceTypeNode*)dst);
  185. break;
  186. case UA_NODECLASS_DATATYPE:
  187. retval = UA_DataTypeNode_copy((const UA_DataTypeNode*)src, (UA_DataTypeNode*)dst);
  188. break;
  189. case UA_NODECLASS_VIEW:
  190. retval = UA_ViewNode_copy((const UA_ViewNode*)src, (UA_ViewNode*)dst);
  191. break;
  192. default:
  193. break;
  194. }
  195. if(retval != UA_STATUSCODE_GOOD)
  196. UA_Node_deleteMembers(dst);
  197. return retval;
  198. }
  199. UA_Node *
  200. UA_Node_copy_alloc(const UA_Node *src) {
  201. // use dstPtr to trick static code analysis in accepting dirty cast
  202. void *dstPtr;
  203. switch(src->nodeClass) {
  204. case UA_NODECLASS_OBJECT:
  205. dstPtr = UA_malloc(sizeof(UA_ObjectNode));
  206. break;
  207. case UA_NODECLASS_VARIABLE:
  208. dstPtr =UA_malloc(sizeof(UA_VariableNode));
  209. break;
  210. case UA_NODECLASS_METHOD:
  211. dstPtr = UA_malloc(sizeof(UA_MethodNode));
  212. break;
  213. case UA_NODECLASS_OBJECTTYPE:
  214. dstPtr = UA_malloc(sizeof(UA_ObjectTypeNode));
  215. break;
  216. case UA_NODECLASS_VARIABLETYPE:
  217. dstPtr = UA_malloc(sizeof(UA_VariableTypeNode));
  218. break;
  219. case UA_NODECLASS_REFERENCETYPE:
  220. dstPtr = UA_malloc(sizeof(UA_ReferenceTypeNode));
  221. break;
  222. case UA_NODECLASS_DATATYPE:
  223. dstPtr = UA_malloc(sizeof(UA_DataTypeNode));
  224. break;
  225. case UA_NODECLASS_VIEW:
  226. dstPtr = UA_malloc(sizeof(UA_ViewNode));
  227. break;
  228. default:
  229. return NULL;
  230. }
  231. UA_Node *dst = (UA_Node*)dstPtr;
  232. dst->nodeClass = src->nodeClass;
  233. UA_StatusCode retval = UA_Node_copy(src, dst);
  234. if (retval != UA_STATUSCODE_GOOD){
  235. UA_free(dst);
  236. return NULL;
  237. }
  238. return dst;
  239. }
  240. /******************************/
  241. /* Copy Attributes into Nodes */
  242. /******************************/
  243. static UA_StatusCode
  244. copyStandardAttributes(UA_Node *node, const UA_NodeAttributes *attr) {
  245. /* retval = UA_NodeId_copy(&item->requestedNewNodeId.nodeId, &node->nodeId); */
  246. /* retval |= UA_QualifiedName_copy(&item->browseName, &node->browseName); */
  247. UA_StatusCode retval = UA_LocalizedText_copy(&attr->displayName,
  248. &node->displayName);
  249. retval |= UA_LocalizedText_copy(&attr->description, &node->description);
  250. node->writeMask = attr->writeMask;
  251. return retval;
  252. }
  253. static UA_StatusCode
  254. copyCommonVariableAttributes(UA_VariableNode *node,
  255. const UA_VariableAttributes *attr) {
  256. /* Copy the array dimensions */
  257. UA_StatusCode retval =
  258. UA_Array_copy(attr->arrayDimensions, attr->arrayDimensionsSize,
  259. (void**)&node->arrayDimensions, &UA_TYPES[UA_TYPES_UINT32]);
  260. if(retval != UA_STATUSCODE_GOOD)
  261. return retval;
  262. node->arrayDimensionsSize = attr->arrayDimensionsSize;
  263. /* Data type and value rank */
  264. retval |= UA_NodeId_copy(&attr->dataType, &node->dataType);
  265. node->valueRank = attr->valueRank;
  266. /* Copy the value */
  267. node->valueSource = UA_VALUESOURCE_DATA;
  268. UA_NodeId extensionObject = UA_NODEID_NUMERIC(0, UA_NS0ID_STRUCTURE);
  269. /* if we have an extension object which is still encoded (e.g. from the nodeset compiler)
  270. * we need to decode it and set the decoded value instead of the encoded object */
  271. UA_Boolean valueSet = false;
  272. if (attr->value.type != NULL && UA_NodeId_equal(&attr->value.type->typeId, &extensionObject)) {
  273. const UA_ExtensionObject *obj = (const UA_ExtensionObject *)attr->value.data;
  274. if (obj->encoding == UA_EXTENSIONOBJECT_ENCODED_BYTESTRING) {
  275. /* TODO: Once we generate type description in the nodeset compiler,
  276. * UA_findDatatypeByBinary can be made internal to the decoding
  277. * layer. */
  278. const UA_DataType *type = UA_findDataTypeByBinary(&obj->content.encoded.typeId);
  279. if (type) {
  280. void *dst = UA_Array_new(attr->value.arrayLength, type);
  281. uint8_t *tmpPos = (uint8_t *)dst;
  282. for (size_t i=0; i<attr->value.arrayLength; i++) {
  283. size_t offset =0;
  284. const UA_ExtensionObject *curr = &((const UA_ExtensionObject *)attr->value.data)[i];
  285. UA_StatusCode ret = UA_decodeBinary(&curr->content.encoded.body, &offset, tmpPos, type, 0, NULL);
  286. if (ret != UA_STATUSCODE_GOOD) {
  287. return ret;
  288. }
  289. tmpPos += type->memSize;
  290. }
  291. UA_Variant_setArray(&node->value.data.value.value, dst, attr->value.arrayLength, type);
  292. valueSet = true;
  293. }
  294. }
  295. }
  296. if (!valueSet)
  297. retval |= UA_Variant_copy(&attr->value, &node->value.data.value.value);
  298. node->value.data.value.hasValue = true;
  299. return retval;
  300. }
  301. static UA_StatusCode
  302. copyVariableNodeAttributes(UA_VariableNode *vnode,
  303. const UA_VariableAttributes *attr) {
  304. vnode->accessLevel = attr->accessLevel;
  305. vnode->historizing = attr->historizing;
  306. vnode->minimumSamplingInterval = attr->minimumSamplingInterval;
  307. return copyCommonVariableAttributes(vnode, attr);
  308. }
  309. static UA_StatusCode
  310. copyVariableTypeNodeAttributes(UA_VariableTypeNode *vtnode,
  311. const UA_VariableTypeAttributes *attr) {
  312. vtnode->isAbstract = attr->isAbstract;
  313. return copyCommonVariableAttributes((UA_VariableNode*)vtnode,
  314. (const UA_VariableAttributes*)attr);
  315. }
  316. static UA_StatusCode
  317. copyObjectNodeAttributes(UA_ObjectNode *onode, const UA_ObjectAttributes *attr) {
  318. onode->eventNotifier = attr->eventNotifier;
  319. return UA_STATUSCODE_GOOD;
  320. }
  321. static UA_StatusCode
  322. copyReferenceTypeNodeAttributes(UA_ReferenceTypeNode *rtnode,
  323. const UA_ReferenceTypeAttributes *attr) {
  324. rtnode->isAbstract = attr->isAbstract;
  325. rtnode->symmetric = attr->symmetric;
  326. return UA_LocalizedText_copy(&attr->inverseName, &rtnode->inverseName);
  327. }
  328. static UA_StatusCode
  329. copyObjectTypeNodeAttributes(UA_ObjectTypeNode *otnode,
  330. const UA_ObjectTypeAttributes *attr) {
  331. otnode->isAbstract = attr->isAbstract;
  332. return UA_STATUSCODE_GOOD;
  333. }
  334. static UA_StatusCode
  335. copyViewNodeAttributes(UA_ViewNode *vnode, const UA_ViewAttributes *attr) {
  336. vnode->containsNoLoops = attr->containsNoLoops;
  337. vnode->eventNotifier = attr->eventNotifier;
  338. return UA_STATUSCODE_GOOD;
  339. }
  340. static UA_StatusCode
  341. copyDataTypeNodeAttributes(UA_DataTypeNode *dtnode,
  342. const UA_DataTypeAttributes *attr) {
  343. dtnode->isAbstract = attr->isAbstract;
  344. return UA_STATUSCODE_GOOD;
  345. }
  346. static UA_StatusCode
  347. copyMethodNodeAttributes(UA_MethodNode *mnode,
  348. const UA_MethodAttributes *attr) {
  349. mnode->executable = attr->executable;
  350. return UA_STATUSCODE_GOOD;
  351. }
  352. #define CHECK_ATTRIBUTES(TYPE) \
  353. if(attributeType != &UA_TYPES[UA_TYPES_##TYPE]) { \
  354. retval = UA_STATUSCODE_BADNODEATTRIBUTESINVALID; \
  355. break; \
  356. }
  357. UA_StatusCode
  358. UA_Node_setAttributes(UA_Node *node, const void *attributes,
  359. const UA_DataType *attributeType) {
  360. /* Copy the attributes into the node */
  361. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  362. switch(node->nodeClass) {
  363. case UA_NODECLASS_OBJECT:
  364. CHECK_ATTRIBUTES(OBJECTATTRIBUTES);
  365. retval = copyObjectNodeAttributes((UA_ObjectNode*)node,
  366. (const UA_ObjectAttributes*)attributes);
  367. break;
  368. case UA_NODECLASS_VARIABLE:
  369. CHECK_ATTRIBUTES(VARIABLEATTRIBUTES);
  370. retval = copyVariableNodeAttributes((UA_VariableNode*)node,
  371. (const UA_VariableAttributes*)attributes);
  372. break;
  373. case UA_NODECLASS_OBJECTTYPE:
  374. CHECK_ATTRIBUTES(OBJECTTYPEATTRIBUTES);
  375. retval = copyObjectTypeNodeAttributes((UA_ObjectTypeNode*)node,
  376. (const UA_ObjectTypeAttributes*)attributes);
  377. break;
  378. case UA_NODECLASS_VARIABLETYPE:
  379. CHECK_ATTRIBUTES(VARIABLETYPEATTRIBUTES);
  380. retval = copyVariableTypeNodeAttributes((UA_VariableTypeNode*)node,
  381. (const UA_VariableTypeAttributes*)attributes);
  382. break;
  383. case UA_NODECLASS_REFERENCETYPE:
  384. CHECK_ATTRIBUTES(REFERENCETYPEATTRIBUTES);
  385. retval = copyReferenceTypeNodeAttributes((UA_ReferenceTypeNode*)node,
  386. (const UA_ReferenceTypeAttributes*)attributes);
  387. break;
  388. case UA_NODECLASS_DATATYPE:
  389. CHECK_ATTRIBUTES(DATATYPEATTRIBUTES);
  390. retval = copyDataTypeNodeAttributes((UA_DataTypeNode*)node,
  391. (const UA_DataTypeAttributes*)attributes);
  392. break;
  393. case UA_NODECLASS_VIEW:
  394. CHECK_ATTRIBUTES(VIEWATTRIBUTES);
  395. retval = copyViewNodeAttributes((UA_ViewNode*)node,
  396. (const UA_ViewAttributes*)attributes);
  397. break;
  398. case UA_NODECLASS_METHOD:
  399. CHECK_ATTRIBUTES(METHODATTRIBUTES);
  400. retval = copyMethodNodeAttributes((UA_MethodNode*)node,
  401. (const UA_MethodAttributes*)attributes);
  402. break;
  403. case UA_NODECLASS_UNSPECIFIED:
  404. default:
  405. retval = UA_STATUSCODE_BADNODECLASSINVALID;
  406. }
  407. if(retval == UA_STATUSCODE_GOOD)
  408. retval = copyStandardAttributes(node, (const UA_NodeAttributes*)attributes);
  409. if(retval != UA_STATUSCODE_GOOD)
  410. UA_Node_deleteMembers(node);
  411. return retval;
  412. }
  413. /*********************/
  414. /* Manage References */
  415. /*********************/
  416. static UA_StatusCode
  417. addReferenceTarget(UA_NodeReferenceKind *refs, const UA_ExpandedNodeId *target) {
  418. UA_ExpandedNodeId *targets =
  419. (UA_ExpandedNodeId*) UA_realloc(refs->targetIds,
  420. sizeof(UA_ExpandedNodeId) * (refs->targetIdsSize+1));
  421. if(!targets)
  422. return UA_STATUSCODE_BADOUTOFMEMORY;
  423. refs->targetIds = targets;
  424. UA_StatusCode retval =
  425. UA_ExpandedNodeId_copy(target, &refs->targetIds[refs->targetIdsSize]);
  426. if(retval == UA_STATUSCODE_GOOD) {
  427. refs->targetIdsSize++;
  428. } else if(refs->targetIdsSize == 0) {
  429. /* We had zero references before (realloc was a malloc) */
  430. UA_free(refs->targetIds);
  431. refs->targetIds = NULL;
  432. }
  433. return retval;
  434. }
  435. static UA_StatusCode
  436. addReferenceKind(UA_Node *node, const UA_AddReferencesItem *item) {
  437. UA_NodeReferenceKind *refs =
  438. (UA_NodeReferenceKind*)UA_realloc(node->references,
  439. sizeof(UA_NodeReferenceKind) * (node->referencesSize+1));
  440. if(!refs)
  441. return UA_STATUSCODE_BADOUTOFMEMORY;
  442. node->references = refs;
  443. UA_NodeReferenceKind *newRef = &refs[node->referencesSize];
  444. memset(newRef, 0, sizeof(UA_NodeReferenceKind));
  445. newRef->isInverse = !item->isForward;
  446. UA_StatusCode retval = UA_NodeId_copy(&item->referenceTypeId, &newRef->referenceTypeId);
  447. retval |= addReferenceTarget(newRef, &item->targetNodeId);
  448. if(retval == UA_STATUSCODE_GOOD) {
  449. node->referencesSize++;
  450. } else {
  451. UA_NodeId_deleteMembers(&newRef->referenceTypeId);
  452. if(node->referencesSize == 0) {
  453. UA_free(node->references);
  454. node->references = NULL;
  455. }
  456. }
  457. return retval;
  458. }
  459. UA_StatusCode
  460. UA_Node_addReference(UA_Node *node, const UA_AddReferencesItem *item) {
  461. for(size_t i = 0; i < node->referencesSize; ++i) {
  462. UA_NodeReferenceKind *refs = &node->references[i];
  463. if(refs->isInverse == item->isForward)
  464. continue;
  465. if(!UA_NodeId_equal(&refs->referenceTypeId, &item->referenceTypeId))
  466. continue;
  467. return addReferenceTarget(refs, &item->targetNodeId);
  468. }
  469. return addReferenceKind(node, item);
  470. }
  471. UA_StatusCode
  472. UA_Node_deleteReference(UA_Node *node, const UA_DeleteReferencesItem *item) {
  473. for(size_t i = node->referencesSize; i > 0; --i) {
  474. UA_NodeReferenceKind *refs = &node->references[i-1];
  475. if(item->isForward == refs->isInverse)
  476. continue;
  477. if(!UA_NodeId_equal(&item->referenceTypeId, &refs->referenceTypeId))
  478. continue;
  479. for(size_t j = refs->targetIdsSize; j > 0; --j) {
  480. if(!UA_NodeId_equal(&item->targetNodeId.nodeId, &refs->targetIds[j-1].nodeId))
  481. continue;
  482. /* Ok, delete the reference */
  483. UA_ExpandedNodeId_deleteMembers(&refs->targetIds[j-1]);
  484. refs->targetIdsSize--;
  485. /* One matching target remaining */
  486. if(refs->targetIdsSize > 0) {
  487. if(j-1 != refs->targetIdsSize) // avoid valgrind error: Source
  488. // and destination overlap in
  489. // memcpy
  490. refs->targetIds[j-1] = refs->targetIds[refs->targetIdsSize];
  491. return UA_STATUSCODE_GOOD;
  492. }
  493. /* Remove refs */
  494. UA_free(refs->targetIds);
  495. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  496. node->referencesSize--;
  497. if(node->referencesSize > 0) {
  498. if(i-1 != node->referencesSize) // avoid valgrind error: Source
  499. // and destination overlap in
  500. // memcpy
  501. node->references[i-1] = node->references[node->referencesSize];
  502. return UA_STATUSCODE_GOOD;
  503. }
  504. /* Remove the node references */
  505. UA_free(node->references);
  506. node->references = NULL;
  507. return UA_STATUSCODE_GOOD;
  508. }
  509. }
  510. return UA_STATUSCODE_UNCERTAINREFERENCENOTDELETED;
  511. }
  512. void UA_Node_deleteReferences(UA_Node *node) {
  513. for(size_t i = 0; i < node->referencesSize; ++i) {
  514. UA_NodeReferenceKind *refs = &node->references[i];
  515. UA_Array_delete(refs->targetIds, refs->targetIdsSize, &UA_TYPES[UA_TYPES_EXPANDEDNODEID]);
  516. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  517. }
  518. if(node->references)
  519. UA_free(node->references);
  520. node->references = NULL;
  521. node->referencesSize = 0;
  522. }