ua_types.c 41 KB

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