ua_server_internal.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501
  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. #ifndef UA_SERVER_INTERNAL_H_
  5. #define UA_SERVER_INTERNAL_H_
  6. #ifdef __cplusplus
  7. extern "C" {
  8. #endif
  9. #include "ua_util.h"
  10. #include "ua_server.h"
  11. #include "ua_timer.h"
  12. #include "ua_server_external_ns.h"
  13. #include "ua_connection_internal.h"
  14. #include "ua_session_manager.h"
  15. #include "ua_securechannel_manager.h"
  16. #include "ua_nodestore.h"
  17. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  18. #include "mdnsd/libmdnsd/mdnsd.h"
  19. #endif
  20. #define ANONYMOUS_POLICY "open62541-anonymous-policy"
  21. #define USERNAME_POLICY "open62541-username-policy"
  22. /* The general idea of RCU is to delay freeing nodes (or any callback invoked
  23. * with call_rcu) until all threads have left their critical section. Thus we
  24. * can delete nodes safely in concurrent operations. The macros UA_RCU_LOCK and
  25. * UA_RCU_UNLOCK are used to test during debugging that we do not nest read-side
  26. * critical sections (although this is generally allowed). */
  27. #ifdef UA_ENABLE_MULTITHREADING
  28. # define _LGPL_SOURCE
  29. # include <urcu.h>
  30. # include <urcu/lfstack.h>
  31. # ifdef NDEBUG
  32. # define UA_RCU_LOCK() rcu_read_lock()
  33. # define UA_RCU_UNLOCK() rcu_read_unlock()
  34. # define UA_ASSERT_RCU_LOCKED()
  35. # define UA_ASSERT_RCU_UNLOCKED()
  36. # else
  37. extern UA_THREAD_LOCAL bool rcu_locked;
  38. # define UA_ASSERT_RCU_LOCKED() assert(rcu_locked)
  39. # define UA_ASSERT_RCU_UNLOCKED() assert(!rcu_locked)
  40. # define UA_RCU_LOCK() do { \
  41. UA_ASSERT_RCU_UNLOCKED(); \
  42. rcu_locked = true; \
  43. rcu_read_lock(); } while(0)
  44. # define UA_RCU_UNLOCK() do { \
  45. UA_ASSERT_RCU_LOCKED(); \
  46. rcu_locked = false; \
  47. rcu_read_unlock(); } while(0)
  48. # endif
  49. #else
  50. # define UA_RCU_LOCK()
  51. # define UA_RCU_UNLOCK()
  52. # define UA_ASSERT_RCU_LOCKED()
  53. # define UA_ASSERT_RCU_UNLOCKED()
  54. #endif
  55. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  56. /* Mapping of namespace-id and url to an external nodestore. For namespaces that
  57. * have no mapping defined, the internal nodestore is used by default. */
  58. typedef struct UA_ExternalNamespace {
  59. UA_UInt16 index;
  60. UA_String url;
  61. UA_ExternalNodeStore externalNodeStore;
  62. } UA_ExternalNamespace;
  63. #endif
  64. #ifdef UA_ENABLE_MULTITHREADING
  65. typedef struct {
  66. UA_Server *server;
  67. pthread_t thr;
  68. UA_UInt32 counter;
  69. volatile UA_Boolean running;
  70. char padding[64 - sizeof(void*) - sizeof(pthread_t) -
  71. sizeof(UA_UInt32) - sizeof(UA_Boolean)]; // separate cache lines
  72. } UA_Worker;
  73. struct MainLoopJob {
  74. struct cds_lfs_node node;
  75. UA_Job job;
  76. };
  77. void
  78. UA_Server_dispatchJob(UA_Server *server, const UA_Job *job);
  79. #endif
  80. void
  81. UA_Server_processJob(UA_Server *server, UA_Job *job);
  82. #if defined(UA_ENABLE_METHODCALLS) && defined(UA_ENABLE_SUBSCRIPTIONS)
  83. /* Internally used context to a session 'context' of the current mehtod call */
  84. extern UA_THREAD_LOCAL UA_Session* methodCallSession;
  85. #endif
  86. #ifdef UA_ENABLE_DISCOVERY
  87. typedef struct registeredServer_list_entry {
  88. LIST_ENTRY(registeredServer_list_entry) pointers;
  89. UA_RegisteredServer registeredServer;
  90. UA_DateTime lastSeen;
  91. } registeredServer_list_entry;
  92. # ifdef UA_ENABLE_DISCOVERY_MULTICAST
  93. typedef struct serverOnNetwork_list_entry {
  94. LIST_ENTRY(serverOnNetwork_list_entry) pointers;
  95. UA_ServerOnNetwork serverOnNetwork;
  96. UA_DateTime created;
  97. UA_DateTime lastSeen;
  98. UA_Boolean txtSet;
  99. UA_Boolean srvSet;
  100. char* pathTmp;
  101. } serverOnNetwork_list_entry;
  102. #define SERVER_ON_NETWORK_HASH_PRIME 1009
  103. typedef struct serverOnNetwork_hash_entry {
  104. serverOnNetwork_list_entry* entry;
  105. struct serverOnNetwork_hash_entry* next;
  106. } serverOnNetwork_hash_entry;
  107. #endif /* UA_ENABLE_DISCOVERY_MULTICAST */
  108. #endif /* UA_ENABLE_DISCOVERY */
  109. struct UA_Server {
  110. /* Meta */
  111. UA_DateTime startTime;
  112. size_t endpointDescriptionsSize;
  113. UA_EndpointDescription *endpointDescriptions;
  114. /* Security */
  115. UA_SecureChannelManager secureChannelManager;
  116. UA_SessionManager sessionManager;
  117. /* Address Space */
  118. UA_NodeStore *nodestore;
  119. #ifdef UA_ENABLE_DISCOVERY
  120. /* Discovery */
  121. LIST_HEAD(registeredServer_list, registeredServer_list_entry) registeredServers; // doubly-linked list of registered servers
  122. size_t registeredServersSize;
  123. struct PeriodicServerRegisterJob *periodicServerRegisterJob;
  124. UA_Server_registerServerCallback registerServerCallback;
  125. void* registerServerCallbackData;
  126. # ifdef UA_ENABLE_DISCOVERY_MULTICAST
  127. mdns_daemon_t *mdnsDaemon;
  128. int mdnsSocket;
  129. UA_Boolean mdnsMainSrvAdded;
  130. # ifdef UA_ENABLE_MULTITHREADING
  131. pthread_t mdnsThread;
  132. UA_Boolean mdnsRunning;
  133. # endif
  134. LIST_HEAD(serverOnNetwork_list, serverOnNetwork_list_entry) serverOnNetwork; // doubly-linked list of servers on the network (from mDNS)
  135. size_t serverOnNetworkSize;
  136. UA_UInt32 serverOnNetworkRecordIdCounter;
  137. UA_DateTime serverOnNetworkRecordIdLastReset;
  138. // hash mapping domain name to serverOnNetwork list entry
  139. struct serverOnNetwork_hash_entry* serverOnNetworkHash[SERVER_ON_NETWORK_HASH_PRIME];
  140. UA_Server_serverOnNetworkCallback serverOnNetworkCallback;
  141. void* serverOnNetworkCallbackData;
  142. # endif
  143. #endif
  144. size_t namespacesSize;
  145. UA_String *namespaces;
  146. #ifdef UA_ENABLE_EXTERNAL_NAMESPACES
  147. size_t externalNamespacesSize;
  148. UA_ExternalNamespace *externalNamespaces;
  149. #endif
  150. /* Jobs with a repetition interval */
  151. UA_RepeatedJobsList repeatedJobs;
  152. #ifndef UA_ENABLE_MULTITHREADING
  153. SLIST_HEAD(DelayedJobsList, UA_DelayedJob) delayedCallbacks;
  154. #else
  155. /* Dispatch queue head for the worker threads (the tail should not be in the same cache line) */
  156. struct cds_wfcq_head dispatchQueue_head;
  157. UA_Worker *workers; /* there are nThread workers in a running server */
  158. struct cds_lfs_stack mainLoopJobs; /* Work that shall be executed only in the main loop and not
  159. by worker threads */
  160. struct DelayedJobs *delayedJobs;
  161. pthread_cond_t dispatchQueue_condition; /* so the workers don't spin if the queue is empty */
  162. pthread_mutex_t dispatchQueue_mutex; /* mutex for access to condition variable */
  163. struct cds_wfcq_tail dispatchQueue_tail; /* Dispatch queue tail for the worker threads */
  164. #endif
  165. /* Config is the last element so that MSVC allows the usernamePasswordLogins
  166. field with zero-sized array */
  167. UA_ServerConfig config;
  168. };
  169. /*****************/
  170. /* Node Handling */
  171. /*****************/
  172. void UA_Node_deleteMembersAnyNodeClass(UA_Node *node);
  173. UA_StatusCode UA_Node_copyAnyNodeClass(const UA_Node *src, UA_Node *dst);
  174. typedef UA_StatusCode (*UA_EditNodeCallback)(UA_Server*, UA_Session*, UA_Node*, const void*);
  175. /* Calls callback on the node. In the multithreaded case, the node is copied before and replaced in
  176. the nodestore. */
  177. UA_StatusCode UA_Server_editNode(UA_Server *server, UA_Session *session, const UA_NodeId *nodeId,
  178. UA_EditNodeCallback callback, const void *data);
  179. void UA_Server_processBinaryMessage(UA_Server *server, UA_Connection *connection,
  180. const UA_ByteString *message);
  181. UA_StatusCode UA_Server_delayedCallback(UA_Server *server, UA_ServerCallback callback, void *data);
  182. UA_StatusCode UA_Server_delayedFree(UA_Server *server, void *data);
  183. /*********************/
  184. /* Utility Functions */
  185. /*********************/
  186. UA_StatusCode
  187. UA_NumericRange_parseFromString(UA_NumericRange *range, const UA_String *str);
  188. UA_UInt16 addNamespace(UA_Server *server, const UA_String name);
  189. UA_Boolean
  190. UA_Node_hasSubTypeOrInstances(const UA_Node *node);
  191. const UA_VariableTypeNode *
  192. getVariableNodeType(UA_Server *server, const UA_VariableNode *node);
  193. const UA_ObjectTypeNode *
  194. getObjectNodeType(UA_Server *server, const UA_ObjectNode *node);
  195. /* Returns an array with all subtype nodeids (including the root). Subtypes need
  196. * to have the same nodeClass as root and are (recursively) related with a
  197. * hasSubType reference. Since multi-inheritance is possible, we test for
  198. * duplicates and return evey nodeid at most once. */
  199. UA_StatusCode
  200. getTypeHierarchy(UA_NodeStore *ns, const UA_Node *rootRef, UA_Boolean inverse,
  201. UA_NodeId **typeHierarchy, size_t *typeHierarchySize);
  202. /* Recursively searches "upwards" in the tree following specific reference types */
  203. UA_Boolean
  204. isNodeInTree(UA_NodeStore *ns, const UA_NodeId *leafNode,
  205. const UA_NodeId *nodeToFind, const UA_NodeId *referenceTypeIds,
  206. size_t referenceTypeIdsSize);
  207. /* Returns the nodeid of the node type, if none defined for the node or the node
  208. * class, typeId is set to UA_NODEID_NULL. */
  209. void getNodeType(UA_Server *server, const UA_Node *node, UA_NodeId *typeId);
  210. /***************************************/
  211. /* Check Information Model Consistency */
  212. /***************************************/
  213. UA_StatusCode
  214. readValueAttribute(UA_Server *server, const UA_VariableNode *vn, UA_DataValue *v);
  215. UA_StatusCode
  216. typeCheckValue(UA_Server *server, const UA_NodeId *targetDataTypeId,
  217. UA_Int32 targetValueRank, size_t targetArrayDimensionsSize,
  218. const UA_UInt32 *targetArrayDimensions, const UA_Variant *value,
  219. const UA_NumericRange *range, UA_Variant *editableValue);
  220. UA_StatusCode
  221. compatibleArrayDimensions(size_t constraintArrayDimensionsSize,
  222. const UA_UInt32 *constraintArrayDimensions,
  223. size_t testArrayDimensionsSize,
  224. const UA_UInt32 *testArrayDimensions);
  225. UA_Boolean
  226. compatibleDataType(UA_Server *server, const UA_NodeId *dataType,
  227. const UA_NodeId *constraintDataType);
  228. UA_StatusCode
  229. compatibleValueRankArrayDimensions(UA_Int32 valueRank, size_t arrayDimensionsSize);
  230. UA_Boolean
  231. compatibleDataType(UA_Server *server, const UA_NodeId *dataType,
  232. const UA_NodeId *constraintDataType);
  233. UA_StatusCode
  234. compatibleValueRankArrayDimensions(UA_Int32 valueRank, size_t arrayDimensionsSize);
  235. UA_StatusCode
  236. writeValueRankAttribute(UA_Server *server, UA_VariableNode *node,
  237. UA_Int32 valueRank, UA_Int32 constraintValueRank);
  238. UA_StatusCode
  239. compatibleValueRanks(UA_Int32 valueRank, UA_Int32 constraintValueRank);
  240. UA_StatusCode
  241. compatibleValueRanks(UA_Int32 valueRank, UA_Int32 constraintValueRank);
  242. /*******************/
  243. /* Single-Services */
  244. /*******************/
  245. /* Some services take an array of "independent" requests. The single-services
  246. * are stored here to keep ua_services.h clean for documentation purposes. */
  247. UA_StatusCode
  248. Service_AddReferences_single(UA_Server *server, UA_Session *session,
  249. const UA_AddReferencesItem *item);
  250. UA_StatusCode
  251. Service_DeleteNodes_single(UA_Server *server, UA_Session *session,
  252. const UA_NodeId *nodeId, UA_Boolean deleteReferences);
  253. UA_StatusCode
  254. Service_DeleteReferences_single(UA_Server *server, UA_Session *session,
  255. const UA_DeleteReferencesItem *item);
  256. void Service_Browse_single(UA_Server *server, UA_Session *session,
  257. struct ContinuationPointEntry *cp,
  258. const UA_BrowseDescription *descr,
  259. UA_UInt32 maxrefs, UA_BrowseResult *result);
  260. void
  261. Service_TranslateBrowsePathsToNodeIds_single(UA_Server *server, UA_Session *session,
  262. const UA_BrowsePath *path,
  263. UA_BrowsePathResult *result);
  264. void Service_Read_single(UA_Server *server, UA_Session *session,
  265. UA_TimestampsToReturn timestamps,
  266. const UA_ReadValueId *id, UA_DataValue *v);
  267. void Service_Call_single(UA_Server *server, UA_Session *session,
  268. const UA_CallMethodRequest *request,
  269. UA_CallMethodResult *result);
  270. /* Periodic task to clean up the discovery registry */
  271. void UA_Discovery_cleanupTimedOut(UA_Server *server, UA_DateTime nowMonotonic);
  272. # ifdef UA_ENABLE_DISCOVERY_MULTICAST
  273. UA_StatusCode
  274. initMulticastDiscoveryServer(UA_Server* server);
  275. void startMulticastDiscoveryServer(UA_Server *server);
  276. void stopMulticastDiscoveryServer(UA_Server *server);
  277. UA_StatusCode
  278. iterateMulticastDiscoveryServer(UA_Server* server, UA_DateTime *nextRepeat,
  279. UA_Boolean processIn);
  280. void destroyMulticastDiscoveryServer(UA_Server* server);
  281. typedef enum {
  282. UA_DISCOVERY_TCP, /* OPC UA TCP mapping */
  283. UA_DISCOVERY_TLS /* OPC UA HTTPS mapping */
  284. } UA_DiscoveryProtocol;
  285. /* Send a multicast probe to find any other OPC UA server on the network through mDNS. */
  286. UA_StatusCode
  287. UA_Discovery_multicastQuery(UA_Server* server);
  288. UA_StatusCode
  289. UA_Discovery_addRecord(UA_Server* server, const char* servername, const char* hostname,
  290. unsigned short port, const char* path,
  291. const UA_DiscoveryProtocol protocol, UA_Boolean createTxt,
  292. const UA_String* capabilites, const size_t *capabilitiesSize);
  293. UA_StatusCode
  294. UA_Discovery_removeRecord(UA_Server* server, const char* servername, const char* hostname,
  295. unsigned short port, UA_Boolean removeTxt);
  296. # endif
  297. /*****************************/
  298. /* AddNodes Begin and Finish */
  299. /*****************************/
  300. /* Don't use this function. There are typed versions as inline functions. */
  301. UA_StatusCode UA_EXPORT
  302. __UA_Server_addNode_begin(UA_Server *server, const UA_NodeClass nodeClass,
  303. const UA_NodeId *requestedNewNodeId,
  304. const UA_QualifiedName *browseName,
  305. const UA_NodeAttributes *attr,
  306. const UA_DataType *attributeType,
  307. UA_NodeId *outNewNodeId);
  308. /* The inline function UA_Server_addNode_finish might be more convenient to
  309. * pass NodeIds in-situ (e.g. UA_NODEID_NUMERIC(0, 5)) */
  310. UA_StatusCode UA_EXPORT
  311. UA_Server_addNode_finish(UA_Server *server, const UA_NodeId nodeId,
  312. const UA_NodeId parentNodeId,
  313. const UA_NodeId referenceTypeId,
  314. const UA_NodeId typeDefinition,
  315. UA_InstantiationCallback *instantiationCallback);
  316. static UA_INLINE UA_StatusCode
  317. UA_Server_addReferenceTypeNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  318. const UA_QualifiedName browseName,
  319. const UA_ReferenceTypeAttributes attr,
  320. UA_NodeId *outNewNodeId) {
  321. return __UA_Server_addNode_begin(server, UA_NODECLASS_REFERENCETYPE,
  322. &requestedNewNodeId,
  323. &browseName, (const UA_NodeAttributes*)&attr,
  324. &UA_TYPES[UA_TYPES_REFERENCETYPEATTRIBUTES],
  325. outNewNodeId);
  326. }
  327. static UA_INLINE UA_StatusCode
  328. UA_Server_addDataTypeNode_begin(UA_Server *server,
  329. const UA_NodeId requestedNewNodeId,
  330. const UA_QualifiedName browseName,
  331. const UA_DataTypeAttributes attr,
  332. UA_NodeId *outNewNodeId) {
  333. return __UA_Server_addNode_begin(server, UA_NODECLASS_DATATYPE,
  334. &requestedNewNodeId,
  335. &browseName, (const UA_NodeAttributes*)&attr,
  336. &UA_TYPES[UA_TYPES_DATATYPEATTRIBUTES],
  337. outNewNodeId);
  338. }
  339. static UA_INLINE UA_StatusCode
  340. UA_Server_addVariableNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  341. const UA_QualifiedName browseName,
  342. const UA_VariableAttributes attr,
  343. UA_NodeId *outNewNodeId) {
  344. return __UA_Server_addNode_begin(server, UA_NODECLASS_VARIABLE,
  345. &requestedNewNodeId, &browseName,
  346. (const UA_NodeAttributes*)&attr,
  347. &UA_TYPES[UA_TYPES_VARIABLEATTRIBUTES],
  348. outNewNodeId);
  349. }
  350. static UA_INLINE UA_StatusCode
  351. UA_Server_addVariableTypeNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  352. const UA_QualifiedName browseName,
  353. const UA_VariableTypeAttributes attr,
  354. UA_NodeId *outNewNodeId) {
  355. return __UA_Server_addNode_begin(server, UA_NODECLASS_VARIABLETYPE,
  356. &requestedNewNodeId, &browseName,
  357. (const UA_NodeAttributes*)&attr,
  358. &UA_TYPES[UA_TYPES_VARIABLETYPEATTRIBUTES],
  359. outNewNodeId);
  360. }
  361. static UA_INLINE UA_StatusCode
  362. UA_Server_addObjectNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  363. const UA_QualifiedName browseName,
  364. const UA_ObjectAttributes attr,
  365. UA_NodeId *outNewNodeId) {
  366. return __UA_Server_addNode_begin(server, UA_NODECLASS_OBJECT,
  367. &requestedNewNodeId,
  368. &browseName, (const UA_NodeAttributes*)&attr,
  369. &UA_TYPES[UA_TYPES_OBJECTATTRIBUTES],
  370. outNewNodeId);
  371. }
  372. static UA_INLINE UA_StatusCode
  373. UA_Server_addObjectTypeNode_begin(UA_Server *server,
  374. const UA_NodeId requestedNewNodeId,
  375. const UA_QualifiedName browseName,
  376. const UA_ObjectTypeAttributes attr,
  377. UA_NodeId *outNewNodeId) {
  378. return __UA_Server_addNode_begin(server, UA_NODECLASS_OBJECTTYPE,
  379. &requestedNewNodeId,
  380. &browseName, (const UA_NodeAttributes*)&attr,
  381. &UA_TYPES[UA_TYPES_OBJECTTYPEATTRIBUTES],
  382. outNewNodeId);
  383. }
  384. #ifdef UA_ENABLE_METHODCALLS
  385. UA_StatusCode
  386. UA_Server_addMethodNode_begin(UA_Server *server, const UA_NodeId requestedNewNodeId,
  387. const UA_QualifiedName browseName,
  388. const UA_MethodAttributes attr, UA_MethodCallback method,
  389. void *handle, UA_NodeId *outNewNodeId);
  390. UA_StatusCode
  391. UA_Server_addMethodNode_finish(UA_Server *server, const UA_NodeId nodeId,
  392. const UA_NodeId parentNodeId,
  393. const UA_NodeId referenceTypeId,
  394. size_t inputArgumentsSize,
  395. const UA_Argument* inputArguments,
  396. size_t outputArgumentsSize,
  397. const UA_Argument* outputArguments);
  398. #endif
  399. /**********************/
  400. /* Create Namespace 0 */
  401. /**********************/
  402. #ifndef UA_ENABLE_GENERATE_NAMESPACE0
  403. void UA_Server_createNS0(UA_Server *server);
  404. #endif
  405. #ifdef __cplusplus
  406. } // extern "C"
  407. #endif
  408. #endif /* UA_SERVER_INTERNAL_H_ */