ua_services_nodemanagement.c 70 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772
  1. /* This Source Code Form is subject to the terms of the Mozilla Public
  2. * License, v. 2.0. If a copy of the MPL was not distributed with this
  3. * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
  4. #include "ua_server_internal.h"
  5. #include "ua_services.h"
  6. /************************/
  7. /* Forward Declarations */
  8. /************************/
  9. static UA_StatusCode
  10. copyChildNodes(UA_Server *server, UA_Session *session,
  11. const UA_NodeId *sourceNodeId, const UA_NodeId *destinationNodeId,
  12. UA_InstantiationCallback *instantiationCallback);
  13. static UA_StatusCode
  14. Service_AddNode_finish(UA_Server *server, UA_Session *session,
  15. const UA_NodeId *nodeId, const UA_NodeId *parentNodeId,
  16. const UA_NodeId *referenceTypeId,
  17. const UA_NodeId *typeDefinition,
  18. UA_InstantiationCallback *instantiationCallback);
  19. static UA_StatusCode
  20. deleteNode(UA_Server *server, UA_Session *session,
  21. const UA_NodeId *nodeId, UA_Boolean deleteReferences);
  22. static UA_StatusCode
  23. addReference(UA_Server *server, UA_Session *session,
  24. const UA_AddReferencesItem *item);
  25. static UA_StatusCode
  26. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  27. const UA_DeleteReferencesItem *item);
  28. static UA_StatusCode
  29. deleteReference(UA_Server *server, UA_Session *session,
  30. const UA_DeleteReferencesItem *item);
  31. /**********************/
  32. /* Consistency Checks */
  33. /**********************/
  34. /* Check if the requested parent node exists, has the right node class and is
  35. * referenced with an allowed (hierarchical) reference type. For "type" nodes,
  36. * only hasSubType references are allowed. */
  37. static UA_StatusCode
  38. checkParentReference(UA_Server *server, UA_Session *session, UA_NodeClass nodeClass,
  39. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId) {
  40. /* Objects do not need a parent (e.g. mandatory/optional modellingrules) */
  41. if(nodeClass == UA_NODECLASS_OBJECT && UA_NodeId_isNull(parentNodeId) &&
  42. UA_NodeId_isNull(referenceTypeId))
  43. return UA_STATUSCODE_GOOD;
  44. /* See if the parent exists */
  45. const UA_Node *parent = UA_NodeStore_get(server->nodestore, parentNodeId);
  46. if(!parent) {
  47. UA_LOG_INFO_SESSION(server->config.logger, session,
  48. "AddNodes: Parent node not found");
  49. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  50. }
  51. /* Check the referencetype exists */
  52. const UA_ReferenceTypeNode *referenceType =
  53. (const UA_ReferenceTypeNode*)UA_NodeStore_get(server->nodestore, referenceTypeId);
  54. if(!referenceType) {
  55. UA_LOG_INFO_SESSION(server->config.logger, session,
  56. "AddNodes: Reference type to the parent not found");
  57. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  58. }
  59. /* Check if the referencetype is a reference type node */
  60. if(referenceType->nodeClass != UA_NODECLASS_REFERENCETYPE) {
  61. UA_LOG_INFO_SESSION(server->config.logger, session,
  62. "AddNodes: Reference type to the parent invalid");
  63. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  64. }
  65. /* Check that the reference type is not abstract */
  66. if(referenceType->isAbstract == true) {
  67. UA_LOG_INFO_SESSION(server->config.logger, session,
  68. "AddNodes: Abstract reference type to the parent not allowed");
  69. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  70. }
  71. /* Check hassubtype relation for type nodes */
  72. const UA_NodeId subtypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  73. if(nodeClass == UA_NODECLASS_DATATYPE ||
  74. nodeClass == UA_NODECLASS_VARIABLETYPE ||
  75. nodeClass == UA_NODECLASS_OBJECTTYPE ||
  76. nodeClass == UA_NODECLASS_REFERENCETYPE) {
  77. /* type needs hassubtype reference to the supertype */
  78. if(!UA_NodeId_equal(referenceTypeId, &subtypeId)) {
  79. UA_LOG_INFO_SESSION(server->config.logger, session,
  80. "AddNodes: New type node need to have a "
  81. "HasSubType reference");
  82. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  83. }
  84. /* supertype needs to be of the same node type */
  85. if(parent->nodeClass != nodeClass) {
  86. UA_LOG_INFO_SESSION(server->config.logger, session,
  87. "AddNodes: New type node needs to be of the same "
  88. "node type as the parent");
  89. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  90. }
  91. return UA_STATUSCODE_GOOD;
  92. }
  93. /* Test if the referencetype is hierarchical */
  94. const UA_NodeId hierarchicalReference =
  95. UA_NODEID_NUMERIC(0, UA_NS0ID_HIERARCHICALREFERENCES);
  96. if(!isNodeInTree(server->nodestore, referenceTypeId,
  97. &hierarchicalReference, &subtypeId, 1)) {
  98. UA_LOG_INFO_SESSION(server->config.logger, session,
  99. "AddNodes: Reference type is not hierarchical");
  100. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  101. }
  102. return UA_STATUSCODE_GOOD;
  103. }
  104. static UA_StatusCode
  105. typeCheckVariableNodeWithValue(UA_Server *server, UA_Session *session,
  106. const UA_VariableNode *node,
  107. const UA_VariableTypeNode *vt,
  108. UA_DataValue *value) {
  109. /* Check the datatype against the vt */
  110. if(!compatibleDataType(server, &node->dataType, &vt->dataType))
  111. return UA_STATUSCODE_BADTYPEMISMATCH;
  112. /* Get the array dimensions */
  113. size_t arrayDims = node->arrayDimensionsSize;
  114. if(arrayDims == 0 && value->hasValue && value->value.type &&
  115. !UA_Variant_isScalar(&value->value)) {
  116. arrayDims = 1; /* No array dimensions on an array implies one dimension */
  117. }
  118. /* Check valueRank against array dimensions */
  119. UA_StatusCode retval = compatibleValueRankArrayDimensions(node->valueRank, arrayDims);
  120. if(retval != UA_STATUSCODE_GOOD)
  121. return retval;
  122. /* Check valueRank against the vt */
  123. retval = compatibleValueRanks(node->valueRank, vt->valueRank);
  124. if(retval != UA_STATUSCODE_GOOD)
  125. return retval;
  126. /* Check array dimensions against the vt */
  127. retval = compatibleArrayDimensions(vt->arrayDimensionsSize, vt->arrayDimensions,
  128. node->arrayDimensionsSize, node->arrayDimensions);
  129. if(retval != UA_STATUSCODE_GOOD)
  130. return retval;
  131. /* Typecheck the value */
  132. if(value->hasValue) {
  133. retval = typeCheckValue(server, &node->dataType, node->valueRank,
  134. node->arrayDimensionsSize, node->arrayDimensions,
  135. &value->value, NULL, NULL);
  136. /* The type-check failed. Write the same value again. The write-service
  137. * tries to convert to the correct type... */
  138. if(retval != UA_STATUSCODE_GOOD) {
  139. UA_RCU_UNLOCK();
  140. retval = UA_Server_writeValue(server, node->nodeId, value->value);
  141. UA_RCU_LOCK();
  142. }
  143. }
  144. return retval;
  145. }
  146. /* Check the consistency of the variable (or variable type) attributes data
  147. * type, value rank, array dimensions internally and against the parent variable
  148. * type. */
  149. static UA_StatusCode
  150. typeCheckVariableNode(UA_Server *server, UA_Session *session,
  151. const UA_VariableNode *node,
  152. const UA_NodeId *typeDef) {
  153. /* Get the variable type */
  154. const UA_VariableTypeNode *vt =
  155. (const UA_VariableTypeNode*)UA_NodeStore_get(server->nodestore, typeDef);
  156. if(!vt || vt->nodeClass != UA_NODECLASS_VARIABLETYPE)
  157. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  158. if(node->nodeClass == UA_NODECLASS_VARIABLE && vt->isAbstract)
  159. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  160. /* We need the value for some checks. Might come from a datasource, so we perform a
  161. * regular read. */
  162. UA_DataValue value;
  163. UA_DataValue_init(&value);
  164. UA_StatusCode retval = readValueAttribute(server, node, &value);
  165. if(retval != UA_STATUSCODE_GOOD)
  166. return retval;
  167. /* Fix the variable: Set a sane valueRank if required (the most permissive -2) */
  168. if(node->valueRank == 0 &&
  169. (!value.hasValue || !value.value.type || UA_Variant_isScalar(&value.value))) {
  170. UA_LOG_INFO_SESSION(server->config.logger, session,
  171. "AddNodes: Use a default ValueRank of -2");
  172. UA_RCU_UNLOCK();
  173. retval = UA_Server_writeValueRank(server, node->nodeId, -2);
  174. UA_RCU_LOCK();
  175. if(retval != UA_STATUSCODE_GOOD) {
  176. UA_DataValue_deleteMembers(&value);
  177. return retval;
  178. }
  179. }
  180. /* If no value is set, see if the vt provides one and copy that. This needs
  181. * to be done before copying the datatype from the vt, as setting the datatype
  182. * triggers a typecheck. */
  183. if(!value.hasValue || !value.value.type) {
  184. retval = readValueAttribute(server, (const UA_VariableNode*)vt, &value);
  185. if(retval == UA_STATUSCODE_GOOD && value.hasValue && value.value.type) {
  186. UA_RCU_UNLOCK();
  187. retval = UA_Server_writeValue(server, node->nodeId, value.value);
  188. UA_RCU_LOCK();
  189. }
  190. if(retval != UA_STATUSCODE_GOOD) {
  191. UA_DataValue_deleteMembers(&value);
  192. return retval;
  193. }
  194. }
  195. /* Fix the variable: If no datatype is given, use the datatype of the vt */
  196. if(UA_NodeId_isNull(&node->dataType)) {
  197. UA_LOG_INFO_SESSION(server->config.logger, session, "AddNodes: "
  198. "Use a default DataType (from the TypeDefinition)");
  199. UA_RCU_UNLOCK();
  200. retval = UA_Server_writeDataType(server, node->nodeId, vt->dataType);
  201. UA_RCU_LOCK();
  202. if(retval != UA_STATUSCODE_GOOD) {
  203. UA_DataValue_deleteMembers(&value);
  204. return retval;
  205. }
  206. }
  207. #ifdef UA_ENABLE_MULTITHREADING
  208. /* Re-read the node to get the changes */
  209. node = (const UA_VariableNode*)UA_NodeStore_get(server->nodestore, &node->nodeId);
  210. #endif
  211. retval = typeCheckVariableNodeWithValue(server, session, node, vt, &value);
  212. UA_DataValue_deleteMembers(&value);
  213. return retval;
  214. }
  215. /********************/
  216. /* Instantiate Node */
  217. /********************/
  218. /* Returns an array with all subtype nodeids (including the root). Supertypes
  219. * need to have the same nodeClass as root and are (recursively) related with a
  220. * hasSubType reference. Since multi-inheritance is possible, we test for
  221. * duplicates and return evey nodeid at most once. */
  222. static UA_StatusCode
  223. getTypeHierarchy(UA_NodeStore *ns, const UA_Node *rootRef,
  224. UA_NodeId **typeHierarchy, size_t *typeHierarchySize) {
  225. size_t results_size = 20; // probably too big, but saves mallocs
  226. UA_NodeId *results = (UA_NodeId*)UA_malloc(sizeof(UA_NodeId) * results_size);
  227. if(!results)
  228. return UA_STATUSCODE_BADOUTOFMEMORY;
  229. UA_StatusCode retval = UA_NodeId_copy(&rootRef->nodeId, &results[0]);
  230. if(retval != UA_STATUSCODE_GOOD) {
  231. UA_free(results);
  232. return retval;
  233. }
  234. const UA_Node *node = rootRef;
  235. size_t idx = 0; /* Current index (contains NodeId of node) */
  236. size_t last = 0; /* Index of the last element in the array */
  237. const UA_NodeId hasSubtypeNodeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  238. while(true) {
  239. for(size_t i = 0; i < node->referencesSize; ++i) {
  240. UA_NodeReferenceKind *refs = &node->references[i];
  241. /* Are the references relevant? */
  242. if(!refs->isInverse)
  243. continue;
  244. if(!UA_NodeId_equal(&hasSubtypeNodeId, &refs->referenceTypeId))
  245. continue;
  246. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  247. UA_NodeId *targetId = &refs->targetIds[j].nodeId;
  248. /* Is the target already considered? (multi-inheritance) */
  249. UA_Boolean duplicate = false;
  250. for(size_t k = 0; k <= last; ++k) {
  251. if(UA_NodeId_equal(targetId, &results[k])) {
  252. duplicate = true;
  253. break;
  254. }
  255. }
  256. if(duplicate)
  257. continue;
  258. /* Increase array length if necessary */
  259. if(last + 1 >= results_size) {
  260. UA_NodeId *new_results =
  261. (UA_NodeId*)UA_realloc(results, sizeof(UA_NodeId) * results_size * 2);
  262. if(!new_results) {
  263. UA_Array_delete(results, last, &UA_TYPES[UA_TYPES_NODEID]);
  264. return UA_STATUSCODE_BADOUTOFMEMORY;
  265. }
  266. results = new_results;
  267. results_size *= 2;
  268. }
  269. /* Copy new nodeid to the end of the list */
  270. retval = UA_NodeId_copy(targetId, &results[++last]);
  271. if(retval != UA_STATUSCODE_GOOD) {
  272. UA_Array_delete(results, last, &UA_TYPES[UA_TYPES_NODEID]);
  273. return retval;
  274. }
  275. }
  276. }
  277. /* Get the next node */
  278. next:
  279. ++idx;
  280. if(idx > last || retval != UA_STATUSCODE_GOOD)
  281. break;
  282. node = UA_NodeStore_get(ns, &results[idx]);
  283. if(!node || node->nodeClass != rootRef->nodeClass)
  284. goto next;
  285. }
  286. *typeHierarchy = results;
  287. *typeHierarchySize = last + 1;
  288. return UA_STATUSCODE_GOOD;
  289. }
  290. static UA_StatusCode
  291. setObjectInstanceHandle(UA_Server *server, UA_Session *session, UA_ObjectNode* node,
  292. void * (*constructor)(const UA_NodeId instance)) {
  293. if(node->nodeClass != UA_NODECLASS_OBJECT)
  294. return UA_STATUSCODE_BADNODECLASSINVALID;
  295. if(!node->instanceHandle)
  296. node->instanceHandle = constructor(node->nodeId);
  297. return UA_STATUSCODE_GOOD;
  298. }
  299. /* Search for an instance of "browseName" in node searchInstance Used during
  300. * copyChildNodes to find overwritable/mergable nodes */
  301. static UA_StatusCode
  302. instanceFindAggregateByBrowsename(UA_Server *server, UA_Session *session,
  303. const UA_NodeId *searchInstance,
  304. const UA_QualifiedName *browseName,
  305. UA_NodeId *outInstanceNodeId) {
  306. UA_BrowseDescription bd;
  307. UA_BrowseDescription_init(&bd);
  308. bd.nodeId = *searchInstance;
  309. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  310. bd.includeSubtypes = true;
  311. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  312. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  313. bd.resultMask = UA_BROWSERESULTMASK_NODECLASS | UA_BROWSERESULTMASK_BROWSENAME;
  314. UA_BrowseResult br;
  315. UA_BrowseResult_init(&br);
  316. Service_Browse_single(server, session, NULL, &bd, 0, &br);
  317. if(br.statusCode != UA_STATUSCODE_GOOD)
  318. return br.statusCode;
  319. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  320. for(size_t i = 0; i < br.referencesSize; ++i) {
  321. UA_ReferenceDescription *rd = &br.references[i];
  322. if(rd->browseName.namespaceIndex == browseName->namespaceIndex &&
  323. UA_String_equal(&rd->browseName.name, &browseName->name)) {
  324. retval = UA_NodeId_copy(&rd->nodeId.nodeId, outInstanceNodeId);
  325. break;
  326. }
  327. }
  328. UA_BrowseResult_deleteMembers(&br);
  329. return retval;
  330. }
  331. static UA_Boolean
  332. isMandatoryChild(UA_Server *server, UA_Session *session, const UA_NodeId *childNodeId) {
  333. const UA_NodeId mandatoryId = UA_NODEID_NUMERIC(0, UA_NS0ID_MODELLINGRULE_MANDATORY);
  334. const UA_NodeId hasModellingRuleId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASMODELLINGRULE);
  335. /* Get the child */
  336. const UA_Node *child = UA_NodeStore_get(server->nodestore, childNodeId);
  337. if(!child)
  338. return false;
  339. /* Look for the reference making the child mandatory */
  340. for(size_t i = 0; i < child->referencesSize; ++i) {
  341. UA_NodeReferenceKind *refs = &child->references[i];
  342. if(!UA_NodeId_equal(&hasModellingRuleId, &refs->referenceTypeId))
  343. continue;
  344. if(refs->isInverse)
  345. continue;
  346. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  347. if(UA_NodeId_equal(&mandatoryId, &refs->targetIds[j].nodeId))
  348. return true;
  349. }
  350. }
  351. return false;
  352. }
  353. static UA_StatusCode
  354. copyChildNode(UA_Server *server, UA_Session *session,
  355. const UA_NodeId *destinationNodeId,
  356. const UA_ReferenceDescription *rd,
  357. UA_InstantiationCallback *instantiationCallback) {
  358. UA_NodeId existingChild = UA_NODEID_NULL;
  359. UA_StatusCode retval =
  360. instanceFindAggregateByBrowsename(server, session, destinationNodeId,
  361. &rd->browseName, &existingChild);
  362. if(retval != UA_STATUSCODE_GOOD)
  363. return retval;
  364. /* Have a child with that browseName. Try to deep-copy missing members. */
  365. if(!UA_NodeId_isNull(&existingChild)) {
  366. if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  367. rd->nodeClass == UA_NODECLASS_OBJECT)
  368. retval = copyChildNodes(server, session, &rd->nodeId.nodeId,
  369. &existingChild, instantiationCallback);
  370. UA_NodeId_deleteMembers(&existingChild);
  371. return retval;
  372. }
  373. /* Is the child mandatory? If not, skip */
  374. if(!isMandatoryChild(server, session, &rd->nodeId.nodeId))
  375. return UA_STATUSCODE_GOOD;
  376. /* No existing child with that browsename. Create it. */
  377. if(rd->nodeClass == UA_NODECLASS_METHOD) {
  378. /* Add a reference to the method in the objecttype */
  379. UA_AddReferencesItem newItem;
  380. UA_AddReferencesItem_init(&newItem);
  381. newItem.sourceNodeId = *destinationNodeId;
  382. newItem.referenceTypeId = rd->referenceTypeId;
  383. newItem.isForward = true;
  384. newItem.targetNodeId = rd->nodeId;
  385. newItem.targetNodeClass = UA_NODECLASS_METHOD;
  386. retval = addReference(server, session, &newItem);
  387. } else if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  388. rd->nodeClass == UA_NODECLASS_OBJECT) {
  389. /* Copy the node */
  390. UA_Node *node = UA_NodeStore_getCopy(server->nodestore, &rd->nodeId.nodeId);
  391. if(!node)
  392. return UA_STATUSCODE_BADNODEIDINVALID;
  393. /* Get the type */
  394. UA_NodeId typeId;
  395. getNodeType(server, node, &typeId);
  396. /* Reset the NodeId (random numeric id will be assigned in the nodestore) */
  397. UA_NodeId_deleteMembers(&node->nodeId);
  398. node->nodeId.namespaceIndex = destinationNodeId->namespaceIndex;
  399. /* Remove references, they are re-created from scratch in addnode_finish */
  400. /* TODO: Be more clever in removing references that are re-added during
  401. * addnode_finish. That way, we can call addnode_finish also on children that were
  402. * manually added by the user during addnode_begin and addnode_finish. */
  403. UA_Array_delete(node->references, node->referencesSize, &UA_TYPES[UA_TYPES_REFERENCENODE]);
  404. node->references = NULL;
  405. node->referencesSize = 0;
  406. /* Add the node to the nodestore */
  407. retval = UA_NodeStore_insert(server->nodestore, node);
  408. /* Call addnode_finish, this recursively adds members, the type definition and so on */
  409. if(retval == UA_STATUSCODE_GOOD)
  410. retval = Service_AddNode_finish(server, session, &node->nodeId,
  411. destinationNodeId, &rd->referenceTypeId,
  412. &typeId, instantiationCallback);
  413. /* Clean up */
  414. UA_NodeId_deleteMembers(&typeId);
  415. }
  416. return retval;
  417. }
  418. /* Copy any children of Node sourceNodeId to another node destinationNodeId. */
  419. static UA_StatusCode
  420. copyChildNodes(UA_Server *server, UA_Session *session,
  421. const UA_NodeId *sourceNodeId, const UA_NodeId *destinationNodeId,
  422. UA_InstantiationCallback *instantiationCallback) {
  423. /* Browse to get all children of the source */
  424. UA_BrowseDescription bd;
  425. UA_BrowseDescription_init(&bd);
  426. bd.nodeId = *sourceNodeId;
  427. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  428. bd.includeSubtypes = true;
  429. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  430. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  431. bd.resultMask = UA_BROWSERESULTMASK_REFERENCETYPEID | UA_BROWSERESULTMASK_NODECLASS |
  432. UA_BROWSERESULTMASK_BROWSENAME;
  433. UA_BrowseResult br;
  434. UA_BrowseResult_init(&br);
  435. Service_Browse_single(server, session, NULL, &bd, 0, &br);
  436. if(br.statusCode != UA_STATUSCODE_GOOD)
  437. return br.statusCode;
  438. /* Copy all children from source to destination */
  439. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  440. for(size_t i = 0; i < br.referencesSize; ++i) {
  441. UA_ReferenceDescription *rd = &br.references[i];
  442. retval |= copyChildNode(server, session, destinationNodeId,
  443. rd, instantiationCallback);
  444. }
  445. UA_BrowseResult_deleteMembers(&br);
  446. return retval;
  447. }
  448. static UA_StatusCode
  449. instantiateNode(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  450. UA_NodeClass nodeClass, const UA_NodeId *typeId,
  451. UA_InstantiationCallback *instantiationCallback) {
  452. /* Currently, only variables and objects are instantiated */
  453. if(nodeClass != UA_NODECLASS_VARIABLE &&
  454. nodeClass != UA_NODECLASS_OBJECT)
  455. return UA_STATUSCODE_GOOD;
  456. /* Get the type node */
  457. UA_ASSERT_RCU_LOCKED();
  458. const UA_Node *typenode = UA_NodeStore_get(server->nodestore, typeId);
  459. if(!typenode)
  460. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  461. /* See if the type has the correct node class */
  462. if(nodeClass == UA_NODECLASS_VARIABLE) {
  463. if(typenode->nodeClass != UA_NODECLASS_VARIABLETYPE ||
  464. ((const UA_VariableTypeNode*)typenode)->isAbstract)
  465. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  466. } else { /* nodeClass == UA_NODECLASS_OBJECT */
  467. if(typenode->nodeClass != UA_NODECLASS_OBJECTTYPE ||
  468. ((const UA_ObjectTypeNode*)typenode)->isAbstract)
  469. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  470. }
  471. /* Get the hierarchy of the type and all its supertypes */
  472. UA_NodeId *hierarchy = NULL;
  473. size_t hierarchySize = 0;
  474. UA_StatusCode retval = getTypeHierarchy(server->nodestore, typenode,
  475. &hierarchy, &hierarchySize);
  476. if(retval != UA_STATUSCODE_GOOD)
  477. return retval;
  478. /* Copy members of the type and supertypes */
  479. for(size_t i = 0; i < hierarchySize; ++i)
  480. retval |= copyChildNodes(server, session, &hierarchy[i],
  481. nodeId, instantiationCallback);
  482. UA_Array_delete(hierarchy, hierarchySize, &UA_TYPES[UA_TYPES_NODEID]);
  483. if(retval != UA_STATUSCODE_GOOD)
  484. return retval;
  485. /* Call the object constructor */
  486. if(typenode->nodeClass == UA_NODECLASS_OBJECTTYPE) {
  487. const UA_ObjectLifecycleManagement *olm =
  488. &((const UA_ObjectTypeNode*)typenode)->lifecycleManagement;
  489. if(olm->constructor) {
  490. UA_RCU_UNLOCK();
  491. UA_Server_editNode(server, session, nodeId,
  492. (UA_EditNodeCallback)setObjectInstanceHandle,
  493. olm->constructor);
  494. UA_RCU_LOCK();
  495. }
  496. }
  497. /* Add a hasType reference */
  498. UA_AddReferencesItem addref;
  499. UA_AddReferencesItem_init(&addref);
  500. addref.sourceNodeId = *nodeId;
  501. addref.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  502. addref.isForward = true;
  503. addref.targetNodeId.nodeId = *typeId;
  504. retval = addReference(server, session, &addref);
  505. /* Call custom callback */
  506. if(retval == UA_STATUSCODE_GOOD && instantiationCallback)
  507. instantiationCallback->method(*nodeId, *typeId, instantiationCallback->handle);
  508. return retval;
  509. }
  510. /***************************************/
  511. /* Set node from attribute description */
  512. /***************************************/
  513. static UA_StatusCode
  514. copyStandardAttributes(UA_Node *node, const UA_AddNodesItem *item,
  515. const UA_NodeAttributes *attr) {
  516. UA_StatusCode retval;
  517. retval = UA_NodeId_copy(&item->requestedNewNodeId.nodeId, &node->nodeId);
  518. retval |= UA_QualifiedName_copy(&item->browseName, &node->browseName);
  519. retval |= UA_LocalizedText_copy(&attr->displayName, &node->displayName);
  520. retval |= UA_LocalizedText_copy(&attr->description, &node->description);
  521. node->writeMask = attr->writeMask;
  522. return retval;
  523. }
  524. static UA_StatusCode
  525. copyCommonVariableAttributes(UA_VariableNode *node,
  526. const UA_VariableAttributes *attr) {
  527. /* Copy the array dimensions */
  528. UA_StatusCode retval =
  529. UA_Array_copy(attr->arrayDimensions, attr->arrayDimensionsSize,
  530. (void**)&node->arrayDimensions, &UA_TYPES[UA_TYPES_UINT32]);
  531. if(retval != UA_STATUSCODE_GOOD)
  532. return retval;
  533. node->arrayDimensionsSize = attr->arrayDimensionsSize;
  534. /* Data type and value rank */
  535. retval |= UA_NodeId_copy(&attr->dataType, &node->dataType);
  536. node->valueRank = attr->valueRank;
  537. /* Copy the value */
  538. node->valueSource = UA_VALUESOURCE_DATA;
  539. retval |= UA_Variant_copy(&attr->value, &node->value.data.value.value);
  540. node->value.data.value.hasValue = true;
  541. return retval;
  542. }
  543. static UA_StatusCode
  544. copyVariableNodeAttributes(UA_VariableNode *vnode,
  545. const UA_VariableAttributes *attr) {
  546. vnode->accessLevel = attr->accessLevel;
  547. vnode->historizing = attr->historizing;
  548. vnode->minimumSamplingInterval = attr->minimumSamplingInterval;
  549. return copyCommonVariableAttributes(vnode, attr);
  550. }
  551. static UA_StatusCode
  552. copyVariableTypeNodeAttributes(UA_VariableTypeNode *vtnode,
  553. const UA_VariableTypeAttributes *attr) {
  554. vtnode->isAbstract = attr->isAbstract;
  555. return copyCommonVariableAttributes((UA_VariableNode*)vtnode,
  556. (const UA_VariableAttributes*)attr);
  557. }
  558. static UA_StatusCode
  559. copyObjectNodeAttributes(UA_ObjectNode *onode, const UA_ObjectAttributes *attr) {
  560. onode->eventNotifier = attr->eventNotifier;
  561. return UA_STATUSCODE_GOOD;
  562. }
  563. static UA_StatusCode
  564. copyReferenceTypeNodeAttributes(UA_ReferenceTypeNode *rtnode,
  565. const UA_ReferenceTypeAttributes *attr) {
  566. rtnode->isAbstract = attr->isAbstract;
  567. rtnode->symmetric = attr->symmetric;
  568. return UA_LocalizedText_copy(&attr->inverseName, &rtnode->inverseName);
  569. }
  570. static UA_StatusCode
  571. copyObjectTypeNodeAttributes(UA_ObjectTypeNode *otnode,
  572. const UA_ObjectTypeAttributes *attr) {
  573. otnode->isAbstract = attr->isAbstract;
  574. return UA_STATUSCODE_GOOD;
  575. }
  576. static UA_StatusCode
  577. copyViewNodeAttributes(UA_ViewNode *vnode, const UA_ViewAttributes *attr) {
  578. vnode->containsNoLoops = attr->containsNoLoops;
  579. vnode->eventNotifier = attr->eventNotifier;
  580. return UA_STATUSCODE_GOOD;
  581. }
  582. static UA_StatusCode
  583. copyDataTypeNodeAttributes(UA_DataTypeNode *dtnode,
  584. const UA_DataTypeAttributes *attr) {
  585. dtnode->isAbstract = attr->isAbstract;
  586. return UA_STATUSCODE_GOOD;
  587. }
  588. #define CHECK_ATTRIBUTES(TYPE) \
  589. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_##TYPE]) { \
  590. retval = UA_STATUSCODE_BADNODEATTRIBUTESINVALID; \
  591. break; \
  592. }
  593. /* Copy the attributes into a new node. On success, newNode points to the
  594. * created node */
  595. static UA_StatusCode
  596. createNodeFromAttributes(const UA_AddNodesItem *item, UA_Node **newNode) {
  597. /* Check that we can read the attributes */
  598. if(item->nodeAttributes.encoding < UA_EXTENSIONOBJECT_DECODED ||
  599. !item->nodeAttributes.content.decoded.type)
  600. return UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  601. /* Create the node */
  602. // todo: error case where the nodeclass is faulty should return a different
  603. // status code
  604. UA_Node *node = UA_NodeStore_newNode(item->nodeClass);
  605. if(!node)
  606. return UA_STATUSCODE_BADOUTOFMEMORY;
  607. /* Copy the attributes into the node */
  608. void *data = item->nodeAttributes.content.decoded.data;
  609. UA_StatusCode retval = copyStandardAttributes(node, item,
  610. (const UA_NodeAttributes*)data);
  611. switch(item->nodeClass) {
  612. case UA_NODECLASS_OBJECT:
  613. CHECK_ATTRIBUTES(OBJECTATTRIBUTES);
  614. retval |= copyObjectNodeAttributes((UA_ObjectNode*)node,
  615. (const UA_ObjectAttributes*)data);
  616. break;
  617. case UA_NODECLASS_VARIABLE:
  618. CHECK_ATTRIBUTES(VARIABLEATTRIBUTES);
  619. retval |= copyVariableNodeAttributes((UA_VariableNode*)node,
  620. (const UA_VariableAttributes*)data);
  621. break;
  622. case UA_NODECLASS_OBJECTTYPE:
  623. CHECK_ATTRIBUTES(OBJECTTYPEATTRIBUTES);
  624. retval |= copyObjectTypeNodeAttributes((UA_ObjectTypeNode*)node,
  625. (const UA_ObjectTypeAttributes*)data);
  626. break;
  627. case UA_NODECLASS_VARIABLETYPE:
  628. CHECK_ATTRIBUTES(VARIABLETYPEATTRIBUTES);
  629. retval |= copyVariableTypeNodeAttributes((UA_VariableTypeNode*)node,
  630. (const UA_VariableTypeAttributes*)data);
  631. break;
  632. case UA_NODECLASS_REFERENCETYPE:
  633. CHECK_ATTRIBUTES(REFERENCETYPEATTRIBUTES);
  634. retval |= copyReferenceTypeNodeAttributes((UA_ReferenceTypeNode*)node,
  635. (const UA_ReferenceTypeAttributes*)data);
  636. break;
  637. case UA_NODECLASS_DATATYPE:
  638. CHECK_ATTRIBUTES(DATATYPEATTRIBUTES);
  639. retval |= copyDataTypeNodeAttributes((UA_DataTypeNode*)node,
  640. (const UA_DataTypeAttributes*)data);
  641. break;
  642. case UA_NODECLASS_VIEW:
  643. CHECK_ATTRIBUTES(VIEWATTRIBUTES);
  644. retval |= copyViewNodeAttributes((UA_ViewNode*)node,
  645. (const UA_ViewAttributes*)data);
  646. break;
  647. case UA_NODECLASS_METHOD:
  648. case UA_NODECLASS_UNSPECIFIED:
  649. default:
  650. retval = UA_STATUSCODE_BADNODECLASSINVALID;
  651. }
  652. if(retval == UA_STATUSCODE_GOOD)
  653. *newNode = (UA_Node*)node;
  654. else
  655. UA_NodeStore_deleteNode(node);
  656. return retval;
  657. }
  658. /************/
  659. /* Add Node */
  660. /************/
  661. static void
  662. Service_AddNode_begin(UA_Server *server, UA_Session *session,
  663. const UA_AddNodesItem *item, UA_AddNodesResult *result) {
  664. /* Check the namespaceindex */
  665. if(item->requestedNewNodeId.nodeId.namespaceIndex >= server->namespacesSize) {
  666. UA_LOG_INFO_SESSION(server->config.logger, session,
  667. "AddNodes: Namespace invalid");
  668. result->statusCode = UA_STATUSCODE_BADNODEIDINVALID;
  669. return;
  670. }
  671. /* Add the node to the nodestore */
  672. UA_Node *node = NULL;
  673. result->statusCode = createNodeFromAttributes(item, &node);
  674. if(result->statusCode == UA_STATUSCODE_GOOD)
  675. result->statusCode = UA_NodeStore_insert(server->nodestore, node);
  676. if(result->statusCode != UA_STATUSCODE_GOOD) {
  677. UA_LOG_INFO_SESSION(server->config.logger, session,
  678. "AddNodes: Node could not be added to the "
  679. "nodestore with error code %s",
  680. UA_StatusCode_name(result->statusCode));
  681. return;
  682. }
  683. /* Copy the nodeid of the new node */
  684. result->statusCode = UA_NodeId_copy(&node->nodeId, &result->addedNodeId);
  685. if(result->statusCode != UA_STATUSCODE_GOOD) {
  686. UA_LOG_INFO_SESSION(server->config.logger, session,
  687. "AddNodes: Could not copy the nodeid");
  688. deleteNode(server, &adminSession, &node->nodeId, true);
  689. }
  690. }
  691. static UA_StatusCode
  692. Service_AddNode_finish(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  693. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId,
  694. const UA_NodeId *typeDefinition,
  695. UA_InstantiationCallback *instantiationCallback) {
  696. /* Get the node */
  697. const UA_Node *node = UA_NodeStore_get(server->nodestore, nodeId);
  698. if(!node)
  699. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  700. /* Use the typeDefinition as parent for type-nodes */
  701. const UA_NodeId hasSubtype = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  702. if(node->nodeClass == UA_NODECLASS_VARIABLETYPE ||
  703. node->nodeClass == UA_NODECLASS_OBJECTTYPE ||
  704. node->nodeClass == UA_NODECLASS_REFERENCETYPE ||
  705. node->nodeClass == UA_NODECLASS_DATATYPE) {
  706. referenceTypeId = &hasSubtype;
  707. typeDefinition = parentNodeId;
  708. }
  709. /* Workaround: Replace empty typeDefinition with the most permissive default */
  710. const UA_NodeId baseDataVariableType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATAVARIABLETYPE);
  711. const UA_NodeId baseObjectType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEOBJECTTYPE);
  712. if((node->nodeClass == UA_NODECLASS_VARIABLE || node->nodeClass == UA_NODECLASS_OBJECT) &&
  713. UA_NodeId_isNull(typeDefinition)) {
  714. UA_LOG_INFO_SESSION(server->config.logger, session, "AddNodes: Use a default "
  715. "TypeDefinition for the Variable/Object");
  716. if(node->nodeClass == UA_NODECLASS_VARIABLE)
  717. typeDefinition = &baseDataVariableType;
  718. else
  719. typeDefinition = &baseObjectType;
  720. }
  721. /* Check parent reference. Objects may have no parent. */
  722. UA_StatusCode retval = checkParentReference(server, session, node->nodeClass,
  723. parentNodeId, referenceTypeId);
  724. if(retval != UA_STATUSCODE_GOOD) {
  725. UA_LOG_INFO_SESSION(server->config.logger, session,
  726. "AddNodes: The parent reference is invalid");
  727. deleteNode(server, &adminSession, nodeId, true);
  728. return retval;
  729. }
  730. /* Instantiate node. We need the variable type for type checking (e.g. when
  731. * writing into attributes) */
  732. retval = instantiateNode(server, session, nodeId, node->nodeClass,
  733. typeDefinition, instantiationCallback);
  734. if(retval != UA_STATUSCODE_GOOD) {
  735. UA_LOG_INFO_SESSION(server->config.logger, session,
  736. "AddNodes: Node instantiation failed "
  737. "with code %s", UA_StatusCode_name(retval));
  738. deleteNode(server, &adminSession, nodeId, true);
  739. return retval;
  740. }
  741. /* Type check node */
  742. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  743. node->nodeClass == UA_NODECLASS_VARIABLETYPE) {
  744. retval = typeCheckVariableNode(server, session, (const UA_VariableNode*)node, typeDefinition);
  745. if(retval != UA_STATUSCODE_GOOD) {
  746. UA_LOG_INFO_SESSION(server->config.logger, session,
  747. "AddNodes: Type checking failed with error code %s",
  748. UA_StatusCode_name(retval));
  749. deleteNode(server, &adminSession, nodeId, true);
  750. return retval;
  751. }
  752. }
  753. /* Add parent reference */
  754. if(!UA_NodeId_isNull(parentNodeId)) {
  755. UA_AddReferencesItem ref_item;
  756. UA_AddReferencesItem_init(&ref_item);
  757. ref_item.sourceNodeId = node->nodeId;
  758. ref_item.referenceTypeId = *referenceTypeId;
  759. ref_item.isForward = false;
  760. ref_item.targetNodeId.nodeId = *parentNodeId;
  761. retval = addReference(server, session, &ref_item);
  762. if(retval != UA_STATUSCODE_GOOD) {
  763. UA_LOG_INFO_SESSION(server->config.logger, session,
  764. "AddNodes: Adding reference to parent failed");
  765. deleteNode(server, &adminSession, nodeId, true);
  766. return retval;
  767. }
  768. }
  769. return UA_STATUSCODE_GOOD;
  770. }
  771. static void
  772. Service_AddNodes_single(UA_Server *server, UA_Session *session,
  773. const UA_AddNodesItem *item, UA_AddNodesResult *result,
  774. UA_InstantiationCallback *instantiationCallback) {
  775. /* AddNodes_begin */
  776. Service_AddNode_begin(server, session, item, result);
  777. if(result->statusCode != UA_STATUSCODE_GOOD)
  778. return;
  779. /* AddNodes_finish */
  780. result->statusCode =
  781. Service_AddNode_finish(server, session, &result->addedNodeId,
  782. &item->parentNodeId.nodeId, &item->referenceTypeId,
  783. &item->typeDefinition.nodeId, instantiationCallback);
  784. /* If finishing failed, don't even return a NodeId of the added node */
  785. if(result->statusCode != UA_STATUSCODE_GOOD)
  786. UA_NodeId_deleteMembers(&result->addedNodeId);
  787. }
  788. void Service_AddNodes(UA_Server *server, UA_Session *session,
  789. const UA_AddNodesRequest *request,
  790. UA_AddNodesResponse *response) {
  791. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  792. "Processing AddNodesRequest");
  793. if(request->nodesToAddSize <= 0) {
  794. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  795. return;
  796. }
  797. size_t size = request->nodesToAddSize;
  798. response->results =
  799. (UA_AddNodesResult*)UA_Array_new(size, &UA_TYPES[UA_TYPES_ADDNODESRESULT]);
  800. if(!response->results) {
  801. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  802. return;
  803. }
  804. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  805. #ifdef _MSC_VER
  806. UA_Boolean *isExternal = UA_alloca(size);
  807. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32)*size);
  808. #else
  809. UA_Boolean isExternal[size];
  810. UA_UInt32 indices[size];
  811. #endif
  812. memset(isExternal, false, sizeof(UA_Boolean) * size);
  813. for(size_t j = 0; j <server->externalNamespacesSize; ++j) {
  814. size_t indexSize = 0;
  815. for(size_t i = 0;i < size;++i) {
  816. if(request->nodesToAdd[i].requestedNewNodeId.nodeId.namespaceIndex !=
  817. server->externalNamespaces[j].index)
  818. continue;
  819. isExternal[i] = true;
  820. indices[indexSize] = (UA_UInt32)i;
  821. ++indexSize;
  822. }
  823. if(indexSize == 0)
  824. continue;
  825. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  826. ens->addNodes(ens->ensHandle, &request->requestHeader,
  827. request->nodesToAdd, indices, (UA_UInt32)indexSize,
  828. response->results, response->diagnosticInfos);
  829. }
  830. #endif
  831. response->resultsSize = size;
  832. for(size_t i = 0; i < size; ++i) {
  833. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  834. if(!isExternal[i])
  835. #endif
  836. Service_AddNodes_single(server, session, &request->nodesToAdd[i],
  837. &response->results[i], NULL);
  838. }
  839. }
  840. UA_StatusCode
  841. __UA_Server_addNode(UA_Server *server, const UA_NodeClass nodeClass,
  842. const UA_NodeId *requestedNewNodeId,
  843. const UA_NodeId *parentNodeId,
  844. const UA_NodeId *referenceTypeId,
  845. const UA_QualifiedName browseName,
  846. const UA_NodeId *typeDefinition,
  847. const UA_NodeAttributes *attr,
  848. const UA_DataType *attributeType,
  849. UA_InstantiationCallback *instantiationCallback,
  850. UA_NodeId *outNewNodeId) {
  851. /* Create the AddNodesItem */
  852. UA_AddNodesItem item;
  853. UA_AddNodesItem_init(&item);
  854. item.requestedNewNodeId.nodeId = *requestedNewNodeId;
  855. item.browseName = browseName;
  856. item.nodeClass = nodeClass;
  857. item.parentNodeId.nodeId = *parentNodeId;
  858. item.referenceTypeId = *referenceTypeId;
  859. item.typeDefinition.nodeId = *typeDefinition;
  860. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  861. item.nodeAttributes.content.decoded.type =attributeType;
  862. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  863. /* Call the normal addnodes service */
  864. UA_AddNodesResult result;
  865. UA_AddNodesResult_init(&result);
  866. UA_RCU_LOCK();
  867. Service_AddNodes_single(server, &adminSession, &item, &result, instantiationCallback);
  868. UA_RCU_UNLOCK();
  869. if(outNewNodeId)
  870. *outNewNodeId = result.addedNodeId;
  871. else
  872. UA_NodeId_deleteMembers(&result.addedNodeId);
  873. return result.statusCode;
  874. }
  875. UA_StatusCode
  876. __UA_Server_addNode_begin(UA_Server *server, const UA_NodeClass nodeClass,
  877. const UA_NodeId *requestedNewNodeId,
  878. const UA_QualifiedName *browseName,
  879. const UA_NodeAttributes *attr,
  880. const UA_DataType *attributeType,
  881. UA_NodeId *outNewNodeId) {
  882. /* Create the item */
  883. UA_AddNodesItem item;
  884. UA_AddNodesItem_init(&item);
  885. item.requestedNewNodeId.nodeId = *requestedNewNodeId;
  886. item.browseName = *browseName;
  887. item.nodeClass = nodeClass;
  888. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  889. item.nodeAttributes.content.decoded.type = attributeType;
  890. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  891. /* Add the node without checks or instantiation */
  892. UA_AddNodesResult result;
  893. UA_AddNodesResult_init(&result);
  894. UA_RCU_LOCK();
  895. Service_AddNode_begin(server, &adminSession, &item, &result);
  896. if(outNewNodeId)
  897. *outNewNodeId = result.addedNodeId;
  898. else
  899. UA_NodeId_deleteMembers(&result.addedNodeId);
  900. UA_RCU_UNLOCK();
  901. return result.statusCode;
  902. }
  903. UA_StatusCode
  904. UA_Server_addNode_finish(UA_Server *server, const UA_NodeId nodeId,
  905. const UA_NodeId parentNodeId,
  906. const UA_NodeId referenceTypeId,
  907. const UA_NodeId typeDefinition,
  908. UA_InstantiationCallback *instantiationCallback) {
  909. UA_RCU_LOCK();
  910. UA_StatusCode retval = Service_AddNode_finish(server, &adminSession, &nodeId, &parentNodeId,
  911. &referenceTypeId, &typeDefinition,
  912. instantiationCallback);
  913. UA_RCU_UNLOCK();
  914. return retval;
  915. }
  916. /**************************************************/
  917. /* Add Special Nodes (not possible over the wire) */
  918. /**************************************************/
  919. UA_StatusCode
  920. UA_Server_addDataSourceVariableNode(UA_Server *server,
  921. const UA_NodeId requestedNewNodeId,
  922. const UA_NodeId parentNodeId,
  923. const UA_NodeId referenceTypeId,
  924. const UA_QualifiedName browseName,
  925. const UA_NodeId typeDefinition,
  926. const UA_VariableAttributes attr,
  927. const UA_DataSource dataSource,
  928. UA_NodeId *outNewNodeId) {
  929. UA_NodeId newNodeId;
  930. UA_Boolean deleteNodeId = UA_FALSE;
  931. if(!outNewNodeId) {
  932. newNodeId = UA_NODEID_NULL;
  933. outNewNodeId = &newNodeId;
  934. deleteNodeId = UA_TRUE;
  935. }
  936. UA_StatusCode retval = UA_Server_addVariableNode_begin(server, requestedNewNodeId,
  937. browseName, attr, outNewNodeId);
  938. if(retval != UA_STATUSCODE_GOOD)
  939. return retval;
  940. retval = UA_Server_setVariableNode_dataSource(server, *outNewNodeId, dataSource);
  941. if(retval == UA_STATUSCODE_GOOD)
  942. retval = UA_Server_addNode_finish(server, *outNewNodeId,
  943. parentNodeId, referenceTypeId,
  944. typeDefinition, NULL);
  945. if(retval != UA_STATUSCODE_GOOD || deleteNodeId)
  946. UA_NodeId_deleteMembers(outNewNodeId);
  947. return UA_STATUSCODE_GOOD;
  948. }
  949. #ifdef UA_ENABLE_METHODCALLS
  950. UA_StatusCode
  951. UA_Server_addMethodNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  952. const UA_QualifiedName browseName,
  953. const UA_MethodAttributes attr,
  954. UA_MethodCallback method, void *handle,
  955. UA_NodeId *outNewNodeId) {
  956. /* Create the node */
  957. UA_MethodNode *node = (UA_MethodNode*)UA_NodeStore_newNode(UA_NODECLASS_METHOD);
  958. if(!node)
  959. return UA_STATUSCODE_BADOUTOFMEMORY;
  960. /* Set the node attributes */
  961. node->executable = attr.executable;
  962. node->attachedMethod = method;
  963. node->methodHandle = handle;
  964. UA_AddNodesItem item;
  965. UA_AddNodesItem_init(&item);
  966. item.requestedNewNodeId.nodeId = requestedNewNodeId;
  967. item.browseName = browseName;
  968. UA_StatusCode retval =
  969. copyStandardAttributes((UA_Node*)node, &item, (const UA_NodeAttributes*)&attr);
  970. if(retval != UA_STATUSCODE_GOOD) {
  971. UA_NodeStore_deleteNode((UA_Node*)node);
  972. return retval;
  973. }
  974. /* Add the node to the nodestore */
  975. UA_RCU_LOCK();
  976. retval = UA_NodeStore_insert(server->nodestore, (UA_Node*)node);
  977. if(outNewNodeId) {
  978. retval = UA_NodeId_copy(&node->nodeId, outNewNodeId);
  979. if(retval != UA_STATUSCODE_GOOD)
  980. UA_NodeStore_remove(server->nodestore, &node->nodeId);
  981. }
  982. UA_RCU_UNLOCK();
  983. return retval;
  984. }
  985. UA_StatusCode
  986. UA_Server_addMethodNode_finish(UA_Server *server, const UA_NodeId nodeId,
  987. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  988. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  989. size_t outputArgumentsSize, const UA_Argument* outputArguments) {
  990. const UA_NodeId hasproperty = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  991. const UA_NodeId propertytype = UA_NODEID_NUMERIC(0, UA_NS0ID_PROPERTYTYPE);
  992. const UA_NodeId argsId = UA_NODEID_NUMERIC(nodeId.namespaceIndex, 0);
  993. /* Browse to see which argument nodes exist */
  994. UA_BrowseDescription bd;
  995. UA_BrowseDescription_init(&bd);
  996. bd.nodeId = nodeId;
  997. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  998. bd.includeSubtypes = false;
  999. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  1000. bd.nodeClassMask = UA_NODECLASS_VARIABLE;
  1001. bd.resultMask = UA_BROWSERESULTMASK_BROWSENAME;
  1002. UA_BrowseResult br;
  1003. UA_BrowseResult_init(&br);
  1004. UA_RCU_LOCK();
  1005. Service_Browse_single(server, &adminSession, NULL, &bd, 0, &br);
  1006. UA_RCU_UNLOCK();
  1007. UA_StatusCode retval = br.statusCode;
  1008. if(retval != UA_STATUSCODE_GOOD) {
  1009. UA_RCU_LOCK();
  1010. deleteNode(server, &adminSession, &nodeId, true);
  1011. UA_RCU_UNLOCK();
  1012. UA_BrowseResult_deleteMembers(&br);
  1013. return retval;
  1014. }
  1015. /* Filter out the argument nodes */
  1016. UA_NodeId inputArgsId = UA_NODEID_NULL;
  1017. UA_NodeId outputArgsId = UA_NODEID_NULL;
  1018. const UA_QualifiedName inputArgsName = UA_QUALIFIEDNAME(0, "InputArguments");
  1019. const UA_QualifiedName outputArgsName = UA_QUALIFIEDNAME(0, "OutputArguments");
  1020. for(size_t i = 0; i < br.referencesSize; i++) {
  1021. UA_ReferenceDescription *rd = &br.references[i];
  1022. if(rd->browseName.namespaceIndex == 0 &&
  1023. UA_String_equal(&rd->browseName.name, &inputArgsName.name))
  1024. inputArgsId = rd->nodeId.nodeId;
  1025. else if(rd->browseName.namespaceIndex == 0 &&
  1026. UA_String_equal(&rd->browseName.name, &outputArgsName.name))
  1027. outputArgsId = rd->nodeId.nodeId;
  1028. }
  1029. /* Add the Input Arguments VariableNode */
  1030. if(inputArgumentsSize > 0 && UA_NodeId_isNull(&inputArgsId)) {
  1031. UA_VariableAttributes inputargs;
  1032. UA_VariableAttributes_init(&inputargs);
  1033. inputargs.displayName = UA_LOCALIZEDTEXT("en_US", "InputArguments");
  1034. /* UAExpert creates a monitoreditem on inputarguments ... */
  1035. inputargs.minimumSamplingInterval = 100000.0f;
  1036. inputargs.valueRank = 1;
  1037. inputargs.dataType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATATYPE);
  1038. /* dirty-cast, but is treated as const ... */
  1039. UA_Variant_setArray(&inputargs.value, (void*)(uintptr_t)inputArguments,
  1040. inputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1041. retval = UA_Server_addVariableNode(server, argsId, nodeId, hasproperty,
  1042. inputArgsName, propertytype, inputargs,
  1043. NULL, &inputArgsId);
  1044. }
  1045. /* Add the Output Arguments VariableNode */
  1046. if(outputArgumentsSize > 0 && UA_NodeId_isNull(&outputArgsId)) {
  1047. UA_VariableAttributes outputargs;
  1048. UA_VariableAttributes_init(&outputargs);
  1049. outputargs.displayName = UA_LOCALIZEDTEXT("en_US", "OutputArguments");
  1050. /* UAExpert creates a monitoreditem on outputarguments ... */
  1051. outputargs.minimumSamplingInterval = 100000.0f;
  1052. outputargs.valueRank = 1;
  1053. outputargs.dataType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATATYPE);
  1054. /* dirty-cast, but is treated as const ... */
  1055. UA_Variant_setArray(&outputargs.value, (void*)(uintptr_t)outputArguments,
  1056. outputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1057. retval |= UA_Server_addVariableNode(server, argsId, nodeId, hasproperty,
  1058. outputArgsName, propertytype, outputargs,
  1059. NULL, &outputArgsId);
  1060. }
  1061. /* Call finish to add the parent reference */
  1062. UA_RCU_LOCK();
  1063. retval |= Service_AddNode_finish(server, &adminSession, &nodeId, &parentNodeId,
  1064. &referenceTypeId, &UA_NODEID_NULL, NULL);
  1065. UA_RCU_UNLOCK();
  1066. if(retval != UA_STATUSCODE_GOOD) {
  1067. deleteNode(server, &adminSession, &nodeId, true);
  1068. deleteNode(server, &adminSession, &inputArgsId, true);
  1069. deleteNode(server, &adminSession, &outputArgsId, true);
  1070. }
  1071. UA_BrowseResult_deleteMembers(&br);
  1072. return retval;
  1073. }
  1074. UA_StatusCode
  1075. UA_Server_addMethodNode(UA_Server *server, const UA_NodeId requestedNewNodeId,
  1076. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  1077. const UA_QualifiedName browseName, const UA_MethodAttributes attr,
  1078. UA_MethodCallback method, void *handle,
  1079. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  1080. size_t outputArgumentsSize, const UA_Argument* outputArguments,
  1081. UA_NodeId *outNewNodeId) {
  1082. UA_NodeId newId;
  1083. if(!outNewNodeId) {
  1084. UA_NodeId_init(&newId);
  1085. outNewNodeId = &newId;
  1086. }
  1087. /* Call begin */
  1088. UA_StatusCode retval =
  1089. UA_Server_addMethodNode_begin(server, requestedNewNodeId, browseName,
  1090. attr, method, handle, outNewNodeId);
  1091. if(retval != UA_STATUSCODE_GOOD)
  1092. return retval;
  1093. /* Call finish */
  1094. retval = UA_Server_addMethodNode_finish(server, *outNewNodeId,
  1095. parentNodeId, referenceTypeId,
  1096. inputArgumentsSize, inputArguments,
  1097. outputArgumentsSize, outputArguments);
  1098. if(outNewNodeId == &newId)
  1099. UA_NodeId_deleteMembers(&newId);
  1100. return retval;
  1101. }
  1102. #endif
  1103. /******************/
  1104. /* Add References */
  1105. /******************/
  1106. static UA_StatusCode
  1107. addOneWayTarget(UA_NodeReferenceKind *refs, const UA_ExpandedNodeId *target) {
  1108. UA_ExpandedNodeId *targets =
  1109. (UA_ExpandedNodeId*) UA_realloc(refs->targetIds,
  1110. sizeof(UA_ExpandedNodeId) * (refs->targetIdsSize+1));
  1111. if(!targets)
  1112. return UA_STATUSCODE_BADOUTOFMEMORY;
  1113. refs->targetIds = targets;
  1114. UA_StatusCode retval = UA_ExpandedNodeId_copy(target, &refs->targetIds[refs->targetIdsSize]);
  1115. if(retval != UA_STATUSCODE_GOOD && refs->targetIds == 0) {
  1116. UA_free(refs->targetIds);
  1117. refs->targetIds = NULL;
  1118. return retval;
  1119. }
  1120. refs->targetIdsSize++;
  1121. return retval;
  1122. }
  1123. static UA_StatusCode
  1124. addOneWayNodeReferences(UA_Node *node, const UA_AddReferencesItem *item) {
  1125. UA_NodeReferenceKind *refs =
  1126. (UA_NodeReferenceKind*)UA_realloc(node->references,
  1127. sizeof(UA_NodeReferenceKind) * (node->referencesSize+1));
  1128. if(!refs)
  1129. return UA_STATUSCODE_BADOUTOFMEMORY;
  1130. node->references = refs;
  1131. UA_NodeReferenceKind *newRef = &refs[node->referencesSize];
  1132. memset(newRef, 0, sizeof(UA_NodeReferenceKind));
  1133. newRef->isInverse = !item->isForward;
  1134. UA_StatusCode retval = UA_NodeId_copy(&item->referenceTypeId, &newRef->referenceTypeId);
  1135. retval |= addOneWayTarget(newRef, &item->targetNodeId);
  1136. if(retval == UA_STATUSCODE_GOOD) {
  1137. node->referencesSize++;
  1138. } else {
  1139. UA_NodeId_deleteMembers(&newRef->referenceTypeId);
  1140. if(node->referencesSize == 0) {
  1141. UA_free(node->references);
  1142. node->references = NULL;
  1143. }
  1144. }
  1145. return retval;
  1146. }
  1147. /* Adds a one-way reference to the local nodestore */
  1148. static UA_StatusCode
  1149. addOneWayReference(UA_Server *server, UA_Session *session,
  1150. UA_Node *node, const UA_AddReferencesItem *item) {
  1151. for(size_t i = 0; i < node->referencesSize; ++i) {
  1152. UA_NodeReferenceKind *refs = &node->references[i];
  1153. if(refs->isInverse == item->isForward)
  1154. continue;
  1155. if(!UA_NodeId_equal(&refs->referenceTypeId, &item->referenceTypeId))
  1156. continue;
  1157. return addOneWayTarget(refs, &item->targetNodeId);
  1158. }
  1159. return addOneWayNodeReferences(node, item);
  1160. }
  1161. static UA_StatusCode
  1162. addReference(UA_Server *server, UA_Session *session,
  1163. const UA_AddReferencesItem *item) {
  1164. /* Currently no expandednodeids are allowed */
  1165. if(item->targetServerUri.length > 0)
  1166. return UA_STATUSCODE_BADNOTIMPLEMENTED;
  1167. /* Add the first direction */
  1168. #ifndef UA_ENABLE_EXTERNAL_NAMESPACES
  1169. UA_RCU_UNLOCK();
  1170. UA_StatusCode retval =
  1171. UA_Server_editNode(server, session, &item->sourceNodeId,
  1172. (UA_EditNodeCallback)addOneWayReference, item);
  1173. UA_RCU_LOCK();
  1174. #else
  1175. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1176. UA_Boolean handledExternally = UA_FALSE;
  1177. for(size_t j = 0; j <server->externalNamespacesSize; ++j) {
  1178. if(item->sourceNodeId.namespaceIndex != server->externalNamespaces[j].index) {
  1179. continue;
  1180. } else {
  1181. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  1182. retval = (UA_StatusCode)ens->addOneWayReference(ens->ensHandle, item);
  1183. handledExternally = UA_TRUE;
  1184. break;
  1185. }
  1186. }
  1187. if(!handledExternally) {
  1188. UA_RCU_UNLOCK();
  1189. retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  1190. (UA_EditNodeCallback)addOneWayReference, item);
  1191. UA_RCU_LOCK();
  1192. }
  1193. #endif
  1194. if(retval != UA_STATUSCODE_GOOD)
  1195. return retval;
  1196. /* Add the second direction */
  1197. UA_AddReferencesItem secondItem;
  1198. UA_AddReferencesItem_init(&secondItem);
  1199. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1200. secondItem.referenceTypeId = item->referenceTypeId;
  1201. secondItem.isForward = !item->isForward;
  1202. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1203. /* keep default secondItem.targetNodeClass = UA_NODECLASS_UNSPECIFIED */
  1204. #ifndef UA_ENABLE_EXTERNAL_NAMESPACES
  1205. UA_RCU_UNLOCK();
  1206. retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1207. (UA_EditNodeCallback)addOneWayReference, &secondItem);
  1208. UA_RCU_LOCK();
  1209. #else
  1210. handledExternally = UA_FALSE;
  1211. for(size_t j = 0; j < server->externalNamespacesSize; ++j) {
  1212. if(secondItem.sourceNodeId.namespaceIndex != server->externalNamespaces[j].index) {
  1213. continue;
  1214. } else {
  1215. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  1216. retval = (UA_StatusCode)ens->addOneWayReference(ens->ensHandle, &secondItem);
  1217. handledExternally = UA_TRUE;
  1218. break;
  1219. }
  1220. }
  1221. if(!handledExternally) {
  1222. UA_RCU_UNLOCK();
  1223. retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1224. (UA_EditNodeCallback)addOneWayReference, &secondItem);
  1225. UA_RCU_LOCK();
  1226. }
  1227. #endif
  1228. /* remove reference if the second direction failed */
  1229. if(retval != UA_STATUSCODE_GOOD) {
  1230. UA_DeleteReferencesItem deleteItem;
  1231. deleteItem.sourceNodeId = item->sourceNodeId;
  1232. deleteItem.referenceTypeId = item->referenceTypeId;
  1233. deleteItem.isForward = item->isForward;
  1234. deleteItem.targetNodeId = item->targetNodeId;
  1235. deleteItem.deleteBidirectional = false;
  1236. /* ignore returned status code */
  1237. UA_RCU_UNLOCK();
  1238. UA_Server_editNode(server, session, &item->sourceNodeId,
  1239. (UA_EditNodeCallback)deleteOneWayReference, &deleteItem);
  1240. UA_RCU_LOCK();
  1241. }
  1242. return retval;
  1243. }
  1244. void Service_AddReferences(UA_Server *server, UA_Session *session,
  1245. const UA_AddReferencesRequest *request,
  1246. UA_AddReferencesResponse *response) {
  1247. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1248. "Processing AddReferencesRequest");
  1249. if(request->referencesToAddSize <= 0) {
  1250. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  1251. return;
  1252. }
  1253. /* Create the results array */
  1254. response->results =
  1255. (UA_StatusCode*)UA_malloc(sizeof(UA_StatusCode) * request->referencesToAddSize);
  1256. if(!response->results) {
  1257. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  1258. return;
  1259. }
  1260. response->resultsSize = request->referencesToAddSize;
  1261. #ifndef UA_ENABLE_EXTERNAL_NAMESPACES
  1262. for(size_t i = 0; i < response->resultsSize; ++i)
  1263. response->results[i] =
  1264. addReference(server, session, &request->referencesToAdd[i]);
  1265. #else
  1266. size_t size = request->referencesToAddSize;
  1267. # ifdef NO_ALLOCA
  1268. UA_Boolean isExternal[size];
  1269. UA_UInt32 indices[size];
  1270. # else
  1271. UA_Boolean *isExternal = UA_alloca(sizeof(UA_Boolean) * size);
  1272. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32) * size);
  1273. # endif /*NO_ALLOCA */
  1274. memset(isExternal, false, sizeof(UA_Boolean) * size);
  1275. for(size_t j = 0; j < server->externalNamespacesSize; ++j) {
  1276. size_t indicesSize = 0;
  1277. for(size_t i = 0;i < size;++i) {
  1278. if(request->referencesToAdd[i].sourceNodeId.namespaceIndex
  1279. != server->externalNamespaces[j].index)
  1280. continue;
  1281. isExternal[i] = true;
  1282. indices[indicesSize] = (UA_UInt32)i;
  1283. ++indicesSize;
  1284. }
  1285. if (indicesSize == 0)
  1286. continue;
  1287. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  1288. ens->addReferences(ens->ensHandle, &request->requestHeader, request->referencesToAdd,
  1289. indices, (UA_UInt32)indicesSize, response->results, response->diagnosticInfos);
  1290. }
  1291. for(size_t i = 0; i < response->resultsSize; ++i) {
  1292. if(!isExternal[i])
  1293. response->results[i] =
  1294. addReference(server, session, &request->referencesToAdd[i]);
  1295. }
  1296. #endif
  1297. }
  1298. UA_StatusCode
  1299. UA_Server_addReference(UA_Server *server, const UA_NodeId sourceId,
  1300. const UA_NodeId refTypeId,
  1301. const UA_ExpandedNodeId targetId,
  1302. UA_Boolean isForward) {
  1303. UA_AddReferencesItem item;
  1304. UA_AddReferencesItem_init(&item);
  1305. item.sourceNodeId = sourceId;
  1306. item.referenceTypeId = refTypeId;
  1307. item.isForward = isForward;
  1308. item.targetNodeId = targetId;
  1309. UA_RCU_LOCK();
  1310. UA_StatusCode retval = addReference(server, &adminSession, &item);
  1311. UA_RCU_UNLOCK();
  1312. return retval;
  1313. }
  1314. /****************/
  1315. /* Delete Nodes */
  1316. /****************/
  1317. static void
  1318. removeReferences(UA_Server *server, UA_Session *session,
  1319. const UA_Node *node) {
  1320. UA_DeleteReferencesItem item;
  1321. UA_DeleteReferencesItem_init(&item);
  1322. item.targetNodeId.nodeId = node->nodeId;
  1323. for(size_t i = 0; i < node->referencesSize; ++i) {
  1324. UA_NodeReferenceKind *refs = &node->references[i];
  1325. item.isForward = refs->isInverse;
  1326. item.referenceTypeId = refs->referenceTypeId;
  1327. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  1328. item.sourceNodeId = refs->targetIds[j].nodeId;
  1329. deleteReference(server, session, &item);
  1330. }
  1331. }
  1332. }
  1333. static UA_StatusCode
  1334. deleteNode(UA_Server *server, UA_Session *session,
  1335. const UA_NodeId *nodeId, UA_Boolean deleteReferences) {
  1336. const UA_Node *node = UA_NodeStore_get(server->nodestore, nodeId);
  1337. if(!node)
  1338. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  1339. /* TODO: check if the information model consistency is violated */
  1340. /* TODO: Check if the node is a mandatory child of an object */
  1341. /* Destroy an object before removing it */
  1342. if(node->nodeClass == UA_NODECLASS_OBJECT) {
  1343. /* Call the destructor from the object type */
  1344. const UA_ObjectTypeNode *typenode =
  1345. getObjectNodeType(server, (const UA_ObjectNode*)node);
  1346. if(typenode && typenode->lifecycleManagement.destructor) {
  1347. const UA_ObjectNode *on = (const UA_ObjectNode*)node;
  1348. typenode->lifecycleManagement.destructor(*nodeId, on->instanceHandle);
  1349. }
  1350. }
  1351. /* Remove references to the node (not the references in the node that will
  1352. * be deleted anyway) */
  1353. if(deleteReferences)
  1354. removeReferences(server, session, node);
  1355. return UA_NodeStore_remove(server->nodestore, nodeId);
  1356. }
  1357. void Service_DeleteNodes(UA_Server *server, UA_Session *session,
  1358. const UA_DeleteNodesRequest *request,
  1359. UA_DeleteNodesResponse *response) {
  1360. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1361. "Processing DeleteNodesRequest");
  1362. if(request->nodesToDeleteSize == 0) {
  1363. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  1364. return;
  1365. }
  1366. response->results =
  1367. (UA_StatusCode*)UA_malloc(sizeof(UA_StatusCode) * request->nodesToDeleteSize);
  1368. if(!response->results) {
  1369. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;;
  1370. return;
  1371. }
  1372. response->resultsSize = request->nodesToDeleteSize;
  1373. for(size_t i = 0; i < request->nodesToDeleteSize; ++i) {
  1374. UA_DeleteNodesItem *item = &request->nodesToDelete[i];
  1375. response->results[i] = deleteNode(server, session, &item->nodeId,
  1376. item->deleteTargetReferences);
  1377. }
  1378. }
  1379. UA_StatusCode
  1380. UA_Server_deleteNode(UA_Server *server, const UA_NodeId nodeId,
  1381. UA_Boolean deleteReferences) {
  1382. UA_RCU_LOCK();
  1383. UA_StatusCode retval = deleteNode(server, &adminSession,
  1384. &nodeId, deleteReferences);
  1385. UA_RCU_UNLOCK();
  1386. return retval;
  1387. }
  1388. /*********************/
  1389. /* Delete References */
  1390. /*********************/
  1391. // TODO: Check consistency constraints, remove the references.
  1392. static UA_StatusCode
  1393. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  1394. const UA_DeleteReferencesItem *item) {
  1395. for(size_t i = node->referencesSize; i > 0; --i) {
  1396. UA_NodeReferenceKind *refs = &node->references[i-1];
  1397. if(item->isForward == refs->isInverse)
  1398. continue;
  1399. if(!UA_NodeId_equal(&item->referenceTypeId, &refs->referenceTypeId))
  1400. continue;
  1401. for(size_t j = refs->targetIdsSize; j > 0; --j) {
  1402. if(!UA_NodeId_equal(&item->targetNodeId.nodeId, &refs->targetIds[j-1].nodeId))
  1403. continue;
  1404. /* Ok, delete the reference */
  1405. UA_ExpandedNodeId_deleteMembers(&refs->targetIds[j-1]);
  1406. refs->targetIdsSize--;
  1407. /* One matching target remaining */
  1408. if(refs->targetIdsSize > 0) {
  1409. refs->targetIds[j-1] = refs->targetIds[refs->targetIdsSize];
  1410. return UA_STATUSCODE_GOOD;
  1411. }
  1412. /* Remove refs */
  1413. UA_free(refs->targetIds);
  1414. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  1415. node->referencesSize--;
  1416. if(node->referencesSize > 0) {
  1417. node->references[i-1] = node->references[node->referencesSize];
  1418. return UA_STATUSCODE_GOOD;
  1419. }
  1420. /* Remove the node references */
  1421. UA_free(node->references);
  1422. node->references = NULL;
  1423. return UA_STATUSCODE_GOOD;
  1424. }
  1425. }
  1426. return UA_STATUSCODE_UNCERTAINREFERENCENOTDELETED;
  1427. }
  1428. static UA_StatusCode
  1429. deleteReference(UA_Server *server, UA_Session *session,
  1430. const UA_DeleteReferencesItem *item) {
  1431. UA_StatusCode retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  1432. (UA_EditNodeCallback)deleteOneWayReference, item);
  1433. if(retval != UA_STATUSCODE_GOOD)
  1434. return retval;
  1435. if(!item->deleteBidirectional || item->targetNodeId.serverIndex != 0)
  1436. return retval;
  1437. UA_DeleteReferencesItem secondItem;
  1438. UA_DeleteReferencesItem_init(&secondItem);
  1439. secondItem.isForward = !item->isForward;
  1440. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1441. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1442. secondItem.referenceTypeId = item->referenceTypeId;
  1443. return UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1444. (UA_EditNodeCallback)deleteOneWayReference,
  1445. &secondItem);
  1446. }
  1447. void
  1448. Service_DeleteReferences(UA_Server *server, UA_Session *session,
  1449. const UA_DeleteReferencesRequest *request,
  1450. UA_DeleteReferencesResponse *response) {
  1451. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1452. "Processing DeleteReferencesRequest");
  1453. if(request->referencesToDeleteSize <= 0) {
  1454. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  1455. return;
  1456. }
  1457. size_t size = request->referencesToDeleteSize;
  1458. response->results = (UA_StatusCode*)UA_malloc(sizeof(UA_StatusCode) * size);
  1459. if(!response->results) {
  1460. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;;
  1461. return;
  1462. }
  1463. response->resultsSize = size;
  1464. for(size_t i = 0; i < size; ++i)
  1465. response->results[i] =
  1466. deleteReference(server, session, &request->referencesToDelete[i]);
  1467. }
  1468. UA_StatusCode
  1469. UA_Server_deleteReference(UA_Server *server, const UA_NodeId sourceNodeId,
  1470. const UA_NodeId referenceTypeId, UA_Boolean isForward,
  1471. const UA_ExpandedNodeId targetNodeId,
  1472. UA_Boolean deleteBidirectional) {
  1473. UA_DeleteReferencesItem item;
  1474. item.sourceNodeId = sourceNodeId;
  1475. item.referenceTypeId = referenceTypeId;
  1476. item.isForward = isForward;
  1477. item.targetNodeId = targetNodeId;
  1478. item.deleteBidirectional = deleteBidirectional;
  1479. UA_RCU_LOCK();
  1480. UA_StatusCode retval = deleteReference(server, &adminSession, &item);
  1481. UA_RCU_UNLOCK();
  1482. return retval;
  1483. }
  1484. /**********************/
  1485. /* Set Value Callback */
  1486. /**********************/
  1487. static UA_StatusCode
  1488. setValueCallback(UA_Server *server, UA_Session *session,
  1489. UA_VariableNode *node, UA_ValueCallback *callback) {
  1490. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1491. return UA_STATUSCODE_BADNODECLASSINVALID;
  1492. node->value.data.callback = *callback;
  1493. return UA_STATUSCODE_GOOD;
  1494. }
  1495. UA_StatusCode
  1496. UA_Server_setVariableNode_valueCallback(UA_Server *server, const UA_NodeId nodeId,
  1497. const UA_ValueCallback callback) {
  1498. UA_RCU_LOCK();
  1499. UA_StatusCode retval =
  1500. UA_Server_editNode(server, &adminSession, &nodeId,
  1501. (UA_EditNodeCallback)setValueCallback, &callback);
  1502. UA_RCU_UNLOCK();
  1503. return retval;
  1504. }
  1505. /******************/
  1506. /* Set DataSource */
  1507. /******************/
  1508. static UA_StatusCode
  1509. setDataSource(UA_Server *server, UA_Session *session,
  1510. UA_VariableNode* node, UA_DataSource *dataSource) {
  1511. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1512. return UA_STATUSCODE_BADNODECLASSINVALID;
  1513. if(node->valueSource == UA_VALUESOURCE_DATA)
  1514. UA_DataValue_deleteMembers(&node->value.data.value);
  1515. node->value.dataSource = *dataSource;
  1516. node->valueSource = UA_VALUESOURCE_DATASOURCE;
  1517. return UA_STATUSCODE_GOOD;
  1518. }
  1519. UA_StatusCode
  1520. UA_Server_setVariableNode_dataSource(UA_Server *server, const UA_NodeId nodeId,
  1521. const UA_DataSource dataSource) {
  1522. UA_RCU_LOCK();
  1523. UA_StatusCode retval = UA_Server_editNode(server, &adminSession, &nodeId,
  1524. (UA_EditNodeCallback)setDataSource,
  1525. &dataSource);
  1526. UA_RCU_UNLOCK();
  1527. return retval;
  1528. }
  1529. /****************************/
  1530. /* Set Lifecycle Management */
  1531. /****************************/
  1532. static UA_StatusCode
  1533. setOLM(UA_Server *server, UA_Session *session,
  1534. UA_ObjectTypeNode* node, UA_ObjectLifecycleManagement *olm) {
  1535. if(node->nodeClass != UA_NODECLASS_OBJECTTYPE)
  1536. return UA_STATUSCODE_BADNODECLASSINVALID;
  1537. node->lifecycleManagement = *olm;
  1538. return UA_STATUSCODE_GOOD;
  1539. }
  1540. UA_StatusCode
  1541. UA_Server_setObjectTypeNode_lifecycleManagement(UA_Server *server, UA_NodeId nodeId,
  1542. UA_ObjectLifecycleManagement olm) {
  1543. UA_RCU_LOCK();
  1544. UA_StatusCode retval = UA_Server_editNode(server, &adminSession, &nodeId,
  1545. (UA_EditNodeCallback)setOLM, &olm);
  1546. UA_RCU_UNLOCK();
  1547. return retval;
  1548. }
  1549. /***********************/
  1550. /* Set Method Callback */
  1551. /***********************/
  1552. #ifdef UA_ENABLE_METHODCALLS
  1553. typedef struct {
  1554. UA_MethodCallback callback;
  1555. void *handle;
  1556. } addMethodCallback;
  1557. static UA_StatusCode
  1558. editMethodCallback(UA_Server *server, UA_Session* session,
  1559. UA_Node* node, const void* handle) {
  1560. if(node->nodeClass != UA_NODECLASS_METHOD)
  1561. return UA_STATUSCODE_BADNODECLASSINVALID;
  1562. const addMethodCallback *newCallback = (const addMethodCallback *)handle;
  1563. UA_MethodNode *mnode = (UA_MethodNode*) node;
  1564. mnode->attachedMethod = newCallback->callback;
  1565. mnode->methodHandle = newCallback->handle;
  1566. return UA_STATUSCODE_GOOD;
  1567. }
  1568. UA_StatusCode
  1569. UA_Server_setMethodNode_callback(UA_Server *server, const UA_NodeId methodNodeId,
  1570. UA_MethodCallback method, void *handle) {
  1571. addMethodCallback cb;
  1572. cb.callback = method;
  1573. cb.handle = handle;
  1574. UA_RCU_LOCK();
  1575. UA_StatusCode retval =
  1576. UA_Server_editNode(server, &adminSession,
  1577. &methodNodeId, editMethodCallback, &cb);
  1578. UA_RCU_UNLOCK();
  1579. return retval;
  1580. }
  1581. #endif