ua_basictypes.c 51 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476
  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. DBG_VERBOSE(printf("UA_alloc;%p;%d;%s;%s;%s;%d\n",*ptr,size,pname,sname,f,l); fflush(stdout));
  89. UA_alloc_lastptr = *ptr = malloc(size);
  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+TYPE##_calcSize(src) > dst->length ) { \
  103. return UA_ERR_NO_MEMORY; \
  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+TYPE##_calcSize(UA_NULL) > src->length ) { \
  110. return UA_ERR_NO_MEMORY; \
  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 + UA_String_calcSize(src) > dst->length) {
  350. return UA_ERR_NO_MEMORY;
  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 (dst->length > 0) {
  364. retval |= UA_alloc((void**)&(dst->data),dst->length);
  365. retval |= UA_memcpy(dst->data,&(src->data[*pos]),dst->length);
  366. *pos += dst->length;
  367. } else {
  368. dst->data = UA_NULL;
  369. }
  370. return retval;
  371. }
  372. UA_TYPE_METHOD_NEW_DEFAULT(UA_String)
  373. UA_TYPE_METHOD_DELETE_STRUCT(UA_String)
  374. UA_Int32 UA_String_deleteMembers(UA_String* p) { return UA_free(p->data); }
  375. UA_Int32 UA_String_copy(UA_String const * src, UA_String* dst) {
  376. UA_Int32 retval = UA_SUCCESS;
  377. dst->data = UA_NULL;
  378. dst->length = -1;
  379. if (src->length > 0) {
  380. retval |= UA_alloc((void**)&(dst->data), src->length);
  381. if (retval == UA_SUCCESS) {
  382. retval |= UA_memcpy((void*)dst->data, src->data, src->length);
  383. dst->length = src->length;
  384. }
  385. }
  386. return retval;
  387. }
  388. UA_Int32 UA_String_copycstring(char const * src, UA_String* dst) {
  389. UA_Int32 retval = UA_SUCCESS;
  390. dst->length = strlen(src);
  391. dst->data = UA_NULL;
  392. if (dst->length > 0) {
  393. retval |= UA_alloc((void**)&(dst->data), dst->length);
  394. if (retval == UA_SUCCESS) {
  395. retval |= UA_memcpy((void*)dst->data, src, dst->length);
  396. }
  397. }
  398. return retval;
  399. }
  400. #define UA_STRING_COPYPRINTF_BUFSIZE 1024
  401. UA_Int32 UA_String_copyprintf(char const * fmt, UA_String* dst, ...) {
  402. UA_Int32 retval = UA_SUCCESS;
  403. char src[UA_STRING_COPYPRINTF_BUFSIZE];
  404. UA_Int32 len;
  405. va_list ap;
  406. va_start(ap, dst);
  407. len = vsnprintf(src,UA_STRING_COPYPRINTF_BUFSIZE,fmt,ap);
  408. va_end(ap);
  409. if (len < 0) { // FIXME: old glibc 2.0 would return -1 when truncated
  410. dst->length = 0;
  411. dst->data = UA_NULL;
  412. retval = UA_ERR_INVALID_VALUE;
  413. } else {
  414. // since glibc 2.1 vsnprintf returns len that would have resulted if buf were large enough
  415. dst->length = ( len > UA_STRING_COPYPRINTF_BUFSIZE ? UA_STRING_COPYPRINTF_BUFSIZE : len );
  416. retval |= UA_alloc((void**)&(dst->data), dst->length);
  417. if (retval == UA_SUCCESS) {
  418. retval |= UA_memcpy((void*)dst->data, src, dst->length);
  419. }
  420. }
  421. return retval;
  422. }
  423. UA_String UA_String_null = { -1, UA_NULL };
  424. UA_Int32 UA_String_init(UA_String* p){
  425. if(p==UA_NULL)return UA_ERROR;
  426. p->length = -1;
  427. p->data = UA_NULL;
  428. return UA_SUCCESS;
  429. }
  430. UA_Int32 UA_String_compare(const UA_String* string1, const UA_String* string2) {
  431. UA_Int32 retval;
  432. if (string1->length == 0 && string2->length == 0) {
  433. retval = UA_EQUAL;
  434. } else if (string1->length == -1 && string2->length == -1) {
  435. retval = UA_EQUAL;
  436. } else if (string1->length != string2->length) {
  437. retval = UA_NOT_EQUAL;
  438. } else {
  439. // casts to overcome signed warnings
  440. // FIXME: map return of strncmp to UA_EQUAL/UA_NOT_EQUAL
  441. retval = strncmp((char const*)string1->data,(char const*)string2->data,string1->length);
  442. }
  443. return retval;
  444. }
  445. void UA_String_printf(char* label, const UA_String* string) {
  446. printf("%s {Length=%d, Data=%.*s}\n", label, string->length,
  447. string->length, (char*)string->data);
  448. }
  449. void UA_String_printx(char* label, const UA_String* string) {
  450. int i;
  451. if (string == UA_NULL) { printf("%s {NULL}\n", label); return; }
  452. printf("%s {Length=%d, Data=", label, string->length);
  453. if (string->length > 0) {
  454. for (i = 0; i < string->length; i++) {
  455. printf("%c%d", i == 0 ? '{' : ',', (string->data)[i]);
  456. // if (i > 0 && !(i%20)) { printf("\n\t"); }
  457. }
  458. } else {
  459. printf("{");
  460. }
  461. printf("}}\n");
  462. }
  463. void UA_String_printx_hex(char* label, const UA_String* string) {
  464. int i;
  465. printf("%s {Length=%d, Data=", label, string->length);
  466. if (string->length > 0) {
  467. for (i = 0; i < string->length; i++) {
  468. printf("%c%x", i == 0 ? '{' : ',', (string->data)[i]);
  469. }
  470. } else {
  471. printf("{");
  472. }
  473. printf("}}\n");
  474. }
  475. // TODO: should we really handle UA_String and UA_ByteString the same way?
  476. UA_TYPE_METHOD_PROTOTYPES_AS(UA_ByteString, UA_String)
  477. UA_TYPE_METHOD_NEW_DEFAULT(UA_ByteString)
  478. UA_Int32 UA_ByteString_compare(const UA_ByteString *string1, const UA_ByteString *string2) {
  479. return UA_String_compare((const UA_String*) string1, (const UA_String*) string2);
  480. }
  481. void UA_ByteString_printf(char* label, const UA_ByteString* string) {
  482. UA_String_printf(label, (UA_String*) string);
  483. }
  484. void UA_ByteString_printx(char* label, const UA_ByteString* string) {
  485. UA_String_printx(label, (UA_String*) string);
  486. }
  487. void UA_ByteString_printx_hex(char* label, const UA_ByteString* string) {
  488. UA_String_printx_hex(label, (UA_String*) string);
  489. }
  490. UA_Byte UA_Byte_securityPoliceNoneData[] = "http://opcfoundation.org/UA/SecurityPolicy#None";
  491. // sizeof()-1 : discard the implicit null-terminator of the c-char-string
  492. UA_ByteString UA_ByteString_securityPoliceNone = { sizeof(UA_Byte_securityPoliceNoneData)-1, UA_Byte_securityPoliceNoneData };
  493. UA_Int32 UA_ByteString_copy(UA_ByteString const * src, UA_ByteString* dst) {
  494. return UA_String_copy((UA_String const*)src,(UA_String*)dst);
  495. }
  496. UA_Int32 UA_ByteString_newMembers(UA_ByteString* p, UA_Int32 length) {
  497. UA_Int32 retval = UA_SUCCESS;
  498. if ((retval |= UA_alloc((void**)&(p->data),length)) == UA_SUCCESS) {
  499. p->length = length;
  500. } else {
  501. p->length = length;
  502. p->data = UA_NULL;
  503. }
  504. return retval;
  505. }
  506. UA_Int32 UA_Guid_calcSize(UA_Guid const * p) {
  507. if (p == UA_NULL) {
  508. return sizeof(UA_Guid);
  509. } else {
  510. return 16;
  511. }
  512. }
  513. UA_TYPE_START_ENCODEBINARY(UA_Guid)
  514. int i=0;
  515. retval |= UA_UInt32_encodeBinary(&(src->data1), pos, dst);
  516. retval |= UA_UInt16_encodeBinary(&(src->data2), pos, dst);
  517. retval |= UA_UInt16_encodeBinary(&(src->data3), pos, dst);
  518. for (i=0;i<8;i++) {
  519. retval |= UA_Byte_encodeBinary(&(src->data4[i]), pos, dst);
  520. }
  521. UA_TYPE_END_XXCODEBINARY
  522. UA_Int32 UA_Guid_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_Guid *dst) {
  523. UA_Int32 retval = UA_SUCCESS;
  524. int i=0;
  525. retval |= UA_UInt32_decodeBinary(src,pos,&(dst->data1));
  526. retval |= UA_UInt16_decodeBinary(src,pos,&(dst->data2));
  527. retval |= UA_UInt16_decodeBinary(src,pos,&(dst->data3));
  528. for (i=0;i<8;i++) {
  529. retval |= UA_Byte_decodeBinary(src,pos,&(dst->data4[i]));
  530. }
  531. return retval;
  532. }
  533. UA_TYPE_METHOD_DELETE_STRUCT(UA_Guid)
  534. UA_Int32 UA_Guid_deleteMembers(UA_Guid* p) { return UA_SUCCESS; }
  535. UA_Int32 UA_Guid_compare(const UA_Guid *g1, const UA_Guid *g2) {
  536. return memcmp(g1, g2, sizeof(UA_Guid));
  537. }
  538. UA_Int32 UA_Guid_init(UA_Guid* p){
  539. if(p==UA_NULL)return UA_ERROR;
  540. p->data1 = 0;
  541. p->data2 = 0;
  542. p->data3 = 0;
  543. memset(p->data4,8,sizeof(UA_Byte));
  544. return UA_SUCCESS;
  545. }
  546. UA_TYPE_METHOD_NEW_DEFAULT(UA_Guid)
  547. UA_Int32 UA_LocalizedText_calcSize(UA_LocalizedText const * p) {
  548. UA_Int32 length = 0;
  549. if (p==UA_NULL) {
  550. // size for UA_memalloc
  551. length = sizeof(UA_LocalizedText);
  552. } else {
  553. // size for binary encoding
  554. length += 1; // p->encodingMask;
  555. if (p->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  556. length += UA_String_calcSize(&(p->locale));
  557. }
  558. if (p->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  559. length += UA_String_calcSize(&(p->text));
  560. }
  561. }
  562. return length;
  563. }
  564. UA_TYPE_START_ENCODEBINARY(UA_LocalizedText)
  565. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  566. if (src->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  567. retval |= UA_String_encodeBinary(&(src->locale),pos,dst);
  568. }
  569. if (src->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  570. retval |= UA_String_encodeBinary(&(src->text),pos,dst);
  571. }
  572. UA_TYPE_END_XXCODEBINARY
  573. UA_Int32 UA_LocalizedText_decodeBinary(UA_ByteString const * src, UA_Int32 *pos,
  574. UA_LocalizedText *dst) {
  575. UA_Int32 retval = UA_SUCCESS;
  576. retval |= UA_String_init(&(dst->locale));
  577. retval |= UA_String_init(&(dst->text));
  578. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingMask));
  579. if (dst->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE) {
  580. retval |= UA_String_decodeBinary(src,pos,&(dst->locale));
  581. }
  582. if (dst->encodingMask & UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT) {
  583. retval |= UA_String_decodeBinary(src,pos,&(dst->text));
  584. }
  585. return retval;
  586. }
  587. UA_TYPE_METHOD_DELETE_STRUCT(UA_LocalizedText)
  588. UA_Int32 UA_LocalizedText_deleteMembers(UA_LocalizedText* p) {
  589. return UA_SUCCESS
  590. || UA_String_deleteMembers(&(p->locale))
  591. || UA_String_deleteMembers(&(p->text))
  592. ;
  593. }
  594. UA_Int32 UA_LocalizedText_init(UA_LocalizedText* p){
  595. if(p==UA_NULL)return UA_ERROR;
  596. p->encodingMask = 0;
  597. UA_String_init(&(p->locale));
  598. UA_String_init(&(p->text));
  599. return UA_SUCCESS;
  600. }
  601. UA_TYPE_METHOD_NEW_DEFAULT(UA_LocalizedText)
  602. UA_Int32 UA_LocalizedText_copycstring(char const * src, UA_LocalizedText* dst) {
  603. UA_Int32 retval = UA_SUCCESS;
  604. if(dst==UA_NULL)return UA_ERROR;
  605. dst->encodingMask = UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_LOCALE | UA_LOCALIZEDTEXT_ENCODINGMASKTYPE_TEXT;
  606. retval |= UA_String_copycstring("EN",&(dst->locale));
  607. retval |= UA_String_copycstring(src,&(dst->text));
  608. return retval;
  609. }
  610. /* Serialization of UA_NodeID is specified in 62541-6, §5.2.2.9 */
  611. UA_Int32 UA_NodeId_calcSize(UA_NodeId const *p) {
  612. UA_Int32 length = 0;
  613. if (p == UA_NULL) {
  614. length = sizeof(UA_NodeId);
  615. } else {
  616. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  617. case UA_NODEIDTYPE_TWOBYTE:
  618. length = 2;
  619. break;
  620. case UA_NODEIDTYPE_FOURBYTE:
  621. length = 4;
  622. break;
  623. case UA_NODEIDTYPE_NUMERIC:
  624. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + sizeof(UA_UInt32);
  625. break;
  626. case UA_NODEIDTYPE_STRING:
  627. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_String_calcSize(&(p->identifier.string));
  628. break;
  629. case UA_NODEIDTYPE_GUID:
  630. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_Guid_calcSize(&(p->identifier.guid));
  631. break;
  632. case UA_NODEIDTYPE_BYTESTRING:
  633. length += sizeof(UA_Byte) + sizeof(UA_UInt16) + UA_ByteString_calcSize(&(p->identifier.byteString));
  634. break;
  635. default:
  636. break;
  637. }
  638. }
  639. return length;
  640. }
  641. UA_TYPE_START_ENCODEBINARY(UA_NodeId)
  642. // temporary variables for endian-save code
  643. UA_Byte srcByte;
  644. UA_UInt16 srcUInt16;
  645. int retval = UA_SUCCESS;
  646. retval |= UA_Byte_encodeBinary(&(src->encodingByte),pos,dst);
  647. switch (src->encodingByte & UA_NODEIDTYPE_MASK) {
  648. case UA_NODEIDTYPE_TWOBYTE:
  649. srcByte = src->identifier.numeric;
  650. retval |= UA_Byte_encodeBinary(&srcByte,pos,dst);
  651. break;
  652. case UA_NODEIDTYPE_FOURBYTE:
  653. srcByte = src->namespace;
  654. srcUInt16 = src->identifier.numeric;
  655. retval |= UA_Byte_encodeBinary(&srcByte,pos,dst);
  656. retval |= UA_UInt16_encodeBinary(&srcUInt16,pos,dst);
  657. break;
  658. case UA_NODEIDTYPE_NUMERIC:
  659. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  660. retval |= UA_UInt32_encodeBinary(&(src->identifier.numeric), pos, dst);
  661. break;
  662. case UA_NODEIDTYPE_STRING:
  663. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  664. retval |= UA_String_encodeBinary(&(src->identifier.string), pos, dst);
  665. break;
  666. case UA_NODEIDTYPE_GUID:
  667. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  668. retval |= UA_Guid_encodeBinary(&(src->identifier.guid), pos, dst);
  669. break;
  670. case UA_NODEIDTYPE_BYTESTRING:
  671. retval |= UA_UInt16_encodeBinary(&(src->namespace), pos, dst);
  672. retval |= UA_ByteString_encodeBinary(&(src->identifier.byteString), pos, dst);
  673. break;
  674. }
  675. UA_TYPE_END_XXCODEBINARY
  676. UA_Int32 UA_NodeId_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_NodeId *dst) {
  677. int retval = UA_SUCCESS;
  678. // temporary variables to overcome decoder's non-endian-saveness for datatypes with different length
  679. UA_Byte dstByte = 0;
  680. UA_UInt16 dstUInt16 = 0;
  681. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingByte));
  682. switch (dst->encodingByte & UA_NODEIDTYPE_MASK) {
  683. case UA_NODEIDTYPE_TWOBYTE: // Table 7
  684. retval |=UA_Byte_decodeBinary(src, pos, &dstByte);
  685. dst->identifier.numeric = dstByte;
  686. dst->namespace = 0; // default namespace
  687. break;
  688. case UA_NODEIDTYPE_FOURBYTE: // Table 8
  689. retval |=UA_Byte_decodeBinary(src, pos, &dstByte);
  690. dst->namespace= dstByte;
  691. retval |=UA_UInt16_decodeBinary(src, pos, &dstUInt16);
  692. dst->identifier.numeric = dstUInt16;
  693. break;
  694. case UA_NODEIDTYPE_NUMERIC: // Table 6, first entry
  695. retval |=UA_UInt16_decodeBinary(src,pos,&(dst->namespace));
  696. retval |=UA_UInt32_decodeBinary(src,pos,&(dst->identifier.numeric));
  697. break;
  698. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  699. retval |=UA_UInt16_decodeBinary(src,pos,&(dst->namespace));
  700. retval |=UA_String_decodeBinary(src,pos,&(dst->identifier.string));
  701. break;
  702. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  703. retval |=UA_UInt16_decodeBinary(src,pos,&(dst->namespace));
  704. retval |=UA_Guid_decodeBinary(src,pos,&(dst->identifier.guid));
  705. break;
  706. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  707. retval |=UA_UInt16_decodeBinary(src,pos,&(dst->namespace));
  708. retval |=UA_ByteString_decodeBinary(src,pos,&(dst->identifier.byteString));
  709. break;
  710. }
  711. return retval;
  712. }
  713. UA_TYPE_METHOD_DELETE_STRUCT(UA_NodeId)
  714. UA_Int32 UA_NodeId_deleteMembers(UA_NodeId* p) {
  715. int retval = UA_SUCCESS;
  716. switch (p->encodingByte & UA_NODEIDTYPE_MASK) {
  717. case UA_NODEIDTYPE_TWOBYTE:
  718. case UA_NODEIDTYPE_FOURBYTE:
  719. case UA_NODEIDTYPE_NUMERIC:
  720. // nothing to do
  721. break;
  722. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  723. retval |= UA_String_deleteMembers(&(p->identifier.string));
  724. break;
  725. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  726. retval |= UA_Guid_deleteMembers(&(p->identifier.guid));
  727. break;
  728. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  729. retval |= UA_ByteString_deleteMembers(&(p->identifier.byteString));
  730. break;
  731. }
  732. return retval;
  733. }
  734. void UA_NodeId_printf(char* label, const UA_NodeId* node) {
  735. int l;
  736. printf("%s {encodingByte=%d, namespace=%d,", label,
  737. (int)( node->encodingByte), (int) (node->namespace));
  738. switch (node->encodingByte & UA_NODEIDTYPE_MASK) {
  739. case UA_NODEIDTYPE_TWOBYTE:
  740. case UA_NODEIDTYPE_FOURBYTE:
  741. case UA_NODEIDTYPE_NUMERIC:
  742. printf("identifier=%d\n", node->identifier.numeric);
  743. break;
  744. case UA_NODEIDTYPE_STRING:
  745. l = ( node->identifier.string.length < 0 ) ? 0 : node->identifier.string.length;
  746. printf("identifier={length=%d, data=%.*s}",
  747. node->identifier.string.length, l,
  748. (char*) (node->identifier.string.data));
  749. break;
  750. case UA_NODEIDTYPE_BYTESTRING:
  751. l = ( node->identifier.byteString.length < 0 ) ? 0 : node->identifier.byteString.length;
  752. printf("identifier={Length=%d, data=%.*s}",
  753. node->identifier.byteString.length, l,
  754. (char*) (node->identifier.byteString.data));
  755. break;
  756. case UA_NODEIDTYPE_GUID:
  757. printf(
  758. "guid={data1=%d, data2=%d, data3=%d, data4={length=%d, data=%.*s}}",
  759. node->identifier.guid.data1, node->identifier.guid.data2,
  760. node->identifier.guid.data3, 8,
  761. 8,
  762. (char*) (node->identifier.guid.data4));
  763. break;
  764. default:
  765. printf("ups! shit happens");
  766. break;
  767. }
  768. printf("}\n");
  769. }
  770. UA_Int32 UA_NodeId_compare(const UA_NodeId *n1, const UA_NodeId *n2) {
  771. if (n1->encodingByte != n2->encodingByte || n1->namespace != n2->namespace)
  772. return FALSE;
  773. switch (n1->encodingByte & UA_NODEIDTYPE_MASK) {
  774. case UA_NODEIDTYPE_TWOBYTE:
  775. case UA_NODEIDTYPE_FOURBYTE:
  776. case UA_NODEIDTYPE_NUMERIC:
  777. if(n1->identifier.numeric == n2->identifier.numeric)
  778. return UA_EQUAL;
  779. else
  780. return UA_NOT_EQUAL;
  781. case UA_NODEIDTYPE_STRING:
  782. return UA_String_compare(&(n1->identifier.string), &(n2->identifier.string));
  783. case UA_NODEIDTYPE_GUID:
  784. return UA_Guid_compare(&(n1->identifier.guid), &(n2->identifier.guid));
  785. case UA_NODEIDTYPE_BYTESTRING:
  786. return UA_ByteString_compare(&(n1->identifier.byteString), &(n2->identifier.byteString));
  787. }
  788. return UA_NOT_EQUAL;
  789. }
  790. UA_Int32 UA_NodeId_init(UA_NodeId* p){
  791. if(p==UA_NULL)return UA_ERROR;
  792. p->encodingByte = UA_NODEIDTYPE_TWOBYTE;
  793. p->namespace = 0;
  794. memset(&(p->identifier),0,sizeof(p->identifier));
  795. return UA_SUCCESS;
  796. }
  797. UA_TYPE_METHOD_NEW_DEFAULT(UA_NodeId)
  798. UA_Int32 UA_ExpandedNodeId_calcSize(UA_ExpandedNodeId const * p) {
  799. UA_Int32 length = 0;
  800. if (p == UA_NULL) {
  801. length = sizeof(UA_ExpandedNodeId);
  802. } else {
  803. length = UA_NodeId_calcSize(&(p->nodeId));
  804. if (p->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  805. length += UA_String_calcSize(&(p->namespaceUri)); //p->namespaceUri
  806. }
  807. if (p->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  808. length += sizeof(UA_UInt32); //p->serverIndex
  809. }
  810. }
  811. return length;
  812. }
  813. UA_TYPE_START_ENCODEBINARY(UA_ExpandedNodeId)
  814. retval |= UA_NodeId_encodeBinary(&(src->nodeId),pos,dst);
  815. if (src->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  816. retval |= UA_String_encodeBinary(&(src->namespaceUri),pos,dst);
  817. }
  818. if (src->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  819. retval |= UA_UInt32_encodeBinary(&(src->serverIndex),pos,dst);
  820. }
  821. UA_TYPE_END_XXCODEBINARY
  822. UA_Int32 UA_ExpandedNodeId_decodeBinary(UA_ByteString const * src, UA_Int32* pos,
  823. UA_ExpandedNodeId *dst) {
  824. UA_UInt32 retval = UA_SUCCESS;
  825. retval |= UA_NodeId_decodeBinary(src,pos,&(dst->nodeId));
  826. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_NAMESPACE_URI_FLAG) {
  827. dst->nodeId.namespace = 0;
  828. retval |= UA_String_decodeBinary(src,pos,&(dst->namespaceUri));
  829. } else {
  830. retval |= UA_String_copy(&UA_String_null, &(dst->namespaceUri));
  831. }
  832. if (dst->nodeId.encodingByte & UA_NODEIDTYPE_SERVERINDEX_FLAG) {
  833. retval |= UA_UInt32_decodeBinary(src,pos,&(dst->serverIndex));
  834. }
  835. return retval;
  836. }
  837. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExpandedNodeId)
  838. UA_Int32 UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId* p) {
  839. UA_Int32 retval = UA_SUCCESS;
  840. retval |= UA_NodeId_deleteMembers(&(p->nodeId));
  841. retval |= UA_String_deleteMembers(&(p->namespaceUri));
  842. return retval;
  843. }
  844. UA_Int32 UA_ExpandedNodeId_init(UA_ExpandedNodeId* p){
  845. if(p==UA_NULL)return UA_ERROR;
  846. UA_NodeId_init(&(p->nodeId));
  847. UA_String_init(&(p->namespaceUri));
  848. p->serverIndex = 0;
  849. return UA_SUCCESS;
  850. }
  851. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExpandedNodeId)
  852. UA_Int32 UA_ExtensionObject_calcSize(UA_ExtensionObject const * p) {
  853. UA_Int32 length = 0;
  854. if (p == UA_NULL) {
  855. length = sizeof(UA_ExtensionObject);
  856. } else {
  857. length += UA_NodeId_calcSize(&(p->typeId));
  858. length += 1; //p->encoding
  859. switch (p->encoding) {
  860. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  861. length += UA_ByteString_calcSize(&(p->body));
  862. break;
  863. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  864. length += UA_XmlElement_calcSize((UA_XmlElement*)&(p->body));
  865. break;
  866. }
  867. }
  868. return length;
  869. }
  870. UA_TYPE_START_ENCODEBINARY(UA_ExtensionObject)
  871. retval |= UA_NodeId_encodeBinary(&(src->typeId),pos,dst);
  872. retval |= UA_Byte_encodeBinary(&(src->encoding),pos,dst);
  873. switch (src->encoding) {
  874. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  875. break;
  876. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  877. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  878. retval |= UA_ByteString_encodeBinary(&(src->body),pos,dst);
  879. break;
  880. }
  881. UA_TYPE_END_XXCODEBINARY
  882. UA_Int32 UA_ExtensionObject_decodeBinary(UA_ByteString const * src, UA_Int32 *pos,
  883. UA_ExtensionObject *dst) {
  884. UA_Int32 retval = UA_SUCCESS;
  885. retval |= UA_NodeId_decodeBinary(src,pos,&(dst->typeId));
  886. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encoding));
  887. retval |= UA_String_copy(&UA_String_null, (UA_String*) &(dst->body));
  888. switch (dst->encoding) {
  889. case UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED:
  890. break;
  891. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING:
  892. case UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML:
  893. retval |= UA_ByteString_decodeBinary(src,pos,&(dst->body));
  894. break;
  895. }
  896. return retval;
  897. }
  898. UA_TYPE_METHOD_DELETE_STRUCT(UA_ExtensionObject)
  899. UA_Int32 UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  900. UA_Int32 retval = UA_SUCCESS;
  901. retval |= UA_NodeId_deleteMembers(&(p->typeId));
  902. retval |= UA_ByteString_deleteMembers(&(p->body));
  903. return retval;
  904. }
  905. UA_Int32 UA_ExtensionObject_init(UA_ExtensionObject* p){
  906. if(p==UA_NULL)return UA_ERROR;
  907. UA_ByteString_init(&(p->body));
  908. p->encoding = 0;
  909. UA_NodeId_init(&(p->typeId));
  910. return UA_SUCCESS;
  911. }
  912. UA_TYPE_METHOD_NEW_DEFAULT(UA_ExtensionObject)
  913. /** DiagnosticInfo - Part: 4, Chapter: 7.9, Page: 116 */
  914. UA_Int32 UA_DiagnosticInfo_calcSize(UA_DiagnosticInfo const * ptr) {
  915. UA_Int32 length = 0;
  916. if (ptr == UA_NULL) {
  917. length = sizeof(UA_DiagnosticInfo);
  918. } else {
  919. UA_Byte mask;
  920. length += sizeof(UA_Byte); // EncodingMask
  921. for (mask = 0x01; mask <= 0x40; mask *= 2) {
  922. switch (mask & (ptr->encodingMask)) {
  923. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  924. // puts("diagnosticInfo symbolic id");
  925. length += sizeof(UA_Int32);
  926. break;
  927. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  928. length += sizeof(UA_Int32);
  929. break;
  930. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  931. length += sizeof(UA_Int32);
  932. break;
  933. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  934. length += sizeof(UA_Int32);
  935. break;
  936. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  937. length += UA_String_calcSize(&(ptr->additionalInfo));
  938. break;
  939. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  940. length += sizeof(UA_StatusCode);
  941. break;
  942. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  943. length += UA_DiagnosticInfo_calcSize(ptr->innerDiagnosticInfo);
  944. break;
  945. }
  946. }
  947. }
  948. return length;
  949. }
  950. UA_Int32 UA_DiagnosticInfo_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_DiagnosticInfo *dst) {
  951. UA_Int32 retval = UA_SUCCESS;
  952. int i;
  953. retval |= UA_Byte_decodeBinary(src, pos, &(dst->encodingMask));
  954. for (i = 0; i < 7; i++) {
  955. switch ( (0x01 << i) & dst->encodingMask) {
  956. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  957. retval |= UA_Int32_decodeBinary(src, pos, &(dst->symbolicId));
  958. break;
  959. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  960. retval |= UA_Int32_decodeBinary(src, pos, &(dst->namespaceUri));
  961. break;
  962. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  963. retval |= UA_Int32_decodeBinary(src, pos, &(dst->localizedText));
  964. break;
  965. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  966. retval |= UA_Int32_decodeBinary(src, pos, &(dst->locale));
  967. break;
  968. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  969. retval |= UA_String_decodeBinary(src, pos, &(dst->additionalInfo));
  970. break;
  971. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  972. retval |= UA_StatusCode_decodeBinary(src, pos, &(dst->innerStatusCode));
  973. break;
  974. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  975. // innerDiagnosticInfo is a pointer to struct, therefore allocate
  976. retval |= UA_alloc((void **) &(dst->innerDiagnosticInfo),UA_DiagnosticInfo_calcSize(UA_NULL));
  977. retval |= UA_DiagnosticInfo_decodeBinary(src, pos, dst->innerDiagnosticInfo);
  978. break;
  979. }
  980. }
  981. return retval;
  982. }
  983. UA_TYPE_START_ENCODEBINARY(UA_DiagnosticInfo)
  984. int i;
  985. retval |= UA_Byte_encodeBinary(&(src->encodingMask), pos, dst);
  986. for (i = 0; i < 7; i++) {
  987. switch ( (0x01 << i) & src->encodingMask) {
  988. case UA_DIAGNOSTICINFO_ENCODINGMASK_SYMBOLICID:
  989. retval |= UA_Int32_encodeBinary(&(src->symbolicId), pos, dst);
  990. break;
  991. case UA_DIAGNOSTICINFO_ENCODINGMASK_NAMESPACE:
  992. retval |= UA_Int32_encodeBinary( &(src->namespaceUri), pos, dst);
  993. break;
  994. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALIZEDTEXT:
  995. retval |= UA_Int32_encodeBinary(&(src->localizedText), pos, dst);
  996. break;
  997. case UA_DIAGNOSTICINFO_ENCODINGMASK_LOCALE:
  998. retval |= UA_Int32_encodeBinary(&(src->locale), pos, dst);
  999. break;
  1000. case UA_DIAGNOSTICINFO_ENCODINGMASK_ADDITIONALINFO:
  1001. retval |= UA_String_encodeBinary(&(src->additionalInfo), pos, dst);
  1002. break;
  1003. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERSTATUSCODE:
  1004. retval |= UA_StatusCode_encodeBinary(&(src->innerStatusCode), pos, dst);
  1005. break;
  1006. case UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO:
  1007. retval |= UA_DiagnosticInfo_encodeBinary(src->innerDiagnosticInfo, pos, dst);
  1008. break;
  1009. }
  1010. }
  1011. UA_TYPE_END_XXCODEBINARY
  1012. UA_TYPE_METHOD_DELETE_STRUCT(UA_DiagnosticInfo)
  1013. UA_Int32 UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  1014. UA_Int32 retval = UA_SUCCESS;
  1015. if (p->encodingMask & UA_DIAGNOSTICINFO_ENCODINGMASK_INNERDIAGNOSTICINFO) {
  1016. retval |= UA_DiagnosticInfo_deleteMembers(p->innerDiagnosticInfo);
  1017. retval |= UA_free(p->innerDiagnosticInfo);
  1018. }
  1019. return retval;
  1020. }
  1021. UA_Int32 UA_DiagnosticInfo_init(UA_DiagnosticInfo* p){
  1022. if(p==UA_NULL)return UA_ERROR;
  1023. UA_String_init(&(p->additionalInfo));
  1024. p->encodingMask = 0;
  1025. p->innerDiagnosticInfo = UA_NULL;
  1026. UA_StatusCode_init(&(p->innerStatusCode));
  1027. p->locale = 0;
  1028. p->localizedText = 0;
  1029. p->namespaceUri = 0;
  1030. p->symbolicId = 0;
  1031. return UA_SUCCESS;
  1032. }
  1033. UA_TYPE_METHOD_NEW_DEFAULT(UA_DiagnosticInfo)
  1034. UA_TYPE_METHOD_PROTOTYPES_AS(UA_DateTime,UA_Int64)
  1035. UA_TYPE_METHOD_NEW_DEFAULT(UA_DateTime)
  1036. #include <sys/time.h>
  1037. // Number of seconds from 1 Jan. 1601 00:00 to 1 Jan 1970 00:00 UTC
  1038. #define FILETIME_UNIXTIME_BIAS_SEC 11644473600LL
  1039. // Factors
  1040. #define HUNDRED_NANOSEC_PER_USEC 10LL
  1041. #define HUNDRED_NANOSEC_PER_SEC (HUNDRED_NANOSEC_PER_USEC * 1000000LL)
  1042. // IEC 62541-6 §5.2.2.5 A DateTime value shall be encoded as a 64-bit signed integer
  1043. // which represents the number of 100 nanosecond intervals since January 1, 1601 (UTC).
  1044. UA_DateTime UA_DateTime_now() {
  1045. UA_DateTime dateTime;
  1046. struct timeval tv;
  1047. gettimeofday(&tv, UA_NULL);
  1048. dateTime = (tv.tv_sec + FILETIME_UNIXTIME_BIAS_SEC)
  1049. * HUNDRED_NANOSEC_PER_SEC + tv.tv_usec * HUNDRED_NANOSEC_PER_USEC;
  1050. return dateTime;
  1051. }
  1052. //toDo
  1053. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime time){
  1054. UA_DateTimeStruct dateTimeStruct;
  1055. //calcualting the the milli-, micro- and nanoseconds
  1056. UA_DateTime timeTemp;
  1057. timeTemp = (time-((time/10)*10))*100; //getting the last digit -> *100 for the 100 nanaseconds resolution
  1058. dateTimeStruct.nanoSec = timeTemp; //123 456 7 -> 700 nanosec;
  1059. timeTemp = (time-((time/10000)*10000))/10;
  1060. dateTimeStruct.microSec = timeTemp; //123 456 7 -> 456 microsec
  1061. timeTemp = (time-((time/10000000)*10000000))/10000;
  1062. dateTimeStruct.milliSec = timeTemp; //123 456 7 -> 123 millisec
  1063. //calculating the unix time with #include <time.h>
  1064. time_t timeInSec = time/10000000; //converting the nanoseconds time in unixtime
  1065. struct tm ts;
  1066. ts = *gmtime(&timeInSec);
  1067. //strftime(buf, sizeof(buf), "%a %Y-%m-%d %H:%M:%S %Z", &ts);
  1068. //printf("%s\n", buf);
  1069. dateTimeStruct.sec = ts.tm_sec;
  1070. dateTimeStruct.min = ts.tm_min;
  1071. dateTimeStruct.hour = ts.tm_hour;
  1072. dateTimeStruct.day = ts.tm_mday;
  1073. dateTimeStruct.mounth = ts.tm_mon+1;
  1074. dateTimeStruct.year = ts.tm_year + 1900;
  1075. return dateTimeStruct;
  1076. }
  1077. UA_Int32 UA_DateTime_toString(UA_DateTime time, UA_String* timeString){
  1078. char *charBuf = (char*)(*timeString).data;
  1079. UA_DateTimeStruct tSt = UA_DateTime_toStruct(time);
  1080. 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);
  1081. return UA_SUCCESS;
  1082. }
  1083. UA_TYPE_METHOD_PROTOTYPES_AS(UA_XmlElement, UA_ByteString)
  1084. UA_TYPE_METHOD_NEW_DEFAULT(UA_XmlElement)
  1085. /** IntegerId - Part: 4, Chapter: 7.13, Page: 118 */
  1086. UA_TYPE_METHOD_PROTOTYPES_AS(UA_IntegerId, UA_Int32)
  1087. UA_TYPE_METHOD_NEW_DEFAULT(UA_IntegerId)
  1088. UA_TYPE_METHOD_PROTOTYPES_AS(UA_StatusCode, UA_UInt32)
  1089. UA_TYPE_METHOD_NEW_DEFAULT(UA_StatusCode)
  1090. /** QualifiedName - Part 4, Chapter
  1091. * but see Part 6, Chapter 5.2.2.13 for Binary Encoding
  1092. */
  1093. UA_Int32 UA_QualifiedName_calcSize(UA_QualifiedName const * p) {
  1094. UA_Int32 length = 0;
  1095. if (p == NULL) return sizeof(UA_QualifiedName);
  1096. length += sizeof(UA_UInt16); //qualifiedName->namespaceIndex
  1097. // length += sizeof(UA_UInt16); //qualifiedName->reserved
  1098. length += UA_String_calcSize(&(p->name)); //qualifiedName->name
  1099. return length;
  1100. }
  1101. UA_Int32 UA_QualifiedName_decodeBinary(UA_ByteString const * src, UA_Int32 *pos,
  1102. UA_QualifiedName *dst) {
  1103. UA_Int32 retval = UA_SUCCESS;
  1104. retval |= UA_UInt16_decodeBinary(src,pos,&(dst->namespaceIndex));
  1105. //retval |= UA_UInt16_decodeBinary(src,pos,&(dst->reserved));
  1106. retval |= UA_String_decodeBinary(src,pos,&(dst->name));
  1107. return retval;
  1108. }
  1109. UA_TYPE_START_ENCODEBINARY(UA_QualifiedName)
  1110. retval |= UA_UInt16_encodeBinary(&(src->namespaceIndex),pos,dst);
  1111. //retval |= UA_UInt16_encodeBinary(&(src->reserved),pos,dst);
  1112. retval |= UA_String_encodeBinary(&(src->name),pos,dst);
  1113. UA_TYPE_END_XXCODEBINARY
  1114. UA_Int32 UA_QualifiedName_delete(UA_QualifiedName * p) {
  1115. UA_Int32 retval = UA_SUCCESS;
  1116. retval |= UA_QualifiedName_deleteMembers(p);
  1117. retval |= UA_free(p);
  1118. return retval;
  1119. }
  1120. UA_Int32 UA_QualifiedName_deleteMembers(UA_QualifiedName * p) {
  1121. UA_Int32 retval = UA_SUCCESS;
  1122. retval |= UA_String_deleteMembers(&(p->name));
  1123. return retval;
  1124. }
  1125. UA_Int32 UA_QualifiedName_init(UA_QualifiedName * p){
  1126. if(p==UA_NULL)return UA_ERROR;
  1127. UA_String_init(&(p->name));
  1128. p->namespaceIndex=0;
  1129. p->reserved=0;
  1130. return UA_SUCCESS;
  1131. }
  1132. UA_TYPE_METHOD_NEW_DEFAULT(UA_QualifiedName)
  1133. UA_Int32 UA_Variant_calcSize(UA_Variant const * p) {
  1134. UA_Int32 length = 0;
  1135. if (p == UA_NULL) return sizeof(UA_Variant);
  1136. UA_UInt32 ns0Id = p->encodingMask & 0x1F; // Bits 1-5
  1137. UA_Boolean isArray = p->encodingMask & (0x01 << 7); // Bit 7
  1138. UA_Boolean hasDimensions = p->encodingMask & (0x01 << 6); // Bit 6
  1139. int i;
  1140. if (p->vt == UA_NULL || ns0Id != p->vt->Id) {
  1141. return UA_ERR_INCONSISTENT;
  1142. }
  1143. length += sizeof(UA_Byte); //p->encodingMask
  1144. if (isArray) { // array length is encoded
  1145. length += sizeof(UA_Int32); //p->arrayLength
  1146. if (p->arrayLength > 0) {
  1147. // TODO: add suggestions of @jfpr to not iterate over arrays with fixed len elements
  1148. // FIXME: the concept of calcSize delivering the storageSize given an UA_Null argument
  1149. // fails for arrays with null-ptrs, see test case
  1150. // UA_Variant_calcSizeVariableSizeArrayWithNullPtrWillReturnWrongEncodingSize
  1151. // Simply do not allow?
  1152. for (i=0;i<p->arrayLength;i++) {
  1153. length += p->vt->calcSize(p->data[i]);
  1154. }
  1155. }
  1156. } else { //single value to encode
  1157. if (p->data == UA_NULL) {
  1158. if (p->vt->Id != UA_INVALIDTYPE_NS0) {
  1159. length += p->vt->calcSize(UA_NULL);
  1160. } else {
  1161. length += 0;
  1162. }
  1163. } else {
  1164. length += p->vt->calcSize(p->data[0]);
  1165. }
  1166. }
  1167. if (hasDimensions) {
  1168. //ToDo: tobeInsert: length += the calcSize for dimensions
  1169. }
  1170. return length;
  1171. }
  1172. UA_TYPE_START_ENCODEBINARY(UA_Variant)
  1173. int i = 0;
  1174. if (src->vt == UA_NULL || ( src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK) != src->vt->Id) {
  1175. return UA_ERR_INCONSISTENT;
  1176. }
  1177. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1178. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // encode array length
  1179. retval |= UA_Int32_encodeBinary(&(src->arrayLength),pos,dst);
  1180. }
  1181. if (src->arrayLength > 0) {
  1182. //encode array as given by variant type
  1183. for (i=0;i<src->arrayLength;i++) {
  1184. retval |= src->vt->encodeBinary(src->data[i],pos,dst);
  1185. }
  1186. } else {
  1187. if (src->data == UA_NULL) {
  1188. if (src->vt->Id == UA_INVALIDTYPE_NS0) {
  1189. retval = UA_SUCCESS;
  1190. } else {
  1191. retval = UA_ERR_NO_MEMORY;
  1192. }
  1193. } else {
  1194. retval |= src->vt->encodeBinary(src->data[i],pos,dst);
  1195. }
  1196. }
  1197. if (src->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // encode array dimension field
  1198. // FIXME: encode array dimension field
  1199. printf("shit happens - encode array dimension field wanted");
  1200. }
  1201. UA_TYPE_END_XXCODEBINARY
  1202. UA_Int32 UA_Variant_decodeBinary(UA_ByteString const * src, UA_Int32 *pos, UA_Variant *dst) {
  1203. UA_Int32 retval = UA_SUCCESS;
  1204. UA_Int32 ns0Id, uaIdx;
  1205. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingMask));
  1206. ns0Id = dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_TYPEID_MASK;
  1207. // initialize vTable
  1208. if ((uaIdx = UA_toIndex(ns0Id)) < 0) {
  1209. return uaIdx;
  1210. } else {
  1211. dst->vt = &UA_[uaIdx];
  1212. }
  1213. // get size of array
  1214. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_ARRAY) { // encode array length
  1215. retval |= UA_Int32_decodeBinary(src,pos,&(dst->arrayLength));
  1216. } else {
  1217. dst->arrayLength = 1;
  1218. }
  1219. if (retval == UA_SUCCESS) {
  1220. if (ns0Id == UA_INVALIDTYPE_NS0) { // handle NULL-Variant !
  1221. dst->data = UA_NULL;
  1222. dst->arrayLength = -1;
  1223. } else {
  1224. // allocate array and decode
  1225. retval |= UA_Array_new((void**)&(dst->data),dst->arrayLength,UA_toIndex(ns0Id));
  1226. retval |= UA_Array_decodeBinary(src,dst->arrayLength,UA_toIndex(ns0Id),pos,dst->data);
  1227. }
  1228. }
  1229. if (dst->encodingMask & UA_VARIANT_ENCODINGMASKTYPE_DIMENSIONS) {
  1230. // TODO: decode array dimension field
  1231. printf("shit happens - decode array dimension field wanted");
  1232. }
  1233. return retval;
  1234. }
  1235. UA_TYPE_METHOD_DELETE_STRUCT(UA_Variant)
  1236. UA_Int32 UA_Variant_deleteMembers(UA_Variant * p) {
  1237. UA_Int32 retval = UA_SUCCESS;
  1238. retval |= UA_Array_delete(p->data,p->arrayLength,UA_toIndex(p->vt->Id));
  1239. return retval;
  1240. }
  1241. UA_Int32 UA_Variant_init(UA_Variant * p){
  1242. if(p==UA_NULL)return UA_ERROR;
  1243. p->arrayLength = -1; // no element, p->data == UA_NULL
  1244. p->data = UA_NULL;
  1245. p->encodingMask = 0;
  1246. p->vt = &UA_[UA_INVALIDTYPE];
  1247. return UA_SUCCESS;
  1248. }
  1249. UA_TYPE_METHOD_NEW_DEFAULT(UA_Variant)
  1250. //TODO: place this define at the server configuration
  1251. #define MAX_PICO_SECONDS 1000
  1252. UA_Int32 UA_DataValue_decodeBinary(UA_ByteString const * src, UA_Int32* pos, UA_DataValue* dst) {
  1253. UA_Int32 retval = UA_SUCCESS;
  1254. retval |= UA_Byte_decodeBinary(src,pos,&(dst->encodingMask));
  1255. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1256. retval |= UA_Variant_decodeBinary(src,pos,&(dst->value));
  1257. }
  1258. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1259. retval |= UA_StatusCode_decodeBinary(src,pos,&(dst->status));
  1260. }
  1261. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1262. retval |= UA_DateTime_decodeBinary(src,pos,&(dst->sourceTimestamp));
  1263. }
  1264. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1265. retval |= UA_Int16_decodeBinary(src,pos,&(dst->sourcePicoseconds));
  1266. if (dst->sourcePicoseconds > MAX_PICO_SECONDS) {
  1267. dst->sourcePicoseconds = MAX_PICO_SECONDS;
  1268. }
  1269. }
  1270. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1271. retval |= UA_DateTime_decodeBinary(src,pos,&(dst->serverTimestamp));
  1272. }
  1273. if (dst->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1274. retval |= UA_Int16_decodeBinary(src,pos,&(dst->serverPicoseconds));
  1275. if (dst->serverPicoseconds > MAX_PICO_SECONDS) {
  1276. dst->serverPicoseconds = MAX_PICO_SECONDS;
  1277. }
  1278. }
  1279. return retval;
  1280. }
  1281. UA_TYPE_START_ENCODEBINARY(UA_DataValue)
  1282. retval |= UA_Byte_encodeBinary(&(src->encodingMask),pos,dst);
  1283. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1284. retval |= UA_Variant_encodeBinary(&(src->value),pos,dst);
  1285. }
  1286. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1287. retval |= UA_StatusCode_encodeBinary(&(src->status),pos,dst);
  1288. }
  1289. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1290. retval |= UA_DateTime_encodeBinary(&(src->sourceTimestamp),pos,dst);
  1291. }
  1292. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1293. retval |= UA_Int16_encodeBinary(&(src->sourcePicoseconds),pos,dst);
  1294. }
  1295. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1296. retval |= UA_DateTime_encodeBinary(&(src->serverTimestamp),pos,dst);
  1297. }
  1298. if (src->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1299. retval |= UA_Int16_encodeBinary(&(src->serverPicoseconds),pos,dst);
  1300. }
  1301. UA_TYPE_END_XXCODEBINARY
  1302. UA_Int32 UA_DataValue_calcSize(UA_DataValue const * p) {
  1303. UA_Int32 length = 0;
  1304. if (p == UA_NULL) { // get static storage size
  1305. length = sizeof(UA_DataValue);
  1306. } else { // get decoding size
  1307. length = sizeof(UA_Byte);
  1308. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_VARIANT) {
  1309. length += UA_Variant_calcSize(&(p->value));
  1310. }
  1311. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_STATUSCODE) {
  1312. length += sizeof(UA_UInt32); //dataValue->status
  1313. }
  1314. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCETIMESTAMP) {
  1315. length += sizeof(UA_DateTime); //dataValue->sourceTimestamp
  1316. }
  1317. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SOURCEPICOSECONDS) {
  1318. length += sizeof(UA_Int64); //dataValue->sourcePicoseconds
  1319. }
  1320. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERTIMESTAMP) {
  1321. length += sizeof(UA_DateTime); //dataValue->serverTimestamp
  1322. }
  1323. if (p->encodingMask & UA_DATAVALUE_ENCODINGMASK_SERVERPICOSECONDS) {
  1324. length += sizeof(UA_Int64); //dataValue->serverPicoseconds
  1325. }
  1326. }
  1327. return length;
  1328. }
  1329. UA_TYPE_METHOD_DELETE_STRUCT(UA_DataValue)
  1330. UA_Int32 UA_DataValue_deleteMembers(UA_DataValue * p) {
  1331. UA_Int32 retval = UA_SUCCESS;
  1332. UA_Variant_deleteMembers(&(p->value));
  1333. return retval;
  1334. }
  1335. UA_Int32 UA_DataValue_init(UA_DataValue * p){
  1336. if(p==UA_NULL)return UA_ERROR;
  1337. p->encodingMask = 0;
  1338. p->serverPicoseconds = 0;
  1339. UA_DateTime_init(&(p->serverTimestamp));
  1340. p->sourcePicoseconds = 0;
  1341. UA_DateTime_init(&(p->sourceTimestamp));
  1342. UA_StatusCode_init(&(p->status));
  1343. UA_Variant_init(&(p->value));
  1344. return UA_SUCCESS;
  1345. }
  1346. UA_TYPE_METHOD_NEW_DEFAULT(UA_DataValue)
  1347. /* UA_InvalidType - internal type necessary to handle inited Variants correctly */
  1348. UA_Int32 UA_InvalidType_calcSize(UA_InvalidType const * p) {
  1349. return 0;
  1350. }
  1351. UA_TYPE_START_ENCODEBINARY(UA_InvalidType)
  1352. retval = UA_ERR_INVALID_VALUE;
  1353. UA_TYPE_END_XXCODEBINARY
  1354. UA_TYPE_START_DECODEBINARY(UA_InvalidType)
  1355. retval = UA_ERR_INVALID_VALUE;
  1356. UA_TYPE_END_XXCODEBINARY
  1357. UA_Int32 UA_InvalidType_free(UA_InvalidType* p) {
  1358. return UA_ERR_INVALID_VALUE;
  1359. }
  1360. UA_Int32 UA_InvalidType_delete(UA_InvalidType* p) {
  1361. return UA_ERR_INVALID_VALUE;
  1362. }
  1363. UA_Int32 UA_InvalidType_deleteMembers(UA_InvalidType* p) {
  1364. return UA_ERR_INVALID_VALUE;
  1365. }
  1366. UA_Int32 UA_InvalidType_init(UA_InvalidType* p) {
  1367. return UA_ERR_INVALID_VALUE;
  1368. }
  1369. UA_Int32 UA_InvalidType_new(UA_InvalidType** p) {
  1370. return UA_ERR_INVALID_VALUE;
  1371. }