ua_subscription.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  1. #include "ua_subscription.h"
  2. #include "ua_server_internal.h"
  3. #include "ua_types_encoding_binary.h"
  4. #include "ua_services.h"
  5. #include "ua_nodestore.h"
  6. #ifdef UA_ENABLE_SUBSCRIPTIONS /* conditional compilation */
  7. /*****************/
  8. /* MonitoredItem */
  9. /*****************/
  10. UA_MonitoredItem * UA_MonitoredItem_new() {
  11. UA_MonitoredItem *new = UA_malloc(sizeof(UA_MonitoredItem));
  12. new->subscription = NULL;
  13. new->currentQueueSize = 0;
  14. new->maxQueueSize = 0;
  15. new->monitoredItemType = UA_MONITOREDITEMTYPE_CHANGENOTIFY; /* currently hardcoded */
  16. new->timestampsToReturn = UA_TIMESTAMPSTORETURN_SOURCE;
  17. UA_String_init(&new->indexRange);
  18. TAILQ_INIT(&new->queue);
  19. UA_NodeId_init(&new->monitoredNodeId);
  20. new->lastSampledValue = UA_BYTESTRING_NULL;
  21. memset(&new->sampleJobGuid, 0, sizeof(UA_Guid));
  22. new->sampleJobIsRegistered = false;
  23. new->itemId = 0;
  24. return new;
  25. }
  26. void MonitoredItem_delete(UA_Server *server, UA_MonitoredItem *monitoredItem) {
  27. MonitoredItem_unregisterSampleJob(server, monitoredItem);
  28. /* clear the queued samples */
  29. MonitoredItem_queuedValue *val, *val_tmp;
  30. TAILQ_FOREACH_SAFE(val, &monitoredItem->queue, listEntry, val_tmp) {
  31. TAILQ_REMOVE(&monitoredItem->queue, val, listEntry);
  32. UA_DataValue_deleteMembers(&val->value);
  33. UA_free(val);
  34. }
  35. monitoredItem->currentQueueSize = 0;
  36. LIST_REMOVE(monitoredItem, listEntry);
  37. UA_String_deleteMembers(&monitoredItem->indexRange);
  38. UA_ByteString_deleteMembers(&monitoredItem->lastSampledValue);
  39. UA_NodeId_deleteMembers(&monitoredItem->monitoredNodeId);
  40. UA_free(monitoredItem);
  41. }
  42. void UA_MoniteredItem_SampleCallback(UA_Server *server, UA_MonitoredItem *monitoredItem) {
  43. UA_Subscription *sub = monitoredItem->subscription;
  44. if(monitoredItem->monitoredItemType != UA_MONITOREDITEMTYPE_CHANGENOTIFY) {
  45. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session,
  46. "Subscription %u | MonitoredItem %i | "
  47. "Cannot process a monitoreditem that is not "
  48. "a data change notification",
  49. sub->subscriptionID, monitoredItem->itemId);
  50. return;
  51. }
  52. MonitoredItem_queuedValue *newvalue = UA_malloc(sizeof(MonitoredItem_queuedValue));
  53. if(!newvalue) {
  54. UA_LOG_WARNING_SESSION(server->config.logger, sub->session,
  55. "Subscription %u | MonitoredItem %i | "
  56. "Skipped a sample due to lack of memory",
  57. sub->subscriptionID, monitoredItem->itemId);
  58. return;
  59. }
  60. UA_DataValue_init(&newvalue->value);
  61. newvalue->clientHandle = monitoredItem->clientHandle;
  62. /* Adjust timestampstoreturn to get source timestamp for triggering */
  63. UA_TimestampsToReturn ts = monitoredItem->timestampsToReturn;
  64. if(ts == UA_TIMESTAMPSTORETURN_SERVER)
  65. ts = UA_TIMESTAMPSTORETURN_BOTH;
  66. else if(ts == UA_TIMESTAMPSTORETURN_NEITHER)
  67. ts = UA_TIMESTAMPSTORETURN_SOURCE;
  68. /* Read the value */
  69. UA_ReadValueId rvid;
  70. UA_ReadValueId_init(&rvid);
  71. rvid.nodeId = monitoredItem->monitoredNodeId;
  72. rvid.attributeId = monitoredItem->attributeID;
  73. rvid.indexRange = monitoredItem->indexRange;
  74. Service_Read_single(server, sub->session, ts, &rvid, &newvalue->value);
  75. /* Apply Filter */
  76. UA_Boolean hasValue = newvalue->value.hasValue;
  77. UA_Boolean hasServerTimestamp = newvalue->value.hasServerTimestamp;
  78. UA_Boolean hasServerPicoseconds = newvalue->value.hasServerPicoseconds;
  79. UA_Boolean hasSourceTimestamp = newvalue->value.hasSourceTimestamp;
  80. UA_Boolean hasSourcePicoseconds = newvalue->value.hasSourcePicoseconds;
  81. newvalue->value.hasServerTimestamp = false;
  82. newvalue->value.hasServerPicoseconds = false;
  83. if(monitoredItem->trigger == UA_DATACHANGETRIGGER_STATUS)
  84. newvalue->value.hasValue = false;
  85. if(monitoredItem->trigger < UA_DATACHANGETRIGGER_STATUSVALUETIMESTAMP) {
  86. newvalue->value.hasSourceTimestamp = false;
  87. newvalue->value.hasSourcePicoseconds = false;
  88. }
  89. /* Encode the data for comparison */
  90. size_t binsize = UA_calcSizeBinary(&newvalue->value, &UA_TYPES[UA_TYPES_DATAVALUE]);
  91. UA_ByteString newValueAsByteString;
  92. UA_StatusCode retval = UA_ByteString_allocBuffer(&newValueAsByteString, binsize);
  93. if(retval != UA_STATUSCODE_GOOD) {
  94. UA_DataValue_deleteMembers(&newvalue->value);
  95. UA_free(newvalue);
  96. return;
  97. }
  98. size_t encodingOffset = 0;
  99. retval = UA_encodeBinary(&newvalue->value, &UA_TYPES[UA_TYPES_DATAVALUE],
  100. NULL, NULL, &newValueAsByteString, &encodingOffset);
  101. /* Restore the settings changed for the filter */
  102. newvalue->value.hasValue = hasValue;
  103. newvalue->value.hasServerTimestamp = hasServerTimestamp;
  104. newvalue->value.hasServerPicoseconds = hasServerPicoseconds;
  105. if(monitoredItem->timestampsToReturn == UA_TIMESTAMPSTORETURN_SERVER ||
  106. monitoredItem->timestampsToReturn == UA_TIMESTAMPSTORETURN_NEITHER) {
  107. newvalue->value.hasSourceTimestamp = false;
  108. newvalue->value.hasSourcePicoseconds = false;
  109. } else {
  110. newvalue->value.hasSourceTimestamp = hasSourceTimestamp;
  111. newvalue->value.hasSourcePicoseconds = hasSourcePicoseconds;
  112. }
  113. /* Error or the value has not changed */
  114. if(retval != UA_STATUSCODE_GOOD ||
  115. (monitoredItem->lastSampledValue.data &&
  116. UA_String_equal(&newValueAsByteString, &monitoredItem->lastSampledValue))) {
  117. UA_LOG_TRACE_SESSION(server->config.logger, sub->session, "Subscription %u | "
  118. "MonitoredItem %u | Do not sample an unchanged value",
  119. sub->subscriptionID, monitoredItem->itemId);
  120. goto cleanup;
  121. }
  122. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session,
  123. "Subscription %u | MonitoredItem %u | "
  124. "Sampling the value", sub->subscriptionID, monitoredItem->itemId);
  125. /* Is enough space in the queue? */
  126. if(monitoredItem->currentQueueSize >= monitoredItem->maxQueueSize) {
  127. MonitoredItem_queuedValue *queueItem;
  128. if(monitoredItem->discardOldest)
  129. queueItem = TAILQ_FIRST(&monitoredItem->queue);
  130. else
  131. queueItem = TAILQ_LAST(&monitoredItem->queue, QueueOfQueueDataValues);
  132. if(!queueItem) {
  133. UA_LOG_WARNING_SESSION(server->config.logger, sub->session, "Subscription %u | "
  134. "MonitoredItem %u | Cannot remove an element from the full "
  135. "queue. Internal error!", sub->subscriptionID,
  136. monitoredItem->itemId);
  137. goto cleanup;
  138. }
  139. TAILQ_REMOVE(&monitoredItem->queue, queueItem, listEntry);
  140. UA_DataValue_deleteMembers(&queueItem->value);
  141. UA_free(queueItem);
  142. monitoredItem->currentQueueSize--;
  143. }
  144. /* If the read request returned a datavalue pointing into the nodestore, we
  145. * must make a deep copy to keep the datavalue across mainloop iterations */
  146. if(newvalue->value.hasValue &&
  147. newvalue->value.value.storageType == UA_VARIANT_DATA_NODELETE) {
  148. UA_Variant tempv = newvalue->value.value;
  149. UA_Variant_copy(&tempv, &newvalue->value.value);
  150. }
  151. /* Replace the comparison bytestring with the current sample */
  152. UA_ByteString_deleteMembers(&monitoredItem->lastSampledValue);
  153. monitoredItem->lastSampledValue = newValueAsByteString;
  154. /* Add the sample to the queue for publication */
  155. TAILQ_INSERT_TAIL(&monitoredItem->queue, newvalue, listEntry);
  156. monitoredItem->currentQueueSize++;
  157. return;
  158. cleanup:
  159. UA_ByteString_deleteMembers(&newValueAsByteString);
  160. UA_DataValue_deleteMembers(&newvalue->value);
  161. UA_free(newvalue);
  162. }
  163. UA_StatusCode
  164. MonitoredItem_registerSampleJob(UA_Server *server, UA_MonitoredItem *mon) {
  165. UA_Job job;
  166. job.type = UA_JOBTYPE_METHODCALL;
  167. job.job.methodCall.method = (UA_ServerCallback)UA_MoniteredItem_SampleCallback;
  168. job.job.methodCall.data = mon;
  169. UA_StatusCode retval = UA_Server_addRepeatedJob(server, job,
  170. (UA_UInt32)mon->samplingInterval,
  171. &mon->sampleJobGuid);
  172. if(retval == UA_STATUSCODE_GOOD)
  173. mon->sampleJobIsRegistered = true;
  174. return retval;
  175. }
  176. UA_StatusCode MonitoredItem_unregisterSampleJob(UA_Server *server, UA_MonitoredItem *mon) {
  177. if(!mon->sampleJobIsRegistered)
  178. return UA_STATUSCODE_GOOD;
  179. mon->sampleJobIsRegistered = false;
  180. return UA_Server_removeRepeatedJob(server, mon->sampleJobGuid);
  181. }
  182. /****************/
  183. /* Subscription */
  184. /****************/
  185. UA_Subscription * UA_Subscription_new(UA_Session *session, UA_UInt32 subscriptionID) {
  186. UA_Subscription *new = UA_malloc(sizeof(UA_Subscription));
  187. if(!new)
  188. return NULL;
  189. new->session = session;
  190. new->subscriptionID = subscriptionID;
  191. new->sequenceNumber = 0;
  192. new->maxKeepAliveCount = 0;
  193. new->publishingEnabled = false;
  194. memset(&new->publishJobGuid, 0, sizeof(UA_Guid));
  195. new->publishJobIsRegistered = false;
  196. new->currentKeepAliveCount = 0;
  197. new->currentLifetimeCount = 0;
  198. new->lastMonitoredItemId = 0;
  199. new->state = UA_SUBSCRIPTIONSTATE_NORMAL; /* The first publish response is sent immediately */
  200. LIST_INIT(&new->retransmissionQueue);
  201. LIST_INIT(&new->MonitoredItems);
  202. return new;
  203. }
  204. void UA_Subscription_deleteMembers(UA_Subscription *subscription, UA_Server *server) {
  205. Subscription_unregisterPublishJob(server, subscription);
  206. /* Delete monitored Items */
  207. UA_MonitoredItem *mon, *tmp_mon;
  208. LIST_FOREACH_SAFE(mon, &subscription->MonitoredItems, listEntry, tmp_mon) {
  209. LIST_REMOVE(mon, listEntry);
  210. MonitoredItem_delete(server, mon);
  211. }
  212. /* Delete Retransmission Queue */
  213. UA_NotificationMessageEntry *nme, *nme_tmp;
  214. LIST_FOREACH_SAFE(nme, &subscription->retransmissionQueue, listEntry, nme_tmp) {
  215. LIST_REMOVE(nme, listEntry);
  216. UA_NotificationMessage_deleteMembers(&nme->message);
  217. UA_free(nme);
  218. }
  219. }
  220. UA_MonitoredItem *
  221. UA_Subscription_getMonitoredItem(UA_Subscription *sub, UA_UInt32 monitoredItemID) {
  222. UA_MonitoredItem *mon;
  223. LIST_FOREACH(mon, &sub->MonitoredItems, listEntry) {
  224. if(mon->itemId == monitoredItemID)
  225. break;
  226. }
  227. return mon;
  228. }
  229. UA_StatusCode
  230. UA_Subscription_deleteMonitoredItem(UA_Server *server, UA_Subscription *sub,
  231. UA_UInt32 monitoredItemID) {
  232. UA_MonitoredItem *mon;
  233. LIST_FOREACH(mon, &sub->MonitoredItems, listEntry) {
  234. if(mon->itemId == monitoredItemID) {
  235. LIST_REMOVE(mon, listEntry);
  236. MonitoredItem_delete(server, mon);
  237. return UA_STATUSCODE_GOOD;
  238. }
  239. }
  240. return UA_STATUSCODE_BADMONITOREDITEMIDINVALID;
  241. }
  242. void UA_Subscription_publishCallback(UA_Server *server, UA_Subscription *sub) {
  243. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session, "Subscription %u | "
  244. "Publish Callback", sub->subscriptionID);
  245. /* Count the available notifications */
  246. size_t notifications = 0;
  247. UA_Boolean moreNotifications = false;
  248. if(sub->publishingEnabled) {
  249. UA_MonitoredItem *mon;
  250. LIST_FOREACH(mon, &sub->MonitoredItems, listEntry) {
  251. MonitoredItem_queuedValue *qv;
  252. TAILQ_FOREACH(qv, &mon->queue, listEntry) {
  253. if(notifications >= sub->notificationsPerPublish) {
  254. moreNotifications = true;
  255. break;
  256. }
  257. notifications++;
  258. }
  259. }
  260. }
  261. /* Return if nothing to do */
  262. if(notifications == 0) {
  263. sub->currentKeepAliveCount++;
  264. if(sub->currentKeepAliveCount < sub->maxKeepAliveCount)
  265. return;
  266. }
  267. /* Check if the securechannel is valid */
  268. UA_SecureChannel *channel = sub->session->channel;
  269. if(!channel)
  270. return;
  271. /* Dequeue a response */
  272. UA_PublishResponseEntry *pre = SIMPLEQ_FIRST(&sub->session->responseQueue);
  273. if(!pre) {
  274. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session,
  275. "Cannot send a publish response on subscription %u, "
  276. "since the publish queue is empty", sub->subscriptionID)
  277. if(sub->state != UA_SUBSCRIPTIONSTATE_LATE) {
  278. sub->state = UA_SUBSCRIPTIONSTATE_LATE;
  279. } else {
  280. sub->currentLifetimeCount++;
  281. if(sub->currentLifetimeCount > sub->lifeTimeCount) {
  282. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session, "Subscription %u | "
  283. "End of lifetime for subscription", sub->subscriptionID);
  284. UA_Session_deleteSubscription(server, sub->session, sub->subscriptionID);
  285. }
  286. }
  287. return;
  288. }
  289. SIMPLEQ_REMOVE_HEAD(&sub->session->responseQueue, listEntry);
  290. UA_PublishResponse *response = &pre->response;
  291. UA_UInt32 requestId = pre->requestId;
  292. /* We have a request. Reset state to normal. */
  293. sub->state = UA_SUBSCRIPTIONSTATE_NORMAL;
  294. sub->currentKeepAliveCount = 0;
  295. sub->currentLifetimeCount = 0;
  296. /* Prepare the response */
  297. response->responseHeader.timestamp = UA_DateTime_now();
  298. response->subscriptionId = sub->subscriptionID;
  299. response->moreNotifications = moreNotifications;
  300. UA_NotificationMessage *message = &response->notificationMessage;
  301. message->publishTime = response->responseHeader.timestamp;
  302. if(notifications == 0) {
  303. /* Send sequence number for the next notification */
  304. message->sequenceNumber = sub->sequenceNumber + 1;
  305. } else {
  306. /* Increase the sequence number */
  307. message->sequenceNumber = ++sub->sequenceNumber;
  308. /* Collect the notification messages */
  309. message->notificationData = UA_ExtensionObject_new();
  310. message->notificationDataSize = 1;
  311. UA_ExtensionObject *data = message->notificationData;
  312. UA_DataChangeNotification *dcn = UA_DataChangeNotification_new();
  313. dcn->monitoredItems =
  314. UA_Array_new(notifications, &UA_TYPES[UA_TYPES_MONITOREDITEMNOTIFICATION]);
  315. dcn->monitoredItemsSize = notifications;
  316. size_t l = 0;
  317. UA_MonitoredItem *mon;
  318. LIST_FOREACH(mon, &sub->MonitoredItems, listEntry) {
  319. MonitoredItem_queuedValue *qv, *qv_tmp;
  320. size_t mon_l = 0;
  321. TAILQ_FOREACH_SAFE(qv, &mon->queue, listEntry, qv_tmp) {
  322. if(notifications <= l)
  323. break;
  324. UA_MonitoredItemNotification *min = &dcn->monitoredItems[l];
  325. min->clientHandle = qv->clientHandle;
  326. min->value = qv->value;
  327. TAILQ_REMOVE(&mon->queue, qv, listEntry);
  328. UA_free(qv);
  329. mon->currentQueueSize--;
  330. mon_l++;
  331. }
  332. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session,
  333. "Subscription %u | MonitoredItem %u | "
  334. "Adding %u notifications to the publish response. "
  335. "%u notifications remain in the queue",
  336. sub->subscriptionID, mon->itemId, mon_l,
  337. mon->currentQueueSize);
  338. l += mon_l;
  339. }
  340. data->encoding = UA_EXTENSIONOBJECT_DECODED;
  341. data->content.decoded.data = dcn;
  342. data->content.decoded.type = &UA_TYPES[UA_TYPES_DATACHANGENOTIFICATION];
  343. /* Put the notification message into the retransmission queue */
  344. UA_NotificationMessageEntry *retransmission =
  345. malloc(sizeof(UA_NotificationMessageEntry));
  346. if(retransmission) {
  347. UA_NotificationMessage_copy(&response->notificationMessage,
  348. &retransmission->message);
  349. LIST_INSERT_HEAD(&sub->retransmissionQueue, retransmission, listEntry);
  350. } else {
  351. UA_LOG_WARNING_SESSION(server->config.logger, sub->session,
  352. "Subscription %u | Could not allocate memory "
  353. "for retransmission", sub->subscriptionID);
  354. }
  355. }
  356. /* Get the available sequence numbers from the retransmission queue */
  357. size_t available = 0, i = 0;
  358. UA_NotificationMessageEntry *nme;
  359. LIST_FOREACH(nme, &sub->retransmissionQueue, listEntry)
  360. available++;
  361. //cppcheck-suppress knownConditionTrueFalse
  362. if(available > 0) {
  363. response->availableSequenceNumbers = UA_alloca(available * sizeof(UA_UInt32));
  364. response->availableSequenceNumbersSize = available;
  365. }
  366. LIST_FOREACH(nme, &sub->retransmissionQueue, listEntry) {
  367. response->availableSequenceNumbers[i] = nme->message.sequenceNumber;
  368. i++;
  369. }
  370. /* Send the response */
  371. UA_LOG_DEBUG_SESSION(server->config.logger, sub->session,
  372. "Subscription %u | Sending out a publish response with %u "
  373. "notifications", sub->subscriptionID, (UA_UInt32)notifications);
  374. UA_SecureChannel_sendBinaryMessage(sub->session->channel, requestId, response,
  375. &UA_TYPES[UA_TYPES_PUBLISHRESPONSE]);
  376. /* Remove the queued request */
  377. response->availableSequenceNumbers = NULL; /* stack-allocated */
  378. response->availableSequenceNumbersSize = 0;
  379. UA_PublishResponse_deleteMembers(&pre->response);
  380. UA_free(pre);
  381. /* Repeat if there are more notifications to send */
  382. if(moreNotifications)
  383. UA_Subscription_publishCallback(server, sub);
  384. }
  385. UA_StatusCode Subscription_registerPublishJob(UA_Server *server, UA_Subscription *sub) {
  386. if(sub->publishJobIsRegistered)
  387. return UA_STATUSCODE_GOOD;
  388. if(!sub->publishingEnabled)
  389. return UA_STATUSCODE_GOOD;
  390. UA_Job job;
  391. job.type = UA_JOBTYPE_METHODCALL;
  392. job.job.methodCall.method = (UA_ServerCallback)UA_Subscription_publishCallback;
  393. job.job.methodCall.data = sub;
  394. UA_StatusCode retval = UA_Server_addRepeatedJob(server, job,
  395. (UA_UInt32)sub->publishingInterval,
  396. &sub->publishJobGuid);
  397. if(retval == UA_STATUSCODE_GOOD)
  398. sub->publishJobIsRegistered = true;
  399. return retval;
  400. }
  401. UA_StatusCode Subscription_unregisterPublishJob(UA_Server *server, UA_Subscription *sub) {
  402. if(!sub->publishJobIsRegistered)
  403. return UA_STATUSCODE_GOOD;
  404. sub->publishJobIsRegistered = false;
  405. return UA_Server_removeRepeatedJob(server, sub->publishJobGuid);
  406. }
  407. #endif /* UA_ENABLE_SUBSCRIPTIONS */