ua_server.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  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. *
  5. * Copyright 2014-2018 (c) Fraunhofer IOSB (Author: Julius Pfrommer)
  6. * Copyright 2014-2017 (c) Florian Palm
  7. * Copyright 2015-2016 (c) Sten Grüner
  8. * Copyright 2015-2016 (c) Chris Iatrou
  9. * Copyright 2015 (c) LEvertz
  10. * Copyright 2015-2016 (c) Oleksiy Vasylyev
  11. * Copyright 2016 (c) Julian Grothoff
  12. * Copyright 2016-2017 (c) Stefan Profanter, fortiss GmbH
  13. * Copyright 2016 (c) Lorenz Haas
  14. * Copyright 2017 (c) frax2222
  15. * Copyright 2017 (c) Mark Giraud, Fraunhofer IOSB
  16. */
  17. #include "ua_types.h"
  18. #include "ua_server_internal.h"
  19. #ifdef UA_ENABLE_GENERATE_NAMESPACE0
  20. #include "ua_namespaceinit_generated.h"
  21. #endif
  22. /**********************/
  23. /* Namespace Handling */
  24. /**********************/
  25. UA_UInt16 addNamespace(UA_Server *server, const UA_String name) {
  26. /* Check if the namespace already exists in the server's namespace array */
  27. for(UA_UInt16 i = 0; i < server->namespacesSize; ++i) {
  28. if(UA_String_equal(&name, &server->namespaces[i]))
  29. return i;
  30. }
  31. /* Make the array bigger */
  32. UA_String *newNS = (UA_String*)UA_realloc(server->namespaces,
  33. sizeof(UA_String) * (server->namespacesSize + 1));
  34. if(!newNS)
  35. return 0;
  36. server->namespaces = newNS;
  37. /* Copy the namespace string */
  38. UA_StatusCode retval = UA_String_copy(&name, &server->namespaces[server->namespacesSize]);
  39. if(retval != UA_STATUSCODE_GOOD)
  40. return 0;
  41. /* Announce the change (otherwise, the array appears unchanged) */
  42. ++server->namespacesSize;
  43. return (UA_UInt16)(server->namespacesSize - 1);
  44. }
  45. UA_UInt16 UA_Server_addNamespace(UA_Server *server, const char* name) {
  46. /* Override const attribute to get string (dirty hack) */
  47. UA_String nameString;
  48. nameString.length = strlen(name);
  49. nameString.data = (UA_Byte*)(uintptr_t)name;
  50. return addNamespace(server, nameString);
  51. }
  52. UA_StatusCode
  53. UA_Server_forEachChildNodeCall(UA_Server *server, UA_NodeId parentNodeId,
  54. UA_NodeIteratorCallback callback, void *handle) {
  55. const UA_Node *parent =
  56. server->config.nodestore.getNode(server->config.nodestore.context,
  57. &parentNodeId);
  58. if(!parent)
  59. return UA_STATUSCODE_BADNODEIDINVALID;
  60. /* TODO: We need to do an ugly copy of the references array since users may
  61. * delete references from within the callback. In single-threaded mode this
  62. * changes the same node we point at here. In multi-threaded mode, this
  63. * creates a new copy as nodes are truly immutable.
  64. * The callback could remove a node via the regular public API.
  65. * This can remove a member of the nodes-array we iterate over...
  66. * */
  67. UA_Node *parentCopy = UA_Node_copy_alloc(parent);
  68. if(!parentCopy) {
  69. server->config.nodestore.releaseNode(server->config.nodestore.context, parent);
  70. return UA_STATUSCODE_BADUNEXPECTEDERROR;
  71. }
  72. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  73. for(size_t i = parentCopy->referencesSize; i > 0; --i) {
  74. UA_NodeReferenceKind *ref = &parentCopy->references[i - 1];
  75. for(size_t j = 0; j<ref->targetIdsSize; j++)
  76. retval |= callback(ref->targetIds[j].nodeId, ref->isInverse,
  77. ref->referenceTypeId, handle);
  78. }
  79. UA_Node_deleteMembers(parentCopy);
  80. UA_free(parentCopy);
  81. server->config.nodestore.releaseNode(server->config.nodestore.context, parent);
  82. return retval;
  83. }
  84. /********************/
  85. /* Server Lifecycle */
  86. /********************/
  87. /* The server needs to be stopped before it can be deleted */
  88. void UA_Server_delete(UA_Server *server) {
  89. /* Delete all internal data */
  90. UA_SecureChannelManager_deleteMembers(&server->secureChannelManager);
  91. UA_SessionManager_deleteMembers(&server->sessionManager);
  92. UA_Array_delete(server->namespaces, server->namespacesSize, &UA_TYPES[UA_TYPES_STRING]);
  93. #ifdef UA_ENABLE_PUBSUB
  94. UA_PubSubManager_delete(server, &server->pubSubManager);
  95. #endif
  96. #ifdef UA_ENABLE_DISCOVERY
  97. registeredServer_list_entry *rs, *rs_tmp;
  98. LIST_FOREACH_SAFE(rs, &server->registeredServers, pointers, rs_tmp) {
  99. LIST_REMOVE(rs, pointers);
  100. UA_RegisteredServer_deleteMembers(&rs->registeredServer);
  101. UA_free(rs);
  102. }
  103. periodicServerRegisterCallback_entry *ps, *ps_tmp;
  104. LIST_FOREACH_SAFE(ps, &server->periodicServerRegisterCallbacks, pointers, ps_tmp) {
  105. LIST_REMOVE(ps, pointers);
  106. UA_free(ps->callback);
  107. UA_free(ps);
  108. }
  109. # ifdef UA_ENABLE_DISCOVERY_MULTICAST
  110. if(server->config.applicationDescription.applicationType == UA_APPLICATIONTYPE_DISCOVERYSERVER)
  111. destroyMulticastDiscoveryServer(server);
  112. serverOnNetwork_list_entry *son, *son_tmp;
  113. LIST_FOREACH_SAFE(son, &server->serverOnNetwork, pointers, son_tmp) {
  114. LIST_REMOVE(son, pointers);
  115. UA_ServerOnNetwork_deleteMembers(&son->serverOnNetwork);
  116. if(son->pathTmp)
  117. UA_free(son->pathTmp);
  118. UA_free(son);
  119. }
  120. for(size_t i = 0; i < SERVER_ON_NETWORK_HASH_PRIME; i++) {
  121. serverOnNetwork_hash_entry* currHash = server->serverOnNetworkHash[i];
  122. while(currHash) {
  123. serverOnNetwork_hash_entry* nextHash = currHash->next;
  124. UA_free(currHash);
  125. currHash = nextHash;
  126. }
  127. }
  128. # endif
  129. #endif
  130. #ifdef UA_ENABLE_MULTITHREADING
  131. /* Process new delayed callbacks from the cleanup */
  132. UA_Server_cleanupDispatchQueue(server);
  133. pthread_mutex_destroy(&server->dispatchQueue_accessMutex);
  134. pthread_cond_destroy(&server->dispatchQueue_condition);
  135. pthread_mutex_destroy(&server->dispatchQueue_conditionMutex);
  136. #else
  137. /* Process new delayed callbacks from the cleanup */
  138. UA_Server_cleanupDelayedCallbacks(server);
  139. #endif
  140. /* Delete the timed work */
  141. UA_Timer_deleteMembers(&server->timer);
  142. /* Delete the server itself */
  143. UA_free(server);
  144. }
  145. /* Recurring cleanup. Removing unused and timed-out channels and sessions */
  146. static void
  147. UA_Server_cleanup(UA_Server *server, void *_) {
  148. UA_DateTime nowMonotonic = UA_DateTime_nowMonotonic();
  149. UA_SessionManager_cleanupTimedOut(&server->sessionManager, nowMonotonic);
  150. UA_SecureChannelManager_cleanupTimedOut(&server->secureChannelManager, nowMonotonic);
  151. #ifdef UA_ENABLE_DISCOVERY
  152. UA_Discovery_cleanupTimedOut(server, nowMonotonic);
  153. #endif
  154. }
  155. /********************/
  156. /* Server Lifecycle */
  157. /********************/
  158. UA_Server *
  159. UA_Server_new(const UA_ServerConfig *config) {
  160. /* A config is required */
  161. if(!config)
  162. return NULL;
  163. /* At least one endpoint has to be configured */
  164. if(config->endpointsSize == 0) {
  165. UA_LOG_FATAL(config->logger, UA_LOGCATEGORY_SERVER,
  166. "There has to be at least one endpoint.");
  167. return NULL;
  168. }
  169. /* Allocate the server */
  170. UA_Server *server = (UA_Server *)UA_calloc(1, sizeof(UA_Server));
  171. if(!server)
  172. return NULL;
  173. /* Set the config */
  174. server->config = *config;
  175. /* Init start time to zero, the actual start time will be sampled in
  176. * UA_Server_run_startup() */
  177. server->startTime = 0;
  178. /* Set a seed for non-cyptographic randomness */
  179. #ifndef UA_ENABLE_DETERMINISTIC_RNG
  180. UA_random_seed((UA_UInt64)UA_DateTime_now());
  181. #endif
  182. /* Initialize the handling of repeated callbacks */
  183. UA_Timer_init(&server->timer);
  184. /* Initialized the linked list for delayed callbacks */
  185. #ifndef UA_ENABLE_MULTITHREADING
  186. SLIST_INIT(&server->delayedCallbacks);
  187. #endif
  188. /* Initialized the dispatch queue for worker threads */
  189. #ifdef UA_ENABLE_MULTITHREADING
  190. SIMPLEQ_INIT(&server->dispatchQueue);
  191. #endif
  192. /* Create Namespaces 0 and 1 */
  193. server->namespaces = (UA_String *)UA_Array_new(2, &UA_TYPES[UA_TYPES_STRING]);
  194. server->namespaces[0] = UA_STRING_ALLOC("http://opcfoundation.org/UA/");
  195. UA_String_copy(&server->config.applicationDescription.applicationUri, &server->namespaces[1]);
  196. server->namespacesSize = 2;
  197. /* Initialized SecureChannel and Session managers */
  198. UA_SecureChannelManager_init(&server->secureChannelManager, server);
  199. UA_SessionManager_init(&server->sessionManager, server);
  200. /* Add a regular callback for cleanup and maintenance */
  201. UA_Server_addRepeatedCallback(server, (UA_ServerCallback)UA_Server_cleanup, NULL,
  202. 10000, NULL);
  203. /* Initialized discovery database */
  204. #ifdef UA_ENABLE_DISCOVERY
  205. LIST_INIT(&server->registeredServers);
  206. server->registeredServersSize = 0;
  207. LIST_INIT(&server->periodicServerRegisterCallbacks);
  208. server->registerServerCallback = NULL;
  209. server->registerServerCallbackData = NULL;
  210. #endif
  211. /* Initialize multicast discovery */
  212. #if defined(UA_ENABLE_DISCOVERY) && defined(UA_ENABLE_DISCOVERY_MULTICAST)
  213. server->mdnsDaemon = NULL;
  214. #ifdef _WIN32
  215. server->mdnsSocket = INVALID_SOCKET;
  216. #else
  217. server->mdnsSocket = -1;
  218. #endif
  219. server->mdnsMainSrvAdded = UA_FALSE;
  220. if(server->config.applicationDescription.applicationType == UA_APPLICATIONTYPE_DISCOVERYSERVER)
  221. initMulticastDiscoveryServer(server);
  222. LIST_INIT(&server->serverOnNetwork);
  223. server->serverOnNetworkSize = 0;
  224. server->serverOnNetworkRecordIdCounter = 0;
  225. server->serverOnNetworkRecordIdLastReset = UA_DateTime_now();
  226. memset(server->serverOnNetworkHash, 0,
  227. sizeof(struct serverOnNetwork_hash_entry*) * SERVER_ON_NETWORK_HASH_PRIME);
  228. server->serverOnNetworkCallback = NULL;
  229. server->serverOnNetworkCallbackData = NULL;
  230. #endif
  231. /* Initialize namespace 0*/
  232. UA_StatusCode retVal = UA_Server_initNS0(server);
  233. if(retVal != UA_STATUSCODE_GOOD) {
  234. UA_LOG_ERROR(config->logger, UA_LOGCATEGORY_SERVER,
  235. "Namespace 0 could not be bootstrapped with error %s. "
  236. "Shutting down the server.",
  237. UA_StatusCode_name(retVal));
  238. UA_Server_delete(server);
  239. return NULL;
  240. }
  241. return server;
  242. }
  243. /*****************/
  244. /* Repeated Jobs */
  245. /*****************/
  246. UA_StatusCode
  247. UA_Server_addRepeatedCallback(UA_Server *server, UA_ServerCallback callback,
  248. void *data, UA_UInt32 interval,
  249. UA_UInt64 *callbackId) {
  250. return UA_Timer_addRepeatedCallback(&server->timer, (UA_TimerCallback)callback,
  251. data, interval, callbackId);
  252. }
  253. UA_StatusCode
  254. UA_Server_changeRepeatedCallbackInterval(UA_Server *server, UA_UInt64 callbackId,
  255. UA_UInt32 interval) {
  256. return UA_Timer_changeRepeatedCallbackInterval(&server->timer, callbackId, interval);
  257. }
  258. UA_StatusCode
  259. UA_Server_removeRepeatedCallback(UA_Server *server, UA_UInt64 callbackId) {
  260. return UA_Timer_removeRepeatedCallback(&server->timer, callbackId);
  261. }