ua_types.c 30 KB

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