ua_connection.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  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_connection_internal.h"
  6. #include "ua_types_encoding_binary.h"
  7. #include "ua_types_generated_encoding_binary.h"
  8. #include "ua_types_generated_handling.h"
  9. #include "ua_securechannel.h"
  10. void UA_Connection_deleteMembers(UA_Connection *connection) {
  11. UA_ByteString_deleteMembers(&connection->incompleteMessage);
  12. }
  13. static UA_StatusCode
  14. prependIncomplete(UA_Connection *connection, UA_ByteString * UA_RESTRICT message,
  15. UA_Boolean * UA_RESTRICT realloced) {
  16. UA_assert(connection->incompleteMessage.length > 0);
  17. /* Allocate the new message buffer */
  18. size_t length = connection->incompleteMessage.length + message->length;
  19. UA_Byte *data = (UA_Byte*)UA_realloc(connection->incompleteMessage.data, length);
  20. if(!data) {
  21. UA_ByteString_deleteMembers(&connection->incompleteMessage);
  22. connection->releaseRecvBuffer(connection, message);
  23. return UA_STATUSCODE_BADOUTOFMEMORY;
  24. }
  25. /* Copy / release the current message buffer */
  26. memcpy(&data[connection->incompleteMessage.length], message->data, message->length);
  27. connection->releaseRecvBuffer(connection, message);
  28. message->length = length;
  29. message->data = data;
  30. connection->incompleteMessage = UA_BYTESTRING_NULL;
  31. *realloced = true;
  32. return UA_STATUSCODE_GOOD;
  33. }
  34. static size_t
  35. completeChunksUntil(UA_Connection *connection, UA_ByteString * UA_RESTRICT message,
  36. UA_Boolean *garbage_end) {
  37. size_t complete_until = 0;
  38. /* At least 8 byte needed for the header... */
  39. while(message->length - complete_until >= 8) {
  40. /* Check the message type */
  41. UA_UInt32 msgtype = (UA_UInt32)message->data[complete_until] +
  42. ((UA_UInt32)message->data[complete_until+1] << 8) +
  43. ((UA_UInt32)message->data[complete_until+2] << 16);
  44. if(msgtype != ('M' + ('S' << 8) + ('G' << 16)) &&
  45. msgtype != ('O' + ('P' << 8) + ('N' << 16)) &&
  46. msgtype != ('H' + ('E' << 8) + ('L' << 16)) &&
  47. msgtype != ('A' + ('C' << 8) + ('K' << 16)) &&
  48. msgtype != ('C' + ('L' << 8) + ('O' << 16))) {
  49. *garbage_end = true; /* the message type is not recognized */
  50. break;
  51. }
  52. /* Decoding failed or the message size is not allowed. The remaining
  53. * message is garbage. */
  54. UA_UInt32 chunk_length = 0;
  55. size_t length_pos = complete_until + 4;
  56. if(UA_UInt32_decodeBinary(message, &length_pos, &chunk_length) != UA_STATUSCODE_GOOD ||
  57. chunk_length < 16 || chunk_length > connection->localConf.recvBufferSize) {
  58. *garbage_end = true;
  59. break;
  60. }
  61. /* The chunk is okay but incomplete. Store the end. */
  62. if(chunk_length + complete_until > message->length)
  63. break;
  64. /* Continue to the next chunk */
  65. complete_until += chunk_length;
  66. }
  67. UA_assert(complete_until <= message->length);
  68. return complete_until;
  69. }
  70. static UA_StatusCode
  71. separateIncompleteChunk(UA_Connection *connection, UA_ByteString * UA_RESTRICT message,
  72. size_t complete_until, UA_Boolean garbage_end, UA_Boolean *realloced) {
  73. UA_assert(complete_until < message->length);
  74. /* Garbage after the last good chunk. No need to keep an incomplete message. */
  75. if(garbage_end) {
  76. if(complete_until == 0) /* All garbage */
  77. return UA_STATUSCODE_BADDECODINGERROR;
  78. message->length = complete_until;
  79. return UA_STATUSCODE_GOOD;
  80. }
  81. /* No good chunk, buffer the entire message */
  82. if(complete_until == 0) {
  83. if(!*realloced) {
  84. UA_StatusCode retval =
  85. UA_ByteString_allocBuffer(&connection->incompleteMessage, message->length);
  86. if(retval != UA_STATUSCODE_GOOD)
  87. return retval;
  88. memcpy(connection->incompleteMessage.data, message->data, message->length);
  89. connection->releaseRecvBuffer(connection, message);
  90. *realloced = true;
  91. } else {
  92. connection->incompleteMessage = *message;
  93. *message = UA_BYTESTRING_NULL;
  94. }
  95. return UA_STATUSCODE_GOOD;
  96. }
  97. /* At least one good chunk and an incomplete one */
  98. size_t incomplete_length = message->length - complete_until;
  99. UA_StatusCode retval =
  100. UA_ByteString_allocBuffer(&connection->incompleteMessage, incomplete_length);
  101. if(retval != UA_STATUSCODE_GOOD)
  102. return retval;
  103. memcpy(connection->incompleteMessage.data, &message->data[complete_until], incomplete_length);
  104. message->length = complete_until;
  105. return UA_STATUSCODE_GOOD;
  106. }
  107. UA_StatusCode
  108. UA_Connection_completeMessages(UA_Connection *connection, UA_ByteString * UA_RESTRICT message,
  109. UA_Boolean * UA_RESTRICT realloced) {
  110. /* If we have a stored an incomplete chunk, prefix to the received message.
  111. * After this block, connection->incompleteMessage is always empty. The
  112. * message and the buffer is released if allocating the memory fails. */
  113. if(connection->incompleteMessage.length > 0) {
  114. UA_StatusCode retval = prependIncomplete(connection, message, realloced);
  115. if(retval != UA_STATUSCODE_GOOD)
  116. return retval;
  117. }
  118. /* Find the end of the last complete chunk */
  119. UA_Boolean garbage_end = false; /* garbage after the last complete message */
  120. size_t complete_until = completeChunksUntil(connection, message, &garbage_end);
  121. /* Buffer incomplete chunk (at the end of the message) in the connection and
  122. * adjust the size of the message. */
  123. if(complete_until < message->length) {
  124. UA_StatusCode retval = separateIncompleteChunk(connection, message, complete_until,
  125. garbage_end, realloced);
  126. if(retval != UA_STATUSCODE_GOOD) {
  127. if(*realloced)
  128. UA_ByteString_deleteMembers(message);
  129. else
  130. connection->releaseRecvBuffer(connection, message);
  131. return retval;
  132. }
  133. }
  134. return UA_STATUSCODE_GOOD;
  135. }
  136. UA_StatusCode
  137. UA_Connection_receiveChunksBlocking(UA_Connection *connection, UA_ByteString *chunks,
  138. UA_Boolean *realloced, UA_UInt32 timeout) {
  139. UA_DateTime now = UA_DateTime_nowMonotonic();
  140. UA_DateTime maxDate = now + (timeout * UA_MSEC_TO_DATETIME);
  141. *realloced = false;
  142. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  143. while(true) {
  144. /* Listen for messages to arrive */
  145. retval = connection->recv(connection, chunks, timeout);
  146. /* Get complete chunks and return */
  147. retval |= UA_Connection_completeMessages(connection, chunks, realloced);
  148. if(retval != UA_STATUSCODE_GOOD || chunks->length > 0)
  149. break;
  150. /* We received a message. But the chunk is incomplete. Compute the
  151. * remaining timeout. */
  152. now = UA_DateTime_nowMonotonic();
  153. if(now > maxDate)
  154. return UA_STATUSCODE_GOODNONCRITICALTIMEOUT;
  155. timeout = (UA_UInt32)((maxDate - now) / UA_MSEC_TO_DATETIME);
  156. }
  157. return retval;
  158. }
  159. void UA_Connection_detachSecureChannel(UA_Connection *connection) {
  160. UA_SecureChannel *channel = connection->channel;
  161. if(channel)
  162. /* only replace when the channel points to this connection */
  163. UA_atomic_cmpxchg((void**)&channel->connection, connection, NULL);
  164. UA_atomic_xchg((void**)&connection->channel, NULL);
  165. }
  166. // TODO: Return an error code
  167. void
  168. UA_Connection_attachSecureChannel(UA_Connection *connection, UA_SecureChannel *channel) {
  169. if(UA_atomic_cmpxchg((void**)&channel->connection, NULL, connection) == NULL)
  170. UA_atomic_xchg((void**)&connection->channel, (void*)channel);
  171. }
  172. UA_StatusCode
  173. UA_EndpointUrl_split_ptr(const char *endpointUrl, char *hostname,
  174. const char ** port, const char **path) {
  175. if (!endpointUrl || !hostname)
  176. return UA_STATUSCODE_BADINVALIDARGUMENT;
  177. size_t urlLength = strlen(endpointUrl);
  178. if(urlLength < 10 || urlLength >= 256)
  179. return UA_STATUSCODE_BADOUTOFRANGE;
  180. if(strncmp(endpointUrl, "opc.tcp://", 10) != 0)
  181. return UA_STATUSCODE_BADATTRIBUTEIDINVALID;
  182. if (urlLength == 10) {
  183. hostname[0] = '\0';
  184. port = NULL;
  185. *path = NULL;
  186. }
  187. /* where does the port begin? */
  188. size_t portpos = 10;
  189. // opc.tcp://[2001:0db8:85a3::8a2e:0370:7334]:1234/path
  190. // if ip6, then end not found, otherwise we are fine
  191. UA_Boolean ip6_end_found = endpointUrl[portpos] != '[';
  192. for(; portpos < urlLength; ++portpos) {
  193. if (!ip6_end_found) {
  194. if (endpointUrl[portpos] == ']')
  195. ip6_end_found = UA_TRUE;
  196. continue;
  197. }
  198. if(endpointUrl[portpos] == ':' || endpointUrl[portpos] == '/')
  199. break;
  200. }
  201. memcpy(hostname, &endpointUrl[10], portpos - 10);
  202. hostname[portpos-10] = 0;
  203. if(port) {
  204. if (portpos < urlLength - 1) {
  205. if (endpointUrl[portpos] == '/')
  206. *port = NULL;
  207. else
  208. *port = &endpointUrl[portpos + 1];
  209. } else {
  210. *port = NULL;
  211. }
  212. }
  213. if(path) {
  214. size_t pathpos = portpos < urlLength ? portpos : 10;
  215. for(; pathpos < urlLength; ++pathpos) {
  216. if(endpointUrl[pathpos] == '/')
  217. break;
  218. }
  219. if (pathpos < urlLength-1)
  220. *path = &endpointUrl[pathpos+1]; // do not include slash in path
  221. else
  222. *path = NULL;
  223. }
  224. return UA_STATUSCODE_GOOD;
  225. }
  226. UA_StatusCode
  227. UA_EndpointUrl_split(const char *endpointUrl, char *hostname,
  228. UA_UInt16 * port, const char ** path) {
  229. const char* portTmp = NULL;
  230. const char* pathTmp = NULL;
  231. UA_StatusCode retval = UA_EndpointUrl_split_ptr(endpointUrl, hostname, &portTmp, &pathTmp);
  232. if(retval != UA_STATUSCODE_GOOD) {
  233. if(hostname)
  234. hostname[0] = '\0';
  235. return retval;
  236. }
  237. if(!port && !path)
  238. return UA_STATUSCODE_GOOD;
  239. char portStr[6];
  240. portStr[0] = '\0';
  241. if(portTmp) {
  242. size_t portLen;
  243. if (pathTmp)
  244. portLen = (size_t)(pathTmp-portTmp-1);
  245. else
  246. portLen = strlen(portTmp);
  247. if (portLen > 5) // max is 65535
  248. return UA_STATUSCODE_BADOUTOFRANGE;
  249. memcpy(portStr, portTmp, portLen);
  250. portStr[portLen]='\0';
  251. if(port) {
  252. for (size_t i=0; i<6; ++i) {
  253. if (portStr[i] == 0)
  254. break;
  255. if (portStr[i] < '0' || portStr[i] > '9')
  256. return UA_STATUSCODE_BADOUTOFRANGE;
  257. }
  258. UA_UInt32 p;
  259. UA_readNumber((UA_Byte*)portStr, 6, &p);
  260. if (p>65535)
  261. return UA_STATUSCODE_BADOUTOFRANGE;
  262. *port = (UA_UInt16)p;
  263. }
  264. } else {
  265. if (port)
  266. *port = 0;
  267. }
  268. if (path)
  269. *path = pathTmp;
  270. return UA_STATUSCODE_GOOD;
  271. }
  272. size_t UA_readNumber(UA_Byte *buf, size_t buflen, UA_UInt32 *number) {
  273. if (!buf)
  274. return 0;
  275. UA_UInt32 n = 0;
  276. size_t progress = 0;
  277. /* read numbers until the end or a non-number character appears */
  278. while(progress < buflen) {
  279. UA_Byte c = buf[progress];
  280. if('0' > c || '9' < c)
  281. break;
  282. n = (n*10) + (UA_UInt32)(c-'0');
  283. ++progress;
  284. }
  285. *number = n;
  286. return progress;
  287. }