ua_types.c 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248
  1. #include "ua_util.h"
  2. #include "ua_types.h"
  3. #include "ua_statuscodes.h"
  4. #include "ua_types_generated.h"
  5. /*****************/
  6. /* Helper Macros */
  7. /*****************/
  8. #define UA_TYPE_DEFAULT(TYPE) \
  9. UA_TYPE_NEW_DEFAULT(TYPE) \
  10. UA_TYPE_INIT_DEFAULT(TYPE) \
  11. UA_TYPE_DELETEMEMBERS_NOACTION(TYPE) \
  12. UA_TYPE_DELETE_DEFAULT(TYPE) \
  13. UA_TYPE_COPY_DEFAULT(TYPE) \
  14. #define UA_TYPE_NEW_DEFAULT(TYPE) \
  15. TYPE * TYPE##_new() { \
  16. TYPE *p = UA_malloc(sizeof(TYPE)); \
  17. if(p) TYPE##_init(p); \
  18. return p; \
  19. }
  20. #define UA_TYPE_INIT_DEFAULT(TYPE) \
  21. void TYPE##_init(TYPE * p) { \
  22. *p = (TYPE)0; \
  23. }
  24. #define UA_TYPE_DELETEMEMBERS_NOACTION(TYPE) \
  25. void TYPE##_deleteMembers(TYPE *p) { \
  26. }
  27. #define UA_TYPE_DELETE_DEFAULT(TYPE) \
  28. void TYPE##_delete(TYPE *p) { \
  29. TYPE##_deleteMembers(p); \
  30. UA_free(p); \
  31. }
  32. #define UA_TYPE_COPY_DEFAULT(TYPE) \
  33. UA_StatusCode TYPE##_copy(TYPE const *src, TYPE *dst) { \
  34. *dst = *src; \
  35. return UA_STATUSCODE_GOOD; \
  36. }
  37. /*****************/
  38. /* Builtin Types */
  39. /*****************/
  40. /* Boolean */
  41. UA_TYPE_DEFAULT(UA_Boolean)
  42. /* SByte */
  43. UA_TYPE_DEFAULT(UA_SByte)
  44. /* Byte */
  45. UA_TYPE_DEFAULT(UA_Byte)
  46. /* Int16 */
  47. UA_TYPE_DEFAULT(UA_Int16)
  48. /* UInt16 */
  49. UA_TYPE_DEFAULT(UA_UInt16)
  50. /* Int32 */
  51. UA_TYPE_DEFAULT(UA_Int32)
  52. /* UInt32 */
  53. UA_TYPE_DEFAULT(UA_UInt32)
  54. /* Int64 */
  55. UA_TYPE_DEFAULT(UA_Int64)
  56. /* UInt64 */
  57. UA_TYPE_DEFAULT(UA_UInt64)
  58. /* Float */
  59. UA_TYPE_DEFAULT(UA_Float)
  60. /* Double */
  61. UA_TYPE_DEFAULT(UA_Double)
  62. /* String */
  63. UA_TYPE_NEW_DEFAULT(UA_String)
  64. UA_TYPE_DELETE_DEFAULT(UA_String)
  65. void UA_String_init(UA_String *p) {
  66. p->length = -1;
  67. p->data = UA_NULL;
  68. }
  69. void UA_String_deleteMembers(UA_String *p) {
  70. UA_free(p->data);
  71. p->data = UA_NULL;
  72. }
  73. UA_StatusCode UA_String_copy(UA_String const *src, UA_String *dst) {
  74. UA_String_init(dst);
  75. if(src->length > 0) {
  76. if(!(dst->data = UA_malloc((UA_UInt32)src->length)))
  77. return UA_STATUSCODE_BADOUTOFMEMORY;
  78. UA_memcpy((void *)dst->data, src->data, (UA_UInt32)src->length);
  79. }
  80. dst->length = src->length;
  81. return UA_STATUSCODE_GOOD;
  82. }
  83. UA_String UA_String_fromChars(char const src[]) {
  84. UA_String str;
  85. size_t length = strlen(src);
  86. if(length == 0) {
  87. str.length = 0;
  88. str.data = UA_NULL;
  89. return str;
  90. }
  91. str.data = UA_malloc(length);
  92. if(!str.data) {
  93. str.length = -1;
  94. return str;
  95. }
  96. UA_memcpy(str.data, src, length);
  97. str.length = length;
  98. return str;
  99. }
  100. #define UA_STRING_ALLOCPRINTF_BUFSIZE 1024
  101. UA_StatusCode UA_String_copyprintf(char const fmt[], UA_String *dst, ...) {
  102. char src[UA_STRING_ALLOCPRINTF_BUFSIZE];
  103. va_list ap;
  104. va_start(ap, dst);
  105. #if defined(__GNUC__) || defined(__clang__)
  106. #pragma GCC diagnostic push
  107. #pragma GCC diagnostic ignored "-Wformat-nonliteral"
  108. #endif
  109. // vsnprintf should only take a literal and no variable to be secure
  110. UA_Int32 len = vsnprintf(src, UA_STRING_ALLOCPRINTF_BUFSIZE, fmt, ap);
  111. #if defined(__GNUC__) || defined(__clang__)
  112. #pragma GCC diagnostic pop
  113. #endif
  114. va_end(ap);
  115. if(len < 0) // FIXME: old glibc 2.0 would return -1 when truncated
  116. return UA_STATUSCODE_BADINTERNALERROR;
  117. // since glibc 2.1 vsnprintf returns the len that would have resulted if buf were large enough
  118. len = ( len > UA_STRING_ALLOCPRINTF_BUFSIZE ? UA_STRING_ALLOCPRINTF_BUFSIZE : len );
  119. if(!(dst->data = UA_malloc((UA_UInt32)len)))
  120. return UA_STATUSCODE_BADOUTOFMEMORY;
  121. UA_memcpy((void *)dst->data, src, (UA_UInt32)len);
  122. dst->length = len;
  123. return UA_STATUSCODE_GOOD;
  124. }
  125. UA_Boolean UA_String_equal(const UA_String *string1, const UA_String *string2) {
  126. if(string1->length <= 0 && string2->length <= 0)
  127. return UA_TRUE;
  128. if(string1->length != string2->length)
  129. return UA_FALSE;
  130. // casts are needed to overcome signed warnings
  131. UA_Int32 is = strncmp((char const *)string1->data, (char const *)string2->data, (size_t)string1->length);
  132. return (is == 0) ? UA_TRUE : UA_FALSE;
  133. }
  134. UA_Boolean UA_String_equalchars(const UA_String *string1, char *charString) {
  135. UA_String string2 = UA_STRING(charString);
  136. return UA_String_equal(string1, &string2);
  137. }
  138. /* DateTime */
  139. #define UNIX_EPOCH_BIAS_SEC 11644473600LL // Number of seconds from 1 Jan. 1601 00:00 to 1 Jan 1970 00:00 UTC
  140. #define HUNDRED_NANOSEC_PER_USEC 10LL
  141. #define HUNDRED_NANOSEC_PER_SEC (HUNDRED_NANOSEC_PER_USEC * 1000000LL)
  142. #ifdef __MINGW32__
  143. #ifndef _TIMEZONE_DEFINED
  144. #define _TIMEZONE_DEFINED
  145. struct timezone {
  146. int tz_minuteswest;
  147. int tz_dsttime;
  148. };
  149. #endif
  150. #endif
  151. #ifdef _WIN32
  152. static const unsigned __int64 epoch = 116444736000000000;
  153. int gettimeofday(struct timeval *tp, struct timezone *tzp);
  154. int gettimeofday(struct timeval *tp, struct timezone *tzp) {
  155. FILETIME ft;
  156. SYSTEMTIME st;
  157. ULARGE_INTEGER ul;
  158. GetSystemTime(&st);
  159. SystemTimeToFileTime(&st, &ft);
  160. ul.LowPart = ft.dwLowDateTime;
  161. ul.HighPart = ft.dwHighDateTime;
  162. tp->tv_sec = (ul.QuadPart - epoch) / 10000000L;
  163. tp->tv_usec = st.wMilliseconds * 1000;
  164. return 0;
  165. }
  166. #endif
  167. UA_DateTime UA_DateTime_now() {
  168. UA_DateTime dateTime;
  169. struct timeval tv;
  170. gettimeofday(&tv, UA_NULL);
  171. dateTime = (tv.tv_sec + UNIX_EPOCH_BIAS_SEC)
  172. * HUNDRED_NANOSEC_PER_SEC + tv.tv_usec * HUNDRED_NANOSEC_PER_USEC;
  173. return dateTime;
  174. }
  175. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime atime) {
  176. UA_DateTimeStruct dateTimeStruct;
  177. //calcualting the the milli-, micro- and nanoseconds
  178. dateTimeStruct.nanoSec = (UA_Int16)((atime % 10) * 100);
  179. dateTimeStruct.microSec = (UA_Int16)((atime % 10000) / 10);
  180. dateTimeStruct.milliSec = (UA_Int16)((atime % 10000000) / 10000);
  181. //calculating the unix time with #include <time.h>
  182. time_t secSinceUnixEpoch = (atime/10000000) - UNIX_EPOCH_BIAS_SEC;
  183. struct tm ts = *gmtime(&secSinceUnixEpoch);
  184. dateTimeStruct.sec = (UA_Int16)ts.tm_sec;
  185. dateTimeStruct.min = (UA_Int16)ts.tm_min;
  186. dateTimeStruct.hour = (UA_Int16)ts.tm_hour;
  187. dateTimeStruct.day = (UA_Int16)ts.tm_mday;
  188. dateTimeStruct.month = (UA_Int16)(ts.tm_mon + 1);
  189. dateTimeStruct.year = (UA_Int16)(ts.tm_year + 1900);
  190. return dateTimeStruct;
  191. }
  192. UA_StatusCode UA_DateTime_toString(UA_DateTime atime, UA_String *timeString) {
  193. // length of the string is 31 (incl. \0 at the end)
  194. if(!(timeString->data = UA_malloc(32)))
  195. return UA_STATUSCODE_BADOUTOFMEMORY;
  196. timeString->length = 31;
  197. UA_DateTimeStruct tSt = UA_DateTime_toStruct(atime);
  198. sprintf((char*)timeString->data, "%02d/%02d/%04d %02d:%02d:%02d.%03d.%03d.%03d", tSt.month, tSt.day, tSt.year,
  199. tSt.hour, tSt.min, tSt.sec, tSt.milliSec, tSt.microSec, tSt.nanoSec);
  200. return UA_STATUSCODE_GOOD;
  201. }
  202. /* Guid */
  203. UA_TYPE_NEW_DEFAULT(UA_Guid)
  204. UA_TYPE_DELETEMEMBERS_NOACTION(UA_Guid)
  205. UA_TYPE_DELETE_DEFAULT(UA_Guid)
  206. UA_Boolean UA_Guid_equal(const UA_Guid *g1, const UA_Guid *g2) {
  207. if(memcmp(g1, g2, sizeof(UA_Guid)) == 0)
  208. return UA_TRUE;
  209. return UA_FALSE;
  210. }
  211. UA_Guid UA_Guid_random(UA_UInt32 *seed) {
  212. UA_Guid result;
  213. result.data1 = RAND(seed);
  214. UA_UInt32 r = RAND(seed);
  215. result.data2 = (UA_UInt16) r;
  216. result.data3 = (UA_UInt16) (r >> 16);
  217. r = RAND(seed);
  218. result.data4[0] = (UA_Byte)r;
  219. result.data4[1] = (UA_Byte)(r >> 4);
  220. result.data4[2] = (UA_Byte)(r >> 8);
  221. result.data4[3] = (UA_Byte)(r >> 12);
  222. r = RAND(seed);
  223. result.data4[4] = (UA_Byte)r;
  224. result.data4[5] = (UA_Byte)(r >> 4);
  225. result.data4[6] = (UA_Byte)(r >> 8);
  226. result.data4[7] = (UA_Byte)(r >> 12);
  227. return result;
  228. }
  229. void UA_Guid_init(UA_Guid *p) {
  230. p->data1 = 0;
  231. p->data2 = 0;
  232. p->data3 = 0;
  233. memset(p->data4, 0, sizeof(UA_Byte)*8);
  234. }
  235. UA_StatusCode UA_Guid_copy(UA_Guid const *src, UA_Guid *dst) {
  236. UA_memcpy((void *)dst, (const void *)src, sizeof(UA_Guid));
  237. return UA_STATUSCODE_GOOD;
  238. }
  239. /* ByteString */
  240. UA_StatusCode UA_ByteString_newMembers(UA_ByteString *p, UA_Int32 length) {
  241. if(length > 0) {
  242. if(!(p->data = UA_malloc((UA_UInt32)length)))
  243. return UA_STATUSCODE_BADOUTOFMEMORY;
  244. p->length = length;
  245. } else {
  246. p->data = UA_NULL;
  247. if(length == 0)
  248. p->length = 0;
  249. else
  250. p->length = -1;
  251. }
  252. return UA_STATUSCODE_GOOD;
  253. }
  254. /* XmlElement */
  255. /* NodeId */
  256. UA_TYPE_NEW_DEFAULT(UA_NodeId)
  257. UA_TYPE_DELETE_DEFAULT(UA_NodeId)
  258. void UA_NodeId_init(UA_NodeId *p) {
  259. p->identifierType = UA_NODEIDTYPE_NUMERIC;
  260. p->namespaceIndex = 0;
  261. memset(&p->identifier, 0, sizeof(p->identifier));
  262. }
  263. UA_StatusCode UA_NodeId_copy(UA_NodeId const *src, UA_NodeId *dst) {
  264. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  265. switch(src->identifierType) {
  266. case UA_NODEIDTYPE_NUMERIC:
  267. *dst = *src;
  268. return UA_STATUSCODE_GOOD;
  269. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  270. retval |= UA_String_copy(&src->identifier.string, &dst->identifier.string);
  271. break;
  272. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  273. retval |= UA_Guid_copy(&src->identifier.guid, &dst->identifier.guid);
  274. break;
  275. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  276. retval |= UA_ByteString_copy(&src->identifier.byteString, &dst->identifier.byteString);
  277. break;
  278. default:
  279. UA_NodeId_init(dst);
  280. return UA_STATUSCODE_BADINTERNALERROR;
  281. }
  282. dst->namespaceIndex = src->namespaceIndex;
  283. dst->identifierType = src->identifierType;
  284. if(retval) {
  285. UA_NodeId_deleteMembers(dst);
  286. UA_NodeId_init(dst);
  287. }
  288. return retval;
  289. }
  290. void UA_NodeId_deleteMembers(UA_NodeId *p) {
  291. switch(p->identifierType) {
  292. case UA_NODEIDTYPE_STRING:
  293. case UA_NODEIDTYPE_BYTESTRING:
  294. UA_ByteString_deleteMembers(&p->identifier.byteString);
  295. break;
  296. default:
  297. break;
  298. }
  299. }
  300. UA_Boolean UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2) {
  301. if(n1->namespaceIndex != n2->namespaceIndex || n1->identifierType!=n2->identifierType)
  302. return UA_FALSE;
  303. switch(n1->identifierType) {
  304. case UA_NODEIDTYPE_NUMERIC:
  305. if(n1->identifier.numeric == n2->identifier.numeric)
  306. return UA_TRUE;
  307. else
  308. return UA_FALSE;
  309. case UA_NODEIDTYPE_STRING:
  310. return UA_String_equal(&n1->identifier.string, &n2->identifier.string);
  311. case UA_NODEIDTYPE_GUID:
  312. return UA_Guid_equal(&n1->identifier.guid, &n2->identifier.guid);
  313. case UA_NODEIDTYPE_BYTESTRING:
  314. return UA_ByteString_equal(&n1->identifier.byteString, &n2->identifier.byteString);
  315. }
  316. return UA_FALSE;
  317. }
  318. UA_Boolean UA_NodeId_isNull(const UA_NodeId *p) {
  319. switch(p->identifierType) {
  320. case UA_NODEIDTYPE_NUMERIC:
  321. if(p->namespaceIndex != 0 || p->identifier.numeric != 0)
  322. return UA_FALSE;
  323. break;
  324. case UA_NODEIDTYPE_STRING:
  325. if(p->namespaceIndex != 0 || p->identifier.string.length > 0)
  326. return UA_FALSE;
  327. break;
  328. case UA_NODEIDTYPE_GUID:
  329. if(p->namespaceIndex != 0 ||
  330. memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]) { 0 }, sizeof(UA_Guid)) != 0)
  331. return UA_FALSE;
  332. break;
  333. case UA_NODEIDTYPE_BYTESTRING:
  334. if(p->namespaceIndex != 0 || p->identifier.byteString.length > 0)
  335. return UA_FALSE;
  336. break;
  337. default:
  338. return UA_FALSE;
  339. }
  340. return UA_TRUE;
  341. }
  342. UA_NodeId UA_NodeId_fromInteger(UA_UInt16 nsIndex, UA_Int32 identifier) {
  343. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_NUMERIC,
  344. .identifier.numeric = identifier };
  345. }
  346. UA_NodeId UA_NodeId_fromCharString(UA_UInt16 nsIndex, char identifier[]) {
  347. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  348. .identifier.string = UA_STRING(identifier) };
  349. }
  350. UA_NodeId UA_NodeId_fromCharStringCopy(UA_UInt16 nsIndex, char const identifier[]) {
  351. return (UA_NodeId) {.namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  352. .identifier.string = UA_STRING_ALLOC(identifier) };
  353. }
  354. UA_NodeId UA_NodeId_fromString(UA_UInt16 nsIndex, UA_String identifier) {
  355. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  356. .identifier.string = identifier };
  357. }
  358. UA_NodeId UA_NodeId_fromStringCopy(UA_UInt16 nsIndex, UA_String identifier) {
  359. UA_NodeId id;
  360. id.namespaceIndex = nsIndex;
  361. id.identifierType = UA_NODEIDTYPE_STRING;
  362. UA_String_copy(&identifier, &id.identifier.string);
  363. return id;
  364. }
  365. UA_NodeId UA_NodeId_fromGuid(UA_UInt16 nsIndex, UA_Guid identifier) {
  366. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_GUID,
  367. .identifier.guid = identifier };
  368. }
  369. UA_NodeId UA_NodeId_fromCharByteString(UA_UInt16 nsIndex, char identifier[]) {
  370. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  371. .identifier.byteString = UA_STRING(identifier) };
  372. }
  373. UA_NodeId UA_NodeId_fromCharByteStringCopy(UA_UInt16 nsIndex, char const identifier[]) {
  374. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  375. .identifier.byteString = UA_STRING_ALLOC(identifier) };
  376. }
  377. UA_NodeId UA_NodeId_fromByteString(UA_UInt16 nsIndex, UA_ByteString identifier) {
  378. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  379. .identifier.byteString = identifier };
  380. }
  381. UA_NodeId UA_NodeId_fromByteStringCopy(UA_UInt16 nsIndex, UA_ByteString identifier) {
  382. UA_NodeId id;
  383. id.namespaceIndex = nsIndex;
  384. id.identifierType = UA_NODEIDTYPE_BYTESTRING;
  385. UA_ByteString_copy(&identifier, &id.identifier.byteString);
  386. return id;
  387. }
  388. /* ExpandedNodeId */
  389. UA_TYPE_NEW_DEFAULT(UA_ExpandedNodeId)
  390. UA_TYPE_DELETE_DEFAULT(UA_ExpandedNodeId)
  391. void UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId *p) {
  392. UA_NodeId_deleteMembers(&p->nodeId);
  393. UA_String_deleteMembers(&p->namespaceUri);
  394. }
  395. void UA_ExpandedNodeId_init(UA_ExpandedNodeId *p) {
  396. UA_NodeId_init(&p->nodeId);
  397. UA_String_init(&p->namespaceUri);
  398. p->serverIndex = 0;
  399. }
  400. UA_StatusCode UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  401. UA_StatusCode retval = UA_NodeId_copy(&src->nodeId, &dst->nodeId);
  402. retval |= UA_String_copy(&src->namespaceUri, &dst->namespaceUri);
  403. dst->serverIndex = src->serverIndex;
  404. if(retval) {
  405. UA_ExpandedNodeId_deleteMembers(dst);
  406. UA_ExpandedNodeId_init(dst);
  407. }
  408. return retval;
  409. }
  410. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId *p) {
  411. return UA_NodeId_isNull(&p->nodeId);
  412. }
  413. /* StatusCode */
  414. /* QualifiedName */
  415. UA_TYPE_NEW_DEFAULT(UA_QualifiedName)
  416. UA_TYPE_DELETE_DEFAULT(UA_QualifiedName)
  417. void UA_QualifiedName_deleteMembers(UA_QualifiedName *p) {
  418. UA_String_deleteMembers(&p->name);
  419. }
  420. void UA_QualifiedName_init(UA_QualifiedName *p) {
  421. UA_String_init(&p->name);
  422. p->namespaceIndex = 0;
  423. }
  424. UA_StatusCode UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  425. UA_StatusCode retval = UA_String_copy(&src->name, &dst->name);
  426. dst->namespaceIndex = src->namespaceIndex;
  427. if(retval) {
  428. UA_QualifiedName_deleteMembers(dst);
  429. UA_QualifiedName_init(dst);
  430. }
  431. return retval;
  432. }
  433. /* LocalizedText */
  434. UA_TYPE_NEW_DEFAULT(UA_LocalizedText)
  435. UA_TYPE_DELETE_DEFAULT(UA_LocalizedText)
  436. void UA_LocalizedText_deleteMembers(UA_LocalizedText *p) {
  437. UA_String_deleteMembers(&p->locale);
  438. UA_String_deleteMembers(&p->text);
  439. }
  440. void UA_LocalizedText_init(UA_LocalizedText *p) {
  441. UA_String_init(&p->locale);
  442. UA_String_init(&p->text);
  443. }
  444. UA_StatusCode UA_LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText *dst) {
  445. UA_StatusCode retval = UA_String_copy(&src->locale, &dst->locale);
  446. retval |= UA_String_copy(&src->text, &dst->text);
  447. if(retval) {
  448. UA_LocalizedText_deleteMembers(dst);
  449. UA_LocalizedText_init(dst);
  450. }
  451. return retval;
  452. }
  453. /* ExtensionObject */
  454. UA_TYPE_NEW_DEFAULT(UA_ExtensionObject)
  455. UA_TYPE_DELETE_DEFAULT(UA_ExtensionObject)
  456. void UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  457. UA_NodeId_deleteMembers(&p->typeId);
  458. UA_ByteString_deleteMembers(&p->body);
  459. }
  460. void UA_ExtensionObject_init(UA_ExtensionObject *p) {
  461. UA_NodeId_init(&p->typeId);
  462. p->encoding = UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED;
  463. UA_ByteString_init(&p->body);
  464. }
  465. UA_StatusCode UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  466. UA_StatusCode retval = UA_ByteString_copy(&src->body, &dst->body);
  467. retval |= UA_NodeId_copy(&src->typeId, &dst->typeId);
  468. dst->encoding = src->encoding;
  469. if(retval) {
  470. UA_ExtensionObject_deleteMembers(dst);
  471. UA_ExtensionObject_init(dst);
  472. }
  473. return retval;
  474. }
  475. /* DataValue */
  476. UA_TYPE_NEW_DEFAULT(UA_DataValue)
  477. UA_TYPE_DELETE_DEFAULT(UA_DataValue)
  478. void UA_DataValue_deleteMembers(UA_DataValue *p) {
  479. UA_Variant_deleteMembers(&p->value);
  480. }
  481. void UA_DataValue_init(UA_DataValue *p) {
  482. *((UA_Byte*)p) = 0; // zero out the bitfield
  483. p->serverPicoseconds = 0;
  484. UA_DateTime_init(&p->serverTimestamp);
  485. p->sourcePicoseconds = 0;
  486. UA_DateTime_init(&p->sourceTimestamp);
  487. UA_StatusCode_init(&p->status);
  488. UA_Variant_init(&p->value);
  489. }
  490. UA_StatusCode UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst) {
  491. UA_DataValue_init(dst);
  492. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  493. UA_StatusCode retval = UA_DateTime_copy(&src->serverTimestamp, &dst->serverTimestamp);
  494. retval |= UA_DateTime_copy(&src->sourceTimestamp, &dst->sourceTimestamp);
  495. retval |= UA_Variant_copy(&src->value, &dst->value);
  496. dst->serverPicoseconds = src->serverPicoseconds;
  497. dst->sourcePicoseconds = src->sourcePicoseconds;
  498. dst->status = src->status;
  499. if(retval) {
  500. UA_DataValue_deleteMembers(dst);
  501. UA_DataValue_init(dst);
  502. }
  503. return retval;
  504. }
  505. /* Variant */
  506. UA_TYPE_NEW_DEFAULT(UA_Variant)
  507. UA_TYPE_DELETE_DEFAULT(UA_Variant)
  508. void UA_Variant_init(UA_Variant *p) {
  509. p->storageType = UA_VARIANT_DATA;
  510. p->arrayLength = -1;
  511. p->data = UA_NULL;
  512. p->arrayDimensions = UA_NULL;
  513. p->arrayDimensionsSize = -1;
  514. p->type = &UA_TYPES[UA_TYPES_BOOLEAN];
  515. }
  516. void UA_Variant_deleteMembers(UA_Variant *p) {
  517. if(p->storageType != UA_VARIANT_DATA)
  518. return;
  519. if(p->data) {
  520. if(p->arrayLength == -1)
  521. p->arrayLength = 1;
  522. UA_Array_delete(p->data, p->type, p->arrayLength);
  523. p->data = UA_NULL;
  524. p->arrayLength = -1;
  525. }
  526. if(p->arrayDimensions) {
  527. UA_free(p->arrayDimensions);
  528. p->arrayDimensions = UA_NULL;
  529. p->arrayDimensionsSize = -1;
  530. }
  531. }
  532. UA_StatusCode UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  533. UA_Variant_init(dst);
  534. UA_Int32 elements = src->arrayLength;
  535. if(UA_Variant_isScalar(src))
  536. elements = 1;
  537. UA_StatusCode retval = UA_Array_copy(src->data, &dst->data, src->type, elements);
  538. if(retval != UA_STATUSCODE_GOOD) {
  539. UA_Variant_deleteMembers(dst);
  540. UA_Variant_init(dst);
  541. return retval;
  542. }
  543. dst->arrayLength = src->arrayLength;
  544. dst->type = src->type;
  545. dst->storageType = UA_VARIANT_DATA;
  546. if(src->arrayDimensions) {
  547. retval |= UA_Array_copy(src->arrayDimensions, (void **)&dst->arrayDimensions,
  548. &UA_TYPES[UA_TYPES_INT32], src->arrayDimensionsSize);
  549. if(retval != UA_STATUSCODE_GOOD) {
  550. UA_Variant_deleteMembers(dst);
  551. UA_Variant_init(dst);
  552. return retval;
  553. }
  554. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  555. }
  556. return retval;
  557. }
  558. UA_Boolean UA_Variant_isScalar(const UA_Variant *v) {
  559. return (v->data != UA_NULL && v->arrayLength == -1);
  560. }
  561. /**
  562. * Tests if a range is compatible with a variant. If yes, the following values are set:
  563. * - total: how many elements are indicated by the range
  564. * - block_size: how big is each contiguous block of elements in the variant denoted by the range
  565. * - block_distance: how many elements are between the blocks (beginning to beginning)
  566. * - first_elem: where does the first block begin
  567. */
  568. static UA_StatusCode
  569. testRangeWithVariant(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  570. size_t *block_size, size_t *block_distance, size_t *first_elem)
  571. {
  572. /* Test the integrity of the source variant dimensions */
  573. UA_Int32 dims_count = 1;
  574. const UA_Int32 *dims = &v->arrayLength; // default: the array has only one dimension
  575. if(v->arrayDimensionsSize > 0) {
  576. dims_count = v->arrayDimensionsSize;
  577. dims = v->arrayDimensions;
  578. UA_Int32 elements = 1;
  579. for(UA_Int32 i = 0; i < dims_count; i++)
  580. elements *= dims[i];
  581. if(elements != v->arrayLength)
  582. return UA_STATUSCODE_BADINTERNALERROR;
  583. }
  584. /* Test the integrity of the range */
  585. size_t count = 1;
  586. if(range.dimensionsSize != dims_count)
  587. return UA_STATUSCODE_BADINTERNALERROR;
  588. for(UA_Int32 i = 0; i < dims_count; i++) {
  589. if(range.dimensions[i].min > range.dimensions[i].max)
  590. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  591. if(range.dimensions[i].max > (UA_UInt32)*(dims+i))
  592. return UA_STATUSCODE_BADINDEXRANGENODATA;
  593. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  594. }
  595. /* Compute the block size and the position of the first element */
  596. size_t bs = 0;
  597. size_t bd = 0;
  598. size_t fe = 0;
  599. size_t running_dimssize = 1; // elements per block of dimensions k to k_max
  600. UA_Boolean found_contiguous = UA_FALSE;
  601. for(UA_Int32 k = dims_count - 1; k >= 0; k--) {
  602. if(!found_contiguous && (range.dimensions[k].min != 0 ||
  603. range.dimensions[k].max + 1 != (UA_UInt32)dims[k])) {
  604. found_contiguous = UA_TRUE;
  605. bs = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  606. bd = dims[k] * running_dimssize;
  607. }
  608. fe += running_dimssize * range.dimensions[k].min;
  609. running_dimssize *= dims[k];
  610. }
  611. *total = count;
  612. *block_size = bs;
  613. *block_distance = bd;
  614. *first_elem = fe;
  615. return UA_STATUSCODE_GOOD;
  616. }
  617. UA_StatusCode UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  618. size_t count, block_size, block_distance, first_elem;
  619. UA_StatusCode retval = testRangeWithVariant(src, range, &count, &block_size, &block_distance, &first_elem);
  620. if(retval != UA_STATUSCODE_GOOD)
  621. return retval;
  622. UA_Variant_init(dst);
  623. size_t elem_size = src->type->memSize;
  624. dst->data = UA_malloc(elem_size * count);
  625. if(!dst->data)
  626. return UA_STATUSCODE_BADOUTOFMEMORY;
  627. /* Copy the range */
  628. size_t block_count = count / block_size;
  629. uintptr_t nextdst = (uintptr_t)dst->data;
  630. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first_elem);
  631. if(src->type->fixedSize) {
  632. for(size_t i = 0; i < block_count; i++) {
  633. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  634. nextdst += block_size * elem_size;
  635. nextsrc += block_distance * elem_size;
  636. }
  637. } else {
  638. for(size_t i = 0; i < block_count; i++) {
  639. for(size_t j = 0; j < block_size && retval == UA_STATUSCODE_GOOD; j++) {
  640. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  641. nextdst += elem_size;
  642. nextsrc += elem_size;
  643. }
  644. nextsrc += (block_distance - block_size) * elem_size;
  645. }
  646. if(retval != UA_STATUSCODE_GOOD) {
  647. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  648. UA_Array_delete(dst->data, src->type, copied);
  649. return retval;
  650. }
  651. }
  652. /* Copy the range dimensions*/
  653. if(src->arrayDimensionsSize > 0) {
  654. dst->arrayDimensions = UA_malloc(sizeof(UA_Int32) * src->arrayDimensionsSize);
  655. if(!dst->arrayDimensions) {
  656. UA_Array_delete(dst->data, src->type, count);
  657. return UA_STATUSCODE_BADOUTOFMEMORY;
  658. }
  659. for(UA_Int32 k = 0; k < src->arrayDimensionsSize; k++)
  660. dst->arrayDimensions[k] = range.dimensions[k].max - range.dimensions[k].min + 1;
  661. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  662. }
  663. dst->arrayLength = count;
  664. dst->type = src->type;
  665. return UA_STATUSCODE_GOOD;
  666. }
  667. UA_StatusCode UA_Variant_setRange(UA_Variant *v, void *data, const UA_NumericRange range) {
  668. size_t count, block_size, block_distance, first_elem;
  669. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  670. if(retval != UA_STATUSCODE_GOOD)
  671. return retval;
  672. size_t block_count = count / block_size;
  673. size_t elem_size = v->type->memSize;
  674. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  675. uintptr_t nextsrc = (uintptr_t)data;
  676. if(v->type->fixedSize) {
  677. for(size_t i = 0; i < block_count; i++) {
  678. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  679. nextdst += block_size * elem_size;
  680. nextsrc += block_distance * elem_size;
  681. }
  682. } else {
  683. for(size_t i = 0; i < block_count; i++) {
  684. for(size_t j = 0; j < block_size; j++) {
  685. UA_deleteMembers((void*)nextdst, v->type);
  686. nextdst += elem_size;
  687. }
  688. nextdst -= block_size * elem_size;
  689. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  690. nextdst += block_size * elem_size;
  691. nextsrc += block_distance * elem_size;
  692. }
  693. }
  694. return UA_STATUSCODE_GOOD;
  695. }
  696. UA_StatusCode UA_Variant_setCopyRange(const UA_Variant *src, UA_Variant *dst, void *data,
  697. const UA_NumericRange range) {
  698. // todo: don't copy the entire variant but only the retained parts
  699. UA_StatusCode retval = UA_Variant_copy(src, dst);
  700. if(retval != UA_STATUSCODE_GOOD)
  701. return retval;
  702. retval = UA_Variant_setRange(dst, data, range);
  703. if(retval != UA_STATUSCODE_GOOD) {
  704. UA_Variant_deleteMembers(dst);
  705. return retval;
  706. }
  707. return UA_STATUSCODE_GOOD;
  708. }
  709. UA_StatusCode UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type) {
  710. return UA_Variant_setArray(v, p, -1, type);
  711. }
  712. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  713. void *new = UA_malloc(type->memSize);
  714. if(!new)
  715. return UA_STATUSCODE_BADOUTOFMEMORY;
  716. UA_StatusCode retval = UA_copy(p, new, type);
  717. if(retval != UA_STATUSCODE_GOOD) {
  718. UA_delete(new, type);
  719. return retval;
  720. }
  721. return UA_Variant_setArray(v, new, -1, type);
  722. }
  723. UA_StatusCode UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 noElements,
  724. const UA_DataType *type) {
  725. v->type = type;
  726. v->arrayLength = noElements;
  727. v->data = array;
  728. return UA_STATUSCODE_GOOD;
  729. }
  730. UA_StatusCode UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 noElements,
  731. const UA_DataType *type) {
  732. void *new;
  733. UA_StatusCode retval = UA_Array_copy(array, &new, type, noElements);
  734. if(retval != UA_STATUSCODE_GOOD)
  735. return retval;
  736. return UA_Variant_setArray(v, new, noElements, type);
  737. }
  738. /* DiagnosticInfo */
  739. UA_TYPE_NEW_DEFAULT(UA_DiagnosticInfo)
  740. UA_TYPE_DELETE_DEFAULT(UA_DiagnosticInfo)
  741. void UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  742. UA_String_deleteMembers(&p->additionalInfo);
  743. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  744. UA_DiagnosticInfo_delete(p->innerDiagnosticInfo);
  745. p->innerDiagnosticInfo = UA_NULL;
  746. }
  747. }
  748. void UA_DiagnosticInfo_init(UA_DiagnosticInfo *p) {
  749. *((UA_Byte*)p) = 0; // zero out the bitfield
  750. p->symbolicId = 0;
  751. p->namespaceUri = 0;
  752. p->localizedText = 0;
  753. p->locale = 0;
  754. UA_String_init(&p->additionalInfo);
  755. p->innerDiagnosticInfo = UA_NULL;
  756. UA_StatusCode_init(&p->innerStatusCode);
  757. }
  758. UA_StatusCode UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst) {
  759. UA_DiagnosticInfo_init(dst);
  760. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  761. dst->symbolicId = src->symbolicId;
  762. dst->namespaceUri = src->namespaceUri;
  763. dst->localizedText = src->localizedText;
  764. dst->locale = src->locale;
  765. dst->innerStatusCode = src->innerStatusCode;
  766. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  767. if(src->hasAdditionalInfo)
  768. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  769. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  770. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  771. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  772. dst->hasInnerDiagnosticInfo = src->hasInnerDiagnosticInfo;
  773. }
  774. else
  775. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  776. }
  777. if(retval) {
  778. UA_DiagnosticInfo_deleteMembers(dst);
  779. UA_DiagnosticInfo_init(dst);
  780. }
  781. return retval;
  782. }
  783. /*******************/
  784. /* Structure Types */
  785. /*******************/
  786. void UA_init(void *p, const UA_DataType *dataType) {
  787. /* Do not check if the index is a builtin-type here. Builtins will be called
  788. with their very own _init functions normally. In the off case, that the
  789. generic function is called with the index of a builtin, their layout
  790. contains a single member of the builtin type, that will be inited in the
  791. for loop. */
  792. uintptr_t ptr = (uintptr_t)p;
  793. UA_Byte membersSize = dataType->membersSize;
  794. for(size_t i=0;i<membersSize; i++) {
  795. const UA_DataTypeMember *member = &dataType->members[i];
  796. if(member->isArray) {
  797. /* Padding contains bit-magic to split into padding before and after
  798. the length integer */
  799. ptr += (member->padding >> 3);
  800. *((UA_Int32*)ptr) = -1;
  801. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  802. *((void**)ptr) = UA_NULL;
  803. ptr += sizeof(void*);
  804. continue;
  805. }
  806. ptr += member->padding;
  807. if(!member->namespaceZero) {
  808. // pointer arithmetic
  809. const UA_DataType *memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  810. UA_init((void*)ptr, memberType);
  811. ptr += memberType->memSize;
  812. continue;
  813. }
  814. switch(member->memberTypeIndex) {
  815. case UA_TYPES_BOOLEAN:
  816. case UA_TYPES_SBYTE:
  817. case UA_TYPES_BYTE:
  818. *(UA_Byte*)ptr = 0;
  819. break;
  820. case UA_TYPES_INT16:
  821. case UA_TYPES_UINT16:
  822. *(UA_Int16*)ptr = 0;
  823. break;
  824. case UA_TYPES_INT32:
  825. case UA_TYPES_UINT32:
  826. case UA_TYPES_STATUSCODE:
  827. case UA_TYPES_FLOAT:
  828. *(UA_Int32*)ptr = 0;
  829. break;
  830. case UA_TYPES_INT64:
  831. case UA_TYPES_UINT64:
  832. case UA_TYPES_DOUBLE:
  833. case UA_TYPES_DATETIME:
  834. *(UA_Int64*)ptr = 0;
  835. break;
  836. case UA_TYPES_GUID:
  837. UA_Guid_init((UA_Guid*)ptr);
  838. break;
  839. case UA_TYPES_NODEID:
  840. UA_NodeId_init((UA_NodeId*)ptr);
  841. break;
  842. case UA_TYPES_EXPANDEDNODEID:
  843. UA_ExpandedNodeId_init((UA_ExpandedNodeId*)ptr);
  844. break;
  845. case UA_TYPES_LOCALIZEDTEXT:
  846. UA_LocalizedText_init((UA_LocalizedText*)ptr);
  847. break;
  848. case UA_TYPES_EXTENSIONOBJECT:
  849. UA_ExtensionObject_init((UA_ExtensionObject*)ptr);
  850. break;
  851. case UA_TYPES_DATAVALUE:
  852. UA_DataValue_init((UA_DataValue*)ptr);
  853. break;
  854. case UA_TYPES_VARIANT:
  855. UA_Variant_init((UA_Variant*)ptr);
  856. break;
  857. case UA_TYPES_DIAGNOSTICINFO:
  858. UA_DiagnosticInfo_init((UA_DiagnosticInfo*)ptr);
  859. break;
  860. default:
  861. // QualifiedName, LocalizedText and strings are treated as structures, also
  862. UA_init((void*)ptr, &UA_TYPES[member->memberTypeIndex]);
  863. }
  864. ptr += UA_TYPES[member->memberTypeIndex].memSize;
  865. }
  866. }
  867. void * UA_new(const UA_DataType *dataType) {
  868. void *p = UA_malloc(dataType->memSize);
  869. if(p)
  870. UA_init(p, dataType);
  871. return p;
  872. }
  873. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *dataType) {
  874. if(dataType->fixedSize) {
  875. memcpy(dst, src, dataType->memSize);
  876. return UA_STATUSCODE_GOOD;
  877. }
  878. UA_init(dst, dataType);
  879. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  880. uintptr_t ptrs = (uintptr_t)src;
  881. uintptr_t ptrd = (uintptr_t)dst;
  882. UA_Byte membersSize = dataType->membersSize;
  883. for(size_t i=0;i<membersSize; i++) {
  884. const UA_DataTypeMember *member = &dataType->members[i];
  885. const UA_DataType *memberType;
  886. if(member->namespaceZero)
  887. memberType = &UA_TYPES[member->memberTypeIndex];
  888. else
  889. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  890. if(member->isArray) {
  891. ptrs += (member->padding >> 3);
  892. ptrd += (member->padding >> 3);
  893. UA_Int32 *dstNoElements = (UA_Int32*)ptrd;
  894. const UA_Int32 noElements = *((const UA_Int32*)ptrs);
  895. ptrs += sizeof(UA_Int32) + (member->padding & 0x07);
  896. ptrd += sizeof(UA_Int32) + (member->padding & 0x07);
  897. retval = UA_Array_copy(*(void* const*)ptrs, (void**)ptrd, memberType, noElements);
  898. if(retval != UA_STATUSCODE_GOOD) {
  899. UA_deleteMembers(dst, dataType);
  900. UA_init(dst, dataType);
  901. return retval;
  902. }
  903. *dstNoElements = noElements;
  904. ptrs += sizeof(void*);
  905. ptrd += sizeof(void*);
  906. continue;
  907. }
  908. ptrs += member->padding;
  909. ptrd += member->padding;
  910. if(!member->namespaceZero) {
  911. retval = UA_copy((const void*)ptrs, (void*)ptrd, memberType);
  912. if(retval != UA_STATUSCODE_GOOD) {
  913. UA_deleteMembers(dst, dataType);
  914. UA_init(dst, dataType);
  915. return retval;
  916. }
  917. ptrs += memberType->memSize;
  918. ptrd += memberType->memSize;
  919. continue;
  920. }
  921. switch(member->memberTypeIndex) {
  922. case UA_TYPES_BOOLEAN:
  923. case UA_TYPES_SBYTE:
  924. case UA_TYPES_BYTE:
  925. *((UA_Byte*)ptrd) = *((const UA_Byte*)ptrs);
  926. break;
  927. case UA_TYPES_INT16:
  928. case UA_TYPES_UINT16:
  929. *((UA_Int16*)ptrd) = *((const UA_Byte*)ptrs);
  930. break;
  931. case UA_TYPES_INT32:
  932. case UA_TYPES_UINT32:
  933. case UA_TYPES_STATUSCODE:
  934. case UA_TYPES_FLOAT:
  935. *((UA_Int32*)ptrd) = *((const UA_Int32*)ptrs);
  936. break;
  937. case UA_TYPES_INT64:
  938. case UA_TYPES_UINT64:
  939. case UA_TYPES_DOUBLE:
  940. case UA_TYPES_DATETIME:
  941. *((UA_Int64*)ptrd) = *((const UA_Int64*)ptrs);
  942. break;
  943. case UA_TYPES_GUID:
  944. *((UA_Guid*)ptrd) = *((const UA_Guid*)ptrs);
  945. break;
  946. case UA_TYPES_NODEID:
  947. retval |= UA_NodeId_copy((const UA_NodeId*)ptrs, (UA_NodeId*)ptrd);
  948. break;
  949. case UA_TYPES_EXPANDEDNODEID:
  950. retval |= UA_ExpandedNodeId_copy((const UA_ExpandedNodeId*)ptrs, (UA_ExpandedNodeId*)ptrd);
  951. break;
  952. case UA_TYPES_LOCALIZEDTEXT:
  953. retval |= UA_LocalizedText_copy((const UA_LocalizedText*)ptrs, (UA_LocalizedText*)ptrd);
  954. break;
  955. case UA_TYPES_EXTENSIONOBJECT:
  956. retval |= UA_ExtensionObject_copy((const UA_ExtensionObject*)ptrs, (UA_ExtensionObject*)ptrd);
  957. break;
  958. case UA_TYPES_DATAVALUE:
  959. retval |= UA_DataValue_copy((const UA_DataValue*)ptrs, (UA_DataValue*)ptrd);
  960. break;
  961. case UA_TYPES_VARIANT:
  962. retval |= UA_Variant_copy((const UA_Variant*)ptrs, (UA_Variant*)ptrd);
  963. break;
  964. case UA_TYPES_DIAGNOSTICINFO:
  965. retval |= UA_DiagnosticInfo_copy((const UA_DiagnosticInfo*)ptrs, (UA_DiagnosticInfo*)ptrd);
  966. break;
  967. default:
  968. // QualifiedName, LocalizedText and strings are treated as structures, also
  969. retval |= UA_copy((const void *)ptrs, (void*)ptrd, memberType);
  970. }
  971. ptrs += memberType->memSize;
  972. ptrd += memberType->memSize;
  973. }
  974. if(retval != UA_STATUSCODE_GOOD) {
  975. UA_deleteMembers(dst, dataType);
  976. UA_init(dst, dataType);
  977. }
  978. return retval;
  979. }
  980. void UA_deleteMembers(void *p, const UA_DataType *dataType) {
  981. uintptr_t ptr = (uintptr_t)p;
  982. if(dataType->fixedSize)
  983. return;
  984. UA_Byte membersSize = dataType->membersSize;
  985. for(size_t i=0;i<membersSize; i++) {
  986. const UA_DataTypeMember *member = &dataType->members[i];
  987. const UA_DataType *memberType;
  988. if(member->namespaceZero)
  989. memberType = &UA_TYPES[member->memberTypeIndex];
  990. else
  991. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  992. if(member->isArray) {
  993. ptr += (member->padding >> 3);
  994. UA_Int32 noElements = *((UA_Int32*)ptr);
  995. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  996. UA_Array_delete(*(void**)ptr, memberType, noElements);
  997. *(void**)ptr = UA_NULL;
  998. ptr += sizeof(void*);
  999. continue;
  1000. }
  1001. ptr += member->padding;
  1002. if(!member->namespaceZero) {
  1003. UA_deleteMembers((void*)ptr, memberType);
  1004. ptr += memberType->memSize;
  1005. continue;
  1006. }
  1007. switch(member->memberTypeIndex) {
  1008. case UA_TYPES_BOOLEAN:
  1009. case UA_TYPES_SBYTE:
  1010. case UA_TYPES_BYTE:
  1011. case UA_TYPES_INT16:
  1012. case UA_TYPES_UINT16:
  1013. case UA_TYPES_INT32:
  1014. case UA_TYPES_UINT32:
  1015. case UA_TYPES_STATUSCODE:
  1016. case UA_TYPES_FLOAT:
  1017. case UA_TYPES_INT64:
  1018. case UA_TYPES_UINT64:
  1019. case UA_TYPES_DOUBLE:
  1020. case UA_TYPES_DATETIME:
  1021. case UA_TYPES_GUID:
  1022. break;
  1023. case UA_TYPES_NODEID:
  1024. UA_NodeId_deleteMembers((UA_NodeId*)ptr);
  1025. break;
  1026. case UA_TYPES_EXPANDEDNODEID:
  1027. UA_ExpandedNodeId_deleteMembers((UA_ExpandedNodeId*)ptr);
  1028. break;
  1029. case UA_TYPES_LOCALIZEDTEXT:
  1030. UA_LocalizedText_deleteMembers((UA_LocalizedText*)ptr);
  1031. break;
  1032. case UA_TYPES_EXTENSIONOBJECT:
  1033. UA_ExtensionObject_deleteMembers((UA_ExtensionObject*)ptr);
  1034. break;
  1035. case UA_TYPES_DATAVALUE:
  1036. UA_DataValue_deleteMembers((UA_DataValue*)ptr);
  1037. break;
  1038. case UA_TYPES_VARIANT:
  1039. UA_Variant_deleteMembers((UA_Variant*)ptr);
  1040. break;
  1041. case UA_TYPES_DIAGNOSTICINFO:
  1042. UA_DiagnosticInfo_deleteMembers((UA_DiagnosticInfo*)ptr);
  1043. break;
  1044. default:
  1045. // QualifiedName, LocalizedText and strings are treated as structures, also
  1046. UA_deleteMembers((void*)ptr, memberType);
  1047. }
  1048. ptr += memberType->memSize;
  1049. }
  1050. }
  1051. void UA_delete(void *p, const UA_DataType *dataType) {
  1052. UA_deleteMembers(p, dataType);
  1053. UA_free(p);
  1054. }
  1055. /******************/
  1056. /* Array Handling */
  1057. /******************/
  1058. void* UA_Array_new(const UA_DataType *dataType, UA_Int32 noElements) {
  1059. if(noElements <= 0)
  1060. return UA_NULL;
  1061. if((UA_Int32)dataType->memSize * noElements < 0 || dataType->memSize * noElements > MAX_ARRAY_SIZE )
  1062. return UA_NULL;
  1063. if(dataType->fixedSize)
  1064. return calloc(noElements, dataType->memSize);
  1065. void *p = malloc(dataType->memSize * (size_t)noElements);
  1066. if(!p)
  1067. return p;
  1068. uintptr_t ptr = (uintptr_t)p;
  1069. for(int i = 0; i<noElements; i++) {
  1070. UA_init((void*)ptr, dataType);
  1071. ptr += dataType->memSize;
  1072. }
  1073. return p;
  1074. }
  1075. UA_StatusCode UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 noElements) {
  1076. if(noElements <= 0) {
  1077. *dst = UA_NULL;
  1078. return UA_STATUSCODE_GOOD;
  1079. }
  1080. if(!(*dst = UA_malloc((size_t)noElements * dataType->memSize)))
  1081. return UA_STATUSCODE_BADOUTOFMEMORY;
  1082. if(dataType->fixedSize) {
  1083. memcpy(*dst, src, dataType->memSize * (size_t)noElements);
  1084. return UA_STATUSCODE_GOOD;
  1085. }
  1086. uintptr_t ptrs = (uintptr_t)src;
  1087. uintptr_t ptrd = (uintptr_t)*dst;
  1088. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1089. for(int i = 0; i < noElements; i++) {
  1090. retval = UA_copy((void*)ptrs, (void*)ptrd, dataType);
  1091. ptrs += dataType->memSize;
  1092. ptrd += dataType->memSize;
  1093. }
  1094. if(retval != UA_STATUSCODE_GOOD)
  1095. UA_Array_delete(*dst, dataType, noElements);
  1096. return retval;
  1097. }
  1098. void UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 noElements) {
  1099. if(!dataType->fixedSize) {
  1100. uintptr_t ptr = (uintptr_t)p;
  1101. for(UA_Int32 i = 0; i<noElements; i++) {
  1102. UA_deleteMembers((void*)ptr, dataType);
  1103. ptr += dataType->memSize;
  1104. }
  1105. }
  1106. UA_free(p);
  1107. }