ua_services_nodemanagement.c 90 KB

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