ua_types.c 31 KB

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