ua_services_nodemanagement.c 95 KB

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