ua_nodes.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655
  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 = UA_LocalizedText_copy(&attr->displayName,
  260. &node->displayName);
  261. retval |= UA_LocalizedText_copy(&attr->description, &node->description);
  262. node->writeMask = attr->writeMask;
  263. return retval;
  264. }
  265. static UA_StatusCode
  266. copyCommonVariableAttributes(UA_VariableNode *node,
  267. const UA_VariableAttributes *attr) {
  268. /* Copy the array dimensions */
  269. UA_StatusCode retval =
  270. UA_Array_copy(attr->arrayDimensions, attr->arrayDimensionsSize,
  271. (void**)&node->arrayDimensions, &UA_TYPES[UA_TYPES_UINT32]);
  272. if(retval != UA_STATUSCODE_GOOD)
  273. return retval;
  274. node->arrayDimensionsSize = attr->arrayDimensionsSize;
  275. /* Data type and value rank */
  276. retval |= UA_NodeId_copy(&attr->dataType, &node->dataType);
  277. node->valueRank = attr->valueRank;
  278. /* Copy the value */
  279. node->valueSource = UA_VALUESOURCE_DATA;
  280. UA_NodeId extensionObject = UA_NODEID_NUMERIC(0, UA_NS0ID_STRUCTURE);
  281. /* if we have an extension object which is still encoded (e.g. from the nodeset compiler)
  282. * we need to decode it and set the decoded value instead of the encoded object */
  283. UA_Boolean valueSet = false;
  284. if(attr->value.type != NULL && UA_NodeId_equal(&attr->value.type->typeId, &extensionObject)) {
  285. if (attr->value.data == UA_EMPTY_ARRAY_SENTINEL) {
  286. /* do nothing since we got an empty array of extension objects */
  287. return UA_STATUSCODE_GOOD;
  288. }
  289. const UA_ExtensionObject *obj = (const UA_ExtensionObject *)attr->value.data;
  290. if(obj && obj->encoding == UA_EXTENSIONOBJECT_ENCODED_BYTESTRING) {
  291. /* TODO: Once we generate type description in the nodeset compiler,
  292. * UA_findDatatypeByBinary can be made internal to the decoding
  293. * layer. */
  294. const UA_DataType *type = UA_findDataTypeByBinary(&obj->content.encoded.typeId);
  295. if(type) {
  296. void *dst = UA_Array_new(attr->value.arrayLength, type);
  297. if (!dst) {
  298. return UA_STATUSCODE_BADOUTOFMEMORY;
  299. }
  300. uint8_t *tmpPos = (uint8_t *)dst;
  301. for(size_t i=0; i<attr->value.arrayLength; i++) {
  302. size_t offset =0;
  303. const UA_ExtensionObject *curr = &((const UA_ExtensionObject *)attr->value.data)[i];
  304. UA_StatusCode ret = UA_decodeBinary(&curr->content.encoded.body, &offset, tmpPos, type, NULL);
  305. if(ret != UA_STATUSCODE_GOOD) {
  306. return ret;
  307. }
  308. tmpPos += type->memSize;
  309. }
  310. UA_Variant_setArray(&node->value.data.value.value, dst, attr->value.arrayLength, type);
  311. valueSet = true;
  312. }
  313. }
  314. }
  315. if(!valueSet)
  316. retval |= UA_Variant_copy(&attr->value, &node->value.data.value.value);
  317. node->value.data.value.hasValue = true;
  318. return retval;
  319. }
  320. static UA_StatusCode
  321. copyVariableNodeAttributes(UA_VariableNode *vnode,
  322. const UA_VariableAttributes *attr) {
  323. vnode->accessLevel = attr->accessLevel;
  324. vnode->historizing = attr->historizing;
  325. vnode->minimumSamplingInterval = attr->minimumSamplingInterval;
  326. return copyCommonVariableAttributes(vnode, attr);
  327. }
  328. static UA_StatusCode
  329. copyVariableTypeNodeAttributes(UA_VariableTypeNode *vtnode,
  330. const UA_VariableTypeAttributes *attr) {
  331. vtnode->isAbstract = attr->isAbstract;
  332. return copyCommonVariableAttributes((UA_VariableNode*)vtnode,
  333. (const UA_VariableAttributes*)attr);
  334. }
  335. static UA_StatusCode
  336. copyObjectNodeAttributes(UA_ObjectNode *onode, const UA_ObjectAttributes *attr) {
  337. onode->eventNotifier = attr->eventNotifier;
  338. return UA_STATUSCODE_GOOD;
  339. }
  340. static UA_StatusCode
  341. copyReferenceTypeNodeAttributes(UA_ReferenceTypeNode *rtnode,
  342. const UA_ReferenceTypeAttributes *attr) {
  343. rtnode->isAbstract = attr->isAbstract;
  344. rtnode->symmetric = attr->symmetric;
  345. return UA_LocalizedText_copy(&attr->inverseName, &rtnode->inverseName);
  346. }
  347. static UA_StatusCode
  348. copyObjectTypeNodeAttributes(UA_ObjectTypeNode *otnode,
  349. const UA_ObjectTypeAttributes *attr) {
  350. otnode->isAbstract = attr->isAbstract;
  351. return UA_STATUSCODE_GOOD;
  352. }
  353. static UA_StatusCode
  354. copyViewNodeAttributes(UA_ViewNode *vnode, const UA_ViewAttributes *attr) {
  355. vnode->containsNoLoops = attr->containsNoLoops;
  356. vnode->eventNotifier = attr->eventNotifier;
  357. return UA_STATUSCODE_GOOD;
  358. }
  359. static UA_StatusCode
  360. copyDataTypeNodeAttributes(UA_DataTypeNode *dtnode,
  361. const UA_DataTypeAttributes *attr) {
  362. dtnode->isAbstract = attr->isAbstract;
  363. return UA_STATUSCODE_GOOD;
  364. }
  365. static UA_StatusCode
  366. copyMethodNodeAttributes(UA_MethodNode *mnode,
  367. const UA_MethodAttributes *attr) {
  368. mnode->executable = attr->executable;
  369. return UA_STATUSCODE_GOOD;
  370. }
  371. #define CHECK_ATTRIBUTES(TYPE) \
  372. if(attributeType != &UA_TYPES[UA_TYPES_##TYPE]) { \
  373. retval = UA_STATUSCODE_BADNODEATTRIBUTESINVALID; \
  374. break; \
  375. }
  376. UA_StatusCode
  377. UA_Node_setAttributes(UA_Node *node, const void *attributes,
  378. const UA_DataType *attributeType) {
  379. /* Copy the attributes into the node */
  380. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  381. switch(node->nodeClass) {
  382. case UA_NODECLASS_OBJECT:
  383. CHECK_ATTRIBUTES(OBJECTATTRIBUTES);
  384. retval = copyObjectNodeAttributes((UA_ObjectNode*)node,
  385. (const UA_ObjectAttributes*)attributes);
  386. break;
  387. case UA_NODECLASS_VARIABLE:
  388. CHECK_ATTRIBUTES(VARIABLEATTRIBUTES);
  389. retval = copyVariableNodeAttributes((UA_VariableNode*)node,
  390. (const UA_VariableAttributes*)attributes);
  391. break;
  392. case UA_NODECLASS_OBJECTTYPE:
  393. CHECK_ATTRIBUTES(OBJECTTYPEATTRIBUTES);
  394. retval = copyObjectTypeNodeAttributes((UA_ObjectTypeNode*)node,
  395. (const UA_ObjectTypeAttributes*)attributes);
  396. break;
  397. case UA_NODECLASS_VARIABLETYPE:
  398. CHECK_ATTRIBUTES(VARIABLETYPEATTRIBUTES);
  399. retval = copyVariableTypeNodeAttributes((UA_VariableTypeNode*)node,
  400. (const UA_VariableTypeAttributes*)attributes);
  401. break;
  402. case UA_NODECLASS_REFERENCETYPE:
  403. CHECK_ATTRIBUTES(REFERENCETYPEATTRIBUTES);
  404. retval = copyReferenceTypeNodeAttributes((UA_ReferenceTypeNode*)node,
  405. (const UA_ReferenceTypeAttributes*)attributes);
  406. break;
  407. case UA_NODECLASS_DATATYPE:
  408. CHECK_ATTRIBUTES(DATATYPEATTRIBUTES);
  409. retval = copyDataTypeNodeAttributes((UA_DataTypeNode*)node,
  410. (const UA_DataTypeAttributes*)attributes);
  411. break;
  412. case UA_NODECLASS_VIEW:
  413. CHECK_ATTRIBUTES(VIEWATTRIBUTES);
  414. retval = copyViewNodeAttributes((UA_ViewNode*)node,
  415. (const UA_ViewAttributes*)attributes);
  416. break;
  417. case UA_NODECLASS_METHOD:
  418. CHECK_ATTRIBUTES(METHODATTRIBUTES);
  419. retval = copyMethodNodeAttributes((UA_MethodNode*)node,
  420. (const UA_MethodAttributes*)attributes);
  421. break;
  422. case UA_NODECLASS_UNSPECIFIED:
  423. default:
  424. retval = UA_STATUSCODE_BADNODECLASSINVALID;
  425. }
  426. if(retval == UA_STATUSCODE_GOOD)
  427. retval = copyStandardAttributes(node, (const UA_NodeAttributes*)attributes);
  428. if(retval != UA_STATUSCODE_GOOD)
  429. UA_Node_deleteMembers(node);
  430. return retval;
  431. }
  432. /*********************/
  433. /* Manage References */
  434. /*********************/
  435. static UA_StatusCode
  436. addReferenceTarget(UA_NodeReferenceKind *refs, const UA_ExpandedNodeId *target) {
  437. UA_ExpandedNodeId *targets =
  438. (UA_ExpandedNodeId*) UA_realloc(refs->targetIds,
  439. sizeof(UA_ExpandedNodeId) * (refs->targetIdsSize+1));
  440. if(!targets)
  441. return UA_STATUSCODE_BADOUTOFMEMORY;
  442. refs->targetIds = targets;
  443. UA_StatusCode retval =
  444. UA_ExpandedNodeId_copy(target, &refs->targetIds[refs->targetIdsSize]);
  445. if(retval == UA_STATUSCODE_GOOD) {
  446. refs->targetIdsSize++;
  447. } else if(refs->targetIdsSize == 0) {
  448. /* We had zero references before (realloc was a malloc) */
  449. UA_free(refs->targetIds);
  450. refs->targetIds = NULL;
  451. }
  452. return retval;
  453. }
  454. static UA_StatusCode
  455. addReferenceKind(UA_Node *node, const UA_AddReferencesItem *item) {
  456. UA_NodeReferenceKind *refs =
  457. (UA_NodeReferenceKind*)UA_realloc(node->references,
  458. sizeof(UA_NodeReferenceKind) * (node->referencesSize+1));
  459. if(!refs)
  460. return UA_STATUSCODE_BADOUTOFMEMORY;
  461. node->references = refs;
  462. UA_NodeReferenceKind *newRef = &refs[node->referencesSize];
  463. memset(newRef, 0, sizeof(UA_NodeReferenceKind));
  464. newRef->isInverse = !item->isForward;
  465. UA_StatusCode retval = UA_NodeId_copy(&item->referenceTypeId, &newRef->referenceTypeId);
  466. retval |= addReferenceTarget(newRef, &item->targetNodeId);
  467. if(retval == UA_STATUSCODE_GOOD) {
  468. node->referencesSize++;
  469. } else {
  470. UA_NodeId_deleteMembers(&newRef->referenceTypeId);
  471. if(node->referencesSize == 0) {
  472. UA_free(node->references);
  473. node->references = NULL;
  474. }
  475. }
  476. return retval;
  477. }
  478. UA_StatusCode
  479. UA_Node_addReference(UA_Node *node, const UA_AddReferencesItem *item) {
  480. UA_NodeReferenceKind *existingRefs = NULL;
  481. for(size_t i = 0; i < node->referencesSize; ++i) {
  482. UA_NodeReferenceKind *refs = &node->references[i];
  483. if(refs->isInverse != item->isForward
  484. && UA_NodeId_equal(&refs->referenceTypeId, &item->referenceTypeId)) {
  485. existingRefs = refs;
  486. break;
  487. }
  488. }
  489. if(existingRefs != NULL) {
  490. for(size_t i = 0; i < existingRefs->targetIdsSize; i++) {
  491. if(UA_ExpandedNodeId_equal(&existingRefs->targetIds[i],
  492. &item->targetNodeId)) {
  493. return UA_STATUSCODE_BADDUPLICATEREFERENCENOTALLOWED;
  494. }
  495. }
  496. return addReferenceTarget(existingRefs, &item->targetNodeId);
  497. }
  498. return addReferenceKind(node, item);
  499. }
  500. UA_StatusCode
  501. UA_Node_deleteReference(UA_Node *node, const UA_DeleteReferencesItem *item) {
  502. for(size_t i = node->referencesSize; i > 0; --i) {
  503. UA_NodeReferenceKind *refs = &node->references[i-1];
  504. if(item->isForward == refs->isInverse)
  505. continue;
  506. if(!UA_NodeId_equal(&item->referenceTypeId, &refs->referenceTypeId))
  507. continue;
  508. for(size_t j = refs->targetIdsSize; j > 0; --j) {
  509. UA_ExpandedNodeId *target = &refs->targetIds[j-1];
  510. if(!UA_NodeId_equal(&item->targetNodeId.nodeId, &target->nodeId))
  511. continue;
  512. /* Ok, delete the reference */
  513. UA_ExpandedNodeId_deleteMembers(target);
  514. refs->targetIdsSize--;
  515. /* One matching target remaining */
  516. if(refs->targetIdsSize > 0) {
  517. if(j-1 != refs->targetIdsSize) // avoid valgrind error: Source
  518. // and destination overlap in
  519. // memcpy
  520. *target = refs->targetIds[refs->targetIdsSize];
  521. return UA_STATUSCODE_GOOD;
  522. }
  523. /* No target for the ReferenceType remaining. Remove entry. */
  524. UA_free(refs->targetIds);
  525. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  526. node->referencesSize--;
  527. if(node->referencesSize > 0) {
  528. if(i-1 != node->referencesSize) // avoid valgrind error: Source
  529. // and destination overlap in
  530. // memcpy
  531. node->references[i-1] = node->references[node->referencesSize];
  532. return UA_STATUSCODE_GOOD;
  533. }
  534. /* No remaining references of any ReferenceType */
  535. UA_free(node->references);
  536. node->references = NULL;
  537. return UA_STATUSCODE_GOOD;
  538. }
  539. }
  540. return UA_STATUSCODE_UNCERTAINREFERENCENOTDELETED;
  541. }
  542. void
  543. UA_Node_deleteReferencesSubset(UA_Node *node, size_t referencesSkipSize,
  544. UA_NodeId* referencesSkip) {
  545. /* Nothing to do */
  546. if(node->referencesSize == 0 || node->references == NULL)
  547. return;
  548. for(size_t i = node->referencesSize; i > 0; --i) {
  549. UA_NodeReferenceKind *refs = &node->references[i-1];
  550. /* Shall we keep the references of this type? */
  551. UA_Boolean skip = false;
  552. for(size_t j = 0; j < referencesSkipSize; j++) {
  553. if(UA_NodeId_equal(&refs->referenceTypeId, &referencesSkip[j])) {
  554. skip = true;
  555. break;
  556. }
  557. }
  558. if(skip)
  559. continue;
  560. /* Remove references */
  561. UA_Array_delete(refs->targetIds, refs->targetIdsSize, &UA_TYPES[UA_TYPES_EXPANDEDNODEID]);
  562. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  563. node->referencesSize--;
  564. /* Move last references-kind entry to this position */
  565. if(i-1 == node->referencesSize) /* Don't memcpy over the same position */
  566. continue;
  567. node->references[i-1] = node->references[node->referencesSize];
  568. }
  569. if(node->referencesSize == 0) {
  570. /* The array is empty. Remove. */
  571. UA_free(node->references);
  572. node->references = NULL;
  573. } else {
  574. /* Realloc to save memory */
  575. UA_NodeReferenceKind *refs = (UA_NodeReferenceKind*)
  576. UA_realloc(node->references, sizeof(UA_NodeReferenceKind) * node->referencesSize);
  577. if(refs) /* Do nothing if realloc fails */
  578. node->references = refs;
  579. }
  580. }
  581. void UA_Node_deleteReferences(UA_Node *node) {
  582. UA_Node_deleteReferencesSubset(node, 0, NULL);
  583. }