ua_services_nodemanagement.c 87 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072
  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. *
  5. * Copyright 2014-2017 (c) Fraunhofer IOSB (Author: Julius Pfrommer)
  6. * Copyright 2014-2017 (c) Florian Palm
  7. * Copyright 2015-2016 (c) Sten Grüner
  8. * Copyright 2015-2016 (c) Chris Iatrou
  9. * Copyright 2015-2016 (c) Oleksiy Vasylyev
  10. * Copyright 2017 (c) Julian Grothoff
  11. * Copyright 2016 (c) LEvertz
  12. * Copyright 2016 (c) Lorenz Haas
  13. * Copyright 2017 (c) frax2222
  14. * Copyright 2017-2018 (c) Stefan Profanter, fortiss GmbH
  15. * Copyright 2017 (c) Christian von Arnim
  16. * Copyright 2017 (c) Henrik Norrman
  17. */
  18. #include "ua_server_internal.h"
  19. #include "ua_services.h"
  20. #define UA_LOG_NODEID_WRAP(NODEID, LOG) { \
  21. UA_String nodeIdStr = UA_STRING_NULL; \
  22. UA_NodeId_toString(NODEID, &nodeIdStr); \
  23. LOG; \
  24. UA_String_deleteMembers(&nodeIdStr); \
  25. }
  26. /*********************/
  27. /* Edit Node Context */
  28. /*********************/
  29. UA_StatusCode
  30. UA_Server_getNodeContext(UA_Server *server, UA_NodeId nodeId,
  31. void **nodeContext) {
  32. const UA_Node *node = UA_Nodestore_getNode(server->nsCtx, &nodeId);
  33. if(!node)
  34. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  35. *nodeContext = node->context;
  36. UA_Nodestore_releaseNode(server->nsCtx, node);
  37. return UA_STATUSCODE_GOOD;
  38. }
  39. static UA_StatusCode
  40. setDeconstructedNode(UA_Server *server, UA_Session *session,
  41. UA_Node *node, void *context) {
  42. node->constructed = false;
  43. return UA_STATUSCODE_GOOD;
  44. }
  45. static UA_StatusCode
  46. setConstructedNodeContext(UA_Server *server, UA_Session *session,
  47. UA_Node *node, void *context) {
  48. node->context = context;
  49. node->constructed = true;
  50. return UA_STATUSCODE_GOOD;
  51. }
  52. static UA_StatusCode
  53. editNodeContext(UA_Server *server, UA_Session* session,
  54. UA_Node* node, void *context) {
  55. node->context = context;
  56. return UA_STATUSCODE_GOOD;
  57. }
  58. UA_StatusCode
  59. UA_Server_setNodeContext(UA_Server *server, UA_NodeId nodeId,
  60. void *nodeContext) {
  61. return UA_Server_editNode(server, &server->adminSession, &nodeId,
  62. (UA_EditNodeCallback)editNodeContext, nodeContext);
  63. }
  64. /**********************/
  65. /* Consistency Checks */
  66. /**********************/
  67. #define UA_PARENT_REFERENCES_COUNT 2
  68. const UA_NodeId parentReferences[UA_PARENT_REFERENCES_COUNT] = {
  69. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASSUBTYPE}},
  70. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASCOMPONENT}}
  71. };
  72. /* Check if the requested parent node exists, has the right node class and is
  73. * referenced with an allowed (hierarchical) reference type. For "type" nodes,
  74. * only hasSubType references are allowed. */
  75. static UA_StatusCode
  76. checkParentReference(UA_Server *server, UA_Session *session, UA_NodeClass nodeClass,
  77. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId) {
  78. /* Objects do not need a parent (e.g. mandatory/optional modellingrules) */
  79. /* Also, there are some variables which do not have parents, e.g. EnumStrings, EnumValues */
  80. if((nodeClass == UA_NODECLASS_OBJECT || nodeClass == UA_NODECLASS_VARIABLE) &&
  81. UA_NodeId_isNull(parentNodeId) && UA_NodeId_isNull(referenceTypeId))
  82. return UA_STATUSCODE_GOOD;
  83. /* See if the parent exists */
  84. const UA_Node *parent = UA_Nodestore_getNode(server->nsCtx, parentNodeId);
  85. if(!parent) {
  86. UA_LOG_NODEID_WRAP(parentNodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  87. "AddNodes: Parent node %.*s not found",
  88. (int)nodeIdStr.length, nodeIdStr.data));
  89. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  90. }
  91. UA_NodeClass parentNodeClass = parent->nodeClass;
  92. UA_Nodestore_releaseNode(server->nsCtx, parent);
  93. /* Check the referencetype exists */
  94. const UA_ReferenceTypeNode *referenceType = (const UA_ReferenceTypeNode*)
  95. UA_Nodestore_getNode(server->nsCtx, referenceTypeId);
  96. if(!referenceType) {
  97. UA_LOG_NODEID_WRAP(referenceTypeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  98. "AddNodes: Reference type %.*s to the parent not found",
  99. (int)nodeIdStr.length, nodeIdStr.data));
  100. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  101. }
  102. /* Check if the referencetype is a reference type node */
  103. if(referenceType->nodeClass != UA_NODECLASS_REFERENCETYPE) {
  104. UA_LOG_NODEID_WRAP(referenceTypeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  105. "AddNodes: Reference type %.*s to the parent is not a ReferenceTypeNode",
  106. (int)nodeIdStr.length, nodeIdStr.data));
  107. UA_Nodestore_releaseNode(server->nsCtx, (const UA_Node*)referenceType);
  108. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  109. }
  110. UA_Boolean referenceTypeIsAbstract = referenceType->isAbstract;
  111. UA_Nodestore_releaseNode(server->nsCtx, (const UA_Node*)referenceType);
  112. /* Check that the reference type is not abstract */
  113. if(referenceTypeIsAbstract == true) {
  114. UA_LOG_NODEID_WRAP(referenceTypeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  115. "AddNodes: Abstract reference type %.*s to the parent not allowed",
  116. (int)nodeIdStr.length, nodeIdStr.data));
  117. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  118. }
  119. /* Check hassubtype relation for type nodes */
  120. if(nodeClass == UA_NODECLASS_DATATYPE ||
  121. nodeClass == UA_NODECLASS_VARIABLETYPE ||
  122. nodeClass == UA_NODECLASS_OBJECTTYPE ||
  123. nodeClass == UA_NODECLASS_REFERENCETYPE) {
  124. /* type needs hassubtype reference to the supertype */
  125. if(!UA_NodeId_equal(referenceTypeId, &subtypeId)) {
  126. UA_LOG_INFO_SESSION(&server->config.logger, session,
  127. "AddNodes: Type nodes need to have a HasSubType "
  128. "reference to the parent");
  129. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  130. }
  131. /* supertype needs to be of the same node type */
  132. if(parentNodeClass != nodeClass) {
  133. UA_LOG_INFO_SESSION(&server->config.logger, session,
  134. "AddNodes: Type nodes needs to be of the same node "
  135. "type as their parent");
  136. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  137. }
  138. return UA_STATUSCODE_GOOD;
  139. }
  140. /* Test if the referencetype is hierarchical */
  141. if(!isNodeInTree(server->nsCtx, referenceTypeId,
  142. &hierarchicalReferences, &subtypeId, 1)) {
  143. UA_LOG_INFO_SESSION(&server->config.logger, session,
  144. "AddNodes: Reference type to the parent is not hierarchical");
  145. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  146. }
  147. return UA_STATUSCODE_GOOD;
  148. }
  149. static UA_StatusCode
  150. typeCheckVariableNode(UA_Server *server, UA_Session *session,
  151. const UA_VariableNode *node,
  152. const UA_VariableTypeNode *vt) {
  153. /* The value might come from a datasource, so we perform a
  154. * regular read. */
  155. UA_DataValue value;
  156. UA_DataValue_init(&value);
  157. UA_StatusCode retval = readValueAttribute(server, session, node, &value);
  158. if(retval != UA_STATUSCODE_GOOD)
  159. return retval;
  160. UA_NodeId baseDataType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATATYPE);
  161. /* Check the datatype against the vt */
  162. /* If the node does not have any value and the dataType is BaseDataType,
  163. * then it's also fine. This is the default for empty nodes. */
  164. if(!compatibleDataType(server, &node->dataType, &vt->dataType, false) &&
  165. (value.hasValue || !UA_NodeId_equal(&node->dataType, &baseDataType))) {
  166. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  167. "AddNodes: The value of %.*s is incompatible with "
  168. "the datatype of the VariableType",
  169. (int)nodeIdStr.length, nodeIdStr.data));
  170. return UA_STATUSCODE_BADTYPEMISMATCH;
  171. }
  172. /* Check valueRank against array dimensions */
  173. if(!compatibleValueRankArrayDimensions(server, session, node->valueRank,
  174. node->arrayDimensionsSize)) {
  175. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  176. "AddNodes: The value rank of %.*s is incomatible "
  177. "with its array dimensions", (int)nodeIdStr.length, nodeIdStr.data));
  178. return UA_STATUSCODE_BADTYPEMISMATCH;
  179. }
  180. /* Check valueRank against the vt */
  181. if(!compatibleValueRanks(node->valueRank, vt->valueRank)) {
  182. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  183. "AddNodes: The value rank of %.*s is incomatible "
  184. "with the value rank of the VariableType",
  185. (int)nodeIdStr.length, nodeIdStr.data));
  186. return UA_STATUSCODE_BADTYPEMISMATCH;
  187. }
  188. /* Check array dimensions against the vt */
  189. if(!compatibleArrayDimensions(vt->arrayDimensionsSize, vt->arrayDimensions,
  190. node->arrayDimensionsSize, node->arrayDimensions)) {
  191. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  192. "AddNodes: The array dimensions of %.*s are "
  193. "incomatible with the array dimensions of the VariableType",
  194. (int)nodeIdStr.length, nodeIdStr.data));
  195. return UA_STATUSCODE_BADTYPEMISMATCH;
  196. }
  197. /* Typecheck the value */
  198. if(value.hasValue && value.value.data) {
  199. /* If the type-check failed write the same value again. The
  200. * write-service tries to convert to the correct type... */
  201. if(!compatibleValue(server, session, &node->dataType, node->valueRank,
  202. node->arrayDimensionsSize, node->arrayDimensions,
  203. &value.value, NULL))
  204. retval = UA_Server_writeValue(server, node->nodeId, value.value);
  205. UA_DataValue_deleteMembers(&value);
  206. if(retval != UA_STATUSCODE_GOOD) {
  207. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  208. "AddNodes: The value of of %.*s is incomatible with the "
  209. "variable definition", (int)nodeIdStr.length, nodeIdStr.data));
  210. }
  211. }
  212. return retval;
  213. }
  214. /********************/
  215. /* Instantiate Node */
  216. /********************/
  217. static const UA_NodeId baseDataVariableType =
  218. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_BASEDATAVARIABLETYPE}};
  219. static const UA_NodeId baseObjectType =
  220. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_BASEOBJECTTYPE}};
  221. static const UA_NodeId hasTypeDefinition =
  222. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASTYPEDEFINITION}};
  223. /* Use attributes from the variable type wherever required. Reload the node if
  224. * changes were made. */
  225. static UA_StatusCode
  226. useVariableTypeAttributes(UA_Server *server, UA_Session *session,
  227. const UA_VariableNode **node_ptr,
  228. const UA_VariableTypeNode *vt) {
  229. const UA_VariableNode *node = *node_ptr;
  230. UA_Boolean modified = false;
  231. /* If no value is set, see if the vt provides one and copy it. This needs to
  232. * be done before copying the datatype from the vt, as setting the datatype
  233. * triggers a typecheck. */
  234. UA_DataValue orig;
  235. UA_DataValue_init(&orig);
  236. UA_StatusCode retval = readValueAttribute(server, session, node, &orig);
  237. if(retval != UA_STATUSCODE_GOOD)
  238. return retval;
  239. if(orig.value.type) {
  240. /* A value is present */
  241. UA_DataValue_deleteMembers(&orig);
  242. } else {
  243. UA_LOG_DEBUG_SESSION(&server->config.logger, session,
  244. "AddNodes: No value given; Copy the value "
  245. "from the TypeDefinition");
  246. UA_WriteValue v;
  247. UA_WriteValue_init(&v);
  248. retval = readValueAttribute(server, session, (const UA_VariableNode*)vt, &v.value);
  249. if(retval == UA_STATUSCODE_GOOD && v.value.hasValue) {
  250. v.nodeId = node->nodeId;
  251. v.attributeId = UA_ATTRIBUTEID_VALUE;
  252. retval = UA_Server_writeWithSession(server, session, &v);
  253. modified = true;
  254. }
  255. UA_DataValue_deleteMembers(&v.value);
  256. if(retval != UA_STATUSCODE_GOOD)
  257. return retval;
  258. }
  259. /* If no datatype is given, use the datatype of the vt */
  260. if(UA_NodeId_isNull(&node->dataType)) {
  261. UA_LOG_INFO_SESSION(&server->config.logger, session, "AddNodes: "
  262. "No datatype given; Copy the datatype attribute "
  263. "from the TypeDefinition");
  264. UA_WriteValue v;
  265. UA_WriteValue_init(&v);
  266. v.nodeId = node->nodeId;
  267. v.attributeId = UA_ATTRIBUTEID_DATATYPE;
  268. v.value.hasValue = true;
  269. UA_Variant_setScalar(&v.value.value, (void*)(uintptr_t)&vt->dataType,
  270. &UA_TYPES[UA_TYPES_NODEID]);
  271. retval = UA_Server_writeWithSession(server, session, &v);
  272. modified = true;
  273. if(retval != UA_STATUSCODE_GOOD)
  274. return retval;
  275. }
  276. /* Use the ArrayDimensions of the vt */
  277. if(node->arrayDimensionsSize == 0 && vt->arrayDimensionsSize > 0) {
  278. UA_WriteValue v;
  279. UA_WriteValue_init(&v);
  280. v.nodeId = node->nodeId;
  281. v.attributeId = UA_ATTRIBUTEID_ARRAYDIMENSIONS;
  282. v.value.hasValue = true;
  283. UA_Variant_setArray(&v.value.value, vt->arrayDimensions,
  284. vt->arrayDimensionsSize, &UA_TYPES[UA_TYPES_UINT32]);
  285. retval = UA_Server_writeWithSession(server, session, &v);
  286. modified = true;
  287. if(retval != UA_STATUSCODE_GOOD)
  288. return retval;
  289. }
  290. /* If the node was modified, update the pointer to the new version */
  291. if(modified) {
  292. const UA_VariableNode *updated = (const UA_VariableNode*)
  293. UA_Nodestore_getNode(server->nsCtx, &node->nodeId);
  294. if(!updated)
  295. return UA_STATUSCODE_BADINTERNALERROR;
  296. UA_Nodestore_releaseNode(server->nsCtx, (const UA_Node*)node);
  297. *node_ptr = updated;
  298. }
  299. return UA_STATUSCODE_GOOD;
  300. }
  301. /* Search for an instance of "browseName" in node searchInstance. Used during
  302. * copyChildNodes to find overwritable/mergable nodes. Does not touch
  303. * outInstanceNodeId if no child is found. */
  304. static UA_StatusCode
  305. findChildByBrowsename(UA_Server *server, UA_Session *session,
  306. const UA_NodeId *searchInstance,
  307. const UA_QualifiedName *browseName,
  308. UA_NodeId *outInstanceNodeId) {
  309. UA_BrowseDescription bd;
  310. UA_BrowseDescription_init(&bd);
  311. bd.nodeId = *searchInstance;
  312. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  313. bd.includeSubtypes = true;
  314. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  315. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  316. bd.resultMask = UA_BROWSERESULTMASK_BROWSENAME;
  317. UA_BrowseResult br;
  318. UA_BrowseResult_init(&br);
  319. struct BrowseOpts bo;
  320. bo.maxReferences = 0;
  321. bo.recursive = false;
  322. Operation_Browse(server, session, &bo, &bd, &br);
  323. if(br.statusCode != UA_STATUSCODE_GOOD)
  324. return br.statusCode;
  325. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  326. for(size_t i = 0; i < br.referencesSize; ++i) {
  327. UA_ReferenceDescription *rd = &br.references[i];
  328. if(rd->browseName.namespaceIndex == browseName->namespaceIndex &&
  329. UA_String_equal(&rd->browseName.name, &browseName->name)) {
  330. retval = UA_NodeId_copy(&rd->nodeId.nodeId, outInstanceNodeId);
  331. break;
  332. }
  333. }
  334. UA_BrowseResult_deleteMembers(&br);
  335. return retval;
  336. }
  337. static const UA_NodeId mandatoryId =
  338. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_MODELLINGRULE_MANDATORY}};
  339. static const UA_NodeId hasModellingRuleId =
  340. {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASMODELLINGRULE}};
  341. static UA_Boolean
  342. isMandatoryChild(UA_Server *server, UA_Session *session,
  343. const UA_NodeId *childNodeId) {
  344. /* Get the child */
  345. const UA_Node *child = UA_Nodestore_getNode(server->nsCtx, childNodeId);
  346. if(!child)
  347. return false;
  348. /* Look for the reference making the child mandatory */
  349. for(size_t i = 0; i < child->referencesSize; ++i) {
  350. UA_NodeReferenceKind *refs = &child->references[i];
  351. if(!UA_NodeId_equal(&hasModellingRuleId, &refs->referenceTypeId))
  352. continue;
  353. if(refs->isInverse)
  354. continue;
  355. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  356. if(UA_NodeId_equal(&mandatoryId, &refs->targetIds[j].nodeId)) {
  357. UA_Nodestore_releaseNode(server->nsCtx, child);
  358. return true;
  359. }
  360. }
  361. }
  362. UA_Nodestore_releaseNode(server->nsCtx, child);
  363. return false;
  364. }
  365. static UA_StatusCode
  366. copyAllChildren(UA_Server *server, UA_Session *session,
  367. const UA_NodeId *source, const UA_NodeId *destination);
  368. static UA_StatusCode
  369. recursiveTypeCheckAddChildren(UA_Server *server, UA_Session *session,
  370. const UA_Node **node, const UA_Node *type);
  371. static void
  372. Operation_addReference(UA_Server *server, UA_Session *session, void *context,
  373. const UA_AddReferencesItem *item, UA_StatusCode *retval);
  374. static UA_StatusCode
  375. copyChild(UA_Server *server, UA_Session *session, const UA_NodeId *destinationNodeId,
  376. const UA_ReferenceDescription *rd) {
  377. /* Is there an existing child with the browsename? */
  378. UA_NodeId existingChild = UA_NODEID_NULL;
  379. UA_StatusCode retval = findChildByBrowsename(server, session, destinationNodeId,
  380. &rd->browseName, &existingChild);
  381. if(retval != UA_STATUSCODE_GOOD)
  382. return retval;
  383. /* Have a child with that browseName. Deep-copy missing members. */
  384. if(!UA_NodeId_isNull(&existingChild)) {
  385. if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  386. rd->nodeClass == UA_NODECLASS_OBJECT)
  387. retval = copyAllChildren(server, session, &rd->nodeId.nodeId, &existingChild);
  388. UA_NodeId_deleteMembers(&existingChild);
  389. return retval;
  390. }
  391. /* Is the child mandatory? If not, skip */
  392. if(!isMandatoryChild(server, session, &rd->nodeId.nodeId))
  393. return UA_STATUSCODE_GOOD;
  394. /* Child is a method -> create a reference */
  395. if(rd->nodeClass == UA_NODECLASS_METHOD) {
  396. UA_AddReferencesItem newItem;
  397. UA_AddReferencesItem_init(&newItem);
  398. newItem.sourceNodeId = *destinationNodeId;
  399. newItem.referenceTypeId = rd->referenceTypeId;
  400. newItem.isForward = true;
  401. newItem.targetNodeId = rd->nodeId;
  402. newItem.targetNodeClass = UA_NODECLASS_METHOD;
  403. Operation_addReference(server, session, NULL, &newItem, &retval);
  404. return retval;
  405. }
  406. /* Child is a variable or object */
  407. if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  408. rd->nodeClass == UA_NODECLASS_OBJECT) {
  409. /* Make a copy of the node */
  410. UA_Node *node;
  411. retval = UA_Nodestore_getNodeCopy(server->nsCtx, &rd->nodeId.nodeId, &node);
  412. if(retval != UA_STATUSCODE_GOOD)
  413. return retval;
  414. /* Remove the context of the copied node */
  415. node->context = NULL;
  416. node->constructed = false;
  417. /* Reset the NodeId (random numeric id will be assigned in the nodestore) */
  418. UA_NodeId_deleteMembers(&node->nodeId);
  419. node->nodeId.namespaceIndex = destinationNodeId->namespaceIndex;
  420. /* Remove references, they are re-created from scratch in addnode_finish */
  421. /* TODO: Be more clever in removing references that are re-added during
  422. * addnode_finish. That way, we can call addnode_finish also on children that were
  423. * manually added by the user during addnode_begin and addnode_finish. */
  424. /* For now we keep all the modelling rule references and delete all others */
  425. UA_NodeId modellingRuleReferenceId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASMODELLINGRULE);
  426. UA_Node_deleteReferencesSubset(node, 1, &modellingRuleReferenceId);
  427. /* Add the node to the nodestore */
  428. UA_NodeId newNodeId;
  429. retval = UA_Nodestore_insertNode(server->nsCtx, node, &newNodeId);
  430. if(retval != UA_STATUSCODE_GOOD)
  431. return retval;
  432. /* Add the node references */
  433. retval = AddNode_addRefs(server, session, &newNodeId, destinationNodeId,
  434. &rd->referenceTypeId, &rd->typeDefinition.nodeId);
  435. if(retval != UA_STATUSCODE_GOOD) {
  436. UA_Nodestore_removeNode(server->nsCtx, &newNodeId);
  437. return retval;
  438. }
  439. /* For the new child, recursively copy the members of the original. No
  440. * typechecking is performed here. Assuming that the original is
  441. * consistent. */
  442. retval = copyAllChildren(server, session, &rd->nodeId.nodeId, &newNodeId);
  443. }
  444. return retval;
  445. }
  446. /* Copy any children of Node sourceNodeId to another node destinationNodeId. */
  447. static UA_StatusCode
  448. copyAllChildren(UA_Server *server, UA_Session *session,
  449. const UA_NodeId *source, const UA_NodeId *destination) {
  450. /* Browse to get all children of the source */
  451. UA_BrowseDescription bd;
  452. UA_BrowseDescription_init(&bd);
  453. bd.nodeId = *source;
  454. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  455. bd.includeSubtypes = true;
  456. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  457. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  458. bd.resultMask = UA_BROWSERESULTMASK_REFERENCETYPEID | UA_BROWSERESULTMASK_NODECLASS |
  459. UA_BROWSERESULTMASK_BROWSENAME | UA_BROWSERESULTMASK_TYPEDEFINITION;
  460. UA_BrowseResult br;
  461. UA_BrowseResult_init(&br);
  462. struct BrowseOpts bo;
  463. bo.maxReferences = 0;
  464. bo.recursive = false;
  465. Operation_Browse(server, session, &bo, &bd, &br);
  466. if(br.statusCode != UA_STATUSCODE_GOOD)
  467. return br.statusCode;
  468. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  469. for(size_t i = 0; i < br.referencesSize; ++i) {
  470. UA_ReferenceDescription *rd = &br.references[i];
  471. retval = copyChild(server, session, destination, rd);
  472. if(retval != UA_STATUSCODE_GOOD)
  473. return retval;
  474. }
  475. UA_BrowseResult_deleteMembers(&br);
  476. return retval;
  477. }
  478. static UA_StatusCode
  479. addTypeChildren(UA_Server *server, UA_Session *session,
  480. const UA_Node *node, const UA_Node *type) {
  481. /* Get the hierarchy of the type and all its supertypes */
  482. UA_NodeId *hierarchy = NULL;
  483. size_t hierarchySize = 0;
  484. UA_StatusCode retval = getParentTypeAndInterfaceHierarchy(server, &type->nodeId,
  485. &hierarchy, &hierarchySize);
  486. if(retval != UA_STATUSCODE_GOOD)
  487. return retval;
  488. /* Copy members of the type and supertypes (and instantiate them) */
  489. for(size_t i = 0; i < hierarchySize; ++i) {
  490. retval = copyAllChildren(server, session, &hierarchy[i], &node->nodeId);
  491. if(retval != UA_STATUSCODE_GOOD)
  492. goto cleanup;
  493. }
  494. cleanup:
  495. UA_Array_delete(hierarchy, hierarchySize, &UA_TYPES[UA_TYPES_NODEID]);
  496. return retval;
  497. }
  498. static UA_StatusCode
  499. addRef(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  500. const UA_NodeId *referenceTypeId, const UA_NodeId *parentNodeId,
  501. UA_Boolean forward) {
  502. UA_AddReferencesItem ref_item;
  503. UA_AddReferencesItem_init(&ref_item);
  504. ref_item.sourceNodeId = *nodeId;
  505. ref_item.referenceTypeId = *referenceTypeId;
  506. ref_item.isForward = forward;
  507. ref_item.targetNodeId.nodeId = *parentNodeId;
  508. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  509. Operation_addReference(server, session, NULL, &ref_item, &retval);
  510. return retval;
  511. }
  512. /************/
  513. /* Add Node */
  514. /************/
  515. static const UA_NodeId hasSubtype = {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASSUBTYPE}};
  516. UA_StatusCode
  517. AddNode_addRefs(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  518. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId,
  519. const UA_NodeId *typeDefinitionId) {
  520. /* Get the node */
  521. const UA_Node *type = NULL;
  522. const UA_Node *node = UA_Nodestore_getNode(server->nsCtx, nodeId);
  523. if(!node)
  524. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  525. /* Use the typeDefinition as parent for type-nodes */
  526. if(node->nodeClass == UA_NODECLASS_VARIABLETYPE ||
  527. node->nodeClass == UA_NODECLASS_OBJECTTYPE ||
  528. node->nodeClass == UA_NODECLASS_REFERENCETYPE ||
  529. node->nodeClass == UA_NODECLASS_DATATYPE) {
  530. if(UA_NodeId_equal(referenceTypeId, &UA_NODEID_NULL))
  531. referenceTypeId = &hasSubtype;
  532. const UA_Node *parentNode = UA_Nodestore_getNode(server->nsCtx, parentNodeId);
  533. if(parentNode) {
  534. if(parentNode->nodeClass == node->nodeClass)
  535. typeDefinitionId = parentNodeId;
  536. UA_Nodestore_releaseNode(server->nsCtx, parentNode);
  537. }
  538. }
  539. /* Check parent reference. Objects may have no parent. */
  540. UA_StatusCode retval = checkParentReference(server, session, node->nodeClass,
  541. parentNodeId, referenceTypeId);
  542. if(retval != UA_STATUSCODE_GOOD) {
  543. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  544. "AddNodes: The parent reference for %.*s is invalid "
  545. "with status code %s",
  546. (int)nodeIdStr.length, nodeIdStr.data,
  547. UA_StatusCode_name(retval)));
  548. goto cleanup;
  549. }
  550. /* Replace empty typeDefinition with the most permissive default */
  551. if((node->nodeClass == UA_NODECLASS_VARIABLE ||
  552. node->nodeClass == UA_NODECLASS_OBJECT) &&
  553. UA_NodeId_isNull(typeDefinitionId)) {
  554. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  555. "AddNodes: No TypeDefinition for %.*s; Use the default "
  556. "TypeDefinition for the Variable/Object",
  557. (int)nodeIdStr.length, nodeIdStr.data));
  558. if(node->nodeClass == UA_NODECLASS_VARIABLE)
  559. typeDefinitionId = &baseDataVariableType;
  560. else
  561. typeDefinitionId = &baseObjectType;
  562. }
  563. /* Get the node type. There must be a typedefinition for variables, objects
  564. * and type-nodes. See the above checks. */
  565. if(!UA_NodeId_isNull(typeDefinitionId)) {
  566. /* Get the type node */
  567. type = UA_Nodestore_getNode(server->nsCtx, typeDefinitionId);
  568. if(!type) {
  569. UA_LOG_NODEID_WRAP(typeDefinitionId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  570. "AddNodes: Node type %.*s not found",
  571. (int)nodeIdStr.length, nodeIdStr.data));
  572. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  573. goto cleanup;
  574. }
  575. UA_Boolean typeOk = false;
  576. switch(node->nodeClass) {
  577. case UA_NODECLASS_DATATYPE:
  578. typeOk = type->nodeClass == UA_NODECLASS_DATATYPE;
  579. break;
  580. case UA_NODECLASS_METHOD:
  581. typeOk = type->nodeClass == UA_NODECLASS_METHOD;
  582. break;
  583. case UA_NODECLASS_OBJECT:
  584. typeOk = type->nodeClass == UA_NODECLASS_OBJECTTYPE;
  585. break;
  586. case UA_NODECLASS_OBJECTTYPE:
  587. typeOk = type->nodeClass == UA_NODECLASS_OBJECTTYPE;
  588. break;
  589. case UA_NODECLASS_REFERENCETYPE:
  590. typeOk = type->nodeClass == UA_NODECLASS_REFERENCETYPE;
  591. break;
  592. case UA_NODECLASS_VARIABLE:
  593. typeOk = type->nodeClass == UA_NODECLASS_VARIABLETYPE;
  594. break;
  595. case UA_NODECLASS_VARIABLETYPE:
  596. typeOk = type->nodeClass == UA_NODECLASS_VARIABLETYPE;
  597. break;
  598. case UA_NODECLASS_VIEW:
  599. typeOk = type->nodeClass == UA_NODECLASS_VIEW;
  600. break;
  601. default:
  602. typeOk = false;
  603. }
  604. if(!typeOk) {
  605. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  606. "AddNodes: Type for %.*s does not match node class",
  607. (int)nodeIdStr.length, nodeIdStr.data));
  608. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  609. goto cleanup;
  610. }
  611. /* See if the type has the correct node class. For type-nodes, we know
  612. * that type has the same nodeClass from checkParentReference. */
  613. if(node->nodeClass == UA_NODECLASS_VARIABLE) {
  614. if(((const UA_VariableTypeNode*)type)->isAbstract) {
  615. /* Get subtypes of the parent reference types */
  616. UA_NodeId *parentTypeHierachy = NULL;
  617. size_t parentTypeHierachySize = 0;
  618. retval = getLocalRecursiveHierarchy(server, parentReferences, UA_PARENT_REFERENCES_COUNT,
  619. &subtypeId, 1, true, &parentTypeHierachy, &parentTypeHierachySize);
  620. if(retval != UA_STATUSCODE_GOOD)
  621. goto cleanup;
  622. /* Abstract variable is allowed if parent is a children of a base data variable */
  623. const UA_NodeId variableTypes = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATAVARIABLETYPE);
  624. /* A variable may be of an object type which again is below BaseObjectType */
  625. const UA_NodeId objectTypes = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEOBJECTTYPE);
  626. if(!isNodeInTree(server->nsCtx, parentNodeId, &variableTypes,
  627. parentTypeHierachy, parentTypeHierachySize) &&
  628. !isNodeInTree(server->nsCtx, parentNodeId, &objectTypes,
  629. parentTypeHierachy,parentTypeHierachySize)) {
  630. UA_Array_delete(parentTypeHierachy, parentTypeHierachySize, &UA_TYPES[UA_TYPES_NODEID]);
  631. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  632. "AddNodes: Type of variable node %.*s must "
  633. "be VariableType and not cannot be abstract",
  634. (int)nodeIdStr.length, nodeIdStr.data));
  635. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  636. goto cleanup;
  637. }
  638. UA_Array_delete(parentTypeHierachy, parentTypeHierachySize, &UA_TYPES[UA_TYPES_NODEID]);
  639. }
  640. }
  641. if(node->nodeClass == UA_NODECLASS_OBJECT) {
  642. if(((const UA_ObjectTypeNode*)type)->isAbstract) {
  643. /* Get subtypes of the parent reference types */
  644. UA_NodeId *parentTypeHierachy = NULL;
  645. size_t parentTypeHierachySize = 0;
  646. retval = getLocalRecursiveHierarchy(server, parentReferences, UA_PARENT_REFERENCES_COUNT,
  647. &subtypeId, 1, true, &parentTypeHierachy, &parentTypeHierachySize);
  648. if(retval != UA_STATUSCODE_GOOD)
  649. goto cleanup;
  650. /* Object node created of an abstract ObjectType. Only allowed
  651. * if within BaseObjectType folder */
  652. const UA_NodeId objectTypes = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEOBJECTTYPE);
  653. UA_Boolean isInBaseObjectType = isNodeInTree(server->nsCtx, parentNodeId, &objectTypes,
  654. parentTypeHierachy, parentTypeHierachySize);
  655. UA_Array_delete(parentTypeHierachy, parentTypeHierachySize, &UA_TYPES[UA_TYPES_NODEID]);
  656. if(!isInBaseObjectType) {
  657. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  658. "AddNodes: Type of object node %.*s must "
  659. "be ObjectType and not be abstract",
  660. (int)nodeIdStr.length, nodeIdStr.data));
  661. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  662. goto cleanup;
  663. }
  664. }
  665. }
  666. }
  667. /* Add reference to the parent */
  668. if(!UA_NodeId_isNull(parentNodeId)) {
  669. if(UA_NodeId_isNull(referenceTypeId)) {
  670. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  671. "AddNodes: Reference to parent of %.*s cannot be null",
  672. (int)nodeIdStr.length, nodeIdStr.data));
  673. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  674. goto cleanup;
  675. }
  676. retval = addRef(server, session, &node->nodeId, referenceTypeId, parentNodeId, false);
  677. if(retval != UA_STATUSCODE_GOOD) {
  678. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  679. "AddNodes: Adding reference to parent of %.*s failed",
  680. (int)nodeIdStr.length, nodeIdStr.data));
  681. goto cleanup;
  682. }
  683. }
  684. /* Add a hasTypeDefinition reference */
  685. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  686. node->nodeClass == UA_NODECLASS_OBJECT) {
  687. UA_assert(type != NULL); /* see above */
  688. retval = addRef(server, session, &node->nodeId, &hasTypeDefinition, &type->nodeId, true);
  689. if(retval != UA_STATUSCODE_GOOD) {
  690. UA_LOG_NODEID_WRAP(nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  691. "AddNodes: Adding a reference to the type "
  692. "definition of %.*s failed with error code %s",
  693. (int)nodeIdStr.length, nodeIdStr.data,
  694. UA_StatusCode_name(retval)));
  695. }
  696. }
  697. cleanup:
  698. UA_Nodestore_releaseNode(server->nsCtx, node);
  699. if(type)
  700. UA_Nodestore_releaseNode(server->nsCtx, type);
  701. return retval;
  702. }
  703. /* Create the node and add it to the nodestore. But don't typecheck and add
  704. * references so far */
  705. UA_StatusCode
  706. AddNode_raw(UA_Server *server, UA_Session *session, void *nodeContext,
  707. const UA_AddNodesItem *item, UA_NodeId *outNewNodeId) {
  708. /* Do not check access for server */
  709. if(session != &server->adminSession && server->config.accessControl.allowAddNode &&
  710. !server->config.accessControl.allowAddNode(server, &server->config.accessControl,
  711. &session->sessionId, session->sessionHandle, item)) {
  712. return UA_STATUSCODE_BADUSERACCESSDENIED;
  713. }
  714. /* Check the namespaceindex */
  715. if(item->requestedNewNodeId.nodeId.namespaceIndex >= server->namespacesSize) {
  716. UA_LOG_INFO_SESSION(&server->config.logger, session,
  717. "AddNodes: Namespace invalid");
  718. return UA_STATUSCODE_BADNODEIDINVALID;
  719. }
  720. if(item->nodeAttributes.encoding != UA_EXTENSIONOBJECT_DECODED &&
  721. item->nodeAttributes.encoding != UA_EXTENSIONOBJECT_DECODED_NODELETE) {
  722. UA_LOG_INFO_SESSION(&server->config.logger, session,
  723. "AddNodes: Node attributes invalid");
  724. return UA_STATUSCODE_BADINTERNALERROR;
  725. }
  726. /* Create a node */
  727. UA_Node *node = UA_Nodestore_newNode(server->nsCtx, item->nodeClass);
  728. if(!node) {
  729. UA_LOG_INFO_SESSION(&server->config.logger, session,
  730. "AddNodes: Node could not create a node "
  731. "in the nodestore");
  732. return UA_STATUSCODE_BADOUTOFMEMORY;
  733. }
  734. /* Fill the node attributes */
  735. node->context = nodeContext;
  736. UA_StatusCode retval = UA_NodeId_copy(&item->requestedNewNodeId.nodeId, &node->nodeId);
  737. if(retval != UA_STATUSCODE_GOOD)
  738. goto create_error;
  739. retval = UA_QualifiedName_copy(&item->browseName, &node->browseName);
  740. if(retval != UA_STATUSCODE_GOOD)
  741. goto create_error;
  742. retval = UA_Node_setAttributes(node, item->nodeAttributes.content.decoded.data,
  743. item->nodeAttributes.content.decoded.type);
  744. if(retval != UA_STATUSCODE_GOOD)
  745. goto create_error;
  746. /* Add the node to the nodestore */
  747. retval = UA_Nodestore_insertNode(server->nsCtx, node, outNewNodeId);
  748. if(retval != UA_STATUSCODE_GOOD)
  749. UA_LOG_INFO_SESSION(&server->config.logger, session,
  750. "AddNodes: Node could not add the new node "
  751. "to the nodestore with error code %s",
  752. UA_StatusCode_name(retval));
  753. return retval;
  754. create_error:
  755. UA_LOG_INFO_SESSION(&server->config.logger, session,
  756. "AddNodes: Node could not create a node "
  757. "with error code %s", UA_StatusCode_name(retval));
  758. UA_Nodestore_deleteNode(server->nsCtx, node);
  759. return retval;
  760. }
  761. /* Prepare the node, then add it to the nodestore */
  762. static UA_StatusCode
  763. Operation_addNode_begin(UA_Server *server, UA_Session *session, void *nodeContext,
  764. const UA_AddNodesItem *item, const UA_NodeId *parentNodeId,
  765. const UA_NodeId *referenceTypeId, UA_NodeId *outNewNodeId) {
  766. /* Create a temporary NodeId if none is returned */
  767. UA_NodeId newId;
  768. if(!outNewNodeId) {
  769. UA_NodeId_init(&newId);
  770. outNewNodeId = &newId;
  771. }
  772. /* Create the node and add it to the nodestore */
  773. UA_StatusCode retval = AddNode_raw(server, session, nodeContext, item, outNewNodeId);
  774. if(retval != UA_STATUSCODE_GOOD)
  775. return retval;
  776. /* Typecheck and add references to parent and type definition */
  777. retval = AddNode_addRefs(server, session, outNewNodeId, parentNodeId,
  778. referenceTypeId, &item->typeDefinition.nodeId);
  779. if(retval != UA_STATUSCODE_GOOD)
  780. UA_Server_deleteNode(server, *outNewNodeId, true);
  781. if(outNewNodeId == &newId)
  782. UA_NodeId_deleteMembers(&newId);
  783. return retval;
  784. }
  785. static UA_StatusCode
  786. recursiveTypeCheckAddChildren(UA_Server *server, UA_Session *session,
  787. const UA_Node **nodeptr, const UA_Node *type) {
  788. UA_assert(type != NULL);
  789. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  790. const UA_Node *node = *nodeptr;
  791. /* Use attributes from the type. The value and value constraints are the
  792. * same for the variable and variabletype attribute structs. */
  793. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  794. node->nodeClass == UA_NODECLASS_VARIABLETYPE) {
  795. retval = useVariableTypeAttributes(server, session, (const UA_VariableNode**)nodeptr,
  796. (const UA_VariableTypeNode*)type);
  797. node = *nodeptr; /* If the node was replaced */
  798. if(retval != UA_STATUSCODE_GOOD) {
  799. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  800. "AddNodes: Using attributes for %.*s from the variable type "
  801. "failed with error code %s", (int)nodeIdStr.length,
  802. nodeIdStr.data, UA_StatusCode_name(retval)));
  803. return retval;
  804. }
  805. /* Check if all attributes hold the constraints of the type now. The initial
  806. * attributes must type-check. The constructor might change the attributes
  807. * again. Then, the changes are type-checked by the normal write service. */
  808. retval = typeCheckVariableNode(server, session, (const UA_VariableNode*)node,
  809. (const UA_VariableTypeNode*)type);
  810. if(retval != UA_STATUSCODE_GOOD) {
  811. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  812. "AddNodes: Type-checking the variable node %.*s "
  813. "failed with error code %s", (int)nodeIdStr.length,
  814. nodeIdStr.data, UA_StatusCode_name(retval)));
  815. return retval;
  816. }
  817. }
  818. /* Add (mandatory) child nodes from the type definition */
  819. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  820. node->nodeClass == UA_NODECLASS_OBJECT) {
  821. retval = addTypeChildren(server, session, node, type);
  822. if(retval != UA_STATUSCODE_GOOD) {
  823. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  824. "AddNodes: Adding child nodes of %.*s failed with error code %s",
  825. (int)nodeIdStr.length, nodeIdStr.data, UA_StatusCode_name(retval)));
  826. }
  827. }
  828. return UA_STATUSCODE_GOOD;
  829. }
  830. static UA_StatusCode
  831. findDefaultInstanceBrowseNameNode(UA_Server *server,
  832. UA_NodeId startingNode, UA_NodeId *foundId){
  833. UA_NodeId_init(foundId);
  834. UA_RelativePathElement rpe;
  835. UA_RelativePathElement_init(&rpe);
  836. rpe.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  837. rpe.isInverse = false;
  838. rpe.includeSubtypes = false;
  839. rpe.targetName = UA_QUALIFIEDNAME(0, "DefaultInstanceBrowseName");
  840. UA_BrowsePath bp;
  841. UA_BrowsePath_init(&bp);
  842. bp.startingNode = startingNode;
  843. bp.relativePath.elementsSize = 1;
  844. bp.relativePath.elements = &rpe;
  845. UA_BrowsePathResult bpr =
  846. UA_Server_translateBrowsePathToNodeIds(server, &bp);
  847. UA_StatusCode retval = bpr.statusCode;
  848. if (retval == UA_STATUSCODE_GOOD &&
  849. bpr.targetsSize > 0) {
  850. retval = UA_NodeId_copy(&bpr.targets[0].targetId.nodeId, foundId);
  851. }
  852. UA_BrowsePathResult_deleteMembers(&bpr);
  853. return retval;
  854. }
  855. /* Check if we got a valid browse name for the new node.
  856. * For object nodes the BrowseName may only be null if the parent type has a
  857. * 'DefaultInstanceBrowseName' property.
  858. * */
  859. static UA_StatusCode
  860. checkValidBrowseName(UA_Server *server, UA_Session *session,
  861. const UA_Node *node, const UA_Node *type) {
  862. UA_assert(type != NULL);
  863. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  864. if(node->nodeClass != UA_NODECLASS_OBJECT) {
  865. /* nodes other than Objects must have a browseName */
  866. if (UA_QualifiedName_isNull(&node->browseName))
  867. return UA_STATUSCODE_BADBROWSENAMEINVALID;
  868. return UA_STATUSCODE_GOOD;
  869. }
  870. /* If the object node already has a browse name we are done here. */
  871. if(!UA_QualifiedName_isNull(&node->browseName))
  872. return UA_STATUSCODE_GOOD;
  873. /* at this point we have an object with an empty browse name.
  874. * Check the type node if it has a DefaultInstanceBrowseName property
  875. */
  876. UA_NodeId defaultBrowseNameNode;
  877. retval = findDefaultInstanceBrowseNameNode(server, type->nodeId, &defaultBrowseNameNode);
  878. if (retval != UA_STATUSCODE_GOOD) {
  879. if (retval == UA_STATUSCODE_BADNOMATCH)
  880. /* the DefaultBrowseName property is not found, return the corresponding status code */
  881. return UA_STATUSCODE_BADBROWSENAMEINVALID;
  882. return retval;
  883. }
  884. UA_Variant defaultBrowseName;
  885. retval = UA_Server_readValue(server, defaultBrowseNameNode, &defaultBrowseName);
  886. if (retval != UA_STATUSCODE_GOOD)
  887. return retval;
  888. UA_QualifiedName *defaultValue = (UA_QualifiedName *) defaultBrowseName.data;
  889. retval = UA_Server_writeBrowseName(server, node->nodeId, *defaultValue);
  890. UA_Variant_clear(&defaultBrowseName);
  891. return retval;
  892. }
  893. /* Construct children first */
  894. static UA_StatusCode
  895. recursiveCallConstructors(UA_Server *server, UA_Session *session,
  896. const UA_Node *node, const UA_Node *type) {
  897. if(node->constructed)
  898. return UA_STATUSCODE_GOOD;
  899. /* Construct the children */
  900. UA_BrowseDescription bd;
  901. UA_BrowseDescription_init(&bd);
  902. bd.nodeId = node->nodeId;
  903. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  904. bd.includeSubtypes = true;
  905. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  906. UA_BrowseResult br;
  907. UA_BrowseResult_init(&br);
  908. struct BrowseOpts bo;
  909. bo.maxReferences = 0;
  910. bo.recursive = false;
  911. Operation_Browse(server, session, &bo, &bd, &br);
  912. if(br.statusCode != UA_STATUSCODE_GOOD)
  913. return br.statusCode;
  914. /* Call the constructor for every unconstructed node */
  915. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  916. for(size_t i = 0; i < br.referencesSize; ++i) {
  917. UA_ReferenceDescription *rd = &br.references[i];
  918. const UA_Node *target = UA_Nodestore_getNode(server->nsCtx, &rd->nodeId.nodeId);
  919. if(!target)
  920. continue;
  921. if(target->constructed) {
  922. UA_Nodestore_releaseNode(server->nsCtx, target);
  923. continue;
  924. }
  925. const UA_Node *targetType = NULL;
  926. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  927. node->nodeClass == UA_NODECLASS_OBJECT) {
  928. targetType = getNodeType(server, target);
  929. if(!targetType) {
  930. UA_Nodestore_releaseNode(server->nsCtx, target);
  931. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  932. break;
  933. }
  934. }
  935. retval = recursiveCallConstructors(server, session, target, targetType);
  936. UA_Nodestore_releaseNode(server->nsCtx, target);
  937. if(targetType)
  938. UA_Nodestore_releaseNode(server->nsCtx, targetType);
  939. if(retval != UA_STATUSCODE_GOOD)
  940. break;
  941. }
  942. UA_BrowseResult_deleteMembers(&br);
  943. /* If a child could not be constructed or the node is already constructed */
  944. if(retval != UA_STATUSCODE_GOOD)
  945. return retval;
  946. /* Get the node type constructor */
  947. const UA_NodeTypeLifecycle *lifecycle = NULL;
  948. if(type && node->nodeClass == UA_NODECLASS_OBJECT) {
  949. const UA_ObjectTypeNode *ot = (const UA_ObjectTypeNode*)type;
  950. lifecycle = &ot->lifecycle;
  951. } else if(type && node->nodeClass == UA_NODECLASS_VARIABLE) {
  952. const UA_VariableTypeNode *vt = (const UA_VariableTypeNode*)type;
  953. lifecycle = &vt->lifecycle;
  954. }
  955. /* Call the global constructor */
  956. void *context = node->context;
  957. if(server->config.nodeLifecycle.constructor)
  958. retval = server->config.nodeLifecycle.constructor(server, &session->sessionId,
  959. session->sessionHandle,
  960. &node->nodeId, &context);
  961. /* Call the type constructor */
  962. if(retval == UA_STATUSCODE_GOOD && lifecycle && lifecycle->constructor)
  963. retval = lifecycle->constructor(server, &session->sessionId,
  964. session->sessionHandle, &type->nodeId,
  965. type->context, &node->nodeId, &context);
  966. if(retval != UA_STATUSCODE_GOOD)
  967. goto fail1;
  968. /* Set the context *and* mark the node as constructed */
  969. if(retval == UA_STATUSCODE_GOOD)
  970. retval = UA_Server_editNode(server, &server->adminSession, &node->nodeId,
  971. (UA_EditNodeCallback)setConstructedNodeContext,
  972. context);
  973. /* All good, return */
  974. if(retval == UA_STATUSCODE_GOOD)
  975. return retval;
  976. /* Fail. Call the destructors. */
  977. if(lifecycle && lifecycle->destructor)
  978. lifecycle->destructor(server, &session->sessionId,
  979. session->sessionHandle, &type->nodeId,
  980. type->context, &node->nodeId, &context);
  981. fail1:
  982. if(server->config.nodeLifecycle.destructor)
  983. server->config.nodeLifecycle.destructor(server, &session->sessionId,
  984. session->sessionHandle,
  985. &node->nodeId, context);
  986. return retval;
  987. }
  988. static void
  989. recursiveDeconstructNode(UA_Server *server, UA_Session *session,
  990. size_t hierarchicalReferencesSize,
  991. UA_NodeId *hierarchicalReferences,
  992. const UA_Node *node);
  993. static void
  994. recursiveDeleteNode(UA_Server *server, UA_Session *session,
  995. size_t hierarchicalReferencesSize,
  996. UA_NodeId *hierarchicalReferences,
  997. const UA_Node *node, UA_Boolean removeTargetRefs);
  998. /* Children, references, type-checking, constructors. */
  999. UA_StatusCode
  1000. AddNode_finish(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId) {
  1001. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1002. /* Get the node */
  1003. const UA_Node *node = UA_Nodestore_getNode(server->nsCtx, nodeId);
  1004. if(!node)
  1005. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  1006. const UA_Node *type = NULL;
  1007. /* Instantiate variables and objects */
  1008. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  1009. node->nodeClass == UA_NODECLASS_VARIABLETYPE ||
  1010. node->nodeClass == UA_NODECLASS_OBJECT) {
  1011. /* Get the type node */
  1012. type = getNodeType(server, node);
  1013. if(!type) {
  1014. if(server->bootstrapNS0)
  1015. goto constructor;
  1016. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  1017. "AddNodes: Node type for %.*s not found",
  1018. (int)nodeIdStr.length, nodeIdStr.data));
  1019. retval = UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  1020. goto cleanup;
  1021. }
  1022. retval = checkValidBrowseName(server, session, node, type);
  1023. if(retval != UA_STATUSCODE_GOOD)
  1024. goto cleanup;
  1025. retval = recursiveTypeCheckAddChildren(server, session, &node, type);
  1026. if(retval != UA_STATUSCODE_GOOD)
  1027. goto cleanup;
  1028. }
  1029. /* Call the constructor(s) */
  1030. constructor:
  1031. retval = recursiveCallConstructors(server, session, node, type);
  1032. if(retval != UA_STATUSCODE_GOOD) {
  1033. UA_LOG_NODEID_WRAP(&node->nodeId, UA_LOG_INFO_SESSION(&server->config.logger, session,
  1034. "AddNodes: Calling the node constructor(s) of %.*s failed "
  1035. "with status code %s", (int)nodeIdStr.length,
  1036. nodeIdStr.data, UA_StatusCode_name(retval)));
  1037. }
  1038. cleanup:
  1039. if(type)
  1040. UA_Nodestore_releaseNode(server->nsCtx, type);
  1041. if(retval != UA_STATUSCODE_GOOD) {
  1042. recursiveDeconstructNode(server, session, 0, NULL, node);
  1043. recursiveDeleteNode(server, session, 0, NULL, node, true);
  1044. }
  1045. UA_Nodestore_releaseNode(server->nsCtx, node);
  1046. return retval;
  1047. }
  1048. static void
  1049. Operation_addNode(UA_Server *server, UA_Session *session, void *nodeContext,
  1050. const UA_AddNodesItem *item, UA_AddNodesResult *result) {
  1051. result->statusCode =
  1052. Operation_addNode_begin(server, session, nodeContext, item, &item->parentNodeId.nodeId,
  1053. &item->referenceTypeId, &result->addedNodeId);
  1054. if(result->statusCode != UA_STATUSCODE_GOOD)
  1055. return;
  1056. /* AddNodes_finish */
  1057. result->statusCode = AddNode_finish(server, session, &result->addedNodeId);
  1058. /* If finishing failed, the node was deleted */
  1059. if(result->statusCode != UA_STATUSCODE_GOOD)
  1060. UA_NodeId_deleteMembers(&result->addedNodeId);
  1061. }
  1062. void
  1063. Service_AddNodes(UA_Server *server, UA_Session *session,
  1064. const UA_AddNodesRequest *request,
  1065. UA_AddNodesResponse *response) {
  1066. UA_LOG_DEBUG_SESSION(&server->config.logger, session, "Processing AddNodesRequest");
  1067. if(server->config.maxNodesPerNodeManagement != 0 &&
  1068. request->nodesToAddSize > server->config.maxNodesPerNodeManagement) {
  1069. response->responseHeader.serviceResult = UA_STATUSCODE_BADTOOMANYOPERATIONS;
  1070. return;
  1071. }
  1072. response->responseHeader.serviceResult =
  1073. UA_Server_processServiceOperations(server, session,
  1074. (UA_ServiceOperation)Operation_addNode, NULL,
  1075. &request->nodesToAddSize, &UA_TYPES[UA_TYPES_ADDNODESITEM],
  1076. &response->resultsSize, &UA_TYPES[UA_TYPES_ADDNODESRESULT]);
  1077. }
  1078. UA_StatusCode
  1079. __UA_Server_addNode(UA_Server *server, const UA_NodeClass nodeClass,
  1080. const UA_NodeId *requestedNewNodeId,
  1081. const UA_NodeId *parentNodeId,
  1082. const UA_NodeId *referenceTypeId,
  1083. const UA_QualifiedName browseName,
  1084. const UA_NodeId *typeDefinition,
  1085. const UA_NodeAttributes *attr,
  1086. const UA_DataType *attributeType,
  1087. void *nodeContext, UA_NodeId *outNewNodeId) {
  1088. /* Create the AddNodesItem */
  1089. UA_AddNodesItem item;
  1090. UA_AddNodesItem_init(&item);
  1091. item.nodeClass = nodeClass;
  1092. item.requestedNewNodeId.nodeId = *requestedNewNodeId;
  1093. item.browseName = browseName;
  1094. item.parentNodeId.nodeId = *parentNodeId;
  1095. item.referenceTypeId = *referenceTypeId;
  1096. item.typeDefinition.nodeId = *typeDefinition;
  1097. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  1098. item.nodeAttributes.content.decoded.type = attributeType;
  1099. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  1100. /* Call the normal addnodes service */
  1101. UA_AddNodesResult result;
  1102. UA_AddNodesResult_init(&result);
  1103. Operation_addNode(server, &server->adminSession, nodeContext, &item, &result);
  1104. if(outNewNodeId)
  1105. *outNewNodeId = result.addedNodeId;
  1106. else
  1107. UA_NodeId_deleteMembers(&result.addedNodeId);
  1108. return result.statusCode;
  1109. }
  1110. UA_StatusCode
  1111. UA_Server_addNode_begin(UA_Server *server, const UA_NodeClass nodeClass,
  1112. const UA_NodeId requestedNewNodeId,
  1113. const UA_NodeId parentNodeId,
  1114. const UA_NodeId referenceTypeId,
  1115. const UA_QualifiedName browseName,
  1116. const UA_NodeId typeDefinition,
  1117. const void *attr, const UA_DataType *attributeType,
  1118. void *nodeContext, UA_NodeId *outNewNodeId) {
  1119. UA_AddNodesItem item;
  1120. UA_AddNodesItem_init(&item);
  1121. item.nodeClass = nodeClass;
  1122. item.requestedNewNodeId.nodeId = requestedNewNodeId;
  1123. item.browseName = browseName;
  1124. item.typeDefinition.nodeId = typeDefinition;
  1125. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  1126. item.nodeAttributes.content.decoded.type = attributeType;
  1127. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  1128. return Operation_addNode_begin(server, &server->adminSession, nodeContext, &item,
  1129. &parentNodeId, &referenceTypeId, outNewNodeId);
  1130. }
  1131. UA_StatusCode
  1132. UA_Server_addNode_finish(UA_Server *server, const UA_NodeId nodeId) {
  1133. return AddNode_finish(server, &server->adminSession, &nodeId);
  1134. }
  1135. /****************/
  1136. /* Delete Nodes */
  1137. /****************/
  1138. static void
  1139. Operation_deleteReference(UA_Server *server, UA_Session *session, void *context,
  1140. const UA_DeleteReferencesItem *item, UA_StatusCode *retval);
  1141. /* Remove references to this node (in the other nodes) */
  1142. static void
  1143. removeIncomingReferences(UA_Server *server, UA_Session *session,
  1144. const UA_Node *node) {
  1145. UA_DeleteReferencesItem item;
  1146. UA_DeleteReferencesItem_init(&item);
  1147. item.targetNodeId.nodeId = node->nodeId;
  1148. item.deleteBidirectional = false;
  1149. UA_StatusCode dummy;
  1150. for(size_t i = 0; i < node->referencesSize; ++i) {
  1151. UA_NodeReferenceKind *refs = &node->references[i];
  1152. item.isForward = refs->isInverse;
  1153. item.referenceTypeId = refs->referenceTypeId;
  1154. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  1155. item.sourceNodeId = refs->targetIds[j].nodeId;
  1156. Operation_deleteReference(server, session, NULL, &item, &dummy);
  1157. }
  1158. }
  1159. }
  1160. /* A node can only be deleted if it has at most one incoming hierarchical
  1161. * reference. If hierarchicalReferences is NULL, always remove. */
  1162. static UA_Boolean
  1163. multipleHierarchies(size_t hierarchicalRefsSize, UA_NodeId *hierarchicalRefs,
  1164. const UA_Node *node) {
  1165. if(!hierarchicalRefs)
  1166. return false;
  1167. size_t incomingRefs = 0;
  1168. for(size_t i = 0; i < node->referencesSize; i++) {
  1169. const UA_NodeReferenceKind *k = &node->references[i];
  1170. if(!k->isInverse)
  1171. continue;
  1172. UA_Boolean hierarchical = false;
  1173. for(size_t j = 0; j < hierarchicalRefsSize; j++) {
  1174. if(UA_NodeId_equal(&hierarchicalRefs[j],
  1175. &k->referenceTypeId)) {
  1176. hierarchical = true;
  1177. break;
  1178. }
  1179. }
  1180. if(!hierarchical)
  1181. continue;
  1182. incomingRefs += k->targetIdsSize;
  1183. if(incomingRefs > 1)
  1184. return true;
  1185. }
  1186. return false;
  1187. }
  1188. /* Recursively call the destructors of this node and all child nodes.
  1189. * Deconstructs the parent before its children. */
  1190. static void
  1191. recursiveDeconstructNode(UA_Server *server, UA_Session *session,
  1192. size_t hierarchicalRefsSize,
  1193. UA_NodeId *hierarchicalRefs,
  1194. const UA_Node *node) {
  1195. /* Was the constructor called for the node? */
  1196. if(!node->constructed)
  1197. return;
  1198. /* Call the type-level destructor */
  1199. void *context = node->context; /* No longer needed after this function */
  1200. if(node->nodeClass == UA_NODECLASS_OBJECT ||
  1201. node->nodeClass == UA_NODECLASS_VARIABLE) {
  1202. const UA_Node *type = getNodeType(server, node);
  1203. if(type) {
  1204. const UA_NodeTypeLifecycle *lifecycle;
  1205. if(node->nodeClass == UA_NODECLASS_OBJECT)
  1206. lifecycle = &((const UA_ObjectTypeNode*)type)->lifecycle;
  1207. else
  1208. lifecycle = &((const UA_VariableTypeNode*)type)->lifecycle;
  1209. if(lifecycle->destructor)
  1210. lifecycle->destructor(server,
  1211. &session->sessionId, session->sessionHandle,
  1212. &type->nodeId, type->context,
  1213. &node->nodeId, &context);
  1214. UA_Nodestore_releaseNode(server->nsCtx, type);
  1215. }
  1216. }
  1217. /* Call the global destructor */
  1218. if(server->config.nodeLifecycle.destructor)
  1219. server->config.nodeLifecycle.destructor(server, &session->sessionId,
  1220. session->sessionHandle,
  1221. &node->nodeId, context);
  1222. /* Set the constructed flag to false */
  1223. UA_Server_editNode(server, &server->adminSession, &node->nodeId,
  1224. (UA_EditNodeCallback)setDeconstructedNode, context);
  1225. /* Browse to get all children of the node */
  1226. UA_BrowseDescription bd;
  1227. UA_BrowseDescription_init(&bd);
  1228. bd.nodeId = node->nodeId;
  1229. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  1230. bd.includeSubtypes = true;
  1231. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  1232. UA_BrowseResult br;
  1233. UA_BrowseResult_init(&br);
  1234. struct BrowseOpts bo;
  1235. bo.maxReferences = 0;
  1236. bo.recursive = false;
  1237. Operation_Browse(server, session, &bo, &bd, &br);
  1238. if(br.statusCode != UA_STATUSCODE_GOOD)
  1239. return;
  1240. /* Deconstruct every child node */
  1241. for(size_t i = 0; i < br.referencesSize; ++i) {
  1242. UA_ReferenceDescription *rd = &br.references[i];
  1243. const UA_Node *child = UA_Nodestore_getNode(server->nsCtx, &rd->nodeId.nodeId);
  1244. if(!child)
  1245. continue;
  1246. /* Only delete child nodes that have no other parent */
  1247. if(!multipleHierarchies(hierarchicalRefsSize, hierarchicalRefs, child))
  1248. recursiveDeconstructNode(server, session, hierarchicalRefsSize,
  1249. hierarchicalRefs, child);
  1250. UA_Nodestore_releaseNode(server->nsCtx, child);
  1251. }
  1252. UA_BrowseResult_deleteMembers(&br);
  1253. }
  1254. static void
  1255. recursiveDeleteNode(UA_Server *server, UA_Session *session,
  1256. size_t hierarchicalRefsSize,
  1257. UA_NodeId *hierarchicalRefs,
  1258. const UA_Node *node, UA_Boolean removeTargetRefs) {
  1259. /* Browse to get all children of the node */
  1260. UA_BrowseDescription bd;
  1261. UA_BrowseDescription_init(&bd);
  1262. bd.nodeId = node->nodeId;
  1263. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  1264. bd.includeSubtypes = true;
  1265. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  1266. UA_BrowseResult br;
  1267. UA_BrowseResult_init(&br);
  1268. struct BrowseOpts bo;
  1269. bo.maxReferences = 0;
  1270. bo.recursive = false;
  1271. Operation_Browse(server, session, &bo, &bd, &br);
  1272. if(br.statusCode != UA_STATUSCODE_GOOD)
  1273. return;
  1274. /* Remove every child */
  1275. for(size_t i = 0; i < br.referencesSize; ++i) {
  1276. UA_ReferenceDescription *rd = &br.references[i];
  1277. /* Check for self-reference to avoid endless loop */
  1278. if(UA_NodeId_equal(&node->nodeId, &rd->nodeId.nodeId))
  1279. continue;
  1280. const UA_Node *child = UA_Nodestore_getNode(server->nsCtx, &rd->nodeId.nodeId);
  1281. if(!child)
  1282. continue;
  1283. /* Only delete child nodes that have no other parent */
  1284. if(!multipleHierarchies(hierarchicalRefsSize, hierarchicalRefs, child))
  1285. recursiveDeleteNode(server, session, hierarchicalRefsSize,
  1286. hierarchicalRefs, child, true);
  1287. UA_Nodestore_releaseNode(server->nsCtx, child);
  1288. }
  1289. UA_BrowseResult_deleteMembers(&br);
  1290. if(removeTargetRefs)
  1291. removeIncomingReferences(server, session, node);
  1292. UA_Nodestore_removeNode(server->nsCtx, &node->nodeId);
  1293. }
  1294. static void
  1295. deleteNodeOperation(UA_Server *server, UA_Session *session, void *context,
  1296. const UA_DeleteNodesItem *item, UA_StatusCode *result) {
  1297. /* Do not check access for server */
  1298. if(session != &server->adminSession && server->config.accessControl.allowDeleteNode &&
  1299. !server->config.accessControl.
  1300. allowDeleteNode(server, &server->config.accessControl, &session->sessionId,
  1301. session->sessionHandle, item)) {
  1302. *result = UA_STATUSCODE_BADUSERACCESSDENIED;
  1303. return;
  1304. }
  1305. const UA_Node *node = UA_Nodestore_getNode(server->nsCtx, &item->nodeId);
  1306. if(!node) {
  1307. *result = UA_STATUSCODE_BADNODEIDUNKNOWN;
  1308. return;
  1309. }
  1310. if(UA_Node_hasSubTypeOrInstances(node)) {
  1311. UA_LOG_INFO_SESSION(&server->config.logger, session,
  1312. "Delete Nodes: Cannot delete a type node "
  1313. "with active instances or subtypes");
  1314. UA_Nodestore_releaseNode(server->nsCtx, node);
  1315. *result = UA_STATUSCODE_BADINTERNALERROR;
  1316. return;
  1317. }
  1318. /* TODO: Check if the information model consistency is violated */
  1319. /* TODO: Check if the node is a mandatory child of a parent */
  1320. /* A node can be referenced with hierarchical references from several
  1321. * parents in the information model. (But not in a circular way.) The
  1322. * hierarchical references are checked to see if a node can be deleted.
  1323. * Getting the type hierarchy can fail in case of low RAM. In that case the
  1324. * nodes are always deleted. */
  1325. UA_NodeId *hierarchicalRefs = NULL;
  1326. size_t hierarchicalRefsSize = 0;
  1327. UA_NodeId hr = UA_NODEID_NUMERIC(0, UA_NS0ID_HIERARCHICALREFERENCES);
  1328. getLocalRecursiveHierarchy(server, &hr, 1, &subtypeId, 1, true, &hierarchicalRefs, &hierarchicalRefsSize);
  1329. if(!hierarchicalRefs) {
  1330. UA_LOG_WARNING_SESSION(&server->config.logger, session,
  1331. "Delete Nodes: Cannot test for hierarchical "
  1332. "references. Deleting the node and all child nodes.");
  1333. }
  1334. recursiveDeconstructNode(server, session, hierarchicalRefsSize, hierarchicalRefs, node);
  1335. recursiveDeleteNode(server, session, hierarchicalRefsSize, hierarchicalRefs, node,
  1336. item->deleteTargetReferences);
  1337. UA_Array_delete(hierarchicalRefs, hierarchicalRefsSize,
  1338. &UA_TYPES[UA_TYPES_NODEID]);
  1339. UA_Nodestore_releaseNode(server->nsCtx, node);
  1340. }
  1341. void Service_DeleteNodes(UA_Server *server, UA_Session *session,
  1342. const UA_DeleteNodesRequest *request,
  1343. UA_DeleteNodesResponse *response) {
  1344. UA_LOG_DEBUG_SESSION(&server->config.logger, session,
  1345. "Processing DeleteNodesRequest");
  1346. if(server->config.maxNodesPerNodeManagement != 0 &&
  1347. request->nodesToDeleteSize > server->config.maxNodesPerNodeManagement) {
  1348. response->responseHeader.serviceResult = UA_STATUSCODE_BADTOOMANYOPERATIONS;
  1349. return;
  1350. }
  1351. response->responseHeader.serviceResult =
  1352. UA_Server_processServiceOperations(server, session,
  1353. (UA_ServiceOperation)deleteNodeOperation,
  1354. NULL, &request->nodesToDeleteSize,
  1355. &UA_TYPES[UA_TYPES_DELETENODESITEM],
  1356. &response->resultsSize, &UA_TYPES[UA_TYPES_STATUSCODE]);
  1357. }
  1358. UA_StatusCode
  1359. UA_Server_deleteNode(UA_Server *server, const UA_NodeId nodeId,
  1360. UA_Boolean deleteReferences) {
  1361. UA_DeleteNodesItem item;
  1362. item.deleteTargetReferences = deleteReferences;
  1363. item.nodeId = nodeId;
  1364. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1365. deleteNodeOperation(server, &server->adminSession, NULL, &item, &retval);
  1366. return retval;
  1367. }
  1368. /******************/
  1369. /* Add References */
  1370. /******************/
  1371. static UA_StatusCode
  1372. addOneWayReference(UA_Server *server, UA_Session *session,
  1373. UA_Node *node, const UA_AddReferencesItem *item) {
  1374. return UA_Node_addReference(node, item);
  1375. }
  1376. static UA_StatusCode
  1377. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  1378. const UA_DeleteReferencesItem *item) {
  1379. return UA_Node_deleteReference(node, item);
  1380. }
  1381. static void
  1382. Operation_addReference(UA_Server *server, UA_Session *session, void *context,
  1383. const UA_AddReferencesItem *item, UA_StatusCode *retval) {
  1384. /* Do not check access for server */
  1385. if(session != &server->adminSession && server->config.accessControl.allowAddReference &&
  1386. !server->config.accessControl.
  1387. allowAddReference(server, &server->config.accessControl,
  1388. &session->sessionId, session->sessionHandle, item)) {
  1389. *retval = UA_STATUSCODE_BADUSERACCESSDENIED;
  1390. return;
  1391. }
  1392. /* Currently no expandednodeids are allowed */
  1393. if(item->targetServerUri.length > 0) {
  1394. *retval = UA_STATUSCODE_BADNOTIMPLEMENTED;
  1395. return;
  1396. }
  1397. /* Add the first direction */
  1398. *retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  1399. (UA_EditNodeCallback)addOneWayReference,
  1400. /* cast away const because callback uses const anyway */
  1401. (UA_AddReferencesItem *)(uintptr_t)item);
  1402. UA_Boolean firstExisted = false;
  1403. if(*retval == UA_STATUSCODE_BADDUPLICATEREFERENCENOTALLOWED) {
  1404. *retval = UA_STATUSCODE_GOOD;
  1405. firstExisted = true;
  1406. } else if(*retval != UA_STATUSCODE_GOOD)
  1407. return;
  1408. /* Add the second direction */
  1409. UA_AddReferencesItem secondItem;
  1410. UA_AddReferencesItem_init(&secondItem);
  1411. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1412. secondItem.referenceTypeId = item->referenceTypeId;
  1413. secondItem.isForward = !item->isForward;
  1414. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1415. /* keep default secondItem.targetNodeClass = UA_NODECLASS_UNSPECIFIED */
  1416. *retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1417. (UA_EditNodeCallback)addOneWayReference, &secondItem);
  1418. /* remove reference if the second direction failed */
  1419. UA_Boolean secondExisted = false;
  1420. if(*retval == UA_STATUSCODE_BADDUPLICATEREFERENCENOTALLOWED) {
  1421. *retval = UA_STATUSCODE_GOOD;
  1422. secondExisted = true;
  1423. } else if(*retval != UA_STATUSCODE_GOOD && !firstExisted) {
  1424. UA_DeleteReferencesItem deleteItem;
  1425. deleteItem.sourceNodeId = item->sourceNodeId;
  1426. deleteItem.referenceTypeId = item->referenceTypeId;
  1427. deleteItem.isForward = item->isForward;
  1428. deleteItem.targetNodeId = item->targetNodeId;
  1429. deleteItem.deleteBidirectional = false;
  1430. /* ignore returned status code */
  1431. UA_Server_editNode(server, session, &item->sourceNodeId,
  1432. (UA_EditNodeCallback)deleteOneWayReference, &deleteItem);
  1433. }
  1434. /* Calculate common duplicate reference not allowed result and set bad result
  1435. * if BOTH directions already existed */
  1436. if(firstExisted && secondExisted)
  1437. *retval = UA_STATUSCODE_BADDUPLICATEREFERENCENOTALLOWED;
  1438. }
  1439. void Service_AddReferences(UA_Server *server, UA_Session *session,
  1440. const UA_AddReferencesRequest *request,
  1441. UA_AddReferencesResponse *response) {
  1442. UA_LOG_DEBUG_SESSION(&server->config.logger, session,
  1443. "Processing AddReferencesRequest");
  1444. if(server->config.maxNodesPerNodeManagement != 0 &&
  1445. request->referencesToAddSize > server->config.maxNodesPerNodeManagement) {
  1446. response->responseHeader.serviceResult = UA_STATUSCODE_BADTOOMANYOPERATIONS;
  1447. return;
  1448. }
  1449. response->responseHeader.serviceResult =
  1450. UA_Server_processServiceOperations(server, session,
  1451. (UA_ServiceOperation)Operation_addReference,
  1452. NULL, &request->referencesToAddSize,
  1453. &UA_TYPES[UA_TYPES_ADDREFERENCESITEM],
  1454. &response->resultsSize, &UA_TYPES[UA_TYPES_STATUSCODE]);
  1455. }
  1456. UA_StatusCode
  1457. UA_Server_addReference(UA_Server *server, const UA_NodeId sourceId,
  1458. const UA_NodeId refTypeId,
  1459. const UA_ExpandedNodeId targetId,
  1460. UA_Boolean isForward) {
  1461. UA_AddReferencesItem item;
  1462. UA_AddReferencesItem_init(&item);
  1463. item.sourceNodeId = sourceId;
  1464. item.referenceTypeId = refTypeId;
  1465. item.isForward = isForward;
  1466. item.targetNodeId = targetId;
  1467. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1468. Operation_addReference(server, &server->adminSession, NULL, &item, &retval);
  1469. return retval;
  1470. }
  1471. /*********************/
  1472. /* Delete References */
  1473. /*********************/
  1474. static void
  1475. Operation_deleteReference(UA_Server *server, UA_Session *session, void *context,
  1476. const UA_DeleteReferencesItem *item, UA_StatusCode *retval) {
  1477. /* Do not check access for server */
  1478. if(session != &server->adminSession && server->config.accessControl.allowDeleteReference &&
  1479. !server->config.accessControl.
  1480. allowDeleteReference(server, &server->config.accessControl,
  1481. &session->sessionId, session->sessionHandle, item)) {
  1482. *retval = UA_STATUSCODE_BADUSERACCESSDENIED;
  1483. return;
  1484. }
  1485. // TODO: Check consistency constraints, remove the references.
  1486. *retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  1487. (UA_EditNodeCallback)deleteOneWayReference,
  1488. /* cast away const qualifier because callback uses it anyway */
  1489. (UA_DeleteReferencesItem *)(uintptr_t)item);
  1490. if(*retval != UA_STATUSCODE_GOOD)
  1491. return;
  1492. if(!item->deleteBidirectional || item->targetNodeId.serverIndex != 0)
  1493. return;
  1494. UA_DeleteReferencesItem secondItem;
  1495. UA_DeleteReferencesItem_init(&secondItem);
  1496. secondItem.isForward = !item->isForward;
  1497. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1498. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1499. secondItem.referenceTypeId = item->referenceTypeId;
  1500. *retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1501. (UA_EditNodeCallback)deleteOneWayReference,
  1502. &secondItem);
  1503. }
  1504. void
  1505. Service_DeleteReferences(UA_Server *server, UA_Session *session,
  1506. const UA_DeleteReferencesRequest *request,
  1507. UA_DeleteReferencesResponse *response) {
  1508. UA_LOG_DEBUG_SESSION(&server->config.logger, session,
  1509. "Processing DeleteReferencesRequest");
  1510. if(server->config.maxNodesPerNodeManagement != 0 &&
  1511. request->referencesToDeleteSize > server->config.maxNodesPerNodeManagement) {
  1512. response->responseHeader.serviceResult = UA_STATUSCODE_BADTOOMANYOPERATIONS;
  1513. return;
  1514. }
  1515. response->responseHeader.serviceResult =
  1516. UA_Server_processServiceOperations(server, session,
  1517. (UA_ServiceOperation)Operation_deleteReference,
  1518. NULL, &request->referencesToDeleteSize,
  1519. &UA_TYPES[UA_TYPES_DELETEREFERENCESITEM],
  1520. &response->resultsSize, &UA_TYPES[UA_TYPES_STATUSCODE]);
  1521. }
  1522. UA_StatusCode
  1523. UA_Server_deleteReference(UA_Server *server, const UA_NodeId sourceNodeId,
  1524. const UA_NodeId referenceTypeId, UA_Boolean isForward,
  1525. const UA_ExpandedNodeId targetNodeId,
  1526. UA_Boolean deleteBidirectional) {
  1527. UA_DeleteReferencesItem item;
  1528. item.sourceNodeId = sourceNodeId;
  1529. item.referenceTypeId = referenceTypeId;
  1530. item.isForward = isForward;
  1531. item.targetNodeId = targetNodeId;
  1532. item.deleteBidirectional = deleteBidirectional;
  1533. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1534. Operation_deleteReference(server, &server->adminSession, NULL, &item, &retval);
  1535. return retval;
  1536. }
  1537. /**********************/
  1538. /* Set Value Callback */
  1539. /**********************/
  1540. static UA_StatusCode
  1541. setValueCallback(UA_Server *server, UA_Session *session,
  1542. UA_VariableNode *node, const UA_ValueCallback *callback) {
  1543. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1544. return UA_STATUSCODE_BADNODECLASSINVALID;
  1545. node->value.data.callback = *callback;
  1546. return UA_STATUSCODE_GOOD;
  1547. }
  1548. UA_StatusCode
  1549. UA_Server_setVariableNode_valueCallback(UA_Server *server,
  1550. const UA_NodeId nodeId,
  1551. const UA_ValueCallback callback) {
  1552. return UA_Server_editNode(server, &server->adminSession, &nodeId,
  1553. (UA_EditNodeCallback)setValueCallback,
  1554. /* cast away const because callback uses const anyway */
  1555. (UA_ValueCallback *)(uintptr_t) &callback);
  1556. }
  1557. /***************************************************/
  1558. /* Special Handling of Variables with Data Sources */
  1559. /***************************************************/
  1560. UA_StatusCode
  1561. UA_Server_addDataSourceVariableNode(UA_Server *server, const UA_NodeId requestedNewNodeId,
  1562. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  1563. const UA_QualifiedName browseName, const UA_NodeId typeDefinition,
  1564. const UA_VariableAttributes attr, const UA_DataSource dataSource,
  1565. void *nodeContext, UA_NodeId *outNewNodeId) {
  1566. UA_AddNodesItem item;
  1567. UA_AddNodesItem_init(&item);
  1568. item.nodeClass = UA_NODECLASS_VARIABLE;
  1569. item.requestedNewNodeId.nodeId = requestedNewNodeId;
  1570. item.browseName = browseName;
  1571. UA_ExpandedNodeId typeDefinitionId;
  1572. UA_ExpandedNodeId_init(&typeDefinitionId);
  1573. typeDefinitionId.nodeId = typeDefinition;
  1574. item.typeDefinition = typeDefinitionId;
  1575. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  1576. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)&attr;
  1577. item.nodeAttributes.content.decoded.type = &UA_TYPES[UA_TYPES_VARIABLEATTRIBUTES];
  1578. UA_NodeId newNodeId;
  1579. if(!outNewNodeId) {
  1580. newNodeId = UA_NODEID_NULL;
  1581. outNewNodeId = &newNodeId;
  1582. }
  1583. /* Create the node and add it to the nodestore */
  1584. UA_StatusCode retval = AddNode_raw(server, &server->adminSession, nodeContext,
  1585. &item, outNewNodeId);
  1586. if(retval != UA_STATUSCODE_GOOD)
  1587. goto cleanup;
  1588. /* Set the data source */
  1589. retval = UA_Server_setVariableNode_dataSource(server, *outNewNodeId, dataSource);
  1590. if(retval != UA_STATUSCODE_GOOD)
  1591. goto cleanup;
  1592. /* Typecheck and add references to parent and type definition */
  1593. retval = AddNode_addRefs(server, &server->adminSession, outNewNodeId, &parentNodeId,
  1594. &referenceTypeId, &typeDefinition);
  1595. if(retval != UA_STATUSCODE_GOOD)
  1596. goto cleanup;
  1597. /* Call the constructors */
  1598. retval = AddNode_finish(server, &server->adminSession, outNewNodeId);
  1599. cleanup:
  1600. if(outNewNodeId == &newNodeId)
  1601. UA_NodeId_deleteMembers(&newNodeId);
  1602. return retval;
  1603. }
  1604. static UA_StatusCode
  1605. setDataSource(UA_Server *server, UA_Session *session,
  1606. UA_VariableNode* node, const UA_DataSource *dataSource) {
  1607. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1608. return UA_STATUSCODE_BADNODECLASSINVALID;
  1609. if(node->valueSource == UA_VALUESOURCE_DATA)
  1610. UA_DataValue_deleteMembers(&node->value.data.value);
  1611. node->value.dataSource = *dataSource;
  1612. node->valueSource = UA_VALUESOURCE_DATASOURCE;
  1613. return UA_STATUSCODE_GOOD;
  1614. }
  1615. UA_StatusCode
  1616. UA_Server_setVariableNode_dataSource(UA_Server *server, const UA_NodeId nodeId,
  1617. const UA_DataSource dataSource) {
  1618. return UA_Server_editNode(server, &server->adminSession, &nodeId,
  1619. (UA_EditNodeCallback)setDataSource,
  1620. /* casting away const because callback casts it back anyway */
  1621. (UA_DataSource *) (uintptr_t)&dataSource);
  1622. }
  1623. /************************************/
  1624. /* Special Handling of Method Nodes */
  1625. /************************************/
  1626. #ifdef UA_ENABLE_METHODCALLS
  1627. static const UA_NodeId hasproperty = {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_HASPROPERTY}};
  1628. static const UA_NodeId propertytype = {0, UA_NODEIDTYPE_NUMERIC, {UA_NS0ID_PROPERTYTYPE}};
  1629. static UA_StatusCode
  1630. UA_Server_addMethodNodeEx_finish(UA_Server *server, const UA_NodeId nodeId, UA_MethodCallback method,
  1631. const size_t inputArgumentsSize, const UA_Argument *inputArguments,
  1632. const UA_NodeId inputArgumentsRequestedNewNodeId,
  1633. UA_NodeId *inputArgumentsOutNewNodeId,
  1634. const size_t outputArgumentsSize, const UA_Argument *outputArguments,
  1635. const UA_NodeId outputArgumentsRequestedNewNodeId,
  1636. UA_NodeId *outputArgumentsOutNewNodeId) {
  1637. /* Browse to see which argument nodes exist */
  1638. UA_BrowseDescription bd;
  1639. UA_BrowseDescription_init(&bd);
  1640. bd.nodeId = nodeId;
  1641. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  1642. bd.includeSubtypes = false;
  1643. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  1644. bd.nodeClassMask = UA_NODECLASS_VARIABLE;
  1645. bd.resultMask = UA_BROWSERESULTMASK_BROWSENAME;
  1646. UA_BrowseResult br;
  1647. UA_BrowseResult_init(&br);
  1648. struct BrowseOpts bo;
  1649. bo.maxReferences = 0;
  1650. bo.recursive = false;
  1651. Operation_Browse(server, &server->adminSession, &bo, &bd, &br);
  1652. UA_StatusCode retval = br.statusCode;
  1653. if(retval != UA_STATUSCODE_GOOD) {
  1654. UA_Server_deleteNode(server, nodeId, true);
  1655. UA_BrowseResult_deleteMembers(&br);
  1656. return retval;
  1657. }
  1658. /* Filter out the argument nodes */
  1659. UA_NodeId inputArgsId = UA_NODEID_NULL;
  1660. UA_NodeId outputArgsId = UA_NODEID_NULL;
  1661. const UA_QualifiedName inputArgsName = UA_QUALIFIEDNAME(0, "InputArguments");
  1662. const UA_QualifiedName outputArgsName = UA_QUALIFIEDNAME(0, "OutputArguments");
  1663. for(size_t i = 0; i < br.referencesSize; i++) {
  1664. UA_ReferenceDescription *rd = &br.references[i];
  1665. if(rd->browseName.namespaceIndex == 0 &&
  1666. UA_String_equal(&rd->browseName.name, &inputArgsName.name))
  1667. inputArgsId = rd->nodeId.nodeId;
  1668. else if(rd->browseName.namespaceIndex == 0 &&
  1669. UA_String_equal(&rd->browseName.name, &outputArgsName.name))
  1670. outputArgsId = rd->nodeId.nodeId;
  1671. }
  1672. /* Add the Input Arguments VariableNode */
  1673. if(inputArgumentsSize > 0 && UA_NodeId_isNull(&inputArgsId)) {
  1674. UA_VariableAttributes attr = UA_VariableAttributes_default;
  1675. char *name = "InputArguments";
  1676. attr.displayName = UA_LOCALIZEDTEXT("", name);
  1677. attr.dataType = UA_TYPES[UA_TYPES_ARGUMENT].typeId;
  1678. attr.valueRank = UA_VALUERANK_ONE_DIMENSION;
  1679. UA_UInt32 inputArgsSize32 = (UA_UInt32)inputArgumentsSize;
  1680. attr.arrayDimensions = &inputArgsSize32;
  1681. attr.arrayDimensionsSize = 1;
  1682. UA_Variant_setArray(&attr.value, (void *)(uintptr_t)inputArguments,
  1683. inputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1684. retval = UA_Server_addVariableNode(server, inputArgumentsRequestedNewNodeId, nodeId,
  1685. hasproperty, UA_QUALIFIEDNAME(0, name),
  1686. propertytype, attr, NULL, &inputArgsId);
  1687. if(retval != UA_STATUSCODE_GOOD)
  1688. goto error;
  1689. }
  1690. /* Add the Output Arguments VariableNode */
  1691. if(outputArgumentsSize > 0 && UA_NodeId_isNull(&outputArgsId)) {
  1692. UA_VariableAttributes attr = UA_VariableAttributes_default;
  1693. char *name = "OutputArguments";
  1694. attr.displayName = UA_LOCALIZEDTEXT("", name);
  1695. attr.dataType = UA_TYPES[UA_TYPES_ARGUMENT].typeId;
  1696. attr.valueRank = UA_VALUERANK_ONE_DIMENSION;
  1697. UA_UInt32 outputArgsSize32 = (UA_UInt32)outputArgumentsSize;
  1698. attr.arrayDimensions = &outputArgsSize32;
  1699. attr.arrayDimensionsSize = 1;
  1700. UA_Variant_setArray(&attr.value, (void *)(uintptr_t)outputArguments,
  1701. outputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1702. retval = UA_Server_addVariableNode(server, outputArgumentsRequestedNewNodeId, nodeId,
  1703. hasproperty, UA_QUALIFIEDNAME(0, name),
  1704. propertytype, attr, NULL, &outputArgsId);
  1705. if(retval != UA_STATUSCODE_GOOD)
  1706. goto error;
  1707. }
  1708. retval = UA_Server_setMethodNode_callback(server, nodeId, method);
  1709. if(retval != UA_STATUSCODE_GOOD)
  1710. goto error;
  1711. /* Call finish to add the parent reference */
  1712. retval = AddNode_finish(server, &server->adminSession, &nodeId);
  1713. if(retval != UA_STATUSCODE_GOOD)
  1714. goto error;
  1715. if(inputArgumentsOutNewNodeId != NULL) {
  1716. UA_NodeId_copy(&inputArgsId, inputArgumentsOutNewNodeId);
  1717. }
  1718. if(outputArgumentsOutNewNodeId != NULL) {
  1719. UA_NodeId_copy(&outputArgsId, outputArgumentsOutNewNodeId);
  1720. }
  1721. UA_BrowseResult_deleteMembers(&br);
  1722. return retval;
  1723. error:
  1724. UA_Server_deleteNode(server, nodeId, true);
  1725. UA_Server_deleteNode(server, inputArgsId, true);
  1726. UA_Server_deleteNode(server, outputArgsId, true);
  1727. UA_BrowseResult_deleteMembers(&br);
  1728. return retval;
  1729. }
  1730. UA_StatusCode
  1731. UA_Server_addMethodNode_finish(UA_Server *server, const UA_NodeId nodeId,
  1732. UA_MethodCallback method,
  1733. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  1734. size_t outputArgumentsSize, const UA_Argument* outputArguments) {
  1735. return UA_Server_addMethodNodeEx_finish(server, nodeId, method,
  1736. inputArgumentsSize, inputArguments, UA_NODEID_NULL, NULL,
  1737. outputArgumentsSize, outputArguments, UA_NODEID_NULL, NULL);
  1738. }
  1739. UA_StatusCode
  1740. UA_Server_addMethodNodeEx(UA_Server *server, const UA_NodeId requestedNewNodeId,
  1741. const UA_NodeId parentNodeId,
  1742. const UA_NodeId referenceTypeId,
  1743. const UA_QualifiedName browseName,
  1744. const UA_MethodAttributes attr, UA_MethodCallback method,
  1745. size_t inputArgumentsSize, const UA_Argument *inputArguments,
  1746. const UA_NodeId inputArgumentsRequestedNewNodeId,
  1747. UA_NodeId *inputArgumentsOutNewNodeId,
  1748. size_t outputArgumentsSize, const UA_Argument *outputArguments,
  1749. const UA_NodeId outputArgumentsRequestedNewNodeId,
  1750. UA_NodeId *outputArgumentsOutNewNodeId,
  1751. void *nodeContext, UA_NodeId *outNewNodeId) {
  1752. UA_AddNodesItem item;
  1753. UA_AddNodesItem_init(&item);
  1754. item.nodeClass = UA_NODECLASS_METHOD;
  1755. item.requestedNewNodeId.nodeId = requestedNewNodeId;
  1756. item.browseName = browseName;
  1757. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  1758. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)&attr;
  1759. item.nodeAttributes.content.decoded.type = &UA_TYPES[UA_TYPES_METHODATTRIBUTES];
  1760. UA_NodeId newId;
  1761. if(!outNewNodeId) {
  1762. UA_NodeId_init(&newId);
  1763. outNewNodeId = &newId;
  1764. }
  1765. UA_StatusCode retval = Operation_addNode_begin(server, &server->adminSession,
  1766. nodeContext, &item, &parentNodeId,
  1767. &referenceTypeId, outNewNodeId);
  1768. if(retval != UA_STATUSCODE_GOOD)
  1769. return retval;
  1770. retval = UA_Server_addMethodNodeEx_finish(server, *outNewNodeId, method,
  1771. inputArgumentsSize, inputArguments,
  1772. inputArgumentsRequestedNewNodeId,
  1773. inputArgumentsOutNewNodeId,
  1774. outputArgumentsSize, outputArguments,
  1775. outputArgumentsRequestedNewNodeId,
  1776. outputArgumentsOutNewNodeId);
  1777. if(outNewNodeId == &newId)
  1778. UA_NodeId_deleteMembers(&newId);
  1779. return retval;
  1780. }
  1781. static UA_StatusCode
  1782. editMethodCallback(UA_Server *server, UA_Session* session,
  1783. UA_Node* node, void* handle) {
  1784. if(node->nodeClass != UA_NODECLASS_METHOD)
  1785. return UA_STATUSCODE_BADNODECLASSINVALID;
  1786. UA_MethodNode *mnode = (UA_MethodNode*) node;
  1787. mnode->method = (UA_MethodCallback)(uintptr_t)handle;
  1788. return UA_STATUSCODE_GOOD;
  1789. }
  1790. UA_StatusCode
  1791. UA_Server_setMethodNode_callback(UA_Server *server,
  1792. const UA_NodeId methodNodeId,
  1793. UA_MethodCallback methodCallback) {
  1794. return UA_Server_editNode(server, &server->adminSession, &methodNodeId,
  1795. (UA_EditNodeCallback)editMethodCallback,
  1796. (void*)(uintptr_t)methodCallback);
  1797. }
  1798. #endif
  1799. /************************/
  1800. /* Lifecycle Management */
  1801. /************************/
  1802. static UA_StatusCode
  1803. setNodeTypeLifecycle(UA_Server *server, UA_Session *session,
  1804. UA_Node* node, UA_NodeTypeLifecycle *lifecycle) {
  1805. if(node->nodeClass == UA_NODECLASS_OBJECTTYPE) {
  1806. UA_ObjectTypeNode *ot = (UA_ObjectTypeNode*)node;
  1807. ot->lifecycle = *lifecycle;
  1808. return UA_STATUSCODE_GOOD;
  1809. }
  1810. if(node->nodeClass == UA_NODECLASS_VARIABLETYPE) {
  1811. UA_VariableTypeNode *vt = (UA_VariableTypeNode*)node;
  1812. vt->lifecycle = *lifecycle;
  1813. return UA_STATUSCODE_GOOD;
  1814. }
  1815. return UA_STATUSCODE_BADNODECLASSINVALID;
  1816. }
  1817. UA_StatusCode
  1818. UA_Server_setNodeTypeLifecycle(UA_Server *server, UA_NodeId nodeId,
  1819. UA_NodeTypeLifecycle lifecycle) {
  1820. return UA_Server_editNode(server, &server->adminSession, &nodeId,
  1821. (UA_EditNodeCallback)setNodeTypeLifecycle,
  1822. &lifecycle);
  1823. }