ua_services_nodemanagement.c 43 KB

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