ua_server_internal.h 17 KB

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