ua_services_nodemanagement.c 42 KB

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