ua_basictypes.c 63 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692
  1. #include <stdio.h> // printf
  2. #include <stdlib.h> // alloc, free, vsnprintf
  3. #include <string.h>
  4. #include <stdarg.h> // va_start, va_end
  5. #include <time.h>
  6. #include "opcua.h"
  7. #include "ua_basictypes.h"
  8. static inline UA_Int32 UA_VTable_isValidType(UA_Int32 type) {
  9. if(type < 0 /* UA_BOOLEAN */ || type > 271 /* UA_INVALID */)
  10. return UA_ERR_INVALID_VALUE;
  11. return UA_SUCCESS;
  12. }
  13. UA_Int32 UA_encodeBinary(void const * data, UA_Int32 *pos, UA_Int32 type, UA_ByteString* dst) {
  14. if(UA_VTable_isValidType(type) != UA_SUCCESS) return UA_ERROR;
  15. return UA_[type].encodeBinary(data,pos,dst);
  16. }
  17. UA_Int32 UA_decodeBinary(UA_ByteString const * data, UA_Int32* pos, UA_Int32 type, void* dst){
  18. if(UA_VTable_isValidType(type) != UA_SUCCESS) return UA_ERROR;
  19. UA_[type].init(dst);
  20. return UA_[type].decodeBinary(data,pos,dst);
  21. }
  22. UA_Int32 UA_calcSize(void const * data, UA_UInt32 type) {
  23. if(UA_VTable_isValidType(type) != UA_SUCCESS) return UA_ERROR;
  24. return (UA_[type].calcSize)(data);
  25. }
  26. UA_Int32 UA_Array_calcSize(UA_Int32 nElements, UA_Int32 type, void const * const * data) {
  27. if(UA_VTable_isValidType(type) != UA_SUCCESS) return 0;
  28. UA_Int32 length = sizeof(UA_Int32);
  29. for(UA_Int32 i=0; i<nElements; i++) {
  30. length += UA_calcSize((void*)data[i],type);
  31. }
  32. return length;
  33. }
  34. UA_Int32 UA_Array_encodeBinary(void const * const *src, UA_Int32 noElements, UA_Int32 type, UA_Int32* pos, UA_ByteString* dst) {
  35. UA_Int32 retval = UA_SUCCESS;
  36. retval = UA_Int32_encodeBinary(&noElements, pos, dst);
  37. for(UA_Int32 i=0; i<noElements; i++) {
  38. retval |= UA_[type].encodeBinary((void*)src[i], pos, dst);
  39. }
  40. return retval;
  41. }
  42. UA_Int32 UA_Array_delete(void *** p, UA_Int32 noElements, UA_Int32 type) {
  43. UA_Int32 retval = UA_SUCCESS;
  44. void ** arr = *p;
  45. if(arr != UA_NULL) {
  46. for(UA_Int32 i=0; i<noElements; i++) {
  47. retval |= UA_[type].delete(arr[i]);
  48. }
  49. }
  50. UA_free(arr);
  51. *p = UA_NULL;
  52. return retval;
  53. }
  54. UA_Int32 UA_Array_decodeBinary(UA_ByteString const * src, UA_Int32 noElements, UA_Int32 type, UA_Int32* pos, void *** dst) {
  55. UA_Int32 retval = UA_SUCCESS;
  56. void ** arr = *dst;
  57. UA_Int32 i=0;
  58. for(; i<noElements && retval == UA_SUCCESS; i++) {
  59. retval |= UA_[type].decodeBinary(src, pos, arr[i]);
  60. }
  61. if(retval != UA_SUCCESS) {
  62. UA_Array_delete(dst, i, type); // Be careful! The pointer to dst is not reset in the calling function
  63. }
  64. return retval;
  65. }
  66. // TODO: Do we need to implement? We would need to add init to the VTable...
  67. // UA_Int32 UA_Array_init(void **p,UA_Int32 noElements, UA_Int32 type) {
  68. /** p is the address of a pointer to an array of pointers (type**).
  69. * [p] -> [p1, p2, p3, p4]
  70. * +-> struct 1, ...
  71. */
  72. UA_Int32 UA_Array_new(void ***p,UA_Int32 noElements, UA_Int32 type) {
  73. UA_Int32 retval = UA_SUCCESS;
  74. // Get memory for the pointers
  75. CHECKED_DECODE(UA_VTable_isValidType(type), ;);
  76. CHECKED_DECODE(UA_alloc((void**)p, sizeof(void*)*noElements), ;);
  77. // Then allocate all the elements. We could allocate all the members in one chunk and
  78. // calculate the addresses to prevent memory segmentation. This would however not call
  79. // init for each member
  80. void *arr = *p;
  81. UA_Int32 i=0;
  82. for(; i<noElements && retval == UA_SUCCESS; i++) {
  83. retval |= UA_[type].new((void**)arr+i);
  84. }
  85. if(retval != UA_SUCCESS) {
  86. UA_Array_delete(p, i, type);
  87. }
  88. return retval;
  89. }
  90. UA_Int32 UA_Array_copy(void const * const * src, UA_Int32 noElements, UA_Int32 type, void ***dst) {
  91. UA_Int32 retval = UA_SUCCESS;
  92. // Get memory for the pointers
  93. CHECKED_DECODE(UA_Array_new(dst, noElements, type), dst = UA_NULL;);
  94. void **arr = *dst;
  95. //only namespace zero types atm
  96. if(UA_VTable_isValidType(type) != UA_SUCCESS)
  97. return UA_ERROR;
  98. for(UA_Int32 i=0; i<noElements; i++) {
  99. UA_[type].copy(src[i], arr[i]);
  100. }
  101. return retval;
  102. }
  103. UA_Int32 _UA_free(void * ptr,char *pname,char* f,UA_Int32 l){
  104. DBG_VERBOSE(printf("UA_free;%p;;%s;;%s;%d\n",ptr,pname,f,l); fflush(stdout));
  105. free(ptr); // checks if ptr != NULL in the background
  106. return UA_SUCCESS;
  107. }
  108. void const * UA_alloc_lastptr;
  109. UA_Int32 _UA_alloc(void ** ptr, UA_Int32 size,char*pname,char*sname,char* f,UA_Int32 l){
  110. if(ptr == UA_NULL) return UA_ERR_INVALID_VALUE;
  111. UA_alloc_lastptr = *ptr = malloc(size);
  112. DBG_VERBOSE(printf("UA_alloc - %p;%d;%s;%s;%s;%d\n",*ptr,size,pname,sname,f,l); fflush(stdout));
  113. if(*ptr == UA_NULL) return UA_ERR_NO_MEMORY;
  114. return UA_SUCCESS;
  115. }
  116. UA_Int32 UA_memcpy(void * dst, void const * src, UA_Int32 size){
  117. if(dst == UA_NULL) return UA_ERR_INVALID_VALUE;
  118. DBG_VERBOSE(printf("UA_memcpy - %p;%p;%d\n",dst,src,size));
  119. memcpy(dst, src, size);
  120. return UA_SUCCESS;
  121. }
  122. #define UA_TYPE_ENCODEBINARY(TYPE, CODE) \
  123. UA_Int32 TYPE##_encodeBinary(TYPE const * src, UA_Int32* pos, UA_ByteString * dst) { \
  124. UA_Int32 retval = UA_SUCCESS; \
  125. if ( *pos < 0 || *pos+TYPE##_calcSize(src) > dst->length ) { \
  126. return UA_ERR_INVALID_VALUE; \
  127. } else { \
  128. CODE \
  129. } \
  130. return retval; \
  131. }
  132. // Attention! this macro works only for TYPEs with storageSize = encodingSize
  133. #define UA_TYPE_DECODEBINARY(TYPE, CODE) \
  134. UA_Int32 TYPE##_decodeBinary(UA_ByteString const * src, UA_Int32* pos, TYPE * dst) { \
  135. UA_Int32 retval = UA_SUCCESS; \
  136. if ( *pos < 0 || *pos+TYPE##_calcSize(UA_NULL) > src->length ) { \
  137. return UA_ERR_INVALID_VALUE; \
  138. } else { \
  139. CODE \
  140. } \
  141. return retval; \
  142. }
  143. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Boolean)
  144. UA_TYPE_ENCODEBINARY(UA_Boolean,
  145. UA_Boolean tmpBool = ((*src > 0) ? UA_TRUE : UA_FALSE);
  146. memcpy(&(dst->data[(*pos)++]), &tmpBool, sizeof(UA_Boolean));)
  147. UA_TYPE_DECODEBINARY(UA_Boolean, *dst = ((UA_Boolean) (src->data[(*pos)++]) > 0) ? UA_TRUE : UA_FALSE;)
  148. UA_Int32 UA_Boolean_init(UA_Boolean * p){
  149. if(p==UA_NULL)return UA_ERROR;
  150. *p = UA_FALSE;
  151. return UA_SUCCESS;
  152. }
  153. UA_TYPE_METHOD_DELETE_FREE(UA_Boolean)
  154. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Boolean)
  155. UA_TYPE_METHOD_NEW_DEFAULT(UA_Boolean)
  156. UA_TYPE_METHOD_COPY(UA_Boolean)
  157. UA_Int32 UA_Boolean_copycstring(cstring src, UA_Boolean* dst) {
  158. *dst = UA_FALSE;
  159. if (0 == strncmp(src, "true", 4) || 0 == strncmp(src, "TRUE", 4)) {
  160. *dst = UA_TRUE;
  161. }
  162. return UA_SUCCESS;
  163. }
  164. UA_Int32 UA_Boolean_decodeXML(XML_Stack* s, XML_Attr* attr, UA_Boolean* dst, _Bool isStart) {
  165. DBG_VERBOSE(printf("UA_Boolean entered with dst=%p,isStart=%d\n", (void* ) dst, isStart));
  166. if (isStart) {
  167. if (dst == UA_NULL) {
  168. UA_Boolean_new(&dst);
  169. s->parent[s->depth - 1].children[s->parent[s->depth - 1].activeChild].obj = (void*) dst;
  170. }
  171. UA_Boolean_copycstring((cstring) attr[1], dst);
  172. }
  173. return UA_SUCCESS;
  174. }
  175. /* UA_Byte */
  176. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Byte)
  177. UA_TYPE_ENCODEBINARY(UA_Byte, dst->data[(*pos)++] = *src;)
  178. UA_TYPE_DECODEBINARY(UA_Byte, *dst = src->data[(*pos)++];)
  179. UA_TYPE_METHOD_DELETE_FREE(UA_Byte)
  180. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Byte)
  181. UA_TYPE_METHOD_INIT_DEFAULT(UA_Byte)
  182. UA_TYPE_METHOD_NEW_DEFAULT(UA_Byte)
  183. UA_TYPE_METHOD_COPY(UA_Byte)
  184. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_Byte)
  185. /* UA_SByte */
  186. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_SByte)
  187. UA_TYPE_ENCODEBINARY(UA_SByte, dst->data[(*pos)++] = *src;)
  188. UA_TYPE_DECODEBINARY(UA_SByte, *dst = src->data[(*pos)++];)
  189. UA_TYPE_METHOD_DELETE_FREE(UA_SByte)
  190. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_SByte)
  191. UA_TYPE_METHOD_INIT_DEFAULT(UA_SByte)
  192. UA_TYPE_METHOD_NEW_DEFAULT(UA_SByte)
  193. UA_TYPE_METHOD_COPY(UA_SByte)
  194. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_SByte)
  195. /* UA_UInt16 */
  196. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_UInt16)
  197. UA_TYPE_ENCODEBINARY(UA_UInt16,
  198. dst->data[(*pos)++] = (*src & 0x00FF) >> 0;
  199. dst->data[(*pos)++] = (*src & 0xFF00) >> 8;)
  200. UA_TYPE_DECODEBINARY(UA_UInt16,
  201. *dst = (UA_UInt16) src->data[(*pos)++] << 0;
  202. *dst |= (UA_UInt16) src->data[(*pos)++] << 8;)
  203. UA_TYPE_METHOD_DELETE_FREE(UA_UInt16)
  204. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_UInt16)
  205. UA_TYPE_METHOD_INIT_DEFAULT(UA_UInt16)
  206. UA_TYPE_METHOD_NEW_DEFAULT(UA_UInt16)
  207. UA_TYPE_METHOD_COPY(UA_UInt16)
  208. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_UInt16)
  209. /** UA_Int16 - signed integer, 2 bytes */
  210. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Int16)
  211. UA_TYPE_ENCODEBINARY(UA_Int16, retval = UA_UInt16_encodeBinary((UA_UInt16 const *) src,pos,dst);)
  212. UA_TYPE_DECODEBINARY(UA_Int16,
  213. *dst = (UA_Int16) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 0);
  214. *dst |= (UA_Int16) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 8);)
  215. UA_TYPE_METHOD_DELETE_FREE(UA_Int16)
  216. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Int16)
  217. UA_TYPE_METHOD_INIT_DEFAULT(UA_Int16)
  218. UA_TYPE_METHOD_NEW_DEFAULT(UA_Int16)
  219. UA_TYPE_METHOD_COPY(UA_Int16)
  220. /** UA_Int32 - signed integer, 4 bytes */
  221. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Int32)
  222. UA_TYPE_ENCODEBINARY(UA_Int32,
  223. dst->data[(*pos)++] = (*src & 0x000000FF) >> 0;
  224. dst->data[(*pos)++] = (*src & 0x0000FF00) >> 8;
  225. dst->data[(*pos)++] = (*src & 0x00FF0000) >> 16;
  226. dst->data[(*pos)++] = (*src & 0xFF000000) >> 24;)
  227. UA_TYPE_DECODEBINARY(UA_Int32,
  228. *dst = (UA_Int32) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 0);
  229. *dst |= (UA_Int32) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 8);
  230. *dst |= (UA_Int32) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 16);
  231. *dst |= (UA_Int32) (((UA_SByte) (src->data[(*pos)++]) & 0xFF) << 24);)
  232. UA_TYPE_METHOD_DELETE_FREE(UA_Int32)
  233. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Int32)
  234. UA_TYPE_METHOD_INIT_DEFAULT(UA_Int32)
  235. UA_TYPE_METHOD_NEW_DEFAULT(UA_Int32)
  236. UA_TYPE_METHOD_COPY(UA_Int32)
  237. /** UA_UInt32 - unsigned integer, 4 bytes */
  238. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_UInt32)
  239. UA_TYPE_ENCODEBINARY(UA_UInt32, retval = UA_Int32_encodeBinary((UA_Int32 const *)src,pos,dst);)
  240. UA_TYPE_DECODEBINARY(UA_UInt32,
  241. UA_UInt32 t1 = (UA_UInt32)((UA_Byte)(src->data[(*pos)++] & 0xFF));
  242. UA_UInt32 t2 = (UA_UInt32)((UA_Byte)(src->data[(*pos)++]& 0xFF) << 8);
  243. UA_UInt32 t3 = (UA_UInt32)((UA_Byte)(src->data[(*pos)++]& 0xFF) << 16);
  244. UA_UInt32 t4 = (UA_UInt32)((UA_Byte)(src->data[(*pos)++]& 0xFF) << 24);
  245. *dst = t1 + t2 + t3 + t4;)
  246. UA_TYPE_METHOD_DELETE_FREE(UA_UInt32)
  247. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_UInt32)
  248. UA_TYPE_METHOD_INIT_DEFAULT(UA_UInt32)
  249. UA_TYPE_METHOD_NEW_DEFAULT(UA_UInt32)
  250. UA_TYPE_METHOD_COPY(UA_UInt32)
  251. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_UInt32)
  252. /** UA_Int64 - signed integer, 8 bytes */
  253. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Int64)
  254. UA_TYPE_ENCODEBINARY(UA_Int64,
  255. dst->data[(*pos)++] = (*src & 0x00000000000000FF) >> 0;
  256. dst->data[(*pos)++] = (*src & 0x000000000000FF00) >> 8;
  257. dst->data[(*pos)++] = (*src & 0x0000000000FF0000) >> 16;
  258. dst->data[(*pos)++] = (*src & 0x00000000FF000000) >> 24;
  259. dst->data[(*pos)++] = (*src & 0x000000FF00000000) >> 32;
  260. dst->data[(*pos)++] = (*src & 0x0000FF0000000000) >> 40;
  261. dst->data[(*pos)++] = (*src & 0x00FF000000000000) >> 48;
  262. dst->data[(*pos)++] = (*src & 0xFF00000000000000) >> 56;)
  263. UA_TYPE_DECODEBINARY(UA_Int64,
  264. *dst = (UA_Int64) src->data[(*pos)++] << 0;
  265. *dst |= (UA_Int64) src->data[(*pos)++] << 8;
  266. *dst |= (UA_Int64) src->data[(*pos)++] << 16;
  267. *dst |= (UA_Int64) src->data[(*pos)++] << 24;
  268. *dst |= (UA_Int64) src->data[(*pos)++] << 32;
  269. *dst |= (UA_Int64) src->data[(*pos)++] << 40;
  270. *dst |= (UA_Int64) src->data[(*pos)++] << 48;
  271. *dst |= (UA_Int64) src->data[(*pos)++] << 56;)
  272. UA_TYPE_METHOD_DELETE_FREE(UA_Int64)
  273. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Int64)
  274. UA_TYPE_METHOD_INIT_DEFAULT(UA_Int64)
  275. UA_TYPE_METHOD_NEW_DEFAULT(UA_Int64)
  276. UA_TYPE_METHOD_COPY(UA_Int64)
  277. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_Int64)
  278. /** UA_UInt64 - unsigned integer, 8 bytes */
  279. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_UInt64)
  280. UA_TYPE_ENCODEBINARY(UA_UInt64, return UA_Int64_encodeBinary((UA_Int64 const *)src,pos,dst);)
  281. UA_TYPE_DECODEBINARY(UA_UInt64,
  282. UA_UInt64 t1 = (UA_UInt64) src->data[(*pos)++];
  283. UA_UInt64 t2 = (UA_UInt64) src->data[(*pos)++] << 8;
  284. UA_UInt64 t3 = (UA_UInt64) src->data[(*pos)++] << 16;
  285. UA_UInt64 t4 = (UA_UInt64) src->data[(*pos)++] << 24;
  286. UA_UInt64 t5 = (UA_UInt64) src->data[(*pos)++] << 32;
  287. UA_UInt64 t6 = (UA_UInt64) src->data[(*pos)++] << 40;
  288. UA_UInt64 t7 = (UA_UInt64) src->data[(*pos)++] << 48;
  289. UA_UInt64 t8 = (UA_UInt64) src->data[(*pos)++] << 56;
  290. *dst = t1 + t2 + t3 + t4 + t5 + t6 + t7 + t8;)
  291. UA_TYPE_METHOD_DELETE_FREE(UA_UInt64)
  292. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_UInt64)
  293. UA_TYPE_METHOD_INIT_DEFAULT(UA_UInt64)
  294. UA_TYPE_METHOD_NEW_DEFAULT(UA_UInt64)
  295. UA_TYPE_METHOD_COPY(UA_UInt64)
  296. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_UInt64)
  297. /** UA_Float - IEE754 32bit float with biased exponent */
  298. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Float)
  299. // FIXME: Implement NaN, Inf and Zero(s)
  300. UA_Byte UA_FLOAT_ZERO[] = {0x00,0x00,0x00,0x00};
  301. UA_TYPE_DECODEBINARY(UA_Float,
  302. if (memcmp(&(src->data[*pos]),UA_FLOAT_ZERO,4)==0) { return UA_Int32_decodeBinary(src,pos,(UA_Int32*)dst); }
  303. UA_Float mantissa;
  304. mantissa = (UA_Float) (src->data[*pos] & 0xFF); // bits 0-7
  305. mantissa = (mantissa / 256.0 ) + (UA_Float) (src->data[*pos+1] & 0xFF); // bits 8-15
  306. mantissa = (mantissa / 256.0 ) + (UA_Float) (src->data[*pos+2] & 0x7F); // bits 16-22
  307. UA_UInt32 biasedExponent ;
  308. biasedExponent = (src->data[*pos+2] & 0x80) >> 7; // bits 23
  309. biasedExponent |= (src->data[*pos+3] & 0x7F) << 1; // bits 24-30
  310. UA_Float sign = ( src->data[*pos + 3] & 0x80 ) ? -1.0 : 1.0; // bit 31
  311. if (biasedExponent >= 127) {
  312. *dst = (UA_Float) sign * (1 << (biasedExponent-127)) * (1.0 + mantissa / 128.0 );
  313. } else {
  314. *dst = (UA_Float) sign * 2.0 * (1.0 + mantissa / 128.0 ) / ((UA_Float) (biasedExponent-127));
  315. }
  316. *pos += 4;)
  317. UA_TYPE_ENCODEBINARY(UA_Float, return UA_UInt32_encodeBinary((UA_UInt32*)src,pos,dst);)
  318. UA_TYPE_METHOD_DELETE_FREE(UA_Float)
  319. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Float)
  320. UA_Int32 UA_Float_init(UA_Float * p){
  321. if(p==UA_NULL)return UA_ERROR;
  322. *p = (UA_Float)0.0;
  323. return UA_SUCCESS;
  324. }
  325. UA_TYPE_METHOD_NEW_DEFAULT(UA_Float)
  326. UA_TYPE_METHOD_COPY(UA_Float)
  327. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_Float)
  328. /** UA_Double - IEEE754 64bit float with biased exponent*/
  329. UA_TYPE_METHOD_CALCSIZE_SIZEOF(UA_Double)
  330. // FIXME: Implement NaN, Inf and Zero(s)
  331. UA_Byte UA_DOUBLE_ZERO[] = {0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};
  332. UA_TYPE_DECODEBINARY(UA_Double,
  333. if (memcmp(&(src->data[*pos]),UA_DOUBLE_ZERO,8)==0) { return UA_Int64_decodeBinary(src,pos,(UA_Int64*)dst); }
  334. UA_Double mantissa;
  335. mantissa = (UA_Double) (src->data[*pos] & 0xFF); // bits 0-7
  336. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+1] & 0xFF); // bits 8-15
  337. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+2] & 0xFF); // bits 16-23
  338. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+3] & 0xFF); // bits 24-31
  339. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+4] & 0xFF); // bits 32-39
  340. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+5] & 0xFF); // bits 40-47
  341. mantissa = (mantissa / 256.0 ) + (UA_Double) (src->data[*pos+6] & 0x0F); // bits 48-51
  342. DBG_VERBOSE(printf("UA_Double_decodeBinary - mantissa=%f\n", mantissa));
  343. UA_UInt32 biasedExponent ;
  344. biasedExponent = (src->data[*pos+6] & 0xF0) >> 4; // bits 52-55
  345. DBG_VERBOSE(printf("UA_Double_decodeBinary - biasedExponent52-55=%d, src=%d\n", biasedExponent,src->data[*pos+6]));
  346. biasedExponent |= ((UA_UInt32) (src->data[*pos+7] & 0x7F)) << 4; // bits 56-62
  347. DBG_VERBOSE(printf("UA_Double_decodeBinary - biasedExponent56-62=%d, src=%d\n", biasedExponent,src->data[*pos+7]));
  348. UA_Double sign = ( src->data[*pos+7] & 0x80 ) ? -1.0 : 1.0; // bit 63
  349. if (biasedExponent >= 1023) {
  350. *dst = (UA_Double) sign * (1 << (biasedExponent-1023)) * (1.0 + mantissa / 8.0 );
  351. } else {
  352. *dst = (UA_Double) sign * 2.0 * (1.0 + mantissa / 8.0 ) / ((UA_Double) (biasedExponent-1023));
  353. }
  354. *pos += 8;)
  355. UA_TYPE_ENCODEBINARY(UA_Double, return UA_UInt64_encodeBinary((UA_UInt64*)src,pos,dst);)
  356. UA_TYPE_METHOD_DELETE_FREE(UA_Double)
  357. UA_TYPE_METHOD_DELETEMEMBERS_NOACTION(UA_Double)
  358. UA_TYPE_METHOD_INIT_DEFAULT(UA_Double)
  359. UA_TYPE_METHOD_NEW_DEFAULT(UA_Double)
  360. UA_TYPE_METHOD_COPY(UA_Double)
  361. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_Double)
  362. /** UA_String */
  363. UA_Int32 UA_String_calcSize(UA_String const * string) {
  364. if (string == UA_NULL) { // internal size for UA_memalloc
  365. return sizeof(UA_String);
  366. } else { // binary encoding size
  367. if (string->length > 0) {
  368. return sizeof(UA_Int32) + string->length * sizeof(UA_Byte);
  369. } else {
  370. return sizeof(UA_Int32);
  371. }
  372. }
  373. }
  374. UA_Int32 UA_String_encodeBinary(UA_String const * src, UA_Int32* pos, UA_ByteString* dst) {
  375. UA_Int32 retval = UA_SUCCESS;
  376. if (src == UA_NULL) return UA_ERR_INVALID_VALUE;
  377. if (*pos < 0 || *pos + UA_String_calcSize(src) > dst->length) return UA_ERR_INVALID_VALUE;
  378. retval |= UA_Int32_encodeBinary(&(src->length), pos, dst);
  379. if (src->length > 0) {
  380. retval |= UA_memcpy(&(dst->data[*pos]), src->data, src->length);
  381. *pos += src->length;
  382. }
  383. return retval;
  384. }
  385. UA_Int32 UA_String_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_String * dst) {
  386. UA_Int32 retval = UA_SUCCESS;
  387. UA_String_init(dst);
  388. retval |= UA_Int32_decodeBinary(src,pos,&(dst->length));
  389. if(dst->length > (src->length - *pos)) {
  390. retval = UA_ERR_INVALID_VALUE;
  391. }
  392. if (retval != UA_SUCCESS || dst->length <= 0) {
  393. dst->length = -1;
  394. dst->data = UA_NULL;
  395. } else {
  396. CHECKED_DECODE(UA_alloc((void**)&(dst->data),dst->length), dst->length = -1);
  397. CHECKED_DECODE(UA_memcpy(dst->data,&(src->data[*pos]),dst->length), UA_free(dst->data); dst->data = UA_NULL; dst->length = -1);
  398. *pos += dst->length;
  399. }
  400. return retval;
  401. }
  402. UA_TYPE_METHOD_NEW_DEFAULT(UA_String)
  403. UA_TYPE_METHOD_DELETE_STRUCT(UA_String)
  404. UA_Int32 UA_String_deleteMembers(UA_String* p) {
  405. UA_Int32 retval = UA_SUCCESS;
  406. if(p->data != UA_NULL) {
  407. retval |= UA_free(p->data);
  408. p->data = UA_NULL;
  409. p->length = -1;
  410. }
  411. return retval;
  412. }
  413. UA_Int32 UA_String_copy(UA_String const * src, UA_String* dst) {
  414. UA_Int32 retval = UA_SUCCESS;
  415. dst->data = UA_NULL;
  416. dst->length = -1;
  417. if (src->length > 0) {
  418. retval |= UA_alloc((void**)&(dst->data), src->length);
  419. if (retval == UA_SUCCESS) {
  420. retval |= UA_memcpy((void*)dst->data, src->data, src->length);
  421. dst->length = src->length;
  422. }
  423. }
  424. return retval;
  425. }
  426. UA_Int32 UA_String_copycstring(char const * src, UA_String* dst) {
  427. UA_Int32 retval = UA_SUCCESS;
  428. dst->length = strlen(src);
  429. dst->data = UA_NULL;
  430. if (dst->length > 0) {
  431. retval |= UA_alloc((void**)&(dst->data), dst->length);
  432. if (retval == UA_SUCCESS) {
  433. retval |= UA_memcpy((void*)dst->data, src, dst->length);
  434. }
  435. }
  436. return retval;
  437. }
  438. #define UA_STRING_COPYPRINTF_BUFSIZE 1024
  439. UA_Int32 UA_String_copyprintf(char const * fmt, UA_String* dst, ...) {
  440. UA_Int32 retval = UA_SUCCESS;
  441. char src[UA_STRING_COPYPRINTF_BUFSIZE];
  442. UA_Int32 len;
  443. va_list ap;
  444. va_start(ap, dst);
  445. len = vsnprintf(src,UA_STRING_COPYPRINTF_BUFSIZE,fmt,ap);
  446. va_end(ap);
  447. if (len < 0) { // FIXME: old glibc 2.0 would return -1 when truncated
  448. dst->length = 0;
  449. dst->data = UA_NULL;
  450. retval = UA_ERR_INVALID_VALUE;
  451. } else {
  452. // since glibc 2.1 vsnprintf returns len that would have resulted if buf were large enough
  453. dst->length = ( len > UA_STRING_COPYPRINTF_BUFSIZE ? UA_STRING_COPYPRINTF_BUFSIZE : len );
  454. retval |= UA_alloc((void**)&(dst->data), dst->length);
  455. if (retval == UA_SUCCESS) {
  456. retval |= UA_memcpy((void*)dst->data, src, dst->length);
  457. }
  458. }
  459. return retval;
  460. }
  461. UA_String UA_String_null = { -1, UA_NULL };
  462. UA_Int32 UA_String_init(UA_String* p){
  463. if(p==UA_NULL)return UA_ERROR;
  464. p->length = -1;
  465. p->data = UA_NULL;
  466. return UA_SUCCESS;
  467. }
  468. UA_Int32 UA_String_compare(const UA_String* string1, const UA_String* string2) {
  469. UA_Int32 retval;
  470. if (string1->length == 0 && string2->length == 0) {
  471. retval = UA_EQUAL;
  472. } else if (string1->length == -1 && string2->length == -1) {
  473. retval = UA_EQUAL;
  474. } else if (string1->length != string2->length) {
  475. retval = UA_NOT_EQUAL;
  476. } else {
  477. // casts are needed to overcome signed warnings
  478. UA_Int32 is = strncmp((char const*)string1->data,(char const*)string2->data,string1->length);
  479. retval = (is == 0) ? UA_EQUAL : UA_NOT_EQUAL;
  480. }
  481. return retval;
  482. }
  483. void UA_String_printf(char const * label, const UA_String* string) {
  484. printf("%s {Length=%d, Data=%.*s}\n", label, string->length,
  485. string->length, (char*)string->data);
  486. }
  487. void UA_String_printx(char const * label, const UA_String* string) {
  488. if (string == UA_NULL) { printf("%s {NULL}\n", label); return; }
  489. printf("%s {Length=%d, Data=", label, string->length);
  490. if (string->length > 0) {
  491. for (UA_Int32 i = 0; i < string->length; i++) {
  492. printf("%c%d", i == 0 ? '{' : ',', (string->data)[i]);
  493. // if (i > 0 && !(i%20)) { printf("\n\t"); }
  494. }
  495. } else {
  496. printf("{");
  497. }
  498. printf("}}\n");
  499. }
  500. void UA_String_printx_hex(char const * label, const UA_String* string) {
  501. printf("%s {Length=%d, Data=", label, string->length);
  502. if (string->length > 0) {
  503. for (UA_Int32 i = 0; i < string->length; i++) {
  504. printf("%c%x", i == 0 ? '{' : ',', (string->data)[i]);
  505. }
  506. } else {
  507. printf("{");
  508. }
  509. printf("}}\n");
  510. }
  511. // TODO: should we really want to handle UA_String and UA_ByteString the same way?
  512. UA_TYPE_METHOD_PROTOTYPES_AS(UA_ByteString, UA_String)
  513. UA_TYPE_METHOD_NEW_DEFAULT(UA_ByteString)
  514. UA_Int32 UA_ByteString_compare(const UA_ByteString *string1, const UA_ByteString *string2) {
  515. return UA_String_compare((const UA_String*) string1, (const UA_String*) string2);
  516. }
  517. void UA_ByteString_printf(char* label, const UA_ByteString* string) {
  518. UA_String_printf(label, (UA_String*) string);
  519. }
  520. void UA_ByteString_printx(char* label, const UA_ByteString* string) {
  521. UA_String_printx(label, (UA_String*) string);
  522. }
  523. void UA_ByteString_printx_hex(char* label, const UA_ByteString* string) {
  524. UA_String_printx_hex(label, (UA_String*) string);
  525. }
  526. UA_Byte UA_Byte_securityPoliceNoneData[] = "http://opcfoundation.org/UA/SecurityPolicy#None";
  527. // sizeof()-1 : discard the implicit null-terminator of the c-char-string
  528. UA_ByteString UA_ByteString_securityPoliceNone = { sizeof(UA_Byte_securityPoliceNoneData)-1, UA_Byte_securityPoliceNoneData };
  529. UA_Int32 UA_ByteString_newMembers(UA_ByteString* p, UA_Int32 length) {
  530. UA_Int32 retval = UA_SUCCESS;
  531. if ((retval |= UA_alloc((void**)&(p->data),length)) == UA_SUCCESS) {
  532. p->length = length;
  533. } else {
  534. p->length = length;
  535. p->data = UA_NULL;
  536. }
  537. return retval;
  538. }
  539. /* UA_Guid */
  540. UA_Int32 UA_Guid_calcSize(UA_Guid const * p) {
  541. if (p == UA_NULL) {
  542. return sizeof(UA_Guid);
  543. } else {
  544. return 16;
  545. }
  546. }
  547. UA_TYPE_ENCODEBINARY(UA_Guid,
  548. retval |= UA_UInt32_encodeBinary(&(src->data1), pos, dst);
  549. retval |= UA_UInt16_encodeBinary(&(src->data2), pos, dst);
  550. retval |= UA_UInt16_encodeBinary(&(src->data3), pos, dst);
  551. for (UA_Int32 i=0;i<8;i++) {
  552. retval |= UA_Byte_encodeBinary(&(src->data4[i]), pos, dst);
  553. })
  554. UA_Int32 UA_Guid_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_Guid *dst) {
  555. UA_Int32 retval = UA_SUCCESS;
  556. // TODO: This could be done with a single memcpy (if the compiler does no fancy realigning of structs)
  557. CHECKED_DECODE(UA_UInt32_decodeBinary(src,pos,&dst->data1), ;);
  558. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&dst->data2), ;);
  559. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&dst->data3), ;);
  560. for (UA_Int32 i=0;i<8;i++) {
  561. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&dst->data4[i]), ;);
  562. }
  563. return retval;
  564. }
  565. UA_TYPE_METHOD_DELETE_STRUCT(UA_Guid)
  566. UA_Int32 UA_Guid_deleteMembers(UA_Guid* p) { return UA_SUCCESS; }
  567. UA_Int32 UA_Guid_compare(const UA_Guid *g1, const UA_Guid *g2) { return memcmp(g1, g2, sizeof(UA_Guid)); }
  568. UA_Int32 UA_Guid_init(UA_Guid* p){
  569. if(p==UA_NULL) return UA_ERROR;
  570. p->data1 = 0;
  571. p->data2 = 0;
  572. p->data3 = 0;
  573. memset(p->data4,8,sizeof(UA_Byte));
  574. return UA_SUCCESS;
  575. }
  576. UA_TYPE_METHOD_NEW_DEFAULT(UA_Guid)
  577. UA_Int32 UA_Guid_copy(UA_Guid const *src, UA_Guid *dst)
  578. {
  579. UA_Int32 retval = UA_SUCCESS;
  580. retval |= UA_alloc((void**)&dst,UA_Guid_calcSize(UA_NULL));
  581. retval |= UA_memcpy((void*)dst,(void*)src,UA_Guid_calcSize(UA_NULL));
  582. return retval;
  583. }
  584. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_Guid)
  585. /* UA_LocalizedText */
  586. UA_Int32 UA_LocalizedText_calcSize(UA_LocalizedText const * p) {
  587. UA_Int32 length = 0;
  588. if (p==UA_NULL) {
  589. // size for UA_memalloc
  590. length = sizeof(UA_LocalizedText);
  591. } else {
  592. // size for binary encoding
  593. length += 1; // p->encodingMask;
  594. if (p->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  595. length += UA_String_calcSize(&(p->locale));
  596. }
  597. if (p->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  598. length += UA_String_calcSize(&(p->text));
  599. }
  600. }
  601. return length;
  602. }
  603. UA_TYPE_ENCODEBINARY(UA_LocalizedText,
  604. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  605. if (src->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  606. retval |= UA_String_encodeBinary(&(src->locale),pos,dst);
  607. }
  608. if (src->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  609. retval |= UA_String_encodeBinary(&(src->text),pos,dst);
  610. })
  611. UA_Int32 UA_LocalizedText_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_LocalizedText *dst) {
  612. UA_Int32 retval = UA_SUCCESS;
  613. retval |= UA_String_init(&dst->locale);
  614. retval |= UA_String_init(&dst->text);
  615. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&dst->encodingMask), ;);
  616. if (dst->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  617. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&dst->locale), UA_LocalizedText_deleteMembers(dst));
  618. }
  619. if (dst->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  620. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&dst->text), UA_LocalizedText_deleteMembers(dst));
  621. }
  622. return retval;
  623. }
  624. UA_TYPE_METHOD_DELETE_STRUCT(UA_LocalizedText)
  625. UA_Int32 UA_LocalizedText_deleteMembers(UA_LocalizedText* p) {
  626. return UA_SUCCESS | UA_String_deleteMembers(&p->locale) | UA_String_deleteMembers(&p->text);
  627. }
  628. UA_Int32 UA_LocalizedText_init(UA_LocalizedText* p){
  629. if(p==UA_NULL) return UA_ERROR;
  630. p->encodingMask = 0;
  631. UA_String_init(&(p->locale));
  632. UA_String_init(&(p->text));
  633. return UA_SUCCESS;
  634. }
  635. UA_TYPE_METHOD_NEW_DEFAULT(UA_LocalizedText)
  636. UA_Int32 UA_LocalizedText_copycstring(char const * src, UA_LocalizedText* dst) {
  637. UA_Int32 retval = UA_SUCCESS;
  638. if(dst==UA_NULL) return UA_ERROR;
  639. dst->encodingMask = UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE | UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT;
  640. retval |= UA_String_copycstring("EN",&(dst->locale));
  641. retval |= UA_String_copycstring(src,&(dst->text));
  642. return retval;
  643. }
  644. UA_Int32 UA_LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText* dst) {
  645. UA_Int32 retval = UA_SUCCESS;
  646. retval |= UA_alloc((void**)dst,UA_LocalizedText_calcSize(UA_NULL));
  647. retval |= UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  648. retval |= UA_String_copy(&(src->locale), &(dst->locale));
  649. retval |= UA_String_copy(&(src->text), &(dst->text));
  650. return retval;
  651. }
  652. /* Serialization of UA_NodeID is specified in 62541-6, §5.2.2.9 */
  653. UA_Int32 UA_NodeId_calcSize(UA_NodeId const *p) {
  654. UA_Int32 length = 0;
  655. if (p == UA_NULL) {
  656. length = sizeof(UA_NodeId);
  657. } else {
  658. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  659. case UA_NODEIDTYPE_TWOBYTE:
  660. length = 2;
  661. break;
  662. case UA_NODEIDTYPE_FOURBYTE:
  663. length = 4;
  664. break;
  665. case UA_NODEIDTYPE_NUMERIC:
  666. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + sizeof(UA_UInt32);
  667. break;
  668. case UA_NODEIDTYPE_STRING:
  669. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_String_calcSize(&(p->identifier.string));
  670. break;
  671. case UA_NODEIDTYPE_GUID:
  672. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_Guid_calcSize(&(p->identifier.guid));
  673. break;
  674. case UA_NODEIDTYPE_BYTESTRING:
  675. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_ByteString_calcSize(&(p->identifier.byteString));
  676. break;
  677. default:
  678. break;
  679. }
  680. }
  681. return length;
  682. }
  683. UA_TYPE_ENCODEBINARY(UA_NodeId,
  684. // temporary variables for endian-save code
  685. UA_Byte srcByte;
  686. UA_UInt16 srcUInt16;
  687. UA_Int32 retval = UA_SUCCESS;
  688. retval |= UA_Byte_encodeBinary(&(src->encodingByte),pos,dst);
  689. switch (src->encodingByte & UA_NODEIDTYPE_MASK) {
  690. case UA_NODEIDTYPE_TWOBYTE:
  691. srcByte = src->identifier.numeric;
  692. retval |= UA_Byte_encodeBinary(&srcByte,pos,dst);
  693. break;
  694. case UA_NODEIDTYPE_FOURBYTE:
  695. srcByte = src->namespace;
  696. srcUInt16 = src->identifier.numeric;
  697. retval |= UA_Byte_encodeBinary(&srcByte,pos,dst);
  698. retval |= UA_UInt16_encodeBinary(&srcUInt16,pos,dst);
  699. break;
  700. case UA_NODEIDTYPE_NUMERIC:
  701. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  702. retval |= UA_UInt32_encodeBinary(&(src->identifier.numeric), pos, dst);
  703. break;
  704. case UA_NODEIDTYPE_STRING:
  705. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  706. retval |= UA_String_encodeBinary(&(src->identifier.string), pos, dst);
  707. break;
  708. case UA_NODEIDTYPE_GUID:
  709. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  710. retval |= UA_Guid_encodeBinary(&(src->identifier.guid), pos, dst);
  711. break;
  712. case UA_NODEIDTYPE_BYTESTRING:
  713. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  714. retval |= UA_ByteString_encodeBinary(&(src->identifier.byteString), pos, dst);
  715. break;
  716. })
  717. UA_Int32 UA_NodeId_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_NodeId *dst) {
  718. UA_Int32 retval = UA_SUCCESS;
  719. UA_NodeId_init(dst);
  720. // temporary variables to overcome decoder's non-endian-saveness for datatypes with different length
  721. UA_Byte dstByte = 0;
  722. UA_UInt16 dstUInt16 = 0;
  723. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&(dst->encodingByte)), ;);
  724. switch (dst->encodingByte & UA_NODEIDTYPE_MASK) {
  725. case UA_NODEIDTYPE_TWOBYTE: // Table 7
  726. CHECKED_DECODE(UA_Byte_decodeBinary(src, pos, &dstByte), ;);
  727. dst->identifier.numeric = dstByte;
  728. dst->namespace = 0; // default namespace
  729. break;
  730. case UA_NODEIDTYPE_FOURBYTE: // Table 8
  731. CHECKED_DECODE(UA_Byte_decodeBinary(src, pos, &dstByte), ;);
  732. dst->namespace= dstByte;
  733. CHECKED_DECODE(UA_UInt16_decodeBinary(src, pos, &dstUInt16), ;);
  734. dst->identifier.numeric = dstUInt16;
  735. break;
  736. case UA_NODEIDTYPE_NUMERIC: // Table 6, first entry
  737. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespace)), ;);
  738. CHECKED_DECODE(UA_UInt32_decodeBinary(src,pos,&(dst->identifier.numeric)), ;);
  739. break;
  740. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  741. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespace)), ;);
  742. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&(dst->identifier.string)), ;);
  743. break;
  744. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  745. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespace)), ;);
  746. CHECKED_DECODE(UA_Guid_decodeBinary(src,pos,&(dst->identifier.guid)), ;);
  747. break;
  748. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  749. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespace)), ;);
  750. CHECKED_DECODE(UA_ByteString_decodeBinary(src,pos,&(dst->identifier.byteString)), ;);
  751. break;
  752. }
  753. return retval;
  754. }
  755. UA_Int16 UA_NodeId_getNamespace(UA_NodeId const * id) {
  756. return id->namespace;
  757. }
  758. // FIXME: to simple
  759. UA_Int16 UA_NodeId_getIdentifier(UA_NodeId const * id) {
  760. return id->identifier.numeric;
  761. }
  762. _Bool UA_NodeId_isBasicType(UA_NodeId const * id) {
  763. return (UA_NodeId_getNamespace(id) == 0) && (UA_NodeId_getIdentifier(id) <= UA_DIAGNOSTICINFO_NS0);
  764. }
  765. UA_TYPE_METHOD_DELETE_STRUCT(UA_NodeId)
  766. UA_Int32 UA_NodeId_deleteMembers(UA_NodeId* p) {
  767. UA_Int32 retval = UA_SUCCESS;
  768. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  769. case UA_NODEIDTYPE_TWOBYTE:
  770. case UA_NODEIDTYPE_FOURBYTE:
  771. case UA_NODEIDTYPE_NUMERIC:
  772. // nothing to do
  773. break;
  774. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  775. retval |= UA_String_deleteMembers(&p->identifier.string);
  776. break;
  777. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  778. retval |= UA_Guid_deleteMembers(&p->identifier.guid);
  779. break;
  780. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  781. retval |= UA_ByteString_deleteMembers(&p->identifier.byteString);
  782. break;
  783. }
  784. return retval;
  785. }
  786. void UA_NodeId_printf(char* label, const UA_NodeId* node) {
  787. UA_Int32 l;
  788. printf("%s {encodingByte=%d, namespace=%d,", label, (int)( node->encodingByte), (int) (node->namespace));
  789. switch (node->encodingByte & UA_NODEIDTYPE_MASK) {
  790. case UA_NODEIDTYPE_TWOBYTE:
  791. case UA_NODEIDTYPE_FOURBYTE:
  792. case UA_NODEIDTYPE_NUMERIC:
  793. printf("identifier=%d\n", node->identifier.numeric);
  794. break;
  795. case UA_NODEIDTYPE_STRING:
  796. l = ( node->identifier.string.length < 0 ) ? 0 : node->identifier.string.length;
  797. printf("identifier={length=%d, data=%.*s}",
  798. node->identifier.string.length, l,
  799. (char*) (node->identifier.string.data));
  800. break;
  801. case UA_NODEIDTYPE_BYTESTRING:
  802. l = ( node->identifier.byteString.length < 0 ) ? 0 : node->identifier.byteString.length;
  803. printf("identifier={Length=%d, data=%.*s}",
  804. node->identifier.byteString.length, l,
  805. (char*) (node->identifier.byteString.data));
  806. break;
  807. case UA_NODEIDTYPE_GUID:
  808. printf(
  809. "guid={data1=%d, data2=%d, data3=%d, data4={length=%d, data=%.*s}}",
  810. node->identifier.guid.data1, node->identifier.guid.data2,
  811. node->identifier.guid.data3, 8,
  812. 8,
  813. (char*) (node->identifier.guid.data4));
  814. break;
  815. default:
  816. printf("ups! shit happens");
  817. break;
  818. }
  819. printf("}\n");
  820. }
  821. UA_Int32 UA_NodeId_compare(const UA_NodeId *n1, const UA_NodeId *n2) {
  822. if (n1 == UA_NULL || n2 == UA_NULL || n1->encodingByte != n2->encodingByte || n1->namespace != n2->namespace)
  823. return UA_NOT_EQUAL;
  824. switch (n1->encodingByte & UA_NODEIDTYPE_MASK) {
  825. case UA_NODEIDTYPE_TWOBYTE:
  826. case UA_NODEIDTYPE_FOURBYTE:
  827. case UA_NODEIDTYPE_NUMERIC:
  828. if(n1->identifier.numeric == n2->identifier.numeric)
  829. return UA_EQUAL;
  830. else
  831. return UA_NOT_EQUAL;
  832. case UA_NODEIDTYPE_STRING:
  833. return UA_String_compare(&(n1->identifier.string), &(n2->identifier.string));
  834. case UA_NODEIDTYPE_GUID:
  835. return UA_Guid_compare(&(n1->identifier.guid), &(n2->identifier.guid));
  836. case UA_NODEIDTYPE_BYTESTRING:
  837. return UA_ByteString_compare(&(n1->identifier.byteString), &(n2->identifier.byteString));
  838. }
  839. return UA_NOT_EQUAL;
  840. }
  841. UA_Int32 UA_NodeId_init(UA_NodeId* p){
  842. if(p==UA_NULL)return UA_ERROR;
  843. p->encodingByte = UA_NODEIDTYPE_TWOBYTE;
  844. p->namespace = 0;
  845. memset(&(p->identifier),0,sizeof(p->identifier));
  846. return UA_SUCCESS;
  847. }
  848. UA_TYPE_METHOD_NEW_DEFAULT(UA_NodeId)
  849. UA_Int32 UA_NodeId_copy(UA_NodeId const *src, UA_NodeId *dst)
  850. {
  851. UA_Int32 retval = UA_SUCCESS;
  852. retval |= UA_Byte_copy(&(src->encodingByte), &(dst->encodingByte));
  853. switch (src->encodingByte & UA_NODEIDTYPE_MASK) {
  854. case UA_NODEIDTYPE_TWOBYTE:
  855. case UA_NODEIDTYPE_FOURBYTE:
  856. case UA_NODEIDTYPE_NUMERIC:
  857. // nothing to do
  858. retval |= UA_UInt16_copy(&(src->namespace),&(dst->namespace));
  859. retval |= UA_UInt32_copy(&(src->identifier.numeric),&(dst->identifier.numeric));
  860. break;
  861. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  862. retval |= UA_String_copy(&(src->identifier.string),&(dst->identifier.string));
  863. break;
  864. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  865. retval |= UA_Guid_copy(&(src->identifier.guid),&(dst->identifier.guid));
  866. break;
  867. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  868. retval |= UA_ByteString_copy(&(src->identifier.byteString),&(dst->identifier.byteString));
  869. break;
  870. }
  871. return retval;
  872. }
  873. UA_Boolean UA_NodeId_isNull(const UA_NodeId* p) {
  874. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  875. case UA_NODEIDTYPE_TWOBYTE:
  876. if(p->identifier.numeric != 0) return UA_FALSE;
  877. break;
  878. case UA_NODEIDTYPE_FOURBYTE:
  879. case UA_NODEIDTYPE_NUMERIC:
  880. if(p->namespace != 0 || p->identifier.numeric != 0) return UA_FALSE;
  881. break;
  882. case UA_NODEIDTYPE_STRING:
  883. if(p->namespace != 0 || p->identifier.string.length != 0) return UA_FALSE;
  884. break;
  885. case UA_NODEIDTYPE_GUID:
  886. if(p->namespace != 0 || memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]){0}, sizeof(UA_Guid)) != 0) return UA_FALSE;
  887. break;
  888. case UA_NODEIDTYPE_BYTESTRING:
  889. if(p->namespace != 0 || p->identifier.byteString.length != 0) return UA_FALSE;
  890. break;
  891. default:
  892. return UA_FALSE;
  893. }
  894. return UA_TRUE;
  895. }
  896. UA_Int32 UA_ExpandedNodeId_calcSize(UA_ExpandedNodeId const * p) {
  897. UA_Int32 length = 0;
  898. if (p == UA_NULL) {
  899. length = sizeof(UA_ExpandedNodeId);
  900. } else {
  901. length = UA_NodeId_calcSize(&p->nodeId);
  902. if (p->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  903. length += UA_String_calcSize(&p->namespaceUri); //p->namespaceUri
  904. }
  905. if (p->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  906. length += sizeof(UA_UInt32); //p->serverIndex
  907. }
  908. }
  909. return length;
  910. }
  911. UA_TYPE_ENCODEBINARY(UA_ExpandedNodeId,
  912. retval |= UA_NodeId_encodeBinary(&(src->nodeId),pos,dst);
  913. if (src->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  914. retval |= UA_String_encodeBinary(&(src->namespaceUri),pos,dst);
  915. }
  916. if (src->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  917. retval |= UA_UInt32_encodeBinary(&(src->serverIndex),pos,dst);
  918. })
  919. UA_Int32 UA_ExpandedNodeId_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_ExpandedNodeId *dst) {
  920. UA_UInt32 retval = UA_SUCCESS;
  921. UA_ExpandedNodeId_init(dst);
  922. CHECKED_DECODE(UA_NodeId_decodeBinary(src,pos,&dst->nodeId), UA_ExpandedNodeId_deleteMembers(dst));
  923. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  924. dst->nodeId.namespace = 0;
  925. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&dst->namespaceUri), UA_ExpandedNodeId_deleteMembers(dst));
  926. } else {
  927. CHECKED_DECODE(UA_String_copy(&UA_String_null, &dst->namespaceUri), UA_ExpandedNodeId_deleteMembers(dst));
  928. }
  929. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  930. CHECKED_DECODE(UA_UInt32_decodeBinary(src,pos,&(dst->serverIndex)), UA_ExpandedNodeId_deleteMembers(dst));
  931. }
  932. return retval;
  933. }
  934. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExpandedNodeId)
  935. UA_Int32 UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId* p) {
  936. UA_Int32 retval = UA_SUCCESS;
  937. retval |= UA_NodeId_deleteMembers(&(p->nodeId));
  938. retval |= UA_String_deleteMembers(&(p->namespaceUri));
  939. return retval;
  940. }
  941. UA_Int32 UA_ExpandedNodeId_init(UA_ExpandedNodeId* p){
  942. if(p==UA_NULL)return UA_ERROR;
  943. UA_NodeId_init(&(p->nodeId));
  944. UA_String_init(&(p->namespaceUri));
  945. p->serverIndex = 0;
  946. return UA_SUCCESS;
  947. }
  948. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExpandedNodeId)
  949. UA_Int32 UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  950. UA_Int32 retval = UA_SUCCESS;
  951. UA_String_copy(&(src->namespaceUri), &(dst->namespaceUri));
  952. UA_NodeId_copy(&(src->nodeId), &(dst->nodeId));
  953. UA_UInt32_copy(&(src->serverIndex), &(dst->serverIndex));
  954. return retval;
  955. }
  956. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId* p) {
  957. return UA_NodeId_isNull(&p->nodeId);
  958. }
  959. UA_Int32 UA_ExtensionObject_calcSize(UA_ExtensionObject const * p) {
  960. UA_Int32 length = 0;
  961. if (p == UA_NULL) {
  962. length = sizeof(UA_ExtensionObject);
  963. } else {
  964. length += UA_NodeId_calcSize(&(p->typeId));
  965. length += 1; //p->encoding
  966. switch (p->encoding) {
  967. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  968. length += UA_ByteString_calcSize(&(p->body));
  969. break;
  970. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  971. length += UA_XmlElement_calcSize((UA_XmlElement*)&(p->body));
  972. break;
  973. }
  974. }
  975. return length;
  976. }
  977. UA_TYPE_ENCODEBINARY(UA_ExtensionObject,
  978. retval |= UA_NodeId_encodeBinary(&(src->typeId),pos,dst);
  979. retval |= UA_Byte_encodeBinary(&(src->encoding),pos,dst);
  980. switch (src->encoding) {
  981. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  982. break;
  983. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  984. // FIXME: This code is valid for numeric nodeIds in ns0 only!
  985. retval |= UA_[UA_ns0ToVTableIndex(src->typeId.identifier.numeric)].encodeBinary(src->body.data,pos,dst);
  986. break;
  987. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  988. retval |= UA_ByteString_encodeBinary(&(src->body),pos,dst);
  989. break;
  990. })
  991. UA_Int32 UA_ExtensionObject_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_ExtensionObject *dst) {
  992. UA_Int32 retval = UA_SUCCESS;
  993. UA_ExtensionObject_init(dst);
  994. CHECKED_DECODE(UA_NodeId_decodeBinary(src,pos,&(dst->typeId)), UA_ExtensionObject_deleteMembers(dst));
  995. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&(dst->encoding)), UA_ExtensionObject_deleteMembers(dst));
  996. CHECKED_DECODE(UA_String_copy(&UA_String_null, (UA_String*) &(dst->body)), UA_ExtensionObject_deleteMembers(dst));
  997. switch (dst->encoding) {
  998. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  999. break;
  1000. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  1001. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  1002. CHECKED_DECODE(UA_ByteString_decodeBinary(src,pos,&(dst->body)), UA_ExtensionObject_deleteMembers(dst));
  1003. break;
  1004. }
  1005. return retval;
  1006. }
  1007. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExtensionObject)
  1008. UA_Int32 UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  1009. UA_Int32 retval = UA_SUCCESS;
  1010. retval |= UA_NodeId_deleteMembers(&(p->typeId));
  1011. retval |= UA_ByteString_deleteMembers(&(p->body));
  1012. return retval;
  1013. }
  1014. UA_Int32 UA_ExtensionObject_init(UA_ExtensionObject* p) {
  1015. if(p==UA_NULL)return UA_ERROR;
  1016. UA_ByteString_init(&(p->body));
  1017. p->encoding = 0;
  1018. UA_NodeId_init(&(p->typeId));
  1019. return UA_SUCCESS;
  1020. }
  1021. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExtensionObject)
  1022. UA_Int32 UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  1023. UA_Int32 retval = UA_SUCCESS;
  1024. retval |= UA_ExtensionObject_calcSize(UA_NULL);
  1025. retval |= UA_Byte_copy(&(src->encoding),&(dst->encoding));
  1026. retval |= UA_ByteString_copy(&(src->body),&(dst->body));
  1027. retval |= UA_NodeId_copy(&(src->typeId),&(dst->typeId));
  1028. return retval;
  1029. }
  1030. /** DiagnosticInfo - Part: 4, Chapter: 7.9, Page: 116 */
  1031. UA_Int32 UA_DiagnosticInfo_calcSize(UA_DiagnosticInfo const * ptr) {
  1032. UA_Int32 length = 0;
  1033. if (ptr == UA_NULL) {
  1034. length = sizeof(UA_DiagnosticInfo);
  1035. } else {
  1036. UA_Byte mask;
  1037. length += sizeof(UA_Byte); // EncodingMask
  1038. for (mask = 0x01; mask <= 0x40; mask *= 2) {
  1039. switch (mask & (ptr->encodingMask)) {
  1040. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1041. // puts("diagnosticInfo symbolic id");
  1042. length += sizeof(UA_Int32);
  1043. break;
  1044. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1045. length += sizeof(UA_Int32);
  1046. break;
  1047. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1048. length += sizeof(UA_Int32);
  1049. break;
  1050. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1051. length += sizeof(UA_Int32);
  1052. break;
  1053. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1054. length += UA_String_calcSize(&(ptr->additionalInfo));
  1055. break;
  1056. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1057. length += sizeof(UA_StatusCode);
  1058. break;
  1059. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1060. length += UA_DiagnosticInfo_calcSize(ptr->innerDiagnosticInfo);
  1061. break;
  1062. }
  1063. }
  1064. }
  1065. return length;
  1066. }
  1067. UA_Int32 UA_DiagnosticInfo_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_DiagnosticInfo *dst) {
  1068. UA_Int32 retval = UA_SUCCESS;
  1069. UA_DiagnosticInfo_init(dst);
  1070. CHECKED_DECODE(UA_Byte_decodeBinary(src, pos, &(dst->encodingMask)), ;);
  1071. for (UA_Int32 i = 0; i < 7; i++) {
  1072. switch ( (0x01 << i) & dst->encodingMask) {
  1073. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1074. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->symbolicId)), ;);
  1075. break;
  1076. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1077. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->namespaceUri)), ;);
  1078. break;
  1079. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1080. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->localizedText)), ;);
  1081. break;
  1082. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1083. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->locale)), ;);
  1084. break;
  1085. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1086. CHECKED_DECODE(UA_String_decodeBinary(src, pos, &(dst->additionalInfo)), ;);
  1087. break;
  1088. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1089. CHECKED_DECODE(UA_StatusCode_decodeBinary(src, pos, &(dst->innerStatusCode)), ;);
  1090. break;
  1091. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1092. // innerDiagnosticInfo is a pointer to struct, therefore allocate
  1093. CHECKED_DECODE(UA_alloc((void **) &(dst->innerDiagnosticInfo), UA_DiagnosticInfo_calcSize(UA_NULL)), ;);
  1094. CHECKED_DECODE(UA_DiagnosticInfo_decodeBinary(src, pos, dst->innerDiagnosticInfo), UA_DiagnosticInfo_deleteMembers(dst));
  1095. break;
  1096. }
  1097. }
  1098. return retval;
  1099. }
  1100. UA_TYPE_ENCODEBINARY(UA_DiagnosticInfo,
  1101. retval |= UA_Byte_encodeBinary(&(src->encodingMask), pos, dst);
  1102. for (UA_Int32 i = 0; i < 7; i++) {
  1103. switch ( (0x01 << i) & src->encodingMask) {
  1104. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1105. retval |= UA_Int32_encodeBinary(&(src->symbolicId), pos, dst);
  1106. break;
  1107. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1108. retval |= UA_Int32_encodeBinary( &(src->namespaceUri), pos, dst);
  1109. break;
  1110. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1111. retval |= UA_Int32_encodeBinary(&(src->localizedText), pos, dst);
  1112. break;
  1113. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1114. retval |= UA_Int32_encodeBinary(&(src->locale), pos, dst);
  1115. break;
  1116. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1117. retval |= UA_String_encodeBinary(&(src->additionalInfo), pos, dst);
  1118. break;
  1119. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1120. retval |= UA_StatusCode_encodeBinary(&(src->innerStatusCode), pos, dst);
  1121. break;
  1122. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1123. retval |= UA_DiagnosticInfo_encodeBinary(src->innerDiagnosticInfo, pos, dst);
  1124. break;
  1125. }
  1126. })
  1127. UA_TYPE_METHOD_DELETE_STRUCT(UA_DiagnosticInfo)
  1128. UA_Int32 UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  1129. UA_Int32 retval = UA_SUCCESS;
  1130. if ((p->encodingMask & UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO) && p->innerDiagnosticInfo != UA_NULL) {
  1131. retval |= UA_DiagnosticInfo_deleteMembers(p->innerDiagnosticInfo);
  1132. retval |= UA_free(p->innerDiagnosticInfo);
  1133. }
  1134. return retval;
  1135. }
  1136. UA_Int32 UA_DiagnosticInfo_init(UA_DiagnosticInfo* p){
  1137. if(p==UA_NULL)return UA_ERROR;
  1138. UA_String_init(&(p->additionalInfo));
  1139. p->encodingMask = 0;
  1140. p->innerDiagnosticInfo = UA_NULL;
  1141. UA_StatusCode_init(&(p->innerStatusCode));
  1142. p->locale = 0;
  1143. p->localizedText = 0;
  1144. p->namespaceUri = 0;
  1145. p->symbolicId = 0;
  1146. return UA_SUCCESS;
  1147. }
  1148. UA_TYPE_METHOD_NEW_DEFAULT(UA_DiagnosticInfo)
  1149. UA_Int32 UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst)
  1150. {
  1151. UA_Int32 retval = UA_SUCCESS;
  1152. retval |= UA_String_copy(&(src->additionalInfo), &(dst->additionalInfo));
  1153. retval |= UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1154. retval |= UA_StatusCode_copy(&(src->innerStatusCode), &(dst->innerStatusCode));
  1155. if(src->innerDiagnosticInfo){
  1156. retval |= UA_alloc((void**)&(dst->innerDiagnosticInfo),UA_DiagnosticInfo_calcSize(UA_NULL));
  1157. if(retval == UA_SUCCESS){
  1158. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  1159. }
  1160. }
  1161. else{
  1162. dst->innerDiagnosticInfo = UA_NULL;
  1163. }
  1164. retval |= UA_Int32_copy(&(src->locale), &(dst->locale));
  1165. retval |= UA_Int32_copy(&(src->localizedText), &(dst->localizedText));
  1166. retval |= UA_Int32_copy(&(src->namespaceUri), &(dst->namespaceUri));
  1167. retval |= UA_Int32_copy(&(src->symbolicId), &(dst->symbolicId));
  1168. return retval;
  1169. }
  1170. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DiagnosticInfo)
  1171. UA_TYPE_METHOD_PROTOTYPES_AS_WOXML(UA_DateTime,UA_Int64)
  1172. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DateTime)
  1173. UA_TYPE_METHOD_NEW_DEFAULT(UA_DateTime)
  1174. #include <sys/time.h>
  1175. // Number of seconds from 1 Jan. 1601 00:00 to 1 Jan 1970 00:00 UTC
  1176. #define FILETIME_UNIXTIME_BIAS_SEC 11644473600LL
  1177. // Factors
  1178. #define HUNDRED_NANOSEC_PER_USEC 10LL
  1179. #define HUNDRED_NANOSEC_PER_SEC (HUNDRED_NANOSEC_PER_USEC * 1000000LL)
  1180. // IEC 62541-6 §5.2.2.5 A DateTime value shall be encoded as a 64-bit signed integer
  1181. // which represents the number of 100 nanosecond intervals since January 1, 1601 (UTC).
  1182. UA_DateTime UA_DateTime_now() {
  1183. UA_DateTime dateTime;
  1184. struct timeval tv;
  1185. gettimeofday(&tv, UA_NULL);
  1186. dateTime = (tv.tv_sec + FILETIME_UNIXTIME_BIAS_SEC)
  1187. * HUNDRED_NANOSEC_PER_SEC + tv.tv_usec * HUNDRED_NANOSEC_PER_USEC;
  1188. return dateTime;
  1189. }
  1190. //toDo
  1191. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime time){
  1192. UA_DateTimeStruct dateTimeStruct;
  1193. //calcualting the the milli-, micro- and nanoseconds
  1194. UA_DateTime timeTemp;
  1195. timeTemp = (time-((time/10)*10))*100; //getting the last digit -> *100 for the 100 nanaseconds resolution
  1196. dateTimeStruct.nanoSec = timeTemp; //123 456 7 -> 700 nanosec;
  1197. timeTemp = (time-((time/10000)*10000))/10;
  1198. dateTimeStruct.microSec = timeTemp; //123 456 7 -> 456 microsec
  1199. timeTemp = (time-((time/10000000)*10000000))/10000;
  1200. dateTimeStruct.milliSec = timeTemp; //123 456 7 -> 123 millisec
  1201. //calculating the unix time with #include <time.h>
  1202. time_t timeInSec = time/10000000; //converting the nanoseconds time in unixtime
  1203. struct tm ts;
  1204. ts = *gmtime(&timeInSec);
  1205. //strftime(buf, sizeof(buf), "%a %Y-%m-%d %H:%M:%S %Z", &ts);
  1206. //printf("%s\n", buf);
  1207. dateTimeStruct.sec = ts.tm_sec;
  1208. dateTimeStruct.min = ts.tm_min;
  1209. dateTimeStruct.hour = ts.tm_hour;
  1210. dateTimeStruct.day = ts.tm_mday;
  1211. dateTimeStruct.mounth = ts.tm_mon+1;
  1212. dateTimeStruct.year = ts.tm_year + 1900;
  1213. return dateTimeStruct;
  1214. }
  1215. UA_Int32 UA_DateTime_toString(UA_DateTime time, UA_String* timeString){
  1216. char *charBuf = (char*)(*timeString).data;
  1217. UA_DateTimeStruct tSt = UA_DateTime_toStruct(time);
  1218. sprintf(charBuf, "%2d/%2d/%4d %2d:%2d:%2d.%3d.%3d.%3d", tSt.mounth, tSt.day, tSt.year,
  1219. tSt.hour, tSt.min, tSt.sec, tSt.milliSec, tSt.microSec, tSt.nanoSec);
  1220. return UA_SUCCESS;
  1221. }
  1222. /* UA_XmlElement */
  1223. UA_TYPE_METHOD_PROTOTYPES_AS(UA_XmlElement, UA_ByteString)
  1224. UA_TYPE_METHOD_NEW_DEFAULT(UA_XmlElement)
  1225. /** IntegerId - Part: 4, Chapter: 7.13, Page: 118 */
  1226. UA_TYPE_METHOD_PROTOTYPES_AS(UA_IntegerId, UA_Int32)
  1227. UA_TYPE_METHOD_NEW_DEFAULT(UA_IntegerId)
  1228. UA_TYPE_METHOD_PROTOTYPES_AS_WOXML(UA_StatusCode, UA_UInt32)
  1229. UA_TYPE_METHOD_NEW_DEFAULT(UA_StatusCode)
  1230. UA_Int32 UA_StatusCode_decodeXML(XML_Stack* s, XML_Attr* attr, UA_StatusCode* dst, _Bool isStart) {
  1231. DBG_VERBOSE(printf("UA_StatusCode_decodeXML entered with dst=%p,isStart=%d\n", (void* ) dst, isStart));
  1232. return UA_ERR_NOT_IMPLEMENTED;
  1233. }
  1234. /** QualifiedName - Part 4, Chapter
  1235. * but see Part 6, Chapter 5.2.2.13 for Binary Encoding
  1236. */
  1237. UA_Int32 UA_QualifiedName_calcSize(UA_QualifiedName const * p) {
  1238. UA_Int32 length = 0;
  1239. if (p == UA_NULL) return sizeof(UA_QualifiedName);
  1240. length += sizeof(UA_UInt16); //qualifiedName->namespaceIndex
  1241. // length += sizeof(UA_UInt16); //qualifiedName->reserved
  1242. length += UA_String_calcSize(&(p->name)); //qualifiedName->name
  1243. return length;
  1244. }
  1245. UA_Int32 UA_QualifiedName_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_QualifiedName *dst) {
  1246. UA_Int32 retval = UA_SUCCESS;
  1247. UA_QualifiedName_init(dst);
  1248. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespaceIndex)), ;);
  1249. //retval |= UA_UInt16_decodeBinary(src,pos,&(dst->reserved));
  1250. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&(dst->name)), ;);
  1251. return retval;
  1252. }
  1253. UA_TYPE_ENCODEBINARY(UA_QualifiedName,
  1254. retval |= UA_UInt16_encodeBinary(&(src->namespaceIndex),pos,dst);
  1255. //retval |= UA_UInt16_encodeBinary(&(src->reserved),pos,dst);
  1256. retval |= UA_String_encodeBinary(&(src->name),pos,dst);)
  1257. UA_Int32 UA_QualifiedName_delete(UA_QualifiedName * p) {
  1258. UA_Int32 retval = UA_SUCCESS;
  1259. retval |= UA_QualifiedName_deleteMembers(p);
  1260. retval |= UA_free(p);
  1261. return retval;
  1262. }
  1263. UA_Int32 UA_QualifiedName_deleteMembers(UA_QualifiedName * p) {
  1264. UA_Int32 retval = UA_SUCCESS;
  1265. retval |= UA_String_deleteMembers(&p->name);
  1266. return retval;
  1267. }
  1268. UA_Int32 UA_QualifiedName_init(UA_QualifiedName * p) {
  1269. if(p==UA_NULL)return UA_ERROR;
  1270. UA_String_init(&(p->name));
  1271. p->namespaceIndex=0;
  1272. return UA_SUCCESS;
  1273. }
  1274. UA_TYPE_METHOD_NEW_DEFAULT(UA_QualifiedName)
  1275. UA_Int32 UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  1276. UA_Int32 retval = UA_SUCCESS;
  1277. retval |= UA_alloc((void**)&dst,UA_QualifiedName_calcSize(UA_NULL));
  1278. retval |= UA_String_copy(&(src->name),&(dst->name));
  1279. retval |= UA_UInt16_copy(&(src->namespaceIndex),&(dst->namespaceIndex));
  1280. return retval;
  1281. }
  1282. UA_Int32 UA_Variant_calcSize(UA_Variant const * p) {
  1283. UA_Int32 length = 0;
  1284. if (p == UA_NULL) return sizeof(UA_Variant);
  1285. UA_UInt32 builtinNs0Id = p->encodingMask & 0x3F; // Bits 0-5
  1286. UA_Boolean isArray = p->encodingMask & (0x01 << 7); // Bit 7
  1287. UA_Boolean hasDimensions = p->encodingMask & (0x01 << 6); // Bit 6
  1288. if (p->vt == UA_NULL || builtinNs0Id != p->vt->ns0Id) return UA_ERR_INCONSISTENT;
  1289. length += sizeof(UA_Byte); //p->encodingMask
  1290. if (isArray) { // array length is encoded
  1291. length += sizeof(UA_Int32); //p->arrayLength
  1292. if (p->arrayLength > 0) {
  1293. // TODO: add suggestions of @jfpr to not iterate over arrays with fixed len elements
  1294. // FIXME: the concept of calcSize delivering the storageSize given an UA_Null argument
  1295. // fails for arrays with null-ptrs, see test case
  1296. // UA_Variant_calcSizeVariableSizeArrayWithNullPtrWillReturnWrongEncodingSize
  1297. // Simply do not allow?
  1298. for (UA_Int32 i=0;i<p->arrayLength;i++) {
  1299. length += p->vt->calcSize(p->data[i]);
  1300. }
  1301. }
  1302. } else { //single value to encode
  1303. if (p->data == UA_NULL) {
  1304. if (p->vt->ns0Id != UA_INVALIDTYPE_NS0) {
  1305. length += p->vt->calcSize(UA_NULL);
  1306. } else {
  1307. length += 0;
  1308. }
  1309. } else {
  1310. length += p->vt->calcSize(p->data[0]);
  1311. }
  1312. }
  1313. if (hasDimensions) {
  1314. //ToDo: tobeInsert: length += the calcSize for dimensions
  1315. }
  1316. return length;
  1317. }
  1318. UA_TYPE_ENCODEBINARY(UA_Variant,
  1319. if (src->vt == UA_NULL || ( src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) != src->vt->ns0Id) return UA_ERR_INCONSISTENT;
  1320. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1321. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // encode array length
  1322. retval |= UA_Int32_encodeBinary(&(src->arrayLength),pos,dst);
  1323. }
  1324. if (src->arrayLength > 0) {
  1325. //encode array as given by variant type
  1326. for (UA_Int32 i=0;i<src->arrayLength;i++) {
  1327. retval |= src->vt->encodeBinary(src->data[i],pos,dst);
  1328. }
  1329. } else {
  1330. if (src->data == UA_NULL) {
  1331. if (src->vt->ns0Id == UA_INVALIDTYPE_NS0) {
  1332. retval = UA_SUCCESS;
  1333. } else {
  1334. retval = UA_ERR_NO_MEMORY;
  1335. }
  1336. } else {
  1337. retval |= src->vt->encodeBinary(src->data[0],pos,dst);
  1338. }
  1339. }
  1340. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1341. //encode dimension field
  1342. UA_Int32_encodeBinary(&(src->arrayDimensionsLength), pos, dst);
  1343. if(src->arrayDimensionsLength >0){
  1344. for (UA_Int32 i=0;i<src->arrayDimensionsLength;i++) {
  1345. retval |= UA_Int32_encodeBinary(src->arrayDimensions[i], pos, dst);
  1346. }
  1347. }
  1348. })
  1349. UA_Int32 UA_Variant_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_Variant *dst) {
  1350. UA_Int32 retval = UA_SUCCESS;
  1351. UA_Variant_init(dst);
  1352. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&(dst->encodingMask)), ;);
  1353. UA_Int32 ns0Id = dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1354. // initialize vTable
  1355. UA_Int32 uaIdx = UA_ns0ToVTableIndex(ns0Id);
  1356. if(UA_VTable_isValidType(uaIdx) != UA_SUCCESS)
  1357. return UA_ERROR;
  1358. dst->vt = &UA_[uaIdx];
  1359. // get size of array
  1360. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // get array length
  1361. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &dst->arrayLength), ;);
  1362. } else {
  1363. dst->arrayLength = 1;
  1364. }
  1365. if (ns0Id == UA_INVALIDTYPE_NS0) { // handle NULL-Variant !
  1366. dst->data = UA_NULL;
  1367. dst->arrayLength = -1;
  1368. } else {
  1369. // allocate array and decode
  1370. CHECKED_DECODE(UA_Array_new(&dst->data, dst->arrayLength, uaIdx), dst->data = UA_NULL);
  1371. CHECKED_DECODE(UA_Array_decodeBinary(src, dst->arrayLength, uaIdx, pos, &dst->data), UA_Variant_deleteMembers(dst));
  1372. }
  1373. //decode the dimension field array if present
  1374. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1375. UA_Int32_decodeBinary(src, pos, &dst->arrayDimensionsLength);
  1376. CHECKED_DECODE(UA_Array_new((void***)&dst->arrayDimensions, dst->arrayDimensionsLength, UA_INT32), dst->arrayDimensions = UA_NULL);
  1377. CHECKED_DECODE(UA_Array_decodeBinary(src, dst->arrayLength, uaIdx, pos, &dst->data), UA_Variant_deleteMembers(dst));
  1378. }
  1379. return retval;
  1380. }
  1381. UA_TYPE_METHOD_DELETE_STRUCT(UA_Variant)
  1382. UA_Int32 UA_Variant_deleteMembers(UA_Variant * p) {
  1383. UA_Int32 retval = UA_SUCCESS;
  1384. if(p->data != UA_NULL) {
  1385. retval |= UA_Array_delete(&p->data,p->arrayLength,UA_ns0ToVTableIndex(p->vt->ns0Id));
  1386. retval |= UA_Array_delete(&p->data,p->arrayDimensionsLength,UA_INT32_NS0);
  1387. }
  1388. return retval;
  1389. }
  1390. UA_Int32 UA_Variant_init(UA_Variant * p) {
  1391. if(p==UA_NULL)return UA_ERROR;
  1392. p->arrayLength = -1; // no element, p->data == UA_NULL
  1393. p->data = UA_NULL;
  1394. p->encodingMask = 0;
  1395. p->arrayDimensions = 0;
  1396. p->arrayDimensionsLength = 0;
  1397. p->vt = &UA_[UA_INVALIDTYPE];
  1398. return UA_SUCCESS;
  1399. }
  1400. UA_TYPE_METHOD_NEW_DEFAULT(UA_Variant)
  1401. UA_Int32 UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  1402. UA_Int32 retval = UA_SUCCESS;
  1403. UA_Int32 ns0Id = src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1404. UA_Int32 uaIdx = UA_ns0ToVTableIndex(ns0Id);
  1405. void * pData;
  1406. if(UA_VTable_isValidType(uaIdx) != UA_SUCCESS) return UA_ERROR;
  1407. dst->vt = &UA_[uaIdx];
  1408. retval |= UA_Int32_copy(&(src->arrayLength), &(dst->arrayLength));
  1409. retval |= UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1410. retval |= UA_Int32_copy(&(src->arrayDimensionsLength), &(dst->arrayDimensionsLength));
  1411. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) {
  1412. retval |= UA_Array_copy((const void * const *)(src->data),src->arrayLength, uaIdx,(void***)&(dst->data));
  1413. }
  1414. else {
  1415. UA_alloc((void**)&pData,UA_[uaIdx].calcSize(UA_NULL));
  1416. dst->data = &pData;
  1417. UA_[uaIdx].copy(src->data[0], dst->data[0]);
  1418. }
  1419. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1420. retval |= UA_Array_copy((const void * const *)(src->arrayDimensions),src->arrayDimensionsLength, UA_ns0ToVTableIndex(UA_INT32_NS0),(void***)&(dst->arrayDimensions));
  1421. }
  1422. return retval;
  1423. }
  1424. UA_Int32 UA_Variant_borrowSetValue(UA_Variant *v, UA_Int32 type_id, const void* value) {
  1425. v->encodingMask = type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1426. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1427. v->vt = &UA_noDelete_[type_id];
  1428. v->data = (void*) value;
  1429. return UA_SUCCESS;
  1430. }
  1431. UA_Int32 UA_Variant_copySetValue(UA_Variant *v, UA_Int32 type_id, const void* value) {
  1432. v->encodingMask = type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1433. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1434. v->vt = &UA_[type_id];
  1435. return v->vt->copy(value, v->data);
  1436. }
  1437. UA_Int32 UA_Variant_borrowSetArray(UA_Variant *v, UA_Int32 type_id, UA_Int32 arrayLength, const void* array) {
  1438. v->encodingMask = (type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) | UA_VARIANT_ENCODINGMASKTYPE_ARRAY;
  1439. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1440. v->vt = &UA_noDelete_[type_id];
  1441. v->arrayLength = arrayLength;
  1442. v->data = (void*) array;
  1443. return UA_SUCCESS;
  1444. }
  1445. UA_Int32 UA_Variant_copySetArray(UA_Variant *v, UA_Int32 type_id, UA_Int32 arrayLength, UA_UInt32 elementSize, const void* array) {
  1446. v->encodingMask = (type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) | UA_VARIANT_ENCODINGMASKTYPE_ARRAY;
  1447. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1448. v->vt = &UA_[type_id];
  1449. v->arrayLength = arrayLength;
  1450. void *new_arr;
  1451. UA_Int32 retval = UA_SUCCESS;
  1452. retval |= UA_alloc(&new_arr, arrayLength * elementSize);
  1453. retval |= UA_memcpy(new_arr, array, arrayLength * elementSize);
  1454. v->data = new_arr;
  1455. return UA_SUCCESS;
  1456. }
  1457. //TODO: place this define at the server configuration
  1458. #define MAX_PICO_SECONDS 1000
  1459. UA_Int32 UA_DataValue_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_DataValue* dst) {
  1460. UA_Int32 retval = UA_SUCCESS;
  1461. UA_DataValue_init(dst);
  1462. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingMask));
  1463. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1464. CHECKED_DECODE(UA_Variant_decodeBinary(src,pos,&(dst->value)), UA_DataValue_deleteMembers(dst));
  1465. }
  1466. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1467. CHECKED_DECODE(UA_StatusCode_decodeBinary(src,pos,&(dst->status)), UA_DataValue_deleteMembers(dst));
  1468. }
  1469. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1470. CHECKED_DECODE(UA_DateTime_decodeBinary(src,pos,&(dst->sourceTimestamp)), UA_DataValue_deleteMembers(dst));
  1471. }
  1472. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1473. CHECKED_DECODE(UA_Int16_decodeBinary(src,pos,&(dst->sourcePicoseconds)), UA_DataValue_deleteMembers(dst));
  1474. if (dst->sourcePicoseconds > MAX_PICO_SECONDS) {
  1475. dst->sourcePicoseconds = MAX_PICO_SECONDS;
  1476. }
  1477. }
  1478. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1479. CHECKED_DECODE(UA_DateTime_decodeBinary(src,pos,&(dst->serverTimestamp)), UA_DataValue_deleteMembers(dst));
  1480. }
  1481. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1482. CHECKED_DECODE(UA_Int16_decodeBinary(src,pos,&(dst->serverPicoseconds)), UA_DataValue_deleteMembers(dst));
  1483. if (dst->serverPicoseconds > MAX_PICO_SECONDS) {
  1484. dst->serverPicoseconds = MAX_PICO_SECONDS;
  1485. }
  1486. }
  1487. return retval;
  1488. }
  1489. UA_TYPE_ENCODEBINARY(UA_DataValue,
  1490. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1491. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1492. retval |= UA_Variant_encodeBinary(&(src->value),pos,dst);
  1493. }
  1494. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1495. retval |= UA_StatusCode_encodeBinary(&(src->status),pos,dst);
  1496. }
  1497. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1498. retval |= UA_DateTime_encodeBinary(&(src->sourceTimestamp),pos,dst);
  1499. }
  1500. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1501. retval |= UA_Int16_encodeBinary(&(src->sourcePicoseconds),pos,dst);
  1502. }
  1503. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1504. retval |= UA_DateTime_encodeBinary(&(src->serverTimestamp),pos,dst);
  1505. }
  1506. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1507. retval |= UA_Int16_encodeBinary(&(src->serverPicoseconds),pos,dst);
  1508. })
  1509. UA_Int32 UA_DataValue_calcSize(UA_DataValue const * p) {
  1510. UA_Int32 length = 0;
  1511. if (p == UA_NULL) { // get static storage size
  1512. length = sizeof(UA_DataValue);
  1513. } else { // get decoding size
  1514. length = sizeof(UA_Byte);
  1515. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1516. // FIXME: this one can return with an error value instead of a size
  1517. length += UA_Variant_calcSize(&(p->value));
  1518. }
  1519. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1520. length += sizeof(UA_UInt32); //dataValue->status
  1521. }
  1522. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1523. length += sizeof(UA_DateTime); //dataValue->sourceTimestamp
  1524. }
  1525. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1526. length += sizeof(UA_Int64); //dataValue->sourcePicoseconds
  1527. }
  1528. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1529. length += sizeof(UA_DateTime); //dataValue->serverTimestamp
  1530. }
  1531. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1532. length += sizeof(UA_Int64); //dataValue->serverPicoseconds
  1533. }
  1534. }
  1535. return length;
  1536. }
  1537. UA_TYPE_METHOD_DELETE_STRUCT(UA_DataValue)
  1538. UA_Int32 UA_DataValue_deleteMembers(UA_DataValue * p) {
  1539. UA_Int32 retval = UA_SUCCESS;
  1540. UA_Variant_deleteMembers(&p->value);
  1541. return retval;
  1542. }
  1543. UA_Int32 UA_DataValue_init(UA_DataValue * p){
  1544. if(p==UA_NULL)return UA_ERROR;
  1545. p->encodingMask = 0;
  1546. p->serverPicoseconds = 0;
  1547. UA_DateTime_init(&(p->serverTimestamp));
  1548. p->sourcePicoseconds = 0;
  1549. UA_DateTime_init(&(p->sourceTimestamp));
  1550. UA_StatusCode_init(&(p->status));
  1551. UA_Variant_init(&(p->value));
  1552. return UA_SUCCESS;
  1553. }
  1554. UA_TYPE_METHOD_NEW_DEFAULT(UA_DataValue)
  1555. UA_Int32 UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst){
  1556. UA_Int32 retval = UA_SUCCESS;
  1557. //TODO can be optimized by direct UA_memcpy call
  1558. UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1559. UA_Int16_copy(&(src->serverPicoseconds),&(dst->serverPicoseconds));
  1560. UA_DateTime_copy(&(src->serverTimestamp),&(dst->serverTimestamp));
  1561. UA_Int16_copy(&(src->sourcePicoseconds), &(dst->sourcePicoseconds));
  1562. UA_DateTime_copy(&(src->sourceTimestamp),&(dst->sourceTimestamp));
  1563. UA_StatusCode_copy(&(src->status),&(dst->status));
  1564. UA_Variant_copy(&(src->value),&(dst->value));
  1565. return retval;
  1566. }
  1567. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DataValue)
  1568. /* UA_InvalidType - internal type necessary to handle inited Variants correctly */
  1569. UA_Int32 UA_InvalidType_calcSize(UA_InvalidType const * p) { return 0; }
  1570. UA_TYPE_ENCODEBINARY(UA_InvalidType, retval = UA_ERR_INVALID_VALUE;)
  1571. UA_TYPE_DECODEBINARY(UA_InvalidType, retval = UA_ERR_INVALID_VALUE;)
  1572. UA_Int32 UA_InvalidType_free(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1573. UA_Int32 UA_InvalidType_delete(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1574. UA_Int32 UA_InvalidType_deleteMembers(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1575. UA_Int32 UA_InvalidType_init(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1576. UA_Int32 UA_InvalidType_copy(UA_InvalidType const* src, UA_InvalidType *dst) { return UA_ERR_INVALID_VALUE; }
  1577. UA_Int32 UA_InvalidType_new(UA_InvalidType** p) { return UA_ERR_INVALID_VALUE; }
  1578. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_InvalidType)