ua_types.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873
  1. #include "ua_util.h"
  2. #include "ua_types.h"
  3. #include "ua_types_generated.h"
  4. #include "pcg_basic.h"
  5. #include "libc_time.h"
  6. /* static variables */
  7. UA_EXPORT const UA_String UA_STRING_NULL = {.length = 0, .data = NULL };
  8. UA_EXPORT const UA_ByteString UA_BYTESTRING_NULL = {.length = 0, .data = NULL };
  9. UA_EXPORT const UA_NodeId UA_NODEID_NULL = {0, UA_NODEIDTYPE_NUMERIC, {0}};
  10. UA_EXPORT const UA_ExpandedNodeId UA_EXPANDEDNODEID_NULL = {
  11. .nodeId = { .namespaceIndex = 0, .identifierType = UA_NODEIDTYPE_NUMERIC, .identifier.numeric = 0 },
  12. .namespaceUri = {.length = 0, .data = NULL}, .serverIndex = 0 };
  13. /***************************/
  14. /* Random Number Generator */
  15. /***************************/
  16. static UA_THREAD_LOCAL pcg32_random_t UA_rng = PCG32_INITIALIZER;
  17. UA_EXPORT void UA_random_seed(UA_UInt64 seed) {
  18. pcg32_srandom_r(&UA_rng, seed, (uint64_t)UA_DateTime_now());
  19. }
  20. /*****************/
  21. /* Builtin Types */
  22. /*****************/
  23. UA_EXPORT UA_UInt32 UA_UInt32_random(void) {
  24. return (UA_UInt32)pcg32_random_r(&UA_rng);
  25. }
  26. UA_String UA_String_fromChars(char const src[]) {
  27. UA_String str = UA_STRING_NULL;
  28. size_t length = strlen(src);
  29. if(length > 0) {
  30. str.data = UA_malloc(length);
  31. if(!str.data)
  32. return str;
  33. } else
  34. str.data = UA_EMPTY_ARRAY_SENTINEL;
  35. memcpy(str.data, src, length);
  36. str.length = length;
  37. return str;
  38. }
  39. UA_Boolean UA_String_equal(const UA_String *string1, const UA_String *string2) {
  40. if(string1->length != string2->length)
  41. return false;
  42. UA_Int32 is = memcmp((char const*)string1->data, (char const*)string2->data, string1->length);
  43. return (is == 0) ? true : false;
  44. }
  45. /* DateTime */
  46. /* Implement UA_DateTime_now and UA_DateTime_nowMonotonic outside of the
  47. library. This becomes necessary on embedded targets when the POSIX/Windows
  48. API is not available. */
  49. #ifndef UA_ENABLE_EMBEDDED_CLOCK
  50. UA_DateTime UA_DateTime_now(void) {
  51. #if defined(_WIN32) && !defined(__MINGW32__)
  52. /* Windows filetime has the same definition as UA_DateTime */
  53. FILETIME ft;
  54. SYSTEMTIME st;
  55. GetSystemTime(&st);
  56. SystemTimeToFileTime(&st, &ft);
  57. ULARGE_INTEGER ul;
  58. ul.LowPart = ft.dwLowDateTime;
  59. ul.HighPart = ft.dwHighDateTime;
  60. return (UA_DateTime)ul.QuadPart;
  61. #else
  62. struct timeval tv;
  63. gettimeofday(&tv, NULL);
  64. return (tv.tv_sec * UA_SEC_TO_DATETIME) + (tv.tv_usec * UA_USEC_TO_DATETIME) + UA_DATETIME_UNIX_EPOCH;
  65. #endif
  66. }
  67. UA_DateTime UA_DateTime_nowMonotonic(void) {
  68. #if defined(_WIN32)
  69. LARGE_INTEGER freq, ticks;
  70. QueryPerformanceFrequency(&freq);
  71. QueryPerformanceCounter(&ticks);
  72. UA_Double ticks2dt = UA_SEC_TO_DATETIME;
  73. ticks2dt /= freq.QuadPart;
  74. return (UA_DateTime)(ticks.QuadPart * ticks2dt);
  75. #elif defined(__APPLE__) || defined(__MACH__)
  76. /* OS X does not have clock_gettime, use clock_get_time */
  77. clock_serv_t cclock;
  78. mach_timespec_t mts;
  79. host_get_clock_service(mach_host_self(), SYSTEM_CLOCK, &cclock);
  80. clock_get_time(cclock, &mts);
  81. mach_port_deallocate(mach_task_self(), cclock);
  82. return (mts.tv_sec * UA_SEC_TO_DATETIME) + (mts.tv_nsec / 100);
  83. #elif defined(__CYGWIN__)
  84. struct timespec ts;
  85. clock_gettime(CLOCK_MONOTONIC, &ts);
  86. return (ts.tv_sec * UA_SEC_TO_DATETIME) + (ts.tv_nsec / 100);
  87. #else
  88. struct timespec ts;
  89. clock_gettime(CLOCK_MONOTONIC_RAW, &ts);
  90. return (ts.tv_sec * UA_SEC_TO_DATETIME) + (ts.tv_nsec / 100);
  91. #endif
  92. }
  93. #endif
  94. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime t) {
  95. /* Calculating the the milli-, micro- and nanoseconds */
  96. UA_DateTimeStruct dateTimeStruct;
  97. dateTimeStruct.nanoSec = (UA_UInt16)((t % 10) * 100);
  98. dateTimeStruct.microSec = (UA_UInt16)((t % 10000) / 10);
  99. dateTimeStruct.milliSec = (UA_UInt16)((t % 10000000) / 10000);
  100. /* Calculating the unix time with #include <time.h> */
  101. time_t secSinceUnixEpoch = (time_t)((t - UA_DATETIME_UNIX_EPOCH) / UA_SEC_TO_DATETIME);
  102. struct tm ts;
  103. memset(&ts, 0, sizeof(struct tm));
  104. __secs_to_tm(secSinceUnixEpoch, &ts);
  105. dateTimeStruct.sec = (UA_UInt16)ts.tm_sec;
  106. dateTimeStruct.min = (UA_UInt16)ts.tm_min;
  107. dateTimeStruct.hour = (UA_UInt16)ts.tm_hour;
  108. dateTimeStruct.day = (UA_UInt16)ts.tm_mday;
  109. dateTimeStruct.month = (UA_UInt16)(ts.tm_mon + 1);
  110. dateTimeStruct.year = (UA_UInt16)(ts.tm_year + 1900);
  111. return dateTimeStruct;
  112. }
  113. static void printNumber(UA_UInt16 n, UA_Byte *pos, size_t digits) {
  114. for(size_t i = digits; i > 0; i--) {
  115. pos[i-1] = (UA_Byte)((n % 10) + '0');
  116. n = n / 10;
  117. }
  118. }
  119. UA_String UA_DateTime_toString(UA_DateTime t) {
  120. UA_String str = UA_STRING_NULL;
  121. // length of the string is 31 (plus \0 at the end)
  122. if(!(str.data = UA_malloc(32)))
  123. return str;
  124. str.length = 31;
  125. UA_DateTimeStruct tSt = UA_DateTime_toStruct(t);
  126. printNumber(tSt.month, str.data, 2);
  127. str.data[2] = '/';
  128. printNumber(tSt.day, &str.data[3], 2);
  129. str.data[5] = '/';
  130. printNumber(tSt.year, &str.data[6], 4);
  131. str.data[10] = ' ';
  132. printNumber(tSt.hour, &str.data[11], 2);
  133. str.data[13] = ':';
  134. printNumber(tSt.min, &str.data[14], 2);
  135. str.data[16] = ':';
  136. printNumber(tSt.sec, &str.data[17], 2);
  137. str.data[19] = '.';
  138. printNumber(tSt.milliSec, &str.data[20], 3);
  139. str.data[23] = '.';
  140. printNumber(tSt.microSec, &str.data[24], 3);
  141. str.data[27] = '.';
  142. printNumber(tSt.nanoSec, &str.data[28], 3);
  143. return str;
  144. }
  145. /* Guid */
  146. UA_Boolean UA_Guid_equal(const UA_Guid *g1, const UA_Guid *g2) {
  147. if(memcmp(g1, g2, sizeof(UA_Guid)) == 0)
  148. return true;
  149. return false;
  150. }
  151. UA_Guid UA_Guid_random(void) {
  152. UA_Guid result;
  153. result.data1 = (UA_UInt32)pcg32_random_r(&UA_rng);
  154. UA_UInt32 r = (UA_UInt32)pcg32_random_r(&UA_rng);
  155. result.data2 = (UA_UInt16) r;
  156. result.data3 = (UA_UInt16) (r >> 16);
  157. r = (UA_UInt32)pcg32_random_r(&UA_rng);
  158. result.data4[0] = (UA_Byte)r;
  159. result.data4[1] = (UA_Byte)(r >> 4);
  160. result.data4[2] = (UA_Byte)(r >> 8);
  161. result.data4[3] = (UA_Byte)(r >> 12);
  162. r = (UA_UInt32)pcg32_random_r(&UA_rng);
  163. result.data4[4] = (UA_Byte)r;
  164. result.data4[5] = (UA_Byte)(r >> 4);
  165. result.data4[6] = (UA_Byte)(r >> 8);
  166. result.data4[7] = (UA_Byte)(r >> 12);
  167. return result;
  168. }
  169. /* ByteString */
  170. UA_StatusCode UA_ByteString_allocBuffer(UA_ByteString *bs, size_t length) {
  171. if(length == 0) {
  172. UA_ByteString_init(bs);
  173. return UA_STATUSCODE_GOOD;
  174. }
  175. if(!(bs->data = UA_malloc(length)))
  176. return UA_STATUSCODE_BADOUTOFMEMORY;
  177. bs->length = length;
  178. return UA_STATUSCODE_GOOD;
  179. }
  180. /* NodeId */
  181. static void NodeId_deleteMembers(UA_NodeId *p, const UA_DataType *_) {
  182. switch(p->identifierType) {
  183. case UA_NODEIDTYPE_STRING:
  184. case UA_NODEIDTYPE_BYTESTRING:
  185. UA_free((void*)((uintptr_t)p->identifier.byteString.data & ~(uintptr_t)UA_EMPTY_ARRAY_SENTINEL));
  186. p->identifier.byteString = UA_BYTESTRING_NULL;
  187. break;
  188. default: break;
  189. }
  190. }
  191. static UA_StatusCode NodeId_copy(UA_NodeId const *src, UA_NodeId *dst, const UA_DataType *_) {
  192. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  193. switch(src->identifierType) {
  194. case UA_NODEIDTYPE_NUMERIC:
  195. *dst = *src;
  196. return UA_STATUSCODE_GOOD;
  197. case UA_NODEIDTYPE_STRING:
  198. retval |= UA_String_copy(&src->identifier.string, &dst->identifier.string);
  199. break;
  200. case UA_NODEIDTYPE_GUID:
  201. retval |= UA_Guid_copy(&src->identifier.guid, &dst->identifier.guid);
  202. break;
  203. case UA_NODEIDTYPE_BYTESTRING:
  204. retval |= UA_ByteString_copy(&src->identifier.byteString, &dst->identifier.byteString);
  205. break;
  206. default:
  207. return UA_STATUSCODE_BADINTERNALERROR;
  208. }
  209. dst->namespaceIndex = src->namespaceIndex;
  210. dst->identifierType = src->identifierType;
  211. if(retval != UA_STATUSCODE_GOOD)
  212. NodeId_deleteMembers(dst, NULL);
  213. return retval;
  214. }
  215. UA_Boolean UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2) {
  216. if(n1->namespaceIndex != n2->namespaceIndex || n1->identifierType!=n2->identifierType)
  217. return false;
  218. switch(n1->identifierType) {
  219. case UA_NODEIDTYPE_NUMERIC:
  220. if(n1->identifier.numeric == n2->identifier.numeric)
  221. return true;
  222. else
  223. return false;
  224. case UA_NODEIDTYPE_STRING:
  225. return UA_String_equal(&n1->identifier.string, &n2->identifier.string);
  226. case UA_NODEIDTYPE_GUID:
  227. return UA_Guid_equal(&n1->identifier.guid, &n2->identifier.guid);
  228. case UA_NODEIDTYPE_BYTESTRING:
  229. return UA_ByteString_equal(&n1->identifier.byteString, &n2->identifier.byteString);
  230. }
  231. return false;
  232. }
  233. /* ExpandedNodeId */
  234. static void ExpandedNodeId_deleteMembers(UA_ExpandedNodeId *p, const UA_DataType *_) {
  235. NodeId_deleteMembers(&p->nodeId, _);
  236. UA_String_deleteMembers(&p->namespaceUri);
  237. }
  238. static UA_StatusCode
  239. ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst, const UA_DataType *_) {
  240. UA_StatusCode retval = NodeId_copy(&src->nodeId, &dst->nodeId, NULL);
  241. retval |= UA_String_copy(&src->namespaceUri, &dst->namespaceUri);
  242. dst->serverIndex = src->serverIndex;
  243. if(retval != UA_STATUSCODE_GOOD)
  244. ExpandedNodeId_deleteMembers(dst, NULL);
  245. return retval;
  246. }
  247. /* ExtensionObject */
  248. static void ExtensionObject_deleteMembers(UA_ExtensionObject *p, const UA_DataType *_) {
  249. switch(p->encoding) {
  250. case UA_EXTENSIONOBJECT_ENCODED_NOBODY:
  251. case UA_EXTENSIONOBJECT_ENCODED_BYTESTRING:
  252. case UA_EXTENSIONOBJECT_ENCODED_XML:
  253. NodeId_deleteMembers(&p->content.encoded.typeId, NULL);
  254. UA_free((void*)((uintptr_t)p->content.encoded.body.data & ~(uintptr_t)UA_EMPTY_ARRAY_SENTINEL));
  255. p->content.encoded.body = UA_BYTESTRING_NULL;
  256. break;
  257. case UA_EXTENSIONOBJECT_DECODED:
  258. if(!p->content.decoded.data)
  259. break;
  260. UA_delete(p->content.decoded.data, p->content.decoded.type);
  261. p->content.decoded.data = NULL;
  262. p->content.decoded.type = NULL;
  263. break;
  264. case UA_EXTENSIONOBJECT_DECODED_NODELETE:
  265. p->content.decoded.type = NULL;
  266. default:
  267. break;
  268. }
  269. }
  270. static UA_StatusCode
  271. ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst, const UA_DataType *_) {
  272. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  273. switch(src->encoding) {
  274. case UA_EXTENSIONOBJECT_ENCODED_NOBODY:
  275. case UA_EXTENSIONOBJECT_ENCODED_BYTESTRING:
  276. case UA_EXTENSIONOBJECT_ENCODED_XML:
  277. dst->encoding = src->encoding;
  278. retval = NodeId_copy(&src->content.encoded.typeId, &dst->content.encoded.typeId, NULL);
  279. retval |= UA_ByteString_copy(&src->content.encoded.body, &dst->content.encoded.body);
  280. break;
  281. case UA_EXTENSIONOBJECT_DECODED:
  282. case UA_EXTENSIONOBJECT_DECODED_NODELETE:
  283. if(!src->content.decoded.type || !src->content.decoded.data)
  284. return UA_STATUSCODE_BADINTERNALERROR;
  285. dst->encoding = UA_EXTENSIONOBJECT_DECODED;
  286. dst->content.decoded.type = src->content.decoded.type;
  287. retval = UA_Array_copy(src->content.decoded.data, 1,
  288. &dst->content.decoded.data, src->content.decoded.type);
  289. break;
  290. default:
  291. break;
  292. }
  293. return retval;
  294. }
  295. /* Variant */
  296. static void Variant_deletemembers(UA_Variant *p, const UA_DataType *_) {
  297. if(p->storageType != UA_VARIANT_DATA)
  298. return;
  299. if(p->type && p->data > UA_EMPTY_ARRAY_SENTINEL) {
  300. if(p->arrayLength == 0)
  301. p->arrayLength = 1;
  302. UA_Array_delete(p->data, p->arrayLength, p->type);
  303. p->data = NULL;
  304. p->arrayLength = 0;
  305. }
  306. if(p->arrayDimensions) {
  307. UA_Array_delete(p->arrayDimensions, p->arrayDimensionsSize, &UA_TYPES[UA_TYPES_INT32]);
  308. p->arrayDimensions = NULL;
  309. p->arrayDimensionsSize = 0;
  310. }
  311. }
  312. static UA_StatusCode
  313. Variant_copy(UA_Variant const *src, UA_Variant *dst, const UA_DataType *_) {
  314. size_t length = src->arrayLength;
  315. if(UA_Variant_isScalar(src))
  316. length = 1;
  317. UA_StatusCode retval = UA_Array_copy(src->data, length, &dst->data, src->type);
  318. if(retval != UA_STATUSCODE_GOOD)
  319. return retval;
  320. dst->arrayLength = src->arrayLength;
  321. dst->type = src->type;
  322. if(src->arrayDimensions) {
  323. retval = UA_Array_copy(src->arrayDimensions, src->arrayDimensionsSize,
  324. (void**)&dst->arrayDimensions, &UA_TYPES[UA_TYPES_INT32]);
  325. if(retval == UA_STATUSCODE_GOOD)
  326. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  327. else
  328. Variant_deletemembers(dst, NULL);
  329. }
  330. return retval;
  331. }
  332. /**
  333. * Test if a range is compatible with a variant. If yes, the following values are set:
  334. * - total: how many elements are in the range
  335. * - block: how big is each contiguous block of elements in the variant that maps into the range
  336. * - stride: how many elements are between the blocks (beginning to beginning)
  337. * - first: where does the first block begin
  338. */
  339. static UA_StatusCode
  340. processRangeDefinition(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  341. size_t *block, size_t *stride, size_t *first) {
  342. /* Test the integrity of the source variant dimensions */
  343. size_t dims_count = 1;
  344. UA_UInt32 elements = 1;
  345. #if(MAX_SIZE > 0xffffffff) /* 64bit only */
  346. if(v->arrayLength > UA_UINT32_MAX)
  347. return UA_STATUSCODE_BADINTERNALERROR;
  348. #endif
  349. UA_UInt32 arrayLength = (UA_UInt32)v->arrayLength;
  350. const UA_UInt32 *dims = &arrayLength;
  351. if(v->arrayDimensionsSize > 0) {
  352. dims_count = v->arrayDimensionsSize;
  353. dims = (UA_UInt32*)v->arrayDimensions;
  354. for(size_t i = 0; i < dims_count; i++) {
  355. /* dimensions can have negative size similar to array lengths */
  356. if(v->arrayDimensions[i] < 0)
  357. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  358. elements *= dims[i];
  359. }
  360. if(elements != v->arrayLength)
  361. return UA_STATUSCODE_BADINTERNALERROR;
  362. }
  363. /* Test the integrity of the range */
  364. size_t count = 1;
  365. if(range.dimensionsSize != dims_count)
  366. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  367. for(size_t i = 0; i < dims_count; i++) {
  368. if(range.dimensions[i].min > range.dimensions[i].max)
  369. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  370. if(range.dimensions[i].max >= dims[i])
  371. return UA_STATUSCODE_BADINDEXRANGENODATA;
  372. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  373. }
  374. /* Compute the stride length and the position of the first element */
  375. size_t b = 1, s = elements, f = 0;
  376. size_t running_dimssize = 1;
  377. UA_Boolean found_contiguous = false;
  378. for(size_t k = dims_count - 1; ; k--) {
  379. if(!found_contiguous && (range.dimensions[k].min != 0 || range.dimensions[k].max + 1 != dims[k])) {
  380. found_contiguous = true;
  381. b = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  382. s = dims[k] * running_dimssize;
  383. }
  384. f += running_dimssize * range.dimensions[k].min;
  385. running_dimssize *= dims[k];
  386. if(k == 0)
  387. break;
  388. }
  389. *total = count;
  390. *block = b;
  391. *stride = s;
  392. *first = f;
  393. return UA_STATUSCODE_GOOD;
  394. }
  395. UA_StatusCode
  396. UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  397. size_t count, block, stride, first;
  398. UA_StatusCode retval = processRangeDefinition(src, range, &count, &block, &stride, &first);
  399. if(retval != UA_STATUSCODE_GOOD)
  400. return retval;
  401. UA_Variant_init(dst);
  402. size_t elem_size = src->type->memSize;
  403. dst->data = UA_malloc(elem_size * count);
  404. if(!dst->data)
  405. return UA_STATUSCODE_BADOUTOFMEMORY;
  406. /* Copy the range */
  407. size_t block_count = count / block;
  408. uintptr_t nextdst = (uintptr_t)dst->data;
  409. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first);
  410. if(src->type->fixedSize) {
  411. for(size_t i = 0; i < block_count; i++) {
  412. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block);
  413. nextdst += block * elem_size;
  414. nextsrc += stride * elem_size;
  415. }
  416. } else {
  417. for(size_t i = 0; i < block_count; i++) {
  418. for(size_t j = 0; j < block && retval == UA_STATUSCODE_GOOD; j++) {
  419. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  420. nextdst += elem_size;
  421. nextsrc += elem_size;
  422. }
  423. nextsrc += (stride - block) * elem_size;
  424. }
  425. if(retval != UA_STATUSCODE_GOOD) {
  426. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  427. UA_Array_delete(dst->data, copied, src->type);
  428. dst->data = NULL;
  429. return retval;
  430. }
  431. }
  432. dst->arrayLength = count;
  433. dst->type = src->type;
  434. /* Copy the range dimensions */
  435. if(src->arrayDimensionsSize > 0) {
  436. dst->arrayDimensions = UA_Array_new(src->arrayDimensionsSize, &UA_TYPES[UA_TYPES_UINT32]);
  437. if(!dst->arrayDimensions) {
  438. Variant_deletemembers(dst, NULL);
  439. return UA_STATUSCODE_BADOUTOFMEMORY;
  440. }
  441. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  442. for(size_t k = 0; k < src->arrayDimensionsSize; k++)
  443. dst->arrayDimensions[k] = (UA_Int32)(range.dimensions[k].max - range.dimensions[k].min + 1);
  444. }
  445. return UA_STATUSCODE_GOOD;
  446. }
  447. UA_StatusCode
  448. UA_Variant_setRange(UA_Variant *v, void * UA_RESTRICT array, size_t arraySize, const UA_NumericRange range) {
  449. size_t count, block, stride, first;
  450. UA_StatusCode retval = processRangeDefinition(v, range, &count, &block, &stride, &first);
  451. if(retval != UA_STATUSCODE_GOOD)
  452. return retval;
  453. if(count != arraySize)
  454. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  455. size_t block_count = count / block;
  456. size_t elem_size = v->type->memSize;
  457. uintptr_t nextdst = (uintptr_t)v->data + (first * elem_size);
  458. uintptr_t nextsrc = (uintptr_t)array;
  459. for(size_t i = 0; i < block_count; i++) {
  460. if(!v->type->fixedSize) {
  461. for(size_t j = 0; j < block; j++) {
  462. UA_deleteMembers((void*)nextdst, v->type);
  463. nextdst += elem_size;
  464. }
  465. nextdst -= block * elem_size;
  466. }
  467. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block);
  468. nextsrc += block * elem_size;
  469. nextdst += stride * elem_size;
  470. }
  471. return UA_STATUSCODE_GOOD;
  472. }
  473. UA_StatusCode
  474. UA_Variant_setRangeCopy(UA_Variant *v, const void *array, size_t arraySize, const UA_NumericRange range) {
  475. size_t count, block, stride, first;
  476. UA_StatusCode retval = processRangeDefinition(v, range, &count, &block, &stride, &first);
  477. if(retval != UA_STATUSCODE_GOOD)
  478. return retval;
  479. if(count != arraySize)
  480. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  481. size_t block_count = count / block;
  482. size_t elem_size = v->type->memSize;
  483. uintptr_t nextdst = (uintptr_t)v->data + (first * elem_size);
  484. uintptr_t nextsrc = (uintptr_t)array;
  485. if(v->type->fixedSize) {
  486. for(size_t i = 0; i < block_count; i++) {
  487. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block);
  488. nextsrc += block * elem_size;
  489. nextdst += stride * elem_size;
  490. }
  491. } else {
  492. for(size_t i = 0; i < block_count; i++) {
  493. for(size_t j = 0; j < block; j++) {
  494. UA_deleteMembers((void*)nextdst, v->type);
  495. retval |= UA_copy((void*)nextsrc, (void*)nextdst, v->type);
  496. nextdst += elem_size;
  497. nextsrc += elem_size;
  498. }
  499. nextdst += (stride - block) * elem_size;
  500. }
  501. }
  502. return retval;
  503. }
  504. void UA_Variant_setScalar(UA_Variant *v, void * UA_RESTRICT p, const UA_DataType *type) {
  505. UA_Variant_init(v);
  506. v->type = type;
  507. v->arrayLength = 0;
  508. v->data = p;
  509. }
  510. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  511. void *new = UA_malloc(type->memSize);
  512. if(!new)
  513. return UA_STATUSCODE_BADOUTOFMEMORY;
  514. UA_StatusCode retval = UA_copy(p, new, type);
  515. if(retval != UA_STATUSCODE_GOOD) {
  516. UA_free(new);
  517. //cppcheck-suppress memleak
  518. return retval;
  519. }
  520. UA_Variant_setScalar(v, new, type);
  521. //cppcheck-suppress memleak
  522. return UA_STATUSCODE_GOOD;
  523. }
  524. void
  525. UA_Variant_setArray(UA_Variant *v, void * UA_RESTRICT array,
  526. size_t arraySize, const UA_DataType *type) {
  527. UA_Variant_init(v);
  528. v->data = array;
  529. v->arrayLength = arraySize;
  530. v->type = type;
  531. }
  532. UA_StatusCode
  533. UA_Variant_setArrayCopy(UA_Variant *v, const void *array,
  534. size_t arraySize, const UA_DataType *type) {
  535. UA_Variant_init(v);
  536. UA_StatusCode retval = UA_Array_copy(array, arraySize, &v->data, type);
  537. if(retval != UA_STATUSCODE_GOOD)
  538. return retval;
  539. v->arrayLength = arraySize;
  540. v->type = type;
  541. return UA_STATUSCODE_GOOD;
  542. }
  543. /* LocalizedText */
  544. static void LocalizedText_deleteMembers(UA_LocalizedText *p, const UA_DataType *_) {
  545. UA_String_deleteMembers(&p->locale);
  546. UA_String_deleteMembers(&p->text);
  547. }
  548. static UA_StatusCode
  549. LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText *dst, const UA_DataType *_) {
  550. UA_StatusCode retval = UA_String_copy(&src->locale, &dst->locale);
  551. retval |= UA_String_copy(&src->text, &dst->text);
  552. return retval;
  553. }
  554. /* DataValue */
  555. static void DataValue_deleteMembers(UA_DataValue *p, const UA_DataType *_) {
  556. Variant_deletemembers(&p->value, NULL);
  557. }
  558. static UA_StatusCode
  559. DataValue_copy(UA_DataValue const *src, UA_DataValue *dst, const UA_DataType *_) {
  560. memcpy(dst, src, sizeof(UA_DataValue));
  561. UA_Variant_init(&dst->value);
  562. UA_StatusCode retval = Variant_copy(&src->value, &dst->value, NULL);
  563. if(retval != UA_STATUSCODE_GOOD)
  564. DataValue_deleteMembers(dst, NULL);
  565. return retval;
  566. }
  567. /* DiagnosticInfo */
  568. static void DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p, const UA_DataType *_) {
  569. UA_String_deleteMembers(&p->additionalInfo);
  570. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  571. DiagnosticInfo_deleteMembers(p->innerDiagnosticInfo, NULL);
  572. UA_free(p->innerDiagnosticInfo);
  573. p->innerDiagnosticInfo = NULL;
  574. p->hasInnerDiagnosticInfo = false;
  575. }
  576. }
  577. static UA_StatusCode
  578. DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst, const UA_DataType *_) {
  579. memcpy(dst, src, sizeof(UA_DiagnosticInfo));
  580. UA_String_init(&dst->additionalInfo);
  581. dst->innerDiagnosticInfo = NULL;
  582. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  583. if(src->hasAdditionalInfo)
  584. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  585. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  586. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  587. retval |= DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo, NULL);
  588. dst->hasInnerDiagnosticInfo = true;
  589. } else {
  590. dst->hasInnerDiagnosticInfo = false;
  591. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  592. }
  593. }
  594. if(retval != UA_STATUSCODE_GOOD)
  595. DiagnosticInfo_deleteMembers(dst, NULL);
  596. return retval;
  597. }
  598. /*******************/
  599. /* Structure Types */
  600. /*******************/
  601. void * UA_new(const UA_DataType *type) {
  602. void *p = UA_calloc(1, type->memSize);
  603. return p;
  604. }
  605. static UA_StatusCode copyByte(const void *src, void *dst, const UA_DataType *_) {
  606. memcpy(dst, src, sizeof(UA_Byte));
  607. return UA_STATUSCODE_GOOD;
  608. }
  609. static UA_StatusCode copy2Byte(const void *src, void *dst, const UA_DataType *_) {
  610. memcpy(dst, src, sizeof(UA_UInt16));
  611. return UA_STATUSCODE_GOOD;
  612. }
  613. static UA_StatusCode copy4Byte(const void *src, void *dst, const UA_DataType *_) {
  614. memcpy(dst, src, sizeof(UA_UInt32));
  615. return UA_STATUSCODE_GOOD;
  616. }
  617. static UA_StatusCode copy8Byte(const void *src, void *dst, const UA_DataType *_) {
  618. memcpy(dst, src, sizeof(UA_UInt64));
  619. return UA_STATUSCODE_GOOD;
  620. }
  621. static UA_StatusCode copyFixedSize(const void *src, void *dst, const UA_DataType *type) {
  622. memcpy(dst, src, type->memSize);
  623. return UA_STATUSCODE_GOOD;
  624. }
  625. static UA_StatusCode copyNoInit(const void *src, void *dst, const UA_DataType *type);
  626. typedef UA_StatusCode (*UA_copySignature)(const void *src, void *dst, const UA_DataType *type);
  627. static const UA_copySignature copyJumpTable[UA_BUILTIN_TYPES_COUNT + 1] = {
  628. (UA_copySignature)copyByte, // Boolean
  629. (UA_copySignature)copyByte, // SByte
  630. (UA_copySignature)copyByte, // Byte
  631. (UA_copySignature)copy2Byte, // Int16
  632. (UA_copySignature)copy2Byte, // UInt16
  633. (UA_copySignature)copy4Byte, // Int32
  634. (UA_copySignature)copy4Byte, // UInt32
  635. (UA_copySignature)copy8Byte, // Int64
  636. (UA_copySignature)copy8Byte, // UInt64
  637. (UA_copySignature)copy4Byte, // Float
  638. (UA_copySignature)copy8Byte, // Double
  639. (UA_copySignature)copyNoInit, // String
  640. (UA_copySignature)copy8Byte, // DateTime
  641. (UA_copySignature)copyFixedSize, // Guid
  642. (UA_copySignature)copyNoInit, // ByteString
  643. (UA_copySignature)copyNoInit, // XmlElement
  644. (UA_copySignature)NodeId_copy,
  645. (UA_copySignature)ExpandedNodeId_copy,
  646. (UA_copySignature)copy4Byte, // StatusCode
  647. (UA_copySignature)copyNoInit, // QualifiedName
  648. (UA_copySignature)LocalizedText_copy, // LocalizedText
  649. (UA_copySignature)ExtensionObject_copy,
  650. (UA_copySignature)DataValue_copy,
  651. (UA_copySignature)Variant_copy,
  652. (UA_copySignature)DiagnosticInfo_copy,
  653. (UA_copySignature)copyNoInit // all others
  654. };
  655. static UA_StatusCode copyNoInit(const void *src, void *dst, const UA_DataType *type) {
  656. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  657. uintptr_t ptrs = (uintptr_t)src;
  658. uintptr_t ptrd = (uintptr_t)dst;
  659. UA_Byte membersSize = type->membersSize;
  660. for(size_t i = 0; i < membersSize; i++) {
  661. const UA_DataTypeMember *member = &type->members[i];
  662. const UA_DataType *typelists[2] = { UA_TYPES, &type[-type->typeIndex] };
  663. const UA_DataType *memberType = &typelists[!member->namespaceZero][member->memberTypeIndex];
  664. if(!member->isArray) {
  665. ptrs += member->padding;
  666. ptrd += member->padding;
  667. size_t fi = memberType->builtin ? memberType->typeIndex : UA_BUILTIN_TYPES_COUNT;
  668. retval |= copyJumpTable[fi]((const void*)ptrs, (void*)ptrd, memberType);
  669. ptrs += memberType->memSize;
  670. ptrd += memberType->memSize;
  671. } else {
  672. ptrs += member->padding;
  673. ptrd += member->padding;
  674. size_t *dst_size = (size_t*)ptrd;
  675. const size_t size = *((const size_t*)ptrs);
  676. ptrs += sizeof(size_t);
  677. ptrd += sizeof(size_t);
  678. retval |= UA_Array_copy(*(void* const*)ptrs, size, (void**)ptrd, memberType);
  679. *dst_size = size;
  680. if(retval != UA_STATUSCODE_GOOD)
  681. *dst_size = 0;
  682. ptrs += sizeof(void*);
  683. ptrd += sizeof(void*);
  684. }
  685. }
  686. if(retval != UA_STATUSCODE_GOOD)
  687. UA_deleteMembers(dst, type);
  688. return retval;
  689. }
  690. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *type) {
  691. memset(dst, 0, type->memSize);
  692. return copyNoInit(src, dst, type);
  693. }
  694. typedef void (*UA_deleteMembersSignature)(void *p, const UA_DataType *type);
  695. static void nopDeleteMembers(void *p, const UA_DataType *type) { }
  696. static const UA_deleteMembersSignature deleteMembersJumpTable[UA_BUILTIN_TYPES_COUNT + 1] = {
  697. (UA_deleteMembersSignature)nopDeleteMembers, // Boolean
  698. (UA_deleteMembersSignature)nopDeleteMembers, // SByte
  699. (UA_deleteMembersSignature)nopDeleteMembers, // Byte
  700. (UA_deleteMembersSignature)nopDeleteMembers, // Int16
  701. (UA_deleteMembersSignature)nopDeleteMembers, // UInt16
  702. (UA_deleteMembersSignature)nopDeleteMembers, // Int32
  703. (UA_deleteMembersSignature)nopDeleteMembers, // UInt32
  704. (UA_deleteMembersSignature)nopDeleteMembers, // Int64
  705. (UA_deleteMembersSignature)nopDeleteMembers, // UInt64
  706. (UA_deleteMembersSignature)nopDeleteMembers, // Float
  707. (UA_deleteMembersSignature)nopDeleteMembers, // Double
  708. (UA_deleteMembersSignature)UA_deleteMembers, // String
  709. (UA_deleteMembersSignature)nopDeleteMembers, // DateTime
  710. (UA_deleteMembersSignature)nopDeleteMembers, // Guid
  711. (UA_deleteMembersSignature)UA_deleteMembers, // ByteString
  712. (UA_deleteMembersSignature)UA_deleteMembers, // XmlElement
  713. (UA_deleteMembersSignature)NodeId_deleteMembers,
  714. (UA_deleteMembersSignature)ExpandedNodeId_deleteMembers, // ExpandedNodeId
  715. (UA_deleteMembersSignature)nopDeleteMembers, // StatusCode
  716. (UA_deleteMembersSignature)UA_deleteMembers, // QualifiedName
  717. (UA_deleteMembersSignature)LocalizedText_deleteMembers, // LocalizedText
  718. (UA_deleteMembersSignature)ExtensionObject_deleteMembers,
  719. (UA_deleteMembersSignature)DataValue_deleteMembers,
  720. (UA_deleteMembersSignature)Variant_deletemembers,
  721. (UA_deleteMembersSignature)DiagnosticInfo_deleteMembers,
  722. (UA_deleteMembersSignature)UA_deleteMembers,
  723. };
  724. void UA_deleteMembers(void *p, const UA_DataType *type) {
  725. uintptr_t ptr = (uintptr_t)p;
  726. UA_Byte membersSize = type->membersSize;
  727. for(size_t i = 0; i < membersSize; i++) {
  728. const UA_DataTypeMember *member = &type->members[i];
  729. const UA_DataType *typelists[2] = { UA_TYPES, &type[-type->typeIndex] };
  730. const UA_DataType *memberType = &typelists[!member->namespaceZero][member->memberTypeIndex];
  731. if(!member->isArray) {
  732. ptr += member->padding;
  733. size_t fi = memberType->builtin ? memberType->typeIndex : UA_BUILTIN_TYPES_COUNT;
  734. deleteMembersJumpTable[fi]((void*)ptr, memberType);
  735. ptr += memberType->memSize;
  736. } else {
  737. ptr += member->padding;
  738. size_t length = *(size_t*)ptr;
  739. *(size_t*)ptr = 0;
  740. ptr += sizeof(size_t);
  741. UA_Array_delete(*(void**)ptr, length, memberType);
  742. *(void**)ptr = NULL;
  743. ptr += sizeof(void*);
  744. }
  745. }
  746. }
  747. void UA_delete(void *p, const UA_DataType *type) {
  748. UA_deleteMembers(p, type);
  749. UA_free(p);
  750. }
  751. /******************/
  752. /* Array Handling */
  753. /******************/
  754. void * UA_Array_new(size_t size, const UA_DataType *type) {
  755. if(size == 0)
  756. return UA_EMPTY_ARRAY_SENTINEL;
  757. return UA_calloc(size, type->memSize);
  758. }
  759. UA_StatusCode
  760. UA_Array_copy(const void *src, size_t src_size, void **dst, const UA_DataType *type) {
  761. if(src_size == 0) {
  762. if(src == NULL)
  763. *dst = NULL;
  764. else
  765. *dst= UA_EMPTY_ARRAY_SENTINEL;
  766. return UA_STATUSCODE_GOOD;
  767. }
  768. if(!type)
  769. return UA_STATUSCODE_BADINTERNALERROR;
  770. /* calloc, so we don't have to check retval in every iteration of copying */
  771. *dst = UA_calloc(src_size, type->memSize);
  772. if(!*dst)
  773. return UA_STATUSCODE_BADOUTOFMEMORY;
  774. if(type->fixedSize) {
  775. memcpy(*dst, src, type->memSize * src_size);
  776. return UA_STATUSCODE_GOOD;
  777. }
  778. uintptr_t ptrs = (uintptr_t)src;
  779. uintptr_t ptrd = (uintptr_t)*dst;
  780. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  781. for(size_t i = 0; i < src_size; i++) {
  782. retval |= UA_copy((void*)ptrs, (void*)ptrd, type);
  783. ptrs += type->memSize;
  784. ptrd += type->memSize;
  785. }
  786. if(retval != UA_STATUSCODE_GOOD) {
  787. UA_Array_delete(*dst, src_size, type);
  788. *dst = NULL;
  789. }
  790. return retval;
  791. }
  792. void UA_Array_delete(void *p, size_t size, const UA_DataType *type) {
  793. if(!type->fixedSize) {
  794. uintptr_t ptr = (uintptr_t)p;
  795. for(size_t i = 0; i < size; i++) {
  796. UA_deleteMembers((void*)ptr, type);
  797. ptr += type->memSize;
  798. }
  799. }
  800. UA_free((void*)((uintptr_t)p & ~(uintptr_t)UA_EMPTY_ARRAY_SENTINEL));
  801. }