ua_services_nodemanagement.c 94 KB

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