ua_types.c 31 KB

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