ua_services_nodemanagement.c 89 KB

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