ua_types.c 31 KB

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