ua_services_nodemanagement.c 67 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677
  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. #include "ua_server_internal.h"
  5. #include "ua_services.h"
  6. /************************/
  7. /* Forward Declarations */
  8. /************************/
  9. static UA_StatusCode
  10. copyChildNodes(UA_Server *server, UA_Session *session,
  11. const UA_NodeId *sourceNodeId, const UA_NodeId *destinationNodeId,
  12. UA_InstantiationCallback *instantiationCallback);
  13. static UA_StatusCode
  14. Service_AddNode_finish(UA_Server *server, UA_Session *session,
  15. const UA_NodeId *nodeId, const UA_NodeId *parentNodeId,
  16. const UA_NodeId *referenceTypeId,
  17. const UA_NodeId *typeDefinition,
  18. UA_InstantiationCallback *instantiationCallback);
  19. static UA_StatusCode
  20. deleteNode(UA_Server *server, UA_Session *session,
  21. const UA_NodeId *nodeId, UA_Boolean deleteReferences);
  22. static void
  23. addReference(UA_Server *server, UA_Session *session,
  24. const UA_AddReferencesItem *item,
  25. UA_StatusCode *retval);
  26. static UA_StatusCode
  27. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  28. const UA_DeleteReferencesItem *item);
  29. static void
  30. deleteReference(UA_Server *server, UA_Session *session,
  31. const UA_DeleteReferencesItem *item, UA_StatusCode *retval);
  32. /**********************/
  33. /* Consistency Checks */
  34. /**********************/
  35. /* Check if the requested parent node exists, has the right node class and is
  36. * referenced with an allowed (hierarchical) reference type. For "type" nodes,
  37. * only hasSubType references are allowed. */
  38. static UA_StatusCode
  39. checkParentReference(UA_Server *server, UA_Session *session, UA_NodeClass nodeClass,
  40. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId) {
  41. /* Objects do not need a parent (e.g. mandatory/optional modellingrules) */
  42. if(nodeClass == UA_NODECLASS_OBJECT && UA_NodeId_isNull(parentNodeId) &&
  43. UA_NodeId_isNull(referenceTypeId))
  44. return UA_STATUSCODE_GOOD;
  45. /* See if the parent exists */
  46. const UA_Node *parent = UA_NodeStore_get(server->nodestore, parentNodeId);
  47. if(!parent) {
  48. UA_LOG_INFO_SESSION(server->config.logger, session,
  49. "AddNodes: Parent node not found", NULL);
  50. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  51. }
  52. /* Check the referencetype exists */
  53. const UA_ReferenceTypeNode *referenceType =
  54. (const UA_ReferenceTypeNode*)UA_NodeStore_get(server->nodestore, referenceTypeId);
  55. if(!referenceType) {
  56. UA_LOG_INFO_SESSION(server->config.logger, session,
  57. "AddNodes: Reference type to the parent not found", NULL);
  58. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  59. }
  60. /* Check if the referencetype is a reference type node */
  61. if(referenceType->nodeClass != UA_NODECLASS_REFERENCETYPE) {
  62. UA_LOG_INFO_SESSION(server->config.logger, session,
  63. "AddNodes: Reference type to the parent invalid", NULL);
  64. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  65. }
  66. /* Check that the reference type is not abstract */
  67. if(referenceType->isAbstract == true) {
  68. UA_LOG_INFO_SESSION(server->config.logger, session,
  69. "AddNodes: Abstract reference type to the parent not allowed", NULL);
  70. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  71. }
  72. /* Check hassubtype relation for type nodes */
  73. const UA_NodeId subtypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  74. if(nodeClass == UA_NODECLASS_DATATYPE ||
  75. nodeClass == UA_NODECLASS_VARIABLETYPE ||
  76. nodeClass == UA_NODECLASS_OBJECTTYPE ||
  77. nodeClass == UA_NODECLASS_REFERENCETYPE) {
  78. /* type needs hassubtype reference to the supertype */
  79. if(!UA_NodeId_equal(referenceTypeId, &subtypeId)) {
  80. UA_LOG_INFO_SESSION(server->config.logger, session,
  81. "AddNodes: New type node need to have a "
  82. "HasSubType reference", NULL);
  83. return UA_STATUSCODE_BADREFERENCENOTALLOWED;
  84. }
  85. /* supertype needs to be of the same node type */
  86. if(parent->nodeClass != nodeClass) {
  87. UA_LOG_INFO_SESSION(server->config.logger, session,
  88. "AddNodes: New type node needs to be of the same "
  89. "node type as the parent", NULL);
  90. return UA_STATUSCODE_BADPARENTNODEIDINVALID;
  91. }
  92. return UA_STATUSCODE_GOOD;
  93. }
  94. /* Test if the referencetype is hierarchical */
  95. const UA_NodeId hierarchicalReference =
  96. UA_NODEID_NUMERIC(0, UA_NS0ID_HIERARCHICALREFERENCES);
  97. if(!isNodeInTree(server->nodestore, referenceTypeId,
  98. &hierarchicalReference, &subtypeId, 1)) {
  99. UA_LOG_INFO_SESSION(server->config.logger, session,
  100. "AddNodes: Reference type is not hierarchical", NULL);
  101. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  102. }
  103. return UA_STATUSCODE_GOOD;
  104. }
  105. static UA_StatusCode
  106. typeCheckVariableNodeWithValue(UA_Server *server, UA_Session *session,
  107. const UA_VariableNode *node,
  108. const UA_VariableTypeNode *vt,
  109. UA_DataValue *value) {
  110. /* Check the datatype against the vt */
  111. if(!compatibleDataType(server, &node->dataType, &vt->dataType))
  112. return UA_STATUSCODE_BADTYPEMISMATCH;
  113. /* Get the array dimensions */
  114. size_t arrayDims = node->arrayDimensionsSize;
  115. if(arrayDims == 0 && value->hasValue && value->value.type &&
  116. !UA_Variant_isScalar(&value->value)) {
  117. arrayDims = 1; /* No array dimensions on an array implies one dimension */
  118. }
  119. /* Check valueRank against array dimensions */
  120. UA_StatusCode retval = compatibleValueRankArrayDimensions(node->valueRank, arrayDims);
  121. if(retval != UA_STATUSCODE_GOOD)
  122. return retval;
  123. /* Check valueRank against the vt */
  124. retval = compatibleValueRanks(node->valueRank, vt->valueRank);
  125. if(retval != UA_STATUSCODE_GOOD)
  126. return retval;
  127. /* Check array dimensions against the vt */
  128. retval = compatibleArrayDimensions(vt->arrayDimensionsSize, vt->arrayDimensions,
  129. node->arrayDimensionsSize, node->arrayDimensions);
  130. if(retval != UA_STATUSCODE_GOOD)
  131. return retval;
  132. /* Typecheck the value */
  133. if(value->hasValue) {
  134. retval = typeCheckValue(server, &node->dataType, node->valueRank,
  135. node->arrayDimensionsSize, node->arrayDimensions,
  136. &value->value, NULL, NULL);
  137. /* The type-check failed. Write the same value again. The write-service
  138. * tries to convert to the correct type... */
  139. if(retval != UA_STATUSCODE_GOOD) {
  140. UA_RCU_UNLOCK();
  141. retval = UA_Server_writeValue(server, node->nodeId, value->value);
  142. UA_RCU_LOCK();
  143. }
  144. }
  145. return retval;
  146. }
  147. /* Check the consistency of the variable (or variable type) attributes data
  148. * type, value rank, array dimensions internally and against the parent variable
  149. * type. */
  150. static UA_StatusCode
  151. typeCheckVariableNode(UA_Server *server, UA_Session *session,
  152. const UA_VariableNode *node,
  153. const UA_NodeId *typeDef) {
  154. /* Get the variable type */
  155. const UA_VariableTypeNode *vt =
  156. (const UA_VariableTypeNode*)UA_NodeStore_get(server->nodestore, typeDef);
  157. if(!vt || vt->nodeClass != UA_NODECLASS_VARIABLETYPE)
  158. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  159. if(node->nodeClass == UA_NODECLASS_VARIABLE && vt->isAbstract)
  160. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  161. /* We need the value for some checks. Might come from a datasource, so we perform a
  162. * regular read. */
  163. UA_DataValue value;
  164. UA_DataValue_init(&value);
  165. UA_StatusCode retval = readValueAttribute(server, node, &value);
  166. if(retval != UA_STATUSCODE_GOOD)
  167. return retval;
  168. /* Fix the variable: Set a sane valueRank if required (the most permissive -2) */
  169. if(node->valueRank == 0 &&
  170. (!value.hasValue || !value.value.type || UA_Variant_isScalar(&value.value))) {
  171. UA_LOG_INFO_SESSION(server->config.logger, session,
  172. "AddNodes: Use a default ValueRank of -2", NULL);
  173. UA_RCU_UNLOCK();
  174. retval = UA_Server_writeValueRank(server, node->nodeId, -2);
  175. UA_RCU_LOCK();
  176. if(retval != UA_STATUSCODE_GOOD) {
  177. UA_DataValue_deleteMembers(&value);
  178. return retval;
  179. }
  180. }
  181. /* If no value is set, see if the vt provides one and copy that. This needs
  182. * to be done before copying the datatype from the vt, as setting the datatype
  183. * triggers a typecheck. */
  184. if(!value.hasValue || !value.value.type) {
  185. retval = readValueAttribute(server, (const UA_VariableNode*)vt, &value);
  186. if(retval == UA_STATUSCODE_GOOD && value.hasValue && value.value.type) {
  187. UA_RCU_UNLOCK();
  188. retval = UA_Server_writeValue(server, node->nodeId, value.value);
  189. UA_RCU_LOCK();
  190. }
  191. if(retval != UA_STATUSCODE_GOOD) {
  192. UA_DataValue_deleteMembers(&value);
  193. return retval;
  194. }
  195. }
  196. /* Fix the variable: If no datatype is given, use the datatype of the vt */
  197. if(UA_NodeId_isNull(&node->dataType)) {
  198. UA_LOG_INFO_SESSION(server->config.logger, session, "AddNodes: "
  199. "Use a default DataType (from the TypeDefinition)", NULL);
  200. UA_RCU_UNLOCK();
  201. retval = UA_Server_writeDataType(server, node->nodeId, vt->dataType);
  202. UA_RCU_LOCK();
  203. if(retval != UA_STATUSCODE_GOOD) {
  204. UA_DataValue_deleteMembers(&value);
  205. return retval;
  206. }
  207. }
  208. #ifdef UA_ENABLE_MULTITHREADING
  209. /* Re-read the node to get the changes */
  210. node = (const UA_VariableNode*)UA_NodeStore_get(server->nodestore, &node->nodeId);
  211. #endif
  212. retval = typeCheckVariableNodeWithValue(server, session, node, vt, &value);
  213. UA_DataValue_deleteMembers(&value);
  214. return retval;
  215. }
  216. /********************/
  217. /* Instantiate Node */
  218. /********************/
  219. /* Returns an array with all subtype nodeids (including the root). Supertypes
  220. * need to have the same nodeClass as root and are (recursively) related with a
  221. * hasSubType reference. Since multi-inheritance is possible, we test for
  222. * duplicates and return evey nodeid at most once. */
  223. static UA_StatusCode
  224. getTypeHierarchy(UA_NodeStore *ns, const UA_Node *rootRef,
  225. UA_NodeId **typeHierarchy, size_t *typeHierarchySize) {
  226. size_t results_size = 20; // probably too big, but saves mallocs
  227. UA_NodeId *results = (UA_NodeId*)UA_malloc(sizeof(UA_NodeId) * results_size);
  228. if(!results)
  229. return UA_STATUSCODE_BADOUTOFMEMORY;
  230. UA_StatusCode retval = UA_NodeId_copy(&rootRef->nodeId, &results[0]);
  231. if(retval != UA_STATUSCODE_GOOD) {
  232. UA_free(results);
  233. return retval;
  234. }
  235. const UA_Node *node = rootRef;
  236. size_t idx = 0; /* Current index (contains NodeId of node) */
  237. size_t last = 0; /* Index of the last element in the array */
  238. const UA_NodeId hasSubtypeNodeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  239. while(true) {
  240. for(size_t i = 0; i < node->referencesSize; ++i) {
  241. UA_NodeReferenceKind *refs = &node->references[i];
  242. /* Are the references relevant? */
  243. if(!refs->isInverse)
  244. continue;
  245. if(!UA_NodeId_equal(&hasSubtypeNodeId, &refs->referenceTypeId))
  246. continue;
  247. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  248. UA_NodeId *targetId = &refs->targetIds[j].nodeId;
  249. /* Is the target already considered? (multi-inheritance) */
  250. UA_Boolean duplicate = false;
  251. for(size_t k = 0; k <= last; ++k) {
  252. if(UA_NodeId_equal(targetId, &results[k])) {
  253. duplicate = true;
  254. break;
  255. }
  256. }
  257. if(duplicate)
  258. continue;
  259. /* Increase array length if necessary */
  260. if(last + 1 >= results_size) {
  261. UA_NodeId *new_results =
  262. (UA_NodeId*)UA_realloc(results, sizeof(UA_NodeId) * results_size * 2);
  263. if(!new_results) {
  264. UA_Array_delete(results, last, &UA_TYPES[UA_TYPES_NODEID]);
  265. return UA_STATUSCODE_BADOUTOFMEMORY;
  266. }
  267. results = new_results;
  268. results_size *= 2;
  269. }
  270. /* Copy new nodeid to the end of the list */
  271. retval = UA_NodeId_copy(targetId, &results[++last]);
  272. if(retval != UA_STATUSCODE_GOOD) {
  273. UA_Array_delete(results, last, &UA_TYPES[UA_TYPES_NODEID]);
  274. return retval;
  275. }
  276. }
  277. }
  278. /* Get the next node */
  279. next:
  280. ++idx;
  281. if(idx > last || retval != UA_STATUSCODE_GOOD)
  282. break;
  283. node = UA_NodeStore_get(ns, &results[idx]);
  284. if(!node || node->nodeClass != rootRef->nodeClass)
  285. goto next;
  286. }
  287. *typeHierarchy = results;
  288. *typeHierarchySize = last + 1;
  289. return UA_STATUSCODE_GOOD;
  290. }
  291. static UA_StatusCode
  292. setObjectInstanceHandle(UA_Server *server, UA_Session *session, UA_ObjectNode* node,
  293. void * (*constructor)(const UA_NodeId instance)) {
  294. if(node->nodeClass != UA_NODECLASS_OBJECT)
  295. return UA_STATUSCODE_BADNODECLASSINVALID;
  296. if(!node->instanceHandle)
  297. node->instanceHandle = constructor(node->nodeId);
  298. return UA_STATUSCODE_GOOD;
  299. }
  300. /* Search for an instance of "browseName" in node searchInstance Used during
  301. * copyChildNodes to find overwritable/mergable nodes */
  302. static UA_StatusCode
  303. instanceFindAggregateByBrowsename(UA_Server *server, UA_Session *session,
  304. const UA_NodeId *searchInstance,
  305. const UA_QualifiedName *browseName,
  306. UA_NodeId *outInstanceNodeId) {
  307. UA_BrowseDescription bd;
  308. UA_BrowseDescription_init(&bd);
  309. bd.nodeId = *searchInstance;
  310. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  311. bd.includeSubtypes = true;
  312. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  313. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  314. bd.resultMask = UA_BROWSERESULTMASK_NODECLASS | UA_BROWSERESULTMASK_BROWSENAME;
  315. UA_BrowseResult br;
  316. UA_BrowseResult_init(&br);
  317. Service_Browse_single(server, session, NULL, &bd, 0, &br);
  318. if(br.statusCode != UA_STATUSCODE_GOOD)
  319. return br.statusCode;
  320. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  321. for(size_t i = 0; i < br.referencesSize; ++i) {
  322. UA_ReferenceDescription *rd = &br.references[i];
  323. if(rd->browseName.namespaceIndex == browseName->namespaceIndex &&
  324. UA_String_equal(&rd->browseName.name, &browseName->name)) {
  325. retval = UA_NodeId_copy(&rd->nodeId.nodeId, outInstanceNodeId);
  326. break;
  327. }
  328. }
  329. UA_BrowseResult_deleteMembers(&br);
  330. return retval;
  331. }
  332. static UA_Boolean
  333. isMandatoryChild(UA_Server *server, UA_Session *session, const UA_NodeId *childNodeId) {
  334. const UA_NodeId mandatoryId = UA_NODEID_NUMERIC(0, UA_NS0ID_MODELLINGRULE_MANDATORY);
  335. const UA_NodeId hasModellingRuleId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASMODELLINGRULE);
  336. /* Get the child */
  337. const UA_Node *child = UA_NodeStore_get(server->nodestore, childNodeId);
  338. if(!child)
  339. return false;
  340. /* Look for the reference making the child mandatory */
  341. for(size_t i = 0; i < child->referencesSize; ++i) {
  342. UA_NodeReferenceKind *refs = &child->references[i];
  343. if(!UA_NodeId_equal(&hasModellingRuleId, &refs->referenceTypeId))
  344. continue;
  345. if(refs->isInverse)
  346. continue;
  347. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  348. if(UA_NodeId_equal(&mandatoryId, &refs->targetIds[j].nodeId))
  349. return true;
  350. }
  351. }
  352. return false;
  353. }
  354. static UA_StatusCode
  355. copyChildNode(UA_Server *server, UA_Session *session,
  356. const UA_NodeId *destinationNodeId,
  357. const UA_ReferenceDescription *rd,
  358. UA_InstantiationCallback *instantiationCallback) {
  359. UA_NodeId existingChild = UA_NODEID_NULL;
  360. UA_StatusCode retval =
  361. instanceFindAggregateByBrowsename(server, session, destinationNodeId,
  362. &rd->browseName, &existingChild);
  363. if(retval != UA_STATUSCODE_GOOD)
  364. return retval;
  365. /* Have a child with that browseName. Try to deep-copy missing members. */
  366. if(!UA_NodeId_isNull(&existingChild)) {
  367. if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  368. rd->nodeClass == UA_NODECLASS_OBJECT)
  369. retval = copyChildNodes(server, session, &rd->nodeId.nodeId,
  370. &existingChild, instantiationCallback);
  371. UA_NodeId_deleteMembers(&existingChild);
  372. return retval;
  373. }
  374. /* Is the child mandatory? If not, skip */
  375. if(!isMandatoryChild(server, session, &rd->nodeId.nodeId))
  376. return UA_STATUSCODE_GOOD;
  377. /* No existing child with that browsename. Create it. */
  378. if(rd->nodeClass == UA_NODECLASS_METHOD) {
  379. /* Add a reference to the method in the objecttype */
  380. UA_AddReferencesItem newItem;
  381. UA_AddReferencesItem_init(&newItem);
  382. newItem.sourceNodeId = *destinationNodeId;
  383. newItem.referenceTypeId = rd->referenceTypeId;
  384. newItem.isForward = true;
  385. newItem.targetNodeId = rd->nodeId;
  386. newItem.targetNodeClass = UA_NODECLASS_METHOD;
  387. addReference(server, session, &newItem, &retval);
  388. } else if(rd->nodeClass == UA_NODECLASS_VARIABLE ||
  389. rd->nodeClass == UA_NODECLASS_OBJECT) {
  390. /* Copy the node */
  391. UA_Node *node = UA_NodeStore_getCopy(server->nodestore, &rd->nodeId.nodeId);
  392. if(!node)
  393. return UA_STATUSCODE_BADNODEIDINVALID;
  394. /* Get the type */
  395. UA_NodeId typeId;
  396. getNodeType(server, node, &typeId);
  397. /* Reset the NodeId (random numeric id will be assigned in the nodestore) */
  398. UA_NodeId_deleteMembers(&node->nodeId);
  399. node->nodeId.namespaceIndex = destinationNodeId->namespaceIndex;
  400. /* Remove references, they are re-created from scratch in addnode_finish */
  401. /* TODO: Be more clever in removing references that are re-added during
  402. * addnode_finish. That way, we can call addnode_finish also on children that were
  403. * manually added by the user during addnode_begin and addnode_finish. */
  404. UA_Node_deleteReferences(node);
  405. /* Add the node to the nodestore */
  406. retval = UA_NodeStore_insert(server->nodestore, node);
  407. /* Call addnode_finish, this recursively adds members, the type definition and so on */
  408. if(retval == UA_STATUSCODE_GOOD)
  409. retval = Service_AddNode_finish(server, session, &node->nodeId,
  410. destinationNodeId, &rd->referenceTypeId,
  411. &typeId, instantiationCallback);
  412. /* Clean up */
  413. UA_NodeId_deleteMembers(&typeId);
  414. }
  415. return retval;
  416. }
  417. /* Copy any children of Node sourceNodeId to another node destinationNodeId. */
  418. static UA_StatusCode
  419. copyChildNodes(UA_Server *server, UA_Session *session,
  420. const UA_NodeId *sourceNodeId, const UA_NodeId *destinationNodeId,
  421. UA_InstantiationCallback *instantiationCallback) {
  422. /* Browse to get all children of the source */
  423. UA_BrowseDescription bd;
  424. UA_BrowseDescription_init(&bd);
  425. bd.nodeId = *sourceNodeId;
  426. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_AGGREGATES);
  427. bd.includeSubtypes = true;
  428. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  429. bd.nodeClassMask = UA_NODECLASS_OBJECT | UA_NODECLASS_VARIABLE | UA_NODECLASS_METHOD;
  430. bd.resultMask = UA_BROWSERESULTMASK_REFERENCETYPEID | UA_BROWSERESULTMASK_NODECLASS |
  431. UA_BROWSERESULTMASK_BROWSENAME;
  432. UA_BrowseResult br;
  433. UA_BrowseResult_init(&br);
  434. Service_Browse_single(server, session, NULL, &bd, 0, &br);
  435. if(br.statusCode != UA_STATUSCODE_GOOD)
  436. return br.statusCode;
  437. /* Copy all children from source to destination */
  438. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  439. for(size_t i = 0; i < br.referencesSize; ++i) {
  440. UA_ReferenceDescription *rd = &br.references[i];
  441. retval |= copyChildNode(server, session, destinationNodeId,
  442. rd, instantiationCallback);
  443. }
  444. UA_BrowseResult_deleteMembers(&br);
  445. return retval;
  446. }
  447. static UA_StatusCode
  448. instantiateNode(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  449. UA_NodeClass nodeClass, const UA_NodeId *typeId,
  450. UA_InstantiationCallback *instantiationCallback) {
  451. /* Currently, only variables and objects are instantiated */
  452. if(nodeClass != UA_NODECLASS_VARIABLE &&
  453. nodeClass != UA_NODECLASS_OBJECT)
  454. return UA_STATUSCODE_GOOD;
  455. /* Get the type node */
  456. UA_ASSERT_RCU_LOCKED();
  457. const UA_Node *typenode = UA_NodeStore_get(server->nodestore, typeId);
  458. if(!typenode)
  459. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  460. /* See if the type has the correct node class */
  461. if(nodeClass == UA_NODECLASS_VARIABLE) {
  462. if(typenode->nodeClass != UA_NODECLASS_VARIABLETYPE ||
  463. ((const UA_VariableTypeNode*)typenode)->isAbstract)
  464. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  465. } else { /* nodeClass == UA_NODECLASS_OBJECT */
  466. if(typenode->nodeClass != UA_NODECLASS_OBJECTTYPE ||
  467. ((const UA_ObjectTypeNode*)typenode)->isAbstract)
  468. return UA_STATUSCODE_BADTYPEDEFINITIONINVALID;
  469. }
  470. /* Get the hierarchy of the type and all its supertypes */
  471. UA_NodeId *hierarchy = NULL;
  472. size_t hierarchySize = 0;
  473. UA_StatusCode retval = getTypeHierarchy(server->nodestore, typenode,
  474. &hierarchy, &hierarchySize);
  475. if(retval != UA_STATUSCODE_GOOD)
  476. return retval;
  477. /* Copy members of the type and supertypes */
  478. for(size_t i = 0; i < hierarchySize; ++i)
  479. retval |= copyChildNodes(server, session, &hierarchy[i],
  480. nodeId, instantiationCallback);
  481. UA_Array_delete(hierarchy, hierarchySize, &UA_TYPES[UA_TYPES_NODEID]);
  482. if(retval != UA_STATUSCODE_GOOD)
  483. return retval;
  484. /* Call the object constructor */
  485. if(typenode->nodeClass == UA_NODECLASS_OBJECTTYPE) {
  486. const UA_ObjectLifecycleManagement *olm =
  487. &((const UA_ObjectTypeNode*)typenode)->lifecycleManagement;
  488. if(olm->constructor) {
  489. UA_RCU_UNLOCK();
  490. UA_Server_editNode(server, session, nodeId,
  491. (UA_EditNodeCallback)setObjectInstanceHandle,
  492. (void*)(uintptr_t)olm->constructor);
  493. UA_RCU_LOCK();
  494. }
  495. }
  496. /* Add a hasType reference */
  497. UA_AddReferencesItem addref;
  498. UA_AddReferencesItem_init(&addref);
  499. addref.sourceNodeId = *nodeId;
  500. addref.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASTYPEDEFINITION);
  501. addref.isForward = true;
  502. addref.targetNodeId.nodeId = *typeId;
  503. addReference(server, session, &addref, &retval);
  504. /* Call custom callback */
  505. if(retval == UA_STATUSCODE_GOOD && instantiationCallback)
  506. instantiationCallback->method(*nodeId, *typeId, instantiationCallback->handle);
  507. return retval;
  508. }
  509. /***************************************/
  510. /* Set node from attribute description */
  511. /***************************************/
  512. static UA_StatusCode
  513. copyStandardAttributes(UA_Node *node, const UA_AddNodesItem *item,
  514. const UA_NodeAttributes *attr) {
  515. UA_StatusCode retval;
  516. retval = UA_NodeId_copy(&item->requestedNewNodeId.nodeId, &node->nodeId);
  517. retval |= UA_QualifiedName_copy(&item->browseName, &node->browseName);
  518. retval |= UA_LocalizedText_copy(&attr->displayName, &node->displayName);
  519. retval |= UA_LocalizedText_copy(&attr->description, &node->description);
  520. node->writeMask = attr->writeMask;
  521. return retval;
  522. }
  523. static UA_StatusCode
  524. copyCommonVariableAttributes(UA_VariableNode *node,
  525. const UA_VariableAttributes *attr) {
  526. /* Copy the array dimensions */
  527. UA_StatusCode retval =
  528. UA_Array_copy(attr->arrayDimensions, attr->arrayDimensionsSize,
  529. (void**)&node->arrayDimensions, &UA_TYPES[UA_TYPES_UINT32]);
  530. if(retval != UA_STATUSCODE_GOOD)
  531. return retval;
  532. node->arrayDimensionsSize = attr->arrayDimensionsSize;
  533. /* Data type and value rank */
  534. retval |= UA_NodeId_copy(&attr->dataType, &node->dataType);
  535. node->valueRank = attr->valueRank;
  536. /* Copy the value */
  537. node->valueSource = UA_VALUESOURCE_DATA;
  538. retval |= UA_Variant_copy(&attr->value, &node->value.data.value.value);
  539. node->value.data.value.hasValue = true;
  540. return retval;
  541. }
  542. static UA_StatusCode
  543. copyVariableNodeAttributes(UA_VariableNode *vnode,
  544. const UA_VariableAttributes *attr) {
  545. vnode->accessLevel = attr->accessLevel;
  546. vnode->historizing = attr->historizing;
  547. vnode->minimumSamplingInterval = attr->minimumSamplingInterval;
  548. return copyCommonVariableAttributes(vnode, attr);
  549. }
  550. static UA_StatusCode
  551. copyVariableTypeNodeAttributes(UA_VariableTypeNode *vtnode,
  552. const UA_VariableTypeAttributes *attr) {
  553. vtnode->isAbstract = attr->isAbstract;
  554. return copyCommonVariableAttributes((UA_VariableNode*)vtnode,
  555. (const UA_VariableAttributes*)attr);
  556. }
  557. static UA_StatusCode
  558. copyObjectNodeAttributes(UA_ObjectNode *onode, const UA_ObjectAttributes *attr) {
  559. onode->eventNotifier = attr->eventNotifier;
  560. return UA_STATUSCODE_GOOD;
  561. }
  562. static UA_StatusCode
  563. copyReferenceTypeNodeAttributes(UA_ReferenceTypeNode *rtnode,
  564. const UA_ReferenceTypeAttributes *attr) {
  565. rtnode->isAbstract = attr->isAbstract;
  566. rtnode->symmetric = attr->symmetric;
  567. return UA_LocalizedText_copy(&attr->inverseName, &rtnode->inverseName);
  568. }
  569. static UA_StatusCode
  570. copyObjectTypeNodeAttributes(UA_ObjectTypeNode *otnode,
  571. const UA_ObjectTypeAttributes *attr) {
  572. otnode->isAbstract = attr->isAbstract;
  573. return UA_STATUSCODE_GOOD;
  574. }
  575. static UA_StatusCode
  576. copyViewNodeAttributes(UA_ViewNode *vnode, const UA_ViewAttributes *attr) {
  577. vnode->containsNoLoops = attr->containsNoLoops;
  578. vnode->eventNotifier = attr->eventNotifier;
  579. return UA_STATUSCODE_GOOD;
  580. }
  581. static UA_StatusCode
  582. copyDataTypeNodeAttributes(UA_DataTypeNode *dtnode,
  583. const UA_DataTypeAttributes *attr) {
  584. dtnode->isAbstract = attr->isAbstract;
  585. return UA_STATUSCODE_GOOD;
  586. }
  587. #define CHECK_ATTRIBUTES(TYPE) \
  588. if(item->nodeAttributes.content.decoded.type != &UA_TYPES[UA_TYPES_##TYPE]) { \
  589. retval = UA_STATUSCODE_BADNODEATTRIBUTESINVALID; \
  590. break; \
  591. }
  592. /* Copy the attributes into a new node. On success, newNode points to the
  593. * created node */
  594. static UA_StatusCode
  595. createNodeFromAttributes(const UA_AddNodesItem *item, UA_Node **newNode) {
  596. /* Check that we can read the attributes */
  597. if(item->nodeAttributes.encoding < UA_EXTENSIONOBJECT_DECODED ||
  598. !item->nodeAttributes.content.decoded.type)
  599. return UA_STATUSCODE_BADNODEATTRIBUTESINVALID;
  600. /* Create the node */
  601. // todo: error case where the nodeclass is faulty should return a different
  602. // status code
  603. UA_Node *node = UA_NodeStore_newNode(item->nodeClass);
  604. if(!node)
  605. return UA_STATUSCODE_BADOUTOFMEMORY;
  606. /* Copy the attributes into the node */
  607. void *data = item->nodeAttributes.content.decoded.data;
  608. UA_StatusCode retval = copyStandardAttributes(node, item,
  609. (const UA_NodeAttributes*)data);
  610. switch(item->nodeClass) {
  611. case UA_NODECLASS_OBJECT:
  612. CHECK_ATTRIBUTES(OBJECTATTRIBUTES);
  613. retval |= copyObjectNodeAttributes((UA_ObjectNode*)node,
  614. (const UA_ObjectAttributes*)data);
  615. break;
  616. case UA_NODECLASS_VARIABLE:
  617. CHECK_ATTRIBUTES(VARIABLEATTRIBUTES);
  618. retval |= copyVariableNodeAttributes((UA_VariableNode*)node,
  619. (const UA_VariableAttributes*)data);
  620. break;
  621. case UA_NODECLASS_OBJECTTYPE:
  622. CHECK_ATTRIBUTES(OBJECTTYPEATTRIBUTES);
  623. retval |= copyObjectTypeNodeAttributes((UA_ObjectTypeNode*)node,
  624. (const UA_ObjectTypeAttributes*)data);
  625. break;
  626. case UA_NODECLASS_VARIABLETYPE:
  627. CHECK_ATTRIBUTES(VARIABLETYPEATTRIBUTES);
  628. retval |= copyVariableTypeNodeAttributes((UA_VariableTypeNode*)node,
  629. (const UA_VariableTypeAttributes*)data);
  630. break;
  631. case UA_NODECLASS_REFERENCETYPE:
  632. CHECK_ATTRIBUTES(REFERENCETYPEATTRIBUTES);
  633. retval |= copyReferenceTypeNodeAttributes((UA_ReferenceTypeNode*)node,
  634. (const UA_ReferenceTypeAttributes*)data);
  635. break;
  636. case UA_NODECLASS_DATATYPE:
  637. CHECK_ATTRIBUTES(DATATYPEATTRIBUTES);
  638. retval |= copyDataTypeNodeAttributes((UA_DataTypeNode*)node,
  639. (const UA_DataTypeAttributes*)data);
  640. break;
  641. case UA_NODECLASS_VIEW:
  642. CHECK_ATTRIBUTES(VIEWATTRIBUTES);
  643. retval |= copyViewNodeAttributes((UA_ViewNode*)node,
  644. (const UA_ViewAttributes*)data);
  645. break;
  646. case UA_NODECLASS_METHOD:
  647. case UA_NODECLASS_UNSPECIFIED:
  648. default:
  649. retval = UA_STATUSCODE_BADNODECLASSINVALID;
  650. }
  651. if(retval == UA_STATUSCODE_GOOD)
  652. *newNode = (UA_Node*)node;
  653. else
  654. UA_NodeStore_deleteNode(node);
  655. return retval;
  656. }
  657. /************/
  658. /* Add Node */
  659. /************/
  660. static void
  661. Service_AddNode_begin(UA_Server *server, UA_Session *session,
  662. const UA_AddNodesItem *item, UA_AddNodesResult *result) {
  663. /* Check the namespaceindex */
  664. if(item->requestedNewNodeId.nodeId.namespaceIndex >= server->namespacesSize) {
  665. UA_LOG_INFO_SESSION(server->config.logger, session,
  666. "AddNodes: Namespace invalid", NULL);
  667. result->statusCode = UA_STATUSCODE_BADNODEIDINVALID;
  668. return;
  669. }
  670. /* Add the node to the nodestore */
  671. UA_Node *node = NULL;
  672. result->statusCode = createNodeFromAttributes(item, &node);
  673. if(result->statusCode == UA_STATUSCODE_GOOD)
  674. result->statusCode = UA_NodeStore_insert(server->nodestore, node);
  675. if(result->statusCode != UA_STATUSCODE_GOOD) {
  676. UA_LOG_INFO_SESSION(server->config.logger, session,
  677. "AddNodes: Node could not be added to the "
  678. "nodestore with error code %s",
  679. UA_StatusCode_name(result->statusCode));
  680. return;
  681. }
  682. /* Copy the nodeid of the new node */
  683. result->statusCode = UA_NodeId_copy(&node->nodeId, &result->addedNodeId);
  684. if(result->statusCode != UA_STATUSCODE_GOOD) {
  685. UA_LOG_INFO_SESSION(server->config.logger, session,
  686. "AddNodes: Could not copy the nodeid", NULL);
  687. deleteNode(server, &adminSession, &node->nodeId, true);
  688. }
  689. }
  690. static UA_StatusCode
  691. Service_AddNode_finish(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  692. const UA_NodeId *parentNodeId, const UA_NodeId *referenceTypeId,
  693. const UA_NodeId *typeDefinition,
  694. UA_InstantiationCallback *instantiationCallback) {
  695. /* Get the node */
  696. const UA_Node *node = UA_NodeStore_get(server->nodestore, nodeId);
  697. if(!node)
  698. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  699. /* Use the typeDefinition as parent for type-nodes */
  700. const UA_NodeId hasSubtype = UA_NODEID_NUMERIC(0, UA_NS0ID_HASSUBTYPE);
  701. if(node->nodeClass == UA_NODECLASS_VARIABLETYPE ||
  702. node->nodeClass == UA_NODECLASS_OBJECTTYPE ||
  703. node->nodeClass == UA_NODECLASS_REFERENCETYPE ||
  704. node->nodeClass == UA_NODECLASS_DATATYPE) {
  705. referenceTypeId = &hasSubtype;
  706. typeDefinition = parentNodeId;
  707. }
  708. /* Workaround: Replace empty typeDefinition with the most permissive default */
  709. const UA_NodeId baseDataVariableType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATAVARIABLETYPE);
  710. const UA_NodeId baseObjectType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEOBJECTTYPE);
  711. if((node->nodeClass == UA_NODECLASS_VARIABLE || node->nodeClass == UA_NODECLASS_OBJECT) &&
  712. UA_NodeId_isNull(typeDefinition)) {
  713. UA_LOG_INFO_SESSION(server->config.logger, session, "AddNodes: Use a default "
  714. "TypeDefinition for the Variable/Object", NULL);
  715. if(node->nodeClass == UA_NODECLASS_VARIABLE)
  716. typeDefinition = &baseDataVariableType;
  717. else
  718. typeDefinition = &baseObjectType;
  719. }
  720. /* Check parent reference. Objects may have no parent. */
  721. UA_StatusCode retval = checkParentReference(server, session, node->nodeClass,
  722. parentNodeId, referenceTypeId);
  723. if(retval != UA_STATUSCODE_GOOD) {
  724. UA_LOG_INFO_SESSION(server->config.logger, session,
  725. "AddNodes: The parent reference is invalid", NULL);
  726. deleteNode(server, &adminSession, nodeId, true);
  727. return retval;
  728. }
  729. /* Instantiate node. We need the variable type for type checking (e.g. when
  730. * writing into attributes) */
  731. retval = instantiateNode(server, session, nodeId, node->nodeClass,
  732. typeDefinition, instantiationCallback);
  733. if(retval != UA_STATUSCODE_GOOD) {
  734. UA_LOG_INFO_SESSION(server->config.logger, session,
  735. "AddNodes: Node instantiation failed "
  736. "with code %s", UA_StatusCode_name(retval));
  737. deleteNode(server, &adminSession, nodeId, true);
  738. return retval;
  739. }
  740. if(node->nodeClass == UA_NODECLASS_VARIABLE ||
  741. node->nodeClass == UA_NODECLASS_VARIABLETYPE) {
  742. /* Type check node */
  743. retval = typeCheckVariableNode(server, session, (const UA_VariableNode*)node, typeDefinition);
  744. if(retval != UA_STATUSCODE_GOOD) {
  745. UA_LOG_INFO_SESSION(server->config.logger, session,
  746. "AddNodes: Type checking failed with error code %s",
  747. UA_StatusCode_name(retval));
  748. deleteNode(server, &adminSession, nodeId, true);
  749. return retval;
  750. }
  751. if(node->nodeClass == UA_NODECLASS_VARIABLE) {
  752. /* Set AccessLevel to readable */
  753. const UA_VariableNode *vn = (const UA_VariableNode*)node;
  754. if(!(vn->accessLevel & (UA_ACCESSLEVELMASK_READ))) {
  755. UA_LOG_INFO_SESSION(server->config.logger, session,
  756. "AddNodes: Set the AccessLevel to readable by default", NULL);
  757. UA_Byte readable = vn->accessLevel | (UA_ACCESSLEVELMASK_READ);
  758. UA_Server_writeAccessLevel(server, vn->nodeId, readable);
  759. }
  760. }
  761. }
  762. /* Add parent reference */
  763. if(!UA_NodeId_isNull(parentNodeId)) {
  764. UA_AddReferencesItem ref_item;
  765. UA_AddReferencesItem_init(&ref_item);
  766. ref_item.sourceNodeId = node->nodeId;
  767. ref_item.referenceTypeId = *referenceTypeId;
  768. ref_item.isForward = false;
  769. ref_item.targetNodeId.nodeId = *parentNodeId;
  770. addReference(server, session, &ref_item, &retval);
  771. if(retval != UA_STATUSCODE_GOOD) {
  772. UA_LOG_INFO_SESSION(server->config.logger, session,
  773. "AddNodes: Adding reference to parent failed", NULL);
  774. deleteNode(server, &adminSession, nodeId, true);
  775. return retval;
  776. }
  777. }
  778. return UA_STATUSCODE_GOOD;
  779. }
  780. static void
  781. Service_AddNodes_single(UA_Server *server, UA_Session *session,
  782. const UA_AddNodesItem *item, UA_AddNodesResult *result,
  783. UA_InstantiationCallback *instantiationCallback) {
  784. /* AddNodes_begin */
  785. Service_AddNode_begin(server, session, item, result);
  786. if(result->statusCode != UA_STATUSCODE_GOOD)
  787. return;
  788. /* AddNodes_finish */
  789. result->statusCode =
  790. Service_AddNode_finish(server, session, &result->addedNodeId,
  791. &item->parentNodeId.nodeId, &item->referenceTypeId,
  792. &item->typeDefinition.nodeId, instantiationCallback);
  793. /* If finishing failed, don't even return a NodeId of the added node */
  794. if(result->statusCode != UA_STATUSCODE_GOOD)
  795. UA_NodeId_deleteMembers(&result->addedNodeId);
  796. }
  797. void Service_AddNodes(UA_Server *server, UA_Session *session,
  798. const UA_AddNodesRequest *request,
  799. UA_AddNodesResponse *response) {
  800. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  801. "Processing AddNodesRequest", NULL);
  802. if(request->nodesToAddSize <= 0) {
  803. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  804. return;
  805. }
  806. size_t size = request->nodesToAddSize;
  807. response->results =
  808. (UA_AddNodesResult*)UA_Array_new(size, &UA_TYPES[UA_TYPES_ADDNODESRESULT]);
  809. if(!response->results) {
  810. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  811. return;
  812. }
  813. response->resultsSize = size;
  814. for(size_t i = 0; i < size; ++i) {
  815. Service_AddNodes_single(server, session, &request->nodesToAdd[i],
  816. &response->results[i], NULL);
  817. }
  818. }
  819. UA_StatusCode
  820. __UA_Server_addNode(UA_Server *server, const UA_NodeClass nodeClass,
  821. const UA_NodeId *requestedNewNodeId,
  822. const UA_NodeId *parentNodeId,
  823. const UA_NodeId *referenceTypeId,
  824. const UA_QualifiedName browseName,
  825. const UA_NodeId *typeDefinition,
  826. const UA_NodeAttributes *attr,
  827. const UA_DataType *attributeType,
  828. UA_InstantiationCallback *instantiationCallback,
  829. UA_NodeId *outNewNodeId) {
  830. /* Create the AddNodesItem */
  831. UA_AddNodesItem item;
  832. UA_AddNodesItem_init(&item);
  833. item.requestedNewNodeId.nodeId = *requestedNewNodeId;
  834. item.browseName = browseName;
  835. item.nodeClass = nodeClass;
  836. item.parentNodeId.nodeId = *parentNodeId;
  837. item.referenceTypeId = *referenceTypeId;
  838. item.typeDefinition.nodeId = *typeDefinition;
  839. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  840. item.nodeAttributes.content.decoded.type =attributeType;
  841. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  842. /* Call the normal addnodes service */
  843. UA_AddNodesResult result;
  844. UA_AddNodesResult_init(&result);
  845. UA_RCU_LOCK();
  846. Service_AddNodes_single(server, &adminSession, &item, &result, instantiationCallback);
  847. UA_RCU_UNLOCK();
  848. if(outNewNodeId)
  849. *outNewNodeId = result.addedNodeId;
  850. else
  851. UA_NodeId_deleteMembers(&result.addedNodeId);
  852. return result.statusCode;
  853. }
  854. UA_StatusCode
  855. __UA_Server_addNode_begin(UA_Server *server, const UA_NodeClass nodeClass,
  856. const UA_NodeId *requestedNewNodeId,
  857. const UA_QualifiedName *browseName,
  858. const UA_NodeAttributes *attr,
  859. const UA_DataType *attributeType,
  860. UA_NodeId *outNewNodeId) {
  861. /* Create the item */
  862. UA_AddNodesItem item;
  863. UA_AddNodesItem_init(&item);
  864. item.requestedNewNodeId.nodeId = *requestedNewNodeId;
  865. item.browseName = *browseName;
  866. item.nodeClass = nodeClass;
  867. item.nodeAttributes.encoding = UA_EXTENSIONOBJECT_DECODED_NODELETE;
  868. item.nodeAttributes.content.decoded.type = attributeType;
  869. item.nodeAttributes.content.decoded.data = (void*)(uintptr_t)attr;
  870. /* Add the node without checks or instantiation */
  871. UA_AddNodesResult result;
  872. UA_AddNodesResult_init(&result);
  873. UA_RCU_LOCK();
  874. Service_AddNode_begin(server, &adminSession, &item, &result);
  875. if(outNewNodeId)
  876. *outNewNodeId = result.addedNodeId;
  877. else
  878. UA_NodeId_deleteMembers(&result.addedNodeId);
  879. UA_RCU_UNLOCK();
  880. return result.statusCode;
  881. }
  882. UA_StatusCode
  883. UA_Server_addNode_finish(UA_Server *server, const UA_NodeId nodeId,
  884. const UA_NodeId parentNodeId,
  885. const UA_NodeId referenceTypeId,
  886. const UA_NodeId typeDefinition,
  887. UA_InstantiationCallback *instantiationCallback) {
  888. UA_RCU_LOCK();
  889. UA_StatusCode retval = Service_AddNode_finish(server, &adminSession, &nodeId, &parentNodeId,
  890. &referenceTypeId, &typeDefinition,
  891. instantiationCallback);
  892. UA_RCU_UNLOCK();
  893. return retval;
  894. }
  895. /**************************************************/
  896. /* Add Special Nodes (not possible over the wire) */
  897. /**************************************************/
  898. UA_StatusCode
  899. UA_Server_addDataSourceVariableNode(UA_Server *server,
  900. const UA_NodeId requestedNewNodeId,
  901. const UA_NodeId parentNodeId,
  902. const UA_NodeId referenceTypeId,
  903. const UA_QualifiedName browseName,
  904. const UA_NodeId typeDefinition,
  905. const UA_VariableAttributes attr,
  906. const UA_DataSource dataSource,
  907. UA_NodeId *outNewNodeId) {
  908. UA_NodeId newNodeId;
  909. UA_Boolean deleteNodeId = UA_FALSE;
  910. if(!outNewNodeId) {
  911. newNodeId = UA_NODEID_NULL;
  912. outNewNodeId = &newNodeId;
  913. deleteNodeId = UA_TRUE;
  914. }
  915. UA_StatusCode retval = UA_Server_addVariableNode_begin(server, requestedNewNodeId,
  916. browseName, attr, outNewNodeId);
  917. if(retval != UA_STATUSCODE_GOOD)
  918. return retval;
  919. retval = UA_Server_setVariableNode_dataSource(server, *outNewNodeId, dataSource);
  920. if(retval == UA_STATUSCODE_GOOD)
  921. retval = UA_Server_addNode_finish(server, *outNewNodeId,
  922. parentNodeId, referenceTypeId,
  923. typeDefinition, NULL);
  924. if(retval != UA_STATUSCODE_GOOD || deleteNodeId)
  925. UA_NodeId_deleteMembers(outNewNodeId);
  926. return UA_STATUSCODE_GOOD;
  927. }
  928. #ifdef UA_ENABLE_METHODCALLS
  929. UA_StatusCode
  930. UA_Server_addMethodNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  931. const UA_QualifiedName browseName,
  932. const UA_MethodAttributes attr,
  933. UA_MethodCallback method, void *handle,
  934. UA_NodeId *outNewNodeId) {
  935. /* Create the node */
  936. UA_MethodNode *node = (UA_MethodNode*)UA_NodeStore_newNode(UA_NODECLASS_METHOD);
  937. if(!node)
  938. return UA_STATUSCODE_BADOUTOFMEMORY;
  939. /* Set the node attributes */
  940. node->executable = attr.executable;
  941. node->attachedMethod = method;
  942. node->methodHandle = handle;
  943. UA_AddNodesItem item;
  944. UA_AddNodesItem_init(&item);
  945. item.requestedNewNodeId.nodeId = requestedNewNodeId;
  946. item.browseName = browseName;
  947. UA_StatusCode retval =
  948. copyStandardAttributes((UA_Node*)node, &item, (const UA_NodeAttributes*)&attr);
  949. if(retval != UA_STATUSCODE_GOOD) {
  950. UA_NodeStore_deleteNode((UA_Node*)node);
  951. return retval;
  952. }
  953. /* Add the node to the nodestore */
  954. UA_RCU_LOCK();
  955. retval = UA_NodeStore_insert(server->nodestore, (UA_Node*)node);
  956. if(outNewNodeId) {
  957. retval = UA_NodeId_copy(&node->nodeId, outNewNodeId);
  958. if(retval != UA_STATUSCODE_GOOD)
  959. UA_NodeStore_remove(server->nodestore, &node->nodeId);
  960. }
  961. UA_RCU_UNLOCK();
  962. return retval;
  963. }
  964. UA_StatusCode
  965. UA_Server_addMethodNode_finish(UA_Server *server, const UA_NodeId nodeId,
  966. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  967. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  968. size_t outputArgumentsSize, const UA_Argument* outputArguments) {
  969. const UA_NodeId hasproperty = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  970. const UA_NodeId propertytype = UA_NODEID_NUMERIC(0, UA_NS0ID_PROPERTYTYPE);
  971. const UA_NodeId argsId = UA_NODEID_NUMERIC(nodeId.namespaceIndex, 0);
  972. /* Browse to see which argument nodes exist */
  973. UA_BrowseDescription bd;
  974. UA_BrowseDescription_init(&bd);
  975. bd.nodeId = nodeId;
  976. bd.referenceTypeId = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  977. bd.includeSubtypes = false;
  978. bd.browseDirection = UA_BROWSEDIRECTION_FORWARD;
  979. bd.nodeClassMask = UA_NODECLASS_VARIABLE;
  980. bd.resultMask = UA_BROWSERESULTMASK_BROWSENAME;
  981. UA_BrowseResult br;
  982. UA_BrowseResult_init(&br);
  983. UA_RCU_LOCK();
  984. Service_Browse_single(server, &adminSession, NULL, &bd, 0, &br);
  985. UA_RCU_UNLOCK();
  986. UA_StatusCode retval = br.statusCode;
  987. if(retval != UA_STATUSCODE_GOOD) {
  988. UA_RCU_LOCK();
  989. deleteNode(server, &adminSession, &nodeId, true);
  990. UA_RCU_UNLOCK();
  991. UA_BrowseResult_deleteMembers(&br);
  992. return retval;
  993. }
  994. /* Filter out the argument nodes */
  995. UA_NodeId inputArgsId = UA_NODEID_NULL;
  996. UA_NodeId outputArgsId = UA_NODEID_NULL;
  997. const UA_QualifiedName inputArgsName = UA_QUALIFIEDNAME(0, "InputArguments");
  998. const UA_QualifiedName outputArgsName = UA_QUALIFIEDNAME(0, "OutputArguments");
  999. for(size_t i = 0; i < br.referencesSize; i++) {
  1000. UA_ReferenceDescription *rd = &br.references[i];
  1001. if(rd->browseName.namespaceIndex == 0 &&
  1002. UA_String_equal(&rd->browseName.name, &inputArgsName.name))
  1003. inputArgsId = rd->nodeId.nodeId;
  1004. else if(rd->browseName.namespaceIndex == 0 &&
  1005. UA_String_equal(&rd->browseName.name, &outputArgsName.name))
  1006. outputArgsId = rd->nodeId.nodeId;
  1007. }
  1008. /* Add the Input Arguments VariableNode */
  1009. if(inputArgumentsSize > 0 && UA_NodeId_isNull(&inputArgsId)) {
  1010. UA_VariableAttributes inputargs;
  1011. UA_VariableAttributes_init(&inputargs);
  1012. inputargs.displayName = UA_LOCALIZEDTEXT("en_US", "InputArguments");
  1013. /* UAExpert creates a monitoreditem on inputarguments ... */
  1014. inputargs.minimumSamplingInterval = 100000.0f;
  1015. inputargs.valueRank = 1;
  1016. inputargs.dataType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATATYPE);
  1017. /* dirty-cast, but is treated as const ... */
  1018. UA_Variant_setArray(&inputargs.value, (void*)(uintptr_t)inputArguments,
  1019. inputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1020. retval = UA_Server_addVariableNode(server, argsId, nodeId, hasproperty,
  1021. inputArgsName, propertytype, inputargs,
  1022. NULL, &inputArgsId);
  1023. }
  1024. /* Add the Output Arguments VariableNode */
  1025. if(outputArgumentsSize > 0 && UA_NodeId_isNull(&outputArgsId)) {
  1026. UA_VariableAttributes outputargs;
  1027. UA_VariableAttributes_init(&outputargs);
  1028. outputargs.displayName = UA_LOCALIZEDTEXT("en_US", "OutputArguments");
  1029. /* UAExpert creates a monitoreditem on outputarguments ... */
  1030. outputargs.minimumSamplingInterval = 100000.0f;
  1031. outputargs.valueRank = 1;
  1032. outputargs.dataType = UA_NODEID_NUMERIC(0, UA_NS0ID_BASEDATATYPE);
  1033. /* dirty-cast, but is treated as const ... */
  1034. UA_Variant_setArray(&outputargs.value, (void*)(uintptr_t)outputArguments,
  1035. outputArgumentsSize, &UA_TYPES[UA_TYPES_ARGUMENT]);
  1036. retval |= UA_Server_addVariableNode(server, argsId, nodeId, hasproperty,
  1037. outputArgsName, propertytype, outputargs,
  1038. NULL, &outputArgsId);
  1039. }
  1040. /* Call finish to add the parent reference */
  1041. UA_RCU_LOCK();
  1042. retval |= Service_AddNode_finish(server, &adminSession, &nodeId, &parentNodeId,
  1043. &referenceTypeId, &UA_NODEID_NULL, NULL);
  1044. UA_RCU_UNLOCK();
  1045. if(retval != UA_STATUSCODE_GOOD) {
  1046. deleteNode(server, &adminSession, &nodeId, true);
  1047. deleteNode(server, &adminSession, &inputArgsId, true);
  1048. deleteNode(server, &adminSession, &outputArgsId, true);
  1049. }
  1050. UA_BrowseResult_deleteMembers(&br);
  1051. return retval;
  1052. }
  1053. UA_StatusCode
  1054. UA_Server_addMethodNode(UA_Server *server, const UA_NodeId requestedNewNodeId,
  1055. const UA_NodeId parentNodeId, const UA_NodeId referenceTypeId,
  1056. const UA_QualifiedName browseName, const UA_MethodAttributes attr,
  1057. UA_MethodCallback method, void *handle,
  1058. size_t inputArgumentsSize, const UA_Argument* inputArguments,
  1059. size_t outputArgumentsSize, const UA_Argument* outputArguments,
  1060. UA_NodeId *outNewNodeId) {
  1061. UA_NodeId newId;
  1062. if(!outNewNodeId) {
  1063. UA_NodeId_init(&newId);
  1064. outNewNodeId = &newId;
  1065. }
  1066. /* Call begin */
  1067. UA_StatusCode retval =
  1068. UA_Server_addMethodNode_begin(server, requestedNewNodeId, browseName,
  1069. attr, method, handle, outNewNodeId);
  1070. if(retval != UA_STATUSCODE_GOOD)
  1071. return retval;
  1072. /* Call finish */
  1073. retval = UA_Server_addMethodNode_finish(server, *outNewNodeId,
  1074. parentNodeId, referenceTypeId,
  1075. inputArgumentsSize, inputArguments,
  1076. outputArgumentsSize, outputArguments);
  1077. if(outNewNodeId == &newId)
  1078. UA_NodeId_deleteMembers(&newId);
  1079. return retval;
  1080. }
  1081. #endif
  1082. /******************/
  1083. /* Add References */
  1084. /******************/
  1085. static UA_StatusCode
  1086. addOneWayTarget(UA_NodeReferenceKind *refs, const UA_ExpandedNodeId *target) {
  1087. UA_ExpandedNodeId *targets =
  1088. (UA_ExpandedNodeId*) UA_realloc(refs->targetIds,
  1089. sizeof(UA_ExpandedNodeId) * (refs->targetIdsSize+1));
  1090. if(!targets)
  1091. return UA_STATUSCODE_BADOUTOFMEMORY;
  1092. refs->targetIds = targets;
  1093. UA_StatusCode retval = UA_ExpandedNodeId_copy(target, &refs->targetIds[refs->targetIdsSize]);
  1094. if(retval != UA_STATUSCODE_GOOD && refs->targetIds == 0) {
  1095. UA_free(refs->targetIds);
  1096. refs->targetIds = NULL;
  1097. return retval;
  1098. }
  1099. refs->targetIdsSize++;
  1100. return retval;
  1101. }
  1102. static UA_StatusCode
  1103. addOneWayNodeReferences(UA_Node *node, const UA_AddReferencesItem *item) {
  1104. UA_NodeReferenceKind *refs =
  1105. (UA_NodeReferenceKind*)UA_realloc(node->references,
  1106. sizeof(UA_NodeReferenceKind) * (node->referencesSize+1));
  1107. if(!refs)
  1108. return UA_STATUSCODE_BADOUTOFMEMORY;
  1109. node->references = refs;
  1110. UA_NodeReferenceKind *newRef = &refs[node->referencesSize];
  1111. memset(newRef, 0, sizeof(UA_NodeReferenceKind));
  1112. newRef->isInverse = !item->isForward;
  1113. UA_StatusCode retval = UA_NodeId_copy(&item->referenceTypeId, &newRef->referenceTypeId);
  1114. retval |= addOneWayTarget(newRef, &item->targetNodeId);
  1115. if(retval == UA_STATUSCODE_GOOD) {
  1116. node->referencesSize++;
  1117. } else {
  1118. UA_NodeId_deleteMembers(&newRef->referenceTypeId);
  1119. if(node->referencesSize == 0) {
  1120. UA_free(node->references);
  1121. node->references = NULL;
  1122. }
  1123. }
  1124. return retval;
  1125. }
  1126. /* Adds a one-way reference to the local nodestore */
  1127. static UA_StatusCode
  1128. addOneWayReference(UA_Server *server, UA_Session *session,
  1129. UA_Node *node, const UA_AddReferencesItem *item) {
  1130. for(size_t i = 0; i < node->referencesSize; ++i) {
  1131. UA_NodeReferenceKind *refs = &node->references[i];
  1132. if(refs->isInverse == item->isForward)
  1133. continue;
  1134. if(!UA_NodeId_equal(&refs->referenceTypeId, &item->referenceTypeId))
  1135. continue;
  1136. return addOneWayTarget(refs, &item->targetNodeId);
  1137. }
  1138. return addOneWayNodeReferences(node, item);
  1139. }
  1140. static void
  1141. addReference(UA_Server *server, UA_Session *session,
  1142. const UA_AddReferencesItem *item,
  1143. UA_StatusCode *retval) {
  1144. /* Currently no expandednodeids are allowed */
  1145. if(item->targetServerUri.length > 0) {
  1146. *retval = UA_STATUSCODE_BADNOTIMPLEMENTED;
  1147. return;
  1148. }
  1149. /* Add the first direction */
  1150. UA_RCU_UNLOCK();
  1151. *retval =
  1152. UA_Server_editNode(server, session, &item->sourceNodeId,
  1153. (UA_EditNodeCallback)addOneWayReference, item);
  1154. UA_RCU_LOCK();
  1155. if(*retval != UA_STATUSCODE_GOOD)
  1156. return;
  1157. /* Add the second direction */
  1158. UA_AddReferencesItem secondItem;
  1159. UA_AddReferencesItem_init(&secondItem);
  1160. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1161. secondItem.referenceTypeId = item->referenceTypeId;
  1162. secondItem.isForward = !item->isForward;
  1163. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1164. /* keep default secondItem.targetNodeClass = UA_NODECLASS_UNSPECIFIED */
  1165. UA_RCU_UNLOCK();
  1166. *retval =
  1167. UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1168. (UA_EditNodeCallback)addOneWayReference, &secondItem);
  1169. UA_RCU_LOCK();
  1170. /* remove reference if the second direction failed */
  1171. if(*retval != UA_STATUSCODE_GOOD) {
  1172. UA_DeleteReferencesItem deleteItem;
  1173. deleteItem.sourceNodeId = item->sourceNodeId;
  1174. deleteItem.referenceTypeId = item->referenceTypeId;
  1175. deleteItem.isForward = item->isForward;
  1176. deleteItem.targetNodeId = item->targetNodeId;
  1177. deleteItem.deleteBidirectional = false;
  1178. /* ignore returned status code */
  1179. UA_RCU_UNLOCK();
  1180. UA_Server_editNode(server, session, &item->sourceNodeId,
  1181. (UA_EditNodeCallback)deleteOneWayReference, &deleteItem);
  1182. UA_RCU_LOCK();
  1183. }
  1184. }
  1185. void Service_AddReferences(UA_Server *server, UA_Session *session,
  1186. const UA_AddReferencesRequest *request,
  1187. UA_AddReferencesResponse *response) {
  1188. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1189. "Processing AddReferencesRequest", NULL);
  1190. response->responseHeader.serviceResult =
  1191. UA_Server_processServiceOperations(server, session,
  1192. (UA_ServiceOperation) addReference,
  1193. &request->referencesToAddSize,
  1194. &UA_TYPES[UA_TYPES_ADDREFERENCESITEM],
  1195. &response->resultsSize,
  1196. &UA_TYPES[UA_TYPES_STATUSCODE]);
  1197. }
  1198. UA_StatusCode
  1199. UA_Server_addReference(UA_Server *server, const UA_NodeId sourceId,
  1200. const UA_NodeId refTypeId,
  1201. const UA_ExpandedNodeId targetId,
  1202. UA_Boolean isForward) {
  1203. UA_AddReferencesItem item;
  1204. UA_AddReferencesItem_init(&item);
  1205. item.sourceNodeId = sourceId;
  1206. item.referenceTypeId = refTypeId;
  1207. item.isForward = isForward;
  1208. item.targetNodeId = targetId;
  1209. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1210. UA_RCU_LOCK();
  1211. addReference(server, &adminSession, &item, &retval);
  1212. UA_RCU_UNLOCK();
  1213. return retval;
  1214. }
  1215. /****************/
  1216. /* Delete Nodes */
  1217. /****************/
  1218. static void
  1219. removeReferences(UA_Server *server, UA_Session *session,
  1220. const UA_Node *node) {
  1221. UA_DeleteReferencesItem item;
  1222. UA_DeleteReferencesItem_init(&item);
  1223. item.targetNodeId.nodeId = node->nodeId;
  1224. UA_StatusCode dummy;
  1225. for(size_t i = 0; i < node->referencesSize; ++i) {
  1226. UA_NodeReferenceKind *refs = &node->references[i];
  1227. item.isForward = refs->isInverse;
  1228. item.referenceTypeId = refs->referenceTypeId;
  1229. for(size_t j = 0; j < refs->targetIdsSize; ++j) {
  1230. item.sourceNodeId = refs->targetIds[j].nodeId;
  1231. deleteReference(server, session, &item, &dummy);
  1232. }
  1233. }
  1234. }
  1235. static UA_StatusCode
  1236. deleteNode(UA_Server *server, UA_Session *session,
  1237. const UA_NodeId *nodeId, UA_Boolean deleteReferences) {
  1238. UA_RCU_LOCK();
  1239. const UA_Node *node = UA_NodeStore_get(server->nodestore, nodeId);
  1240. UA_RCU_UNLOCK();
  1241. if(!node)
  1242. return UA_STATUSCODE_BADNODEIDUNKNOWN;
  1243. /* TODO: check if the information model consistency is violated */
  1244. /* TODO: Check if the node is a mandatory child of an object */
  1245. /* Destroy an object before removing it */
  1246. if(node->nodeClass == UA_NODECLASS_OBJECT) {
  1247. /* Call the destructor from the object type */
  1248. UA_RCU_LOCK();
  1249. const UA_ObjectTypeNode *typenode =
  1250. getObjectNodeType(server, (const UA_ObjectNode*)node);
  1251. UA_RCU_UNLOCK();
  1252. if(typenode && typenode->lifecycleManagement.destructor) {
  1253. const UA_ObjectNode *on = (const UA_ObjectNode*)node;
  1254. typenode->lifecycleManagement.destructor(*nodeId, on->instanceHandle);
  1255. }
  1256. }
  1257. /* Remove references to the node (not the references in the node that will
  1258. * be deleted anyway) */
  1259. if(deleteReferences)
  1260. removeReferences(server, session, node);
  1261. UA_RCU_LOCK();
  1262. UA_StatusCode retval = UA_NodeStore_remove(server->nodestore, nodeId);
  1263. UA_RCU_UNLOCK();
  1264. return retval;
  1265. }
  1266. void Service_DeleteNodes(UA_Server *server, UA_Session *session,
  1267. const UA_DeleteNodesRequest *request,
  1268. UA_DeleteNodesResponse *response) {
  1269. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1270. "Processing DeleteNodesRequest", NULL);
  1271. if(request->nodesToDeleteSize == 0) {
  1272. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  1273. return;
  1274. }
  1275. response->results =
  1276. (UA_StatusCode*)UA_malloc(sizeof(UA_StatusCode) * request->nodesToDeleteSize);
  1277. if(!response->results) {
  1278. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;;
  1279. return;
  1280. }
  1281. response->resultsSize = request->nodesToDeleteSize;
  1282. for(size_t i = 0; i < request->nodesToDeleteSize; ++i) {
  1283. UA_DeleteNodesItem *item = &request->nodesToDelete[i];
  1284. response->results[i] = deleteNode(server, session, &item->nodeId,
  1285. item->deleteTargetReferences);
  1286. }
  1287. }
  1288. UA_StatusCode
  1289. UA_Server_deleteNode(UA_Server *server, const UA_NodeId nodeId,
  1290. UA_Boolean deleteReferences) {
  1291. UA_StatusCode retval = deleteNode(server, &adminSession,
  1292. &nodeId, deleteReferences);
  1293. return retval;
  1294. }
  1295. /*********************/
  1296. /* Delete References */
  1297. /*********************/
  1298. // TODO: Check consistency constraints, remove the references.
  1299. static UA_StatusCode
  1300. deleteOneWayReference(UA_Server *server, UA_Session *session, UA_Node *node,
  1301. const UA_DeleteReferencesItem *item) {
  1302. for(size_t i = node->referencesSize; i > 0; --i) {
  1303. UA_NodeReferenceKind *refs = &node->references[i-1];
  1304. if(item->isForward == refs->isInverse)
  1305. continue;
  1306. if(!UA_NodeId_equal(&item->referenceTypeId, &refs->referenceTypeId))
  1307. continue;
  1308. for(size_t j = refs->targetIdsSize; j > 0; --j) {
  1309. if(!UA_NodeId_equal(&item->targetNodeId.nodeId, &refs->targetIds[j-1].nodeId))
  1310. continue;
  1311. /* Ok, delete the reference */
  1312. UA_ExpandedNodeId_deleteMembers(&refs->targetIds[j-1]);
  1313. refs->targetIdsSize--;
  1314. /* One matching target remaining */
  1315. if(refs->targetIdsSize > 0) {
  1316. if(j-1 != refs->targetIdsSize) // avoid valgrind error: Source
  1317. // and destination overlap in
  1318. // memcpy
  1319. refs->targetIds[j-1] = refs->targetIds[refs->targetIdsSize];
  1320. return UA_STATUSCODE_GOOD;
  1321. }
  1322. /* Remove refs */
  1323. UA_free(refs->targetIds);
  1324. UA_NodeId_deleteMembers(&refs->referenceTypeId);
  1325. node->referencesSize--;
  1326. if(node->referencesSize > 0) {
  1327. if(i-1 != node->referencesSize) // avoid valgrind error: Source
  1328. // and destination overlap in
  1329. // memcpy
  1330. node->references[i-1] = node->references[node->referencesSize];
  1331. return UA_STATUSCODE_GOOD;
  1332. }
  1333. /* Remove the node references */
  1334. UA_free(node->references);
  1335. node->references = NULL;
  1336. return UA_STATUSCODE_GOOD;
  1337. }
  1338. }
  1339. return UA_STATUSCODE_UNCERTAINREFERENCENOTDELETED;
  1340. }
  1341. static void
  1342. deleteReference(UA_Server *server, UA_Session *session,
  1343. const UA_DeleteReferencesItem *item,
  1344. UA_StatusCode *retval) {
  1345. *retval = UA_Server_editNode(server, session, &item->sourceNodeId,
  1346. (UA_EditNodeCallback)deleteOneWayReference, item);
  1347. if(*retval != UA_STATUSCODE_GOOD)
  1348. return;
  1349. if(!item->deleteBidirectional || item->targetNodeId.serverIndex != 0)
  1350. return;
  1351. UA_DeleteReferencesItem secondItem;
  1352. UA_DeleteReferencesItem_init(&secondItem);
  1353. secondItem.isForward = !item->isForward;
  1354. secondItem.sourceNodeId = item->targetNodeId.nodeId;
  1355. secondItem.targetNodeId.nodeId = item->sourceNodeId;
  1356. secondItem.referenceTypeId = item->referenceTypeId;
  1357. *retval = UA_Server_editNode(server, session, &secondItem.sourceNodeId,
  1358. (UA_EditNodeCallback)deleteOneWayReference,
  1359. &secondItem);
  1360. }
  1361. void
  1362. Service_DeleteReferences(UA_Server *server, UA_Session *session,
  1363. const UA_DeleteReferencesRequest *request,
  1364. UA_DeleteReferencesResponse *response) {
  1365. UA_LOG_DEBUG_SESSION(server->config.logger, session,
  1366. "Processing DeleteReferencesRequest", NULL);
  1367. response->responseHeader.serviceResult =
  1368. UA_Server_processServiceOperations(server, session,
  1369. (UA_ServiceOperation)deleteReference,
  1370. &request->referencesToDeleteSize,
  1371. &UA_TYPES[UA_TYPES_DELETEREFERENCESITEM],
  1372. &response->resultsSize,
  1373. &UA_TYPES[UA_TYPES_STATUSCODE]);
  1374. }
  1375. UA_StatusCode
  1376. UA_Server_deleteReference(UA_Server *server, const UA_NodeId sourceNodeId,
  1377. const UA_NodeId referenceTypeId, UA_Boolean isForward,
  1378. const UA_ExpandedNodeId targetNodeId,
  1379. UA_Boolean deleteBidirectional) {
  1380. UA_DeleteReferencesItem item;
  1381. item.sourceNodeId = sourceNodeId;
  1382. item.referenceTypeId = referenceTypeId;
  1383. item.isForward = isForward;
  1384. item.targetNodeId = targetNodeId;
  1385. item.deleteBidirectional = deleteBidirectional;
  1386. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1387. UA_RCU_LOCK();
  1388. deleteReference(server, &adminSession, &item, &retval);
  1389. UA_RCU_UNLOCK();
  1390. return retval;
  1391. }
  1392. /**********************/
  1393. /* Set Value Callback */
  1394. /**********************/
  1395. static UA_StatusCode
  1396. setValueCallback(UA_Server *server, UA_Session *session,
  1397. UA_VariableNode *node, UA_ValueCallback *callback) {
  1398. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1399. return UA_STATUSCODE_BADNODECLASSINVALID;
  1400. node->value.data.callback = *callback;
  1401. return UA_STATUSCODE_GOOD;
  1402. }
  1403. UA_StatusCode
  1404. UA_Server_setVariableNode_valueCallback(UA_Server *server, const UA_NodeId nodeId,
  1405. const UA_ValueCallback callback) {
  1406. UA_RCU_LOCK();
  1407. UA_StatusCode retval =
  1408. UA_Server_editNode(server, &adminSession, &nodeId,
  1409. (UA_EditNodeCallback)setValueCallback, &callback);
  1410. UA_RCU_UNLOCK();
  1411. return retval;
  1412. }
  1413. /******************/
  1414. /* Set DataSource */
  1415. /******************/
  1416. static UA_StatusCode
  1417. setDataSource(UA_Server *server, UA_Session *session,
  1418. UA_VariableNode* node, UA_DataSource *dataSource) {
  1419. if(node->nodeClass != UA_NODECLASS_VARIABLE)
  1420. return UA_STATUSCODE_BADNODECLASSINVALID;
  1421. if(node->valueSource == UA_VALUESOURCE_DATA)
  1422. UA_DataValue_deleteMembers(&node->value.data.value);
  1423. node->value.dataSource = *dataSource;
  1424. node->valueSource = UA_VALUESOURCE_DATASOURCE;
  1425. return UA_STATUSCODE_GOOD;
  1426. }
  1427. UA_StatusCode
  1428. UA_Server_setVariableNode_dataSource(UA_Server *server, const UA_NodeId nodeId,
  1429. const UA_DataSource dataSource) {
  1430. UA_StatusCode retval = UA_Server_editNode(server, &adminSession, &nodeId,
  1431. (UA_EditNodeCallback)setDataSource,
  1432. &dataSource);
  1433. return retval;
  1434. }
  1435. /****************************/
  1436. /* Set Lifecycle Management */
  1437. /****************************/
  1438. static UA_StatusCode
  1439. setOLM(UA_Server *server, UA_Session *session,
  1440. UA_ObjectTypeNode* node, UA_ObjectLifecycleManagement *olm) {
  1441. if(node->nodeClass != UA_NODECLASS_OBJECTTYPE)
  1442. return UA_STATUSCODE_BADNODECLASSINVALID;
  1443. node->lifecycleManagement = *olm;
  1444. return UA_STATUSCODE_GOOD;
  1445. }
  1446. UA_StatusCode
  1447. UA_Server_setObjectTypeNode_lifecycleManagement(UA_Server *server, UA_NodeId nodeId,
  1448. UA_ObjectLifecycleManagement olm) {
  1449. UA_StatusCode retval = UA_Server_editNode(server, &adminSession, &nodeId,
  1450. (UA_EditNodeCallback)setOLM, &olm);
  1451. return retval;
  1452. }
  1453. /***********************/
  1454. /* Set Method Callback */
  1455. /***********************/
  1456. #ifdef UA_ENABLE_METHODCALLS
  1457. typedef struct {
  1458. UA_MethodCallback callback;
  1459. void *handle;
  1460. } addMethodCallback;
  1461. static UA_StatusCode
  1462. editMethodCallback(UA_Server *server, UA_Session* session,
  1463. UA_Node* node, const void* handle) {
  1464. if(node->nodeClass != UA_NODECLASS_METHOD)
  1465. return UA_STATUSCODE_BADNODECLASSINVALID;
  1466. const addMethodCallback *newCallback = (const addMethodCallback *)handle;
  1467. UA_MethodNode *mnode = (UA_MethodNode*) node;
  1468. mnode->attachedMethod = newCallback->callback;
  1469. mnode->methodHandle = newCallback->handle;
  1470. return UA_STATUSCODE_GOOD;
  1471. }
  1472. UA_StatusCode
  1473. UA_Server_setMethodNode_callback(UA_Server *server, const UA_NodeId methodNodeId,
  1474. UA_MethodCallback method, void *handle) {
  1475. addMethodCallback cb;
  1476. cb.callback = method;
  1477. cb.handle = handle;
  1478. UA_RCU_LOCK();
  1479. UA_StatusCode retval =
  1480. UA_Server_editNode(server, &adminSession,
  1481. &methodNodeId, editMethodCallback, &cb);
  1482. UA_RCU_UNLOCK();
  1483. return retval;
  1484. }
  1485. #endif