ua_server_worker.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593
  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_util.h"
  5. #include "ua_server_internal.h"
  6. /**
  7. * There are four types of job execution:
  8. *
  9. * 1. Normal jobs (dispatched to worker threads if multithreading is activated)
  10. *
  11. * 2. Repeated jobs with a repetition interval (dispatched to worker threads)
  12. *
  13. * 3. Mainloop jobs are executed (once) from the mainloop and not in the worker threads. The server
  14. * contains a stack structure where all threads can add mainloop jobs for the next mainloop
  15. * iteration. This is used e.g. to trigger adding and removing repeated jobs without blocking the
  16. * mainloop.
  17. *
  18. * 4. Delayed jobs are executed once in a worker thread. But only when all normal jobs that were
  19. * dispatched earlier have been executed. This is achieved by a counter in the worker threads. We
  20. * compute from the counter if all previous jobs have finished. The delay can be very long, since we
  21. * try to not interfere too much with normal execution. A use case is to eventually free obsolete
  22. * structures that _could_ still be accessed from concurrent threads.
  23. *
  24. * - Remove the entry from the list
  25. * - mark it as "dead" with an atomic operation
  26. * - add a delayed job that frees the memory when all concurrent operations have completed
  27. *
  28. * This approach to concurrently accessible memory is known as epoch based reclamation [1]. According to
  29. * [2], it performs competitively well on many-core systems. Our version of EBR does however not require
  30. * a global epoch. Instead, every worker thread has its own epoch counter that we observe for changes.
  31. *
  32. * [1] Fraser, K. 2003. Practical lock freedom. Ph.D. thesis. Computer Laboratory, University of Cambridge.
  33. * [2] Hart, T. E., McKenney, P. E., Brown, A. D., & Walpole, J. (2007). Performance of memory reclamation
  34. * for lockless synchronization. Journal of Parallel and Distributed Computing, 67(12), 1270-1285.
  35. *
  36. * Future Plans: Use work-stealing to load-balance between cores.
  37. * [3] Le, Nhat Minh, et al. "Correct and efficient work-stealing for weak
  38. * memory models." ACM SIGPLAN Notices. Vol. 48. No. 8. ACM, 2013.
  39. */
  40. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  41. # ifndef _WIN32
  42. # include <unistd.h> // gethostname
  43. # endif
  44. #endif
  45. void
  46. UA_Server_processJob(UA_Server *server, UA_Job *job) {
  47. UA_ASSERT_RCU_UNLOCKED();
  48. UA_RCU_LOCK();
  49. switch(job->type) {
  50. case UA_JOBTYPE_NOTHING:
  51. break;
  52. case UA_JOBTYPE_DETACHCONNECTION:
  53. UA_Connection_detachSecureChannel(job->job.closeConnection);
  54. break;
  55. case UA_JOBTYPE_BINARYMESSAGE_NETWORKLAYER:
  56. {
  57. UA_Server_processBinaryMessage(server, job->job.binaryMessage.connection,
  58. &job->job.binaryMessage.message);
  59. UA_Connection *connection = job->job.binaryMessage.connection;
  60. connection->releaseRecvBuffer(connection, &job->job.binaryMessage.message);
  61. }
  62. break;
  63. case UA_JOBTYPE_BINARYMESSAGE_ALLOCATED:
  64. UA_Server_processBinaryMessage(server, job->job.binaryMessage.connection,
  65. &job->job.binaryMessage.message);
  66. UA_ByteString_deleteMembers(&job->job.binaryMessage.message);
  67. break;
  68. case UA_JOBTYPE_METHODCALL:
  69. case UA_JOBTYPE_METHODCALL_DELAYED:
  70. job->job.methodCall.method(server, job->job.methodCall.data);
  71. break;
  72. default:
  73. UA_LOG_WARNING(server->config.logger, UA_LOGCATEGORY_SERVER,
  74. "Trying to execute a job of unknown type");
  75. break;
  76. }
  77. UA_RCU_UNLOCK();
  78. }
  79. /*******************************/
  80. /* Worker Threads and Dispatch */
  81. /*******************************/
  82. #ifdef UA_ENABLE_MULTITHREADING
  83. struct DispatchJob {
  84. struct cds_wfcq_node node; // node for the queue
  85. UA_Job job;
  86. };
  87. static void *
  88. workerLoop(UA_Worker *worker) {
  89. UA_Server *server = worker->server;
  90. UA_UInt32 *counter = &worker->counter;
  91. volatile UA_Boolean *running = &worker->running;
  92. /* Initialize the (thread local) random seed with the ram address of worker */
  93. UA_random_seed((uintptr_t)worker);
  94. rcu_register_thread();
  95. while(*running) {
  96. struct DispatchJob *dj = (struct DispatchJob*)
  97. cds_wfcq_dequeue_blocking(&server->dispatchQueue_head, &server->dispatchQueue_tail);
  98. if(dj) {
  99. UA_Server_processJob(server, &dj->job);
  100. UA_free(dj);
  101. } else {
  102. /* nothing to do. sleep until a job is dispatched (and wakes up all worker threads) */
  103. pthread_mutex_lock(&server->dispatchQueue_mutex);
  104. pthread_cond_wait(&server->dispatchQueue_condition, &server->dispatchQueue_mutex);
  105. pthread_mutex_unlock(&server->dispatchQueue_mutex);
  106. }
  107. UA_atomic_add(counter, 1);
  108. }
  109. UA_ASSERT_RCU_UNLOCKED();
  110. rcu_barrier(); // wait for all scheduled call_rcu work to complete
  111. rcu_unregister_thread();
  112. UA_LOG_DEBUG(server->config.logger, UA_LOGCATEGORY_SERVER, "Worker shut down");
  113. return NULL;
  114. }
  115. void
  116. UA_Server_dispatchJob(UA_Server *server, const UA_Job *job) {
  117. struct DispatchJob *dj = UA_malloc(sizeof(struct DispatchJob));
  118. // todo: check malloc
  119. dj->job = *job;
  120. cds_wfcq_node_init(&dj->node);
  121. cds_wfcq_enqueue(&server->dispatchQueue_head, &server->dispatchQueue_tail, &dj->node);
  122. }
  123. static void
  124. emptyDispatchQueue(UA_Server *server) {
  125. while(!cds_wfcq_empty(&server->dispatchQueue_head, &server->dispatchQueue_tail)) {
  126. struct DispatchJob *dj = (struct DispatchJob*)
  127. cds_wfcq_dequeue_blocking(&server->dispatchQueue_head, &server->dispatchQueue_tail);
  128. UA_Server_processJob(server, &dj->job);
  129. UA_free(dj);
  130. }
  131. }
  132. #endif
  133. /****************/
  134. /* Delayed Jobs */
  135. /****************/
  136. #ifndef UA_ENABLE_MULTITHREADING
  137. typedef struct UA_DelayedJob {
  138. SLIST_ENTRY(UA_DelayedJob) next;
  139. UA_Job job;
  140. } UA_DelayedJob;
  141. UA_StatusCode
  142. UA_Server_delayedCallback(UA_Server *server, UA_ServerCallback callback, void *data) {
  143. UA_DelayedJob *dj = (UA_DelayedJob *)UA_malloc(sizeof(UA_DelayedJob));
  144. if(!dj)
  145. return UA_STATUSCODE_BADOUTOFMEMORY;
  146. dj->job.type = UA_JOBTYPE_METHODCALL;
  147. dj->job.job.methodCall.data = data;
  148. dj->job.job.methodCall.method = callback;
  149. SLIST_INSERT_HEAD(&server->delayedCallbacks, dj, next);
  150. return UA_STATUSCODE_GOOD;
  151. }
  152. static void
  153. processDelayedCallbacks(UA_Server *server) {
  154. UA_DelayedJob *dj, *dj_tmp;
  155. SLIST_FOREACH_SAFE(dj, &server->delayedCallbacks, next, dj_tmp) {
  156. SLIST_REMOVE(&server->delayedCallbacks, dj, UA_DelayedJob, next);
  157. UA_Server_processJob(server, &dj->job);
  158. UA_free(dj);
  159. }
  160. }
  161. #else
  162. #define DELAYEDJOBSSIZE 100 // Collect delayed jobs until we have DELAYEDWORKSIZE items
  163. struct DelayedJobs {
  164. struct DelayedJobs *next;
  165. UA_UInt32 *workerCounters; // initially NULL until the counter are set
  166. UA_UInt32 jobsCount; // the size of the array is DELAYEDJOBSSIZE, the count may be less
  167. UA_Job jobs[DELAYEDJOBSSIZE]; // when it runs full, a new delayedJobs entry is created
  168. };
  169. /* Dispatched as an ordinary job when the DelayedJobs list is full */
  170. static void getCounters(UA_Server *server, struct DelayedJobs *delayed) {
  171. UA_UInt32 *counters = UA_malloc(server->config.nThreads * sizeof(UA_UInt32));
  172. for(UA_UInt16 i = 0; i < server->config.nThreads; ++i)
  173. counters[i] = server->workers[i].counter;
  174. delayed->workerCounters = counters;
  175. }
  176. /* Call from the main thread only. This is the only function that modifies */
  177. /* server->delayedWork. processDelayedWorkQueue modifies the "next" (after the */
  178. /* head). */
  179. static void addDelayedJob(UA_Server *server, UA_Job *job) {
  180. struct DelayedJobs *dj = server->delayedJobs;
  181. if(!dj || dj->jobsCount >= DELAYEDJOBSSIZE) {
  182. /* create a new DelayedJobs and add it to the linked list */
  183. dj = UA_malloc(sizeof(struct DelayedJobs));
  184. if(!dj) {
  185. UA_LOG_ERROR(server->config.logger, UA_LOGCATEGORY_SERVER,
  186. "Not enough memory to add a delayed job");
  187. return;
  188. }
  189. dj->jobsCount = 0;
  190. dj->workerCounters = NULL;
  191. dj->next = server->delayedJobs;
  192. server->delayedJobs = dj;
  193. /* dispatch a method that sets the counter for the full list that comes afterwards */
  194. if(dj->next) {
  195. UA_Job setCounter = (UA_Job){
  196. .type = UA_JOBTYPE_METHODCALL, .job.methodCall =
  197. {.method = (void (*)(UA_Server*, void*))getCounters, .data = dj->next}};
  198. UA_Server_dispatchJob(server, &setCounter);
  199. }
  200. }
  201. dj->jobs[dj->jobsCount] = *job;
  202. ++dj->jobsCount;
  203. }
  204. static void
  205. delayed_free(UA_Server *server, void *data) {
  206. UA_free(data);
  207. }
  208. UA_StatusCode UA_Server_delayedFree(UA_Server *server, void *data) {
  209. return UA_Server_delayedCallback(server, delayed_free, data);
  210. }
  211. static void
  212. addDelayedJobAsync(UA_Server *server, UA_Job *job) {
  213. addDelayedJob(server, job);
  214. UA_free(job);
  215. }
  216. UA_StatusCode
  217. UA_Server_delayedCallback(UA_Server *server, UA_ServerCallback callback, void *data) {
  218. UA_Job *j = UA_malloc(sizeof(UA_Job));
  219. if(!j)
  220. return UA_STATUSCODE_BADOUTOFMEMORY;
  221. j->type = UA_JOBTYPE_METHODCALL;
  222. j->job.methodCall.data = data;
  223. j->job.methodCall.method = callback;
  224. struct MainLoopJob *mlw = UA_malloc(sizeof(struct MainLoopJob));
  225. mlw->job = (UA_Job) {.type = UA_JOBTYPE_METHODCALL, .job.methodCall =
  226. {.data = j, .method = (UA_ServerCallback)addDelayedJobAsync}};
  227. cds_lfs_push(&server->mainLoopJobs, &mlw->node);
  228. return UA_STATUSCODE_GOOD;
  229. }
  230. /* Find out which delayed jobs can be executed now */
  231. static void
  232. dispatchDelayedJobs(UA_Server *server, void *_) {
  233. /* start at the second */
  234. struct DelayedJobs *dw = server->delayedJobs, *beforedw = dw;
  235. if(dw)
  236. dw = dw->next;
  237. /* find the first delayedwork where the counters have been set and have moved */
  238. while(dw) {
  239. if(!dw->workerCounters) {
  240. beforedw = dw;
  241. dw = dw->next;
  242. continue;
  243. }
  244. UA_Boolean allMoved = true;
  245. for(size_t i = 0; i < server->config.nThreads; ++i) {
  246. if(dw->workerCounters[i] == server->workers[i].counter) {
  247. allMoved = false;
  248. break;
  249. }
  250. }
  251. if(allMoved)
  252. break;
  253. beforedw = dw;
  254. dw = dw->next;
  255. }
  256. /* process and free all delayed jobs from here on */
  257. while(dw) {
  258. for(size_t i = 0; i < dw->jobsCount; ++i)
  259. UA_Server_processJob(server, &dw->jobs[i]);
  260. struct DelayedJobs *next = UA_atomic_xchg((void**)&beforedw->next, NULL);
  261. UA_free(dw->workerCounters);
  262. UA_free(dw);
  263. dw = next;
  264. }
  265. }
  266. #endif
  267. /********************/
  268. /* Main Server Loop */
  269. /********************/
  270. #ifdef UA_ENABLE_MULTITHREADING
  271. static void processMainLoopJobs(UA_Server *server) {
  272. /* no synchronization required if we only use push and pop_all */
  273. struct cds_lfs_head *head = __cds_lfs_pop_all(&server->mainLoopJobs);
  274. if(!head)
  275. return;
  276. struct MainLoopJob *mlw = (struct MainLoopJob*)&head->node;
  277. struct MainLoopJob *next;
  278. do {
  279. UA_Server_processJob(server, &mlw->job);
  280. next = (struct MainLoopJob*)mlw->node.next;
  281. UA_free(mlw);
  282. //cppcheck-suppress unreadVariable
  283. } while((mlw = next));
  284. }
  285. #endif
  286. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  287. static UA_StatusCode
  288. UA_Server_addMdnsRecordForNetworkLayer(UA_Server *server, const char* appName, const UA_ServerNetworkLayer* nl) {
  289. UA_UInt16 port = 0;
  290. char hostname[256]; hostname[0] = '\0';
  291. const char *path;
  292. {
  293. char* uri = (char *)malloc(sizeof(char) * nl->discoveryUrl.length + 1);
  294. strncpy(uri, (char*) nl->discoveryUrl.data, nl->discoveryUrl.length);
  295. uri[nl->discoveryUrl.length] = '\0';
  296. UA_StatusCode retval;
  297. if ((retval = UA_EndpointUrl_split(uri, hostname, &port, &path)) != UA_STATUSCODE_GOOD) {
  298. if (retval == UA_STATUSCODE_BADOUTOFRANGE)
  299. UA_LOG_WARNING(server->config.logger, UA_LOGCATEGORY_NETWORK, "Server url is invalid", uri);
  300. else if (retval == UA_STATUSCODE_BADATTRIBUTEIDINVALID)
  301. UA_LOG_WARNING(server->config.logger, UA_LOGCATEGORY_NETWORK, "Server url '%s' does not begin with opc.tcp://", uri);
  302. free(uri);
  303. return UA_STATUSCODE_BADINVALIDARGUMENT;
  304. }
  305. free(uri);
  306. }
  307. UA_Discovery_addRecord(server, appName, hostname, port, path != NULL && strlen(path) ? path : "", UA_DISCOVERY_TCP, UA_TRUE,
  308. server->config.serverCapabilities, &server->config.serverCapabilitiesSize);
  309. return UA_STATUSCODE_GOOD;
  310. }
  311. #endif //UA_ENABLE_DISCOVERY_MULTICAST
  312. UA_StatusCode UA_Server_run_startup(UA_Server *server) {
  313. #ifdef UA_ENABLE_MULTITHREADING
  314. /* Spin up the worker threads */
  315. UA_LOG_INFO(server->config.logger, UA_LOGCATEGORY_SERVER,
  316. "Spinning up %u worker thread(s)", server->config.nThreads);
  317. pthread_cond_init(&server->dispatchQueue_condition, 0);
  318. pthread_mutex_init(&server->dispatchQueue_mutex, 0);
  319. server->workers = UA_malloc(server->config.nThreads * sizeof(UA_Worker));
  320. if(!server->workers)
  321. return UA_STATUSCODE_BADOUTOFMEMORY;
  322. for(size_t i = 0; i < server->config.nThreads; ++i) {
  323. UA_Worker *worker = &server->workers[i];
  324. worker->server = server;
  325. worker->counter = 0;
  326. worker->running = true;
  327. pthread_create(&worker->thr, NULL, (void* (*)(void*))workerLoop, worker);
  328. }
  329. /* Try to execute delayed callbacks every 10 sec */
  330. UA_Job processDelayed = {.type = UA_JOBTYPE_METHODCALL,
  331. .job.methodCall = {.method = dispatchDelayedJobs, .data = NULL} };
  332. UA_RepeatedJobsList_addRepeatedJob(&server->repeatedJobs, processDelayed, 10000, NULL);
  333. #endif
  334. /* Start the networklayers */
  335. UA_StatusCode result = UA_STATUSCODE_GOOD;
  336. for(size_t i = 0; i < server->config.networkLayersSize; ++i) {
  337. UA_ServerNetworkLayer *nl = &server->config.networkLayers[i];
  338. result |= nl->start(nl, server->config.logger);
  339. }
  340. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  341. if (server->config.applicationDescription.applicationType == UA_APPLICATIONTYPE_DISCOVERYSERVER) {
  342. char *appName = (char *)malloc(server->config.mdnsServerName.length +1);
  343. memcpy(appName, server->config.mdnsServerName.data, server->config.mdnsServerName.length);
  344. appName[server->config.mdnsServerName.length] = '\0';
  345. for(size_t i = 0; i < server->config.networkLayersSize; i++) {
  346. UA_StatusCode retVal = UA_Server_addMdnsRecordForNetworkLayer(
  347. server, appName, &server->config.networkLayers[i]);
  348. if (UA_STATUSCODE_GOOD != retVal) {
  349. free(appName);
  350. return retVal;
  351. }
  352. }
  353. free(appName);
  354. // find any other server on the net
  355. UA_Discovery_multicastQuery(server);
  356. # ifdef UA_ENABLE_MULTITHREADING
  357. UA_Discovery_multicastListenStart(server);
  358. # endif
  359. }
  360. #endif //UA_ENABLE_DISCOVERY_MULTICAST
  361. return result;
  362. }
  363. /* completeMessages is run synchronous on the jobs returned from the network
  364. layer, so that the order for processing TCP packets is never mixed up. */
  365. static void
  366. completeMessages(UA_Server *server, UA_Job *job) {
  367. UA_Boolean realloced = UA_FALSE;
  368. UA_StatusCode retval = UA_Connection_completeMessages(job->job.binaryMessage.connection,
  369. &job->job.binaryMessage.message, &realloced);
  370. if(retval != UA_STATUSCODE_GOOD) {
  371. if(retval == UA_STATUSCODE_BADOUTOFMEMORY)
  372. UA_LOG_WARNING(server->config.logger, UA_LOGCATEGORY_NETWORK,
  373. "Lost message(s) from Connection %i as memory could not be allocated",
  374. job->job.binaryMessage.connection->sockfd);
  375. else if(retval != UA_STATUSCODE_GOOD)
  376. UA_LOG_INFO(server->config.logger, UA_LOGCATEGORY_NETWORK,
  377. "Could not merge half-received messages on Connection %i with error 0x%08x",
  378. job->job.binaryMessage.connection->sockfd, retval);
  379. job->type = UA_JOBTYPE_NOTHING;
  380. return;
  381. }
  382. if(realloced)
  383. job->type = UA_JOBTYPE_BINARYMESSAGE_ALLOCATED;
  384. /* discard the job if message is empty - also no leak is possible here */
  385. if(job->job.binaryMessage.message.length == 0)
  386. job->type = UA_JOBTYPE_NOTHING;
  387. }
  388. UA_UInt16 UA_Server_run_iterate(UA_Server *server, UA_Boolean waitInternal) {
  389. #ifdef UA_ENABLE_MULTITHREADING
  390. /* Run work assigned for the main thread */
  391. processMainLoopJobs(server);
  392. #endif
  393. /* Process repeated work */
  394. UA_DateTime now = UA_DateTime_nowMonotonic();
  395. UA_Boolean dispatched = false; /* to wake up worker threads */
  396. UA_DateTime nextRepeated =
  397. UA_RepeatedJobsList_process(&server->repeatedJobs, now, &dispatched);
  398. UA_UInt16 timeout = 0;
  399. if(waitInternal)
  400. timeout = (UA_UInt16)((nextRepeated - now) / UA_MSEC_TO_DATETIME);
  401. /* Get work from the networklayer */
  402. for(size_t i = 0; i < server->config.networkLayersSize; ++i) {
  403. UA_ServerNetworkLayer *nl = &server->config.networkLayers[i];
  404. UA_Job *jobs = NULL;
  405. size_t jobsSize;
  406. /* only the last networklayer waits on the tieout */
  407. if(i == server->config.networkLayersSize-1)
  408. jobsSize = nl->getJobs(nl, &jobs, timeout);
  409. else
  410. jobsSize = nl->getJobs(nl, &jobs, 0);
  411. for(size_t k = 0; k < jobsSize; ++k) {
  412. #ifdef UA_ENABLE_MULTITHREADING
  413. /* Filter out delayed work */
  414. if(jobs[k].type == UA_JOBTYPE_METHODCALL_DELAYED) {
  415. addDelayedJob(server, &jobs[k]);
  416. jobs[k].type = UA_JOBTYPE_NOTHING;
  417. continue;
  418. }
  419. #endif
  420. /* Merge half-received messages */
  421. if(jobs[k].type == UA_JOBTYPE_BINARYMESSAGE_NETWORKLAYER)
  422. completeMessages(server, &jobs[k]);
  423. }
  424. /* Dispatch/process jobs */
  425. for(size_t j = 0; j < jobsSize; ++j) {
  426. #ifdef UA_ENABLE_MULTITHREADING
  427. UA_Server_dispatchJob(server, &jobs[j]);
  428. dispatched = true;
  429. #else
  430. UA_Server_processJob(server, &jobs[j]);
  431. #endif
  432. }
  433. /* Clean up jobs list */
  434. if(jobsSize > 0)
  435. UA_free(jobs);
  436. }
  437. #ifdef UA_ENABLE_MULTITHREADING
  438. /* Wake up worker threads */
  439. if(dispatched)
  440. pthread_cond_broadcast(&server->dispatchQueue_condition);
  441. #else
  442. processDelayedCallbacks(server);
  443. #endif
  444. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  445. # ifndef UA_ENABLE_MULTITHREADING
  446. if (server->config.applicationDescription.applicationType == UA_APPLICATIONTYPE_DISCOVERYSERVER) {
  447. UA_DateTime multicastNextRepeat;
  448. UA_DateTime_init(&multicastNextRepeat);
  449. //TODO multicastNextRepeat does not consider new input data (requests) on the socket. It will be handled on the next call.
  450. // if needed, we need to use select with timeout on the multicast socket server->mdnsSocket (see example in mdnsd library) on higher level.
  451. if (UA_Discovery_multicastIterate(server, &multicastNextRepeat, UA_TRUE)) {
  452. if (multicastNextRepeat < nextRepeated) {
  453. UA_DateTime_copy(&multicastNextRepeat, &nextRepeated);
  454. }
  455. }
  456. }
  457. # endif
  458. #endif
  459. now = UA_DateTime_nowMonotonic();
  460. timeout = 0;
  461. if(nextRepeated > now)
  462. timeout = (UA_UInt16)((nextRepeated - now) / UA_MSEC_TO_DATETIME);
  463. return timeout;
  464. }
  465. UA_StatusCode UA_Server_run_shutdown(UA_Server *server) {
  466. for(size_t i = 0; i < server->config.networkLayersSize; ++i) {
  467. UA_ServerNetworkLayer *nl = &server->config.networkLayers[i];
  468. UA_Job *stopJobs = NULL;
  469. size_t stopJobsSize = nl->stop(nl, &stopJobs);
  470. for(size_t j = 0; j < stopJobsSize; ++j)
  471. UA_Server_processJob(server, &stopJobs[j]);
  472. UA_free(stopJobs);
  473. }
  474. #ifdef UA_ENABLE_MULTITHREADING
  475. /* Ensure that run_shutdown can be called multiple times */
  476. if(server->workers) {
  477. UA_LOG_INFO(server->config.logger, UA_LOGCATEGORY_SERVER,
  478. "Shutting down %u worker thread(s)", server->config.nThreads);
  479. /* Wait for all worker threads to finish */
  480. for(size_t i = 0; i < server->config.nThreads; ++i)
  481. server->workers[i].running = false;
  482. pthread_cond_broadcast(&server->dispatchQueue_condition);
  483. for(size_t i = 0; i < server->config.nThreads; ++i)
  484. pthread_join(server->workers[i].thr, NULL);
  485. /* Free the worker structures */
  486. UA_free(server->workers);
  487. server->workers = NULL;
  488. }
  489. /* Manually finish the work still enqueued */
  490. emptyDispatchQueue(server);
  491. UA_ASSERT_RCU_UNLOCKED();
  492. rcu_barrier(); // wait for all scheduled call_rcu work to complete
  493. #else
  494. processDelayedCallbacks(server);
  495. #endif
  496. #ifdef UA_ENABLE_DISCOVERY_MULTICAST
  497. if (server->config.applicationDescription.applicationType == UA_APPLICATIONTYPE_DISCOVERYSERVER) {
  498. char* hostname = (char *)malloc(sizeof(char) * 256);
  499. if (gethostname(hostname, 255) == 0) {
  500. char *appName = (char *)malloc(server->config.mdnsServerName.length +1);
  501. memcpy(appName, server->config.mdnsServerName.data, server->config.mdnsServerName.length);
  502. appName[server->config.mdnsServerName.length] = '\0';
  503. UA_Discovery_removeRecord(server,appName, hostname, 4840, UA_TRUE);
  504. free(appName);
  505. } else {
  506. UA_LOG_ERROR(server->config.logger, UA_LOGCATEGORY_SERVER,
  507. "Could not get hostname for multicast discovery.");
  508. }
  509. free(hostname);
  510. # ifdef UA_ENABLE_MULTITHREADING
  511. UA_Discovery_multicastListenStop(server);
  512. # else
  513. // send out last package with TTL = 0
  514. UA_Discovery_multicastIterate(server, NULL, UA_FALSE);
  515. # endif
  516. }
  517. #endif
  518. return UA_STATUSCODE_GOOD;
  519. }
  520. UA_StatusCode UA_Server_run(UA_Server *server, volatile UA_Boolean *running) {
  521. UA_StatusCode retval = UA_Server_run_startup(server);
  522. if(retval != UA_STATUSCODE_GOOD)
  523. return retval;
  524. while(*running)
  525. UA_Server_run_iterate(server, true);
  526. return UA_Server_run_shutdown(server);
  527. }