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. /*****************/
  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. }
  530. }
  531. UA_StatusCode UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  532. UA_Variant_init(dst);
  533. UA_Int32 tmp = src->arrayLength;
  534. if(src->arrayLength == -1 && src->data)
  535. tmp = 1;
  536. UA_StatusCode retval = UA_Array_copy(src->data, &dst->data, src->type, tmp);
  537. if(retval != UA_STATUSCODE_GOOD) {
  538. UA_Variant_deleteMembers(dst);
  539. UA_Variant_init(dst);
  540. return retval;
  541. }
  542. dst->arrayLength = src->arrayLength;
  543. dst->type = src->type;
  544. dst->storageType = UA_VARIANT_DATA;
  545. if(src->arrayDimensions) {
  546. retval |= UA_Array_copy(src->arrayDimensions, (void **)&dst->arrayDimensions,
  547. &UA_TYPES[UA_TYPES_INT32], src->arrayDimensionsSize);
  548. if(retval != UA_STATUSCODE_GOOD) {
  549. UA_Variant_deleteMembers(dst);
  550. UA_Variant_init(dst);
  551. return retval;
  552. }
  553. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  554. }
  555. return retval;
  556. }
  557. UA_Boolean UA_Variant_isScalar(UA_Variant *v) {
  558. return (v->data != UA_NULL && v->arrayLength == -1);
  559. }
  560. /**
  561. * Tests if a range is compatible with a variant. If yes, the following values are set:
  562. * - total: how many elements are indicated by the range
  563. * - block_size: how big is each contiguous block of elements in the variant denoted by the range
  564. * - block_distance: how many elements are between the blocks (beginning to beginning)
  565. * - first_elem: where does the first block begin
  566. */
  567. static UA_StatusCode
  568. testRangeWithVariant(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  569. size_t *block_size, size_t *block_distance, size_t *first_elem)
  570. {
  571. /* Test the integrity of the source variant dimensions */
  572. UA_Int32 dims_count = 1;
  573. const UA_Int32 *dims = &v->arrayLength; // default: the array has only one dimension
  574. if(v->arrayDimensionsSize > 0) {
  575. dims_count = v->arrayDimensionsSize;
  576. dims = v->arrayDimensions;
  577. UA_Int32 elements = 1;
  578. for(UA_Int32 i = 0; i < dims_count; i++)
  579. elements *= dims[i];
  580. if(elements != v->arrayLength)
  581. return UA_STATUSCODE_BADINTERNALERROR;
  582. }
  583. /* Test the integrity of the range */
  584. size_t count = 1;
  585. if(range.dimensionsSize != dims_count)
  586. return UA_STATUSCODE_BADINTERNALERROR;
  587. for(UA_Int32 i = 0; i < dims_count; i++) {
  588. if(range.dimensions[i].min > range.dimensions[i].max)
  589. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  590. if(range.dimensions[i].max > (UA_UInt32)*(dims+i))
  591. return UA_STATUSCODE_BADINDEXRANGENODATA;
  592. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  593. }
  594. /* Compute the block size and the position of the first element */
  595. size_t bs = 0;
  596. size_t bd = 0;
  597. size_t fe = 0;
  598. size_t running_dimssize = 1; // elements per block of dimensions k to k_max
  599. UA_Boolean found_contiguous = UA_FALSE;
  600. for(UA_Int32 k = dims_count - 1; k >= 0; k--) {
  601. if(!found_contiguous && (range.dimensions[k].min != 0 ||
  602. range.dimensions[k].max + 1 != (UA_UInt32)dims[k])) {
  603. found_contiguous = UA_TRUE;
  604. bs = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  605. bd = dims[k] * running_dimssize;
  606. }
  607. fe += running_dimssize * range.dimensions[k].min;
  608. running_dimssize *= dims[k];
  609. }
  610. *total = count;
  611. *block_size = bs;
  612. *block_distance = bd;
  613. *first_elem = fe;
  614. return UA_STATUSCODE_GOOD;
  615. }
  616. UA_StatusCode UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  617. size_t count, block_size, block_distance, first_elem;
  618. UA_StatusCode retval = testRangeWithVariant(src, range, &count, &block_size, &block_distance, &first_elem);
  619. if(retval != UA_STATUSCODE_GOOD)
  620. return retval;
  621. UA_Variant_init(dst);
  622. size_t elem_size = src->type->memSize;
  623. dst->data = UA_malloc(elem_size * count);
  624. if(!dst->data)
  625. return UA_STATUSCODE_BADOUTOFMEMORY;
  626. /* Copy the range */
  627. size_t block_count = count / block_size;
  628. uintptr_t nextdst = (uintptr_t)dst->data;
  629. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first_elem);
  630. if(src->type->fixedSize) {
  631. for(size_t i = 0; i < block_count; i++) {
  632. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  633. nextdst += block_size * elem_size;
  634. nextsrc += block_distance * elem_size;
  635. }
  636. } else {
  637. for(size_t i = 0; i < block_count; i++) {
  638. for(size_t j = 0; j < block_size && retval == UA_STATUSCODE_GOOD; j++) {
  639. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  640. nextdst += elem_size;
  641. nextsrc += elem_size;
  642. }
  643. nextsrc += (block_distance - block_size) * elem_size;
  644. }
  645. if(retval != UA_STATUSCODE_GOOD) {
  646. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  647. UA_Array_delete(dst->data, src->type, copied);
  648. return retval;
  649. }
  650. }
  651. /* Copy the range dimensions*/
  652. if(src->arrayDimensionsSize > 0) {
  653. dst->arrayDimensions = UA_malloc(sizeof(UA_Int32) * src->arrayDimensionsSize);
  654. if(!dst->arrayDimensions) {
  655. UA_Array_delete(dst->data, src->type, count);
  656. return UA_STATUSCODE_BADOUTOFMEMORY;
  657. }
  658. for(UA_Int32 k = 0; k < src->arrayDimensionsSize; k++)
  659. dst->arrayDimensions[k] = range.dimensions[k].max - range.dimensions[k].min + 1;
  660. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  661. }
  662. dst->arrayLength = count;
  663. dst->type = src->type;
  664. return UA_STATUSCODE_GOOD;
  665. }
  666. UA_StatusCode UA_Variant_setRange(UA_Variant *v, void *data, const UA_NumericRange range) {
  667. size_t count, block_size, block_distance, first_elem;
  668. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  669. if(retval != UA_STATUSCODE_GOOD)
  670. return retval;
  671. size_t block_count = count / block_size;
  672. size_t elem_size = v->type->memSize;
  673. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  674. uintptr_t nextsrc = (uintptr_t)data;
  675. if(v->type->fixedSize) {
  676. for(size_t i = 0; i < block_count; i++) {
  677. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  678. nextdst += block_size * elem_size;
  679. nextsrc += block_distance * elem_size;
  680. }
  681. } else {
  682. for(size_t i = 0; i < block_count; i++) {
  683. for(size_t j = 0; j < block_size; j++) {
  684. UA_deleteMembers((void*)nextdst, v->type);
  685. nextdst += elem_size;
  686. }
  687. nextdst -= block_size * elem_size;
  688. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  689. nextdst += block_size * elem_size;
  690. nextsrc += block_distance * elem_size;
  691. }
  692. }
  693. return UA_STATUSCODE_GOOD;
  694. }
  695. UA_StatusCode UA_Variant_setCopyRange(const UA_Variant *src, UA_Variant *dst, void *data,
  696. const UA_NumericRange range) {
  697. // todo: don't copy the entire variant but only the retained parts
  698. UA_StatusCode retval = UA_Variant_copy(src, dst);
  699. if(retval != UA_STATUSCODE_GOOD)
  700. return retval;
  701. retval = UA_Variant_setRange(dst, data, range);
  702. if(retval != UA_STATUSCODE_GOOD) {
  703. UA_Variant_deleteMembers(dst);
  704. return retval;
  705. }
  706. return UA_STATUSCODE_GOOD;
  707. }
  708. UA_StatusCode UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type) {
  709. return UA_Variant_setArray(v, p, -1, type);
  710. }
  711. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  712. void *new = UA_malloc(type->memSize);
  713. if(!new)
  714. return UA_STATUSCODE_BADOUTOFMEMORY;
  715. UA_StatusCode retval = UA_copy(p, new, type);
  716. if(retval != UA_STATUSCODE_GOOD) {
  717. UA_delete(new, type);
  718. return retval;
  719. }
  720. return UA_Variant_setArray(v, new, -1, type);
  721. }
  722. UA_StatusCode UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 noElements,
  723. const UA_DataType *type) {
  724. v->type = type;
  725. v->arrayLength = noElements;
  726. v->data = array;
  727. return UA_STATUSCODE_GOOD;
  728. }
  729. UA_StatusCode UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 noElements,
  730. const UA_DataType *type) {
  731. void *new;
  732. UA_StatusCode retval = UA_Array_copy(array, &new, type, noElements);
  733. if(retval != UA_STATUSCODE_GOOD)
  734. return retval;
  735. return UA_Variant_setArray(v, new, noElements, type);
  736. }
  737. /* DiagnosticInfo */
  738. UA_TYPE_NEW_DEFAULT(UA_DiagnosticInfo)
  739. UA_TYPE_DELETE_DEFAULT(UA_DiagnosticInfo)
  740. void UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  741. UA_String_deleteMembers(&p->additionalInfo);
  742. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  743. UA_DiagnosticInfo_delete(p->innerDiagnosticInfo);
  744. p->innerDiagnosticInfo = UA_NULL;
  745. }
  746. }
  747. void UA_DiagnosticInfo_init(UA_DiagnosticInfo *p) {
  748. *((UA_Byte*)p) = 0; // zero out the bitfield
  749. p->symbolicId = 0;
  750. p->namespaceUri = 0;
  751. p->localizedText = 0;
  752. p->locale = 0;
  753. UA_String_init(&p->additionalInfo);
  754. p->innerDiagnosticInfo = UA_NULL;
  755. UA_StatusCode_init(&p->innerStatusCode);
  756. }
  757. UA_StatusCode UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst) {
  758. UA_DiagnosticInfo_init(dst);
  759. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  760. dst->symbolicId = src->symbolicId;
  761. dst->namespaceUri = src->namespaceUri;
  762. dst->localizedText = src->localizedText;
  763. dst->locale = src->locale;
  764. dst->innerStatusCode = src->innerStatusCode;
  765. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  766. if(src->hasAdditionalInfo)
  767. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  768. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  769. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  770. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  771. dst->hasInnerDiagnosticInfo = src->hasInnerDiagnosticInfo;
  772. }
  773. else
  774. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  775. }
  776. if(retval) {
  777. UA_DiagnosticInfo_deleteMembers(dst);
  778. UA_DiagnosticInfo_init(dst);
  779. }
  780. return retval;
  781. }
  782. /*******************/
  783. /* Structure Types */
  784. /*******************/
  785. void UA_init(void *p, const UA_DataType *dataType) {
  786. /* Do not check if the index is a builtin-type here. Builtins will be called
  787. with their very own _init functions normally. In the off case, that the
  788. generic function is called with the index of a builtin, their layout
  789. contains a single member of the builtin type, that will be inited in the
  790. for loop. */
  791. uintptr_t ptr = (uintptr_t)p;
  792. UA_Byte membersSize = dataType->membersSize;
  793. for(size_t i=0;i<membersSize; i++) {
  794. const UA_DataTypeMember *member = &dataType->members[i];
  795. if(member->isArray) {
  796. /* Padding contains bit-magic to split into padding before and after
  797. the length integer */
  798. ptr += (member->padding >> 3);
  799. *((UA_Int32*)ptr) = -1;
  800. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  801. *((void**)ptr) = UA_NULL;
  802. ptr += sizeof(void*);
  803. continue;
  804. }
  805. ptr += member->padding;
  806. if(!member->namespaceZero) {
  807. // pointer arithmetic
  808. const UA_DataType *memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  809. UA_init((void*)ptr, memberType);
  810. ptr += memberType->memSize;
  811. continue;
  812. }
  813. switch(member->memberTypeIndex) {
  814. case UA_TYPES_BOOLEAN:
  815. case UA_TYPES_SBYTE:
  816. case UA_TYPES_BYTE:
  817. *(UA_Byte*)ptr = 0;
  818. break;
  819. case UA_TYPES_INT16:
  820. case UA_TYPES_UINT16:
  821. *(UA_Int16*)ptr = 0;
  822. break;
  823. case UA_TYPES_INT32:
  824. case UA_TYPES_UINT32:
  825. case UA_TYPES_STATUSCODE:
  826. case UA_TYPES_FLOAT:
  827. *(UA_Int32*)ptr = 0;
  828. break;
  829. case UA_TYPES_INT64:
  830. case UA_TYPES_UINT64:
  831. case UA_TYPES_DOUBLE:
  832. case UA_TYPES_DATETIME:
  833. *(UA_Int64*)ptr = 0;
  834. break;
  835. case UA_TYPES_GUID:
  836. UA_Guid_init((UA_Guid*)ptr);
  837. break;
  838. case UA_TYPES_NODEID:
  839. UA_NodeId_init((UA_NodeId*)ptr);
  840. break;
  841. case UA_TYPES_EXPANDEDNODEID:
  842. UA_ExpandedNodeId_init((UA_ExpandedNodeId*)ptr);
  843. break;
  844. case UA_TYPES_LOCALIZEDTEXT:
  845. UA_LocalizedText_init((UA_LocalizedText*)ptr);
  846. break;
  847. case UA_TYPES_EXTENSIONOBJECT:
  848. UA_ExtensionObject_init((UA_ExtensionObject*)ptr);
  849. break;
  850. case UA_TYPES_DATAVALUE:
  851. UA_DataValue_init((UA_DataValue*)ptr);
  852. break;
  853. case UA_TYPES_VARIANT:
  854. UA_Variant_init((UA_Variant*)ptr);
  855. break;
  856. case UA_TYPES_DIAGNOSTICINFO:
  857. UA_DiagnosticInfo_init((UA_DiagnosticInfo*)ptr);
  858. break;
  859. default:
  860. // QualifiedName, LocalizedText and strings are treated as structures, also
  861. UA_init((void*)ptr, &UA_TYPES[member->memberTypeIndex]);
  862. }
  863. ptr += UA_TYPES[member->memberTypeIndex].memSize;
  864. }
  865. }
  866. void * UA_new(const UA_DataType *dataType) {
  867. void *p = UA_malloc(dataType->memSize);
  868. if(p)
  869. UA_init(p, dataType);
  870. return p;
  871. }
  872. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *dataType) {
  873. if(dataType->fixedSize) {
  874. memcpy(dst, src, dataType->memSize);
  875. return UA_STATUSCODE_GOOD;
  876. }
  877. UA_init(dst, dataType);
  878. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  879. uintptr_t ptrs = (uintptr_t)src;
  880. uintptr_t ptrd = (uintptr_t)dst;
  881. UA_Byte membersSize = dataType->membersSize;
  882. for(size_t i=0;i<membersSize; i++) {
  883. const UA_DataTypeMember *member = &dataType->members[i];
  884. const UA_DataType *memberType;
  885. if(member->namespaceZero)
  886. memberType = &UA_TYPES[member->memberTypeIndex];
  887. else
  888. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  889. if(member->isArray) {
  890. ptrs += (member->padding >> 3);
  891. ptrd += (member->padding >> 3);
  892. UA_Int32 *dstNoElements = (UA_Int32*)ptrd;
  893. const UA_Int32 noElements = *((const UA_Int32*)ptrs);
  894. ptrs += sizeof(UA_Int32) + (member->padding & 0x07);
  895. ptrd += sizeof(UA_Int32) + (member->padding & 0x07);
  896. retval = UA_Array_copy(*(void* const*)ptrs, (void**)ptrd, memberType, noElements);
  897. if(retval != UA_STATUSCODE_GOOD) {
  898. UA_deleteMembers(dst, dataType);
  899. UA_init(dst, dataType);
  900. return retval;
  901. }
  902. *dstNoElements = noElements;
  903. ptrs += sizeof(void*);
  904. ptrd += sizeof(void*);
  905. continue;
  906. }
  907. ptrs += member->padding;
  908. ptrd += member->padding;
  909. if(!member->namespaceZero) {
  910. retval = UA_copy((const void*)ptrs, (void*)ptrd, memberType);
  911. if(retval != UA_STATUSCODE_GOOD) {
  912. UA_deleteMembers(dst, dataType);
  913. UA_init(dst, dataType);
  914. return retval;
  915. }
  916. ptrs += memberType->memSize;
  917. ptrd += memberType->memSize;
  918. continue;
  919. }
  920. switch(member->memberTypeIndex) {
  921. case UA_TYPES_BOOLEAN:
  922. case UA_TYPES_SBYTE:
  923. case UA_TYPES_BYTE:
  924. *((UA_Byte*)ptrd) = *((const UA_Byte*)ptrs);
  925. break;
  926. case UA_TYPES_INT16:
  927. case UA_TYPES_UINT16:
  928. *((UA_Int16*)ptrd) = *((const UA_Byte*)ptrs);
  929. break;
  930. case UA_TYPES_INT32:
  931. case UA_TYPES_UINT32:
  932. case UA_TYPES_STATUSCODE:
  933. case UA_TYPES_FLOAT:
  934. *((UA_Int32*)ptrd) = *((const UA_Int32*)ptrs);
  935. break;
  936. case UA_TYPES_INT64:
  937. case UA_TYPES_UINT64:
  938. case UA_TYPES_DOUBLE:
  939. case UA_TYPES_DATETIME:
  940. *((UA_Int64*)ptrd) = *((const UA_Int64*)ptrs);
  941. break;
  942. case UA_TYPES_GUID:
  943. *((UA_Guid*)ptrd) = *((const UA_Guid*)ptrs);
  944. break;
  945. case UA_TYPES_NODEID:
  946. retval |= UA_NodeId_copy((const UA_NodeId*)ptrs, (UA_NodeId*)ptrd);
  947. break;
  948. case UA_TYPES_EXPANDEDNODEID:
  949. retval |= UA_ExpandedNodeId_copy((const UA_ExpandedNodeId*)ptrs, (UA_ExpandedNodeId*)ptrd);
  950. break;
  951. case UA_TYPES_LOCALIZEDTEXT:
  952. retval |= UA_LocalizedText_copy((const UA_LocalizedText*)ptrs, (UA_LocalizedText*)ptrd);
  953. break;
  954. case UA_TYPES_EXTENSIONOBJECT:
  955. retval |= UA_ExtensionObject_copy((const UA_ExtensionObject*)ptrs, (UA_ExtensionObject*)ptrd);
  956. break;
  957. case UA_TYPES_DATAVALUE:
  958. retval |= UA_DataValue_copy((const UA_DataValue*)ptrs, (UA_DataValue*)ptrd);
  959. break;
  960. case UA_TYPES_VARIANT:
  961. retval |= UA_Variant_copy((const UA_Variant*)ptrs, (UA_Variant*)ptrd);
  962. break;
  963. case UA_TYPES_DIAGNOSTICINFO:
  964. retval |= UA_DiagnosticInfo_copy((const UA_DiagnosticInfo*)ptrs, (UA_DiagnosticInfo*)ptrd);
  965. break;
  966. default:
  967. // QualifiedName, LocalizedText and strings are treated as structures, also
  968. retval |= UA_copy((const void *)ptrs, (void*)ptrd, memberType);
  969. }
  970. ptrs += memberType->memSize;
  971. ptrd += memberType->memSize;
  972. }
  973. if(retval != UA_STATUSCODE_GOOD) {
  974. UA_deleteMembers(dst, dataType);
  975. UA_init(dst, dataType);
  976. }
  977. return retval;
  978. }
  979. void UA_deleteMembers(void *p, const UA_DataType *dataType) {
  980. uintptr_t ptr = (uintptr_t)p;
  981. if(dataType->fixedSize)
  982. return;
  983. UA_Byte membersSize = dataType->membersSize;
  984. for(size_t i=0;i<membersSize; i++) {
  985. const UA_DataTypeMember *member = &dataType->members[i];
  986. const UA_DataType *memberType;
  987. if(member->namespaceZero)
  988. memberType = &UA_TYPES[member->memberTypeIndex];
  989. else
  990. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  991. if(member->isArray) {
  992. ptr += (member->padding >> 3);
  993. UA_Int32 noElements = *((UA_Int32*)ptr);
  994. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  995. UA_Array_delete(*(void**)ptr, memberType, noElements);
  996. *(void**)ptr = UA_NULL;
  997. ptr += sizeof(void*);
  998. continue;
  999. }
  1000. ptr += member->padding;
  1001. if(!member->namespaceZero) {
  1002. UA_deleteMembers((void*)ptr, memberType);
  1003. ptr += memberType->memSize;
  1004. continue;
  1005. }
  1006. switch(member->memberTypeIndex) {
  1007. case UA_TYPES_BOOLEAN:
  1008. case UA_TYPES_SBYTE:
  1009. case UA_TYPES_BYTE:
  1010. case UA_TYPES_INT16:
  1011. case UA_TYPES_UINT16:
  1012. case UA_TYPES_INT32:
  1013. case UA_TYPES_UINT32:
  1014. case UA_TYPES_STATUSCODE:
  1015. case UA_TYPES_FLOAT:
  1016. case UA_TYPES_INT64:
  1017. case UA_TYPES_UINT64:
  1018. case UA_TYPES_DOUBLE:
  1019. case UA_TYPES_DATETIME:
  1020. case UA_TYPES_GUID:
  1021. break;
  1022. case UA_TYPES_NODEID:
  1023. UA_NodeId_deleteMembers((UA_NodeId*)ptr);
  1024. break;
  1025. case UA_TYPES_EXPANDEDNODEID:
  1026. UA_ExpandedNodeId_deleteMembers((UA_ExpandedNodeId*)ptr);
  1027. break;
  1028. case UA_TYPES_LOCALIZEDTEXT:
  1029. UA_LocalizedText_deleteMembers((UA_LocalizedText*)ptr);
  1030. break;
  1031. case UA_TYPES_EXTENSIONOBJECT:
  1032. UA_ExtensionObject_deleteMembers((UA_ExtensionObject*)ptr);
  1033. break;
  1034. case UA_TYPES_DATAVALUE:
  1035. UA_DataValue_deleteMembers((UA_DataValue*)ptr);
  1036. break;
  1037. case UA_TYPES_VARIANT:
  1038. UA_Variant_deleteMembers((UA_Variant*)ptr);
  1039. break;
  1040. case UA_TYPES_DIAGNOSTICINFO:
  1041. UA_DiagnosticInfo_deleteMembers((UA_DiagnosticInfo*)ptr);
  1042. break;
  1043. default:
  1044. // QualifiedName, LocalizedText and strings are treated as structures, also
  1045. UA_deleteMembers((void*)ptr, memberType);
  1046. }
  1047. ptr += memberType->memSize;
  1048. }
  1049. }
  1050. void UA_delete(void *p, const UA_DataType *dataType) {
  1051. UA_deleteMembers(p, dataType);
  1052. UA_free(p);
  1053. }
  1054. /******************/
  1055. /* Array Handling */
  1056. /******************/
  1057. void* UA_Array_new(const UA_DataType *dataType, UA_Int32 noElements) {
  1058. if(noElements <= 0)
  1059. return UA_NULL;
  1060. if((UA_Int32)dataType->memSize * noElements < 0 || dataType->memSize * noElements > MAX_ARRAY_SIZE )
  1061. return UA_NULL;
  1062. if(dataType->fixedSize)
  1063. return calloc(noElements, dataType->memSize);
  1064. void *p = malloc(dataType->memSize * (size_t)noElements);
  1065. if(!p)
  1066. return p;
  1067. uintptr_t ptr = (uintptr_t)p;
  1068. for(int i = 0; i<noElements; i++) {
  1069. UA_init((void*)ptr, dataType);
  1070. ptr += dataType->memSize;
  1071. }
  1072. return p;
  1073. }
  1074. UA_StatusCode UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 noElements) {
  1075. if(noElements <= 0) {
  1076. *dst = UA_NULL;
  1077. return UA_STATUSCODE_GOOD;
  1078. }
  1079. if(!(*dst = UA_malloc((size_t)noElements * dataType->memSize)))
  1080. return UA_STATUSCODE_BADOUTOFMEMORY;
  1081. if(dataType->fixedSize) {
  1082. memcpy(*dst, src, dataType->memSize * (size_t)noElements);
  1083. return UA_STATUSCODE_GOOD;
  1084. }
  1085. uintptr_t ptrs = (uintptr_t)src;
  1086. uintptr_t ptrd = (uintptr_t)*dst;
  1087. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1088. for(int i = 0; i < noElements; i++) {
  1089. retval = UA_copy((void*)ptrs, (void*)ptrd, dataType);
  1090. ptrs += dataType->memSize;
  1091. ptrd += dataType->memSize;
  1092. }
  1093. if(retval != UA_STATUSCODE_GOOD)
  1094. UA_Array_delete(*dst, dataType, noElements);
  1095. return retval;
  1096. }
  1097. void UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 noElements) {
  1098. if(!dataType->fixedSize) {
  1099. uintptr_t ptr = (uintptr_t)p;
  1100. for(UA_Int32 i = 0; i<noElements; i++) {
  1101. UA_deleteMembers((void*)ptr, dataType);
  1102. ptr += dataType->memSize;
  1103. }
  1104. }
  1105. UA_free(p);
  1106. }