ua_nodes.c 23 KB

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