ua_basictypes.c 59 KB

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