ua_types.c 39 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196
  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_COPYPRINTF_BUFSIZE 1024
  101. UA_StatusCode UA_String_copyprintf(char const *fmt, UA_String *dst, ...) {
  102. char src[UA_STRING_COPYPRINTF_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_COPYPRINTF_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_COPYPRINTF_BUFSIZE ? UA_STRING_COPYPRINTF_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. static UA_Boolean UA_NodeId_isBasicType(UA_NodeId const *id) {
  291. return id ->namespaceIndex == 0 && 1 <= id ->identifier.numeric &&
  292. id ->identifier.numeric <= 25;
  293. }
  294. void UA_NodeId_deleteMembers(UA_NodeId *p) {
  295. switch(p->identifierType) {
  296. case UA_NODEIDTYPE_STRING:
  297. case UA_NODEIDTYPE_BYTESTRING:
  298. UA_ByteString_deleteMembers(&p->identifier.byteString);
  299. break;
  300. default:
  301. break;
  302. }
  303. }
  304. UA_Boolean UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2) {
  305. if(n1->namespaceIndex != n2->namespaceIndex || n1->identifierType!=n2->identifierType)
  306. return UA_FALSE;
  307. switch(n1->identifierType) {
  308. case UA_NODEIDTYPE_NUMERIC:
  309. if(n1->identifier.numeric == n2->identifier.numeric)
  310. return UA_TRUE;
  311. else
  312. return UA_FALSE;
  313. case UA_NODEIDTYPE_STRING:
  314. return UA_String_equal(&n1->identifier.string, &n2->identifier.string);
  315. case UA_NODEIDTYPE_GUID:
  316. return UA_Guid_equal(&n1->identifier.guid, &n2->identifier.guid);
  317. case UA_NODEIDTYPE_BYTESTRING:
  318. return UA_ByteString_equal(&n1->identifier.byteString, &n2->identifier.byteString);
  319. }
  320. return UA_FALSE;
  321. }
  322. UA_Boolean UA_NodeId_isNull(const UA_NodeId *p) {
  323. switch(p->identifierType) {
  324. case UA_NODEIDTYPE_NUMERIC:
  325. if(p->namespaceIndex != 0 || p->identifier.numeric != 0)
  326. return UA_FALSE;
  327. break;
  328. case UA_NODEIDTYPE_STRING:
  329. if(p->namespaceIndex != 0 || p->identifier.string.length > 0)
  330. return UA_FALSE;
  331. break;
  332. case UA_NODEIDTYPE_GUID:
  333. if(p->namespaceIndex != 0 ||
  334. memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]) { 0 }, sizeof(UA_Guid)) != 0)
  335. return UA_FALSE;
  336. break;
  337. case UA_NODEIDTYPE_BYTESTRING:
  338. if(p->namespaceIndex != 0 || p->identifier.byteString.length > 0)
  339. return UA_FALSE;
  340. break;
  341. default:
  342. return UA_FALSE;
  343. }
  344. return UA_TRUE;
  345. }
  346. /* ExpandedNodeId */
  347. UA_TYPE_NEW_DEFAULT(UA_ExpandedNodeId)
  348. UA_TYPE_DELETE_DEFAULT(UA_ExpandedNodeId)
  349. void UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId *p) {
  350. UA_NodeId_deleteMembers(&p->nodeId);
  351. UA_String_deleteMembers(&p->namespaceUri);
  352. }
  353. void UA_ExpandedNodeId_init(UA_ExpandedNodeId *p) {
  354. UA_NodeId_init(&p->nodeId);
  355. UA_String_init(&p->namespaceUri);
  356. p->serverIndex = 0;
  357. }
  358. UA_StatusCode UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  359. UA_StatusCode retval = UA_NodeId_copy(&src->nodeId, &dst->nodeId);
  360. retval |= UA_String_copy(&src->namespaceUri, &dst->namespaceUri);
  361. dst->serverIndex = src->serverIndex;
  362. if(retval) {
  363. UA_ExpandedNodeId_deleteMembers(dst);
  364. UA_ExpandedNodeId_init(dst);
  365. }
  366. return retval;
  367. }
  368. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId *p) {
  369. return UA_NodeId_isNull(&p->nodeId);
  370. }
  371. /* StatusCode */
  372. /* QualifiedName */
  373. UA_TYPE_NEW_DEFAULT(UA_QualifiedName)
  374. UA_TYPE_DELETE_DEFAULT(UA_QualifiedName)
  375. void UA_QualifiedName_deleteMembers(UA_QualifiedName *p) {
  376. UA_String_deleteMembers(&p->name);
  377. }
  378. void UA_QualifiedName_init(UA_QualifiedName *p) {
  379. UA_String_init(&p->name);
  380. p->namespaceIndex = 0;
  381. }
  382. UA_StatusCode UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  383. UA_StatusCode retval = UA_String_copy(&src->name, &dst->name);
  384. dst->namespaceIndex = src->namespaceIndex;
  385. if(retval) {
  386. UA_QualifiedName_deleteMembers(dst);
  387. UA_QualifiedName_init(dst);
  388. }
  389. return retval;
  390. }
  391. /* LocalizedText */
  392. UA_TYPE_NEW_DEFAULT(UA_LocalizedText)
  393. UA_TYPE_DELETE_DEFAULT(UA_LocalizedText)
  394. void UA_LocalizedText_deleteMembers(UA_LocalizedText *p) {
  395. UA_String_deleteMembers(&p->locale);
  396. UA_String_deleteMembers(&p->text);
  397. }
  398. void UA_LocalizedText_init(UA_LocalizedText *p) {
  399. UA_String_init(&p->locale);
  400. UA_String_init(&p->text);
  401. }
  402. UA_StatusCode UA_LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText *dst) {
  403. UA_StatusCode retval = UA_String_copy(&src->locale, &dst->locale);
  404. retval |= UA_String_copy(&src->text, &dst->text);
  405. if(retval) {
  406. UA_LocalizedText_deleteMembers(dst);
  407. UA_LocalizedText_init(dst);
  408. }
  409. return retval;
  410. }
  411. /* ExtensionObject */
  412. UA_TYPE_NEW_DEFAULT(UA_ExtensionObject)
  413. UA_TYPE_DELETE_DEFAULT(UA_ExtensionObject)
  414. void UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  415. UA_NodeId_deleteMembers(&p->typeId);
  416. UA_ByteString_deleteMembers(&p->body);
  417. }
  418. void UA_ExtensionObject_init(UA_ExtensionObject *p) {
  419. UA_NodeId_init(&p->typeId);
  420. p->encoding = UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED;
  421. UA_ByteString_init(&p->body);
  422. }
  423. UA_StatusCode UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  424. UA_StatusCode retval = UA_ByteString_copy(&src->body, &dst->body);
  425. retval |= UA_NodeId_copy(&src->typeId, &dst->typeId);
  426. dst->encoding = src->encoding;
  427. if(retval) {
  428. UA_ExtensionObject_deleteMembers(dst);
  429. UA_ExtensionObject_init(dst);
  430. }
  431. return retval;
  432. }
  433. /* DataValue */
  434. UA_TYPE_NEW_DEFAULT(UA_DataValue)
  435. UA_TYPE_DELETE_DEFAULT(UA_DataValue)
  436. void UA_DataValue_deleteMembers(UA_DataValue *p) {
  437. UA_Variant_deleteMembers(&p->value);
  438. }
  439. void UA_DataValue_init(UA_DataValue *p) {
  440. *((UA_Byte*)p) = 0; // zero out the bitfield
  441. p->serverPicoseconds = 0;
  442. UA_DateTime_init(&p->serverTimestamp);
  443. p->sourcePicoseconds = 0;
  444. UA_DateTime_init(&p->sourceTimestamp);
  445. UA_StatusCode_init(&p->status);
  446. UA_Variant_init(&p->value);
  447. }
  448. UA_StatusCode UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst) {
  449. UA_DataValue_init(dst);
  450. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  451. UA_StatusCode retval = UA_DateTime_copy(&src->serverTimestamp, &dst->serverTimestamp);
  452. retval |= UA_DateTime_copy(&src->sourceTimestamp, &dst->sourceTimestamp);
  453. retval |= UA_Variant_copy(&src->value, &dst->value);
  454. dst->serverPicoseconds = src->serverPicoseconds;
  455. dst->sourcePicoseconds = src->sourcePicoseconds;
  456. dst->status = src->status;
  457. if(retval) {
  458. UA_DataValue_deleteMembers(dst);
  459. UA_DataValue_init(dst);
  460. }
  461. return retval;
  462. }
  463. /* Variant */
  464. UA_TYPE_NEW_DEFAULT(UA_Variant)
  465. UA_TYPE_DELETE_DEFAULT(UA_Variant)
  466. void UA_Variant_init(UA_Variant *p) {
  467. p->storageType = UA_VARIANT_DATA;
  468. p->arrayLength = -1;
  469. p->data = UA_NULL;
  470. p->arrayDimensions = UA_NULL;
  471. p->arrayDimensionsSize = -1;
  472. p->type = &UA_TYPES[UA_TYPES_BOOLEAN];
  473. }
  474. void UA_Variant_deleteMembers(UA_Variant *p) {
  475. if(p->storageType != UA_VARIANT_DATA)
  476. return;
  477. if(p->data) {
  478. if(p->arrayLength == -1)
  479. p->arrayLength = 1;
  480. UA_Array_delete(p->data, p->type, p->arrayLength);
  481. p->data = UA_NULL;
  482. p->arrayLength = -1;
  483. }
  484. if(p->arrayDimensions) {
  485. UA_free(p->arrayDimensions);
  486. p->arrayDimensions = UA_NULL;
  487. }
  488. }
  489. UA_StatusCode UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  490. UA_Variant_init(dst);
  491. UA_Int32 tmp = src->arrayLength;
  492. if(src->arrayLength == -1 && src->data)
  493. tmp = 1;
  494. UA_StatusCode retval = UA_Array_copy(src->data, &dst->data, src->type, tmp);
  495. if(retval != UA_STATUSCODE_GOOD) {
  496. UA_Variant_deleteMembers(dst);
  497. UA_Variant_init(dst);
  498. return retval;
  499. }
  500. dst->arrayLength = src->arrayLength;
  501. dst->type = src->type;
  502. dst->storageType = UA_VARIANT_DATA;
  503. if(src->arrayDimensions) {
  504. retval |= UA_Array_copy(src->arrayDimensions, (void **)&dst->arrayDimensions,
  505. &UA_TYPES[UA_TYPES_INT32], src->arrayDimensionsSize);
  506. if(retval != UA_STATUSCODE_GOOD) {
  507. UA_Variant_deleteMembers(dst);
  508. UA_Variant_init(dst);
  509. return retval;
  510. }
  511. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  512. }
  513. return retval;
  514. }
  515. UA_Boolean UA_Variant_isScalar(UA_Variant *v) {
  516. return (v->data != UA_NULL && v->arrayLength == -1);
  517. }
  518. /**
  519. * Tests if a range is compatible with a variant. If yes, the following values are set:
  520. * - total: how many elements are indicated by the range
  521. * - block_size: how big is each contiguous block of elements in the variant denoted by the range
  522. * - block_distance: how many elements are between the blocks (beginning to beginning)
  523. * - first_elem: where does the first block begin
  524. */
  525. static UA_StatusCode
  526. testRangeWithVariant(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  527. size_t *block_size, size_t *block_distance, size_t *first_elem)
  528. {
  529. /* Test the integrity of the source variant dimensions */
  530. UA_Int32 dims_count = 1;
  531. const UA_Int32 *dims = &v->arrayLength; // default: the array has only one dimension
  532. if(v->arrayDimensionsSize > 0) {
  533. dims_count = v->arrayDimensionsSize;
  534. dims = v->arrayDimensions;
  535. UA_Int32 elements = 1;
  536. for(UA_Int32 i = 0; i < dims_count; i++)
  537. elements *= dims[i];
  538. if(elements != v->arrayLength)
  539. return UA_STATUSCODE_BADINTERNALERROR;
  540. }
  541. /* Test the integrity of the range */
  542. size_t count = 1;
  543. if(range.dimensionsSize != dims_count)
  544. return UA_STATUSCODE_BADINTERNALERROR;
  545. for(UA_Int32 i = 0; i < dims_count; i++) {
  546. if(range.dimensions[i].min > range.dimensions[i].max)
  547. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  548. if(range.dimensions[i].max > (UA_UInt32)*(dims+i))
  549. return UA_STATUSCODE_BADINDEXRANGENODATA;
  550. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  551. }
  552. /* Compute the block size and the position of the first element */
  553. size_t bs = 0;
  554. size_t bd = 0;
  555. size_t fe = 0;
  556. size_t running_dimssize = 1; // elements per block of dimensions k to k_max
  557. UA_Boolean found_contiguous = UA_FALSE;
  558. for(UA_Int32 k = dims_count - 1; k >= 0; k--) {
  559. if(!found_contiguous && (range.dimensions[k].min != 0 ||
  560. range.dimensions[k].max + 1 != (UA_UInt32)dims[k])) {
  561. found_contiguous = UA_TRUE;
  562. bs = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  563. bd = dims[k] * running_dimssize;
  564. }
  565. fe += running_dimssize * range.dimensions[k].min;
  566. running_dimssize *= dims[k];
  567. }
  568. *total = count;
  569. *block_size = bs;
  570. *block_distance = bd;
  571. *first_elem = fe;
  572. return UA_STATUSCODE_GOOD;
  573. }
  574. UA_StatusCode UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  575. size_t count, block_size, block_distance, first_elem;
  576. UA_StatusCode retval = testRangeWithVariant(src, range, &count, &block_size, &block_distance, &first_elem);
  577. if(retval != UA_STATUSCODE_GOOD)
  578. return retval;
  579. UA_Variant_init(dst);
  580. size_t elem_size = src->type->memSize;
  581. dst->data = UA_malloc(elem_size * count);
  582. if(!dst->data)
  583. return UA_STATUSCODE_BADOUTOFMEMORY;
  584. /* Copy the range */
  585. size_t block_count = count / block_size;
  586. uintptr_t nextdst = (uintptr_t)dst->data;
  587. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first_elem);
  588. if(src->type->fixedSize) {
  589. for(size_t i = 0; i < block_count; i++) {
  590. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  591. nextdst += block_size * elem_size;
  592. nextsrc += block_distance * elem_size;
  593. }
  594. } else {
  595. for(size_t i = 0; i < block_count; i++) {
  596. for(size_t j = 0; j < block_size && retval == UA_STATUSCODE_GOOD; j++) {
  597. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  598. nextdst += elem_size;
  599. nextsrc += elem_size;
  600. }
  601. nextsrc += (block_distance - block_size) * elem_size;
  602. }
  603. if(retval != UA_STATUSCODE_GOOD) {
  604. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  605. UA_Array_delete(dst->data, src->type, copied);
  606. return retval;
  607. }
  608. }
  609. /* Copy the range dimensions*/
  610. if(src->arrayDimensionsSize > 0) {
  611. dst->arrayDimensions = UA_malloc(sizeof(UA_Int32) * src->arrayDimensionsSize);
  612. if(!dst->arrayDimensions) {
  613. UA_Array_delete(dst->data, src->type, count);
  614. return UA_STATUSCODE_BADOUTOFMEMORY;
  615. }
  616. for(UA_Int32 k = 0; k < src->arrayDimensionsSize; k++)
  617. dst->arrayDimensions[k] = range.dimensions[k].max - range.dimensions[k].min + 1;
  618. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  619. }
  620. dst->arrayLength = count;
  621. dst->type = src->type;
  622. return UA_STATUSCODE_GOOD;
  623. }
  624. UA_StatusCode UA_Variant_setRange(UA_Variant *v, void *data, const UA_NumericRange range) {
  625. size_t count, block_size, block_distance, first_elem;
  626. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  627. if(retval != UA_STATUSCODE_GOOD)
  628. return retval;
  629. size_t block_count = count / block_size;
  630. size_t elem_size = v->type->memSize;
  631. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  632. uintptr_t nextsrc = (uintptr_t)data;
  633. if(v->type->fixedSize) {
  634. for(size_t i = 0; i < block_count; i++) {
  635. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  636. nextdst += block_size * elem_size;
  637. nextsrc += block_distance * elem_size;
  638. }
  639. } else {
  640. for(size_t i = 0; i < block_count; i++) {
  641. for(size_t j = 0; j < block_size; j++) {
  642. UA_deleteMembers((void*)nextdst, v->type);
  643. nextdst += elem_size;
  644. }
  645. nextdst -= block_size * elem_size;
  646. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  647. nextdst += block_size * elem_size;
  648. nextsrc += block_distance * elem_size;
  649. }
  650. }
  651. return UA_STATUSCODE_GOOD;
  652. }
  653. UA_StatusCode UA_Variant_setCopyRange(const UA_Variant *src, UA_Variant *dst, void *data,
  654. const UA_NumericRange range) {
  655. // todo: don't copy the entire variant but only the retained parts
  656. UA_StatusCode retval = UA_Variant_copy(src, dst);
  657. if(retval != UA_STATUSCODE_GOOD)
  658. return retval;
  659. retval = UA_Variant_setRange(dst, data, range);
  660. if(retval != UA_STATUSCODE_GOOD) {
  661. UA_Variant_deleteMembers(dst);
  662. return retval;
  663. }
  664. return UA_STATUSCODE_GOOD;
  665. }
  666. UA_StatusCode UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type) {
  667. return UA_Variant_setArray(v, p, -1, type);
  668. }
  669. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  670. void *new = UA_malloc(type->memSize);
  671. if(!new)
  672. return UA_STATUSCODE_BADOUTOFMEMORY;
  673. UA_StatusCode retval = UA_copy(p, new, type);
  674. if(retval != UA_STATUSCODE_GOOD) {
  675. UA_delete(new, type);
  676. return retval;
  677. }
  678. return UA_Variant_setArray(v, new, -1, type);
  679. }
  680. UA_StatusCode UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 noElements,
  681. const UA_DataType *type) {
  682. v->type = type;
  683. v->arrayLength = noElements;
  684. v->data = array;
  685. return UA_STATUSCODE_GOOD;
  686. }
  687. UA_StatusCode UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 noElements,
  688. const UA_DataType *type) {
  689. void *new;
  690. UA_StatusCode retval = UA_Array_copy(array, &new, type, noElements);
  691. if(retval != UA_STATUSCODE_GOOD)
  692. return retval;
  693. return UA_Variant_setArray(v, new, noElements, type);
  694. }
  695. /* DiagnosticInfo */
  696. UA_TYPE_NEW_DEFAULT(UA_DiagnosticInfo)
  697. UA_TYPE_DELETE_DEFAULT(UA_DiagnosticInfo)
  698. void UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  699. UA_String_deleteMembers(&p->additionalInfo);
  700. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  701. UA_DiagnosticInfo_delete(p->innerDiagnosticInfo);
  702. p->innerDiagnosticInfo = UA_NULL;
  703. }
  704. }
  705. void UA_DiagnosticInfo_init(UA_DiagnosticInfo *p) {
  706. *((UA_Byte*)p) = 0; // zero out the bitfield
  707. p->symbolicId = 0;
  708. p->namespaceUri = 0;
  709. p->localizedText = 0;
  710. p->locale = 0;
  711. UA_String_init(&p->additionalInfo);
  712. p->innerDiagnosticInfo = UA_NULL;
  713. UA_StatusCode_init(&p->innerStatusCode);
  714. }
  715. UA_StatusCode UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst) {
  716. UA_DiagnosticInfo_init(dst);
  717. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  718. dst->symbolicId = src->symbolicId;
  719. dst->namespaceUri = src->namespaceUri;
  720. dst->localizedText = src->localizedText;
  721. dst->locale = src->locale;
  722. dst->innerStatusCode = src->innerStatusCode;
  723. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  724. if(src->hasAdditionalInfo)
  725. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  726. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  727. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  728. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  729. dst->hasInnerDiagnosticInfo = src->hasInnerDiagnosticInfo;
  730. }
  731. else
  732. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  733. }
  734. if(retval) {
  735. UA_DiagnosticInfo_deleteMembers(dst);
  736. UA_DiagnosticInfo_init(dst);
  737. }
  738. return retval;
  739. }
  740. /*******************/
  741. /* Structure Types */
  742. /*******************/
  743. void UA_init(void *p, const UA_DataType *dataType) {
  744. /* Do not check if the index is a builtin-type here. Builtins will be called
  745. with their very own _init functions normally. In the off case, that the
  746. generic function is called with the index of a builtin, their layout
  747. contains a single member of the builtin type, that will be inited in the
  748. for loop. */
  749. uintptr_t ptr = (uintptr_t)p;
  750. UA_Byte membersSize = dataType->membersSize;
  751. for(size_t i=0;i<membersSize; i++) {
  752. const UA_DataTypeMember *member = &dataType->members[i];
  753. if(member->isArray) {
  754. /* Padding contains bit-magic to split into padding before and after
  755. the length integer */
  756. ptr += (member->padding >> 3);
  757. *((UA_Int32*)ptr) = -1;
  758. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  759. *((void**)ptr) = UA_NULL;
  760. ptr += sizeof(void*);
  761. continue;
  762. }
  763. ptr += member->padding;
  764. if(!member->namespaceZero) {
  765. // pointer arithmetic
  766. const UA_DataType *memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  767. UA_init((void*)ptr, memberType);
  768. ptr += memberType->memSize;
  769. continue;
  770. }
  771. switch(member->memberTypeIndex) {
  772. case UA_TYPES_BOOLEAN:
  773. case UA_TYPES_SBYTE:
  774. case UA_TYPES_BYTE:
  775. *(UA_Byte*)ptr = 0;
  776. break;
  777. case UA_TYPES_INT16:
  778. case UA_TYPES_UINT16:
  779. *(UA_Int16*)ptr = 0;
  780. break;
  781. case UA_TYPES_INT32:
  782. case UA_TYPES_UINT32:
  783. case UA_TYPES_STATUSCODE:
  784. case UA_TYPES_FLOAT:
  785. *(UA_Int32*)ptr = 0;
  786. break;
  787. case UA_TYPES_INT64:
  788. case UA_TYPES_UINT64:
  789. case UA_TYPES_DOUBLE:
  790. case UA_TYPES_DATETIME:
  791. *(UA_Int64*)ptr = 0;
  792. break;
  793. case UA_TYPES_GUID:
  794. UA_Guid_init((UA_Guid*)ptr);
  795. break;
  796. case UA_TYPES_NODEID:
  797. UA_NodeId_init((UA_NodeId*)ptr);
  798. break;
  799. case UA_TYPES_EXPANDEDNODEID:
  800. UA_ExpandedNodeId_init((UA_ExpandedNodeId*)ptr);
  801. break;
  802. case UA_TYPES_LOCALIZEDTEXT:
  803. UA_LocalizedText_init((UA_LocalizedText*)ptr);
  804. break;
  805. case UA_TYPES_EXTENSIONOBJECT:
  806. UA_ExtensionObject_init((UA_ExtensionObject*)ptr);
  807. break;
  808. case UA_TYPES_DATAVALUE:
  809. UA_DataValue_init((UA_DataValue*)ptr);
  810. break;
  811. case UA_TYPES_VARIANT:
  812. UA_Variant_init((UA_Variant*)ptr);
  813. break;
  814. case UA_TYPES_DIAGNOSTICINFO:
  815. UA_DiagnosticInfo_init((UA_DiagnosticInfo*)ptr);
  816. break;
  817. default:
  818. // QualifiedName, LocalizedText and strings are treated as structures, also
  819. UA_init((void*)ptr, &UA_TYPES[member->memberTypeIndex]);
  820. }
  821. ptr += UA_TYPES[member->memberTypeIndex].memSize;
  822. }
  823. }
  824. void * UA_new(const UA_DataType *dataType) {
  825. void *p = UA_malloc(dataType->memSize);
  826. if(p)
  827. UA_init(p, dataType);
  828. return p;
  829. }
  830. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *dataType) {
  831. if(dataType->fixedSize) {
  832. memcpy(dst, src, dataType->memSize);
  833. return UA_STATUSCODE_GOOD;
  834. }
  835. UA_init(dst, dataType);
  836. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  837. uintptr_t ptrs = (uintptr_t)src;
  838. uintptr_t ptrd = (uintptr_t)dst;
  839. UA_Byte membersSize = dataType->membersSize;
  840. for(size_t i=0;i<membersSize; i++) {
  841. const UA_DataTypeMember *member = &dataType->members[i];
  842. const UA_DataType *memberType;
  843. if(member->namespaceZero)
  844. memberType = &UA_TYPES[member->memberTypeIndex];
  845. else
  846. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  847. if(member->isArray) {
  848. ptrs += (member->padding >> 3);
  849. ptrd += (member->padding >> 3);
  850. UA_Int32 *dstNoElements = (UA_Int32*)ptrd;
  851. const UA_Int32 noElements = *((const UA_Int32*)ptrs);
  852. ptrs += sizeof(UA_Int32) + (member->padding & 0x07);
  853. ptrd += sizeof(UA_Int32) + (member->padding & 0x07);
  854. retval = UA_Array_copy(*(void* const*)ptrs, (void**)ptrd, memberType, noElements);
  855. if(retval != UA_STATUSCODE_GOOD) {
  856. UA_deleteMembers(dst, dataType);
  857. UA_init(dst, dataType);
  858. return retval;
  859. }
  860. *dstNoElements = noElements;
  861. ptrs += sizeof(void*);
  862. ptrd += sizeof(void*);
  863. continue;
  864. }
  865. ptrs += member->padding;
  866. ptrd += member->padding;
  867. if(!member->namespaceZero) {
  868. retval = UA_copy((const void*)ptrs, (void*)ptrd, memberType);
  869. if(retval != UA_STATUSCODE_GOOD) {
  870. UA_deleteMembers(dst, dataType);
  871. UA_init(dst, dataType);
  872. return retval;
  873. }
  874. ptrs += memberType->memSize;
  875. ptrd += memberType->memSize;
  876. continue;
  877. }
  878. switch(member->memberTypeIndex) {
  879. case UA_TYPES_BOOLEAN:
  880. case UA_TYPES_SBYTE:
  881. case UA_TYPES_BYTE:
  882. *((UA_Byte*)ptrd) = *((const UA_Byte*)ptrs);
  883. break;
  884. case UA_TYPES_INT16:
  885. case UA_TYPES_UINT16:
  886. *((UA_Int16*)ptrd) = *((const UA_Byte*)ptrs);
  887. break;
  888. case UA_TYPES_INT32:
  889. case UA_TYPES_UINT32:
  890. case UA_TYPES_STATUSCODE:
  891. case UA_TYPES_FLOAT:
  892. *((UA_Int32*)ptrd) = *((const UA_Int32*)ptrs);
  893. break;
  894. case UA_TYPES_INT64:
  895. case UA_TYPES_UINT64:
  896. case UA_TYPES_DOUBLE:
  897. case UA_TYPES_DATETIME:
  898. *((UA_Int64*)ptrd) = *((const UA_Int64*)ptrs);
  899. break;
  900. case UA_TYPES_GUID:
  901. *((UA_Guid*)ptrd) = *((const UA_Guid*)ptrs);
  902. break;
  903. case UA_TYPES_NODEID:
  904. retval |= UA_NodeId_copy((const UA_NodeId*)ptrs, (UA_NodeId*)ptrd);
  905. break;
  906. case UA_TYPES_EXPANDEDNODEID:
  907. retval |= UA_ExpandedNodeId_copy((const UA_ExpandedNodeId*)ptrs, (UA_ExpandedNodeId*)ptrd);
  908. break;
  909. case UA_TYPES_LOCALIZEDTEXT:
  910. retval |= UA_LocalizedText_copy((const UA_LocalizedText*)ptrs, (UA_LocalizedText*)ptrd);
  911. break;
  912. case UA_TYPES_EXTENSIONOBJECT:
  913. retval |= UA_ExtensionObject_copy((const UA_ExtensionObject*)ptrs, (UA_ExtensionObject*)ptrd);
  914. break;
  915. case UA_TYPES_DATAVALUE:
  916. retval |= UA_DataValue_copy((const UA_DataValue*)ptrs, (UA_DataValue*)ptrd);
  917. break;
  918. case UA_TYPES_VARIANT:
  919. retval |= UA_Variant_copy((const UA_Variant*)ptrs, (UA_Variant*)ptrd);
  920. break;
  921. case UA_TYPES_DIAGNOSTICINFO:
  922. retval |= UA_DiagnosticInfo_copy((const UA_DiagnosticInfo*)ptrs, (UA_DiagnosticInfo*)ptrd);
  923. break;
  924. default:
  925. // QualifiedName, LocalizedText and strings are treated as structures, also
  926. retval |= UA_copy((const void *)ptrs, (void*)ptrd, memberType);
  927. }
  928. ptrs += memberType->memSize;
  929. ptrd += memberType->memSize;
  930. }
  931. if(retval != UA_STATUSCODE_GOOD) {
  932. UA_deleteMembers(dst, dataType);
  933. UA_init(dst, dataType);
  934. }
  935. return retval;
  936. }
  937. void UA_deleteMembers(void *p, const UA_DataType *dataType) {
  938. uintptr_t ptr = (uintptr_t)p;
  939. if(dataType->fixedSize)
  940. return;
  941. UA_Byte membersSize = dataType->membersSize;
  942. for(size_t i=0;i<membersSize; i++) {
  943. const UA_DataTypeMember *member = &dataType->members[i];
  944. const UA_DataType *memberType;
  945. if(member->namespaceZero)
  946. memberType = &UA_TYPES[member->memberTypeIndex];
  947. else
  948. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  949. if(member->isArray) {
  950. ptr += (member->padding >> 3);
  951. UA_Int32 noElements = *((UA_Int32*)ptr);
  952. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  953. UA_Array_delete(*(void**)ptr, memberType, noElements);
  954. *(void**)ptr = UA_NULL;
  955. ptr += sizeof(void*);
  956. continue;
  957. }
  958. ptr += member->padding;
  959. if(!member->namespaceZero) {
  960. UA_deleteMembers((void*)ptr, memberType);
  961. ptr += memberType->memSize;
  962. continue;
  963. }
  964. switch(member->memberTypeIndex) {
  965. case UA_TYPES_BOOLEAN:
  966. case UA_TYPES_SBYTE:
  967. case UA_TYPES_BYTE:
  968. case UA_TYPES_INT16:
  969. case UA_TYPES_UINT16:
  970. case UA_TYPES_INT32:
  971. case UA_TYPES_UINT32:
  972. case UA_TYPES_STATUSCODE:
  973. case UA_TYPES_FLOAT:
  974. case UA_TYPES_INT64:
  975. case UA_TYPES_UINT64:
  976. case UA_TYPES_DOUBLE:
  977. case UA_TYPES_DATETIME:
  978. case UA_TYPES_GUID:
  979. break;
  980. case UA_TYPES_NODEID:
  981. UA_NodeId_deleteMembers((UA_NodeId*)ptr);
  982. break;
  983. case UA_TYPES_EXPANDEDNODEID:
  984. UA_ExpandedNodeId_deleteMembers((UA_ExpandedNodeId*)ptr);
  985. break;
  986. case UA_TYPES_LOCALIZEDTEXT:
  987. UA_LocalizedText_deleteMembers((UA_LocalizedText*)ptr);
  988. break;
  989. case UA_TYPES_EXTENSIONOBJECT:
  990. UA_ExtensionObject_deleteMembers((UA_ExtensionObject*)ptr);
  991. break;
  992. case UA_TYPES_DATAVALUE:
  993. UA_DataValue_deleteMembers((UA_DataValue*)ptr);
  994. break;
  995. case UA_TYPES_VARIANT:
  996. UA_Variant_deleteMembers((UA_Variant*)ptr);
  997. break;
  998. case UA_TYPES_DIAGNOSTICINFO:
  999. UA_DiagnosticInfo_deleteMembers((UA_DiagnosticInfo*)ptr);
  1000. break;
  1001. default:
  1002. // QualifiedName, LocalizedText and strings are treated as structures, also
  1003. UA_deleteMembers((void*)ptr, memberType);
  1004. }
  1005. ptr += memberType->memSize;
  1006. }
  1007. }
  1008. void UA_delete(void *p, const UA_DataType *dataType) {
  1009. UA_deleteMembers(p, dataType);
  1010. UA_free(p);
  1011. }
  1012. /******************/
  1013. /* Array Handling */
  1014. /******************/
  1015. void* UA_Array_new(const UA_DataType *dataType, UA_Int32 noElements) {
  1016. if(noElements <= 0)
  1017. return UA_NULL;
  1018. if((UA_Int32)dataType->memSize * noElements < 0 || dataType->memSize * noElements > MAX_ARRAY_SIZE )
  1019. return UA_NULL;
  1020. if(dataType->fixedSize)
  1021. return calloc(noElements, dataType->memSize);
  1022. void *p = malloc(dataType->memSize * (size_t)noElements);
  1023. if(!p)
  1024. return p;
  1025. uintptr_t ptr = (uintptr_t)p;
  1026. for(int i = 0; i<noElements; i++) {
  1027. UA_init((void*)ptr, dataType);
  1028. ptr += dataType->memSize;
  1029. }
  1030. return p;
  1031. }
  1032. UA_StatusCode UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 noElements) {
  1033. if(noElements <= 0) {
  1034. *dst = UA_NULL;
  1035. return UA_STATUSCODE_GOOD;
  1036. }
  1037. if(!(*dst = UA_malloc((size_t)noElements * dataType->memSize)))
  1038. return UA_STATUSCODE_BADOUTOFMEMORY;
  1039. if(dataType->fixedSize) {
  1040. memcpy(*dst, src, dataType->memSize * (size_t)noElements);
  1041. return UA_STATUSCODE_GOOD;
  1042. }
  1043. uintptr_t ptrs = (uintptr_t)src;
  1044. uintptr_t ptrd = (uintptr_t)*dst;
  1045. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1046. for(int i = 0; i < noElements; i++) {
  1047. retval = UA_copy((void*)ptrs, (void*)ptrd, dataType);
  1048. ptrs += dataType->memSize;
  1049. ptrd += dataType->memSize;
  1050. }
  1051. if(retval != UA_STATUSCODE_GOOD)
  1052. UA_Array_delete(*dst, dataType, noElements);
  1053. return retval;
  1054. }
  1055. void UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 noElements) {
  1056. if(!dataType->fixedSize) {
  1057. uintptr_t ptr = (uintptr_t)p;
  1058. for(UA_Int32 i = 0; i<noElements; i++) {
  1059. UA_deleteMembers((void*)ptr, dataType);
  1060. ptr += dataType->memSize;
  1061. }
  1062. }
  1063. UA_free(p);
  1064. }