ua_types.c 31 KB

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