ua_services_nodemanagement.c 67 KB

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