ua_basictypes.c 62 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681
  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_TYPE_METHOD_DELETE_STRUCT(UA_NodeId)
  756. UA_Int32 UA_NodeId_deleteMembers(UA_NodeId* p) {
  757. UA_Int32 retval = UA_SUCCESS;
  758. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  759. case UA_NODEIDTYPE_TWOBYTE:
  760. case UA_NODEIDTYPE_FOURBYTE:
  761. case UA_NODEIDTYPE_NUMERIC:
  762. // nothing to do
  763. break;
  764. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  765. retval |= UA_String_deleteMembers(&p->identifier.string);
  766. break;
  767. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  768. retval |= UA_Guid_deleteMembers(&p->identifier.guid);
  769. break;
  770. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  771. retval |= UA_ByteString_deleteMembers(&p->identifier.byteString);
  772. break;
  773. }
  774. return retval;
  775. }
  776. void UA_NodeId_printf(char* label, const UA_NodeId* node) {
  777. UA_Int32 l;
  778. printf("%s {encodingByte=%d, namespace=%d,", label, (int)( node->encodingByte), (int) (node->namespace));
  779. switch (node->encodingByte & UA_NODEIDTYPE_MASK) {
  780. case UA_NODEIDTYPE_TWOBYTE:
  781. case UA_NODEIDTYPE_FOURBYTE:
  782. case UA_NODEIDTYPE_NUMERIC:
  783. printf("identifier=%d\n", node->identifier.numeric);
  784. break;
  785. case UA_NODEIDTYPE_STRING:
  786. l = ( node->identifier.string.length < 0 ) ? 0 : node->identifier.string.length;
  787. printf("identifier={length=%d, data=%.*s}",
  788. node->identifier.string.length, l,
  789. (char*) (node->identifier.string.data));
  790. break;
  791. case UA_NODEIDTYPE_BYTESTRING:
  792. l = ( node->identifier.byteString.length < 0 ) ? 0 : node->identifier.byteString.length;
  793. printf("identifier={Length=%d, data=%.*s}",
  794. node->identifier.byteString.length, l,
  795. (char*) (node->identifier.byteString.data));
  796. break;
  797. case UA_NODEIDTYPE_GUID:
  798. printf(
  799. "guid={data1=%d, data2=%d, data3=%d, data4={length=%d, data=%.*s}}",
  800. node->identifier.guid.data1, node->identifier.guid.data2,
  801. node->identifier.guid.data3, 8,
  802. 8,
  803. (char*) (node->identifier.guid.data4));
  804. break;
  805. default:
  806. printf("ups! shit happens");
  807. break;
  808. }
  809. printf("}\n");
  810. }
  811. UA_Int32 UA_NodeId_compare(const UA_NodeId *n1, const UA_NodeId *n2) {
  812. if (n1 == UA_NULL || n2 == UA_NULL || n1->encodingByte != n2->encodingByte || n1->namespace != n2->namespace)
  813. return UA_NOT_EQUAL;
  814. switch (n1->encodingByte & UA_NODEIDTYPE_MASK) {
  815. case UA_NODEIDTYPE_TWOBYTE:
  816. case UA_NODEIDTYPE_FOURBYTE:
  817. case UA_NODEIDTYPE_NUMERIC:
  818. if(n1->identifier.numeric == n2->identifier.numeric)
  819. return UA_EQUAL;
  820. else
  821. return UA_NOT_EQUAL;
  822. case UA_NODEIDTYPE_STRING:
  823. return UA_String_compare(&(n1->identifier.string), &(n2->identifier.string));
  824. case UA_NODEIDTYPE_GUID:
  825. return UA_Guid_compare(&(n1->identifier.guid), &(n2->identifier.guid));
  826. case UA_NODEIDTYPE_BYTESTRING:
  827. return UA_ByteString_compare(&(n1->identifier.byteString), &(n2->identifier.byteString));
  828. }
  829. return UA_NOT_EQUAL;
  830. }
  831. UA_Int32 UA_NodeId_init(UA_NodeId* p){
  832. if(p==UA_NULL)return UA_ERROR;
  833. p->encodingByte = UA_NODEIDTYPE_TWOBYTE;
  834. p->namespace = 0;
  835. memset(&(p->identifier),0,sizeof(p->identifier));
  836. return UA_SUCCESS;
  837. }
  838. UA_TYPE_METHOD_NEW_DEFAULT(UA_NodeId)
  839. UA_Int32 UA_NodeId_copy(UA_NodeId const *src, UA_NodeId *dst)
  840. {
  841. UA_Int32 retval = UA_SUCCESS;
  842. retval |= UA_Byte_copy(&(src->encodingByte), &(dst->encodingByte));
  843. switch (src->encodingByte & UA_NODEIDTYPE_MASK) {
  844. case UA_NODEIDTYPE_TWOBYTE:
  845. case UA_NODEIDTYPE_FOURBYTE:
  846. case UA_NODEIDTYPE_NUMERIC:
  847. // nothing to do
  848. retval |= UA_UInt16_copy(&(src->namespace),&(dst->namespace));
  849. retval |= UA_UInt32_copy(&(src->identifier.numeric),&(dst->identifier.numeric));
  850. break;
  851. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  852. retval |= UA_String_copy(&(src->identifier.string),&(dst->identifier.string));
  853. break;
  854. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  855. retval |= UA_Guid_copy(&(src->identifier.guid),&(dst->identifier.guid));
  856. break;
  857. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  858. retval |= UA_ByteString_copy(&(src->identifier.byteString),&(dst->identifier.byteString));
  859. break;
  860. }
  861. return retval;
  862. }
  863. UA_Boolean UA_NodeId_isNull(const UA_NodeId* p) {
  864. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  865. case UA_NODEIDTYPE_TWOBYTE:
  866. if(p->identifier.numeric != 0) return UA_FALSE;
  867. break;
  868. case UA_NODEIDTYPE_FOURBYTE:
  869. case UA_NODEIDTYPE_NUMERIC:
  870. if(p->namespace != 0 || p->identifier.numeric != 0) return UA_FALSE;
  871. break;
  872. case UA_NODEIDTYPE_STRING:
  873. if(p->namespace != 0 || p->identifier.string.length != 0) return UA_FALSE;
  874. break;
  875. case UA_NODEIDTYPE_GUID:
  876. if(p->namespace != 0 || memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]){0}, sizeof(UA_Guid)) != 0) return UA_FALSE;
  877. break;
  878. case UA_NODEIDTYPE_BYTESTRING:
  879. if(p->namespace != 0 || p->identifier.byteString.length != 0) return UA_FALSE;
  880. break;
  881. default:
  882. return UA_FALSE;
  883. }
  884. return UA_TRUE;
  885. }
  886. UA_Int32 UA_ExpandedNodeId_calcSize(UA_ExpandedNodeId const * p) {
  887. UA_Int32 length = 0;
  888. if (p == UA_NULL) {
  889. length = sizeof(UA_ExpandedNodeId);
  890. } else {
  891. length = UA_NodeId_calcSize(&p->nodeId);
  892. if (p->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  893. length += UA_String_calcSize(&p->namespaceUri); //p->namespaceUri
  894. }
  895. if (p->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  896. length += sizeof(UA_UInt32); //p->serverIndex
  897. }
  898. }
  899. return length;
  900. }
  901. UA_TYPE_ENCODEBINARY(UA_ExpandedNodeId,
  902. retval |= UA_NodeId_encodeBinary(&(src->nodeId),pos,dst);
  903. if (src->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  904. retval |= UA_String_encodeBinary(&(src->namespaceUri),pos,dst);
  905. }
  906. if (src->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  907. retval |= UA_UInt32_encodeBinary(&(src->serverIndex),pos,dst);
  908. })
  909. UA_Int32 UA_ExpandedNodeId_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_ExpandedNodeId *dst) {
  910. UA_UInt32 retval = UA_SUCCESS;
  911. UA_ExpandedNodeId_init(dst);
  912. CHECKED_DECODE(UA_NodeId_decodeBinary(src,pos,&dst->nodeId), UA_ExpandedNodeId_deleteMembers(dst));
  913. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  914. dst->nodeId.namespace = 0;
  915. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&dst->namespaceUri), UA_ExpandedNodeId_deleteMembers(dst));
  916. } else {
  917. CHECKED_DECODE(UA_String_copy(&UA_String_null, &dst->namespaceUri), UA_ExpandedNodeId_deleteMembers(dst));
  918. }
  919. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  920. CHECKED_DECODE(UA_UInt32_decodeBinary(src,pos,&(dst->serverIndex)), UA_ExpandedNodeId_deleteMembers(dst));
  921. }
  922. return retval;
  923. }
  924. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExpandedNodeId)
  925. UA_Int32 UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId* p) {
  926. UA_Int32 retval = UA_SUCCESS;
  927. retval |= UA_NodeId_deleteMembers(&(p->nodeId));
  928. retval |= UA_String_deleteMembers(&(p->namespaceUri));
  929. return retval;
  930. }
  931. UA_Int32 UA_ExpandedNodeId_init(UA_ExpandedNodeId* p){
  932. if(p==UA_NULL)return UA_ERROR;
  933. UA_NodeId_init(&(p->nodeId));
  934. UA_String_init(&(p->namespaceUri));
  935. p->serverIndex = 0;
  936. return UA_SUCCESS;
  937. }
  938. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExpandedNodeId)
  939. UA_Int32 UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  940. UA_Int32 retval = UA_SUCCESS;
  941. UA_String_copy(&(src->namespaceUri), &(dst->namespaceUri));
  942. UA_NodeId_copy(&(src->nodeId), &(dst->nodeId));
  943. UA_UInt32_copy(&(src->serverIndex), &(dst->serverIndex));
  944. return retval;
  945. }
  946. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId* p) {
  947. return UA_NodeId_isNull(&p->nodeId);
  948. }
  949. UA_Int32 UA_ExtensionObject_calcSize(UA_ExtensionObject const * p) {
  950. UA_Int32 length = 0;
  951. if (p == UA_NULL) {
  952. length = sizeof(UA_ExtensionObject);
  953. } else {
  954. length += UA_NodeId_calcSize(&(p->typeId));
  955. length += 1; //p->encoding
  956. switch (p->encoding) {
  957. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  958. length += UA_ByteString_calcSize(&(p->body));
  959. break;
  960. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  961. length += UA_XmlElement_calcSize((UA_XmlElement*)&(p->body));
  962. break;
  963. }
  964. }
  965. return length;
  966. }
  967. UA_TYPE_ENCODEBINARY(UA_ExtensionObject,
  968. retval |= UA_NodeId_encodeBinary(&(src->typeId),pos,dst);
  969. retval |= UA_Byte_encodeBinary(&(src->encoding),pos,dst);
  970. switch (src->encoding) {
  971. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  972. break;
  973. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  974. // FIXME: This code is valid for numeric nodeIds in ns0 only!
  975. retval |= UA_[UA_ns0ToVTableIndex(src->typeId.identifier.numeric)].encodeBinary(src->body.data,pos,dst);
  976. break;
  977. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  978. retval |= UA_ByteString_encodeBinary(&(src->body),pos,dst);
  979. break;
  980. })
  981. UA_Int32 UA_ExtensionObject_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_ExtensionObject *dst) {
  982. UA_Int32 retval = UA_SUCCESS;
  983. UA_ExtensionObject_init(dst);
  984. CHECKED_DECODE(UA_NodeId_decodeBinary(src,pos,&(dst->typeId)), UA_ExtensionObject_deleteMembers(dst));
  985. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&(dst->encoding)), UA_ExtensionObject_deleteMembers(dst));
  986. CHECKED_DECODE(UA_String_copy(&UA_String_null, (UA_String*) &(dst->body)), UA_ExtensionObject_deleteMembers(dst));
  987. switch (dst->encoding) {
  988. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  989. break;
  990. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  991. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  992. CHECKED_DECODE(UA_ByteString_decodeBinary(src,pos,&(dst->body)), UA_ExtensionObject_deleteMembers(dst));
  993. break;
  994. }
  995. return retval;
  996. }
  997. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExtensionObject)
  998. UA_Int32 UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  999. UA_Int32 retval = UA_SUCCESS;
  1000. retval |= UA_NodeId_deleteMembers(&(p->typeId));
  1001. retval |= UA_ByteString_deleteMembers(&(p->body));
  1002. return retval;
  1003. }
  1004. UA_Int32 UA_ExtensionObject_init(UA_ExtensionObject* p) {
  1005. if(p==UA_NULL)return UA_ERROR;
  1006. UA_ByteString_init(&(p->body));
  1007. p->encoding = 0;
  1008. UA_NodeId_init(&(p->typeId));
  1009. return UA_SUCCESS;
  1010. }
  1011. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExtensionObject)
  1012. UA_Int32 UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  1013. UA_Int32 retval = UA_SUCCESS;
  1014. retval |= UA_ExtensionObject_calcSize(UA_NULL);
  1015. retval |= UA_Byte_copy(&(src->encoding),&(dst->encoding));
  1016. retval |= UA_ByteString_copy(&(src->body),&(dst->body));
  1017. retval |= UA_NodeId_copy(&(src->typeId),&(dst->typeId));
  1018. return retval;
  1019. }
  1020. /** DiagnosticInfo - Part: 4, Chapter: 7.9, Page: 116 */
  1021. UA_Int32 UA_DiagnosticInfo_calcSize(UA_DiagnosticInfo const * ptr) {
  1022. UA_Int32 length = 0;
  1023. if (ptr == UA_NULL) {
  1024. length = sizeof(UA_DiagnosticInfo);
  1025. } else {
  1026. UA_Byte mask;
  1027. length += sizeof(UA_Byte); // EncodingMask
  1028. for (mask = 0x01; mask <= 0x40; mask *= 2) {
  1029. switch (mask & (ptr->encodingMask)) {
  1030. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1031. // puts("diagnosticInfo symbolic id");
  1032. length += sizeof(UA_Int32);
  1033. break;
  1034. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1035. length += sizeof(UA_Int32);
  1036. break;
  1037. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1038. length += sizeof(UA_Int32);
  1039. break;
  1040. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1041. length += sizeof(UA_Int32);
  1042. break;
  1043. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1044. length += UA_String_calcSize(&(ptr->additionalInfo));
  1045. break;
  1046. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1047. length += sizeof(UA_StatusCode);
  1048. break;
  1049. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1050. length += UA_DiagnosticInfo_calcSize(ptr->innerDiagnosticInfo);
  1051. break;
  1052. }
  1053. }
  1054. }
  1055. return length;
  1056. }
  1057. UA_Int32 UA_DiagnosticInfo_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_DiagnosticInfo *dst) {
  1058. UA_Int32 retval = UA_SUCCESS;
  1059. UA_DiagnosticInfo_init(dst);
  1060. CHECKED_DECODE(UA_Byte_decodeBinary(src, pos, &(dst->encodingMask)), ;);
  1061. for (UA_Int32 i = 0; i < 7; i++) {
  1062. switch ( (0x01 << i) & dst->encodingMask) {
  1063. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1064. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->symbolicId)), ;);
  1065. break;
  1066. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1067. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->namespaceUri)), ;);
  1068. break;
  1069. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1070. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->localizedText)), ;);
  1071. break;
  1072. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1073. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &(dst->locale)), ;);
  1074. break;
  1075. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1076. CHECKED_DECODE(UA_String_decodeBinary(src, pos, &(dst->additionalInfo)), ;);
  1077. break;
  1078. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1079. CHECKED_DECODE(UA_StatusCode_decodeBinary(src, pos, &(dst->innerStatusCode)), ;);
  1080. break;
  1081. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1082. // innerDiagnosticInfo is a pointer to struct, therefore allocate
  1083. CHECKED_DECODE(UA_alloc((void **) &(dst->innerDiagnosticInfo), UA_DiagnosticInfo_calcSize(UA_NULL)), ;);
  1084. CHECKED_DECODE(UA_DiagnosticInfo_decodeBinary(src, pos, dst->innerDiagnosticInfo), UA_DiagnosticInfo_deleteMembers(dst));
  1085. break;
  1086. }
  1087. }
  1088. return retval;
  1089. }
  1090. UA_TYPE_ENCODEBINARY(UA_DiagnosticInfo,
  1091. retval |= UA_Byte_encodeBinary(&(src->encodingMask), pos, dst);
  1092. for (UA_Int32 i = 0; i < 7; i++) {
  1093. switch ( (0x01 << i) & src->encodingMask) {
  1094. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  1095. retval |= UA_Int32_encodeBinary(&(src->symbolicId), pos, dst);
  1096. break;
  1097. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  1098. retval |= UA_Int32_encodeBinary( &(src->namespaceUri), pos, dst);
  1099. break;
  1100. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  1101. retval |= UA_Int32_encodeBinary(&(src->localizedText), pos, dst);
  1102. break;
  1103. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  1104. retval |= UA_Int32_encodeBinary(&(src->locale), pos, dst);
  1105. break;
  1106. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1107. retval |= UA_String_encodeBinary(&(src->additionalInfo), pos, dst);
  1108. break;
  1109. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1110. retval |= UA_StatusCode_encodeBinary(&(src->innerStatusCode), pos, dst);
  1111. break;
  1112. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1113. retval |= UA_DiagnosticInfo_encodeBinary(src->innerDiagnosticInfo, pos, dst);
  1114. break;
  1115. }
  1116. })
  1117. UA_TYPE_METHOD_DELETE_STRUCT(UA_DiagnosticInfo)
  1118. UA_Int32 UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  1119. UA_Int32 retval = UA_SUCCESS;
  1120. if ((p->encodingMask & UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO) && p->innerDiagnosticInfo != UA_NULL) {
  1121. retval |= UA_DiagnosticInfo_deleteMembers(p->innerDiagnosticInfo);
  1122. retval |= UA_free(p->innerDiagnosticInfo);
  1123. }
  1124. return retval;
  1125. }
  1126. UA_Int32 UA_DiagnosticInfo_init(UA_DiagnosticInfo* p){
  1127. if(p==UA_NULL)return UA_ERROR;
  1128. UA_String_init(&(p->additionalInfo));
  1129. p->encodingMask = 0;
  1130. p->innerDiagnosticInfo = UA_NULL;
  1131. UA_StatusCode_init(&(p->innerStatusCode));
  1132. p->locale = 0;
  1133. p->localizedText = 0;
  1134. p->namespaceUri = 0;
  1135. p->symbolicId = 0;
  1136. return UA_SUCCESS;
  1137. }
  1138. UA_TYPE_METHOD_NEW_DEFAULT(UA_DiagnosticInfo)
  1139. UA_Int32 UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst)
  1140. {
  1141. UA_Int32 retval = UA_SUCCESS;
  1142. retval |= UA_String_copy(&(src->additionalInfo), &(dst->additionalInfo));
  1143. retval |= UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1144. retval |= UA_StatusCode_copy(&(src->innerStatusCode), &(dst->innerStatusCode));
  1145. if(src->innerDiagnosticInfo){
  1146. retval |= UA_alloc((void**)&(dst->innerDiagnosticInfo),UA_DiagnosticInfo_calcSize(UA_NULL));
  1147. if(retval == UA_SUCCESS){
  1148. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  1149. }
  1150. }
  1151. else{
  1152. dst->innerDiagnosticInfo = UA_NULL;
  1153. }
  1154. retval |= UA_Int32_copy(&(src->locale), &(dst->locale));
  1155. retval |= UA_Int32_copy(&(src->localizedText), &(dst->localizedText));
  1156. retval |= UA_Int32_copy(&(src->namespaceUri), &(dst->namespaceUri));
  1157. retval |= UA_Int32_copy(&(src->symbolicId), &(dst->symbolicId));
  1158. return retval;
  1159. }
  1160. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DiagnosticInfo)
  1161. UA_TYPE_METHOD_PROTOTYPES_AS_WOXML(UA_DateTime,UA_Int64)
  1162. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DateTime)
  1163. UA_TYPE_METHOD_NEW_DEFAULT(UA_DateTime)
  1164. #include <sys/time.h>
  1165. // Number of seconds from 1 Jan. 1601 00:00 to 1 Jan 1970 00:00 UTC
  1166. #define FILETIME_UNIXTIME_BIAS_SEC 11644473600LL
  1167. // Factors
  1168. #define HUNDRED_NANOSEC_PER_USEC 10LL
  1169. #define HUNDRED_NANOSEC_PER_SEC (HUNDRED_NANOSEC_PER_USEC * 1000000LL)
  1170. // IEC 62541-6 §5.2.2.5 A DateTime value shall be encoded as a 64-bit signed integer
  1171. // which represents the number of 100 nanosecond intervals since January 1, 1601 (UTC).
  1172. UA_DateTime UA_DateTime_now() {
  1173. UA_DateTime dateTime;
  1174. struct timeval tv;
  1175. gettimeofday(&tv, UA_NULL);
  1176. dateTime = (tv.tv_sec + FILETIME_UNIXTIME_BIAS_SEC)
  1177. * HUNDRED_NANOSEC_PER_SEC + tv.tv_usec * HUNDRED_NANOSEC_PER_USEC;
  1178. return dateTime;
  1179. }
  1180. //toDo
  1181. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime time){
  1182. UA_DateTimeStruct dateTimeStruct;
  1183. //calcualting the the milli-, micro- and nanoseconds
  1184. UA_DateTime timeTemp;
  1185. timeTemp = (time-((time/10)*10))*100; //getting the last digit -> *100 for the 100 nanaseconds resolution
  1186. dateTimeStruct.nanoSec = timeTemp; //123 456 7 -> 700 nanosec;
  1187. timeTemp = (time-((time/10000)*10000))/10;
  1188. dateTimeStruct.microSec = timeTemp; //123 456 7 -> 456 microsec
  1189. timeTemp = (time-((time/10000000)*10000000))/10000;
  1190. dateTimeStruct.milliSec = timeTemp; //123 456 7 -> 123 millisec
  1191. //calculating the unix time with #include <time.h>
  1192. time_t timeInSec = time/10000000; //converting the nanoseconds time in unixtime
  1193. struct tm ts;
  1194. ts = *gmtime(&timeInSec);
  1195. //strftime(buf, sizeof(buf), "%a %Y-%m-%d %H:%M:%S %Z", &ts);
  1196. //printf("%s\n", buf);
  1197. dateTimeStruct.sec = ts.tm_sec;
  1198. dateTimeStruct.min = ts.tm_min;
  1199. dateTimeStruct.hour = ts.tm_hour;
  1200. dateTimeStruct.day = ts.tm_mday;
  1201. dateTimeStruct.mounth = ts.tm_mon+1;
  1202. dateTimeStruct.year = ts.tm_year + 1900;
  1203. return dateTimeStruct;
  1204. }
  1205. UA_Int32 UA_DateTime_toString(UA_DateTime time, UA_String* timeString){
  1206. char *charBuf = (char*)(*timeString).data;
  1207. UA_DateTimeStruct tSt = UA_DateTime_toStruct(time);
  1208. sprintf(charBuf, "%2d/%2d/%4d %2d:%2d:%2d.%3d.%3d.%3d", tSt.mounth, tSt.day, tSt.year,
  1209. tSt.hour, tSt.min, tSt.sec, tSt.milliSec, tSt.microSec, tSt.nanoSec);
  1210. return UA_SUCCESS;
  1211. }
  1212. /* UA_XmlElement */
  1213. UA_TYPE_METHOD_PROTOTYPES_AS(UA_XmlElement, UA_ByteString)
  1214. UA_TYPE_METHOD_NEW_DEFAULT(UA_XmlElement)
  1215. /** IntegerId - Part: 4, Chapter: 7.13, Page: 118 */
  1216. UA_TYPE_METHOD_PROTOTYPES_AS(UA_IntegerId, UA_Int32)
  1217. UA_TYPE_METHOD_NEW_DEFAULT(UA_IntegerId)
  1218. UA_TYPE_METHOD_PROTOTYPES_AS_WOXML(UA_StatusCode, UA_UInt32)
  1219. UA_TYPE_METHOD_NEW_DEFAULT(UA_StatusCode)
  1220. UA_Int32 UA_StatusCode_decodeXML(XML_Stack* s, XML_Attr* attr, UA_StatusCode* dst, _Bool isStart) {
  1221. DBG_VERBOSE(printf("UA_StatusCode_decodeXML entered with dst=%p,isStart=%d\n", (void* ) dst, isStart));
  1222. return UA_ERR_NOT_IMPLEMENTED;
  1223. }
  1224. /** QualifiedName - Part 4, Chapter
  1225. * but see Part 6, Chapter 5.2.2.13 for Binary Encoding
  1226. */
  1227. UA_Int32 UA_QualifiedName_calcSize(UA_QualifiedName const * p) {
  1228. UA_Int32 length = 0;
  1229. if (p == UA_NULL) return sizeof(UA_QualifiedName);
  1230. length += sizeof(UA_UInt16); //qualifiedName->namespaceIndex
  1231. // length += sizeof(UA_UInt16); //qualifiedName->reserved
  1232. length += UA_String_calcSize(&(p->name)); //qualifiedName->name
  1233. return length;
  1234. }
  1235. UA_Int32 UA_QualifiedName_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_QualifiedName *dst) {
  1236. UA_Int32 retval = UA_SUCCESS;
  1237. UA_QualifiedName_init(dst);
  1238. CHECKED_DECODE(UA_UInt16_decodeBinary(src,pos,&(dst->namespaceIndex)), ;);
  1239. //retval |= UA_UInt16_decodeBinary(src,pos,&(dst->reserved));
  1240. CHECKED_DECODE(UA_String_decodeBinary(src,pos,&(dst->name)), ;);
  1241. return retval;
  1242. }
  1243. UA_TYPE_ENCODEBINARY(UA_QualifiedName,
  1244. retval |= UA_UInt16_encodeBinary(&(src->namespaceIndex),pos,dst);
  1245. //retval |= UA_UInt16_encodeBinary(&(src->reserved),pos,dst);
  1246. retval |= UA_String_encodeBinary(&(src->name),pos,dst);)
  1247. UA_Int32 UA_QualifiedName_delete(UA_QualifiedName * p) {
  1248. UA_Int32 retval = UA_SUCCESS;
  1249. retval |= UA_QualifiedName_deleteMembers(p);
  1250. retval |= UA_free(p);
  1251. return retval;
  1252. }
  1253. UA_Int32 UA_QualifiedName_deleteMembers(UA_QualifiedName * p) {
  1254. UA_Int32 retval = UA_SUCCESS;
  1255. retval |= UA_String_deleteMembers(&p->name);
  1256. return retval;
  1257. }
  1258. UA_Int32 UA_QualifiedName_init(UA_QualifiedName * p) {
  1259. if(p==UA_NULL)return UA_ERROR;
  1260. UA_String_init(&(p->name));
  1261. p->namespaceIndex=0;
  1262. return UA_SUCCESS;
  1263. }
  1264. UA_TYPE_METHOD_NEW_DEFAULT(UA_QualifiedName)
  1265. UA_Int32 UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  1266. UA_Int32 retval = UA_SUCCESS;
  1267. retval |= UA_alloc((void**)&dst,UA_QualifiedName_calcSize(UA_NULL));
  1268. retval |= UA_String_copy(&(src->name),&(dst->name));
  1269. retval |= UA_UInt16_copy(&(src->namespaceIndex),&(dst->namespaceIndex));
  1270. return retval;
  1271. }
  1272. UA_Int32 UA_Variant_calcSize(UA_Variant const * p) {
  1273. UA_Int32 length = 0;
  1274. if (p == UA_NULL) return sizeof(UA_Variant);
  1275. UA_UInt32 builtinNs0Id = p->encodingMask & 0x3F; // Bits 0-5
  1276. UA_Boolean isArray = p->encodingMask & (0x01 << 7); // Bit 7
  1277. UA_Boolean hasDimensions = p->encodingMask & (0x01 << 6); // Bit 6
  1278. if (p->vt == UA_NULL || builtinNs0Id != p->vt->ns0Id) return UA_ERR_INCONSISTENT;
  1279. length += sizeof(UA_Byte); //p->encodingMask
  1280. if (isArray) { // array length is encoded
  1281. length += sizeof(UA_Int32); //p->arrayLength
  1282. if (p->arrayLength > 0) {
  1283. // TODO: add suggestions of @jfpr to not iterate over arrays with fixed len elements
  1284. // FIXME: the concept of calcSize delivering the storageSize given an UA_Null argument
  1285. // fails for arrays with null-ptrs, see test case
  1286. // UA_Variant_calcSizeVariableSizeArrayWithNullPtrWillReturnWrongEncodingSize
  1287. // Simply do not allow?
  1288. for (UA_Int32 i=0;i<p->arrayLength;i++) {
  1289. length += p->vt->calcSize(p->data[i]);
  1290. }
  1291. }
  1292. } else { //single value to encode
  1293. if (p->data == UA_NULL) {
  1294. if (p->vt->ns0Id != UA_INVALIDTYPE_NS0) {
  1295. length += p->vt->calcSize(UA_NULL);
  1296. } else {
  1297. length += 0;
  1298. }
  1299. } else {
  1300. length += p->vt->calcSize(p->data[0]);
  1301. }
  1302. }
  1303. if (hasDimensions) {
  1304. //ToDo: tobeInsert: length += the calcSize for dimensions
  1305. }
  1306. return length;
  1307. }
  1308. UA_TYPE_ENCODEBINARY(UA_Variant,
  1309. if (src->vt == UA_NULL || ( src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) != src->vt->ns0Id) return UA_ERR_INCONSISTENT;
  1310. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1311. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // encode array length
  1312. retval |= UA_Int32_encodeBinary(&(src->arrayLength),pos,dst);
  1313. }
  1314. if (src->arrayLength > 0) {
  1315. //encode array as given by variant type
  1316. for (UA_Int32 i=0;i<src->arrayLength;i++) {
  1317. retval |= src->vt->encodeBinary(src->data[i],pos,dst);
  1318. }
  1319. } else {
  1320. if (src->data == UA_NULL) {
  1321. if (src->vt->ns0Id == UA_INVALIDTYPE_NS0) {
  1322. retval = UA_SUCCESS;
  1323. } else {
  1324. retval = UA_ERR_NO_MEMORY;
  1325. }
  1326. } else {
  1327. retval |= src->vt->encodeBinary(src->data[0],pos,dst);
  1328. }
  1329. }
  1330. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1331. //encode dimension field
  1332. UA_Int32_encodeBinary(&(src->arrayDimensionsLength), pos, dst);
  1333. if(src->arrayDimensionsLength >0){
  1334. for (UA_Int32 i=0;i<src->arrayDimensionsLength;i++) {
  1335. retval |= UA_Int32_encodeBinary(src->arrayDimensions[i], pos, dst);
  1336. }
  1337. }
  1338. })
  1339. UA_Int32 UA_Variant_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_Variant *dst) {
  1340. UA_Int32 retval = UA_SUCCESS;
  1341. UA_Variant_init(dst);
  1342. CHECKED_DECODE(UA_Byte_decodeBinary(src,pos,&(dst->encodingMask)), ;);
  1343. UA_Int32 ns0Id = dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1344. // initialize vTable
  1345. UA_Int32 uaIdx = UA_ns0ToVTableIndex(ns0Id);
  1346. if(UA_VTable_isValidType(uaIdx) != UA_SUCCESS)
  1347. return UA_ERROR;
  1348. dst->vt = &UA_[uaIdx];
  1349. // get size of array
  1350. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // get array length
  1351. CHECKED_DECODE(UA_Int32_decodeBinary(src, pos, &dst->arrayLength), ;);
  1352. } else {
  1353. dst->arrayLength = 1;
  1354. }
  1355. if (ns0Id == UA_INVALIDTYPE_NS0) { // handle NULL-Variant !
  1356. dst->data = UA_NULL;
  1357. dst->arrayLength = -1;
  1358. } else {
  1359. // allocate array and decode
  1360. CHECKED_DECODE(UA_Array_new(&dst->data, dst->arrayLength, uaIdx), dst->data = UA_NULL);
  1361. CHECKED_DECODE(UA_Array_decodeBinary(src, dst->arrayLength, uaIdx, pos, &dst->data), UA_Variant_deleteMembers(dst));
  1362. }
  1363. //decode the dimension field array if present
  1364. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1365. UA_Int32_decodeBinary(src, pos, &dst->arrayDimensionsLength);
  1366. CHECKED_DECODE(UA_Array_new((void***)&dst->arrayDimensions, dst->arrayDimensionsLength, UA_INT32), dst->arrayDimensions = UA_NULL);
  1367. CHECKED_DECODE(UA_Array_decodeBinary(src, dst->arrayLength, uaIdx, pos, &dst->data), UA_Variant_deleteMembers(dst));
  1368. }
  1369. return retval;
  1370. }
  1371. UA_TYPE_METHOD_DELETE_STRUCT(UA_Variant)
  1372. UA_Int32 UA_Variant_deleteMembers(UA_Variant * p) {
  1373. UA_Int32 retval = UA_SUCCESS;
  1374. if(p->data != UA_NULL) {
  1375. retval |= UA_Array_delete(&p->data,p->arrayLength,UA_ns0ToVTableIndex(p->vt->ns0Id));
  1376. retval |= UA_Array_delete(&p->data,p->arrayDimensionsLength,UA_INT32_NS0);
  1377. }
  1378. return retval;
  1379. }
  1380. UA_Int32 UA_Variant_init(UA_Variant * p) {
  1381. if(p==UA_NULL)return UA_ERROR;
  1382. p->arrayLength = -1; // no element, p->data == UA_NULL
  1383. p->data = UA_NULL;
  1384. p->encodingMask = 0;
  1385. p->arrayDimensions = 0;
  1386. p->arrayDimensionsLength = 0;
  1387. p->vt = &UA_[UA_INVALIDTYPE];
  1388. return UA_SUCCESS;
  1389. }
  1390. UA_TYPE_METHOD_NEW_DEFAULT(UA_Variant)
  1391. UA_Int32 UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  1392. UA_Int32 retval = UA_SUCCESS;
  1393. UA_Int32 ns0Id = src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1394. UA_Int32 uaIdx = UA_ns0ToVTableIndex(ns0Id);
  1395. void * pData;
  1396. if(UA_VTable_isValidType(uaIdx) != UA_SUCCESS) return UA_ERROR;
  1397. dst->vt = &UA_[uaIdx];
  1398. retval |= UA_Int32_copy(&(src->arrayLength), &(dst->arrayLength));
  1399. retval |= UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1400. retval |= UA_Int32_copy(&(src->arrayDimensionsLength), &(dst->arrayDimensionsLength));
  1401. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) {
  1402. retval |= UA_Array_copy((const void * const *)(src->data),src->arrayLength, uaIdx,(void***)&(dst->data));
  1403. }
  1404. else {
  1405. UA_alloc((void**)&pData,UA_[uaIdx].calcSize(UA_NULL));
  1406. dst->data = &pData;
  1407. UA_[uaIdx].copy(src->data[0], dst->data[0]);
  1408. }
  1409. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1410. retval |= UA_Array_copy((const void * const *)(src->arrayDimensions),src->arrayDimensionsLength, UA_ns0ToVTableIndex(UA_INT32_NS0),(void***)&(dst->arrayDimensions));
  1411. }
  1412. return retval;
  1413. }
  1414. UA_Int32 UA_Variant_borrowSetValue(UA_Variant *v, UA_Int32 type_id, const void* value) {
  1415. v->encodingMask = type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1416. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1417. v->vt = &UA_noDelete_[type_id];
  1418. v->data = (void*) value;
  1419. return UA_SUCCESS;
  1420. }
  1421. UA_Int32 UA_Variant_copySetValue(UA_Variant *v, UA_Int32 type_id, const void* value) {
  1422. v->encodingMask = type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1423. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1424. v->vt = &UA_[type_id];
  1425. return v->vt->copy(value, v->data);
  1426. }
  1427. UA_Int32 UA_Variant_borrowSetArray(UA_Variant *v, UA_Int32 type_id, UA_Int32 arrayLength, const void* array) {
  1428. v->encodingMask = (type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) | UA_VARIANT_ENCODINGMASKTYPE_ARRAY;
  1429. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1430. v->vt = &UA_noDelete_[type_id];
  1431. v->arrayLength = arrayLength;
  1432. v->data = (void*) array;
  1433. return UA_SUCCESS;
  1434. }
  1435. UA_Int32 UA_Variant_copySetArray(UA_Variant *v, UA_Int32 type_id, UA_Int32 arrayLength, UA_UInt32 elementSize, const void* array) {
  1436. v->encodingMask = (type_id & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) | UA_VARIANT_ENCODINGMASKTYPE_ARRAY;
  1437. if(UA_VTable_isValidType(type_id) != UA_SUCCESS) return UA_INVALIDTYPE;
  1438. v->vt = &UA_[type_id];
  1439. v->arrayLength = arrayLength;
  1440. void *new_arr;
  1441. UA_Int32 retval = UA_SUCCESS;
  1442. retval |= UA_alloc(&new_arr, arrayLength * elementSize);
  1443. retval |= UA_memcpy(new_arr, array, arrayLength * elementSize);
  1444. v->data = new_arr;
  1445. return UA_SUCCESS;
  1446. }
  1447. //TODO: place this define at the server configuration
  1448. #define MAX_PICO_SECONDS 1000
  1449. UA_Int32 UA_DataValue_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_DataValue* dst) {
  1450. UA_Int32 retval = UA_SUCCESS;
  1451. UA_DataValue_init(dst);
  1452. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingMask));
  1453. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1454. CHECKED_DECODE(UA_Variant_decodeBinary(src,pos,&(dst->value)), UA_DataValue_deleteMembers(dst));
  1455. }
  1456. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1457. CHECKED_DECODE(UA_StatusCode_decodeBinary(src,pos,&(dst->status)), UA_DataValue_deleteMembers(dst));
  1458. }
  1459. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1460. CHECKED_DECODE(UA_DateTime_decodeBinary(src,pos,&(dst->sourceTimestamp)), UA_DataValue_deleteMembers(dst));
  1461. }
  1462. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1463. CHECKED_DECODE(UA_Int16_decodeBinary(src,pos,&(dst->sourcePicoseconds)), UA_DataValue_deleteMembers(dst));
  1464. if (dst->sourcePicoseconds > MAX_PICO_SECONDS) {
  1465. dst->sourcePicoseconds = MAX_PICO_SECONDS;
  1466. }
  1467. }
  1468. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1469. CHECKED_DECODE(UA_DateTime_decodeBinary(src,pos,&(dst->serverTimestamp)), UA_DataValue_deleteMembers(dst));
  1470. }
  1471. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1472. CHECKED_DECODE(UA_Int16_decodeBinary(src,pos,&(dst->serverPicoseconds)), UA_DataValue_deleteMembers(dst));
  1473. if (dst->serverPicoseconds > MAX_PICO_SECONDS) {
  1474. dst->serverPicoseconds = MAX_PICO_SECONDS;
  1475. }
  1476. }
  1477. return retval;
  1478. }
  1479. UA_TYPE_ENCODEBINARY(UA_DataValue,
  1480. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1481. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1482. retval |= UA_Variant_encodeBinary(&(src->value),pos,dst);
  1483. }
  1484. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1485. retval |= UA_StatusCode_encodeBinary(&(src->status),pos,dst);
  1486. }
  1487. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1488. retval |= UA_DateTime_encodeBinary(&(src->sourceTimestamp),pos,dst);
  1489. }
  1490. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1491. retval |= UA_Int16_encodeBinary(&(src->sourcePicoseconds),pos,dst);
  1492. }
  1493. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1494. retval |= UA_DateTime_encodeBinary(&(src->serverTimestamp),pos,dst);
  1495. }
  1496. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1497. retval |= UA_Int16_encodeBinary(&(src->serverPicoseconds),pos,dst);
  1498. })
  1499. UA_Int32 UA_DataValue_calcSize(UA_DataValue const * p) {
  1500. UA_Int32 length = 0;
  1501. if (p == UA_NULL) { // get static storage size
  1502. length = sizeof(UA_DataValue);
  1503. } else { // get decoding size
  1504. length = sizeof(UA_Byte);
  1505. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1506. // FIXME: this one can return with an error value instead of a size
  1507. length += UA_Variant_calcSize(&(p->value));
  1508. }
  1509. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1510. length += sizeof(UA_UInt32); //dataValue->status
  1511. }
  1512. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1513. length += sizeof(UA_DateTime); //dataValue->sourceTimestamp
  1514. }
  1515. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1516. length += sizeof(UA_Int64); //dataValue->sourcePicoseconds
  1517. }
  1518. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1519. length += sizeof(UA_DateTime); //dataValue->serverTimestamp
  1520. }
  1521. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1522. length += sizeof(UA_Int64); //dataValue->serverPicoseconds
  1523. }
  1524. }
  1525. return length;
  1526. }
  1527. UA_TYPE_METHOD_DELETE_STRUCT(UA_DataValue)
  1528. UA_Int32 UA_DataValue_deleteMembers(UA_DataValue * p) {
  1529. UA_Int32 retval = UA_SUCCESS;
  1530. UA_Variant_deleteMembers(&p->value);
  1531. return retval;
  1532. }
  1533. UA_Int32 UA_DataValue_init(UA_DataValue * p){
  1534. if(p==UA_NULL)return UA_ERROR;
  1535. p->encodingMask = 0;
  1536. p->serverPicoseconds = 0;
  1537. UA_DateTime_init(&(p->serverTimestamp));
  1538. p->sourcePicoseconds = 0;
  1539. UA_DateTime_init(&(p->sourceTimestamp));
  1540. UA_StatusCode_init(&(p->status));
  1541. UA_Variant_init(&(p->value));
  1542. return UA_SUCCESS;
  1543. }
  1544. UA_TYPE_METHOD_NEW_DEFAULT(UA_DataValue)
  1545. UA_Int32 UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst){
  1546. UA_Int32 retval = UA_SUCCESS;
  1547. //TODO can be optimized by direct UA_memcpy call
  1548. UA_Byte_copy(&(src->encodingMask), &(dst->encodingMask));
  1549. UA_Int16_copy(&(src->serverPicoseconds),&(dst->serverPicoseconds));
  1550. UA_DateTime_copy(&(src->serverTimestamp),&(dst->serverTimestamp));
  1551. UA_Int16_copy(&(src->sourcePicoseconds), &(dst->sourcePicoseconds));
  1552. UA_DateTime_copy(&(src->sourceTimestamp),&(dst->sourceTimestamp));
  1553. UA_StatusCode_copy(&(src->status),&(dst->status));
  1554. UA_Variant_copy(&(src->value),&(dst->value));
  1555. return retval;
  1556. }
  1557. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_DataValue)
  1558. /* UA_InvalidType - internal type necessary to handle inited Variants correctly */
  1559. UA_Int32 UA_InvalidType_calcSize(UA_InvalidType const * p) { return 0; }
  1560. UA_TYPE_ENCODEBINARY(UA_InvalidType, retval = UA_ERR_INVALID_VALUE;)
  1561. UA_TYPE_DECODEBINARY(UA_InvalidType, retval = UA_ERR_INVALID_VALUE;)
  1562. UA_Int32 UA_InvalidType_free(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1563. UA_Int32 UA_InvalidType_delete(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1564. UA_Int32 UA_InvalidType_deleteMembers(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1565. UA_Int32 UA_InvalidType_init(UA_InvalidType* p) { return UA_ERR_INVALID_VALUE; }
  1566. UA_Int32 UA_InvalidType_copy(UA_InvalidType const* src, UA_InvalidType *dst) { return UA_ERR_INVALID_VALUE; }
  1567. UA_Int32 UA_InvalidType_new(UA_InvalidType** p) { return UA_ERR_INVALID_VALUE; }
  1568. UA_TYPE_METHOD_DECODEXML_NOTIMPL(UA_InvalidType)