ua_basictypes.c 51 KB

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