ua_types.c 31 KB

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