ua_basictypes.c 54 KB

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