ua_services_view.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629
  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. static UA_StatusCode
  7. fillReferenceDescription(UA_NodeStore *ns, const UA_Node *curr, UA_ReferenceNode *ref,
  8. UA_UInt32 mask, UA_ReferenceDescription *descr) {
  9. UA_ReferenceDescription_init(descr);
  10. UA_StatusCode retval = UA_NodeId_copy(&curr->nodeId, &descr->nodeId.nodeId);
  11. if(mask & UA_BROWSERESULTMASK_REFERENCETYPEID)
  12. retval |= UA_NodeId_copy(&ref->referenceTypeId, &descr->referenceTypeId);
  13. if(mask & UA_BROWSERESULTMASK_ISFORWARD)
  14. descr->isForward = !ref->isInverse;
  15. if(mask & UA_BROWSERESULTMASK_NODECLASS)
  16. retval |= UA_NodeClass_copy(&curr->nodeClass, &descr->nodeClass);
  17. if(mask & UA_BROWSERESULTMASK_BROWSENAME)
  18. retval |= UA_QualifiedName_copy(&curr->browseName, &descr->browseName);
  19. if(mask & UA_BROWSERESULTMASK_DISPLAYNAME)
  20. retval |= UA_LocalizedText_copy(&curr->displayName, &descr->displayName);
  21. if(mask & UA_BROWSERESULTMASK_TYPEDEFINITION){
  22. if(curr->nodeClass == UA_NODECLASS_OBJECT || curr->nodeClass == UA_NODECLASS_VARIABLE) {
  23. for(size_t i = 0; i < curr->referencesSize; ++i) {
  24. UA_ReferenceNode *refnode = &curr->references[i];
  25. if(refnode->referenceTypeId.identifier.numeric == UA_NS0ID_HASTYPEDEFINITION) {
  26. retval |= UA_ExpandedNodeId_copy(&refnode->targetId, &descr->typeDefinition);
  27. break;
  28. }
  29. }
  30. }
  31. }
  32. return retval;
  33. }
  34. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  35. static const UA_Node *
  36. returnRelevantNodeExternal(UA_ExternalNodeStore *ens, const UA_BrowseDescription *descr,
  37. const UA_ReferenceNode *reference) {
  38. /* prepare a read request in the external nodestore */
  39. UA_ReadValueId *readValueIds = UA_Array_new(5,&UA_TYPES[UA_TYPES_READVALUEID]);
  40. UA_UInt32 *indices = UA_Array_new(5,&UA_TYPES[UA_TYPES_UINT32]);
  41. UA_UInt32 indicesSize = 5;
  42. UA_DataValue *readNodesResults = UA_Array_new(5,&UA_TYPES[UA_TYPES_DATAVALUE]);
  43. UA_DiagnosticInfo *diagnosticInfos = UA_Array_new(5,&UA_TYPES[UA_TYPES_DIAGNOSTICINFO]);
  44. for(UA_UInt32 i = 0; i < 5; ++i) {
  45. readValueIds[i].nodeId = reference->targetId.nodeId;
  46. indices[i] = i;
  47. }
  48. readValueIds[0].attributeId = UA_ATTRIBUTEID_NODECLASS;
  49. readValueIds[1].attributeId = UA_ATTRIBUTEID_BROWSENAME;
  50. readValueIds[2].attributeId = UA_ATTRIBUTEID_DISPLAYNAME;
  51. readValueIds[3].attributeId = UA_ATTRIBUTEID_DESCRIPTION;
  52. readValueIds[4].attributeId = UA_ATTRIBUTEID_WRITEMASK;
  53. ens->readNodes(ens->ensHandle, NULL, readValueIds, indices,
  54. indicesSize, readNodesResults, false, diagnosticInfos);
  55. /* create and fill a dummy nodeStructure */
  56. UA_Node *node = (UA_Node*) UA_NodeStore_newObjectNode();
  57. UA_NodeId_copy(&(reference->targetId.nodeId), &(node->nodeId));
  58. if(readNodesResults[0].status == UA_STATUSCODE_GOOD)
  59. UA_NodeClass_copy((UA_NodeClass*)readNodesResults[0].value.data, &(node->nodeClass));
  60. if(readNodesResults[1].status == UA_STATUSCODE_GOOD)
  61. UA_QualifiedName_copy((UA_QualifiedName*)readNodesResults[1].value.data, &(node->browseName));
  62. if(readNodesResults[2].status == UA_STATUSCODE_GOOD)
  63. UA_LocalizedText_copy((UA_LocalizedText*)readNodesResults[2].value.data, &(node->displayName));
  64. if(readNodesResults[3].status == UA_STATUSCODE_GOOD)
  65. UA_LocalizedText_copy((UA_LocalizedText*)readNodesResults[3].value.data, &(node->description));
  66. if(readNodesResults[4].status == UA_STATUSCODE_GOOD)
  67. UA_UInt32_copy((UA_UInt32*)readNodesResults[4].value.data, &(node->writeMask));
  68. UA_ReferenceNode **references = &node->references;
  69. UA_UInt32 *referencesSize = (UA_UInt32*)&node->referencesSize;
  70. ens->getOneWayReferences (ens->ensHandle, &node->nodeId, referencesSize, references);
  71. UA_Array_delete(readValueIds,5, &UA_TYPES[UA_TYPES_READVALUEID]);
  72. UA_Array_delete(indices,5, &UA_TYPES[UA_TYPES_UINT32]);
  73. UA_Array_delete(readNodesResults,5, &UA_TYPES[UA_TYPES_DATAVALUE]);
  74. UA_Array_delete(diagnosticInfos,5, &UA_TYPES[UA_TYPES_DIAGNOSTICINFO]);
  75. if(node && descr->nodeClassMask != 0 && (node->nodeClass & descr->nodeClassMask) == 0) {
  76. UA_NodeStore_deleteNode(node);
  77. return NULL;
  78. }
  79. return node;
  80. }
  81. #endif
  82. /* Tests if the node is relevant to the browse request and shall be returned. If
  83. so, it is retrieved from the Nodestore. If not, null is returned. */
  84. static const UA_Node *
  85. returnRelevantNode(UA_Server *server, const UA_BrowseDescription *descr, UA_Boolean return_all,
  86. const UA_ReferenceNode *reference, const UA_NodeId *relevant, size_t relevant_count,
  87. UA_Boolean *isExternal) {
  88. /* reference in the right direction? */
  89. if(reference->isInverse && descr->browseDirection == UA_BROWSEDIRECTION_FORWARD)
  90. return NULL;
  91. if(!reference->isInverse && descr->browseDirection == UA_BROWSEDIRECTION_INVERSE)
  92. return NULL;
  93. /* is the reference part of the hierarchy of references we look for? */
  94. if(!return_all) {
  95. UA_Boolean is_relevant = false;
  96. for(size_t i = 0; i < relevant_count; ++i) {
  97. if(UA_NodeId_equal(&reference->referenceTypeId, &relevant[i])) {
  98. is_relevant = true;
  99. break;
  100. }
  101. }
  102. if(!is_relevant)
  103. return NULL;
  104. }
  105. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  106. /* return the node from an external namespace*/
  107. for(size_t nsIndex = 0; nsIndex < server->externalNamespacesSize; ++nsIndex) {
  108. if(reference->targetId.nodeId.namespaceIndex != server->externalNamespaces[nsIndex].index)
  109. continue;
  110. *isExternal = true;
  111. return returnRelevantNodeExternal(&server->externalNamespaces[nsIndex].externalNodeStore,
  112. descr, reference);
  113. }
  114. #endif
  115. /* return from the internal nodestore */
  116. const UA_Node *node = UA_NodeStore_get(server->nodestore, &reference->targetId.nodeId);
  117. if(node && descr->nodeClassMask != 0 && (node->nodeClass & descr->nodeClassMask) == 0)
  118. return NULL;
  119. *isExternal = false;
  120. return node;
  121. }
  122. static void removeCp(struct ContinuationPointEntry *cp, UA_Session* session) {
  123. LIST_REMOVE(cp, pointers);
  124. UA_ByteString_deleteMembers(&cp->identifier);
  125. UA_BrowseDescription_deleteMembers(&cp->browseDescription);
  126. UA_free(cp);
  127. ++session->availableContinuationPoints;
  128. }
  129. /* Results for a single browsedescription. This is the inner loop for both
  130. * Browse and BrowseNext
  131. *
  132. * @param session Session to save continuationpoints
  133. * @param ns The nodstore where the to-be-browsed node can be found
  134. * @param cp If cp is not null, we continue from here If cp is null, we can add
  135. * a new continuation point if possible and necessary.
  136. * @param descr If no cp is set, we take the browsedescription from there
  137. * @param maxrefs The maximum number of references the client has requested. If 0,
  138. * all matching references are returned at once.
  139. * @param result The entry in the request */
  140. void
  141. Service_Browse_single(UA_Server *server, UA_Session *session,
  142. struct ContinuationPointEntry *cp, const UA_BrowseDescription *descr,
  143. UA_UInt32 maxrefs, UA_BrowseResult *result) {
  144. size_t referencesCount = 0;
  145. size_t referencesIndex = 0;
  146. /* set the browsedescription if a cp is given */
  147. UA_UInt32 continuationIndex = 0;
  148. if(cp) {
  149. descr = &cp->browseDescription;
  150. maxrefs = cp->maxReferences;
  151. continuationIndex = cp->continuationIndex;
  152. }
  153. /* is the browsedirection valid? */
  154. if(descr->browseDirection != UA_BROWSEDIRECTION_BOTH &&
  155. descr->browseDirection != UA_BROWSEDIRECTION_FORWARD &&
  156. descr->browseDirection != UA_BROWSEDIRECTION_INVERSE) {
  157. result->statusCode = UA_STATUSCODE_BADBROWSEDIRECTIONINVALID;
  158. return;
  159. }
  160. /* get the references that match the browsedescription */
  161. size_t relevant_refs_size = 0;
  162. UA_NodeId *relevant_refs = NULL;
  163. UA_Boolean all_refs = UA_NodeId_isNull(&descr->referenceTypeId);
  164. if(!all_refs) {
  165. const UA_Node *rootRef = UA_NodeStore_get(server->nodestore, &descr->referenceTypeId);
  166. if(!rootRef || rootRef->nodeClass != UA_NODECLASS_REFERENCETYPE) {
  167. result->statusCode = UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  168. return;
  169. }
  170. if(descr->includeSubtypes) {
  171. result->statusCode = getTypeHierarchy(server->nodestore, rootRef, false,
  172. &relevant_refs, &relevant_refs_size);
  173. if(result->statusCode != UA_STATUSCODE_GOOD)
  174. return;
  175. } else {
  176. relevant_refs = (UA_NodeId*)(uintptr_t)&descr->referenceTypeId;
  177. relevant_refs_size = 1;
  178. }
  179. }
  180. /* get the node */
  181. const UA_Node *node = UA_NodeStore_get(server->nodestore, &descr->nodeId);
  182. if(!node) {
  183. result->statusCode = UA_STATUSCODE_BADNODEIDUNKNOWN;
  184. if(!all_refs && descr->includeSubtypes)
  185. UA_Array_delete(relevant_refs, relevant_refs_size, &UA_TYPES[UA_TYPES_NODEID]);
  186. return;
  187. }
  188. /* if the node has no references, just return */
  189. if(node->referencesSize == 0) {
  190. result->referencesSize = 0;
  191. if(!all_refs && descr->includeSubtypes)
  192. UA_Array_delete(relevant_refs, relevant_refs_size, &UA_TYPES[UA_TYPES_NODEID]);
  193. return;
  194. }
  195. /* how many references can we return at most? */
  196. size_t real_maxrefs = maxrefs;
  197. if(real_maxrefs == 0)
  198. real_maxrefs = node->referencesSize;
  199. else if(real_maxrefs > node->referencesSize)
  200. real_maxrefs = node->referencesSize;
  201. result->references = UA_Array_new(real_maxrefs, &UA_TYPES[UA_TYPES_REFERENCEDESCRIPTION]);
  202. if(!result->references) {
  203. result->statusCode = UA_STATUSCODE_BADOUTOFMEMORY;
  204. goto cleanup;
  205. }
  206. /* loop over the node's references */
  207. size_t skipped = 0;
  208. UA_Boolean isExternal = false;
  209. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  210. for(; referencesIndex < node->referencesSize && referencesCount < real_maxrefs; ++referencesIndex) {
  211. isExternal = false;
  212. const UA_Node *current =
  213. returnRelevantNode(server, descr, all_refs, &node->references[referencesIndex],
  214. relevant_refs, relevant_refs_size, &isExternal);
  215. if(!current)
  216. continue;
  217. if(skipped < continuationIndex) {
  218. ++skipped;
  219. } else {
  220. retval |= fillReferenceDescription(server->nodestore, current,
  221. &node->references[referencesIndex],
  222. descr->resultMask,
  223. &result->references[referencesCount]);
  224. ++referencesCount;
  225. }
  226. }
  227. result->referencesSize = referencesCount;
  228. if(referencesCount == 0) {
  229. UA_free(result->references);
  230. result->references = NULL;
  231. result->referencesSize = 0;
  232. }
  233. if(retval != UA_STATUSCODE_GOOD) {
  234. UA_Array_delete(result->references, result->referencesSize,
  235. &UA_TYPES[UA_TYPES_REFERENCEDESCRIPTION]);
  236. result->references = NULL;
  237. result->referencesSize = 0;
  238. result->statusCode = retval;
  239. }
  240. cleanup:
  241. if(!all_refs && descr->includeSubtypes)
  242. UA_Array_delete(relevant_refs, relevant_refs_size, &UA_TYPES[UA_TYPES_NODEID]);
  243. if(result->statusCode != UA_STATUSCODE_GOOD)
  244. return;
  245. /* create, update, delete continuation points */
  246. if(cp) {
  247. if(referencesIndex == node->referencesSize) {
  248. /* all done, remove a finished continuationPoint */
  249. removeCp(cp, session);
  250. } else {
  251. /* update the cp and return the cp identifier */
  252. cp->continuationIndex += (UA_UInt32)referencesCount;
  253. UA_ByteString_copy(&cp->identifier, &result->continuationPoint);
  254. }
  255. } else if(maxrefs != 0 && referencesCount >= maxrefs) {
  256. /* create a cp */
  257. if(session->availableContinuationPoints <= 0 ||
  258. !(cp = UA_malloc(sizeof(struct ContinuationPointEntry)))) {
  259. result->statusCode = UA_STATUSCODE_BADNOCONTINUATIONPOINTS;
  260. return;
  261. }
  262. UA_BrowseDescription_copy(descr, &cp->browseDescription);
  263. cp->maxReferences = maxrefs;
  264. cp->continuationIndex = (UA_UInt32)referencesCount;
  265. UA_Guid *ident = UA_Guid_new();
  266. *ident = UA_Guid_random();
  267. cp->identifier.data = (UA_Byte*)ident;
  268. cp->identifier.length = sizeof(UA_Guid);
  269. UA_ByteString_copy(&cp->identifier, &result->continuationPoint);
  270. /* store the cp */
  271. LIST_INSERT_HEAD(&session->continuationPoints, cp, pointers);
  272. --session->availableContinuationPoints;
  273. }
  274. }
  275. void Service_Browse(UA_Server *server, UA_Session *session, const UA_BrowseRequest *request,
  276. UA_BrowseResponse *response) {
  277. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing BrowseRequest");
  278. if(!UA_NodeId_isNull(&request->view.viewId)) {
  279. response->responseHeader.serviceResult = UA_STATUSCODE_BADVIEWIDUNKNOWN;
  280. return;
  281. }
  282. if(request->nodesToBrowseSize <= 0) {
  283. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  284. return;
  285. }
  286. size_t size = request->nodesToBrowseSize;
  287. response->results = UA_Array_new(size, &UA_TYPES[UA_TYPES_BROWSERESULT]);
  288. if(!response->results) {
  289. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  290. return;
  291. }
  292. response->resultsSize = size;
  293. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  294. #ifdef NO_ALLOCA
  295. UA_Boolean isExternal[size];
  296. UA_UInt32 indices[size];
  297. #else
  298. UA_Boolean *isExternal = UA_alloca(sizeof(UA_Boolean) * size);
  299. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32) * size);
  300. #endif /*NO_ALLOCA */
  301. memset(isExternal, false, sizeof(UA_Boolean) * size);
  302. for(size_t j = 0; j < server->externalNamespacesSize; ++j) {
  303. size_t indexSize = 0;
  304. for(size_t i = 0; i < size; ++i) {
  305. if(request->nodesToBrowse[i].nodeId.namespaceIndex != server->externalNamespaces[j].index)
  306. continue;
  307. isExternal[i] = true;
  308. indices[indexSize] = (UA_UInt32)i;
  309. ++indexSize;
  310. }
  311. if(indexSize == 0)
  312. continue;
  313. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  314. ens->browseNodes(ens->ensHandle, &request->requestHeader, request->nodesToBrowse, indices,
  315. (UA_UInt32)indexSize, request->requestedMaxReferencesPerNode,
  316. response->results, response->diagnosticInfos);
  317. }
  318. #endif
  319. for(size_t i = 0; i < size; ++i) {
  320. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  321. if(!isExternal[i])
  322. #endif
  323. Service_Browse_single(server, session, NULL, &request->nodesToBrowse[i],
  324. request->requestedMaxReferencesPerNode, &response->results[i]);
  325. }
  326. }
  327. UA_BrowseResult
  328. UA_Server_browse(UA_Server *server, UA_UInt32 maxrefs, const UA_BrowseDescription *descr) {
  329. UA_BrowseResult result;
  330. UA_BrowseResult_init(&result);
  331. UA_RCU_LOCK();
  332. Service_Browse_single(server, &adminSession, NULL, descr, maxrefs, &result);
  333. UA_RCU_UNLOCK();
  334. return result;
  335. }
  336. static void
  337. UA_Server_browseNext_single(UA_Server *server, UA_Session *session, UA_Boolean releaseContinuationPoint,
  338. const UA_ByteString *continuationPoint, UA_BrowseResult *result) {
  339. result->statusCode = UA_STATUSCODE_BADCONTINUATIONPOINTINVALID;
  340. struct ContinuationPointEntry *cp, *temp;
  341. LIST_FOREACH_SAFE(cp, &session->continuationPoints, pointers, temp) {
  342. if(UA_ByteString_equal(&cp->identifier, continuationPoint)) {
  343. result->statusCode = UA_STATUSCODE_GOOD;
  344. if(!releaseContinuationPoint)
  345. Service_Browse_single(server, session, cp, NULL, 0, result);
  346. else
  347. removeCp(cp, session);
  348. break;
  349. }
  350. }
  351. }
  352. void Service_BrowseNext(UA_Server *server, UA_Session *session, const UA_BrowseNextRequest *request,
  353. UA_BrowseNextResponse *response) {
  354. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing BrowseNextRequest");
  355. if(request->continuationPointsSize <= 0) {
  356. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  357. return;
  358. }
  359. size_t size = request->continuationPointsSize;
  360. response->results = UA_Array_new(size, &UA_TYPES[UA_TYPES_BROWSERESULT]);
  361. if(!response->results) {
  362. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  363. return;
  364. }
  365. response->resultsSize = size;
  366. for(size_t i = 0; i < size; ++i)
  367. UA_Server_browseNext_single(server, session, request->releaseContinuationPoints,
  368. &request->continuationPoints[i], &response->results[i]);
  369. }
  370. UA_BrowseResult
  371. UA_Server_browseNext(UA_Server *server, UA_Boolean releaseContinuationPoint,
  372. const UA_ByteString *continuationPoint) {
  373. UA_BrowseResult result;
  374. UA_BrowseResult_init(&result);
  375. UA_RCU_LOCK();
  376. UA_Server_browseNext_single(server, &adminSession, releaseContinuationPoint,
  377. continuationPoint, &result);
  378. UA_RCU_UNLOCK();
  379. return result;
  380. }
  381. /***********************/
  382. /* TranslateBrowsePath */
  383. /***********************/
  384. static UA_StatusCode
  385. walkBrowsePath(UA_Server *server, UA_Session *session, const UA_Node *node, const UA_RelativePath *path,
  386. size_t pathindex, UA_BrowsePathTarget **targets, size_t *targets_size,
  387. size_t *target_count) {
  388. const UA_RelativePathElement *elem = &path->elements[pathindex];
  389. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  390. UA_NodeId *reftypes = NULL;
  391. size_t reftypes_count = 1; // all_refs or no subtypes => 1
  392. UA_Boolean all_refs = false;
  393. if(UA_NodeId_isNull(&elem->referenceTypeId)) {
  394. all_refs = true;
  395. } else if(!elem->includeSubtypes) {
  396. reftypes = (UA_NodeId*)(uintptr_t)&elem->referenceTypeId; // ptr magic due to const cast
  397. } else {
  398. const UA_Node *rootRef = UA_NodeStore_get(server->nodestore, &elem->referenceTypeId);
  399. if(!rootRef || rootRef->nodeClass != UA_NODECLASS_REFERENCETYPE)
  400. return UA_STATUSCODE_BADREFERENCETYPEIDINVALID;
  401. retval = getTypeHierarchy(server->nodestore, rootRef, false, &reftypes, &reftypes_count);
  402. if(retval != UA_STATUSCODE_GOOD)
  403. return retval;
  404. }
  405. for(size_t i = 0; i < node->referencesSize && retval == UA_STATUSCODE_GOOD; ++i) {
  406. UA_Boolean match = all_refs;
  407. for(size_t j = 0; j < reftypes_count && !match; ++j) {
  408. if(node->references[i].isInverse == elem->isInverse &&
  409. UA_NodeId_equal(&node->references[i].referenceTypeId, &reftypes[j]))
  410. match = true;
  411. }
  412. if(!match)
  413. continue;
  414. // get the node, todo: expandednodeid
  415. const UA_Node *next = UA_NodeStore_get(server->nodestore, &node->references[i].targetId.nodeId);
  416. if(!next)
  417. continue;
  418. // test the browsename
  419. if(elem->targetName.namespaceIndex != next->browseName.namespaceIndex ||
  420. !UA_String_equal(&elem->targetName.name, &next->browseName.name)) {
  421. continue;
  422. }
  423. if(pathindex + 1 < path->elementsSize) {
  424. // recursion if the path is longer
  425. retval = walkBrowsePath(server, session, next, path, pathindex + 1,
  426. targets, targets_size, target_count);
  427. } else {
  428. // add the browsetarget
  429. if(*target_count >= *targets_size) {
  430. UA_BrowsePathTarget *newtargets;
  431. newtargets = UA_realloc(targets, sizeof(UA_BrowsePathTarget) * (*targets_size) * 2);
  432. if(!newtargets) {
  433. retval = UA_STATUSCODE_BADOUTOFMEMORY;
  434. break;
  435. }
  436. *targets = newtargets;
  437. *targets_size *= 2;
  438. }
  439. UA_BrowsePathTarget *res = *targets;
  440. UA_ExpandedNodeId_init(&res[*target_count].targetId);
  441. retval = UA_NodeId_copy(&next->nodeId, &res[*target_count].targetId.nodeId);
  442. if(retval != UA_STATUSCODE_GOOD)
  443. break;
  444. res[*target_count].remainingPathIndex = UA_UINT32_MAX;
  445. *target_count += 1;
  446. }
  447. }
  448. if(!all_refs && elem->includeSubtypes)
  449. UA_Array_delete(reftypes, reftypes_count, &UA_TYPES[UA_TYPES_NODEID]);
  450. return retval;
  451. }
  452. static void
  453. translateBrowsePathsToNodeIds(UA_Server *server, UA_Session *session,
  454. const UA_BrowsePath *path, UA_BrowsePathResult *result) {
  455. if(path->relativePath.elementsSize <= 0) {
  456. result->statusCode = UA_STATUSCODE_BADNOTHINGTODO;
  457. return;
  458. }
  459. //relativePath elements should not have an empty targetName
  460. for(size_t i=0;i<path->relativePath.elementsSize;++i){
  461. UA_QualifiedName *qname = &(path->relativePath.elements[i].targetName);
  462. if(UA_QualifiedName_isNull(qname)){
  463. result->statusCode = UA_STATUSCODE_BADBROWSENAMEINVALID;
  464. return;
  465. }
  466. }
  467. size_t arraySize = 10;
  468. result->targets = UA_malloc(sizeof(UA_BrowsePathTarget) * arraySize);
  469. if(!result->targets) {
  470. result->statusCode = UA_STATUSCODE_BADOUTOFMEMORY;
  471. return;
  472. }
  473. result->targetsSize = 0;
  474. const UA_Node *firstNode = UA_NodeStore_get(server->nodestore, &path->startingNode);
  475. if(!firstNode) {
  476. result->statusCode = UA_STATUSCODE_BADNODEIDUNKNOWN;
  477. UA_free(result->targets);
  478. result->targets = NULL;
  479. return;
  480. }
  481. result->statusCode = walkBrowsePath(server, session, firstNode, &path->relativePath, 0,
  482. &result->targets, &arraySize, &result->targetsSize);
  483. if(result->targetsSize == 0 && result->statusCode == UA_STATUSCODE_GOOD)
  484. result->statusCode = UA_STATUSCODE_BADNOMATCH;
  485. if(result->statusCode != UA_STATUSCODE_GOOD) {
  486. UA_Array_delete(result->targets, result->targetsSize, &UA_TYPES[UA_TYPES_BROWSEPATHTARGET]);
  487. result->targets = NULL;
  488. result->targetsSize = 0;
  489. }
  490. }
  491. UA_BrowsePathResult
  492. UA_Server_translateBrowsePathToNodeIds(UA_Server *server,
  493. const UA_BrowsePath *browsePath) {
  494. UA_BrowsePathResult result;
  495. UA_BrowsePathResult_init(&result);
  496. UA_RCU_LOCK();
  497. translateBrowsePathsToNodeIds(server, &adminSession, browsePath, &result);
  498. UA_RCU_UNLOCK();
  499. return result;
  500. }
  501. void Service_TranslateBrowsePathsToNodeIds(UA_Server *server, UA_Session *session,
  502. const UA_TranslateBrowsePathsToNodeIdsRequest *request,
  503. UA_TranslateBrowsePathsToNodeIdsResponse *response) {
  504. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing TranslateBrowsePathsToNodeIdsRequest");
  505. if(request->browsePathsSize <= 0) {
  506. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  507. return;
  508. }
  509. size_t size = request->browsePathsSize;
  510. response->results = UA_Array_new(size, &UA_TYPES[UA_TYPES_BROWSEPATHRESULT]);
  511. if(!response->results) {
  512. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  513. return;
  514. }
  515. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  516. #ifdef NO_ALLOCA
  517. UA_Boolean isExternal[size];
  518. UA_UInt32 indices[size];
  519. #else
  520. UA_Boolean *isExternal = UA_alloca(sizeof(UA_Boolean) * size);
  521. UA_UInt32 *indices = UA_alloca(sizeof(UA_UInt32) * size);
  522. #endif /* NO_ALLOCA */
  523. memset(isExternal, false, sizeof(UA_Boolean) * size);
  524. for(size_t j = 0; j < server->externalNamespacesSize; ++j) {
  525. size_t indexSize = 0;
  526. for(size_t i = 0;i < size;++i) {
  527. if(request->browsePaths[i].startingNode.namespaceIndex != server->externalNamespaces[j].index)
  528. continue;
  529. isExternal[i] = true;
  530. indices[indexSize] = (UA_UInt32)i;
  531. ++indexSize;
  532. }
  533. if(indexSize == 0)
  534. continue;
  535. UA_ExternalNodeStore *ens = &server->externalNamespaces[j].externalNodeStore;
  536. ens->translateBrowsePathsToNodeIds(ens->ensHandle, &request->requestHeader, request->browsePaths,
  537. indices, (UA_UInt32)indexSize, response->results,
  538. response->diagnosticInfos);
  539. }
  540. #endif
  541. response->resultsSize = size;
  542. for(size_t i = 0; i < size; ++i) {
  543. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  544. if(!isExternal[i])
  545. #endif
  546. translateBrowsePathsToNodeIds(server, session, &request->browsePaths[i],
  547. &response->results[i]);
  548. }
  549. }
  550. void Service_RegisterNodes(UA_Server *server, UA_Session *session, const UA_RegisterNodesRequest *request,
  551. UA_RegisterNodesResponse *response) {
  552. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing RegisterNodesRequest");
  553. //TODO: hang the nodeids to the session if really needed
  554. response->responseHeader.timestamp = UA_DateTime_now();
  555. if(request->nodesToRegisterSize <= 0)
  556. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  557. else {
  558. response->responseHeader.serviceResult =
  559. UA_Array_copy(request->nodesToRegister, request->nodesToRegisterSize,
  560. (void**)&response->registeredNodeIds, &UA_TYPES[UA_TYPES_NODEID]);
  561. if(response->responseHeader.serviceResult == UA_STATUSCODE_GOOD)
  562. response->registeredNodeIdsSize = request->nodesToRegisterSize;
  563. }
  564. }
  565. void Service_UnregisterNodes(UA_Server *server, UA_Session *session, const UA_UnregisterNodesRequest *request,
  566. UA_UnregisterNodesResponse *response) {
  567. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing UnRegisterNodesRequest");
  568. //TODO: remove the nodeids from the session if really needed
  569. response->responseHeader.timestamp = UA_DateTime_now();
  570. if(request->nodesToUnregisterSize==0)
  571. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  572. }