generateSam.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  1. /*
  2. * xml2ns0.c
  3. *
  4. * Created on: 21.04.2014
  5. * Author: mrt
  6. */
  7. #include "ua_xml.h"
  8. #include <fcntl.h>
  9. void sam_declareAttribute(UA_Node const * node) {
  10. if (node->nodeClass == UA_NODECLASS_VARIABLE) {
  11. UA_VariableNode* vn = (UA_VariableNode*) node;
  12. // printf("\t%s %*.s;\n", vn->value.vt->name, node->browseName.name.length, node->browseName.name.data);
  13. printf("\t%s %s;\n", vn->value.vt->name, node->browseName.name.data);
  14. }
  15. }
  16. void sam_declareBuffer(UA_Node const * node) {
  17. if (node->nodeClass == UA_NODECLASS_VARIABLE) {
  18. UA_VariableNode* vn = (UA_VariableNode*) node;
  19. switch (vn->dataType.identifier.numeric) {
  20. case UA_BYTESTRING_NS0:
  21. case UA_STRING_NS0:
  22. case UA_LOCALIZEDTEXT_NS0:
  23. case UA_QUALIFIEDNAME_NS0:
  24. printf("\t UA_Byte cstr_%*.s[] = \"\"\n",vn->browseName.name.length, vn->browseName.name.data);
  25. break;
  26. default:
  27. break;
  28. }
  29. }
  30. }
  31. void sam_assignBuffer(UA_Node const * node) {
  32. if (node->nodeClass == UA_NODECLASS_VARIABLE) {
  33. UA_VariableNode* vn = (UA_VariableNode*) node;
  34. switch (vn->dataType.identifier.numeric) {
  35. case UA_BYTESTRING_NS0:
  36. case UA_STRING_NS0:
  37. printf("\tSAM_ASSIGN_CSTRING(cstr_%*.s,sam.%*.s);\n",vn->browseName.name.length, vn->browseName.name.data,vn->browseName.name.length, vn->browseName.name.data);
  38. break;
  39. case UA_LOCALIZEDTEXT_NS0:
  40. printf("\tSAM_ASSIGN_CSTRING(cstr_%*.s,sam.%*.stext);\n",vn->browseName.name.length, vn->browseName.name.data,vn->browseName.name.length, vn->browseName.name.data);
  41. break;
  42. case UA_QUALIFIEDNAME_NS0:
  43. printf("\tSAM_ASSIGN_CSTRING(cstr_%*.s,sam.%*.s.name);\n",vn->browseName.name.length, vn->browseName.name.data,vn->browseName.name.length, vn->browseName.name.data);
  44. break;
  45. default:
  46. break;
  47. }
  48. }
  49. }
  50. void sam_attachToNamespace(UA_Node const * node) {
  51. if (node->nodeClass == UA_NODECLASS_VARIABLE) {
  52. UA_VariableNode* vn = (UA_VariableNode*) node;
  53. printf("\tsam_attach(ns,%d,%s,&sam.%*.s);\n",node->nodeId.identifier.numeric,UA_[UA_ns0ToVTableIndex(vn->dataType.identifier.numeric)].name,node->browseName.name.length, node->browseName.name.data);
  54. }
  55. }
  56. typedef struct pattern {
  57. char* s;
  58. Namespace_nodeVisitor v;
  59. } pattern;
  60. pattern p[] = {
  61. { "#define SAM_ASSIGN_CSTRING(src,dst) do { dst.length = strlen(src)-1; dst.data = (UA_Byte*) src; } while(0)\n",UA_NULL },
  62. { "struct sam {\n", UA_NULL },
  63. { UA_NULL, sam_declareAttribute },
  64. { "} sam;\n", UA_NULL },
  65. { UA_NULL, sam_declareBuffer },
  66. { "void sam_init(Namespace* ns) {", UA_NULL },
  67. { UA_NULL, sam_assignBuffer },
  68. { UA_NULL, sam_attachToNamespace },
  69. { "}\n", UA_NULL },
  70. {UA_NULL, UA_NULL}
  71. };
  72. UA_Int16 UA_NodeId_getNamespace(UA_NodeId const * id) {
  73. return id->namespace;
  74. }
  75. // FIXME: to simple
  76. UA_Int16 UA_NodeId_getIdentifier(UA_NodeId const * id) {
  77. return id->identifier.numeric;
  78. }
  79. _Bool UA_NodeId_isBasicType(UA_NodeId const * id) {
  80. return (UA_NodeId_getNamespace(id) == 0) && (UA_NodeId_getIdentifier(id) <= UA_DIAGNOSTICINFO_NS0);
  81. }
  82. UA_Int32 Namespace_getNumberOfComponents(Namespace const * ns, UA_NodeId const * id, UA_Int32* number) {
  83. UA_Int32 retval = UA_SUCCESS;
  84. UA_Node const * node;
  85. if ((retval = Namespace_get(ns,id,&node,UA_NULL)) != UA_SUCCESS)
  86. return retval;
  87. if (node == UA_NULL)
  88. return UA_ERR_INVALID_VALUE;
  89. UA_Int32 i, n;
  90. for (i = 0, n = 0; i < node->referencesSize; i++ ) {
  91. if (node->references[i]->referenceTypeId.identifier.numeric == 47 && node->references[i]->isInverse != UA_TRUE) {
  92. n++;
  93. }
  94. }
  95. *number = n;
  96. return retval;
  97. }
  98. UA_Int32 Namespace_getComponent(Namespace const * ns, UA_NodeId const * id, UA_Int32 idx, UA_NodeId** result) {
  99. UA_Int32 retval = UA_SUCCESS;
  100. UA_Node const * node;
  101. if ((retval = Namespace_get(ns,id,&node,UA_NULL)) != UA_SUCCESS)
  102. return retval;
  103. UA_Int32 i, n;
  104. for (i = 0, n = 0; i < node->referencesSize; i++ ) {
  105. if (node->references[i]->referenceTypeId.identifier.numeric == 47 && node->references[i]->isInverse != UA_TRUE) {
  106. n++;
  107. if (n == idx) {
  108. *result = &(node->references[i]->targetId.nodeId);
  109. return retval;
  110. }
  111. }
  112. }
  113. return UA_ERR_INVALID_VALUE;
  114. }
  115. UA_Int32 UAX_NodeId_encodeBinaryByMetaData(Namespace const * ns, UA_NodeId const * id, UA_Int32* pos, UA_ByteString *dst) {
  116. UA_Int32 i, retval = UA_SUCCESS;
  117. if (UA_NodeId_isBasicType(id)) {
  118. UA_Node const * result;
  119. Namespace_Entry_Lock* lock;
  120. if ((retval = Namespace_get(ns,id,&result,&lock)) == UA_SUCCESS)
  121. UA_Variant_encodeBinary(&((UA_VariableNode *) result)->value,pos,dst);
  122. } else {
  123. UA_Int32 nComp = 0;
  124. if ((retval = Namespace_getNumberOfComponents(ns,id,&nComp)) == UA_SUCCESS) {
  125. for (i=0; i < nComp; i++) {
  126. UA_NodeId* comp = UA_NULL;
  127. Namespace_getComponent(ns,id,i,&comp);
  128. UAX_NodeId_encodeBinaryByMetaData(ns,comp, pos, dst);
  129. }
  130. }
  131. }
  132. return retval;
  133. }
  134. UA_Int32 UAX_NodeId_encodeBinary(Namespace const * ns, UA_NodeId const * id, UA_Int32* pos, UA_ByteString *dst) {
  135. UA_Int32 retval = UA_SUCCESS;
  136. UA_Node const * node;
  137. Namespace_Entry_Lock* lock;
  138. if ((retval = Namespace_get(ns,id,&node,&lock)) == UA_SUCCESS) {
  139. if (node->nodeClass == UA_NODECLASS_VARIABLE) {
  140. retval = UA_Variant_encodeBinary(&((UA_VariableNode*) node)->value,pos,dst);
  141. }
  142. Namespace_Entry_Lock_release(lock);
  143. }
  144. return retval;
  145. }
  146. int main(int argc, char** argv) {
  147. if (argc != 2) {
  148. printf("usage: %s filename\n",argv[0]);
  149. } else {
  150. int f = open(argv[1], O_RDONLY);
  151. if (f==-1) {
  152. perror("file not found");
  153. exit(-1);
  154. }
  155. char buf[1024];
  156. int len; /* len is the number of bytes in the current bufferful of data */
  157. XML_Stack s;
  158. XML_Stack_init(&s, "ROOT");
  159. UA_NodeSet n;
  160. UA_NodeSet_init(&n, 0);
  161. XML_Stack_addChildHandler(&s, "UANodeSet", strlen("UANodeSet"), (XML_decoder) UA_NodeSet_decodeXML, UA_INVALIDTYPE, &n);
  162. XML_Parser parser = XML_ParserCreate(NULL);
  163. XML_SetUserData(parser, &s);
  164. XML_SetElementHandler(parser, XML_Stack_startElement, XML_Stack_endElement);
  165. XML_SetCharacterDataHandler(parser, XML_Stack_handleText);
  166. while ((len = read(f, buf, 1024)) > 0) {
  167. if (!XML_Parse(parser, buf, len, (len < 1024))) {
  168. return 1;
  169. }
  170. }
  171. XML_ParserFree(parser);
  172. close(f);
  173. for (pattern* pi = &p[0]; pi->s != UA_NULL || pi->v != UA_NULL; ++pi) {
  174. if (pi->v) {
  175. Namespace_iterate(n.ns, pi->v);
  176. } else {
  177. printf("%s\n",pi->s);
  178. }
  179. }
  180. }
  181. return 0;
  182. }