ua_services_nodemanagement.c 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977
  1. #include "ua_server_internal.h"
  2. #include "ua_services.h"
  3. /************/
  4. /* Add Node */
  5. /************/
  6. void
  7. Service_AddNodes_existing(UA_Server *server, UA_Session *session, UA_Node *node,
  8. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId,
  9. UA_AddNodesResult *result) {
  10. if(node->nodeId.namespaceIndex >= server->namespacesSize) {
  11. result->statusCode = UA_STATUSCODE_BADNODEIDINVALID;
  12. UA_NodeStore_deleteNode(node);
  13. return;
  14. }
  15. const UA_Node *parent = UA_NodeStore_get(server->nodestore, parentNodeId);
  16. if(!parent) {
  17. result->statusCode = UA_STATUSCODE_BADPARENTNODEIDINVALID;
  18. UA_NodeStore_deleteNode(node);
  19. return;
  20. }
  21. const UA_ReferenceTypeNode *referenceType =
  22. (const UA_ReferenceTypeNode *)UA_NodeStore_get(server->nodestore, referenceTypeId);
  23. if(!referenceType) {
  24. result->statusCode = UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  25. UA_NodeStore_deleteNode(node);
  26. return;
  27. }
  28. if(referenceType->nodeClass != UA_NODECLASS_REFERENCETYPE) {
  29. result->statusCode = UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  30. UA_NodeStore_deleteNode(node);
  31. return;
  32. }
  33. if(referenceType->isAbstract == true) {
  34. result->statusCode = UA_STATUSCODE_BADREFERENCENOTALLOWED;
  35. UA_NodeStore_deleteNode(node);
  36. return;
  37. }
  38. // todo: test if the referencetype is hierarchical
  39. // todo: namespace index is assumed to be valid
  40. result->statusCode = UA_NodeStore_insert(server->nodestore, node);
  41. if(result->statusCode == UA_STATUSCODE_GOOD)
  42. result->statusCode = UA_NodeId_copy(&node->nodeId, &result->addedNodeId);
  43. else
  44. return;
  45. // reference back to the parent
  46. UA_AddReferencesItem item;
  47. UA_AddReferencesItem_init(&item);
  48. item.sourceNodeId = node->nodeId;
  49. item.referenceTypeId = *referenceTypeId;
  50. item.isForward = false;
  51. item.targetNodeId.nodeId = *parentNodeId;
  52. Service_AddReferences_single(server, session, &item);
  53. // todo: error handling. remove new node from nodestore
  54. }
  55. static UA_StatusCode
  56. instantiateVariableNode(UA_Server *server, UA_Session *session,
  57. const UA_NodeId *nodeId, const UA_NodeId *typeId,
  58. UA_InstantiationCallback *instantiationCallback);
  59. static UA_StatusCode
  60. instantiateObjectNode(UA_Server *server, UA_Session *session,
  61. const UA_NodeId *nodeId, const UA_NodeId *typeId,
  62. UA_InstantiationCallback *instantiationCallback);
  63. /* copy an existing variable under the given parent. then instantiate the
  64. variable for all hastypedefinitions of the original version. */
  65. static UA_StatusCode
  66. copyExistingVariable(UA_Server *server, UA_Session *session, const UA_NodeId *variable,
  67. const UA_NodeId *referenceType, const UA_NodeId *parent,
  68. UA_InstantiationCallback *instantiationCallback) {
  69. const UA_VariableNode *node = (const UA_VariableNode*)UA_NodeStore_get(server->nodestore, variable);
  70. if(!node)
  71. return UA_STATUSCODE_BADNODEIDINVALID;
  72. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  73. return UA_STATUSCODE_BADNODECLASSINVALID;
  74. // copy the variable attributes
  75. UA_VariableAttributes attr;
  76. UA_VariableAttributes_init(&attr);
  77. UA_LocalizedText_copy(&node->displayName, &attr.displayName);
  78. UA_LocalizedText_copy(&node->description, &attr.description);
  79. attr.writeMask = node->writeMask;
  80. attr.userWriteMask = node->userWriteMask;
  81. // todo: handle data sources!!!!
  82. UA_Variant_copy(&node->value.variant.value, &attr.value);
  83. // datatype is taken from the value
  84. // valuerank is taken from the value
  85. // array dimensions are taken from the value
  86. attr.accessLevel = node->accessLevel;
  87. attr.userAccessLevel = node->userAccessLevel;
  88. attr.minimumSamplingInterval = node->minimumSamplingInterval;
  89. attr.historizing = node->historizing;
  90. UA_AddNodesItem item;
  91. UA_AddNodesItem_init(&item);
  92. UA_NodeId_copy(parent, &item.parentNodeId.nodeId);
  93. UA_NodeId_copy(referenceType, &item.referenceTypeId);
  94. UA_QualifiedName_copy(&node->browseName, &item.browseName);
  95. item.nodeClass = UA_NODECLASS_VARIABLE;
  96. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  97. item.nodeAttributes.content.decoded.type = &UA_TYPES[UA_TYPES_VARIABLEATTRIBUTES];
  98. item.nodeAttributes.content.decoded.data = &attr;
  99. // don't add a typedefinition here.
  100. // add the new variable
  101. UA_AddNodesResult res;
  102. UA_AddNodesResult_init(&res);
  103. Service_AddNodes_single(server, session, &item, &res, instantiationCallback);
  104. UA_VariableAttributes_deleteMembers(&attr);
  105. UA_AddNodesItem_deleteMembers(&item);
  106. // now instantiate the variable for all hastypedefinition references
  107. for(size_t i = 0; i < node->referencesSize; i++) {
  108. UA_ReferenceNode *rn = &node->references[i];
  109. if(rn->isInverse)
  110. continue;
  111. const UA_NodeId hasTypeDef = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  112. if(!UA_NodeId_equal(&rn->referenceTypeId, &hasTypeDef))
  113. continue;
  114. instantiateVariableNode(server, session, &res.addedNodeId, &rn->targetId.nodeId, instantiationCallback);
  115. }
  116. if (instantiationCallback != NULL)
  117. instantiationCallback->method(res.addedNodeId, node->nodeId, instantiationCallback->handle);
  118. UA_AddNodesResult_deleteMembers(&res);
  119. return UA_STATUSCODE_GOOD;
  120. }
  121. /* copy an existing object under the given parent. then instantiate the
  122. variable for all hastypedefinitions of the original version. */
  123. static UA_StatusCode
  124. copyExistingObject(UA_Server *server, UA_Session *session, const UA_NodeId *variable,
  125. const UA_NodeId *referenceType, const UA_NodeId *parent,
  126. UA_InstantiationCallback *instantiationCallback) {
  127. const UA_ObjectNode *node = (const UA_ObjectNode*)UA_NodeStore_get(server->nodestore, variable);
  128. if(!node)
  129. return UA_STATUSCODE_BADNODEIDINVALID;
  130. if(node->nodeClass != UA_NODECLASS_OBJECT)
  131. return UA_STATUSCODE_BADNODECLASSINVALID;
  132. // copy the variable attributes
  133. UA_ObjectAttributes attr;
  134. UA_ObjectAttributes_init(&attr);
  135. UA_LocalizedText_copy(&node->displayName, &attr.displayName);
  136. UA_LocalizedText_copy(&node->description, &attr.description);
  137. attr.writeMask = node->writeMask;
  138. attr.userWriteMask = node->userWriteMask;
  139. attr.eventNotifier = node->eventNotifier;
  140. UA_AddNodesItem item;
  141. UA_AddNodesItem_init(&item);
  142. UA_NodeId_copy(parent, &item.parentNodeId.nodeId);
  143. UA_NodeId_copy(referenceType, &item.referenceTypeId);
  144. UA_QualifiedName_copy(&node->browseName, &item.browseName);
  145. item.nodeClass = UA_NODECLASS_OBJECT;
  146. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  147. item.nodeAttributes.content.decoded.type = &UA_TYPES[UA_TYPES_OBJECTATTRIBUTES];
  148. item.nodeAttributes.content.decoded.data = &attr;
  149. // don't add a typedefinition here.
  150. // add the new object
  151. UA_AddNodesResult res;
  152. UA_AddNodesResult_init(&res);
  153. Service_AddNodes_single(server, session, &item, &res, instantiationCallback);
  154. UA_ObjectAttributes_deleteMembers(&attr);
  155. UA_AddNodesItem_deleteMembers(&item);
  156. // now instantiate the object for all hastypedefinition references
  157. for(size_t i = 0; i < node->referencesSize; i++) {
  158. UA_ReferenceNode *rn = &node->references[i];
  159. if(rn->isInverse)
  160. continue;
  161. const UA_NodeId hasTypeDef = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  162. if(!UA_NodeId_equal(&rn->referenceTypeId, &hasTypeDef))
  163. continue;
  164. instantiateObjectNode(server, session, &res.addedNodeId, &rn->targetId.nodeId, instantiationCallback);
  165. }
  166. if (instantiationCallback != NULL)
  167. instantiationCallback->method(res.addedNodeId, node->nodeId, instantiationCallback->handle);
  168. UA_AddNodesResult_deleteMembers(&res);
  169. return UA_STATUSCODE_GOOD;
  170. }
  171. static UA_StatusCode
  172. setObjectInstanceHandle(UA_Server *server, UA_Session *session, UA_ObjectNode* node, void *handle) {
  173. if(node->nodeClass != UA_NODECLASS_OBJECT)
  174. return UA_STATUSCODE_BADNODECLASSINVALID;
  175. node->instanceHandle = handle;
  176. return UA_STATUSCODE_GOOD;
  177. }
  178. static UA_StatusCode
  179. instantiateObjectNode(UA_Server *server, UA_Session *session,
  180. const UA_NodeId *nodeId, const UA_NodeId *typeId,
  181. UA_InstantiationCallback *instantiationCallback) {
  182. const UA_ObjectTypeNode *typenode = (const UA_ObjectTypeNode*)UA_NodeStore_get(server->nodestore, typeId);
  183. if(!typenode)
  184. return UA_STATUSCODE_BADNODEIDINVALID;
  185. if(typenode->nodeClass != UA_NODECLASS_OBJECTTYPE)
  186. return UA_STATUSCODE_BADNODECLASSINVALID;
  187. /* Add all the child nodes */
  188. UA_BrowseDescription browseChildren;
  189. UA_BrowseDescription_init(&browseChildren);
  190. browseChildren.nodeId = *typeId;
  191. browseChildren.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  192. browseChildren.includeSubtypes = true;
  193. browseChildren.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  194. browseChildren.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  195. browseChildren.resultMask = UA_BROWSERESULTMASK_REFERENCETYPEID | UA_BROWSERESULTMASK_NODECLASS;
  196. UA_BrowseResult browseResult;
  197. UA_BrowseResult_init(&browseResult);
  198. // todo: continuation points if there are too many results
  199. Service_Browse_single(server, session, NULL, &browseChildren, 100, &browseResult);
  200. for(size_t i = 0; i < browseResult.referencesSize; i++) {
  201. UA_ReferenceDescription *rd = &browseResult.references[i];
  202. if(rd->nodeClass == UA_NODECLASS_METHOD) {
  203. /* add a reference to the method in the objecttype */
  204. UA_AddReferencesItem item;
  205. UA_AddReferencesItem_init(&item);
  206. item.sourceNodeId = *nodeId;
  207. item.referenceTypeId = rd->referenceTypeId;
  208. item.isForward = true;
  209. item.targetNodeId = rd->nodeId;
  210. item.targetNodeClass = UA_NODECLASS_METHOD;
  211. Service_AddReferences_single(server, session, &item);
  212. } else if(rd->nodeClass == UA_NODECLASS_VARIABLE)
  213. copyExistingVariable(server, session, &rd->nodeId.nodeId,
  214. &rd->referenceTypeId, nodeId, instantiationCallback);
  215. else if(rd->nodeClass == UA_NODECLASS_OBJECT)
  216. copyExistingObject(server, session, &rd->nodeId.nodeId,
  217. &rd->referenceTypeId, nodeId, instantiationCallback);
  218. }
  219. /* add a hastypedefinition reference */
  220. UA_AddReferencesItem addref;
  221. UA_AddReferencesItem_init(&addref);
  222. addref.sourceNodeId = *nodeId;
  223. addref.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  224. addref.isForward = true;
  225. addref.targetNodeId.nodeId = *typeId;
  226. addref.targetNodeClass = UA_NODECLASS_OBJECTTYPE;
  227. Service_AddReferences_single(server, session, &addref);
  228. /* call the constructor */
  229. const UA_ObjectLifecycleManagement *olm = &typenode->lifecycleManagement;
  230. if(olm->constructor)
  231. UA_Server_editNode(server, session, nodeId,
  232. (UA_EditNodeCallback)setObjectInstanceHandle, olm->constructor(*nodeId));
  233. return UA_STATUSCODE_GOOD;
  234. }
  235. static UA_StatusCode
  236. instantiateVariableNode(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  237. const UA_NodeId *typeId, UA_InstantiationCallback *instantiationCallback) {
  238. const UA_ObjectTypeNode *typenode = (const UA_ObjectTypeNode*)UA_NodeStore_get(server->nodestore, typeId);
  239. if(!typenode)
  240. return UA_STATUSCODE_BADNODEIDINVALID;
  241. if(typenode->nodeClass != UA_NODECLASS_VARIABLETYPE)
  242. return UA_STATUSCODE_BADNODECLASSINVALID;
  243. /* get the references to child properties */
  244. UA_BrowseDescription browseChildren;
  245. UA_BrowseDescription_init(&browseChildren);
  246. browseChildren.nodeId = *typeId;
  247. browseChildren.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  248. browseChildren.includeSubtypes = true;
  249. browseChildren.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  250. browseChildren.nodeClassMask = UA_NODECLASS_VARIABLE;
  251. browseChildren.resultMask = UA_BROWSERESULTMASK_REFERENCETYPEID | UA_BROWSERESULTMASK_NODECLASS;
  252. UA_BrowseResult browseResult;
  253. UA_BrowseResult_init(&browseResult);
  254. // todo: continuation points if there are too many results
  255. Service_Browse_single(server, session, NULL, &browseChildren, 100, &browseResult);
  256. /* add the child properties */
  257. for(size_t i = 0; i < browseResult.referencesSize; i++) {
  258. UA_ReferenceDescription *rd = &browseResult.references[i];
  259. copyExistingVariable(server, session, &rd->nodeId.nodeId,
  260. &rd->referenceTypeId, nodeId, instantiationCallback);
  261. }
  262. /* add a hastypedefinition reference */
  263. UA_AddReferencesItem addref;
  264. UA_AddReferencesItem_init(&addref);
  265. addref.sourceNodeId = *nodeId;
  266. addref.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  267. addref.isForward = true;
  268. addref.targetNodeId.nodeId = *typeId;
  269. addref.targetNodeClass = UA_NODECLASS_OBJECTTYPE;
  270. Service_AddReferences_single(server, session, &addref);
  271. return UA_STATUSCODE_GOOD;
  272. }
  273. static UA_StatusCode
  274. copyStandardAttributes(UA_Node *node, const UA_AddNodesItem *item, const UA_NodeAttributes *attr) {
  275. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  276. retval |= UA_NodeId_copy(&item->requestedNewNodeId.nodeId, &node->nodeId);
  277. retval |= UA_QualifiedName_copy(&item->browseName, &node->browseName);
  278. retval |= UA_LocalizedText_copy(&attr->displayName, &node->displayName);
  279. retval |= UA_LocalizedText_copy(&attr->description, &node->description);
  280. node->writeMask = attr->writeMask;
  281. node->userWriteMask = attr->userWriteMask;
  282. return retval;
  283. }
  284. static UA_Node *
  285. variableNodeFromAttributes(const UA_AddNodesItem *item, const UA_VariableAttributes *attr) {
  286. UA_VariableNode *vnode = UA_NodeStore_newVariableNode();
  287. if(!vnode)
  288. return NULL;
  289. UA_StatusCode retval = copyStandardAttributes((UA_Node*)vnode, item, (const UA_NodeAttributes*)attr);
  290. // todo: test if the type / valueRank / value attributes are consistent
  291. vnode->accessLevel = attr->accessLevel;
  292. vnode->userAccessLevel = attr->userAccessLevel;
  293. vnode->historizing = attr->historizing;
  294. vnode->minimumSamplingInterval = attr->minimumSamplingInterval;
  295. vnode->valueRank = attr->valueRank;
  296. retval |= UA_Variant_copy(&attr->value, &vnode->value.variant.value);
  297. if(retval != UA_STATUSCODE_GOOD) {
  298. UA_NodeStore_deleteNode((UA_Node*)vnode);
  299. return NULL;
  300. }
  301. return (UA_Node*)vnode;
  302. }
  303. static UA_Node *
  304. objectNodeFromAttributes(const UA_AddNodesItem *item, const UA_ObjectAttributes *attr) {
  305. UA_ObjectNode *onode = UA_NodeStore_newObjectNode();
  306. if(!onode)
  307. return NULL;
  308. UA_StatusCode retval = copyStandardAttributes((UA_Node*)onode, item, (const UA_NodeAttributes*)attr);
  309. onode->eventNotifier = attr->eventNotifier;
  310. if(retval != UA_STATUSCODE_GOOD) {
  311. UA_NodeStore_deleteNode((UA_Node*)onode);
  312. return NULL;
  313. }
  314. return (UA_Node*)onode;
  315. }
  316. static UA_Node *
  317. referenceTypeNodeFromAttributes(const UA_AddNodesItem *item, const UA_ReferenceTypeAttributes *attr) {
  318. UA_ReferenceTypeNode *rtnode = UA_NodeStore_newReferenceTypeNode();
  319. if(!rtnode)
  320. return NULL;
  321. UA_StatusCode retval = copyStandardAttributes((UA_Node*)rtnode, item, (const UA_NodeAttributes*)attr);
  322. rtnode->isAbstract = attr->isAbstract;
  323. rtnode->symmetric = attr->symmetric;
  324. retval |= UA_LocalizedText_copy(&attr->inverseName, &rtnode->inverseName);
  325. if(retval != UA_STATUSCODE_GOOD) {
  326. UA_NodeStore_deleteNode((UA_Node*)rtnode);
  327. return NULL;
  328. }
  329. return (UA_Node*)rtnode;
  330. }
  331. static UA_Node *
  332. objectTypeNodeFromAttributes(const UA_AddNodesItem *item, const UA_ObjectTypeAttributes *attr) {
  333. UA_ObjectTypeNode *otnode = UA_NodeStore_newObjectTypeNode();
  334. if(!otnode)
  335. return NULL;
  336. UA_StatusCode retval = copyStandardAttributes((UA_Node*)otnode, item, (const UA_NodeAttributes*)attr);
  337. otnode->isAbstract = attr->isAbstract;
  338. if(retval != UA_STATUSCODE_GOOD) {
  339. UA_NodeStore_deleteNode((UA_Node*)otnode);
  340. return NULL;
  341. }
  342. return (UA_Node*)otnode;
  343. }
  344. static UA_Node *
  345. variableTypeNodeFromAttributes(const UA_AddNodesItem *item, const UA_VariableTypeAttributes *attr) {
  346. UA_VariableTypeNode *vtnode = UA_NodeStore_newVariableTypeNode();
  347. if(!vtnode)
  348. return NULL;
  349. UA_StatusCode retval = copyStandardAttributes((UA_Node*)vtnode, item, (const UA_NodeAttributes*)attr);
  350. UA_Variant_copy(&attr->value, &vtnode->value.variant.value);
  351. // datatype is taken from the value
  352. vtnode->valueRank = attr->valueRank;
  353. // array dimensions are taken from the value
  354. vtnode->isAbstract = attr->isAbstract;
  355. if(retval != UA_STATUSCODE_GOOD) {
  356. UA_NodeStore_deleteNode((UA_Node*)vtnode);
  357. return NULL;
  358. }
  359. return (UA_Node*)vtnode;
  360. }
  361. static UA_Node *
  362. viewNodeFromAttributes(const UA_AddNodesItem *item, const UA_ViewAttributes *attr) {
  363. UA_ViewNode *vnode = UA_NodeStore_newViewNode();
  364. if(!vnode)
  365. return NULL;
  366. UA_StatusCode retval = copyStandardAttributes((UA_Node*)vnode, item, (const UA_NodeAttributes*)attr);
  367. vnode->containsNoLoops = attr->containsNoLoops;
  368. vnode->eventNotifier = attr->eventNotifier;
  369. if(retval != UA_STATUSCODE_GOOD) {
  370. UA_NodeStore_deleteNode((UA_Node*)vnode);
  371. return NULL;
  372. }
  373. return (UA_Node*)vnode;
  374. }
  375. static UA_Node *
  376. dataTypeNodeFromAttributes(const UA_AddNodesItem *item, const UA_DataTypeAttributes *attr) {
  377. UA_DataTypeNode *dtnode = UA_NodeStore_newDataTypeNode();
  378. if(!dtnode)
  379. return NULL;
  380. UA_StatusCode retval = copyStandardAttributes((UA_Node*)dtnode, item, (const UA_NodeAttributes*)attr);
  381. dtnode->isAbstract = attr->isAbstract;
  382. if(retval != UA_STATUSCODE_GOOD) {
  383. UA_NodeStore_deleteNode((UA_Node*)dtnode);
  384. return NULL;
  385. }
  386. return (UA_Node*)dtnode;
  387. }
  388. void Service_AddNodes_single(UA_Server *server, UA_Session *session, const UA_AddNodesItem *item,
  389. UA_AddNodesResult *result, UA_InstantiationCallback *instantiationCallback) {
  390. if(item->nodeAttributes.encoding < UA_EXTENSIONOBJECT_DECODED ||
  391. !item->nodeAttributes.content.decoded.type) {
  392. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  393. return;
  394. }
  395. /* create the node */
  396. UA_Node *node;
  397. switch(item->nodeClass) {
  398. case UA_NODECLASS_OBJECT:
  399. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_OBJECTATTRIBUTES]) {
  400. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  401. return;
  402. }
  403. node = objectNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  404. break;
  405. case UA_NODECLASS_VARIABLE:
  406. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_VARIABLEATTRIBUTES]) {
  407. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  408. return;
  409. }
  410. node = variableNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  411. break;
  412. case UA_NODECLASS_OBJECTTYPE:
  413. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_OBJECTTYPEATTRIBUTES]) {
  414. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  415. return;
  416. }
  417. node = objectTypeNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  418. break;
  419. case UA_NODECLASS_VARIABLETYPE:
  420. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_VARIABLETYPEATTRIBUTES]) {
  421. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  422. return;
  423. }
  424. node = variableTypeNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  425. break;
  426. case UA_NODECLASS_REFERENCETYPE:
  427. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_REFERENCETYPEATTRIBUTES]) {
  428. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  429. return;
  430. }
  431. node = referenceTypeNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  432. break;
  433. case UA_NODECLASS_DATATYPE:
  434. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_DATATYPEATTRIBUTES]) {
  435. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  436. return;
  437. }
  438. node = dataTypeNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  439. break;
  440. case UA_NODECLASS_VIEW:
  441. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_VIEWATTRIBUTES]) {
  442. result->statusCode = UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  443. return;
  444. }
  445. node = viewNodeFromAttributes(item, item->nodeAttributes.content.decoded.data);
  446. break;
  447. case UA_NODECLASS_METHOD:
  448. case UA_NODECLASS_UNSPECIFIED:
  449. default:
  450. result->statusCode = UA_STATUSCODE_BADNODECLASSINVALID;
  451. return;
  452. }
  453. if(!node) {
  454. result->statusCode = UA_STATUSCODE_BADOUTOFMEMORY;
  455. return;
  456. }
  457. /* add it to the server */
  458. Service_AddNodes_existing(server, session, node, &item->parentNodeId.nodeId,
  459. &item->referenceTypeId, result);
  460. if(result->statusCode != UA_STATUSCODE_GOOD)
  461. return;
  462. /* instantiate if it has a type */
  463. if(!UA_NodeId_isNull(&item->typeDefinition.nodeId)) {
  464. if (instantiationCallback != NULL)
  465. instantiationCallback->method(result->addedNodeId, item->typeDefinition.nodeId,
  466. instantiationCallback->handle);
  467. if(item->nodeClass == UA_NODECLASS_OBJECT)
  468. result->statusCode = instantiateObjectNode(server, session, &result->addedNodeId,
  469. &item->typeDefinition.nodeId, instantiationCallback);
  470. else if(item->nodeClass == UA_NODECLASS_VARIABLE)
  471. result->statusCode = instantiateVariableNode(server, session, &result->addedNodeId,
  472. &item->typeDefinition.nodeId, instantiationCallback);
  473. }
  474. /* if instantiation failed, remove the node */
  475. if(result->statusCode != UA_STATUSCODE_GOOD)
  476. Service_DeleteNodes_single(server, session, &result->addedNodeId, true);
  477. }
  478. void Service_AddNodes(UA_Server *server, UA_Session *session, const UA_AddNodesRequest *request,
  479. UA_AddNodesResponse *response) {
  480. if(request->nodesToAddSize <= 0) {
  481. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  482. return;
  483. }
  484. size_t size = request->nodesToAddSize;
  485. response->results = UA_Array_new(size, &UA_TYPES[UA_TYPES_ADDNODESRESULT]);
  486. if(!response->results) {
  487. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  488. return;
  489. }
  490. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  491. #ifdef _MSC_VER
  492. UA_Boolean *isExternal = UA_alloca(size);
  493. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32)*size);
  494. #else
  495. UA_Boolean isExternal[size];
  496. UA_UInt32 indices[size];
  497. #endif
  498. memset(isExternal, false, sizeof(UA_Boolean) * size);
  499. for(size_t j = 0; j <server->externalNamespacesSize; j++) {
  500. size_t indexSize = 0;
  501. for(size_t i = 0;i < size;i++) {
  502. if(request->nodesToAdd[i].requestedNewNodeId.nodeId.namespaceIndex !=
  503. server->externalNamespaces[j].index)
  504. continue;
  505. isExternal[i] = true;
  506. indices[indexSize] = i;
  507. indexSize++;
  508. }
  509. if(indexSize == 0)
  510. continue;
  511. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  512. ens->addNodes(ens->ensHandle, &request->requestHeader, request->nodesToAdd,
  513. indices, indexSize, response->results, response->diagnosticInfos);
  514. }
  515. #endif
  516. response->resultsSize = size;
  517. for(size_t i = 0; i < size; i++) {
  518. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  519. if(!isExternal[i])
  520. #endif
  521. Service_AddNodes_single(server, session, &request->nodesToAdd[i], &response->results[i], NULL);
  522. }
  523. }
  524. /**************************************************/
  525. /* Add Special Nodes (not possible over the wire) */
  526. /**************************************************/
  527. UA_StatusCode
  528. UA_Server_addDataSourceVariableNode(UA_Server *server, const UA_NodeId requestedNewNodeId,
  529. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  530. const UA_QualifiedName browseName, const UA_NodeId typeDefinition,
  531. const UA_VariableAttributes attr, const UA_DataSource dataSource,
  532. UA_NodeId *outNewNodeId) {
  533. UA_AddNodesResult result;
  534. UA_AddNodesResult_init(&result);
  535. UA_AddNodesItem item;
  536. UA_AddNodesItem_init(&item);
  537. result.statusCode = UA_QualifiedName_copy(&browseName, &item.browseName);
  538. item.nodeClass = UA_NODECLASS_VARIABLE;
  539. result.statusCode |= UA_NodeId_copy(&parentNodeId, &item.parentNodeId.nodeId);
  540. result.statusCode |= UA_NodeId_copy(&referenceTypeId, &item.referenceTypeId);
  541. result.statusCode |= UA_NodeId_copy(&requestedNewNodeId, &item.requestedNewNodeId.nodeId);
  542. result.statusCode |= UA_NodeId_copy(&typeDefinition, &item.typeDefinition.nodeId);
  543. UA_VariableAttributes attrCopy;
  544. result.statusCode |= UA_VariableAttributes_copy(&attr, &attrCopy);
  545. if(result.statusCode != UA_STATUSCODE_GOOD) {
  546. UA_AddNodesItem_deleteMembers(&item);
  547. UA_VariableAttributes_deleteMembers(&attrCopy);
  548. return result.statusCode;
  549. }
  550. UA_VariableNode *node = UA_NodeStore_newVariableNode();
  551. if(!node) {
  552. UA_AddNodesItem_deleteMembers(&item);
  553. UA_VariableAttributes_deleteMembers(&attrCopy);
  554. return UA_STATUSCODE_BADOUTOFMEMORY;
  555. }
  556. copyStandardAttributes((UA_Node*)node, &item, (UA_NodeAttributes*)&attrCopy);
  557. node->valueSource = UA_VALUESOURCE_DATASOURCE;
  558. node->value.dataSource = dataSource;
  559. node->accessLevel = attr.accessLevel;
  560. node->userAccessLevel = attr.userAccessLevel;
  561. node->historizing = attr.historizing;
  562. node->minimumSamplingInterval = attr.minimumSamplingInterval;
  563. node->valueRank = attr.valueRank;
  564. UA_RCU_LOCK();
  565. Service_AddNodes_existing(server, &adminSession, (UA_Node*)node, &item.parentNodeId.nodeId,
  566. &item.referenceTypeId, &result);
  567. UA_RCU_UNLOCK();
  568. UA_AddNodesItem_deleteMembers(&item);
  569. UA_VariableAttributes_deleteMembers(&attrCopy);
  570. if(outNewNodeId && result.statusCode == UA_STATUSCODE_GOOD)
  571. *outNewNodeId = result.addedNodeId;
  572. else
  573. UA_AddNodesResult_deleteMembers(&result);
  574. return result.statusCode;
  575. }
  576. #ifdef UA_ENABLE_METHODCALLS
  577. UA_StatusCode
  578. UA_Server_addMethodNode(UA_Server *server, const UA_NodeId requestedNewNodeId,
  579. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  580. const UA_QualifiedName browseName, const UA_MethodAttributes attr,
  581. UA_MethodCallback method, void *handle,
  582. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  583. size_t outputArgumentsSize, const UA_Argument* outputArguments,
  584. UA_NodeId *outNewNodeId) {
  585. UA_AddNodesResult result;
  586. UA_AddNodesResult_init(&result);
  587. UA_AddNodesItem item;
  588. UA_AddNodesItem_init(&item);
  589. result.statusCode = UA_QualifiedName_copy(&browseName, &item.browseName);
  590. item.nodeClass = UA_NODECLASS_METHOD;
  591. result.statusCode |= UA_NodeId_copy(&parentNodeId, &item.parentNodeId.nodeId);
  592. result.statusCode |= UA_NodeId_copy(&referenceTypeId, &item.referenceTypeId);
  593. result.statusCode |= UA_NodeId_copy(&requestedNewNodeId, &item.requestedNewNodeId.nodeId);
  594. UA_MethodAttributes attrCopy;
  595. result.statusCode |= UA_MethodAttributes_copy(&attr, &attrCopy);
  596. if(result.statusCode != UA_STATUSCODE_GOOD) {
  597. UA_AddNodesItem_deleteMembers(&item);
  598. UA_MethodAttributes_deleteMembers(&attrCopy);
  599. return result.statusCode;
  600. }
  601. UA_MethodNode *node = UA_NodeStore_newMethodNode();
  602. if(!node) {
  603. result.statusCode = UA_STATUSCODE_BADOUTOFMEMORY;
  604. UA_AddNodesItem_deleteMembers(&item);
  605. UA_MethodAttributes_deleteMembers(&attrCopy);
  606. return result.statusCode;
  607. }
  608. copyStandardAttributes((UA_Node*)node, &item, (UA_NodeAttributes*)&attrCopy);
  609. node->executable = attrCopy.executable;
  610. node->userExecutable = attrCopy.executable;
  611. node->attachedMethod = method;
  612. node->methodHandle = handle;
  613. UA_AddNodesItem_deleteMembers(&item);
  614. UA_MethodAttributes_deleteMembers(&attrCopy);
  615. UA_RCU_LOCK();
  616. Service_AddNodes_existing(server, &adminSession, (UA_Node*)node, &item.parentNodeId.nodeId,
  617. &item.referenceTypeId, &result);
  618. UA_RCU_UNLOCK();
  619. if(result.statusCode != UA_STATUSCODE_GOOD)
  620. return result.statusCode;
  621. UA_ExpandedNodeId parent;
  622. UA_ExpandedNodeId_init(&parent);
  623. parent.nodeId = result.addedNodeId;
  624. const UA_NodeId hasproperty = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  625. UA_VariableNode *inputArgumentsVariableNode = UA_NodeStore_newVariableNode();
  626. inputArgumentsVariableNode->nodeId.namespaceIndex = result.addedNodeId.namespaceIndex;
  627. inputArgumentsVariableNode->browseName = UA_QUALIFIEDNAME_ALLOC(0, "InputArguments");
  628. inputArgumentsVariableNode->displayName = UA_LOCALIZEDTEXT_ALLOC("en_US", "InputArguments");
  629. inputArgumentsVariableNode->description = UA_LOCALIZEDTEXT_ALLOC("en_US", "InputArguments");
  630. inputArgumentsVariableNode->valueRank = 1;
  631. UA_Variant_setArrayCopy(&inputArgumentsVariableNode->value.variant.value, inputArguments,
  632. inputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  633. UA_AddNodesResult inputAddRes;
  634. UA_RCU_LOCK();
  635. Service_AddNodes_existing(server, &adminSession, (UA_Node*)inputArgumentsVariableNode,
  636. &parent.nodeId, &hasproperty, &inputAddRes);
  637. UA_RCU_UNLOCK();
  638. // todo: check if adding succeeded
  639. UA_AddNodesResult_deleteMembers(&inputAddRes);
  640. /* create OutputArguments */
  641. UA_VariableNode *outputArgumentsVariableNode = UA_NodeStore_newVariableNode();
  642. outputArgumentsVariableNode->nodeId.namespaceIndex = result.addedNodeId.namespaceIndex;
  643. outputArgumentsVariableNode->browseName = UA_QUALIFIEDNAME_ALLOC(0, "OutputArguments");
  644. outputArgumentsVariableNode->displayName = UA_LOCALIZEDTEXT_ALLOC("en_US", "OutputArguments");
  645. outputArgumentsVariableNode->description = UA_LOCALIZEDTEXT_ALLOC("en_US", "OutputArguments");
  646. outputArgumentsVariableNode->valueRank = 1;
  647. UA_Variant_setArrayCopy(&outputArgumentsVariableNode->value.variant.value, outputArguments,
  648. outputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  649. UA_AddNodesResult outputAddRes;
  650. UA_RCU_LOCK();
  651. Service_AddNodes_existing(server, &adminSession, (UA_Node*)outputArgumentsVariableNode,
  652. &parent.nodeId, &hasproperty, &outputAddRes);
  653. UA_RCU_UNLOCK();
  654. // todo: check if adding succeeded
  655. UA_AddNodesResult_deleteMembers(&outputAddRes);
  656. if(outNewNodeId)
  657. *outNewNodeId = result.addedNodeId; // don't deleteMember the result
  658. else
  659. UA_AddNodesResult_deleteMembers(&result);
  660. return result.statusCode;
  661. }
  662. #endif
  663. /******************/
  664. /* Add References */
  665. /******************/
  666. /* Adds a one-way reference to the local nodestore */
  667. static UA_StatusCode
  668. addOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node, const UA_AddReferencesItem *item) {
  669. size_t i = node->referencesSize;
  670. size_t refssize = (i+1) | 3; // so the realloc is not necessary every time
  671. UA_ReferenceNode *new_refs = UA_realloc(node->references, sizeof(UA_ReferenceNode) * refssize);
  672. if(!new_refs)
  673. return UA_STATUSCODE_BADOUTOFMEMORY;
  674. node->references = new_refs;
  675. UA_ReferenceNode_init(&new_refs[i]);
  676. UA_StatusCode retval = UA_NodeId_copy(&item->referenceTypeId, &new_refs[i].referenceTypeId);
  677. retval |= UA_ExpandedNodeId_copy(&item->targetNodeId, &new_refs[i].targetId);
  678. new_refs[i].isInverse = !item->isForward;
  679. if(retval == UA_STATUSCODE_GOOD)
  680. node->referencesSize = i+1;
  681. else
  682. UA_ReferenceNode_deleteMembers(&new_refs[i]);
  683. return retval;
  684. }
  685. UA_StatusCode
  686. Service_AddReferences_single(UA_Server *server, UA_Session *session, const UA_AddReferencesItem *item) {
  687. if(item->targetServerUri.length > 0)
  688. return UA_STATUSCODE_BADNOTIMPLEMENTED; // currently no expandednodeids are allowed
  689. /* cast away the const to loop the call through UA_Server_editNode */
  690. UA_StatusCode retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  691. (UA_EditNodeCallback)addOneWayReference, item);
  692. if(retval != UA_STATUSCODE_GOOD)
  693. return retval;
  694. UA_AddReferencesItem secondItem;
  695. secondItem = *item;
  696. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  697. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  698. secondItem.isForward = !item->isForward;
  699. retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  700. (UA_EditNodeCallback)addOneWayReference, &secondItem);
  701. // todo: remove reference if the second direction failed
  702. return retval;
  703. }
  704. void Service_AddReferences(UA_Server *server, UA_Session *session,
  705. const UA_AddReferencesRequest *request,
  706. UA_AddReferencesResponse *response) {
  707. if(request->referencesToAddSize <= 0) {
  708. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  709. return;
  710. }
  711. size_t size = request->referencesToAddSize;
  712. if(!(response->results = UA_malloc(sizeof(UA_StatusCode) * size))) {
  713. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  714. return;
  715. }
  716. response->resultsSize = size;
  717. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  718. #ifdef NO_ALLOCA
  719. UA_Boolean isExternal[size];
  720. UA_UInt32 indices[size];
  721. #else
  722. UA_Boolean *isExternal = UA_alloca(sizeof(UA_Boolean) * size);
  723. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32) * size);
  724. #endif /*NO_ALLOCA */
  725. memset(isExternal, false, sizeof(UA_Boolean) * size);
  726. for(size_t j = 0; j < server->externalNamespacesSize; j++) {
  727. size_t indicesSize = 0;
  728. for(size_t i = 0;i < size;i++) {
  729. if(request->referencesToAdd[i].sourceNodeId.namespaceIndex
  730. != server->externalNamespaces[j].index)
  731. continue;
  732. isExternal[i] = true;
  733. indices[indicesSize] = i;
  734. indicesSize++;
  735. }
  736. if (indicesSize == 0)
  737. continue;
  738. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  739. ens->addReferences(ens->ensHandle, &request->requestHeader, request->referencesToAdd,
  740. indices, indicesSize, response->results, response->diagnosticInfos);
  741. }
  742. #endif
  743. response->resultsSize = size;
  744. for(size_t i = 0; i < response->resultsSize; i++) {
  745. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  746. if(!isExternal[i])
  747. #endif
  748. Service_AddReferences_single(server, session, &request->referencesToAdd[i]);
  749. }
  750. }
  751. /****************/
  752. /* Delete Nodes */
  753. /****************/
  754. // TODO: Check consistency constraints, remove the references.
  755. UA_StatusCode
  756. Service_DeleteNodes_single(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  757. UA_Boolean deleteReferences) {
  758. const UA_Node *node = UA_NodeStore_get(server->nodestore, nodeId);
  759. if(!node)
  760. return UA_STATUSCODE_BADNODEIDINVALID;
  761. if(deleteReferences == true) {
  762. UA_DeleteReferencesItem delItem;
  763. UA_DeleteReferencesItem_init(&delItem);
  764. delItem.deleteBidirectional = false;
  765. delItem.targetNodeId.nodeId = *nodeId;
  766. for(size_t i = 0; i < node->referencesSize; i++) {
  767. delItem.sourceNodeId = node->references[i].targetId.nodeId;
  768. delItem.isForward = node->references[i].isInverse;
  769. Service_DeleteReferences_single(server, session, &delItem);
  770. }
  771. }
  772. /* destroy an object before removing it */
  773. if(node->nodeClass == UA_NODECLASS_OBJECT) {
  774. /* find the object type(s) */
  775. UA_BrowseDescription bd;
  776. UA_BrowseDescription_init(&bd);
  777. bd.browseDirection = UA_BROWSEDIRECTION_INVERSE;
  778. bd.nodeId = *nodeId;
  779. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  780. bd.includeSubtypes = true;
  781. bd.nodeClassMask = UA_NODECLASS_OBJECTTYPE;
  782. /* browse type definitions with admin rights */
  783. UA_BrowseResult result;
  784. UA_BrowseResult_init(&result);
  785. Service_Browse_single(server, &adminSession, NULL, &bd, UA_UINT32_MAX, &result);
  786. for(size_t i = 0; i < result.referencesSize; i++) {
  787. /* call the destructor */
  788. UA_ReferenceDescription *rd = &result.references[i];
  789. const UA_ObjectTypeNode *typenode =
  790. (const UA_ObjectTypeNode*)UA_NodeStore_get(server->nodestore, &rd->nodeId.nodeId);
  791. if(!typenode)
  792. continue;
  793. if(typenode->nodeClass != UA_NODECLASS_OBJECTTYPE || !typenode->lifecycleManagement.destructor)
  794. continue;
  795. /* if there are several types with lifecycle management, call all the destructors */
  796. typenode->lifecycleManagement.destructor(*nodeId, ((const UA_ObjectNode*)node)->instanceHandle);
  797. }
  798. UA_BrowseResult_deleteMembers(&result);
  799. }
  800. return UA_NodeStore_remove(server->nodestore, nodeId);
  801. }
  802. void Service_DeleteNodes(UA_Server *server, UA_Session *session, const UA_DeleteNodesRequest *request,
  803. UA_DeleteNodesResponse *response) {
  804. if(request->nodesToDeleteSize <= 0) {
  805. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  806. return;
  807. }
  808. response->results = UA_malloc(sizeof(UA_StatusCode) * request->nodesToDeleteSize);
  809. if(!response->results) {
  810. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;;
  811. return;
  812. }
  813. response->resultsSize = request->nodesToDeleteSize;
  814. for(size_t i=0; i<request->nodesToDeleteSize; i++) {
  815. UA_DeleteNodesItem *item = &request->nodesToDelete[i];
  816. response->results[i] = Service_DeleteNodes_single(server, session, &item->nodeId,
  817. item->deleteTargetReferences);
  818. }
  819. }
  820. /*********************/
  821. /* Delete References */
  822. /*********************/
  823. static UA_StatusCode
  824. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  825. const UA_DeleteReferencesItem *item) {
  826. UA_Boolean edited = false;
  827. for(size_t i = node->referencesSize - 1; ; i--) {
  828. if(i > node->referencesSize)
  829. break; /* underflow after i == 0 */
  830. if(!UA_NodeId_equal(&item->targetNodeId.nodeId, &node->references[i].targetId.nodeId))
  831. continue;
  832. if(!UA_NodeId_equal(&item->referenceTypeId, &node->references[i].referenceTypeId))
  833. continue;
  834. if(item->isForward == node->references[i].isInverse)
  835. continue;
  836. /* move the last entry to override the current position */
  837. UA_ReferenceNode_deleteMembers(&node->references[i]);
  838. node->references[i] = node->references[node->referencesSize-1];
  839. node->referencesSize--;
  840. edited = true;
  841. break;
  842. }
  843. if(!edited)
  844. return UA_STATUSCODE_UNCERTAINREFERENCENOTDELETED;
  845. /* we removed the last reference */
  846. if(node->referencesSize == 0 && node->references)
  847. UA_free(node->references);
  848. return UA_STATUSCODE_GOOD;;
  849. }
  850. UA_StatusCode
  851. Service_DeleteReferences_single(UA_Server *server, UA_Session *session,
  852. const UA_DeleteReferencesItem *item) {
  853. UA_StatusCode retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  854. (UA_EditNodeCallback)deleteOneWayReference, item);
  855. if(!item->deleteBidirectional || item->targetNodeId.serverIndex != 0)
  856. return retval;
  857. UA_DeleteReferencesItem secondItem;
  858. UA_DeleteReferencesItem_init(&secondItem);
  859. secondItem.isForward = !item->isForward;
  860. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  861. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  862. return UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  863. (UA_EditNodeCallback)deleteOneWayReference, &secondItem);
  864. }
  865. void
  866. Service_DeleteReferences(UA_Server *server, UA_Session *session, const UA_DeleteReferencesRequest *request,
  867. UA_DeleteReferencesResponse *response) {
  868. if(request->referencesToDeleteSize <= 0) {
  869. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  870. return;
  871. }
  872. response->results = UA_malloc(sizeof(UA_StatusCode) * request->referencesToDeleteSize);
  873. if(!response->results) {
  874. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;;
  875. return;
  876. }
  877. response->resultsSize = request->referencesToDeleteSize;
  878. for(size_t i = 0; i < request->referencesToDeleteSize; i++)
  879. response->results[i] =
  880. Service_DeleteReferences_single(server, session, &request->referencesToDelete[i]);
  881. }