ua_services_nodemanagement.c 51 KB

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