ua_services_nodemanagement.c 54 KB

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