ua_services_view.c 26 KB

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