summaryrefslogtreecommitdiff
path: root/xsd/cxx
diff options
context:
space:
mode:
Diffstat (limited to 'xsd/cxx')
-rw-r--r--xsd/cxx/elements.cxx1319
-rw-r--r--xsd/cxx/elements.hxx626
-rw-r--r--xsd/cxx/literal-map.cxx261
-rw-r--r--xsd/cxx/literal-map.hxx19
-rw-r--r--xsd/cxx/option-types.cxx47
-rw-r--r--xsd/cxx/option-types.hxx34
-rw-r--r--xsd/cxx/options.cli550
-rw-r--r--xsd/cxx/parser/attribute-validation-source.cxx412
-rw-r--r--xsd/cxx/parser/attribute-validation-source.hxx18
-rw-r--r--xsd/cxx/parser/characters-validation-source.cxx73
-rw-r--r--xsd/cxx/parser/characters-validation-source.hxx18
-rw-r--r--xsd/cxx/parser/driver-source.cxx775
-rw-r--r--xsd/cxx/parser/driver-source.hxx18
-rw-r--r--xsd/cxx/parser/element-validation-source.cxx1600
-rw-r--r--xsd/cxx/parser/element-validation-source.hxx18
-rw-r--r--xsd/cxx/parser/elements.cxx247
-rw-r--r--xsd/cxx/parser/elements.hxx315
-rw-r--r--xsd/cxx/parser/generator.cxx1099
-rw-r--r--xsd/cxx/parser/generator.hxx45
-rw-r--r--xsd/cxx/parser/impl-header.cxx232
-rw-r--r--xsd/cxx/parser/impl-header.hxx18
-rw-r--r--xsd/cxx/parser/impl-source.cxx384
-rw-r--r--xsd/cxx/parser/impl-source.hxx18
-rw-r--r--xsd/cxx/parser/name-processor.cxx1175
-rw-r--r--xsd/cxx/parser/name-processor.hxx30
-rw-r--r--xsd/cxx/parser/options.cli147
-rw-r--r--xsd/cxx/parser/parser-forward.cxx110
-rw-r--r--xsd/cxx/parser/parser-forward.hxx18
-rw-r--r--xsd/cxx/parser/parser-header.cxx1440
-rw-r--r--xsd/cxx/parser/parser-header.hxx18
-rw-r--r--xsd/cxx/parser/parser-inline.cxx399
-rw-r--r--xsd/cxx/parser/parser-inline.hxx18
-rw-r--r--xsd/cxx/parser/parser-source.cxx957
-rw-r--r--xsd/cxx/parser/parser-source.hxx18
-rw-r--r--xsd/cxx/parser/print-impl-common.hxx641
-rw-r--r--xsd/cxx/parser/state-processor.cxx319
-rw-r--r--xsd/cxx/parser/state-processor.hxx25
-rw-r--r--xsd/cxx/parser/type-processor.cxx347
-rw-r--r--xsd/cxx/parser/type-processor.hxx31
-rw-r--r--xsd/cxx/parser/validator.cxx718
-rw-r--r--xsd/cxx/parser/validator.hxx30
-rw-r--r--xsd/cxx/tree/counter.cxx260
-rw-r--r--xsd/cxx/tree/counter.hxx25
-rw-r--r--xsd/cxx/tree/default-value.cxx1273
-rw-r--r--xsd/cxx/tree/default-value.hxx355
-rw-r--r--xsd/cxx/tree/elements.cxx1409
-rw-r--r--xsd/cxx/tree/elements.hxx2118
-rw-r--r--xsd/cxx/tree/fundamental-header.hxx1335
-rw-r--r--xsd/cxx/tree/generator.cxx1227
-rw-r--r--xsd/cxx/tree/generator.hxx44
-rw-r--r--xsd/cxx/tree/name-processor.cxx2399
-rw-r--r--xsd/cxx/tree/name-processor.hxx28
-rw-r--r--xsd/cxx/tree/options.cli479
-rw-r--r--xsd/cxx/tree/order-processor.cxx243
-rw-r--r--xsd/cxx/tree/order-processor.hxx29
-rw-r--r--xsd/cxx/tree/parser-header.cxx472
-rw-r--r--xsd/cxx/tree/parser-header.hxx19
-rw-r--r--xsd/cxx/tree/parser-source.cxx541
-rw-r--r--xsd/cxx/tree/parser-source.hxx18
-rw-r--r--xsd/cxx/tree/polymorphism-processor.cxx740
-rw-r--r--xsd/cxx/tree/polymorphism-processor.hxx30
-rw-r--r--xsd/cxx/tree/serialization-header.cxx579
-rw-r--r--xsd/cxx/tree/serialization-header.hxx18
-rw-r--r--xsd/cxx/tree/serialization-source.cxx1468
-rw-r--r--xsd/cxx/tree/serialization-source.hxx18
-rw-r--r--xsd/cxx/tree/stream-extraction-source.cxx864
-rw-r--r--xsd/cxx/tree/stream-extraction-source.hxx18
-rw-r--r--xsd/cxx/tree/stream-header.cxx181
-rw-r--r--xsd/cxx/tree/stream-header.hxx18
-rw-r--r--xsd/cxx/tree/stream-insertion-header.cxx178
-rw-r--r--xsd/cxx/tree/stream-insertion-header.hxx18
-rw-r--r--xsd/cxx/tree/stream-insertion-source.cxx623
-rw-r--r--xsd/cxx/tree/stream-insertion-source.hxx18
-rw-r--r--xsd/cxx/tree/stream-source.cxx496
-rw-r--r--xsd/cxx/tree/stream-source.hxx18
-rw-r--r--xsd/cxx/tree/tree-forward.cxx325
-rw-r--r--xsd/cxx/tree/tree-forward.hxx18
-rw-r--r--xsd/cxx/tree/tree-header.cxx4299
-rw-r--r--xsd/cxx/tree/tree-header.hxx18
-rw-r--r--xsd/cxx/tree/tree-inline.cxx1161
-rw-r--r--xsd/cxx/tree/tree-inline.hxx18
-rw-r--r--xsd/cxx/tree/tree-source.cxx3900
-rw-r--r--xsd/cxx/tree/tree-source.hxx18
-rw-r--r--xsd/cxx/tree/validator.cxx671
-rw-r--r--xsd/cxx/tree/validator.hxx29
85 files changed, 0 insertions, 42603 deletions
diff --git a/xsd/cxx/elements.cxx b/xsd/cxx/elements.cxx
deleted file mode 100644
index 5ead15f..0000000
--- a/xsd/cxx/elements.cxx
+++ /dev/null
@@ -1,1319 +0,0 @@
-// file : xsd/cxx/elements.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/elements.hxx>
-
-#include <cctype> // std::toupper
-#include <memory>
-#include <sstream>
-#include <fstream>
-#include <cassert>
-#include <iostream>
-
-using std::wcerr;
-using std::endl;
-
-namespace CXX
-{
- //
- //
- wchar_t
- upcase (wchar_t c)
- {
- return std::toupper (c);
- }
-
- namespace
- {
- wchar_t const* keywords[] = {
- L"NULL",
- L"and",
- L"asm",
- L"auto",
- L"bitand",
- L"bitor",
- L"bool",
- L"break",
- L"case",
- L"catch",
- L"char",
- L"class",
- L"compl",
- L"const",
- L"const_cast",
- L"continue",
- L"default",
- L"delete",
- L"do",
- L"double",
- L"dynamic_cast",
- L"else",
- L"end_eq",
- L"enum",
- L"explicit",
- L"export",
- L"extern",
- L"false",
- L"float",
- L"for",
- L"friend",
- L"goto",
- L"if",
- L"inline",
- L"int",
- L"long",
- L"mutable",
- L"namespace",
- L"new",
- L"not",
- L"not_eq",
- L"operator",
- L"or",
- L"or_eq",
- L"private",
- L"protected",
- L"public",
- L"register",
- L"reinterpret_cast",
- L"return",
- L"short",
- L"signed",
- L"sizeof",
- L"static",
- L"static_cast",
- L"struct",
- L"switch",
- L"template",
- L"this",
- L"throw",
- L"true",
- L"try",
- L"typedef",
- L"typeid",
- L"typename",
- L"union",
- L"unsigned",
- L"using",
- L"virtual",
- L"void",
- L"volatile",
- L"wchar_t",
- L"while",
- L"xor",
- L"xor_eq"
- };
- }
-
- // Context
- //
-
- Context::
- Context (std::wostream& o,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- options_type const& ops,
- StringLiteralMap const* string_literal_map_)
- : os (o),
- schema_root (root),
- schema_path (schema_path_),
- options (ops),
- std (ops.std ()),
- char_type (char_type_),
- char_encoding (char_encoding_),
- L (L_),
- string_type (string_type_),
- auto_ptr (auto_ptr_),
- string_literal_map (string_literal_map_),
- type_exp (type_exp_),
- inst_exp (inst_exp_),
- inl (inl_),
- ns_mapping_cache (ns_mapping_cache_),
- schema_path_ (path),
- xs_ns_ (0),
- char_type_ (ops.char_type ()),
- char_encoding_ (ops.char_encoding ()),
- L_ (char_type == L"wchar_t" ? L"L" : L""),
- inl_ (ops.generate_inline () ? L"inline\n" : L""),
- cxx_id_expr_ (L"^(::)?([a-zA-Z_]\\w*)(::[a-zA-Z_]\\w*)*$"),
- cxx_id_expr (cxx_id_expr_),
- urn_mapping_ (L"#^urn.*:([a-zA-Z_].*)$#$1#"),
- urn_mapping (urn_mapping_),
- nsr_mapping (nsr_mapping_),
- nsm_mapping (nsm_mapping_),
- include_mapping (include_mapping_),
- reserved_name_map (reserved_name_map_),
- keyword_set (keyword_set_)
- {
- // Export symbol.
- //
- {
- String es (ops.export_symbol ());
- type_exp_ = es ? es + L" " : es;
- inst_exp_ = es ? es + L"\n" : es;
- }
-
- // Resolve and cache XML Schema namespace.
- //
- {
- SemanticGraph::Nameable* n;
-
- if (schema_root.names_begin ()->name () ==
- L"http://www.w3.org/2001/XMLSchema")
- {
- // schema_root is the XML Schema itself.
- //
- n = &schema_root.names_begin ()->named ();
- }
- else
- {
- // Otherwise, the first used schema is implied XML Schema.
- //
- SemanticGraph::Uses& u = *schema_root.uses_begin ();
- assert (u.is_a<SemanticGraph::Implies> ());
- n = &u.schema ().names_begin ()->named ();
- }
-
- xs_ns_ = dynamic_cast<SemanticGraph::Namespace*> (n);
- }
-
- // String type.
- //
- if (char_type == L"char")
- string_type_ = L"::std::string";
- else if (char_type == L"wchar_t")
- string_type_ = L"::std::wstring";
- else
- string_type_ = L"::std::basic_string< " + char_type + L" >";
-
- // Automatic pointer type.
- //
- auto_ptr_ = std >= cxx_version::cxx11
- ? "::std::unique_ptr"
- : "::std::auto_ptr";
-
- // Default encoding.
- //
- if (!char_encoding)
- {
- if (char_type == L"char")
- char_encoding = L"utf8";
- else
- char_encoding = L"auto";
- }
-
- // Default mapping.
- //
- nsr_mapping_.push_back (
- Regex (L"#^.* (.*?/)??" L"(([a-zA-Z_]\\w*)(/[a-zA-Z_]\\w*)*)/?$#$2#"));
- nsr_mapping_.push_back (
- Regex (L"#^.* http://www\\.w3\\.org/2001/XMLSchema$#xml_schema#"));
-
- // Custom regex mapping.
- //
- for (NarrowStrings::const_iterator i (ops.namespace_regex ().begin ()),
- e (ops.namespace_regex ().end ()); i != e; ++i)
- {
- nsr_mapping_.push_back (Regex (String (*i)));
- }
-
- // Custom direct mapping.
- //
- for (NarrowStrings::const_iterator i (ops.namespace_map ().begin ()),
- e (ops.namespace_map ().end ()); i != e; ++i)
- {
- String s (*i);
-
- // Split the string in two parts at the last '='.
- //
- size_t pos (s.rfind ('='));
-
- if (pos == String::npos)
- throw InvalidNamespaceMapping (s, "delimiter ('=') not found");
-
- // Empty xml_ns designates the no-namespace case.
- //
- String xml_ns (s, 0, pos);
- String cxx_ns (s, pos + 1);
-
- if (!cxx_ns.empty () && !cxx_id_expr.match (cxx_ns))
- throw InvalidNamespaceMapping (s, "invalid C++ identifier");
-
- nsm_mapping_[xml_ns] = cxx_ns;
- }
-
- // Include path regex
- //
- for (NarrowStrings::const_iterator i (ops.include_regex ().begin ()),
- e (ops.include_regex ().end ()); i != e; ++i)
- {
- include_mapping_.push_back (Regex (String (*i)));
- }
-
- // Reserved names.
- //
- for (NarrowStrings::const_iterator i (ops.reserved_name ().begin ()),
- e (ops.reserved_name ().end ()); i != e; ++i)
- {
- String s (*i);
-
- // Split the string in two parts at '='.
- //
- size_t pos (s.find ('='));
-
- if (pos == String::npos)
- reserved_name_map_[s] = L"";
- else
- reserved_name_map_[String (s, 0, pos)] = String (s, pos + 1);
- }
-
- // Populate the keyword set.
- //
- for (size_t i (0); i < sizeof (keywords) / sizeof (char*); ++i)
- keyword_set_.insert (keywords[i]);
- }
-
- String Context::
- ns_name (SemanticGraph::Namespace& ns)
- {
- using SemanticGraph::Schema;
- using SemanticGraph::Includes;
- using SemanticGraph::Imports;
- using SemanticGraph::Implies;
- using SemanticGraph::Sources;
-
- String tmp;
- MapMapping::const_iterator i (nsm_mapping.find (ns.name ()));
-
- if (i != nsm_mapping.end ())
- {
- tmp = i->second;
- }
- else
- {
- SemanticGraph::Path path;
- Schema& schema (dynamic_cast<Schema&> (ns.scope ()));
-
- if (schema.used_p ())
- {
- // Here we need to detect a special multi-schema compilation
- // case where the root schemas are imported into a special
- // schema that doesn't have a namespace.
- //
- SemanticGraph::Uses& u (*schema.used_begin ());
- SemanticGraph::Schema& s (u.user ());
-
- if (s.names_begin () != s.names_end ())
- path = u.path ();
- }
- else
- path = schema_path;
-
- String pair;
-
- if (!path.empty ())
- {
- path.normalize ();
-
- // Try to use the portable representation of the path. If that
- // fails, fall back to the native representation.
- //
- try
- {
- pair = path.posix_string ();
- }
- catch (SemanticGraph::InvalidPath const&)
- {
- pair = path.string ();
- }
- }
-
- pair += L' ' + ns.name ();
-
- // Check cache first
- //
- MappingCache::const_iterator i (ns_mapping_cache.find (pair));
-
- if (i != ns_mapping_cache.end ())
- {
- tmp = i->second;
- }
- else
- {
- bool trace (options.namespace_regex_trace ());
-
- if (trace)
- wcerr << "namespace: '" << pair << "'" << endl;
-
- bool found (false);
- Regex colon (L"#/#::#");
-
- for (RegexMapping::const_reverse_iterator e (nsr_mapping.rbegin ());
- e != nsr_mapping.rend (); ++e)
- {
- if (trace)
- wcerr << "try: '" << e->regex () << "' : ";
-
- if (e->match (pair))
- {
- tmp = e->replace (pair);
- tmp = colon.replace (tmp); // replace `/' with `::'
-
- // Check the result.
- //
- found = cxx_id_expr.match (tmp);
-
- if (trace)
- wcerr << "'" << tmp << "' : ";
- }
-
- if (trace)
- wcerr << (found ? '+' : '-') << endl;
-
- if (found)
- break;
- }
-
- if (!found)
- {
- String const& n (ns.name ());
-
- // Check if the name is valid by itself.
- //
- if (n.empty ())
- {
- // Empty name denotes a no-namespace case.
- //
- tmp = n;
- }
- else
- {
- tmp = colon.replace (n); // replace `/' with `::'
-
- if (!cxx_id_expr.match (tmp))
- {
- // See if this is a urn-style namespace.
- //
- if (urn_mapping.match (n))
- {
- Regex filter (L"#[.:-]#_#");
- tmp = urn_mapping.replace (n);
- tmp = filter.replace (tmp);
-
- if (!cxx_id_expr.match (tmp))
- throw NoNamespaceMapping (
- ns.file (), ns.line (), ns.column (), ns.name ());
- }
- else
- throw NoNamespaceMapping (
- ns.file (), ns.line (), ns.column (), ns.name ());
- }
- }
- }
-
- // Add the mapping to the cache.
- //
- ns_mapping_cache[pair] = tmp;
- }
- }
-
-
- // Parse resulting namespace string and id() each name.
- //
- String r;
- String::size_type b (0), e;
-
- do
- {
- e = tmp.find (L"::", b);
-
- String name (tmp, b, e == tmp.npos ? e : e - b);
-
- if (!name.empty ())
- r += L"::" + escape (name);
-
- b = e;
-
- if (b == tmp.npos)
- break;
-
- b += 2;
-
- } while (true);
-
- return r;
- }
-
- SemanticGraph::Namespace& Context::
- xs_ns ()
- {
- return *xs_ns_;
- }
-
- String Context::
- xs_ns_name ()
- {
- return ns_name (*xs_ns_);
- }
-
- SemanticGraph::Namespace& Context::
- namespace_ (SemanticGraph::Nameable& n)
- {
- // The basic idea goes like this: go up Names edges until you
- // reach Namespace. There are, however, anonymous types which
- // need special handling. In the case of an anonymous type we
- // will go up the first Belongs edge (because the first edge
- // is where the type was defined.
- //
-
- if (n.named_p ())
- {
- SemanticGraph::Scope& s (n.scope ());
-
- SemanticGraph::Namespace* ns (
- dynamic_cast<SemanticGraph::Namespace*> (&n));
-
- return ns ? *ns : namespace_ (s);
- }
- else
- {
- SemanticGraph::Type& t (dynamic_cast<SemanticGraph::Type&> (n));
-
- SemanticGraph::Belongs& b (*t.classifies_begin ());
-
- return namespace_ (b.instance ());
- }
- }
-
- String Context::
- xml_ns_name (SemanticGraph::Nameable& n)
- {
- return namespace_ (n).name ();
- }
-
- String Context::
- fq_name (SemanticGraph::Nameable& n, char const* name_key)
- {
- using namespace SemanticGraph;
-
- String r;
-
- if (dynamic_cast<Schema*> (&n))
- {
- return L""; // Map to global namespace.
- }
- else if (SemanticGraph::Namespace* ns =
- dynamic_cast<SemanticGraph::Namespace*> (&n))
- {
- r = ns_name (*ns);
- }
- else
- {
- r = fq_name (n.scope ());
- r += L"::";
- r += n.context ().get<String> (name_key);
- }
-
- return r;
- }
-
- SemanticGraph::Type& Context::
- ultimate_base (SemanticGraph::Complex& c)
- {
- using namespace SemanticGraph;
-
- Type* b (&c.inherits ().base ());
-
- while (true)
- {
- Complex* cb (dynamic_cast<Complex*> (b));
-
- if (cb != 0 && cb->inherits_p ())
- {
- b = &cb->inherits ().base ();
- continue;
- }
-
- break;
- }
-
- return *b;
- }
-
- String Context::
- escape (String const& name)
- {
- String r;
- size_t n (name.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (n);
-
- for (size_t i (0); i < n; ++i)
- {
- bool first (i == 0);
-
- unsigned int u (unicode_char (name, i)); // May advance i.
-
- if (first)
- {
- if (!((u >= 'a' && u <= 'z') ||
- (u >= 'A' && u <= 'Z') ||
- u == '_'))
- r = (u >= '0' && u <= '9') ? L"cxx_" : L"cxx";
- }
-
- if (!((u >= 'a' && u <= 'z') ||
- (u >= 'A' && u <= 'Z') ||
- (u >= '0' && u <= '9') ||
- u == '_'))
- r.push_back ('_');
- else
- r.push_back (static_cast<wchar_t> (u));
- }
-
- if (r.empty ())
- r = L"cxx";
-
- // Custom reserved words.
- //
- ReservedNameMap::const_iterator i (reserved_name_map.find (r));
-
- if (i != reserved_name_map.end ())
- {
- if (i->second)
- return i->second;
- else
- r += L'_';
- }
-
- // Keywords
- //
- if (keyword_set.find (r) != keyword_set.end ())
- {
- r += L'_';
-
- // Re-run custom words.
- //
- i = reserved_name_map.find (r);
-
- if (i != reserved_name_map.end ())
- {
- if (i->second)
- return i->second;
- else
- r += L'_';
- }
- }
-
- return r;
- }
-
- // String escaping.
- //
-
- String
- charlit (unsigned int u)
- {
- String r ("\\x");
- bool lead (true);
-
- for (int i (7); i >= 0; --i)
- {
- unsigned int x ((u >> (i * 4)) & 0x0F);
-
- if (lead)
- {
- if (x == 0)
- continue;
-
- lead = false;
- }
-
- r += x < 10 ? ('0' + x) : ('A' + x - 10);
- }
-
- return r;
- }
-
- String
- strlit_ascii (String const& str)
- {
- String r;
- size_t n (str.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (n + 2);
-
- r += '"';
-
- bool escape (false);
-
- for (size_t i (0); i < n; ++i)
- {
- unsigned int u (Context::unicode_char (str, i)); // May advance i.
-
- // [128 - ] - unrepresentable
- // 127 - \x7F
- // [32 - 126] - as is
- // [0 - 31] - \X or \xXX
- //
-
- if (u < 32 || u == 127)
- {
- switch (u)
- {
- case L'\n':
- {
- r += L"\\n";
- break;
- }
- case L'\t':
- {
- r += L"\\t";
- break;
- }
- case L'\v':
- {
- r += L"\\v";
- break;
- }
- case L'\b':
- {
- r += L"\\b";
- break;
- }
- case L'\r':
- {
- r += L"\\r";
- break;
- }
- case L'\f':
- {
- r += L"\\f";
- break;
- }
- case L'\a':
- {
- r += L"\\a";
- break;
- }
- default:
- {
- r += charlit (u);
- escape = true;
- break;
- }
- }
- }
- else if (u < 127)
- {
- if (escape)
- {
- // Close and open the string so there are no clashes.
- //
- r += '"';
- r += '"';
-
- escape = false;
- }
-
- switch (u)
- {
- case L'"':
- {
- r += L"\\\"";
- break;
- }
- case L'\\':
- {
- r += L"\\\\";
- break;
- }
- default:
- {
- r += static_cast<wchar_t> (u);
- break;
- }
- }
- }
- else
- {
- // Unrepresentable character.
- //
- throw UnrepresentableCharacter (str, i + 1);
- }
- }
-
- r += '"';
-
- return r;
- }
-
- const unsigned int utf8_first_char_mask[5] =
- {
- 0x00, 0x00, 0xC0, 0xE0, 0xF0
- };
-
- String
- strlit_utf8 (String const& str)
- {
- String r;
- size_t n (str.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (n + 2);
-
- r += '"';
-
- bool escape (false);
-
- for (size_t i (0); i < n; ++i)
- {
- unsigned int u (Context::unicode_char (str, i)); // May advance i.
-
- // [128 - ] - UTF-8
- // 127 - \x7F
- // [32 - 126] - as is
- // [0 - 31] - \X or \xXX
- //
-
- if (u < 32 || u == 127)
- {
- switch (u)
- {
- case L'\n':
- {
- r += L"\\n";
- break;
- }
- case L'\t':
- {
- r += L"\\t";
- break;
- }
- case L'\v':
- {
- r += L"\\v";
- break;
- }
- case L'\b':
- {
- r += L"\\b";
- break;
- }
- case L'\r':
- {
- r += L"\\r";
- break;
- }
- case L'\f':
- {
- r += L"\\f";
- break;
- }
- case L'\a':
- {
- r += L"\\a";
- break;
- }
- default:
- {
- r += charlit (u);
- escape = true;
- break;
- }
- }
- }
- else if (u < 127)
- {
- if (escape)
- {
- // Close and open the string so there are no clashes.
- //
- r += '"';
- r += '"';
-
- escape = false;
- }
-
- switch (u)
- {
- case L'"':
- {
- r += L"\\\"";
- break;
- }
- case L'\\':
- {
- r += L"\\\\";
- break;
- }
- default:
- {
- r += static_cast<wchar_t> (u);
- break;
- }
- }
- }
- else
- {
- unsigned int count (0);
- unsigned int tmp[4];
-
- if (u < 0x800)
- count = 2;
- else if (u < 0x10000)
- count = 3;
- else if (u < 0x110000)
- count = 4;
-
- switch (count)
- {
- case 4:
- {
- tmp[3] = (u | 0x80UL) & 0xBFUL;
- u >>= 6;
- }
- case 3:
- {
- tmp[2] = (u | 0x80UL) & 0xBFUL;
- u >>= 6;
- }
- case 2:
- {
- tmp[1] = (u | 0x80UL) & 0xBFUL;
- u >>= 6;
- }
- case 1:
- {
- tmp[0] = u | utf8_first_char_mask[count];
- break;
- }
- default:
- assert (false);
- }
-
- for (unsigned int j (0); j < count; ++j)
- r += charlit (tmp[j]);
-
- escape = true;
- }
- }
-
- r += '"';
-
- return r;
- }
-
- String
- strlit_iso8859_1 (String const& str)
- {
- String r;
- size_t n (str.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (n + 2);
-
- r += '"';
-
- bool escape (false);
-
- for (size_t i (0); i < n; ++i)
- {
- unsigned int u (Context::unicode_char (str, i)); // May advance i.
-
- // [256 - ] - unrepresentable
- // [127 - 255] - \xXX
- // [32 - 126] - as is
- // [0 - 31] - \X or \xXX
- //
-
- if (u < 32)
- {
- switch (u)
- {
- case L'\n':
- {
- r += L"\\n";
- break;
- }
- case L'\t':
- {
- r += L"\\t";
- break;
- }
- case L'\v':
- {
- r += L"\\v";
- break;
- }
- case L'\b':
- {
- r += L"\\b";
- break;
- }
- case L'\r':
- {
- r += L"\\r";
- break;
- }
- case L'\f':
- {
- r += L"\\f";
- break;
- }
- case L'\a':
- {
- r += L"\\a";
- break;
- }
- default:
- {
- r += charlit (u);
- escape = true;
- break;
- }
- }
- }
- else if (u < 127)
- {
- if (escape)
- {
- // Close and open the string so there are no clashes.
- //
- r += '"';
- r += '"';
-
- escape = false;
- }
-
- switch (u)
- {
- case L'"':
- {
- r += L"\\\"";
- break;
- }
- case L'\\':
- {
- r += L"\\\\";
- break;
- }
- default:
- {
- r += static_cast<wchar_t> (u);
- break;
- }
- }
- }
- else if (u < 256)
- {
- r += charlit (u);
- escape = true;
- }
- else
- {
- // Unrepresentable character.
- //
- throw UnrepresentableCharacter (str, i + 1);
- }
- }
-
- r += '"';
-
- return r;
- }
-
- String
- strlit_utf32 (String const& str)
- {
- String r;
- size_t n (str.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (n + 3);
-
- r += L"L\"";
-
- bool escape (false);
-
- for (size_t i (0); i < n; ++i)
- {
- unsigned int u (Context::unicode_char (str, i)); // May advance i.
-
- // [128 - ] - \xUUUUUUUU
- // 127 - \x7F
- // [32 - 126] - as is
- // [0 - 31] - \X or \xXX
- //
-
- if (u < 32 || u == 127)
- {
- switch (u)
- {
- case L'\n':
- {
- r += L"\\n";
- break;
- }
- case L'\t':
- {
- r += L"\\t";
- break;
- }
- case L'\v':
- {
- r += L"\\v";
- break;
- }
- case L'\b':
- {
- r += L"\\b";
- break;
- }
- case L'\r':
- {
- r += L"\\r";
- break;
- }
- case L'\f':
- {
- r += L"\\f";
- break;
- }
- case L'\a':
- {
- r += L"\\a";
- break;
- }
- default:
- {
- r += charlit (u);
- escape = true;
- break;
- }
- }
- }
- else if (u < 127)
- {
- if (escape)
- {
- // Close and open the string so there are no clashes. C++11
- // requires a space between " and L.
- //
- r += L"\" L\"";
- escape = false;
- }
-
- switch (u)
- {
- case L'"':
- {
- r += L"\\\"";
- break;
- }
- case L'\\':
- {
- r += L"\\\\";
- break;
- }
- default:
- {
- r += static_cast<wchar_t> (u);
- break;
- }
- }
- }
- else
- {
- r += charlit (u);
- escape = true;
- }
- }
-
- r += '"';
-
- return r;
- }
-
- String Context::
- strlit (String const& str)
- {
- // First see if we have a custom mapping.
- //
- assert (string_literal_map != 0);
- StringLiteralMap::const_iterator i (string_literal_map->find (str));
-
- if (i != string_literal_map->end ())
- return i->second;
-
- if (char_type == L"char")
- {
- if (char_encoding == L"utf8")
- return strlit_utf8 (str);
- else if (char_encoding == L"iso8859-1")
- return strlit_iso8859_1 (str);
- else
- {
- // For LCP, custom, and other unknown encodings, use ASCII.
- //
- return strlit_ascii (str);
- }
- }
- else
- return strlit_utf32 (str);
- }
-
- String Context::
- comment (String const& str)
- {
- String r;
-
- wchar_t const* s (str.c_str ());
- size_t size (str.size ());
-
- // In most common cases we will have that many chars.
- //
- r.reserve (size);
-
- for (wchar_t const* p (s); p < s + size; ++p)
- {
- unsigned int u (unicode_char (p)); // May advance p.
-
- // We are going to treat \v, \f and \n as unrepresentable
- // here even though they can be present in C++ source code.
- //
- if (u > 127 || (u < 32 && u != '\t'))
- r += L'?';
- else
- r += static_cast<wchar_t> (u);
- }
-
- return r;
- }
-
- String Context::
- process_include_path (String const& name) const
- {
- String path (String (options.include_prefix ()) + name);
- bool trace (options.include_regex_trace ());
-
- if (trace)
- wcerr << "include: '" << path << "'" << endl;
-
- String r;
- bool found (false);
-
- for (RegexMapping::const_reverse_iterator e (include_mapping.rbegin ());
- e != include_mapping.rend (); ++e)
- {
- if (trace)
- wcerr << "try: '" << e->regex () << "' : ";
-
- if (e->match (path))
- {
- r = e->replace (path);
- found = true;
-
- if (trace)
- wcerr << "'" << r << "' : ";
- }
-
- if (trace)
- wcerr << (found ? '+' : '-') << endl;
-
- if (found)
- break;
- }
-
- if (!found)
- r = path;
-
- if (!r.empty () && r[0] != L'"' && r[0] != L'<')
- {
- wchar_t op (options.include_with_brackets () ? L'<' : L'"');
- wchar_t cl (options.include_with_brackets () ? L'>' : L'"');
- r = op + r + cl;
- }
-
- return r;
- }
-
- // Namespace
- //
-
- void Namespace::
- pre (Type& n)
- {
- String ns (ctx_.ns_name (n));
-
- String::size_type b (0), e;
-
- if (st_)
- st_->enter (n, L"", ns ? false : true);
-
- do
- {
- e = ns.find (L"::", b);
-
- String name (ns, b, e == ns.npos ? e : e - b);
-
- if (!name.empty ())
- {
- if (st_)
- st_->enter (n, name, e == ns.npos);
-
- ctx_.os << "namespace " << name << "{";
- }
-
- b = e;
-
- if (b == ns.npos)
- break;
-
- b += 2;
-
- } while (true);
- }
-
- void Namespace::
- post (Type& n)
- {
- String ns (ctx_.ns_name (n));
-
- String::size_type b (0), e;
-
- do
- {
- e = ns.find (L"::", b);
-
- String name (ns, b, e == ns.npos ? e : e - b);
-
- if (!name.empty ())
- {
- ctx_.os << "}";
-
- if (st_)
- st_->leave ();
- }
-
-
- b = e;
-
- if (b == ns.npos)
- break;
-
- b += 2;
-
- }
- while (true);
-
- if (st_)
- st_->leave ();
- }
-}
diff --git a/xsd/cxx/elements.hxx b/xsd/cxx/elements.hxx
deleted file mode 100644
index a316a0c..0000000
--- a/xsd/cxx/elements.hxx
+++ /dev/null
@@ -1,626 +0,0 @@
-// file : xsd/cxx/elements.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_ELEMENTS_HXX
-#define CXX_ELEMENTS_HXX
-
-#include <set>
-#include <map>
-#include <vector>
-#include <ostream>
-
-#include <cutl/re.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-#include <types.hxx>
-#include <elements.hxx>
-
-#include <cxx/options.hxx>
-#include <cxx/literal-map.hxx>
-
-namespace CXX
-{
- using std::endl;
-
- // On some platforms std::toupper can be something other than a
- // function with C++ linkage.
- //
- wchar_t
- upcase (wchar_t c);
-
-
- // Exceptions.
- //
-
- struct UnrepresentableCharacter
- {
- UnrepresentableCharacter (String const& str, size_t pos)
- : str_ (str), pos_ (pos)
- {
- }
-
- String const&
- string () const
- {
- return str_;
- }
-
- size_t
- position () const
- {
- return pos_;
- }
-
- private:
- String str_;
- size_t pos_;
- };
-
- struct NoNamespaceMapping
- {
- NoNamespaceMapping (SemanticGraph::Path const& file,
- size_t line,
- size_t column,
- String const& ns)
- : file_ (file),
- line_ (line),
- column_ (column),
- ns_ (ns)
- {
- }
-
-
- SemanticGraph::Path const&
- file () const
- {
- return file_;
- }
-
- size_t
- line () const
- {
- return line_;
- }
-
- size_t
- column () const
- {
- return column_;
- }
-
- String const&
- ns () const
- {
- return ns_;
- }
-
- private:
- SemanticGraph::Path file_;
- size_t line_;
- size_t column_;
- String ns_;
- };
-
- struct InvalidNamespaceMapping
- {
- InvalidNamespaceMapping (String const& mapping,
- String const& reason)
- : mapping_ (mapping), reason_ (reason)
- {
- }
-
- String const&
- mapping () const
- {
- return mapping_;
- }
-
- String const&
- reason () const
- {
- return reason_;
- }
-
- private:
- String mapping_;
- String reason_;
- };
-
- //
- //
- class Context
- {
- public:
- typedef cutl::re::wregex RegexPat;
- typedef cutl::re::wregexsub Regex;
- typedef std::vector<Regex> RegexMapping;
- typedef std::map<String, String> MapMapping;
- typedef std::map<String, String> MappingCache;
-
- typedef std::map<String, String> ReservedNameMap;
- typedef std::set<String> KeywordSet;
-
- typedef CXX::options options_type;
-
- public:
- Context (std::wostream& o,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- options_type const& ops,
- StringLiteralMap const* custom_literals_map);
-
- protected:
- Context (Context& c)
- : os (c.os),
- schema_root (c.schema_root),
- schema_path (c.schema_path),
- options (c.options),
- std (c.std),
- char_type (c.char_type),
- char_encoding (c.char_encoding),
- L (c.L),
- string_type (c.string_type),
- auto_ptr (c.auto_ptr),
- string_literal_map (c.string_literal_map),
- type_exp (c.type_exp),
- inst_exp (c.inst_exp),
- inl (c.inl),
- ns_mapping_cache (c.ns_mapping_cache),
- xs_ns_ (c.xs_ns_),
- cxx_id_expr (c.cxx_id_expr),
- urn_mapping (c.urn_mapping),
- nsr_mapping (c.nsr_mapping),
- nsm_mapping (c.nsm_mapping),
- include_mapping (c.include_mapping),
- reserved_name_map (c.reserved_name_map),
- keyword_set (c.keyword_set)
- {
- }
-
- Context (Context& c, std::wostream& o)
- : os (o),
- schema_root (c.schema_root),
- schema_path (c.schema_path),
- options (c.options),
- std (c.std),
- char_type (c.char_type),
- char_encoding (c.char_encoding),
- L (c.L),
- string_type (c.string_type),
- auto_ptr (c.auto_ptr),
- string_literal_map (c.string_literal_map),
- type_exp (c.type_exp),
- inst_exp (c.inst_exp),
- inl (c.inl),
- ns_mapping_cache (c.ns_mapping_cache),
- xs_ns_ (c.xs_ns_),
- cxx_id_expr (c.cxx_id_expr),
- urn_mapping (c.urn_mapping),
- nsr_mapping (c.nsr_mapping),
- nsm_mapping (c.nsm_mapping),
- include_mapping (c.include_mapping),
- reserved_name_map (c.reserved_name_map),
- keyword_set (c.keyword_set)
- {
- }
-
- public:
- static String
- unclash (String const& name, String const& new_name)
- {
- return name == new_name ? (new_name + L'_') : new_name;
- }
-
- public:
- // Return UTF-32 character starting at this position. Position is
- // advanced by 1 if this Unicode character takes more than one
- // underlying character.
- //
- static unsigned int
- unicode_char (String const& str, size_t& pos);
-
- static unsigned int
- unicode_char (wchar_t const*& p);
-
- // Escape C++ keywords and illegal characters.
- //
- String
- escape (String const&);
-
- // Create a string literal so that it can be used in C++ source
- // code. It includes "".
- //
- String
- strlit (String const&);
-
- // Escape the string so that it can be used in C++ comment.
- //
- String
- comment (String const&);
-
- // Translate XML namespace name to a C++ identifier.
- //
- String
- ns_name (SemanticGraph::Namespace&);
-
- // XML Schema namespace.
- //
- SemanticGraph::Namespace&
- xs_ns ();
-
- // C++ namespace for XML Schema.
- //
- String
- xs_ns_name ();
-
- //
- //
- SemanticGraph::Namespace&
- namespace_ (SemanticGraph::Nameable& n);
-
- // Original XML namespace name.
- //
- String
- xml_ns_name (SemanticGraph::Nameable& ns);
-
-
- // Fully-qualified C++ name.
- //
- String
- fq_name (SemanticGraph::Nameable& n, char const* name_key = "name");
-
- public:
- static SemanticGraph::Type&
- ultimate_base (SemanticGraph::Complex&);
-
- public:
- String
- process_include_path (String const&) const;
-
- public:
- static bool
- skip (SemanticGraph::Member& m)
- {
- // "Subsequent" local element.
- //
- return !m.scope ().is_a<SemanticGraph::Namespace> () &&
- m.context ().count ("min") == 0;
- }
-
- static size_t
- min (SemanticGraph::Member const& m)
- {
- return m.context ().get<size_t> ("min");
- }
-
- static size_t
- min (SemanticGraph::Any const& a)
- {
- return a.context ().get<size_t> ("min");
- }
-
- static size_t
- max (SemanticGraph::Member const& m)
- {
- return m.context ().get<size_t> ("max");
- }
-
- static size_t
- max (SemanticGraph::Any const& a)
- {
- return a.context ().get<size_t> ("max");
- }
-
- public:
- // Get escaped name.
- //
- static String const&
- ename (SemanticGraph::Nameable const& n)
- {
- return n.context ().get<String> ("name");
- }
-
- public:
- std::wostream& os;
-
- SemanticGraph::Schema& schema_root;
- SemanticGraph::Path const& schema_path;
-
- options_type const& options;
-
- cxx_version std;
-
- String& char_type;
- String& char_encoding;
- String& L; // string literal prefix
- String& string_type;
- String& auto_ptr;
-
- StringLiteralMap const* string_literal_map;
-
- String& type_exp;
- String& inst_exp;
- String& inl;
-
- public:
- MappingCache& ns_mapping_cache;
-
- private:
- SemanticGraph::Path const schema_path_;
-
- SemanticGraph::Namespace* xs_ns_;
-
- String char_type_;
- String char_encoding_;
- String L_;
- String string_type_;
- String auto_ptr_;
-
- String type_exp_;
- String inst_exp_;
- String inl_;
-
- private:
- RegexPat const cxx_id_expr_;
- RegexPat const& cxx_id_expr;
- Regex urn_mapping_;
- RegexMapping nsr_mapping_;
- MapMapping nsm_mapping_;
- Regex const& urn_mapping;
- RegexMapping const& nsr_mapping;
- MapMapping const& nsm_mapping;
- MappingCache ns_mapping_cache_;
-
- RegexMapping include_mapping_;
- RegexMapping const& include_mapping;
-
- ReservedNameMap const& reserved_name_map;
- ReservedNameMap reserved_name_map_;
-
- KeywordSet const& keyword_set;
- KeywordSet keyword_set_;
- };
-
- inline unsigned int Context::
- unicode_char (String const& str, size_t& pos)
- {
- if (sizeof (wchar_t) == 4)
- {
- return str[pos];
- }
- else if (sizeof (wchar_t) == 2)
- {
- wchar_t x (str[pos]);
-
- if (x < 0xD800 || x > 0xDBFF)
- return x;
- else
- return ((x - 0xD800) << 10) + (str[++pos] - 0xDC00) + 0x10000;
- }
- else
- return 0;
- }
-
- inline unsigned int Context::
- unicode_char (wchar_t const*& p)
- {
- if (sizeof (wchar_t) == 4)
- {
- return *p;
- }
- else if (sizeof (wchar_t) == 2)
- {
- wchar_t x (*p);
-
- if (x < 0xD800 || x > 0xDBFF)
- return x;
- else
- return ((x - 0xD800) << 10) + (*(++p) - 0xDC00) + 0x10000;
- }
- else
- return 0;
- }
-
- // Sources traverser that goes into each schema only once.
- //
- struct Sources: Traversal::Sources
- {
- virtual void
- traverse (SemanticGraph::Sources& s)
- {
- if (schemas_.insert (&s.schema ()).second)
- Traversal::Sources::traverse (s);
- }
-
- private:
- std::set<SemanticGraph::Schema*> schemas_;
- };
-
- // Usual namespace mapping.
- //
- struct Namespace: Traversal::Namespace
- {
- struct ScopeTracker
- {
- // First scope name if always empty (global scope). The last flag
- // signals the last scope.
- //
- virtual void
- enter (Type&, String const& name, bool last) = 0;
-
- virtual void
- leave () = 0;
- };
-
-
- Namespace (Context& c)
- : ctx_ (c), st_ (0)
- {
- }
-
- Namespace (Context& c, ScopeTracker& st)
- : ctx_ (c), st_ (&st)
- {
- }
-
- virtual void
- pre (Type&);
-
- virtual void
- post (Type&);
-
- private:
- Context& ctx_;
- ScopeTracker* st_;
- };
-
- //
- //
- template <typename X>
- struct Has : X
- {
- Has (bool& result)
- : result_ (result)
- {
- }
-
- virtual void
- traverse (typename X::Type&)
- {
- result_ = true;
- }
-
- private:
- bool& result_;
- };
-
- // Checks if scope 'Y' names any of 'X'
- //
- template <typename X, typename Y>
- bool
- has (Y& y)
- {
- using SemanticGraph::Scope;
-
- bool result (false);
- Has<X> t (result);
-
- for (Scope::NamesIterator i (y.names_begin ()), e (y.names_end ());
- !result && i != e; ++i)
- t.dispatch (i->named ());
-
- return result;
- }
-
- // Checks if the compositor has any particle of 'X'
- //
- template <typename X>
- bool
- has_particle (SemanticGraph::Compositor& y)
- {
- using SemanticGraph::Compositor;
-
- bool result (false);
- Has<X> t (result);
-
- for (Compositor::ContainsIterator i (y.contains_begin ()),
- e (y.contains_end ()); !result && i != e; ++i)
- {
- SemanticGraph::Particle& p (i->particle ());
-
- t.dispatch (p);
-
- if (!result && p.is_a<Compositor> ())
- result = has_particle<X> (dynamic_cast<Compositor&> (p));
- }
-
- return result;
- }
-
- // Specialization for Complex
- //
- template <typename X>
- bool
- has_particle (SemanticGraph::Complex& c)
- {
- return c.contains_compositor_p () &&
- has_particle<X> (c.contains_compositor ().compositor ());
- }
-
- // Fundamental type mapping helper.
- //
- struct Fundamental: Traversal::Fundamental::Type,
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef
- {
- virtual void
- fundamental_type (SemanticGraph::Fundamental::Type& t) = 0;
-
- virtual void
- fundamental_template (SemanticGraph::Fundamental::Type& t) = 0;
-
- virtual void
- traverse (SemanticGraph::Fundamental::Type& t)
- {
- fundamental_type (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- fundamental_template (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- fundamental_template (t);
- }
- };
-}
-
-#endif // CXX_TREE_ELEMENTS_HXX
diff --git a/xsd/cxx/literal-map.cxx b/xsd/cxx/literal-map.cxx
deleted file mode 100644
index f2515fe..0000000
--- a/xsd/cxx/literal-map.cxx
+++ /dev/null
@@ -1,261 +0,0 @@
-// file : xsd/cxx/literal-map.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <memory> // std::auto_ptr
-#include <cstddef> // std::size_t
-#include <fstream>
-#include <iostream>
-
-#include <xercesc/util/XMLUni.hpp>
-
-#include <xercesc/framework/LocalFileInputSource.hpp>
-
-#include <xercesc/sax/Locator.hpp>
-#include <xercesc/sax/SAXParseException.hpp>
-#include <xercesc/sax2/DefaultHandler.hpp>
-#include <xercesc/sax2/SAX2XMLReader.hpp>
-#include <xercesc/sax2/XMLReaderFactory.hpp>
-
-#include <xsd-frontend/xml.hxx>
-
-#include <cxx/literal-map.hxx>
-
-using namespace std;
-using namespace xercesc;
-namespace XML = XSDFrontend::XML;
-
-namespace CXX
-{
- class Handler: public DefaultHandler
- {
- public:
- struct Failed {};
-
- Handler (String const& file, StringLiteralMap& map)
- : state_ (s_init), file_ (file), map_ (map)
- {
- }
-
- virtual void
- setDocumentLocator (const Locator* const l)
- {
- locator_ = l;
- }
-
- virtual void
- startElement (const XMLCh* const,
- const XMLCh* const lname,
- const XMLCh* const,
- const xercesc::Attributes&)
- {
- String n (XML::transcode (lname));
-
- if (n == L"string-literal-map" && state_ == s_init)
- state_ = s_map;
- else if (n == L"entry" && state_ == s_map)
- {
- str_seen_ = false;
- lit_seen_ = false;
- state_ = s_entry;
- }
- else if (n == L"string" && state_ == s_entry)
- {
- str_seen_ = true;
- str_.clear ();
- state_ = s_string;
- }
- else if (n == L"literal" && state_ == s_entry)
- {
- lit_seen_ = true;
- lit_.clear ();
- state_ = s_literal;
- }
- else
- {
- wcerr << file_ << ":" << line () << ":" << col () << ": error: "
- << "unexpected element '" << n << "'" << endl;
- throw Failed ();
- }
- }
-
- virtual void
- endElement (const XMLCh* const,
- const XMLCh* const lname,
- const XMLCh* const)
- {
- String n (XML::transcode (lname));
-
- if (n == L"string-literal-map")
- state_ = s_init;
- else if (n == L"entry")
- {
- if (!str_seen_)
- {
- wcerr << file_ << ":" << line () << ":" << col () << ": error: "
- << "expected 'string' element" << endl;
- throw Failed ();
- }
-
- if (!lit_seen_)
- {
- wcerr << file_ << ":" << line () << ":" << col () << ": error: "
- << "expected 'literal' element" << endl;
- throw Failed ();
- }
-
- map_[str_] = lit_;
- state_ = s_map;
- }
- else if (n == L"string")
- state_ = s_entry;
- else if (n == L"literal")
- state_ = s_entry;
- }
-
- virtual void
- characters (const XMLCh* const s, const XMLSize_t length)
- {
- String str (XML::transcode (s, length));
-
- if (state_ == s_string)
- str_ += str;
- else if (state_ == s_literal)
- lit_ += str;
- else
- {
- for (size_t i (0); i < str.size (); ++i)
- {
- wchar_t c (str[i]);
-
- if (c != 0x20 && c != 0x0A && c != 0x0D && c != 0x09)
- {
- wcerr << file_ << ":" << line () << ":" << col () << ": error: "
- << "unexpected character data" << endl;
- throw Failed ();
- }
- }
- }
- }
-
- // Error hanlding.
- //
- enum Severity {s_warning, s_error, s_fatal};
-
- virtual void
- warning (const SAXParseException& e)
- {
- handle (e, s_warning);
- }
-
- virtual void
- error (const SAXParseException& e)
- {
- handle (e, s_error);
- }
-
- virtual void
- fatalError (const SAXParseException& e)
- {
- handle (e, s_fatal);
- }
-
- virtual void
- resetErrors ()
- {
- }
-
- void
- handle (const SAXParseException& e, Severity s)
- {
- String msg (XML::transcode (e.getMessage ()));
-
- wcerr << file_ << ":"
- << e.getLineNumber () << ":" << e.getColumnNumber () << ": "
- << (s == s_warning ? "warning: " : "error: ") << msg << endl;
-
- if (s != s_warning)
- throw Failed ();
- }
-
- size_t
- line () const
- {
- return locator_ != 0
- ? static_cast<size_t> (locator_->getLineNumber ())
- : 0;
- }
-
- size_t
- col () const
- {
- return locator_ != 0
- ? static_cast<size_t> (locator_->getColumnNumber ())
- : 0;
- }
-
- private:
- const Locator* locator_;
-
- enum
- {
- s_init,
- s_map,
- s_entry,
- s_string,
- s_literal
- } state_;
-
- String file_;
- StringLiteralMap& map_;
-
- bool str_seen_;
- bool lit_seen_;
-
- String str_;
- String lit_;
- };
-
- bool
- read_literal_map (NarrowString const& file, StringLiteralMap& map)
- {
- try
- {
- // Try to open the file with fstream. This way we get to
- // report the error in a consistent manner.
- //
- {
- ifstream ifs (file.c_str ());
- if (!ifs.is_open ())
- {
- wcerr << file.c_str () << ": unable to open in read mode" << endl;
- return false;
- }
- }
-
- String wfile (file);
-
- LocalFileInputSource is (XML::XMLChString (wfile).c_str ());
- Handler h (wfile, map);
-
- auto_ptr<SAX2XMLReader> parser (
- XMLReaderFactory::createXMLReader ());
-
- parser->setFeature (XMLUni::fgSAX2CoreNameSpaces, true);
- parser->setFeature (XMLUni::fgSAX2CoreNameSpacePrefixes, true);
- parser->setFeature (XMLUni::fgSAX2CoreValidation, false);
- parser->setFeature (XMLUni::fgXercesSchema, false);
- parser->setFeature (XMLUni::fgXercesSchemaFullChecking, false);
-
- parser->setErrorHandler (&h);
- parser->setContentHandler (&h);
-
- parser->parse (is);
- }
- catch (Handler::Failed const&)
- {
- return false;
- }
-
- return true;
- }
-}
diff --git a/xsd/cxx/literal-map.hxx b/xsd/cxx/literal-map.hxx
deleted file mode 100644
index cce9bf5..0000000
--- a/xsd/cxx/literal-map.hxx
+++ /dev/null
@@ -1,19 +0,0 @@
-// file : xsd/cxx/literal-map.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_LITERAL_MAP_HXX
-#define CXX_LITERAL_MAP_HXX
-
-#include <map>
-
-#include <types.hxx>
-
-namespace CXX
-{
- typedef std::map<String, String> StringLiteralMap;
-
- bool
- read_literal_map (NarrowString const& file, StringLiteralMap& map);
-}
-
-#endif // CXX_LITERAL_MAP_HXX
diff --git a/xsd/cxx/option-types.cxx b/xsd/cxx/option-types.cxx
deleted file mode 100644
index ec49d29..0000000
--- a/xsd/cxx/option-types.cxx
+++ /dev/null
@@ -1,47 +0,0 @@
-// file : xsd/cxx/option-types.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <istream>
-#include <ostream>
-
-#include <cxx/option-types.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- //
- // cxx_version
- //
-
- static const char* cxx_version_[] =
- {
- "c++98",
- "c++11"
- };
-
- string cxx_version::
- string () const
- {
- return cxx_version_[v_];
- }
-
- istream&
- operator>> (istream& is, cxx_version& v)
- {
- string s;
- is >> s;
-
- if (!is.fail ())
- {
- if (s == "c++98")
- v = cxx_version::cxx98;
- else if (s == "c++11")
- v = cxx_version::cxx11;
- else
- is.setstate (istream::failbit);
- }
-
- return is;
- }
-}
diff --git a/xsd/cxx/option-types.hxx b/xsd/cxx/option-types.hxx
deleted file mode 100644
index f36a6ca..0000000
--- a/xsd/cxx/option-types.hxx
+++ /dev/null
@@ -1,34 +0,0 @@
-// file : xsd/cxx/option-types.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef XSD_OPTION_TYPES_HXX
-#define XSD_OPTION_TYPES_HXX
-
-#include <iosfwd>
-#include <string>
-
-namespace CXX
-{
- struct cxx_version
- {
- enum value
- {
- cxx98,
- cxx11
- };
-
- cxx_version (value v = value (0)) : v_ (v) {}
- operator value () const {return v_;}
-
- std::string
- string () const;
-
- private:
- value v_;
- };
-
- std::istream&
- operator>> (std::istream&, cxx_version&);
-}
-
-#endif // XSD_OPTION_TYPES_HXX
diff --git a/xsd/cxx/options.cli b/xsd/cxx/options.cli
deleted file mode 100644
index 6e25949..0000000
--- a/xsd/cxx/options.cli
+++ /dev/null
@@ -1,550 +0,0 @@
-// file : xsd/cxx/options.cli
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-include <cstddef>; // std::size_t
-
-include <types.hxx>; // NarrowString, NarrowStrings
-
-include <cxx/option-types.hxx>;
-
-include <options.cli>;
-
-namespace CXX
-{
- class options: ::options = 0
- {
- // Language.
- //
- cxx_version --std = cxx_version::cxx98
- {
- "<version>",
- "Specify the C++ standard that the generated code should conform to.
- Valid values are \cb{c++98} (default) and \cb{c++11}.
-
- The C++ standard affects various aspects of the generated code that
- are discussed in more detail in various mapping-specific
- documentation. Overall, when C++11 is selected, the generated
- code relies on the move semantics and uses \cb{std::unique_ptr}
- instead of deprecated \cb{std::auto_ptr}.
-
- When the C++11 mode is selected, you normally don't need to
- perform any extra steps other than enable C++11 in your C++
- compiler, if required. The XSD compiler will automatically
- add the necessary macro defines to the generated header files
- that will switch the header-only XSD runtime library (\cb{libxsd})
- to the C++11 mode. However, if you include any of the XSD runtime
- headers directly in your application (normally you just include
- the generated headers), then you will need to define the
- \cb{XSD_CXX11} macro for your entire project."
- };
-
- // Character type and encoding.
- //
- NarrowString --char-type = "char"
- {
- "<type>",
- "Generate code using the provided character <type> instead of the
- default \cb{char}. Valid values are \cb{char} and \cb{wchar_t}."
- };
-
- NarrowString --char-encoding
- {
- "<enc>",
- "Specify the character encoding that should be used in the generated
- code. Valid values for the \cb{char} character type are \cb{utf8}
- (default), \cb{iso8859-1}, \cb{lcp} (Xerces-C++ local code page),
- and \cb{custom}. If you pass \cb{custom} as the value then you will
- need to include the transcoder implementation header for your
- encoding at the beginning of the generated header files (see the
- \cb{--hxx-prologue} option).
-
- For the \cb{wchar_t} character type the only valid value is \cb{auto}
- and the encoding is automatically selected between UTF-16 and
- UTF-32/UCS-4, depending on the \cb{wchar_t} type size."
- };
-
- // Output options.
- //
- NarrowString --output-dir
- {
- "<dir>",
- "Write generated files to <dir> instead of the current directory."
- };
-
- bool --generate-inline
- {
- "Generate simple functions inline. This option triggers creation of
- the inline file."
- };
-
- // Extern XML Schema.
- //
- bool --generate-xml-schema
- {
- "Generate a C++ header file as if the schema being compiled defines the
- XML Schema namespace. For the C++/Tree mapping, the resulting file will
- contain definitions for all XML Schema built-in types. For the
- C++/Parser mapping, the resulting file will contain definitions for
- all the parser skeletons and implementations corresponding to the
- XML Schema built-in types.
-
- The schema file provided to the compiler need not exist and is only
- used to derive the name of the resulting header file. Use the
- \cb{--extern-xml-schema} option to include this file in the
- generated files for other schemas."
- };
-
- NarrowString --extern-xml-schema
- {
- "<file>",
- "Include a header file derived from <file> instead of generating the
- XML Schema namespace mapping inline. The provided file need not
- exist and is only used to derive the name of the included header
- file. Use the \cb{--generate-xml-schema} option to generate this
- header file."
- };
-
- // Namespace mapping.
- //
- NarrowStrings --namespace-map
- {
- "<xns>=<cns>",
- "Map XML Schema namespace <xns> to C++ namespace <cns>. Repeat
- this option to specify mapping for more than one XML Schema namespace.
- For example, the following option:
-
- \cb{--namespace-map http://example.com/foo/bar=foo::bar}
-
- Will map the \cb{http://example.com/foo/bar} XML Schema namespace to
- the \cb{foo::bar} C++ namespace."
- };
-
- NarrowStrings --namespace-regex
- {
- "<regex>",
- "Add <regex> to the list of regular expressions used to translate XML
- Schema namespace names to C++ namespace names. <regex> is a Perl-like
- regular expression in the form
- \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}. Any character can be
- used as a delimiter instead of '\cb{/}'. Escaping of the delimiter
- character in \ci{pattern} or \ci{replacement} is not supported.
-
- All the regular expressions are pushed into a stack with the last
- specified expression considered first. The first match that
- succeeds is used. Regular expressions are applied to a string in
- the form
-
- \c{\i{filename} \i{namespace}}
-
- For example, if you have file \cb{hello.xsd} with namespace
- \cb{http://example.com/hello} and you run \cb{xsd} on this file,
- then the string in question will be:
-
- \cb{hello.xsd. http://example.com/hello}
-
- For the built-in XML Schema namespace the string is:
-
- \cb{XMLSchema.xsd http://www.w3.org/2001/XMLSchema}
-
- The following three steps are performed for each regular expression
- until the match is found:
-
- 1. The expression is applied and if the result is empty the next
- expression is considered.
-
- 2. All '\cb{/}' are replaced with '\cb{::}'.
-
- 3. The result is verified to be a valid C++ scope name (e.g.,
- \cb{foo::bar}). If this test succeeds, the result is used as a
- C++ namespace name.
-
- As an example, the following expression maps XML Schema namespaces
- in the form \cb{http://example.com/foo/bar} to C++ namespaces in the
- form \cb{foo::bar}:
-
- \cb{%.* http://example.com/(.+)%$1%}
-
- See also the REGEX AND SHELL QUOTING section below."
- };
-
- bool --namespace-regex-trace
- {
- "Trace the process of applying regular expressions specified with the
- \cb{--namespace-regex} option. Use this option to find out why your
- regular expressions don't do what you expected them to do."
- };
-
- // Reserved names.
- //
- NarrowStrings --reserved-name
- {
- "<n>[=<r>]",
- "Add name <n> to the list of names that should not be used as
- identifiers. The name can optionally be followed by \cb{=} and the
- replacement name <r> that should be used instead. All the C++ keywords
- are already in this list."
- };
-
- // Include options.
- //
- bool --include-with-brackets
- {
- "Use angle brackets (<>) instead of quotes (\"\") in generated
- \cb{#include} directives."
- };
-
- NarrowString --include-prefix
- {
- "<prefix>",
- "Add <prefix> to generated \cb{#include} directive paths.
-
- For example, if you had the following import element in your schema
-
- \cb{<import namespace=\"...\" schemaLocation=\"base.xsd\"/>}
-
- and compiled this fragment with \cb{--include-prefix schemas/}, then
- the include directive in the generated code would be:
-
- \cb{#include \"schemas/base.hxx\"}"
- };
-
- NarrowStrings --include-regex
- {
- "<regex>",
- "Add <regex> to the list of regular expressions used to transform
- \cb{#include} directive paths. <regex> is a Perl-like regular
- expression in the form \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}.
- Any character can be used as a delimiter instead of '\cb{/}'. Escaping
- of the delimiter character in \ci{pattern} or \ci{replacement} is not
- supported.
-
- All the regular expressions are pushed into a stack with the last
- specified expression considered first. The first match that succeeds
- is used.
-
- As an example, the following expression transforms paths in the form
- \cb{schemas/foo/bar} to paths in the form \cb{generated/foo/bar}:
-
- \cb{%schemas/(.+)%generated/$1%}
-
- See also the REGEX AND SHELL QUOTING section below."
- };
-
- bool --include-regex-trace
- {
- "Trace the process of applying regular expressions specified with the
- \cb{--include-regex} option. Use this option to find out why your
- regular expressions don't do what you expected them to do."
- };
-
- NarrowString --guard-prefix
- {
- "<prefix>",
- "Add <prefix> to generated header inclusion guards. The prefix is
- transformed to upper case and characters that are illegal in a
- preprocessor macro name are replaced with underscores. If this
- option is not specified then the directory part of the input schema
- file is used as a prefix."
- };
-
- // File suffixes.
- //
- NarrowString --hxx-suffix = ".hxx"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{.hxx} to
- construct the name of the header file. Note that this suffix is also
- used to construct names of header files corresponding to
- included/imported schemas."
- };
-
- NarrowString --ixx-suffix = ".ixx"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{.ixx} to
- construct the name of the inline file."
- };
-
- NarrowString --cxx-suffix = ".cxx"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{.cxx} to
- construct the name of the source file."
- };
-
- NarrowString --fwd-suffix = "-fwd.hxx"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{-fwd.hxx} to
- construct the name of the forward declaration file."
- };
-
- NarrowString --hxx-regex
- {
- "<regex>",
- "Use the provided expression to construct the name of the header file.
- <regex> is a Perl-like regular expression in the form
- \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}.
- Note that this expression is also used to construct names of header
- files corresponding to included/imported schemas. See also the REGEX
- AND SHELL QUOTING section below."
- };
-
- NarrowString --ixx-regex
- {
- "<regex>",
- "Use the provided expression to construct the name of the inline file.
- <regex> is a Perl-like regular expression in the form
- \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}. See also the REGEX AND
- SHELL QUOTING section below."
- };
-
- NarrowString --cxx-regex
- {
- "<regex>",
- "Use the provided expression to construct the name of the source file.
- <regex> is a Perl-like regular expression in the form
- \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}. See also the REGEX AND
- SHELL QUOTING section below."
- };
-
- NarrowString --fwd-regex
- {
- "<regex>",
- "Use the provided expression to construct the name of the forward
- declaration file. <regex> is a Perl-like regular expression in the
- form \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}. See also the REGEX
- AND SHELL QUOTING section below."
- };
-
- // Prologues/epilogues.
- //
- NarrowStrings --hxx-prologue
- {
- "<text>",
- "Insert <text> at the beginning of the header file."
- };
-
- NarrowStrings --ixx-prologue
- {
- "<text>",
- "Insert <text> at the beginning of the inline file."
- };
-
- NarrowStrings --cxx-prologue
- {
- "<text>",
- "Insert <text> at the beginning of the source file."
- };
-
- NarrowStrings --fwd-prologue
- {
- "<text>",
- "Insert <text> at the beginning of the forward declaration file."
- };
-
- NarrowStrings --prologue
- {
- "<text>",
- "Insert <text> at the beginning of each generated file for which
- there is no file-specific prologue."
- };
-
- NarrowStrings --hxx-epilogue
- {
- "<text>",
- "Insert <text> at the end of the header file."
- };
-
- NarrowStrings --ixx-epilogue
- {
- "<text>",
- "Insert <text> at the end of the inline file."
- };
-
- NarrowStrings --cxx-epilogue
- {
- "<text>",
- "Insert <text> at the end of the source file."
- };
-
- NarrowStrings --fwd-epilogue
- {
- "<text>",
- "Insert <text> at the end of the forward declaration file."
- };
-
- NarrowStrings --epilogue
- {
- "<text>",
- "Insert <text> at the end of each generated file for which there
- is no file-specific epilogue."
- };
-
- NarrowString --hxx-prologue-file
- {
- "<file>",
- "Insert the content of the <file> at the beginning of the header file."
- };
-
- NarrowString --ixx-prologue-file
- {
- "<file>",
- "Insert the content of the <file> at the beginning of the inline file."
- };
-
- NarrowString --cxx-prologue-file
- {
- "<file>",
- "Insert the content of the <file> at the beginning of the source file."
- };
-
- NarrowString --fwd-prologue-file
- {
- "<file>",
- "Insert the content of the <file> at the beginning of the forward
- declaration file."
- };
-
- NarrowString --prologue-file
- {
- "<file>",
- "Insert the content of the <file> at the beginning of each generated
- file for which there is no file-specific prologue file."
- };
-
- NarrowString --hxx-epilogue-file
- {
- "<file>",
- "Insert the content of the <file> at the end of the header file."
- };
-
- NarrowString --ixx-epilogue-file
- {
- "<file>",
- "Insert the content of the <file> at the end of the inline file."
- };
-
- NarrowString --cxx-epilogue-file
- {
- "<file>",
- "Insert the content of the <file> at the end of the source file."
- };
-
- NarrowString --fwd-epilogue-file
- {
- "<file>",
- "Insert the content of the <file> at the end of the forward declaration
- file."
- };
-
- NarrowString --epilogue-file
- {
- "<file>",
- "Insert the content of the <file> at the end of each generated file
- for which there is no file-specific epilogue file."
- };
-
- // Export options.
- //
- NarrowString --export-symbol
- {
- "<symbol>",
- "Insert <symbol> in places where DLL export/import control statements
- (\cb{__declspec(dllexport/dllimport)}) are necessary."
- };
-
- bool --export-xml-schema
- {
- "Export/import types in the XML Schema namespace using the export
- symbol provided with the \cb{--export-symbol} option. The
- \cb{XSD_NO_EXPORT} macro can be used to omit this code during C++
- compilation, which may be useful if you would like to use the same
- generated code across multiple platforms."
- };
-
- bool --export-maps
- {
- "Export polymorphism support maps from a Win32 DLL into which this
- generated code is placed. This is necessary when your type hierarchy
- is split across several DLLs since otherwise each DLL will have its
- own set of maps. In this situation the generated code for the DLL
- which contains base types and/or substitution group heads should be
- compiled with this option and the generated code for all other DLLs
- should be compiled with \cb{--import-maps}. This option is only valid
- together with \cb{--generate-polymorphic}. The \cb{XSD_NO_EXPORT}
- macro can be used to omit this code during C++ compilation, which may
- be useful if you would like to use the same generated code across
- multiple platforms."
- };
-
- bool --import-maps
- {
- "Import polymorphism support maps to a Win32 DLL or executable into
- which this generated code is linked. See the \cb{--export-maps}
- option documentation for details. This options is only valid together
- with \cb{--generate-polymorphic}. The \cb{XSD_NO_EXPORT} macro can be
- used to omit this code during C++ compilation, which may be useful if
- you would like to use the same generated code across multiple
- platforms."
- };
-
- // Make dependency generation.
- //
- bool --generate-dep
- {
- "Generate \cb{make} dependency information. This option triggers the
- creation of the \cb{.d} file containing the dependencies of the
- generated files on the main schema file as well as all the schema
- files that it includes/imports, transitively. This dependency file
- is then normally included into the main \cb{makefile} to implement
- automatic dependency tracking.
-
- Note also that automatic dependency generation is not supported in
- the file-per-type mode (\cb{--file-per-type}). In this case, all
- the generated files are produced with a single compiler invocation
- and depend on all the schemas. As a result, it is easier to establish
- such a dependency manually, perhaps with the help of the
- \cb{--file-list*} options."
- };
-
- bool --generate-dep-only
- {
- "Generate \cb{make} dependency information only."
- };
-
- bool --dep-phony
- {
- "Generate phony targets for included/imported schema files, causing
- each to depend on nothing. Such dummy rules work around \cb{make}
- errors caused by the removal of schema files without also updating
- the dependency file to match."
- };
-
- NarrowStrings --dep-target
- {
- "<target>",
- "Change the target of the dependency rule. By default it contains
- all the generated C++ files as well as the dependency file itself,
- without any directory prefixes. If you require multiple targets,
- then you can specify them as a single, space-separated argument or
- you can repeat this option multiple times."
- };
-
- NarrowString --dep-suffix = ".d"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{.d} to
- construct the name of the dependency file."
- };
-
- NarrowString --dep-regex
- {
- "<regex>",
- "Use the provided expression to construct the name of the dependency
- file. <regex> is a Perl-like regular expression in the form
- \c{\b{/}\i{pattern}\b{/}\i{replacement}\b{/}}. See also the REGEX
- AND SHELL QUOTING section below."
- };
- };
-}
diff --git a/xsd/cxx/parser/attribute-validation-source.cxx b/xsd/cxx/parser/attribute-validation-source.cxx
deleted file mode 100644
index 76a3923..0000000
--- a/xsd/cxx/parser/attribute-validation-source.cxx
+++ /dev/null
@@ -1,412 +0,0 @@
-// file : xsd/cxx/parser/attribute-validation-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/attribute-validation-source.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Test: Traversal::Attribute,
- Traversal::AnyAttribute,
- Context
- {
- Test (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Attribute& a)
- {
- String const& name (a.name ());
-
- if (a.qualified_p () && a.namespace_ ().name ())
- {
- String const& ns (a.namespace_ ().name ());
-
- os << "n == " << strlit (name) << " &&" << endl
- << "ns == " << strlit (ns);
- }
- else
- os << "n == " << strlit (name) << " && ns.empty ()";
- }
-
- virtual void
- traverse (SemanticGraph::AnyAttribute& a)
- {
- String const& ns (a.definition_namespace ().name ());
-
- for (SemanticGraph::AnyAttribute::NamespaceIterator
- i (a.namespace_begin ()), e (a.namespace_end ()); i != e;)
- {
- if (*i == L"##any")
- {
- os << "!n.empty ()";
- }
- else if (*i == L"##other")
- {
- if (ns)
- {
- // Note that here I assume that ##other does not include
- // unqualified names in a schema with target namespace.
- // This is not what the spec says but that seems to be
- // the consensus.
- //
- os << "(!ns.empty () && ns != " << strlit (ns) << ")";
- }
- else
- os << "!ns.empty ()";
- }
- else if (*i == L"##local")
- {
- os << "(ns.empty () && !n.empty ())";
- }
- else if (*i == L"##targetNamespace")
- {
- os << "ns == " << strlit (ns);
- }
- else
- {
- os << "ns == " << strlit (*i);
- }
-
- if (++i != e)
- os << " ||" << endl;
- }
- }
- };
-
- //
- //
- struct PhaseOne: Traversal::Attribute, Context
- {
- PhaseOne (Context& c)
- : Context (c), test_ (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- String const& name (ename (a));
- String const& inst (emember (a));
-
- SemanticGraph::Type& type (a.type ());
- String const& post (post_name (type));
- String const& ret (ret_type (type));
-
- os << "if (";
-
- test_.traverse (a);
-
- os << ")"
- << "{"
- << "if (this->" << inst << ")"
- << "{"
- << "this->" << inst << "->pre ();"
- << "this->" << inst << "->_pre_impl ();"
- << "this->" << inst << "->_characters (s);"
- << "this->" << inst << "->_post_impl ();";
-
- if (ret == L"void")
- os << "this->" << inst << "->" << post << " ();"
- << "this->" << name << " ();";
- else
- {
- // Don't create an lvalue in C++11 (think std::unique_ptr).
- // In C++98 we do it for compatibility with older/broken
- // compilers (e.g., IBM xlC that needs an lvalue to pass
- // std::auto_ptr).
- //
- if (std == cxx_version::cxx98)
- os << arg_type (type) << " tmp (this->" << inst << "->" <<
- post << " ());"
- << "this->" << name << " (tmp);";
- else
- os << "this->" << name << " (this->" << inst << "->" <<
- post << " ());";
- }
-
- os << "}";
-
- if (!a.optional_p ())
- os << "static_cast< v_state_attr_* > (" <<
- "this->v_state_attr_stack_.top ())->" << name << " = true;";
-
- os << "return true;"
- << "}";
- }
-
- private:
- Test test_;
- };
-
-
- //
- //
- struct PhaseTwo: Traversal::AnyAttribute, Context
- {
- PhaseTwo (Context& c)
- : Context (c), test_ (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- os << "if (";
-
- test_.traverse (a);
-
- os << ")" << endl
- << "{"
- << "this->_any_attribute (ns, n, s);"
- << "return true;"
- << "}";
- }
-
- private:
- Test test_;
- };
-
-
- //
- //
- struct AttributeStateInit: Traversal::Attribute, Context
- {
- AttributeStateInit (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- if (!a.optional_p ())
- os << "as." << ename (a) << " = false;";
- }
- };
-
-
- //
- //
- struct AttributeStateCheck: Traversal::Attribute, Context
- {
- AttributeStateCheck (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- if (!a.optional_p ())
- {
- String ns (a.qualified_p () ? a.namespace_ ().name () : String ());
-
- os << "if (!as." << ename (a) << ")" << endl
- << "this->_expected_attribute (" << endl
- << strlit (ns) << ", " << strlit (a.name ()) << ");";
- }
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c),
- phase_one_ (c),
- phase_two_ (c),
- attribute_state_init_ (c),
- attribute_state_check_ (c)
- {
- names_phase_one_ >> phase_one_;
- names_phase_two_ >> phase_two_;
-
- names_attribute_state_init_ >> attribute_state_init_;
- names_attribute_state_check_ >> attribute_state_check_;
- }
-
- virtual void
- traverse (Type& c)
- {
- bool has_att (has<Traversal::Attribute> (c));
- bool has_any (has<Traversal::AnyAttribute> (c));
-
- if (!has_att && !has_any)
- return;
-
- bool has_req_att (false);
- if (has_att)
- {
- RequiredAttributeTest test (has_req_att);
- Traversal::Names names_test (test);
- names (c, names_test);
- }
-
- String const& name (ename (c));
-
- os <<"// Attribute validation and dispatch functions for " <<
- name << "." << endl
- <<"//" << endl;
-
- if (has_att)
- {
- // _attribute_impl_phase_one
- //
- os << "bool " << name << "::" << endl
- << "_attribute_impl_phase_one (const " << string_type <<
- "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "& s)" << endl
- << "{";
-
- names (c, names_phase_one_);
-
- // Nothing matched - call our base (extension) or return false
- // if there is no base (or restriction (even from anyType)).
- //
- os << "return ";
-
- if (c.inherits_p () &&
- !c.inherits ().is_a<SemanticGraph::Restricts> ())
- {
- os << "this->" << fq_name (c.inherits ().base ()) <<
- "::_attribute_impl_phase_one (ns, n, s);";
- }
- else
- os << "false;";
-
- os << "}";
- }
-
-
- if (has_any)
- {
- // _attribute_impl_phase_two
- //
- os << "bool " << name << "::" << endl
- << "_attribute_impl_phase_two (const " << string_type <<
- "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "& s)"
- << "{";
-
- names (c, names_phase_two_);
-
- // Nothing matched - call our base (extension) or return false
- // if there is no base (or restriction (even from anyType)).
- //
- os << "return ";
-
- if (c.inherits_p () &&
- !c.inherits ().is_a<SemanticGraph::Restricts> ())
- {
- os << "this->" << fq_name (c.inherits ().base ()) <<
- "::_attribute_impl_phase_two (ns, n, s);";
- }
- else
- os << "false;";
-
- os << "}";
- }
-
- if (has_req_att)
- {
- // _pre_a_validate
- //
- os << "void " << name << "::" << endl
- << "_pre_a_validate ()"
- << "{"
- << "this->v_state_attr_stack_.push ();"
- << "v_state_attr_& as = *static_cast< v_state_attr_* > (" <<
- "this->v_state_attr_stack_.top ());"
- << endl;
-
- names (c, names_attribute_state_init_);
-
- // Call our base (extension) last.
- //
- if (c.inherits_p () &&
- !c.inherits ().is_a<SemanticGraph::Restricts> ())
- {
- os << "this->" << fq_name (c.inherits ().base ()) <<
- "::_pre_a_validate ();";
- }
-
- os << "}";
-
-
- // _post_a_validate
- //
- os << "void " << name << "::" << endl
- << "_post_a_validate ()"
- << "{";
-
- // Call our base (extension) first.
- //
- if (c.inherits_p () &&
- !c.inherits ().is_a<SemanticGraph::Restricts> ())
- {
- os << "this->" << fq_name (c.inherits ().base ()) <<
- "::_post_a_validate ();"
- << endl;
- }
-
- os << "v_state_attr_& as = *static_cast< v_state_attr_* > (" <<
- "this->v_state_attr_stack_.top ());"
- << endl;
-
- names (c, names_attribute_state_check_);
-
- os << endl
- << "this->v_state_attr_stack_.pop ();"
- << "}";
- }
- }
-
- private:
- PhaseOne phase_one_;
- Traversal::Names names_phase_one_;
-
- PhaseTwo phase_two_;
- Traversal::Names names_phase_two_;
-
- AttributeStateInit attribute_state_init_;
- Traversal::Names names_attribute_state_init_;
-
- AttributeStateCheck attribute_state_check_;
- Traversal::Names names_attribute_state_check_;
- };
- }
-
- void
- generate_attribute_validation_source (Context& ctx)
- {
- Traversal::Schema schema;
-
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- Complex complex (ctx);
-
- names >> complex;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/attribute-validation-source.hxx b/xsd/cxx/parser/attribute-validation-source.hxx
deleted file mode 100644
index 25d7d96..0000000
--- a/xsd/cxx/parser/attribute-validation-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/attribute-validation-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_ATTRIBUTE_VALIDATION_SOURCE_HXX
-#define CXX_PARSER_ATTRIBUTE_VALIDATION_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_attribute_validation_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_ATTRIBUTE_VALIDATION_SOURCE_HXX
diff --git a/xsd/cxx/parser/characters-validation-source.cxx b/xsd/cxx/parser/characters-validation-source.cxx
deleted file mode 100644
index 3f3e88c..0000000
--- a/xsd/cxx/parser/characters-validation-source.cxx
+++ /dev/null
@@ -1,73 +0,0 @@
-// file : xsd/cxx/parser/characters-validation-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/characters-validation-source.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& c)
- {
- if (!c.mixed_p ())
- return;
-
- String const& name (ename (c));
-
- os <<"// Character validation functions for " << name << "." << endl
- <<"//" << endl;
-
- // _characters_impl
- //
- os << "bool " << name << "::" << endl
- << "_characters_impl (const " << string_type << "& s)"
- << "{"
- << "this->_any_characters (s);"
- << "return true;"
- << "}";
- }
- };
- }
-
- void
- generate_characters_validation_source (Context& ctx)
- {
- //@@ Most of the time there is no mixed content type so
- // we generate an empty namespace which looks ugly. Will
- // need to implement smart namespace to handle this at
- // some point.
- //
- Traversal::Schema schema;
-
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- Complex complex (ctx);
-
- names >> complex;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/characters-validation-source.hxx b/xsd/cxx/parser/characters-validation-source.hxx
deleted file mode 100644
index d0c73c4..0000000
--- a/xsd/cxx/parser/characters-validation-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/characters-validation-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_CHARACTERS_VALIDATION_SOURCE_HXX
-#define CXX_PARSER_CHARACTERS_VALIDATION_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_characters_validation_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_CHARACTERS_VALIDATION_SOURCE_HXX
diff --git a/xsd/cxx/parser/driver-source.cxx b/xsd/cxx/parser/driver-source.cxx
deleted file mode 100644
index 48775eb..0000000
--- a/xsd/cxx/parser/driver-source.cxx
+++ /dev/null
@@ -1,775 +0,0 @@
-// file : xsd/cxx/parser/driver-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <set>
-#include <map>
-#include <sstream>
-
-#include <cxx/parser/driver-source.hxx>
-#include <cxx/parser/print-impl-common.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- typedef map<SemanticGraph::Type*, String> TypeInstanceMap;
- typedef set<String> InstanceSet;
-
- // For base types we only want member's types, but not the
- // base itself.
- //
- struct BaseType: Traversal::Complex,
- Traversal::List,
- Context
- {
- BaseType (Context& c, Traversal::NodeBase& def)
- : Context (c), def_ (def)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c);
-
- if (!restriction_p (c))
- names (c);
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- def_.dispatch (l.argumented ().type ());
- }
-
- private:
- Traversal::NodeBase& def_;
- };
-
- struct ParserDef: Traversal::Type,
- Traversal::List,
- Traversal::Complex,
-
- Traversal::AnyType,
- Traversal::AnySimpleType,
-
- Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Traversal::Fundamental::Entity,
- Traversal::Fundamental::Entities,
-
- Context
- {
- ParserDef (Context& c, TypeInstanceMap& map, InstanceSet& set)
- : Context (c), map_ (map), set_ (set), base_ (c, *this)
- {
- *this >> inherits_ >> base_ >> inherits_;
-
- *this >> names_;
- base_ >> names_;
-
- names_ >> member_ >> belongs_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::Type& t)
- {
- if (map_.find (&t) == map_.end ())
- {
- String inst (find_instance_name (t));
- map_[&t] = inst;
-
- os << fq_name (t, "impl") << " " << inst << ";";
- }
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- if (map_.find (&l) == map_.end ())
- {
- String inst (find_instance_name (l));
- map_[&l] = inst;
-
- os << fq_name (l, "impl") << " " << inst << ";";
-
- dispatch (l.argumented ().type ());
- }
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- if (map_.find (&c) == map_.end ())
- {
- String inst (find_instance_name (c));
- map_[&c] = inst;
-
- os << fq_name (c, "impl") << " " << inst << ";";
-
- inherits (c);
-
- if (!restriction_p (c))
- names (c);
- }
- }
-
- // anyType & anySimpleType.
- //
- virtual void
- traverse (SemanticGraph::AnyType& t)
- {
- fund_type (t, "any_type");
- }
-
- virtual void
- traverse (SemanticGraph::AnySimpleType& t)
- {
- fund_type (t, "any_simple_type");
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- fund_type (t, "boolean");
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- fund_type (t, "byte");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- fund_type (t, "unsigned_byte");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- fund_type (t, "short");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- fund_type (t, "unsigned_short");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- fund_type (t, "int");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- fund_type (t, "unsigned_int");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- fund_type (t, "long");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- fund_type (t, "unsigned_long");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- fund_type (t, "integer");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- fund_type (t, "non_positive_integer");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- fund_type (t, "non_negative_integer");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- fund_type (t, "positive_integer");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- fund_type (t, "negative_integer");
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- fund_type (t, "float");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- fund_type (t, "double");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- fund_type (t, "decimal");
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- fund_type (t, "string");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- fund_type (t, "normalized_string");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- fund_type (t, "token");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- fund_type (t, "nmtoken");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens& t)
- {
- fund_type (t, "nmtokens");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- fund_type (t, "name");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- fund_type (t, "ncname");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language& t)
- {
- fund_type (t, "language");
- }
-
-
- // Qualified name.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- fund_type (t, "qname");
- }
-
-
- // ID/IDREF.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- fund_type (t, "id");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- fund_type (t, "idref");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs& t)
- {
- fund_type (t, "idrefs");
- }
-
- // URI.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI& t)
- {
- fund_type (t, "uri");
- }
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- fund_type (t, "base64_binary");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- fund_type (t, "hex_binary");
- }
-
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- fund_type (t, "date");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- fund_type (t, "date_time");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- fund_type (t, "duration");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- fund_type (t, "day");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- fund_type (t, "month");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- fund_type (t, "month_day");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- fund_type (t, "year");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- fund_type (t, "year_month");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- fund_type (t, "time");
- }
-
- // Entity.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Entity& t)
- {
- fund_type (t, "entity");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities& t)
- {
- fund_type (t, "entities");
- }
-
- private:
- virtual void
- fund_type (SemanticGraph::Type& t, String const& name)
- {
- if (map_.find (&t) == map_.end ())
- {
- String inst (find_instance_name (name));
- map_[&t] = inst;
-
- os << fq_name (t, "impl") << " " << inst << ";";
- }
- }
-
- String
- find_instance_name (String const& raw_name)
- {
- String base_name (escape (raw_name + L"_p"));
- String name (base_name);
-
- for (size_t i (1); set_.find (name) != set_.end (); ++i)
- {
- std::wostringstream os;
- os << i;
- name = base_name + os.str ();
- }
-
- set_.insert (name);
- return name;
- }
-
- String
- find_instance_name (SemanticGraph::Type& t)
- {
- return find_instance_name (t.name ());
- }
-
- TypeInstanceMap& map_;
- InstanceSet& set_;
-
- BaseType base_;
- Traversal::Inherits inherits_;
-
- Traversal::Names names_;
- Traversal::Member member_;
- Traversal::Belongs belongs_;
- };
-
- struct ArgList: Traversal::Complex,
- Traversal::List,
- Traversal::Member,
- Context
- {
- ArgList (Context& c, TypeInstanceMap& map)
- : Context (c), map_ (map), first_ (true)
- {
- inherits_ >> *this;
- names_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
-
- if (!restriction_p (c))
- names (c, names_);
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- if (!first_)
- os << "," << endl;
- else
- first_ = false;
-
- os << map_[&l.argumented ().type ()];
- }
-
- virtual void
- traverse (SemanticGraph::Member& m)
- {
- if (skip (m))
- return;
-
- if (!first_)
- os << "," << endl;
- else
- first_ = false;
-
- os << map_[&m.type ()];
- }
-
- private:
- TypeInstanceMap& map_;
-
- Traversal::Inherits inherits_;
- Traversal::Names names_;
-
- bool first_;
- };
-
- struct ParserConnect: Traversal::List,
- Traversal::Complex,
- Context
- {
- ParserConnect (Context& c, TypeInstanceMap& map)
- : Context (c), map_ (map), base_ (c, *this)
- {
- *this >> inherits_ >> base_ >> inherits_;
-
- *this >> names_;
- base_ >> names_;
-
- names_ >> member_ >> belongs_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- if (type_set_.find (&l) == type_set_.end ())
- {
- os << map_[&l] << ".parsers (" <<
- map_[&l.argumented ().type ()] << ");"
- << endl;
-
- type_set_.insert (&l);
- }
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- if (type_set_.find (&c) == type_set_.end ())
- {
- if (has_members (c))
- {
- os << map_[&c] << ".parsers (";
-
- ArgList args (*this, map_);
- args.dispatch (c);
-
- os << ");"
- << endl;
- }
-
- type_set_.insert (&c);
-
- inherits (c);
-
- if (!restriction_p (c))
- names (c);
- }
- }
-
- private:
- bool
- has_members (SemanticGraph::Complex& c)
- {
- using SemanticGraph::Complex;
-
- if (has<Traversal::Member> (c))
- return true;
-
- if (c.inherits_p ())
- {
- SemanticGraph::Type& b (c.inherits ().base ());
-
- if (Complex* cb = dynamic_cast<Complex*> (&b))
- return has_members (*cb);
-
- return b.is_a<SemanticGraph::List> ();
- }
-
- return false;
- }
-
- private:
- TypeInstanceMap& map_;
- set<SemanticGraph::Type*> type_set_;
-
- BaseType base_;
- Traversal::Inherits inherits_;
-
- Traversal::Names names_;
- Traversal::Member member_;
- Traversal::Belongs belongs_;
- };
- }
-
- void
- generate_driver_source (Context& ctx)
- {
- // Figure out the root element. Validator should have made sure
- // it is unique.
- //
- SemanticGraph::Element* root (0);
- {
- Traversal::Schema schema;
- Sources sources;
-
- schema >> sources >> schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- RootElement root_element (ctx.options, root);
-
- schema >> schema_names >> ns >> ns_names >> root_element;
-
- schema.dispatch (ctx.schema_root);
- }
-
- std::wostream& os (ctx.os);
- String const& L (ctx.L);
- String const& cerr (ctx.cerr_inst);
-
- InstanceSet set;
- TypeInstanceMap map;
- SemanticGraph::Type& root_type (root->type ());
-
- set.insert ("doc_p");
-
- os << "#include <iostream>" << endl
- << endl
- << "int" << endl
- << "main (int argc, char* argv[])"
- << "{"
- << "if (argc != 2)"
- << "{"
- << cerr << " << " << L << "\"usage: \" << argv[0] << " <<
- L << "\" file.xml\" << std::endl;"
- << "return 1;"
- << "}"
- << "try"
- << "{"
- << "// Instantiate individual parsers." << endl
- << "//" << endl;
-
- {
- ParserDef def (ctx, map, set);
- def.dispatch (root_type);
- }
-
- os << endl
- << "// Connect the parsers together." << endl
- << "//" << endl;
-
- {
- ParserConnect connect (ctx, map);
- connect.dispatch (root_type);
- }
-
- String const& root_p (map[&root_type]);
-
- os << "// Parse the XML document." << endl
- << "//" << endl;
-
- if (root->namespace_().name ())
- os << ctx.xs_ns_name () << "::document doc_p (" << endl
- << root_p << "," << endl
- << ctx.strlit (root->namespace_().name ()) << "," << endl
- << ctx.strlit (root->name ()) << ");"
- << endl;
- else
- os << ctx.xs_ns_name () << "::document doc_p (" << root_p << ", " <<
- ctx.strlit (root->name ()) << ");"
- << endl;
-
- os << root_p << ".pre ();"
- << "doc_p.parse (argv[1]);";
-
- String const& ret (Context::ret_type (root_type));
- String const& post (Context::post_name (root_type));
-
- if (ret == L"void")
- os << root_p << "." << post << " ();";
- else
- {
- os << Context::arg_type (root_type) << " v (" <<
- root_p << "." << post << " ());"
- << endl;
-
- if (ctx.options.generate_print_impl ())
- {
- PrintCall t (ctx, root->name (), "v");
- t.dispatch (root_type);
- }
- else
- os << "// TODO" << endl
- << "//" << endl;
- }
-
- os << "}" // try
- << "catch (const " << ctx.xs_ns_name () << "::exception& e)"
- << "{"
- << cerr << " << e << std::endl;"
- << "return 1;"
- << "}"
- << "catch (const std::ios_base::failure&)"
- << "{"
- << cerr << " << argv[1] << " <<
- L << "\": error: io failure\" << std::endl;"
- << "return 1;"
- << "}"
- << "}";
- }
- }
-}
diff --git a/xsd/cxx/parser/driver-source.hxx b/xsd/cxx/parser/driver-source.hxx
deleted file mode 100644
index d1c7f91..0000000
--- a/xsd/cxx/parser/driver-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/driver-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_DRIVER_SOURCE_HXX
-#define CXX_PARSER_DRIVER_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_driver_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_DRIVER_SOURCE_HXX
diff --git a/xsd/cxx/parser/element-validation-source.cxx b/xsd/cxx/parser/element-validation-source.cxx
deleted file mode 100644
index b34b3dd..0000000
--- a/xsd/cxx/parser/element-validation-source.cxx
+++ /dev/null
@@ -1,1600 +0,0 @@
-// file : xsd/cxx/parser/element-validation-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <vector>
-
-#include <cxx/parser/element-validation-source.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- typedef vector<SemanticGraph::Particle*> Particles;
-
- //
- //
- struct ParticleTest: Traversal::Compositor,
- Traversal::Element,
- Traversal::Any,
- Context
- {
- ParticleTest (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- String const& name (e.name ());
-
- if (polymorphic && e.global_p ())
- os << "(";
-
- if (e.qualified_p () && e.namespace_ ().name ())
- {
- String const& ns (e.namespace_ ().name ());
-
- os << "n == " << strlit (name) << " &&" << endl
- << "ns == " << strlit (ns);
- }
- else
- os << "n == " << strlit (name) << " && ns.empty ()";
-
-
- // Only a globally-defined element can be a subst-group root.
- //
- if (polymorphic && e.global_p ())
- {
- os << ") ||" << endl
- << "::xsd::cxx::parser::substitution_map_instance< " <<
- char_type << " > ().check (" << endl
- << "ns, n, " << strlit (e.namespace_ ().name ()) <<
- ", " << strlit (name) << ", t)";
- }
- }
-
- virtual void
- traverse (SemanticGraph::Any& a)
- {
- String const& ns (a.definition_namespace ().name ());
-
- // Note that we need to make sure the "flush" element (both name
- // and namespace are empty) does not match any compositor.
- //
- for (SemanticGraph::Any::NamespaceIterator i (a.namespace_begin ()),
- e (a.namespace_end ()); i != e;)
- {
- if (*i == L"##any")
- {
- os << "!n.empty ()";
- }
- else if (*i == L"##other")
- {
- if (ns)
- {
- // Note that here I assume that ##other does not include
- // unqualified names in a schema with target namespace.
- // This is not what the spec says but that seems to be
- // the consensus.
- //
- os << "(!ns.empty () && ns != " << strlit (ns) << ")";
- }
- else
- os << "!ns.empty ()";
- }
- else if (*i == L"##local")
- {
- os << "(ns.empty () && !n.empty ())";
- }
- else if (*i == L"##targetNamespace")
- {
- os << "ns == " << strlit (ns);
- }
- else
- {
- os << "ns == " << strlit (*i);
- }
-
- if (++i != e)
- os << " ||" << endl;
- }
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c)
- {
- // This compositor should already have been tested for
- // triviality (empty).
- //
- Particles const& p (c.context ().get<Particles> ("prefixes"));
-
- bool paren (p.size () != 1);
-
- for (Particles::const_iterator i (p.begin ()), e (p.end ());
- i != e;)
- {
- if (paren)
- os << "(";
-
- dispatch (**i);
-
- if (paren)
- os << ")";
-
- if (++i != e)
- os << " ||" << endl;
- }
- }
- };
-
-
- // Generates particle namespace-name pair. Used to generate
- // the _expected_element call.
- //
- struct ParticleName: Traversal::Compositor,
- Traversal::Element,
- Traversal::Any,
- Context
- {
- ParticleName (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- String ns (e.qualified_p () ? e.namespace_ ().name () : String ());
- os << strlit (ns) << ", " << strlit (e.name ());
- }
-
- virtual void
- traverse (SemanticGraph::Any& a)
- {
- String const& ns (*a.namespace_begin ());
- os << strlit (ns) << ", " << L << "\"*\"";
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c)
- {
- Particles const& p (c.context ().get<Particles> ("prefixes"));
-
- dispatch (**p.begin ());
- }
- };
-
-
- // Common base for the ParticleIn{All, Choice, Sequence} treversers.
- //
- struct ParticleInCompositor: Context
- {
- protected:
- ParticleInCompositor (Context& c, SemanticGraph::Complex& type)
- : Context (c), type_ (type), particle_test_ (c)
- {
- }
-
-
- // Generate sub-parser setup code as well as the pre/post calls.
- //
- void
- pre_post_calls (SemanticGraph::Particle& p)
- {
- using SemanticGraph::Element;
- using SemanticGraph::Complex;
-
- if (Element* e = dynamic_cast<Element*> (&p))
- {
- SemanticGraph::Type& type (e->type ());
- String const& fq_type (fq_name (type));
- bool poly (polymorphic && !anonymous (type));
-
- String name, inst, def_parser, map;
-
- if (e->context ().count("name"))
- {
- name = ename (*e);
-
- if (poly)
- {
- def_parser = emember (*e);
- map = emember_map (*e);
- inst = "p";
- }
- else
- inst = L"this->" + emember (*e);
- }
- else
- {
- // This is the subsequent mentioning of this element in the
- // content. We need to find the first one in order to get
- // to the escaped names.
- //
- Complex::NamesIteratorPair ip (type_.find (e->name ()));
- assert (ip.first != ip.second);
- Element& fe (dynamic_cast<Element&>(ip.first->named ()));
-
- name = ename (fe);
-
- if (poly)
- {
- def_parser = emember (fe);
- map = emember_map (fe);
- inst = "p";
- }
- else
- inst = L"this->" + emember (fe);
- }
-
- if (poly)
- {
- // For pre-computing length.
- //
- String type_id (type.name ());
-
- if (String type_ns = xml_ns_name (type))
- {
- type_id += L' ';
- type_id += type_ns;
- }
-
- os << fq_type << "* p = 0;"
- << endl
- << "if (t == 0 && this->" << def_parser << " != 0)" << endl
- << inst << " = this->" << def_parser << ";"
- << "else"
- << "{"
- << string_type << " ts (" << fq_name (type) <<
- "::_static_type (), " << type_id.size () << "UL);"
- << endl
- << "if (t == 0)" << endl
- << "t = &ts;"
- << endl
- << "if (this->" << def_parser << " != 0 && *t == ts)" << endl
- << inst << " = this->" << def_parser << ";"
- << "else"
- << "{";
-
- // Check that the types are related by inheritance.
- //
- os << "if (t != &ts &&" << endl
- << "!::xsd::cxx::parser::validating::" <<
- "inheritance_map_instance< " << char_type <<
- " > ().check (" << endl
- << "t->data (), ts))" << endl
- << "throw ::xsd::cxx::parser::dynamic_type< " << char_type <<
- " > (*t);"
- << endl
- << "if (this->" << map << " != 0)" << endl
- << inst << " = dynamic_cast< " << fq_type << "* > (" << endl
- << "this->" << map << "->find (*t));"
- << "}"
- << "}";
- }
-
- os << "this->" << complex_base << "::context_.top ()." <<
- "parser_ = " << inst << ";"
- << endl
- << "if (" << inst << ")" << endl
- << inst << "->pre ();"
- << "}"
- << "else" // start
- << "{";
-
- if (poly)
- os << fq_type << "* p =" << endl
- << "dynamic_cast< " << fq_type << "* > (" << endl
- << "this->" << complex_base << "::context_.top ().parser_);"
- << endl;
-
- os << "if (" << inst << ")"
- << "{";
-
- String const& ret (ret_type (type));
- String const& post (post_name (type));
-
- if (ret == L"void")
- os << inst << "->" << post << " ();"
- << "this->" << name << " ();";
- else
- {
- // Don't create an lvalue in C++11 (think std::unique_ptr).
- // In C++98 we do it for compatibility with older/broken
- // compilers (e.g., IBM xlC that needs an lvalue to pass
- // std::auto_ptr).
- //
- if (std == cxx_version::cxx98)
- os << arg_type (type) << " tmp (" << inst << "->" <<
- post << " ());"
- << "this->" << name << " (tmp);";
- else
- os << "this->" << name << " (" << inst << "->" <<
- post << " ());";
- }
-
- os << "}";
- }
- else
- {
- os << "this->_start_any_element (ns, n, t);"
- << "this->" << complex_base << "::context_.top ().any_ = true;"
- << "}"
- << "else" // start
- << "{"
- << "this->" << complex_base << "::context_.top ().any_ = false;"
- << "this->_end_any_element (ns, n);";
- }
- }
-
- protected:
- SemanticGraph::Complex& type_;
- ParticleTest particle_test_;
- };
-
-
-
- // The 'all' compositor can only contain elements with min={0,1}, max=1.
- //
- struct ParticleInAll: Traversal::Element,
- ParticleInCompositor
- {
- ParticleInAll (Context& c, SemanticGraph::Complex& type)
- : ParticleInCompositor (c, type)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- size_t state (e.context ().get<size_t> ("state"));
-
- if (state != 0)
- os << "else ";
-
- os << "if (";
-
- particle_test_.traverse (e);
-
- os << ")"
- << "{"
- << "if (count[" << state << "UL] == 0)"
- << "{"
- << "if (start)"
- << "{";
-
- pre_post_calls (e);
-
- os << "count[" << state << "UL] = 1;"
- << "}"
- << "}"
- << "else" // count != 0
- << "{"
- << "assert (start);" // Assuming well-formed XML.
-
- // Since there is never more content after 'all', we could have
- // as well thrown here. But instead we will let the code in
- // start_element handle this along with other unexpected
- // elements.
- //
- << "state = ~0UL;"
- << "}"
- << "}";
- }
- };
-
-
- //
- //
- struct ParticleInChoice: Traversal::Particle,
- Traversal::Compositor,
- ParticleInCompositor
- {
- ParticleInChoice (Context& c, SemanticGraph::Complex& type)
- : ParticleInCompositor (c, type), particle_name_ (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Particle& p)
- {
- using SemanticGraph::Element;
-
- size_t state (p.context ().get<size_t> ("state"));
-
- size_t min (p.min ()), max (p.max ());
-
- os << "case " << state << "UL:" << endl
- << "{";
-
- if (max != 1) // We don't need the test if max == 1.
- {
- os << "if (";
-
- particle_test_.dispatch (p);
-
- os << ")"
- << "{";
- }
-
- os << "if (start)"
- << "{";
-
- pre_post_calls (p);
-
- switch (max)
- {
- case 0:
- {
- os << "count++;";
- break;
- }
- case 1:
- {
- // We do not need to increment count because min <= max and
- // we do not generate min check for min <= 1 (see below).
- //
- os << "state = ~0UL;";
- break;
- }
- default:
- {
- os << "if (++count == " << max << "UL)" << endl
- << "state = ~0UL;";
- }
- };
-
- os << "}"; // start
-
- // We've already moved to the final state if max == 1.
- //
- if (max != 1)
- {
- os << "}"
- << "else"
- << "{"
- << "assert (start);"; // Assuming well-formed XML
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 1, don't generate dead code if min <= 1.
- //
- if (min > 1)
- {
- os << "if (count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (p);
-
- os << "," << endl
- << "ns, n);";
- }
-
-
- os << "state = ~0UL;"
- << "}";
- }
-
- os << "break;"
- << "}"; // case
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c)
- {
- using SemanticGraph::Compositor;
-
- size_t max (c.max ());
- size_t min (c.context ().get<size_t> ("effective-min"));
- size_t n (c.context ().get<size_t> ("comp-number"));
- size_t state (c.context ().get<size_t> ("state"));
-
- String func (c.is_a<SemanticGraph::Choice> () ?
- "choice_" : "sequence_");
-
- os << "case " << state << "UL:" << endl
- << "{"
- << "unsigned long s (~0UL);"
- << endl;
-
- bool first (true);
-
- for (Compositor::ContainsIterator ci (c.contains_begin ());
- ci != c.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<Compositor> () && !c.context ().count ("comp-number"))
- continue; // Empty compositor.
-
- if (!p.context ().count ("prefix"))
- break;
-
- size_t state (p.context ().get<size_t> ("state"));
-
- if (first)
- first = false;
- else
- os << "else ";
-
- os << "if (";
-
- particle_test_.dispatch (p);
-
- os << ")" << endl
- << "s = " << state << "UL;";
- }
-
- // This compositor.
- //
- os << endl
- << "if (s != ~0UL)"
- << "{"
- << "assert (start);"; // End is handled by the sub-machine.
-
- switch (max)
- {
- case 0:
- {
- os << "count++;";
- break;
- }
- case 1:
- {
- // We do not need to increment count because min <= max and
- // we do not generate min check for min <= 1 (see below).
- //
- os << "state = ~0UL;";
- break;
- }
- default:
- {
- os << "if (++count == " << max << "UL)" << endl
- << "state = ~0UL;";
- }
- };
-
- // Delegate to the sub-machine.
- //
-
- os << endl
- << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_& vd = vs.data[vs.size++];" // push
- << endl
- << "vd.func = &" << ename (type_) << "::" << func << n << ";"
- << "vd.state = s;"
- << "vd.count = 0;"
- << endl
- << "this->" << func << n << " (vd.state, vd.count, ns, n, t, true);"
- << "}";
-
-
- // Not this compositor. We've elready moved to the final state
- // if max == 1.
- //
- if (max != 1)
- {
- os << "else"
- << "{"
- << "assert (start);"; // Assuming well-formed XML
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 1, don't generate dead code if min <= 1.
- //
- if (min > 1)
- {
- os << "if (count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (c);
-
- os << "," << endl
- << "ns, n);";
- }
-
- os << "state = ~0UL;"
- << "}";
- }
-
- os << "break;"
- << "}"; // case
- }
-
- private:
- ParticleName particle_name_;
- };
-
-
- //
- //
- struct ParticleInSequence: Traversal::Particle,
- Traversal::Compositor,
- ParticleInCompositor
- {
- ParticleInSequence (Context& c,
- size_t state,
- size_t next_state,
- SemanticGraph::Complex& type)
- : ParticleInCompositor (c, type),
- state_ (state), particle_name_ (c)
- {
- // next_state == 0 indicates the terminal state (~0UL).
- //
- if (next_state != 0)
- {
- std::wostringstream ostr;
- ostr << next_state;
- next_state_ = ostr.str ();
- }
- else
- next_state_ = L"~0";
- }
-
- virtual void
- traverse (SemanticGraph::Particle& p)
- {
- size_t min (p.min ()), max (p.max ());
-
- os << "case " << state_ << "UL:" << endl
- << "{"
- << "if (";
-
- particle_test_.dispatch (p);
-
- os << ")"
- << "{";
-
- // This element.
- //
-
- os << "if (start)"
- << "{";
-
- pre_post_calls (p);
-
- switch (max)
- {
- case 0:
- {
- os << "count++;";
- break;
- }
- case 1:
- {
- os << "count = 0;"
- << "state = " << next_state_ << "UL;";
- break;
- }
- default:
- {
- os << "if (++count == " << max << "UL)"
- << "{"
- << "count = 0;"
- << "state = " << next_state_ << "UL;"
- << "}";
- }
- };
-
- os << "}" // start
- << "break;"
- << "}";
-
- // Not this element.
- //
-
- os << "else"
- << "{"
- << "assert (start);"; // Assuming well-formed XML.
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 0, don't generate dead code if min == 0.
- //
- if (min != 0)
- {
- os << "if (count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (p);
-
- os << "," << endl
- << "ns, n);";
- }
-
- os << "count = 0;"
- << "state = " << next_state_ << "UL;"
- << "// Fall through." << endl
- << "}" // else
- << "}"; // case
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c)
- {
- using SemanticGraph::Compositor;
-
- size_t max (c.max ());
- size_t min (c.context ().get<size_t> ("effective-min"));
- size_t n (c.context ().get<size_t> ("comp-number"));
-
- String func (c.is_a<SemanticGraph::Choice> () ?
- "choice_" : "sequence_");
-
- os << "case " << state_ << "UL:" << endl
- << "{"
- << "unsigned long s (~0UL);"
- << endl;
-
- bool first (true);
-
- for (Compositor::ContainsIterator ci (c.contains_begin ());
- ci != c.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<Compositor> () && !c.context ().count ("comp-number"))
- continue; // Empty compositor.
-
- if (!p.context ().count ("prefix"))
- break;
-
- size_t state (p.context ().get<size_t> ("state"));
-
- if (first)
- first = false;
- else
- os << "else ";
-
- os << "if (";
-
- particle_test_.dispatch (p);
-
- os << ")" << endl
- << "s = " << state << "UL;";
- }
-
- // This element.
- //
-
- os << endl
- << "if (s != ~0UL)"
- << "{"
- << "assert (start);"; // End is handled by the sub-machine.
-
- switch (max)
- {
- case 0:
- {
- os << "count++;"
- << endl;
- break;
- }
- case 1:
- {
- os << "count = 0;"
- << "state = " << next_state_ << "UL;"
- << endl;
- break;
- }
- default:
- {
- os << "if (++count == " << max << "UL)"
- << "{"
- << "count = 0;"
- << "state = " << next_state_ << "UL;"
- << "}";
- }
- };
-
- // Delegate to the sub-machine.
- //
-
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_& vd = vs.data[vs.size++];" // push
- << endl
- << "vd.func = &" << ename (type_) << "::" << func << n << ";"
- << "vd.state = s;"
- << "vd.count = 0;"
- << endl
- << "this->" << func << n << " (vd.state, vd.count, ns, n, t, true);"
- << "break;"
- << "}";
-
- // Not this compositor.
- //
-
- os << "else"
- << "{"
- << "assert (start);"; // Assuming well-formed XML
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 0, don't generate dead code if min == 0.
- //
- if (min != 0)
- {
- os << "if (count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (c);
-
- os << "," << endl
- << "ns, n);";
- }
-
- os << "count = 0;"
- << "state = " << next_state_ << "UL;"
- << "// Fall through." << endl
- << "}" // else
- << "}"; // case
- }
-
- private:
- size_t state_;
- String next_state_;
-
- ParticleName particle_name_;
- };
-
-
- //
- //
- struct ParticleFunction: Traversal::All,
- Traversal::Choice,
- Traversal::Sequence,
- Context
- {
- ParticleFunction (Context& c, SemanticGraph::Complex& type)
- : Context (c), type_ (type)
- {
- *this >> contains_particle_ >> *this;
- }
-
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- if (!a.context().count ("comp-number")) // Empty compositor.
- return;
-
- using SemanticGraph::Element;
- using SemanticGraph::Compositor;
-
-
- os << "void " << ename (type_) << "::" << endl
- << "all_0 (unsigned long& state," << endl
- << "unsigned char* count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start)"
- << "{"
- << "XSD_UNUSED (t);"
- << endl;
-
- for (Compositor::ContainsIterator ci (a.contains_begin ()),
- ce (a.contains_end ()); ci != ce; ++ci)
- {
- ParticleInAll t (*this, type_);
- t.dispatch (ci->particle ());
- }
-
- // Handle the flush.
- //
- os << "else if (n.empty () && ns.empty ())"
- << "{";
-
- for (Compositor::ContainsIterator ci (a.contains_begin ()),
- ce (a.contains_end ()); ci != ce; ++ci)
- {
- if (ci->min () == 0)
- continue;
-
- Element& e (dynamic_cast<Element&> (ci->particle ()));
- String ns (e.qualified_p () ? e.namespace_ ().name () : String ());
- size_t state (e.context ().get<size_t> ("state"));
-
- os << "if (count[" << state << "UL] == 0)" << endl
- << "this->_expected_element (" << endl
- << strlit (ns) << ", " <<
- strlit (e.name ()) << ");"
- << endl;
- }
-
- os << "state = ~0UL;"
- << "}"
- << "else" << endl
- << "state = ~0UL;"
- << "}";
- }
-
- virtual void
- traverse (SemanticGraph::Choice& c)
- {
- if (!c.context().count ("comp-number")) // Empty compositor.
- return;
-
- using SemanticGraph::Compositor;
-
- size_t n (c.context ().get<size_t> ("comp-number"));
-
- os << "void " << ename (type_) << "::" << endl
- << "choice_" << n << " (unsigned long& state," << endl
- << "unsigned long& count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start)"
- << "{"
- << "XSD_UNUSED (count);"
- << "XSD_UNUSED (ns);"
- << "XSD_UNUSED (n);"
- << "XSD_UNUSED (t);"
- << endl
- << "switch (state)"
- << "{";
-
- for (Compositor::ContainsIterator ci (c.contains_begin ()),
- ce (c.contains_end ()); ci != ce; ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<Compositor> () && !p.context().count ("comp-number"))
- continue; // Empty compositor.
-
- ParticleInChoice t (*this, type_);
- t.dispatch (p);
- }
-
- os << "}" // switch
- << "}";
-
- // Generate nested compositor functions.
- //
- Traversal::Choice::traverse (c);
- }
-
- virtual void
- traverse (SemanticGraph::Sequence& s)
- {
- if (!s.context().count ("comp-number")) // Empty compositor.
- return;
-
- using SemanticGraph::Compositor;
-
- size_t n (s.context ().get<size_t> ("comp-number"));
-
- os << "void " << ename (type_) << "::" << endl
- << "sequence_" << n << " (unsigned long& state," << endl
- << "unsigned long& count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start)"
- << "{"
- << "XSD_UNUSED (t);"
- << endl
- << "switch (state)"
- << "{";
-
- size_t state (0);
-
- for (Compositor::ContainsIterator ci (s.contains_begin ()),
- ce (s.contains_end ()); ci != ce;)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<Compositor> () && !p.context().count ("comp-number"))
- {
- // Empty compositor.
- //
- ++ci;
- continue;
- }
-
- // Find the next state.
- //
- do
- ++ci;
- while (ci != ce &&
- ci->particle ().is_a<Compositor> () &&
- !ci->particle ().context().count ("comp-number"));
-
- size_t next (ci == ce ? 0 : state + 1);
-
- ParticleInSequence t (*this, state++, next, type_);
- t.dispatch (p);
- }
-
- os << "case ~0UL:" << endl
- << "break;"
- << "}" // switch
- << "}";
-
- // Generate nested compositor functions.
- //
- Traversal::Sequence::traverse (s);
- }
-
- private:
- SemanticGraph::Complex& type_;
- Traversal::ContainsParticle contains_particle_;
- };
-
-
- //
- //
- struct CompositorPre: Traversal::All,
- Traversal::Compositor,
- Context
- {
- CompositorPre (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- // Clear the counts and push the initial state.
- //
- os << "v_all_count_.push ();"
- << endl;
-
- SemanticGraph::Compositor& c (a);
- traverse (c);
- }
-
- virtual void
- traverse (SemanticGraph::Compositor&) // Choice and sequence.
- {
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_& vd = vs.data[vs.size++];" // push
- << endl
- << "vd.func = 0;"
- << "vd.state = 0;"
- << "vd.count = 0;";
- }
- };
-
-
- //
- //
- struct CompositorStartElement: Traversal::All,
- Traversal::Compositor,
- Context
- {
- CompositorStartElement (Context& c, SemanticGraph::Complex& type)
- : Context (c), type_ (type),
- particle_test_ (c), particle_name_ (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All&)
- {
- // The 'all' state machine reaches the final state only
- // on an unknown element, in which case we won't get here
- // again (it would be a validation error). Note that 'all'
- // compositor cannot contain nested compositors so we don't
- // need to re-set vd.
- //
- os << "all_0 (vd->state, v_all_count_.top (), ns, n, t, true);"
- << endl
- << "if (vd->state != ~0UL)" << endl
- << "vd->count++;"
- << "else" << endl
- << "return false;" // Let our parent handle this.
- << endl;
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c) // Choice and sequence.
- {
- using SemanticGraph::Compositor;
-
- size_t max (c.max ());
- size_t min (c.context ().get<size_t> ("effective-min"));
- size_t n (c.context ().get<size_t> ("comp-number"));
-
- String func (c.is_a<SemanticGraph::Choice> () ?
- "choice_" : "sequence_");
-
- // Invoke the current state machine. If it reaches its
- // terminal state, pop it and invoke the next one until
- // we reach the top, which requires special handling.
- //
- os << "while (vd->func != 0)"
- << "{"
- << "(this->*vd->func) (vd->state, vd->count, ns, n, t, true);"
- << endl
- << "vd = vs.data + (vs.size - 1);" // re-acquire
- << endl
- << "if (vd->state == ~0UL)" << endl
- << "vd = vs.data + (--vs.size - 1);" // pop
- << "else" << endl
- << "break;"
- << "}";
-
-
- // Check if we got to the top. This code is pretty much the
- // same as the one found in ParticleInSequence.
- //
- os << "if (vd->func == 0)"
- << "{"
- << "if (vd->state != ~0UL)"
- << "{"
- << "unsigned long s = ~0UL;"
- << endl;
-
- bool first (true);
-
- // Note that we don't need to worry about the compositor
- // being empty - this case is handled by our caller.
- //
- for (Compositor::ContainsIterator ci (c.contains_begin ());
- ci != c.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<Compositor> () && !c.context ().count ("comp-number"))
- continue; // Empty compositor.
-
- if (!p.context ().count ("prefix"))
- break;
-
- size_t state (p.context ().get<size_t> ("state"));
-
- if (first)
- first = false;
- else
- os << "else ";
-
- os << "if (";
-
- particle_test_.dispatch (p);
-
- os << ")" << endl
- << "s = " << state << "UL;";
- }
-
- os << endl
- << "if (s != ~0UL)"
- << "{";
-
- // This element is a prefix of the root compositor.
- //
-
- switch (max)
- {
- case 0:
- {
- os << "vd->count++;";
- break;
- }
- case 1:
- {
- os << "vd->count++;"
- << "vd->state = ~0UL;";
- break;
- }
- default:
- {
- os << "if (++vd->count == " << max << "UL)" << endl
- << "vd->state = ~0UL;";
- }
- };
-
- // Delegate to the sub-machine.
- //
-
- os << endl
- << "vd = vs.data + vs.size++;" // push
- << "vd->func = &" << ename (type_) << "::" << func << n << ";"
- << "vd->state = s;"
- << "vd->count = 0;"
- << endl
- << "this->" << func << n << " (vd->state, vd->count, ns, n, t, true);"
- << "}";
-
- // This element is not our prefix.
- //
-
- os << "else"
- << "{";
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 0, don't generate dead code if min == 0.
- //
- if (min != 0)
- {
- os << "if (vd->count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (c);
-
- os << "," << endl
- << "ns, n);";
- }
-
- // Return false to indicate that we are not handling this element.
- //
- os << "return false;"
- << "}"
- << "}" // if (state != ~0)
- << "else" << endl
- << "return false;"
- << "}"; // if (function == 0)
- }
-
- private:
- SemanticGraph::Complex& type_;
- ParticleTest particle_test_;
- ParticleName particle_name_;
- };
-
-
- //
- //
- struct CompositorEndElement: Traversal::All,
- Traversal::Compositor,
- Context
- {
- CompositorEndElement (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All&)
- {
- os << "all_0 (vd.state, v_all_count_.top (), " <<
- "ns, n, 0, false);"
- << endl;
- }
-
- virtual void
- traverse (SemanticGraph::Compositor&) // Choice and sequence.
- {
- os << "assert (vd.func != 0);"
- << "(this->*vd.func) (vd.state, vd.count, ns, n, 0, false);"
- << endl
- << "if (vd.state == ~0UL)" << endl
- << "vs.size--;" // pop
- << endl;
- }
- };
-
-
- //
- //
- struct CompositorPost: Traversal::All,
- Traversal::Compositor,
- Context
- {
- CompositorPost (Context& c)
- : Context (c), particle_name_ (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- using SemanticGraph::Element;
-
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_& vd = vs.data[vs.size - 1];"
- << endl;
-
- // Flush the state machine with the empty element name. This
- // allows us to detect missing content.
- //
- os << "if (vd.count != 0)"
- << "{"
- << string_type << " empty;"
- << "all_0 (vd.state, v_all_count_.top (), empty, empty, 0, true);"
- << "}";
-
- if (a.context ().get<size_t> ("effective-min") != 0)
- {
- os << "else" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (a);
-
- os << ");";
- }
-
- os << endl
- << "vs.size--;" // pop
- << "v_all_count_.pop ();";
- }
-
- virtual void
- traverse (SemanticGraph::Compositor& c) // Choice and sequence.
- {
- size_t min (c.context ().get<size_t> ("effective-min"));
-
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_* vd = vs.data + (vs.size - 1);"
- << endl;
-
-
- // Flush unfinished state machines with the empty element name.
- // This allows us to detect missing content. Note that I am
- // not re-setting vd since no new compositors are pushed on
- // flush.
- //
- os << string_type << " empty;"
- << "while (vd->func != 0)"
- << "{"
- << "(this->*vd->func) (vd->state, vd->count, empty, empty, 0, true);"
- << "assert (vd->state == ~0UL);"
- << "vd = vs.data + (--vs.size - 1);" // pop
- << "}";
-
- // Check if min cardinality requirements have been met. Since
- // count is always >= 0, don't generate dead code if min == 0.
- //
- if (min != 0)
- {
- os << "if (vd->count < " << min << "UL)" << endl
- << "this->_expected_element (" << endl;
-
- particle_name_.dispatch (c);
-
- os << ");";
- }
- }
-
- private:
- ParticleName particle_name_;
- };
-
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& c)
- {
- // Nothing to generate if we don't have any elements and wildcards.
- //
- if (!has<Traversal::Element> (c) &&
- !has_particle<Traversal::Any> (c))
- return;
-
- using SemanticGraph::Compositor;
-
- String const& name (ename (c));
- Compositor& comp (c.contains_compositor ().compositor ());
-
- // Don't use restriction_p here since we don't want special
- // treatment of anyType.
- //
- bool restriction (
- c.inherits_p () &&
- c.inherits ().is_a<SemanticGraph::Restricts> ());
-
- os <<"// Element validation and dispatch functions for " <<
- name << "." << endl
- <<"//" << endl;
-
- // _start_element_impl
- //
-
- os << "bool " << name << "::" << endl
- << "_start_element_impl (const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t)"
- << "{"
- << "XSD_UNUSED (t);"
- << endl;
-
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_* vd = vs.data + (vs.size - 1);"
- << endl;
-
- //@@ OPT: I don't really need to call parser_base since it always
- // returns false.
- //
- // In case of an inheritance-by-extension, call our base first.
- // We don't need to generate this code for the 'all' compositor
- // because it can only inherit from the empty content model.
- // States of the root machine for sequence and choice:
- //
- // 0 - calling base
- // 1 - base returned false
- // ~0 - terminal state
- //
- if (!restriction && !comp.is_a<SemanticGraph::All> ())
- {
- os << "if (vd->func == 0 && vd->state == 0)"
- << "{"
- << "if (this->";
-
- if (c.inherits_p ())
- os << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
-
- os << "::_start_element_impl (ns, n, t))" << endl
- << "return true;"
- << "else" << endl
- << "vd->state = 1;"
- << "}";
- }
-
- {
- CompositorStartElement t (*this, c);
- t.dispatch (comp);
- }
-
- os << "return true;"
- << "}";
-
-
- // _end_element_impl
- //
-
- os << "bool " << name << "::" << endl
- << "_end_element_impl (const " << string_type << "& ns," << endl
- << "const " << string_type << "& n)"
- << "{";
-
- os << "v_state_& vs = *static_cast< v_state_* > (" <<
- "this->v_state_stack_.top ());"
- << "v_state_descr_& vd = vs.data[vs.size - 1];"
- << endl;
-
- //@@ OPT: I don't really need to call parser_base since it always
- // returns false.
- //
- // In case of an inheritance-by-extension, call our base first.
- // We don't need to generate this code for the 'all' compositor
- // because it can only inherit from the empty content model.
- //
- if (!restriction && !comp.is_a<SemanticGraph::All> ())
- {
- os << "if (vd.func == 0 && vd.state == 0)"
- << "{"
- << "if (!";
-
- if (c.inherits_p ())
- os << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
- os << "::_end_element_impl (ns, n))" << endl
- << "assert (false);" // Start and end should match.
- << "return true;"
- << "}";
- }
-
- {
- CompositorEndElement t (*this);
- t.dispatch (comp);
- }
-
- os << "return true;"
- << "}";
-
-
- // _pre_e_validate
- //
- os << "void " << name << "::" << endl
- << "_pre_e_validate ()"
- << "{"
- << "this->v_state_stack_.push ();"
- << "static_cast< v_state_* > (this->v_state_stack_.top ())->" <<
- "size = 0;"
- << endl;
-
- {
- CompositorPre t (*this);
- t.dispatch (comp);
- }
-
- // In case of an inheritance-by-extension, call our base
- // _pre_e_validate. We don't need to generate this code for the
- // 'all' compositor because it can only inherit from the empty
- // content model.
- //
- if (!restriction && !comp.is_a<SemanticGraph::All> ())
- {
- // We don't need to call parser_base's implementation
- // since it does nothing.
- //
- if (c.inherits_p ())
- {
- os << endl
- << fq_name (c.inherits ().base ()) << "::_pre_e_validate ();";
- }
- }
-
- os << "}";
-
-
- // _post_e_validate
- //
- os << "void " << name << "::" << endl
- << "_post_e_validate ()"
- << "{";
-
- // In case of an inheritance-by-extension, call our base
- // _post_e_validate. We don't need to generate this code for
- // the 'all' compositor because it can only inherit from
- // the empty content model.
- //
- if (!restriction && !comp.is_a<SemanticGraph::All> ())
- {
- // We don't need to call parser_base's implementation
- // since it does nothing.
- //
- if (c.inherits_p ())
- {
- os << fq_name (c.inherits ().base ()) << "::_post_e_validate ();"
- << endl;
- }
- }
-
- {
- CompositorPost t (*this);
- t.dispatch (c.contains_compositor ().compositor ());
- }
-
- os << endl
- << "this->v_state_stack_.pop ();"
- << "}";
-
- //
- //
- ParticleFunction t (*this, c);
- t.dispatch (c.contains_compositor ().compositor ());
- }
- };
- }
-
- void
- generate_element_validation_source (Context& ctx)
- {
- ctx.os << "#include <cassert>" << endl
- << endl;
-
- Traversal::Schema schema;
-
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- Complex complex (ctx);
-
- names >> complex;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/element-validation-source.hxx b/xsd/cxx/parser/element-validation-source.hxx
deleted file mode 100644
index fcdbf88..0000000
--- a/xsd/cxx/parser/element-validation-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/element-validation-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_ELEMENT_VALIDATION_SOURCE_HXX
-#define CXX_PARSER_ELEMENT_VALIDATION_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_element_validation_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_ELEMENT_VALIDATION_SOURCE_HXX
diff --git a/xsd/cxx/parser/elements.cxx b/xsd/cxx/parser/elements.cxx
deleted file mode 100644
index 6ab2a4b..0000000
--- a/xsd/cxx/parser/elements.cxx
+++ /dev/null
@@ -1,247 +0,0 @@
-// file : xsd/cxx/parser/elements.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- Context::
- Context (std::wostream& o,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- options_type const& ops,
- StringLiteralMap const* map,
- Regex const* he,
- Regex const* ie,
- Regex const* hie)
- : CXX::Context (o, root, path, ops, map),
- options (ops),
- xml_parser (xml_parser_),
- simple_base (simple_base_),
- complex_base (complex_base_),
- list_base (list_base_),
- cout_inst (cout_inst_),
- cerr_inst (cerr_inst_),
- parser_map (parser_map_),
- std_string_type (std_string_type_),
- validation (validation_),
- polymorphic (polymorphic_),
- hxx_expr (he),
- ixx_expr (ie),
- hxx_impl_expr (hie),
- xml_parser_ (ops.xml_parser ()),
- validation_ ((ops.xml_parser () == "expat" ||
- ops.generate_validation ()) &&
- !ops.suppress_validation ()),
- polymorphic_ (ops.generate_polymorphic ())
- {
- if (char_type == L"char")
- std_string_type = L"::std::string";
- else if (char_type == L"wchar_t")
- std_string_type = L"::std::wstring";
- else
- std_string_type = L"::std::basic_string< " + char_type + L" >";
-
- String xs_ns (xs_ns_name ());
-
- string_type = xs_ns + L"::ro_string";
- simple_base = xs_ns + L"::simple_content";
- complex_base = xs_ns + L"::complex_content";
- list_base = xs_ns + L"::list_base";
-
- cout_inst = (char_type == L"char" ? L"std::cout" : L"std::wcout");
- cerr_inst = (char_type == L"char" ? L"std::cerr" : L"std::wcerr");
-
- if (polymorphic)
- parser_map_ = xs_ns + L"::parser_map";
- }
-
- Context::
- Context (Context& c)
- : CXX::Context (c),
- options (c.options),
- xml_parser (c.xml_parser),
- simple_base (c.simple_base),
- complex_base (c.complex_base),
- list_base (c.list_base),
- cout_inst (c.cout_inst),
- cerr_inst (c.cerr_inst),
- parser_map (c.parser_map),
- std_string_type (c.std_string_type),
- validation (c.validation),
- polymorphic (c.polymorphic),
- hxx_expr (c.hxx_expr),
- ixx_expr (c.ixx_expr),
- hxx_impl_expr (c.hxx_impl_expr)
- {
- }
-
- Context::
- Context (Context& c, std::wostream& o)
- : CXX::Context (c, o),
- options (c.options),
- xml_parser (c.xml_parser),
- simple_base (c.simple_base),
- complex_base (c.complex_base),
- list_base (c.list_base),
- cout_inst (c.cout_inst),
- cerr_inst (c.cerr_inst),
- parser_map (c.parser_map),
- std_string_type (c.std_string_type),
- validation (c.validation),
- polymorphic (c.polymorphic),
- hxx_expr (c.hxx_expr),
- ixx_expr (c.ixx_expr),
- hxx_impl_expr (c.hxx_impl_expr)
- {
- }
-
- Content::Value Context::
- content (SemanticGraph::Complex& c)
- {
- using namespace SemanticGraph;
-
- if (c.mixed_p ())
- return Content::mixed;
-
- if (c.inherits_p ())
- {
- Type& base (c.inherits ().base ());
-
- if (Complex* cb = dynamic_cast<Complex*> (&base))
- return content (*cb);
-
- if (base.is_a<AnyType> ())
- return Content::complex;
-
- // Everyhting else (built-in type and AnySimpleType) is simple
- // content.
- //
- return Content::simple;
- }
- else
- return Content::complex;
- }
-
- bool Context::
- anonymous (SemanticGraph::Type& t)
- {
- return t.context ().count ("anonymous");
- }
-
- String const& Context::
- ret_type (SemanticGraph::Type& t)
- {
- return t.context ().get<String> ("ret-type");
- }
-
- String const& Context::
- arg_type (SemanticGraph::Type& t)
- {
- return t.context ().get<String> ("arg-type");
- }
-
- String const& Context::
- post_name (SemanticGraph::Type& t)
- {
- return t.context ().get<String> ("post");
- }
-
- String const& Context::
- eparser (SemanticGraph::Member& m)
- {
- return m.context ().get<String> ("parser");
- }
-
- String const& Context::
- emember (SemanticGraph::Member& m)
- {
- return m.context ().get<String> ("member");
- }
-
- String const& Context::
- emember_map (SemanticGraph::Member& m)
- {
- return m.context ().get<String> ("member-map");
- }
-
- String const& Context::
- eimpl (SemanticGraph::Type& t)
- {
- return t.context ().get<String> ("impl");
- }
-
- // Includes
- //
- void TypeForward::
- traverse (SemanticGraph::Type& t)
- {
- os << "class " << t.context ().get<String> (name_key_) << ";";
- }
-
- void Includes::
- traverse_ (SemanticGraph::Uses& u)
- {
- // Support for weak (forward) inclusion used in the file-per-type
- // compilation model.
- //
- SemanticGraph::Schema& s (u.schema ());
- bool weak (u.context ().count ("weak"));
-
- if (weak && (type_ == header || type_ == impl_header))
- {
- // Generate forward declarations. We don't really need them
- // in the impl files.
- //
- if (type_ == header)
- schema_.dispatch (s);
-
- return;
- }
-
- if (type_ == source && !weak)
- return;
-
- SemanticGraph::Path path (
- s.context ().count ("renamed")
- ? s.context ().get<SemanticGraph::Path> ("renamed")
- : u.path ());
- path.normalize ();
-
- // Try to use the portable representation of the path. If that
- // fails, fall back to the native representation.
- //
- NarrowString path_str;
- try
- {
- path_str = path.posix_string ();
- }
- catch (SemanticGraph::InvalidPath const&)
- {
- path_str = path.string ();
- }
-
- String inc_path;
-
- switch (type_)
- {
- case header:
- case source:
- {
- inc_path = ctx_.hxx_expr->replace (path_str);
- break;
- }
- case impl_header:
- {
- inc_path = ctx_.hxx_impl_expr->replace (path_str);
- break;
- }
- }
-
- ctx_.os << "#include " << ctx_.process_include_path (inc_path) << endl
- << endl;
- }
- }
-}
diff --git a/xsd/cxx/parser/elements.hxx b/xsd/cxx/parser/elements.hxx
deleted file mode 100644
index 80656c2..0000000
--- a/xsd/cxx/parser/elements.hxx
+++ /dev/null
@@ -1,315 +0,0 @@
-// file : xsd/cxx/parser/elements.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_ELEMENTS_HXX
-#define CXX_PARSER_ELEMENTS_HXX
-
-#include <sstream>
-
-#include <cutl/re.hxx>
-
-#include <types.hxx>
-
-#include <cxx/elements.hxx>
-
-#include <cxx/parser/options.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- struct Content
- {
- enum Value
- {
- simple,
- complex,
- mixed
- };
- };
-
- //
- //
- class Context: public CXX::Context
- {
- public:
- typedef cutl::re::regexsub Regex;
-
- typedef Parser::options options_type;
-
- public:
- Context (std::wostream&,
- SemanticGraph::Schema&,
- SemanticGraph::Path const& path,
- options_type const&,
- StringLiteralMap const*,
- Regex const* hxx_expr,
- Regex const* ixx_expr,
- Regex const* hxx_impl_expr);
-
- protected:
- Context (Context& c);
- Context (Context& c, std::wostream& o);
-
- public:
- bool
- restriction_p (SemanticGraph::Complex& c) const
- {
- if (c.inherits_p () &&
- c.inherits ().is_a<SemanticGraph::Restricts> ())
- {
- // Restriction of anyType is a special case.
- //
- return !c.inherits ().base ().is_a<SemanticGraph::AnyType> ();
- }
-
- return false;
- }
-
- public:
- static Content::Value
- content (SemanticGraph::Complex&);
-
- public:
- static bool
- anonymous (SemanticGraph::Type&);
-
- public:
- static String const&
- ret_type (SemanticGraph::Type&);
-
- static String const&
- arg_type (SemanticGraph::Type&);
-
- static String const&
- post_name (SemanticGraph::Type&);
-
- public:
- static String const&
- eparser (SemanticGraph::Member&);
-
- static String const&
- emember (SemanticGraph::Member&);
-
- static String const&
- emember_map (SemanticGraph::Member&);
-
- public:
- static String const&
- eimpl (SemanticGraph::Type&);
-
- public:
- options_type const& options;
- String& xml_parser;
- String& simple_base;
- String& complex_base;
- String& list_base;
- String& cout_inst;
- String& cerr_inst;
- String& parser_map;
- String& std_string_type;
- bool& validation;
- bool& polymorphic;
-
- Regex const* hxx_expr;
- Regex const* ixx_expr;
- Regex const* hxx_impl_expr;
-
- private:
- String xml_parser_;
- String simple_base_;
- String complex_base_;
- String list_base_;
- String cout_inst_;
- String cerr_inst_;
- String parser_map_;
- String std_string_type_;
- bool validation_;
- bool polymorphic_;
- };
-
- //
- //
- struct RequiredAttributeTest: Traversal::Attribute
- {
- RequiredAttributeTest (bool& result)
- : result_ (result)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- if (!result_ && !a.optional_p ())
- result_ = true;
- }
-
- private:
- bool& result_;
- };
-
- //
- //
- struct ParserParamDecl: Traversal::Complex,
- Traversal::List,
- Traversal::Member,
- Context
- {
- ParserParamDecl (Context& c, bool name_arg)
- : Context (c), first_ (true), name_arg_ (name_arg)
- {
- inherits_ >> *this;
- names_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
-
- if (!restriction_p (c))
- names (c, names_);
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- if (!first_)
- os << "," << endl;
- else
- first_ = false;
-
- os << fq_name (l.argumented ().type ()) << "&";
-
- if (name_arg_)
- os << " " << ename (l) << "_item";
- else
- os << " /* " << comment (l.name ()) << " item */";
- }
-
- virtual void
- traverse (SemanticGraph::Member& m)
- {
- if (skip (m)) return;
-
- if (!first_)
- os << "," << endl;
- else
- first_ = false;
-
- os << fq_name (m.type ()) << "&";
-
- if (name_arg_)
- os << " " << ename (m);
- else
- os << " /* " << comment (m.name ()) << " */";
- }
-
- private:
- Traversal::Inherits inherits_;
- Traversal::Names names_;
-
- bool first_;
- bool name_arg_;
- };
-
-
- //
- //
- struct TypeForward: Traversal::Type, Context
- {
- TypeForward (Context& c, char const* name_key)
- : Context (c), name_key_ (name_key)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type& t);
-
- private:
- char const* name_key_;
- };
-
- struct Includes: Traversal::Imports,
- Traversal::Includes
- {
- enum Type
- {
- header,
- source,
- impl_header
- };
-
- Includes (Context& c, Type t)
- : ctx_ (c),
- type_ (t),
- namespace_ (c),
- type_forward_ (c, t == header ? "name" : "impl")
- {
- schema_ >> schema_names_ >> namespace_ >> names_ >> type_forward_;
- }
-
- virtual void
- traverse (SemanticGraph::Imports& i)
- {
- traverse_ (i);
- }
-
- virtual void
- traverse (SemanticGraph::Includes& i)
- {
- traverse_ (i);
- }
-
- private:
- void
- traverse_ (SemanticGraph::Uses&);
-
- private:
- Context& ctx_;
- Type type_;
-
- Traversal::Schema schema_;
- Traversal::Names schema_names_;
- Namespace namespace_;
- Traversal::Names names_;
- TypeForward type_forward_;
- };
-
- // Find root element for the test driver.
- //
- struct RootElement: Traversal::Element
- {
- typedef Parser::options options_type;
-
- RootElement (options_type const& options,
- SemanticGraph::Element*& element)
- : options_ (options), element_ (element)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (options_.root_element_first ())
- {
- if (element_ == 0)
- element_ = &e;
- }
- else if (String name = options_.root_element ())
- {
- if (e.name () == name)
- element_ = &e;
- }
- else
- element_ = &e; // Cover root-element-last and no option.
- }
-
- private:
- options_type const& options_;
- SemanticGraph::Element*& element_;
- };
- }
-}
-
-#endif // CXX_PARSER_ELEMENTS_HXX
diff --git a/xsd/cxx/parser/generator.cxx b/xsd/cxx/parser/generator.cxx
deleted file mode 100644
index 6c87117..0000000
--- a/xsd/cxx/parser/generator.cxx
+++ /dev/null
@@ -1,1099 +0,0 @@
-// file : xsd/cxx/parser/generator.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <algorithm>
-#include <iostream>
-#include <fstream>
-
-#include <cutl/re.hxx>
-
-#include <cutl/compiler/code-stream.hxx>
-#include <cutl/compiler/cxx-indenter.hxx>
-#include <cutl/compiler/sloc-counter.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-
-#include <type-map/lexer.hxx>
-#include <type-map/parser.hxx>
-#include <type-map/type-map.hxx>
-
-#include <cxx/parser/elements.hxx>
-#include <cxx/parser/generator.hxx>
-
-#include <cxx/parser/validator.hxx>
-#include <cxx/parser/name-processor.hxx>
-#include <cxx/parser/state-processor.hxx>
-#include <cxx/parser/type-processor.hxx>
-
-#include <cxx/parser/parser-header.hxx>
-#include <cxx/parser/parser-inline.hxx>
-#include <cxx/parser/parser-source.hxx>
-#include <cxx/parser/parser-forward.hxx>
-
-#include <cxx/parser/impl-header.hxx>
-#include <cxx/parser/impl-source.hxx>
-#include <cxx/parser/driver-source.hxx>
-
-#include <cxx/parser/element-validation-source.hxx>
-#include <cxx/parser/attribute-validation-source.hxx>
-#include <cxx/parser/characters-validation-source.hxx>
-
-#include <cxx/parser/options.hxx>
-
-#include "../../../libxsd/xsd/cxx/version.hxx"
-
-using std::endl;
-using std::wcerr;
-using std::wcout;
-
-using namespace XSDFrontend::SemanticGraph;
-
-//
-//
-typedef std::wifstream WideInputFileStream;
-typedef std::wofstream WideOutputFileStream;
-typedef std::ifstream NarrowInputFileStream;
-
-namespace CXX
-{
- namespace
- {
- char const copyright_gpl[] =
- "// Copyright (c) 2005-2020 Code Synthesis Tools CC.\n"
- "//\n"
- "// This program was generated by CodeSynthesis XSD, an XML Schema to\n"
- "// C++ data binding compiler.\n"
- "//\n"
- "// This program is free software; you can redistribute it and/or modify\n"
- "// it under the terms of the GNU General Public License version 2 as\n"
- "// published by the Free Software Foundation.\n"
- "//\n"
- "// This program is distributed in the hope that it will be useful,\n"
- "// but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
- "// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n"
- "// GNU General Public License for more details.\n"
- "//\n"
- "// You should have received a copy of the GNU General Public License\n"
- "// along with this program; if not, write to the Free Software\n"
- "// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n"
- "//\n"
- "// In addition, as a special exception, Code Synthesis Tools CC gives\n"
- "// permission to link this program with the Xerces-C++ library (or with\n"
- "// modified versions of Xerces-C++ that use the same license as Xerces-C++),\n"
- "// and distribute linked combinations including the two. You must obey\n"
- "// the GNU General Public License version 2 in all respects for all of\n"
- "// the code used other than Xerces-C++. If you modify this copy of the\n"
- "// program, you may extend this exception to your version of the program,\n"
- "// but you are not obligated to do so. If you do not wish to do so, delete\n"
- "// this exception statement from your version.\n"
- "//\n"
- "// Furthermore, Code Synthesis Tools CC makes a special exception for\n"
- "// the Free/Libre and Open Source Software (FLOSS) which is described\n"
- "// in the accompanying FLOSSE file.\n"
- "//\n\n";
-
- char const copyright_proprietary[] =
- "// Copyright (c) 2005-2020 Code Synthesis Tools CC.\n"
- "//\n"
- "// This program was generated by CodeSynthesis XSD, an XML Schema\n"
- "// to C++ data binding compiler, in the Proprietary License mode.\n"
- "// You should have received a proprietary license from Code Synthesis\n"
- "// Tools CC prior to generating this code. See the license text for\n"
- "// conditions.\n"
- "//\n\n";
-
- char const copyright_impl[] =
- "// Not copyrighted - public domain.\n"
- "//\n"
- "// This sample parser implementation was generated by CodeSynthesis XSD,\n"
- "// an XML Schema to C++ data binding compiler. You may use it in your\n"
- "// programs without any restrictions.\n"
- "//\n\n";
- }
-
- void Parser::Generator::
- usage ()
- {
- CXX::Parser::options::print_usage (wcout);
- CXX::options::print_usage (wcout);
- }
-
- namespace
- {
- template <typename S>
- void
- open (S& ifs, NarrowString const& path)
- {
- try
- {
- Path fs_path (path);
- ifs.open (fs_path.string ().c_str (),
- std::ios_base::in | std::ios_base::binary);
-
- if (!ifs.is_open ())
- {
- wcerr << path.c_str () << ": error: unable to open in read mode"
- << endl;
-
- throw Parser::Generator::Failed ();
- }
- }
- catch (InvalidPath const&)
- {
- wcerr << "error: '" << path.c_str () << "' is not a valid "
- << "filesystem path" << endl;
-
- throw Parser::Generator::Failed ();
- }
- }
-
- void
- append (WideOutputFileStream& os,
- NarrowString const& path,
- WideInputFileStream& default_is)
- {
- using std::ios_base;
-
- if (path)
- {
- WideInputFileStream is;
- open (is, path);
- os << is.rdbuf ();
- }
- else if (default_is.is_open ())
- {
- os << default_is.rdbuf ();
- default_is.seekg (0, ios_base::beg);
- }
- }
-
- void
- append (WideOutputFileStream& os,
- NarrowStrings const& primary,
- NarrowStrings const& def)
- {
- NarrowStrings const& v (primary.empty () ? def : primary);
-
- for (NarrowStrings::const_iterator i (v.begin ()), e (v.end ());
- i != e; ++i)
- {
- os << i->c_str () << endl;
- }
- }
- }
-
-
- size_t Parser::Generator::
- generate (Parser::options const& ops,
- Schema& schema,
- Path const& file_path,
- bool fpt,
- StringLiteralMap const& string_literal_map,
- bool gen_driver,
- const WarningSet& disabled_warnings,
- FileList& file_list,
- AutoUnlinks& unlinks)
- {
- using std::ios_base;
-
- typedef cutl::re::regexsub Regex;
-
- try
- {
- bool generate_xml_schema (ops.generate_xml_schema ());
-
- // We could be compiling several schemas at once in which case
- // handling of the --generate-xml-schema option gets tricky: we
- // will need to rely on the presence of the --extern-xml-schema
- // to tell us which (fake) schema file corresponds to XML Schema.
- //
- if (generate_xml_schema)
- {
- if (NarrowString name = ops.extern_xml_schema ())
- {
- if (file_path.string () != name)
- generate_xml_schema = false;
- }
- }
-
- bool impl (!generate_xml_schema &&
- (ops.generate_noop_impl () ||
- ops.generate_print_impl ()));
-
- bool driver (gen_driver && !generate_xml_schema &&
- ops.generate_test_driver ());
-
- // Evaluate the graph for possibility of generating something useful.
- //
- {
- Validator validator;
- if (!validator.validate (
- ops, schema, file_path, driver, disabled_warnings))
- throw Failed ();
- }
-
- // Process names.
- //
- {
- NameProcessor proc;
- proc.process (ops, schema, file_path, string_literal_map);
- }
-
- bool validation ((ops.xml_parser () == "expat" ||
- ops.generate_validation ()) &&
- !ops.suppress_validation ());
-
- // Compute state machine info.
- //
- if (validation)
- {
- StateProcessor proc;
- proc.process (schema, file_path);
- }
-
- // Read-in type maps.
- //
- TypeMap::Namespaces type_map;
- {
- using namespace TypeMap;
-
- NarrowStrings const& files (ops.type_map ());
-
- for (NarrowStrings::const_iterator f (files.begin ());
- f != files.end (); ++f )
- {
- NarrowInputFileStream ifs;
- open (ifs, *f);
-
- Lexer l (ifs, *f);
- TypeMap::Parser p (l, *f);
-
- if (!p.parse (type_map))
- throw Failed ();
- }
-
- // Add the built-in mappings at the end.
- //
-
- // String-based types.
- //
- String char_type (ops.char_type ());
- String string_type;
-
- if (char_type == L"char")
- string_type = L"::std::string";
- else if (char_type == L"wchar_t")
- string_type = L"::std::wstring";
- else
- string_type = L"::std::basic_string< " + char_type + L" >";
-
- String xns;
- String auto_ptr;
- {
- Context ctx (std::wcerr, schema, file_path, ops, 0, 0, 0, 0);
- xns = ctx.xs_ns_name ();
- auto_ptr = ctx.auto_ptr;
- }
-
- String buffer (auto_ptr + L"< " + xns + L"::buffer >");
- TypeMap::Namespace xsd ("http://www\\.w3\\.org/2001/XMLSchema");
-
- xsd.types_push_back ("string", string_type);
- xsd.types_push_back ("normalizedString", string_type);
- xsd.types_push_back ("token", string_type);
- xsd.types_push_back ("Name", string_type);
- xsd.types_push_back ("NMTOKEN", string_type);
- xsd.types_push_back ("NMTOKENS", xns + L"::string_sequence");
- xsd.types_push_back ("NCName", string_type);
-
- xsd.types_push_back ("ID", string_type);
- xsd.types_push_back ("IDREF", string_type);
- xsd.types_push_back ("IDREFS", xns + L"::string_sequence");
-
- xsd.types_push_back ("language", string_type);
- xsd.types_push_back ("anyURI", string_type);
- xsd.types_push_back ("QName", xns + L"::qname");
-
- xsd.types_push_back ("base64Binary", buffer, buffer);
- xsd.types_push_back ("hexBinary", buffer, buffer);
-
- xsd.types_push_back ("gDay", xns + L"::gday");
- xsd.types_push_back ("gMonth", xns + L"::gmonth");
- xsd.types_push_back ("gYear", xns + L"::gyear");
- xsd.types_push_back ("gMonthDay", xns + L"::gmonth_day");
- xsd.types_push_back ("gYearMonth", xns + L"::gyear_month");
- xsd.types_push_back ("date", xns + L"::date");
- xsd.types_push_back ("time", xns + L"::time");
- xsd.types_push_back ("dateTime", xns + L"::date_time");
- xsd.types_push_back ("duration", xns + L"::duration");
-
- // Fundamental C++ types.
- //
- xsd.types_push_back ("boolean", "bool", "bool");
-
- xsd.types_push_back ("byte", "signed char", "signed char");
- xsd.types_push_back ("unsignedByte",
- "unsigned char",
- "unsigned char");
-
- xsd.types_push_back ("short", "short", "short");
- xsd.types_push_back ("unsignedShort",
- "unsigned short",
- "unsigned short");
-
- xsd.types_push_back ("int", "int", "int");
- xsd.types_push_back ("unsignedInt", "unsigned int", "unsigned int");
-
- xsd.types_push_back ("long", "long long", "long long");
- xsd.types_push_back ("unsignedLong",
- "unsigned long long",
- "unsigned long long");
-
- xsd.types_push_back ("integer", "long long", "long long");
-
- xsd.types_push_back ("negativeInteger", "long long", "long long");
- xsd.types_push_back ("nonPositiveInteger", "long long", "long long");
-
- xsd.types_push_back ("positiveInteger",
- "unsigned long long",
- "unsigned long long");
- xsd.types_push_back ("nonNegativeInteger",
- "unsigned long long",
- "unsigned long long");
-
- xsd.types_push_back ("float", "float", "float");
- xsd.types_push_back ("double", "double", "double");
- xsd.types_push_back ("decimal", "double", "double");
-
- type_map.push_back (xsd);
-
- // Everything else maps to void.
- //
- TypeMap::Namespace rest (".*");
- rest.types_push_back (".*", "void", "void");
- type_map.push_back (rest);
- }
-
- // Process types.
- //
- {
- TypeProcessor proc;
- proc.process (ops, schema, gen_driver, type_map);
- }
-
- //
- //
- bool inline_ (ops.generate_inline () && !generate_xml_schema);
- bool source (!generate_xml_schema);
-
- // Generate code.
- //
- NarrowString name (file_path.leaf ().string ());
- NarrowString skel_suffix (ops.skel_file_suffix ());
- NarrowString impl_suffix (ops.impl_file_suffix ());
-
- NarrowString hxx_suffix (ops.hxx_suffix ());
- NarrowString ixx_suffix (ops.ixx_suffix ());
- NarrowString cxx_suffix (ops.cxx_suffix ());
-
- Regex hxx_expr (
- ops.hxx_regex ().empty ()
- ? "#^(.+?)(\\.[^./\\\\]+)?$#$1" + skel_suffix + hxx_suffix + "#"
- : ops.hxx_regex ());
-
- Regex ixx_expr (
- ops.ixx_regex ().empty ()
- ? "#^(.+?)(\\.[^./\\\\]+)?$#$1" + skel_suffix + ixx_suffix + "#"
- : ops.ixx_regex ());
-
- Regex cxx_expr (
- ops.cxx_regex ().empty ()
- ? "#^(.+?)(\\.[^./\\\\]+)?$#$1" + skel_suffix + cxx_suffix + "#"
- : ops.cxx_regex ());
-
-
- Regex hxx_impl_expr;
- Regex cxx_impl_expr;
- Regex cxx_driver_expr;
-
- if (impl || driver)
- {
- hxx_impl_expr =
- "#^(.+?)(\\.[^./\\\\]+)?$#$1" + impl_suffix + hxx_suffix + "#";
-
- cxx_impl_expr =
- "#^(.+?)(\\.[^./\\\\]+)?$#$1" + impl_suffix + cxx_suffix + "#";
-
- cxx_driver_expr =
- "#^(.+?)(\\.[^./\\\\]+)?$#$1-driver" + cxx_suffix + "#";
- }
-
- if (!hxx_expr.match (name))
- {
- wcerr << "error: header expression '" <<
- hxx_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
-
- if (inline_ && !ixx_expr.match (name))
- {
- wcerr << "error: inline expression '" <<
- ixx_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
-
- if (source && !cxx_expr.match (name))
- {
- wcerr << "error: source expression '" <<
- cxx_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
-
- if (impl || driver)
- {
- if (!hxx_impl_expr.match (name))
- {
- wcerr << "error: implementation header expression '" <<
- hxx_impl_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
-
- if (!cxx_impl_expr.match (name))
- {
- wcerr << "error: implementation source expression '" <<
- cxx_impl_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
-
- if (!cxx_driver_expr.match (name))
- {
- wcerr << "error: driver source expression '" <<
- cxx_driver_expr.regex ().str ().c_str () << "' does not match '" <<
- name.c_str () << "'" << endl;
- throw Failed ();
- }
- }
-
- NarrowString hxx_name (hxx_expr.replace (name));
- NarrowString ixx_name (inline_ ? ixx_expr.replace (name) : NarrowString ());
- NarrowString cxx_name (source ? cxx_expr.replace (name) : NarrowString ());
-
- NarrowString hxx_impl_name;
- NarrowString cxx_impl_name;
- NarrowString cxx_driver_name;
-
- if (impl || driver)
- {
- hxx_impl_name = hxx_impl_expr.replace (name);
- cxx_impl_name = cxx_impl_expr.replace (name);
- cxx_driver_name = cxx_driver_expr.replace (name);
- }
-
- Path hxx_path (hxx_name);
- Path ixx_path (ixx_name);
- Path cxx_path (cxx_name);
-
- Path hxx_impl_path;
- Path cxx_impl_path;
- Path cxx_driver_path;
-
- if (impl || driver)
- {
- hxx_impl_path = Path (hxx_impl_name);
- cxx_impl_path = Path (cxx_impl_name);
- cxx_driver_path = Path (cxx_driver_name);
- }
-
- Path out_dir;
-
- if (NarrowString dir = ops.output_dir ())
- {
- try
- {
- out_dir = Path (dir);
- }
- catch (InvalidPath const&)
- {
- wcerr << dir.c_str () << ": error: invalid path" << endl;
- throw Failed ();
- }
- }
-
- if (fpt && !generate_xml_schema)
- {
- // In the file-per-type mode the schema files are always local
- // unless the user added the directory so that we propagate this
- // to the output files.
- //
- Path fpt_dir (file_path.directory ());
-
- if (!fpt_dir.empty ())
- out_dir /= fpt_dir;
- }
-
- if (!out_dir.empty ())
- {
- hxx_path = out_dir / hxx_path;
- ixx_path = out_dir / ixx_path;
- cxx_path = out_dir / cxx_path;
-
- if (impl || driver)
- {
- hxx_impl_path = out_dir / hxx_impl_path;
- cxx_impl_path = out_dir / cxx_impl_path;
- cxx_driver_path = out_dir /cxx_driver_path;
- }
- }
-
- // Open the impl files first so that if open fails, the skel files
- // are not deleted.
- //
- WideOutputFileStream hxx_impl;
- WideOutputFileStream cxx_impl;
- WideOutputFileStream cxx_driver;
-
- if (impl)
- {
- if (!ops.force_overwrite ())
- {
- WideInputFileStream tmp (
- hxx_impl_path.string ().c_str (), ios_base::in);
-
- if (tmp.is_open ())
- {
- wcerr << hxx_impl_path << ": error: cowardly refusing to " <<
- "overwrite an existing file" << endl;
- throw Failed ();
- }
-
- tmp.close ();
- }
-
- hxx_impl.open (hxx_impl_path.string ().c_str (), ios_base::out);
-
- if (!hxx_impl.is_open ())
- {
- wcerr << hxx_impl_path << ": error: unable to open in write mode"
- << endl;
- throw Failed ();
- }
-
- unlinks.add (hxx_impl_path);
- file_list.push_back (hxx_impl_path.string ());
-
- if (!ops.force_overwrite ())
- {
- WideInputFileStream tmp (
- cxx_impl_path.string ().c_str (), ios_base::in);
-
- if (tmp.is_open ())
- {
- wcerr << cxx_impl_path << ": error: cowardly refusing to " <<
- "overwrite an existing file" << endl;
- throw Failed ();
- }
-
- tmp.close ();
- }
-
- cxx_impl.open (cxx_impl_path.string ().c_str (), ios_base::out);
-
- if (!cxx_impl.is_open ())
- {
- wcerr << cxx_impl_path << ": error: unable to open in write mode"
- << endl;
- throw Failed ();
- }
-
- unlinks.add (cxx_impl_path);
- file_list.push_back (cxx_impl_path.string ());
- }
-
- if (driver)
- {
- if (!ops.force_overwrite ())
- {
- WideInputFileStream tmp (
- cxx_driver_path.string ().c_str (), ios_base::in);
-
- if (tmp.is_open ())
- {
- wcerr << cxx_driver_path << ": error: cowardly refusing to " <<
- "overwrite an existing file" << endl;
- throw Failed ();
- }
-
- tmp.close ();
- }
-
- cxx_driver.open (cxx_driver_path.string ().c_str (), ios_base::out);
-
- if (!cxx_driver.is_open ())
- {
- wcerr << cxx_driver_path << ": error: unable to open in write " <<
- "mode" << endl;
- throw Failed ();
- }
-
- unlinks.add (cxx_driver_path);
- file_list.push_back (cxx_driver_path.string ());
- }
-
- // Open the skel files.
- //
- WideOutputFileStream hxx (hxx_path.string ().c_str (), ios_base::out);
- WideOutputFileStream ixx;
- WideOutputFileStream cxx;
-
- if (!hxx.is_open ())
- {
- wcerr << hxx_path << ": error: unable to open in write mode" << endl;
- throw Failed ();
- }
-
- unlinks.add (hxx_path);
- file_list.push_back (hxx_path.string ());
-
- if (inline_)
- {
- ixx.open (ixx_path.string ().c_str (), ios_base::out);
-
- if (!ixx.is_open ())
- {
- wcerr << ixx_path << ": error: unable to open in write mode" << endl;
- throw Failed ();
- }
-
- unlinks.add (ixx_path);
- file_list.push_back (ixx_path.string ());
- }
-
-
- if (source)
- {
- cxx.open (cxx_path.string ().c_str (), ios_base::out);
-
- if (!cxx.is_open ())
- {
- wcerr << cxx_path << ": error: unable to open in write mode" << endl;
- throw Failed ();
- }
-
- unlinks.add (cxx_path);
- file_list.push_back (cxx_path.string ());
- }
-
- // Print copyright and license.
- //
- char const* copyright (
- ops.proprietary_license () ? copyright_proprietary : copyright_gpl);
-
- hxx << copyright;
-
- if (inline_)
- ixx << copyright;
-
- if (source)
- cxx << copyright;
-
- if (impl)
- {
- hxx_impl << copyright_impl;
- cxx_impl << copyright_impl;
- }
-
- if (driver)
- cxx_driver << copyright_impl;
-
- // Prologue.
- //
- WideInputFileStream prologue;
- {
- NarrowString name (ops.prologue_file ());
-
- if (name)
- open (prologue, name);
- }
-
- // Epilogue.
- //
- WideInputFileStream epilogue;
- {
- NarrowString name (ops.epilogue_file ());
-
- if (name)
- open (epilogue, name);
- }
-
- // SLOC counter.
- //
- size_t sloc_total (0);
- bool show_sloc (ops.show_sloc ());
-
- typedef
- compiler::ostream_filter<compiler::cxx_indenter, wchar_t>
- ind_filter;
-
- typedef
- compiler::ostream_filter<compiler::sloc_counter, wchar_t>
- sloc_filter;
-
- //
- //
- Regex guard_expr ("/([a-z])([A-Z])/$1_$2/"); // Split words.
-
- NarrowString guard_prefix (ops.guard_prefix ());
-
- if (!guard_prefix)
- guard_prefix = file_path.directory ().string ();
-
- if (guard_prefix)
- guard_prefix += '_';
-
- // HXX
- //
- {
- Context ctx (hxx,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- sloc_filter sloc (hxx);
-
- String guard (guard_expr.replace (guard_prefix + hxx_name));
- guard = ctx.escape (guard); // Make it a C++ id.
- std::transform (guard.begin (), guard.end(), guard.begin (), upcase);
-
- hxx << "#ifndef " << guard << endl
- << "#define " << guard << endl
- << endl;
-
- if (ctx.std >= cxx_version::cxx11)
- {
- hxx << "#ifndef XSD_CXX11" << endl
- << "#define XSD_CXX11" << endl
- << "#endif" << endl
- << endl;
- }
-
- // Copy prologue.
- //
- hxx << "// Begin prologue." << endl
- << "//" << endl;
-
- append (hxx, ops.hxx_prologue (), ops.prologue ());
- append (hxx, ops.hxx_prologue_file (), prologue);
-
- hxx << "//" << endl
- << "// End prologue." << endl
- << endl;
-
- // Version check.
- //
- hxx << "#include <xsd/cxx/config.hxx>" << endl
- << endl
- << "#if (XSD_INT_VERSION != " << XSD_INT_VERSION << "L)" << endl
- << "#error XSD runtime version mismatch" << endl
- << "#endif" << endl
- << endl;
-
- hxx << "#include <xsd/cxx/pre.hxx>" << endl
- << endl;
-
- // Generate.
- //
- {
- ind_filter ind (hxx); // We don't want to indent prologues/epilogues.
-
- if (!generate_xml_schema)
- generate_parser_forward (ctx);
-
- generate_parser_header (ctx, generate_xml_schema);
- }
-
- if (inline_)
- hxx << "#include " << ctx.process_include_path (ixx_name) << endl;
-
- hxx << "#include <xsd/cxx/post.hxx>" << endl
- << endl;
-
- // Copy epilogue.
- //
- hxx << "// Begin epilogue." << endl
- << "//" << endl;
-
- append (hxx, ops.hxx_epilogue_file (), epilogue);
- append (hxx, ops.hxx_epilogue (), ops.epilogue ());
-
- hxx << "//" << endl
- << "// End epilogue." << endl
- << endl;
-
- hxx << "#endif // " << guard << endl;
-
- if (show_sloc)
- wcerr << hxx_path << ": " << sloc.stream ().count () << endl;
-
- sloc_total += sloc.stream ().count ();
- }
-
-
- // IXX
- //
- if (inline_)
- {
- Context ctx (ixx,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- sloc_filter sloc (ixx);
-
- // Copy prologue.
- //
- ixx << "// Begin prologue." << endl
- << "//" << endl;
-
- append (ixx, ops.ixx_prologue (), ops.prologue ());
- append (ixx, ops.ixx_prologue_file (), prologue);
-
- ixx << "//" << endl
- << "// End prologue." << endl
- << endl;
-
- // Generate.
- //
- {
- ind_filter ind (ixx); // We don't want to indent prologues/epilogues.
- generate_parser_inline (ctx);
- }
-
- // Copy epilogue.
- //
- ixx << "// Begin epilogue." << endl
- << "//" << endl;
-
- append (ixx, ops.ixx_epilogue_file (), epilogue);
- append (ixx, ops.ixx_epilogue (), ops.epilogue ());
-
- ixx << "//" << endl
- << "// End epilogue." << endl
- << endl;
-
- if (show_sloc)
- wcerr << ixx_path << ": " << sloc.stream ().count () << endl;
-
- sloc_total += sloc.stream ().count ();
- }
-
-
- // CXX
- //
- if (source)
- {
- Context ctx (cxx,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- sloc_filter sloc (cxx);
-
- // Copy prologue.
- //
- cxx << "// Begin prologue." << endl
- << "//" << endl;
-
- append (cxx, ops.cxx_prologue (), ops.prologue ());
- append (cxx, ops.cxx_prologue_file (), prologue);
-
- cxx << "//" << endl
- << "// End prologue." << endl
- << endl;
-
- cxx << "#include <xsd/cxx/pre.hxx>" << endl
- << endl;
-
- cxx << "#include " << ctx.process_include_path (hxx_name) << endl
- << endl;
-
- // Generate.
- //
- {
- ind_filter ind (cxx); // We don't want to indent prologues/epilogues.
-
- if (!inline_)
- generate_parser_inline (ctx);
-
- generate_parser_source (ctx);
-
- if (validation)
- {
- generate_element_validation_source (ctx);
- generate_attribute_validation_source (ctx);
- generate_characters_validation_source (ctx);
- }
- }
-
- cxx << "#include <xsd/cxx/post.hxx>" << endl
- << endl;
-
- // Copy epilogue.
- //
- cxx << "// Begin epilogue." << endl
- << "//" << endl;
-
- append (cxx, ops.cxx_epilogue_file (), epilogue);
- append (cxx, ops.cxx_epilogue (), ops.epilogue ());
-
- cxx << "//" << endl
- << "// End epilogue." << endl
- << endl;
-
- if (show_sloc)
- wcerr << cxx_path << ": " << sloc.stream ().count () << endl;
-
- sloc_total += sloc.stream ().count ();
- }
-
- // HXX impl
- //
- if (impl)
- {
- Context ctx (hxx_impl,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- String guard (guard_expr.replace (guard_prefix + hxx_impl_name));
- guard = ctx.escape (guard); // Make it a C++ id.
- std::transform (guard.begin (), guard.end(), guard.begin (), upcase);
-
- hxx_impl << "#ifndef " << guard << endl
- << "#define " << guard << endl
- << endl;
-
- hxx_impl << "#include " << ctx.process_include_path (hxx_name)
- << endl << endl;
-
- {
- ind_filter ind (hxx_impl);
- generate_impl_header (ctx);
- }
-
- hxx_impl << "#endif // " << guard << endl;
- }
-
- // CXX impl
- //
- if (impl)
- {
- Context ctx (cxx_impl,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- cxx_impl << "#include " << ctx.process_include_path (hxx_impl_name)
- << endl << endl;
-
- {
- ind_filter ind (cxx_impl);
- generate_impl_source (ctx);
- }
- }
-
- // CXX driver
- //
- if (driver)
- {
- Context ctx (cxx_driver,
- schema,
- file_path,
- ops,
- &string_literal_map,
- &hxx_expr,
- &ixx_expr,
- &hxx_impl_expr);
-
- cxx_driver << "#include " << ctx.process_include_path (hxx_impl_name)
- << endl << endl;
-
- {
- ind_filter ind (cxx_driver);
- generate_driver_source (ctx);
- }
- }
-
- return sloc_total;
- }
- catch (UnrepresentableCharacter const& e)
- {
- wcerr << "error: character at position " << e.position () << " "
- << "in string '" << e.string () << "' is unrepresentable in "
- << "the target encoding" << endl;
-
- wcerr << "info: use the --custom-literals option to provide custom "
- << "string literals mapping" << endl;
-
- throw Failed ();
- }
- catch (NoNamespaceMapping const& e)
- {
- wcerr << e.file () << ":" << e.line () << ":" << e.column ()
- << ": error: unable to map XML Schema namespace '" << e.ns ()
- << "' to C++ namespace" << endl;
-
- wcerr << e.file () << ":" << e.line () << ":" << e.column ()
- << ": info: use the --namespace-map or --namespace-regex option "
- << "to provide custom mapping" << endl;
-
- throw Failed ();
- }
- catch (InvalidNamespaceMapping const& e)
- {
- wcerr << "error: invalid XML to C++ namespace mapping specified: "
- << "'" << e.mapping () << "': " << e.reason () << endl;
-
- throw Failed ();
- }
- catch (cutl::re::format const& e)
- {
- wcerr << "error: invalid regex: '" <<
- e.regex ().c_str () << "': " <<
- e.description ().c_str () << endl;
-
- throw Failed ();
- }
- catch (cutl::re::wformat const& e)
- {
- wcerr << "error: invalid regex: '" <<
- e.regex () << "': " << e.description ().c_str () << endl;
-
- throw Failed ();
- }
- }
-}
diff --git a/xsd/cxx/parser/generator.hxx b/xsd/cxx/parser/generator.hxx
deleted file mode 100644
index 6fd984b..0000000
--- a/xsd/cxx/parser/generator.hxx
+++ /dev/null
@@ -1,45 +0,0 @@
-// file : xsd/cxx/parser/generator.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_GENERATOR_HXX
-#define CXX_PARSER_GENERATOR_HXX
-
-#include <xsd-frontend/semantic-graph/elements.hxx> // Path
-#include <xsd-frontend/semantic-graph/schema.hxx>
-
-#include <xsd.hxx>
-#include <types.hxx>
-
-#include <cxx/literal-map.hxx>
-#include <cxx/parser/options.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- class Generator
- {
- public:
- static void
- usage ();
-
- struct Failed {};
-
- static size_t
- generate (options const&,
- XSDFrontend::SemanticGraph::Schema&,
- XSDFrontend::SemanticGraph::Path const& file,
- bool file_per_type,
- StringLiteralMap const&,
- bool gen_driver,
- const WarningSet& disabled_warnings,
- FileList& file_list,
- AutoUnlinks& unlinks);
-
- private:
- Generator ();
- };
- }
-}
-
-#endif // CXX_PARSER_GENERATOR_HXX
diff --git a/xsd/cxx/parser/impl-header.cxx b/xsd/cxx/parser/impl-header.cxx
deleted file mode 100644
index 03106ca..0000000
--- a/xsd/cxx/parser/impl-header.cxx
+++ /dev/null
@@ -1,232 +0,0 @@
-// file : xsd/cxx/parser/impl-header.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/impl-header.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Enumeration: Traversal::Enumeration, Context
- {
- Enumeration (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- String const& name (eimpl (e));
- String const& ret (ret_type (e));
- SemanticGraph::Type& base (e.inherits ().base ());
-
- os << "class " << type_exp << name << ": " <<
- "public virtual " << ename (e) << "," << endl
- << " public " << fq_name (base, "impl")
- << "{"
- << "public:" << endl
- << "virtual void" << endl
- << "pre ();"
- << endl
- << "virtual " << ret << endl
- << post_name (e) << " ();"
- << "};";
- }
- };
-
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- String const& name (eimpl (l));
- SemanticGraph::Type& t (l.argumented ().type ());
-
- String item (unclash (ename (l), "item"));
-
- os << "class " << type_exp << name << ": public virtual " <<
- ename (l)
- << "{"
- << "public:" << endl
- << "virtual void" << endl
- << "pre ();"
- << endl;
-
- // item
- //
- String const& arg (arg_type (t));
-
- os << "virtual void" << endl
- << item;
-
- if (arg == L"void")
- os << " ();";
- else
- os << " (" << arg << ");";
-
- os << endl;
-
- // post
- //
- String const& ret (ret_type (l));
-
- os << "virtual " << ret << endl
- << post_name (l) << " ();"
- << "};";
- }
- };
-
- struct Union: Traversal::Union, Context
- {
- Union (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& u)
- {
- String const& name (eimpl (u));
- String const& ret (ret_type (u));
-
- os << "class " << type_exp << name << ": public virtual " <<
- ename (u)
- << "{"
- << "public:" << endl
- << "virtual void" << endl
- << "pre ();"
- << endl
- << "virtual void" << endl
- << "_characters (const " << string_type << "&);"
- << endl
- << "virtual " << ret << endl
- << post_name (u) << " ();"
- << "};";
- }
- };
-
-
- //
- //
- struct ParserCallback: Traversal::Member, Context
- {
- ParserCallback (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- String const& arg (arg_type (m.type ()));
-
- os << "virtual void" << endl
- << ename (m);
-
- if (arg == L"void")
- os << " ();";
- else
- os << " (" << arg << ");";
-
- os << endl;
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c),
- parser_callback_ (c)
- {
- names_parser_callback_ >> parser_callback_;
- }
-
- virtual void
- traverse (Type& c)
- {
- String const& name (eimpl (c));
- String const& ret (ret_type (c));
-
- os << "class " << type_exp << name << ": public virtual " <<
- ename (c);
-
- if (c.inherits_p ())
- os << "," << endl
- << " public " << fq_name (c.inherits ().base (), "impl");
-
- os << "{"
- << "public:" << endl
- << "virtual void" << endl
- << "pre ();"
- << endl;
-
- // In case of an inheritance-by-restriction, we don't need to
- // generate parser callbacks, etc. since they are the same as in
- // the base.
- //
- if (!restriction_p (c))
- {
- names (c, names_parser_callback_);
- }
-
- os << "virtual " << ret << endl
- << post_name (c) << " ();"
- << "};";
- }
-
- private:
- //
- //
- ParserCallback parser_callback_;
- Traversal::Names names_parser_callback_;
- };
- }
-
- void
- generate_impl_header (Context& ctx)
- {
- Traversal::Schema schema;
-
- Sources sources;
- Includes includes (ctx, Includes::impl_header);
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> includes;
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Union union_ (ctx);
- Complex complex (ctx);
- Enumeration enumeration (ctx);
-
- names >> list;
- names >> union_;
- names >> complex;
- names >> enumeration;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/impl-header.hxx b/xsd/cxx/parser/impl-header.hxx
deleted file mode 100644
index f22678a..0000000
--- a/xsd/cxx/parser/impl-header.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/impl-header.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_IMPL_HEADER_HXX
-#define CXX_PARSER_IMPL_HEADER_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_impl_header (Context&);
- }
-}
-
-#endif // CXX_PARSER_IMPL_HEADER_HXX
diff --git a/xsd/cxx/parser/impl-source.cxx b/xsd/cxx/parser/impl-source.cxx
deleted file mode 100644
index 592c956..0000000
--- a/xsd/cxx/parser/impl-source.cxx
+++ /dev/null
@@ -1,384 +0,0 @@
-// file : xsd/cxx/parser/impl-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/impl-source.hxx>
-#include <cxx/parser/print-impl-common.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Enumeration: Traversal::Enumeration, Context
- {
- Enumeration (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- String const& name (eimpl (e));
- String const& ret (ret_type (e));
- SemanticGraph::Type& base (e.inherits ().base ());
- String const& base_ret (ret_type (base));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // pre
- //
- os << "void " << name << "::" << endl
- << "pre ()"
- << "{"
- << "}";
-
- // post
- //
- os << ret << " " << name << "::" << endl
- << post_name (e) << " ()"
- << "{";
-
- if (ret == base_ret)
- {
- os << (ret != L"void" ? "return " : "") <<
- post_name (base) << " ();";
- }
- else if (ret == L"void")
- {
- os << arg_type (base) << " v (" << post_name (base) << " ());"
- << endl;
-
- if (options.generate_print_impl ())
- {
- PrintCall t (*this, e.name (), "v");
- t.dispatch (base);
- }
- else
- os << "// TODO" << endl
- << "//" << endl;
- }
- else
- {
- if (base_ret == L"void")
- os << post_name (base) << " ();";
- else
- os << arg_type (base) << " v (" << post_name (base) << " ());"
- << endl
- << "// TODO" << endl
- << "//" << endl
- << "// return ... ;" << endl;
- }
-
- os << "}";
- }
- };
-
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- String const& name (eimpl (l));
- SemanticGraph::Type& type (l.argumented ().type ());
-
- String item (unclash (ename (l), "item"));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // pre
- //
- os << "void " << name << "::" << endl
- << "pre ()"
- << "{"
- << "}";
-
- // item
- //
- String const& arg (arg_type (type));
-
- os << "void " << name << "::" << endl
- << item;
-
- if (arg == L"void")
- os << " ()";
- else
- os << " (" << arg << " " << item << ")";
-
- os << "{";
-
- if (arg != L"void")
- {
- if (options.generate_print_impl ())
- {
- PrintCall t (*this, type.name (), item);
- t.dispatch (type);
- }
- else
- os << "// TODO" << endl
- << "//" << endl;
- }
-
- os << "}";
-
- // post
- //
- String const& ret (ret_type (l));
-
- os << ret << " " << name << "::" << endl
- << post_name (l) << " ()"
- << "{";
-
- if (ret != L"void")
- os << "// TODO" << endl
- << "//" << endl
- << "// return ... ;" << endl;
-
- os << "}";
- }
- };
-
- //
- //
- struct Union: Traversal::Union, Context
- {
- Union (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& u)
- {
- String const& name (eimpl (u));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // pre
- //
- os << "void " << name << "::" << endl
- << "pre ()"
- << "{"
- << "}";
-
- // _characters
- //
- os << "void " << name << "::" << endl
- << "_characters (const " << string_type << "& s)"
- << "{";
-
- if (options.generate_print_impl ())
- os << cout_inst << " << " << strlit (u.name () + L": ") <<
- " << s << std::endl;";
- else
- os << "// TODO" << endl
- << "//" << endl;
-
- os << "}";
-
- // post
- //
- String const& ret (ret_type (u));
-
- os << ret << " " << name << "::" << endl
- << post_name (u) << " ()"
- << "{";
-
- if (ret != L"void")
- os << "// TODO" << endl
- << "//" << endl
- << "// return ... ;" << endl;
-
- os << "}";
- }
- };
-
- //
- //
- struct ParserCallback: Traversal::Member, Context
- {
- ParserCallback (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- String const& name (ename (m));
- String const& arg (arg_type (m.type ()));
-
- os << "void " <<
- eimpl (dynamic_cast<SemanticGraph::Complex&> (m.scope ())) <<
- "::" << endl
- << name;
-
- if (arg == L"void")
- os << " ()";
- else
- os << " (" << arg << " " << name << ")";
-
- os << "{";
-
- if (arg != L"void")
- {
- if (options.generate_print_impl ())
- {
- PrintCall t (*this, m.name (), name);
- t.dispatch (m.type ());
- }
- else
- os << "// TODO" << endl
- << "//" << endl;
- }
-
- os << "}";
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c), parser_callback_ (c)
- {
- names_parser_callback_ >> parser_callback_;
- }
-
- virtual void
- traverse (Type& c)
- {
- String const& name (eimpl (c));
-
- bool restriction (restriction_p (c));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // pre
- //
- os << "void " << name << "::" << endl
- << "pre ()"
- << "{"
- << "}";
-
- // Parser callbacks.
- //
- if (!restriction)
- names (c, names_parser_callback_);
-
- // post
- //
- String const& ret (ret_type (c));
-
- os << ret << " " << name << "::" << endl
- << post_name (c) << " ()"
- << "{";
-
- if (c.inherits_p ())
- {
- SemanticGraph::Type& base (c.inherits ().base ());
- String const& base_ret (ret_type (base));
-
- if (ret == base_ret)
- {
- os << (ret != L"void" ? "return " : "") <<
- post_name (base) << " ();";
- }
- else if (ret == L"void")
- {
- os << arg_type (base) << " v (" << post_name (base) << " ());"
- << endl;
-
- if (options.generate_print_impl ())
- {
- PrintCall t (*this, c.name (), "v");
- t.dispatch (base);
- }
- else
- os << "// TODO" << endl
- << "//" << endl;
- }
- else
- {
- if (base_ret == L"void")
- os << post_name (base) << " ();";
- else
- os << arg_type (base) << " v (" << post_name (base) << " ());"
- << endl
- << "// TODO" << endl
- << "//" << endl
- << "// return ... ;" << endl;
- }
- }
- else
- {
- if (ret != L"void")
- os << "// TODO" << endl
- << "//" << endl
- << "// return ... ;" << endl;
- }
-
- os << "}";
- }
-
- private:
- //
- //
- ParserCallback parser_callback_;
- Traversal::Names names_parser_callback_;
- };
- }
-
- void
- generate_impl_source (Context& ctx)
- {
- if (ctx.options.generate_print_impl ())
- ctx.os << "#include <iostream>" << endl
- << endl;
-
- Traversal::Schema schema;
- Sources sources;
- Traversal::Names schema_names;
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Union union_ (ctx);
- Complex complex (ctx);
- Enumeration enumeration (ctx);
-
- names >> list;
- names >> union_;
- names >> complex;
- names >> enumeration;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/impl-source.hxx b/xsd/cxx/parser/impl-source.hxx
deleted file mode 100644
index 2fa5183..0000000
--- a/xsd/cxx/parser/impl-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/impl-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_IMPL_SOURCE_HXX
-#define CXX_PARSER_IMPL_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_impl_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_IMPL_SOURCE_HXX
diff --git a/xsd/cxx/parser/name-processor.cxx b/xsd/cxx/parser/name-processor.cxx
deleted file mode 100644
index a06f1e3..0000000
--- a/xsd/cxx/parser/name-processor.cxx
+++ /dev/null
@@ -1,1175 +0,0 @@
-// file : xsd/cxx/parser/name-processor.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <set>
-#include <map>
-#include <sstream>
-#include <iostream>
-
-#include <cxx/parser/name-processor.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- //
- //
- typedef set<String> NameSet;
-
- class Context: public CXX::Context
- {
- public:
- Context (Parser::options const& ops,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- StringLiteralMap const* map)
- : CXX::Context (std::wcerr, root, path, ops, map),
- skel_suffix_ (ops.skel_type_suffix ()),
- impl_suffix_ (ops.impl_type_suffix ()),
- impl (ops.generate_noop_impl () ||
- ops.generate_print_impl () ||
- ops.generate_test_driver ()),
- skel_suffix (skel_suffix_),
- impl_suffix (impl_suffix_),
- global_type_names (global_type_names_),
- polymorphic (ops.generate_polymorphic ())
- {
- }
-
- protected:
- Context (Context& c)
- : CXX::Context (c),
- impl (c.impl),
- skel_suffix (c.skel_suffix),
- impl_suffix (c.impl_suffix),
- global_type_names (c.global_type_names),
- polymorphic (c.polymorphic)
- {
- }
-
- public:
- String
- find_name (String const& n, NameSet& set)
- {
- String base_name (escape (n));
- String name (base_name);
-
- for (size_t i (1); set.find (name) != set.end (); ++i)
- {
- std::wostringstream os;
- os << i;
- name = base_name + os.str ();
- }
-
- set.insert (name);
- return name;
- }
-
- private:
- String const skel_suffix_;
- String const impl_suffix_;
-
- map<String, NameSet> global_type_names_;
-
- public:
- bool const impl;
- String const& skel_suffix;
- String const& impl_suffix;
-
- map<String, NameSet>& global_type_names;
-
- bool polymorphic;
- };
-
-
- //
- //
- struct PrimaryMember: Traversal::Member, Context
- {
- PrimaryMember (Context& c, NameSet& set)
- : Context (c), set_ (set)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (Parser::Context::skip (m))
- return;
-
- m.context ().set ("name", find_name (m.name (), set_));
- }
-
- private:
- NameSet& set_;
- };
-
- struct DerivedMember: Traversal::Member, Context
- {
- DerivedMember (Context& c, NameSet& set)
- : Context (c), set_ (set)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (Parser::Context::skip (m))
- return;
-
- m.context ().set ("parser",
- find_name (m.name () + L"_parser", set_));
-
- String const& base (m.context ().get<String> ("name"));
- m.context ().set ("member", find_name (base + L"_parser_", set_));
-
- if (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !m.type ().context ().count ("anonymous"))
- {
- m.context ().set (
- "member-map", find_name (base + L"_parser_map_", set_));
-
- m.context ().set (
- "member-map-impl",
- find_name (base + L"_parser_map_impl_", set_));
- }
- }
-
- private:
- NameSet& set_;
- };
-
-
- //
- //
- struct MemberInRestrictionBase: Traversal::Member
- {
- protected:
- MemberInRestrictionBase (NameSet& set, SemanticGraph::Complex& base)
- : set_ (set), base_ (base)
- {
- }
-
- struct NotFound {};
-
- Type&
- find_member (SemanticGraph::Complex& c, Type& m)
- {
- using SemanticGraph::Complex;
-
- Complex::NamesIteratorPair r (c.find (m.name ()));
-
- for (; r.first != r.second; ++r.first)
- {
- if (r.first->named ().is_a<Type> ())
- {
- Type& bm (dynamic_cast<Type&> (r.first->named ()));
-
- if (typeid (bm) != typeid (m))
- continue;
-
- if (m.qualified_p ())
- {
- if (bm.qualified_p () &&
- m.name () == bm.name () &&
- m.namespace_ ().name () == bm.namespace_ ().name ())
- return bm;
- }
- else
- {
- if (!bm.qualified_p () && m.name () == bm.name ())
- return bm;
- }
- }
- }
-
- // If we didn't find anything, try our base.
- //
- if (c.inherits_p ())
- {
- SemanticGraph::Type& base (c.inherits ().base ());
-
- if (base.is_a<Complex> ())
- return find_member (dynamic_cast<Complex&> (base), m);
- }
-
- //std::wcerr << "unable to find member " << m.name () << " in "
- // << c.name () << std::endl;
-
- throw NotFound ();
- }
-
- protected:
- NameSet& set_;
- SemanticGraph::Complex& base_;
- };
-
- struct PrimaryMemberInRestriction: MemberInRestrictionBase, Context
- {
- PrimaryMemberInRestriction (Context& c,
- NameSet& set,
- SemanticGraph::Complex& base)
- : MemberInRestrictionBase (set, base), Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (Parser::Context::skip (m))
- return;
-
- String name;
-
- try
- {
- // Try to find corresponding member in one of our bases.
- // This may fail if we use an element that substitutes
- // one in our base.
- //
- Type& bm (find_member (base_, m));
- name = bm.context ().get<String> ("name");
- }
- catch (NotFound const&)
- {
- // Fall back to the standard name assignment.
- //
- name = find_name (m.name (), set_);
- }
-
- m.context ().set ("name", name);
- }
- };
-
- struct DerivedMemberInRestriction: MemberInRestrictionBase, Context
- {
- DerivedMemberInRestriction (Context& c,
- NameSet& set,
- SemanticGraph::Complex& base)
- : MemberInRestrictionBase (set, base), Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (Parser::Context::skip (m))
- return;
-
- bool poly (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !m.type ().context ().count ("anonymous"));
-
- String parser, member, member_map, member_map_impl;
-
- try
- {
- // Try to find corresponding member in one of our bases.
- // This may fail if we use an element that substitutes
- // one in our base.
- //
- Type& bm (find_member (base_, m));
- parser = bm.context ().get<String> ("parser");
- member = bm.context ().get<String> ("member");
-
- if (poly)
- {
- member_map = bm.context ().get<String> ("member-map");
- member_map_impl = bm.context ().get<String> ("member-map-impl");
- }
- }
- catch (NotFound const&)
- {
- // Fall back to the standard name assignment.
- //
- String const& base (m.context ().get<String> ("name"));
-
- parser = find_name (m.name () + L"_parser", set_);
- member = find_name (base + L"_parser_", set_);
-
- if (poly)
- {
- member_map = find_name (base + L"_parser_map_", set_);
- member_map_impl = find_name (base + L"_parser_map_impl_", set_);
- }
- }
-
- m.context ().set ("parser", parser);
- m.context ().set ("member", member);
-
- if (poly)
- {
- m.context ().set ("member-map", member_map);
- m.context ().set ("member-map-impl", member_map_impl);
- }
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& c)
- {
- SemanticGraph::Context& cc (c.context ());
-
- // Use processed name.
- //
- String const& name (cc.get<String> ("name"));
-
- // We leave this set around to allow other mappings to use
- // this information.
- //
- cc.set ("cxx-parser-name-processor-member-set", NameSet ());
- NameSet& member_set (
- cc.get<NameSet> ("cxx-parser-name-processor-member-set"));
-
- member_set.insert (name);
-
- // Add our base's members to the initial list unless we are
- // inheriting by restriction in which case we need to have
- // the same names as our base.
- //
- bool restriction (false);
-
- if (c.inherits_p ())
- {
- // @@ What if this types name is the same as one of base's
- // members?
- //
- SemanticGraph::Type& base (c.inherits ().base ());
-
- if (base.is_a<SemanticGraph::Complex> ())
- {
- if (!base.context ().count (
- "cxx-parser-name-processor-member-set"))
- {
- dispatch (base);
- }
-
- NameSet const& base_set (
- base.context ().get<NameSet> (
- "cxx-parser-name-processor-member-set"));
-
- member_set.insert (base_set.begin (), base_set.end ());
-
- // Inheritance by restriction from anyType is a special case.
- //
- restriction = c.inherits ().is_a<SemanticGraph::Restricts> () &&
- !c.inherits ().base ().is_a<SemanticGraph::AnyType> ();
- }
- }
-
- if (restriction)
- {
- // First assign the "primary" names.
- //
- {
- PrimaryMemberInRestriction member (
- *this,
- member_set,
- dynamic_cast<SemanticGraph::Complex&> (
- c.inherits ().base ()));
-
- Traversal::Names names (member);
-
- Complex::names (c, names);
- }
-
- // Assign "derived" names.
- //
- {
- DerivedMemberInRestriction member (
- *this,
- member_set,
- dynamic_cast<SemanticGraph::Complex&> (
- c.inherits ().base ()));
-
- Traversal::Names names (member);
-
- Complex::names (c, names);
- }
- }
- else
- {
- // First assign the "primary" names.
- //
- {
- PrimaryMember member (*this, member_set);
- Traversal::Names names (member);
-
- Complex::names (c, names);
- }
-
- // Assign "derived" names.
- //
- {
- DerivedMember member (*this, member_set);
- Traversal::Names names (member);
-
- Complex::names (c, names);
- }
- }
- }
- };
-
-
- //
- //
- struct GlobalType: Traversal::Type, Context
- {
- GlobalType (Context& c, NameSet& set)
- : Context (c), set_ (set)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type& t)
- {
- SemanticGraph::Context& c (t.context ());
- String const& n (t.name ());
-
- String name (find_name (n + skel_suffix, set_));
- c.set ("name", name);
-
- // Assign the post_* name.
- //
- c.set ("post", find_post_name (t));
-
- // Note that we do not add this name to the set so that it
- // does not influence other names.
- //
- if (impl)
- c.set ("impl", escape (n + impl_suffix));
- }
-
- private:
- String
- find_post_name (SemanticGraph::Type& t)
- {
- String const& n (t.name ());
-
- // It is possible that our base has the same type name (just
- // in a different namespaces). Avoid name clash in this case.
- //
- using SemanticGraph::Complex;
-
- Complex* c = dynamic_cast<Complex*> (&t);
-
- if (c == 0 || !c->inherits_p ())
- {
- return escape (L"post_" + n);
- }
- else
- {
- NameSet set;
-
- // Collect all base's post_*. In some mutual inclusion cases it
- // is possible that our base won't have the post name assigned
- // yet. In this situation will will have to figure it out
- // ourselves (we can do it since we use the "raw" type name).
- //
- SemanticGraph::Type* b (&c->inherits ().base ());
-
- while (true)
- {
- if (b->context ().count ("post"))
- set.insert (b->context ().get<String> ("post"));
- else
- set.insert (find_post_name (*b));
-
- Complex* cb (dynamic_cast<Complex*> (b));
-
- if (cb != 0 && cb->inherits_p ())
- {
- b = &cb->inherits ().base ();
- continue;
- }
-
- break;
- }
-
- String base_name (escape (L"post_" + n));
- String post (base_name);
-
- for (size_t i (1); set.find (post) != set.end (); ++i)
- {
- std::wostringstream os;
- os << i;
- post = base_name + os.str ();
- }
-
- return post;
- }
- }
-
- private:
- NameSet& set_;
- };
-
-
- struct Namespace: Traversal::Namespace, Context
- {
- Namespace (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& ns)
- {
- NameSet& type_set (global_type_names[ns.name ()]);
-
- GlobalType type (*this, type_set);
- Traversal::Names names (type);
-
- Traversal::Namespace::names (ns, names);
- }
- };
-
-
- struct FundType: Traversal::AnyType,
- Traversal::AnySimpleType,
-
- Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Traversal::Fundamental::Entity,
- Traversal::Fundamental::Entities,
-
- Context
- {
- FundType (Context& c)
- : Context (c)
- {
- }
-
- // anyType & anySimpleType.
- //
- virtual void
- traverse (SemanticGraph::AnyType& t)
- {
- t.context ().set ("name", make_skel_name ("any_type"));
- t.context ().set ("impl", make_impl_name ("any_type"));
- t.context ().set ("post", String ("post_any_type"));
- }
-
- virtual void
- traverse (SemanticGraph::AnySimpleType& t)
- {
- t.context ().set ("name", make_skel_name ("any_simple_type"));
- t.context ().set ("impl", make_impl_name ("any_simple_type"));
- t.context ().set ("post", String ("post_any_simple_type"));
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- t.context ().set ("name", make_skel_name ("boolean"));
- t.context ().set ("impl", make_impl_name ("boolean"));
- t.context ().set ("post", String ("post_boolean"));
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- t.context ().set ("name", make_skel_name ("byte"));
- t.context ().set ("impl", make_impl_name ("byte"));
- t.context ().set ("post", String ("post_byte"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- t.context ().set ("name", make_skel_name ("unsigned_byte"));
- t.context ().set ("impl", make_impl_name ("unsigned_byte"));
- t.context ().set ("post", String ("post_unsigned_byte"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- t.context ().set ("name", make_skel_name ("short"));
- t.context ().set ("impl", make_impl_name ("short"));
- t.context ().set ("post", String ("post_short"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- t.context ().set ("name", make_skel_name ("unsigned_short"));
- t.context ().set ("impl", make_impl_name ("unsigned_short"));
- t.context ().set ("post", String ("post_unsigned_short"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- t.context ().set ("name", make_skel_name ("int"));
- t.context ().set ("impl", make_impl_name ("int"));
- t.context ().set ("post", String ("post_int"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- t.context ().set ("name", make_skel_name ("unsigned_int"));
- t.context ().set ("impl", make_impl_name ("unsigned_int"));
- t.context ().set ("post", String ("post_unsigned_int"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- t.context ().set ("name", make_skel_name ("long"));
- t.context ().set ("impl", make_impl_name ("long"));
- t.context ().set ("post", String ("post_long"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- t.context ().set ("name", make_skel_name ("unsigned_long"));
- t.context ().set ("impl", make_impl_name ("unsigned_long"));
- t.context ().set ("post", String ("post_unsigned_long"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- t.context ().set ("name", make_skel_name ("integer"));
- t.context ().set ("impl", make_impl_name ("integer"));
- t.context ().set ("post", String ("post_integer"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- t.context ().set ("name", make_skel_name ("non_positive_integer"));
- t.context ().set ("impl", make_impl_name ("non_positive_integer"));
- t.context ().set ("post", String ("post_non_positive_integer"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- t.context ().set ("name", make_skel_name ("non_negative_integer"));
- t.context ().set ("impl", make_impl_name ("non_negative_integer"));
- t.context ().set ("post", String ("post_non_negative_integer"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- t.context ().set ("name", make_skel_name ("positive_integer"));
- t.context ().set ("impl", make_impl_name ("positive_integer"));
- t.context ().set ("post", String ("post_positive_integer"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- t.context ().set ("name", make_skel_name ("negative_integer"));
- t.context ().set ("impl", make_impl_name ("negative_integer"));
- t.context ().set ("post", String ("post_negative_integer"));
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- t.context ().set ("name", make_skel_name ("float"));
- t.context ().set ("impl", make_impl_name ("float"));
- t.context ().set ("post", String ("post_float"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- t.context ().set ("name", make_skel_name ("double"));
- t.context ().set ("impl", make_impl_name ("double"));
- t.context ().set ("post", String ("post_double"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- t.context ().set ("name", make_skel_name ("decimal"));
- t.context ().set ("impl", make_impl_name ("decimal"));
- t.context ().set ("post", String ("post_decimal"));
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- t.context ().set ("name", make_skel_name ("string"));
- t.context ().set ("impl", make_impl_name ("string"));
- t.context ().set ("post", String ("post_string"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- t.context ().set ("name", make_skel_name ("normalized_string"));
- t.context ().set ("impl", make_impl_name ("normalized_string"));
- t.context ().set ("post", String ("post_normalized_string"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- t.context ().set ("name", make_skel_name ("token"));
- t.context ().set ("impl", make_impl_name ("token"));
- t.context ().set ("post", String ("post_token"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- t.context ().set ("name", make_skel_name ("nmtoken"));
- t.context ().set ("impl", make_impl_name ("nmtoken"));
- t.context ().set ("post", String ("post_nmtoken"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens& t)
- {
- t.context ().set ("name", make_skel_name ("nmtokens"));
- t.context ().set ("impl", make_impl_name ("nmtokens"));
- t.context ().set ("post", String ("post_nmtokens"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- t.context ().set ("name", make_skel_name ("name"));
- t.context ().set ("impl", make_impl_name ("name"));
- t.context ().set ("post", String ("post_name"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- t.context ().set ("name", make_skel_name ("ncname"));
- t.context ().set ("impl", make_impl_name ("ncname"));
- t.context ().set ("post", String ("post_ncname"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language& t)
- {
- t.context ().set ("name", make_skel_name ("language"));
- t.context ().set ("impl", make_impl_name ("language"));
- t.context ().set ("post", String ("post_language"));
- }
-
-
- // Qualified name.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- t.context ().set ("name", make_skel_name ("qname"));
- t.context ().set ("impl", make_impl_name ("qname"));
- t.context ().set ("post", String ("post_qname"));
- }
-
-
- // ID/IDREF.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- t.context ().set ("name", make_skel_name ("id"));
- t.context ().set ("impl", make_impl_name ("id"));
- t.context ().set ("post", String ("post_id"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- t.context ().set ("name", make_skel_name ("idref"));
- t.context ().set ("impl", make_impl_name ("idref"));
- t.context ().set ("post", String ("post_idref"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs& t)
- {
- t.context ().set ("name", make_skel_name ("idrefs"));
- t.context ().set ("impl", make_impl_name ("idrefs"));
- t.context ().set ("post", String ("post_idrefs"));
- }
-
- // URI.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI& t)
- {
- t.context ().set ("name", make_skel_name ("uri"));
- t.context ().set ("impl", make_impl_name ("uri"));
- t.context ().set ("post", String ("post_uri"));
- }
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- t.context ().set ("name", make_skel_name ("base64_binary"));
- t.context ().set ("impl", make_impl_name ("base64_binary"));
- t.context ().set ("post", String ("post_base64_binary"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- t.context ().set ("name", make_skel_name ("hex_binary"));
- t.context ().set ("impl", make_impl_name ("hex_binary"));
- t.context ().set ("post", String ("post_hex_binary"));
- }
-
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- t.context ().set ("name", make_skel_name ("date"));
- t.context ().set ("impl", make_impl_name ("date"));
- t.context ().set ("post", String ("post_date"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- t.context ().set ("name", make_skel_name ("date_time"));
- t.context ().set ("impl", make_impl_name ("date_time"));
- t.context ().set ("post", String ("post_date_time"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- t.context ().set ("name", make_skel_name ("duration"));
- t.context ().set ("impl", make_impl_name ("duration"));
- t.context ().set ("post", String ("post_duration"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- t.context ().set ("name", make_skel_name ("gday"));
- t.context ().set ("impl", make_impl_name ("gday"));
- t.context ().set ("post", String ("post_gday"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- t.context ().set ("name", make_skel_name ("gmonth"));
- t.context ().set ("impl", make_impl_name ("gmonth"));
- t.context ().set ("post", String ("post_gmonth"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- t.context ().set ("name", make_skel_name ("gmonth_day"));
- t.context ().set ("impl", make_impl_name ("gmonth_day"));
- t.context ().set ("post", String ("post_gmonth_day"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- t.context ().set ("name", make_skel_name ("gyear"));
- t.context ().set ("impl", make_impl_name ("gyear"));
- t.context ().set ("post", String ("post_gyear"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- t.context ().set ("name", make_skel_name ("gyear_month"));
- t.context ().set ("impl", make_impl_name ("gyear_month"));
- t.context ().set ("post", String ("post_gyear_month"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- t.context ().set ("name", make_skel_name ("time"));
- t.context ().set ("impl", make_impl_name ("time"));
- t.context ().set ("post", String ("post_time"));
- }
-
- // Entity.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Entity& t)
- {
- t.context ().set ("name", make_skel_name ("entity"));
- t.context ().set ("impl", make_impl_name ("entity"));
- t.context ().set ("post", String ("post_entity"));
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities& t)
- {
- t.context ().set ("name", make_skel_name ("entities"));
- t.context ().set ("impl", make_impl_name ("entities"));
- t.context ().set ("post", String ("post_entities"));
- }
-
- private:
- String
- make_skel_name (String const& base)
- {
- return escape (base + skel_suffix);
- }
-
- String
- make_impl_name (String const& base)
- {
- return escape (base + impl_suffix);
- }
- };
-
- // Go into sourced/included/imported schemas while making sure
- // we don't process the same stuff more than once.
- //
- struct Uses: Traversal::Sources,
- Traversal::Includes,
- Traversal::Imports
- {
- virtual void
- traverse (SemanticGraph::Sources& sr)
- {
- SemanticGraph::Schema& s (sr.schema ());
-
- if (!s.context ().count ("cxx-parser-name-processor-seen"))
- {
- s.context ().set ("cxx-parser-name-processor-seen", true);
- Traversal::Sources::traverse (sr);
- }
- }
-
- virtual void
- traverse (SemanticGraph::Includes& i)
- {
- SemanticGraph::Schema& s (i.schema ());
-
- if (!s.context ().count ("cxx-parser-name-processor-seen"))
- {
- s.context ().set ("cxx-parser-name-processor-seen", true);
- Traversal::Includes::traverse (i);
- }
- }
-
- virtual void
- traverse (SemanticGraph::Imports& i)
- {
- SemanticGraph::Schema& s (i.schema ());
-
- if (!s.context ().count ("cxx-parser-name-processor-seen"))
- {
- s.context ().set ("cxx-parser-name-processor-seen", true);
- Traversal::Imports::traverse (i);
- }
- }
- };
-
- // Go into implied schemas while making sure we don't process
- // the same stuff more than once.
- //
- struct Implies: Traversal::Implies
- {
- virtual void
- traverse (SemanticGraph::Implies& i)
- {
- SemanticGraph::Schema& s (i.schema ());
-
- if (!s.context ().count ("cxx-parser-name-processor-seen"))
- {
- s.context ().set ("cxx-parser-name-processor-seen", true);
- Traversal::Implies::traverse (i);
- }
- }
- };
-
- void
- process_impl (options const& ops,
- SemanticGraph::Schema& tu,
- SemanticGraph::Path const& file,
- StringLiteralMap const& map)
- {
- Context ctx (ops, tu, file, &map);
-
- if (tu.names_begin ()->named ().name () ==
- L"http://www.w3.org/2001/XMLSchema")
- {
- // XML Schema namespace.
- //
- Traversal::Schema schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- FundType fund_type (ctx);
-
- schema >> schema_names >> ns >> ns_names >> fund_type;
-
- schema.dispatch (tu);
- }
- else
- {
-
- // Pass one - assign names to fundamental types.
- //
- {
- Traversal::Schema schema;
- Implies implies;
- Traversal::Schema xs_schema;
-
- schema >> implies >> xs_schema;
-
- Traversal::Names xs_schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- FundType fund_type (ctx);
-
- xs_schema >> xs_schema_names >> ns >> ns_names >> fund_type;
-
- schema.dispatch (tu);
- }
-
- // Pass two - assign names to global types. This pass cannot
- // be combined with pass three because of possible recursive
- // schema inclusions. Also note that we check first if this
- // schema has already been processed which may happen in the
- // file-per-type compilation mode.
- //
- if (!tu.context ().count ("cxx-parser-name-processor-seen"))
- {
- Traversal::Schema schema;
- Uses uses;
-
- schema >> uses >> schema;
-
- Traversal::Names schema_names;
- Namespace ns (ctx);
-
- schema >> schema_names >> ns;
-
- // Some twisted schemas do recusive self-inclusion.
- //
- tu.context ().set ("cxx-parser-name-processor-seen", true);
-
- schema.dispatch (tu);
- }
-
- // Pass three - assign names inside complex types. Here we don't
- // need to go into included/imported schemas.
- //
- {
- Traversal::Schema schema;
- Sources sources;
-
- schema >> sources >> schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
-
- schema >> schema_names >> ns >> ns_names;
-
- Complex complex (ctx);
-
- ns_names >> complex;
-
- schema.dispatch (tu);
- }
- }
- }
- }
-
- void NameProcessor::
- process (options const& ops,
- SemanticGraph::Schema& tu,
- SemanticGraph::Path const& file,
- StringLiteralMap const& map)
- {
- process_impl (ops, tu, file, map);
- }
- }
-}
diff --git a/xsd/cxx/parser/name-processor.hxx b/xsd/cxx/parser/name-processor.hxx
deleted file mode 100644
index f7f988f..0000000
--- a/xsd/cxx/parser/name-processor.hxx
+++ /dev/null
@@ -1,30 +0,0 @@
-// file : xsd/cxx/parser/name-processor.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_NAME_PROCESSOR_HXX
-#define CXX_PARSER_NAME_PROCESSOR_HXX
-
-#include <xsd-frontend/semantic-graph.hxx>
-
-#include <types.hxx>
-
-#include <cxx/elements.hxx>
-#include <cxx/parser/options.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- class NameProcessor
- {
- public:
- void
- process (options const&,
- XSDFrontend::SemanticGraph::Schema&,
- XSDFrontend::SemanticGraph::Path const& file,
- StringLiteralMap const& map);
- };
- }
-}
-
-#endif // CXX_PARSER_NAME_PROCESSOR_HXX
diff --git a/xsd/cxx/parser/options.cli b/xsd/cxx/parser/options.cli
deleted file mode 100644
index 11312ed..0000000
--- a/xsd/cxx/parser/options.cli
+++ /dev/null
@@ -1,147 +0,0 @@
-// file : xsd/cxx/parser/options.cli
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-include <cstddef>; // std::size_t
-
-include <types.hxx>; // NarrowString, NarrowStrings
-
-include <cxx/options.cli>;
-
-namespace CXX
-{
- namespace Parser
- {
- class options: CXX::options
- {
- NarrowStrings --type-map
- {
- "<mapfile>",
- "Read XML Schema to C++ type mapping information from <mapfile>.
- Repeat this option to specify several type maps. Type maps are
- considered in order of appearance and the first match is used. By
- default all user-defined types are mapped to \cb{void}. See the
- TYPE MAP section below for more information."
- };
-
- NarrowString --xml-parser = "xerces"
- {
- "<parser>",
- "Use <parser> as the underlying XML parser. Valid values are
- \cb{xerces} for Xerces-C++ (default) and \cb{expat} for Expat."
- };
-
- // Features.
- //
- bool --generate-validation
- {
- "Generate validation code. The validation code (\"perfect parser\")
- ensures that instance documents conform to the schema. Validation
- code is generated by default when the selected underlying XML parser
- is non-validating (\cb{expat})."
- };
-
- bool --suppress-validation
- {
- "Suppress the generation of validation code. Validation is suppressed
- by default when the selected underlying XML parser is validating
- (\cb{xerces})."
- };
-
- bool --generate-polymorphic
- {
- "Generate polymorphism-aware code. Specify this option if you use
- substitution groups or \cb{xsi:type}."
- };
-
- bool --generate-noop-impl
- {
- "Generate a sample parser implementation that does nothing (no
- operation). The sample implementation can then be filled with
- the application-specific code. For an input file in the form
- \cb{name.xsd} this option triggers the generation of two
- additional C++ files in the form: \cb{name-pimpl.hxx} (parser
- implementation header file) and \cb{name-pimpl.cxx} (parser
- implementation source file)."
- };
-
- bool --generate-print-impl
- {
- "Generate a sample parser implementation that prints the XML data
- to \c{STDOUT}. For an input file in the form \cb{name.xsd} this
- option triggers the generation of two additional C++ files in the
- form: \cb{name-pimpl.hxx} (parser implementation header file) and
- \cb{name-pimpl.cxx} (parser implementation source file)."
- };
-
- bool --generate-test-driver
- {
- "Generate a test driver for the sample parser implementation. For an
- input file in the form \cb{name.xsd} this option triggers the
- generation of an additional C++ file in the form
- \cb{name-driver.cxx}."
- };
-
- bool --force-overwrite
- {
- "Force overwriting of the existing implementation and test driver
- files. Use this option only if you do not mind loosing the changes
- you have made in the sample implementation or test driver files."
- };
-
- // Root element.
- //
- bool --root-element-first
- {
- "Indicate that the first global element is the document root. This
- information is used to generate the test driver for the sample
- implementation."
- };
-
- bool --root-element-last
- {
- "Indicate that the last global element is the document root. This
- information is used to generate the test driver for the sample
- implementation."
- };
-
- NarrowString --root-element
- {
- "<element>",
- "Indicate that <element> is the document root. This information is
- used to generate the test driver for the sample implementation."
- };
-
- // Suffixes.
- //
- NarrowString --skel-type-suffix = "_pskel"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{_pskel} to
- construct the names of the generated parser skeletons."
- };
-
- NarrowString --skel-file-suffix = "-pskel"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{-pskel} to
- construct the names of the generated parser skeleton files."
- };
-
- NarrowString --impl-type-suffix = "_pimpl"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{_pimpl} to
- construct the names of the parser implementations for the built-in
- XML Schema types as well as sample parser implementations."
- };
-
- NarrowString --impl-file-suffix = "-pimpl"
- {
- "<suffix>",
- "Use the provided <suffix> instead of the default \cb{-pimpl} to
- construct the names of the generated sample parser implementation
- files."
- };
- };
- }
-}
diff --git a/xsd/cxx/parser/parser-forward.cxx b/xsd/cxx/parser/parser-forward.cxx
deleted file mode 100644
index 09a055b..0000000
--- a/xsd/cxx/parser/parser-forward.cxx
+++ /dev/null
@@ -1,110 +0,0 @@
-// file : xsd/cxx/parser/parser-forward.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/parser-forward.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Enumeration: Traversal::Enumeration, Context
- {
- Enumeration (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- os << "class " << ename (e) << ";";
- }
- };
-
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- os << "class " << ename (l) << ";";
- }
- };
-
- //
- //
- struct Union: Traversal::Union, Context
- {
- Union (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& u)
- {
- os << "class " << ename (u) << ";";
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& c)
- {
- os << "class " << ename (c) << ";";
- }
- };
- }
-
- void
- generate_parser_forward (Context& ctx)
- {
- ctx.os << "// Forward declarations" << endl
- << "//" << endl;
-
- Traversal::Schema schema;
-
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Union union_ (ctx);
- Complex complex (ctx);
- Enumeration enumeration (ctx);
-
- names >> list;
- names >> union_;
- names >> complex;
- names >> enumeration;
-
- schema.dispatch (ctx.schema_root);
-
- ctx.os << endl;
- }
- }
-}
diff --git a/xsd/cxx/parser/parser-forward.hxx b/xsd/cxx/parser/parser-forward.hxx
deleted file mode 100644
index 7796532..0000000
--- a/xsd/cxx/parser/parser-forward.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/parser-forward.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_PARSER_FORWARD_HXX
-#define CXX_PARSER_PARSER_FORWARD_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_parser_forward (Context&);
- }
-}
-
-#endif // CXX_PARSER_PARSER_FORWARD_HXX
diff --git a/xsd/cxx/parser/parser-header.cxx b/xsd/cxx/parser/parser-header.cxx
deleted file mode 100644
index ad7767a..0000000
--- a/xsd/cxx/parser/parser-header.cxx
+++ /dev/null
@@ -1,1440 +0,0 @@
-// file : xsd/cxx/parser/parser-header.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <set>
-
-#include <cxx/parser/parser-header.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Enumeration: Traversal::Enumeration, Context
- {
- Enumeration (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- String const& name (ename (e));
- SemanticGraph::Type& base (e.inherits ().base ());
-
- os << "class " << type_exp << name << ": public virtual " <<
- fq_name (base)
- << "{"
- << "public:" << endl
- << "// Parser callbacks. Override them in your " <<
- "implementation." << endl
- << "//" << endl;
-
- os << "// virtual void" << endl
- << "// pre ();" << endl
- << endl;
-
- String const& ret (ret_type (e));
-
- bool same (ret == ret_type (base));
-
- os << "virtual " << ret << endl
- << post_name (e) << " ()" <<
- (same || ret == L"void" ? ";" : " = 0;");
-
- if (polymorphic)
- {
- os << endl
- << "public:" << endl
- << "static const " << char_type << "*" << endl
- << "_static_type ();"
- << endl
- << "virtual const " << char_type << "*" << endl
- << "_dynamic_type () const;";
- }
-
- os << "};";
- }
- };
-
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- String const& name (ename (l));
- SemanticGraph::Type& t (l.argumented ().type ());
-
- String item (unclash (name, "item"));
-
- os << "class " << type_exp << name << ": public " << list_base
- << "{"
- << "public:" << endl
- << "// Parser callbacks. Override them in your " <<
- "implementation." << endl
- << "//" << endl;
-
- // pre
- //
- os << "// virtual void" << endl
- << "// pre ();" << endl
- << endl;
-
- // item
- //
- String const& arg (arg_type (t));
-
- os << "virtual void" << endl
- << item;
-
- if (arg == L"void")
- os << " ();";
- else
- os << " (" << arg << ");";
-
- os << endl;
-
- // post
- //
- String const& ret (ret_type (l));
-
- os << "virtual " << ret << endl
- << post_name (l) << " ()" << (ret == L"void" ? ";" : " = 0;")
- << endl;
-
- //
- //
- os << "// Parser construction API." << endl
- << "//" << endl;
-
- // item_parser
- //
- os << "void" << endl
- << unclash (name, "item_parser") << " (" << fq_name (t) << "&);"
- << endl;
-
- // parsers
- //
- os << "void" << endl
- << "parsers (" << fq_name (t) << "& /* item */);"
- << endl;
-
- // c-tor
- //
- os << "// Constructor." << endl
- << "//" << endl
- << name << " ();"
- << endl;
-
-
- if (polymorphic)
- {
- os << "public:" << endl
- << "static const " << char_type << "*" << endl
- << "_static_type ();"
- << endl
- << "virtual const " << char_type << "*" << endl
- << "_dynamic_type () const;"
- << endl;
- }
-
- //
- //
- os << "// Implementation." << endl
- << "//" << endl
- << "protected:" << endl;
-
- os << "virtual void" << endl
- << "_xsd_parse_item (const " << string_type << "&);"
- << endl;
-
- os << "protected:" << endl
- << fq_name (t) << "* _xsd_" << item << "_;"
- << "};";
- }
- };
-
- struct Union: Traversal::Union, Context
- {
- Union (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& u)
- {
- String const& name (ename (u));
-
- os << "class " << type_exp << name << ": public " << simple_base
- << "{"
- << "public:" << endl
- << "// Parser callbacks. Override them in your " <<
- "implementation." << endl
- << "//" << endl;
-
- os << "// virtual void" << endl
- << "// pre ();" << endl
- << "//" << endl
- << "// virtual void" << endl
- << "// _characters (const " << string_type << "&);" << endl
- << endl;
-
- String const& ret (ret_type (u));
-
- os << "virtual " << ret << endl
- << post_name (u) << " ()" << (ret == L"void" ? ";" : " = 0;");
-
- if (polymorphic)
- {
- os << endl
- << "public:" << endl
- << "static const " << char_type << "*" << endl
- << "_static_type ();"
- << endl
- << "virtual const " << char_type << "*" << endl
- << "_dynamic_type () const;";
- }
-
- os << "};";
- }
- };
-
-
- //
- //
- struct ParserCallback: Traversal::Member, Context
- {
- ParserCallback (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m)) return;
-
- String const& arg (arg_type (m.type ()));
-
- os << "virtual void" << endl
- << ename (m);
-
- if (arg == L"void")
- os << " ();";
- else
- os << " (" << arg << ");";
-
- os << endl;
- }
- };
-
-
- //
- //
- struct ParserModifier: Traversal::Member, Context
- {
- ParserModifier (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- os << "void" << endl
- << eparser (m) << " (" << fq_name (m.type ()) << "&);"
- << endl;
-
- if (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !anonymous (m.type ()))
- {
- os << "void" << endl
- << eparser (m) << " (const " << parser_map << "&);"
- << endl;
- }
- }
- };
-
- //
- //
- struct ParserMember: Traversal::Member, Context
- {
- ParserMember (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- String type (fq_name (m.type ()));
-
- os << type << "* " << emember (m) << ";";
-
- if (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !anonymous (m.type ()))
- {
- os << "const " << parser_map << "* " << emember_map (m) << ";"
- << endl;
- }
- }
- };
-
- //
- //
- struct Particle: Traversal::All,
- Traversal::Choice,
- Traversal::Sequence,
- Context
- {
- Particle (Context& c)
- : Context (c)
- {
- *this >> contains_particle_ >> *this;
- }
-
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- if (!a.context().count ("comp-number"))
- return;
-
- size_t state_count (a.context().get<size_t> ("state-count"));
-
- os << "void" << endl
- << "all_0 (unsigned long& state," << endl
- << "unsigned char* count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start);"
- << endl
- << "unsigned char v_all_first_[" << state_count << "UL];"
- << "::xsd::cxx::parser::validating::all_stack v_all_count_;"
- << endl;
- }
-
- virtual void
- traverse (SemanticGraph::Choice& c)
- {
- if (!c.context().count ("comp-number"))
- return;
-
- size_t n (c.context ().get<size_t> ("comp-number"));
-
- os << "void" << endl
- << "choice_" << n << " (unsigned long& state," << endl
- << "unsigned long& count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start);"
- << endl;
-
- Traversal::Choice::traverse (c);
- }
-
- virtual void
- traverse (SemanticGraph::Sequence& s)
- {
- if (!s.context().count ("comp-number"))
- return;
-
- size_t n (s.context ().get<size_t> ("comp-number"));
-
- os << "void" << endl
- << "sequence_" << n << " (unsigned long& state," << endl
- << "unsigned long& count," << endl
- << "const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t," << endl
- << "bool start);"
- << endl;
-
- Traversal::Sequence::traverse (s);
- }
-
- private:
- Traversal::ContainsParticle contains_particle_;
- };
-
-
- //
- //
- struct AttributeValidationState: Traversal::Attribute, Context
- {
- AttributeValidationState (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- if (!a.optional_p ())
- {
- os << "bool " << ename (a) << ";";
- }
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c),
- parser_callback_ (c),
- parser_member_ (c),
- parser_modifier_ (c),
- attribute_validation_state_ (c)
- {
- names_parser_callback_ >> parser_callback_;
- names_parser_member_ >> parser_member_;
- names_parser_modifier_ >> parser_modifier_;
- names_attribute_validation_state_ >> attribute_validation_state_;
- }
-
- virtual void
- traverse (Type& c)
- {
- String const& name (ename (c));
-
- // In case of an inheritance-by-restriction, we don't need to
- // generate parser callbacks, etc. since they are the same as in
- // the base. We only need the parsing/validation code.
- //
- bool restriction (restriction_p (c));
-
- bool he (has<Traversal::Element> (c));
- bool ha (has<Traversal::Attribute> (c));
-
- bool hae (has_particle<Traversal::Any> (c));
- bool haa (has<Traversal::AnyAttribute> (c));
-
- bool hra (false); // Has required attribute.
- if (ha)
- {
- RequiredAttributeTest test (hra);
- Traversal::Names names_test (test);
- names (c, names_test);
- }
-
-
- //
- //
- os << "class " << type_exp << name << ": public ";
-
- if (c.inherits_p ())
- os << "virtual " << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
- os << "{"
- << "public:" << endl
- << "// Parser callbacks. Override them in your " <<
- "implementation." << endl
- << "//" << endl;
-
- os << "// virtual void" << endl
- << "// pre ();" << endl
- << endl;
-
-
- if (!restriction && (ha || he))
- {
- names (c, names_parser_callback_);
- }
-
- String const& ret (ret_type (c));
-
- bool same (c.inherits_p () &&
- ret == ret_type (c.inherits ().base ()));
-
- os << "virtual " << ret << endl
- << post_name (c) << " ()" <<
- (same || ret == L"void" ? ";" : " = 0;")
- << endl;
-
- //
- //
- if (!restriction && (he || ha))
- {
- os << "// Parser construction API." << endl
- << "//" << endl;
-
- names (c, names_parser_modifier_);
-
- os << "void" << endl
- << "parsers (";
-
- {
- ParserParamDecl decl (*this, false);
- decl.traverse (c);
- }
-
- os << ");"
- << endl;
- }
-
- // Default c-tor.
- //
- if ((!restriction && (he || ha)) ||
- (validation && (he || hae || hra)))
- {
- os << "// Constructor." << endl
- << "//" << endl
- << name << " ();"
- << endl;
- }
-
- if (polymorphic)
- {
- os << "public:" << endl
- << "static const " << char_type << "*" << endl
- << "_static_type ();"
- << endl
- << "virtual const " << char_type << "*" << endl
- << "_dynamic_type () const;"
- << endl;
- }
-
- // Implementation.
- //
- if (he || ha || (validation && (hae || haa)))
- {
- os << "// Implementation." << endl
- << "//" << endl
- << "protected:" << endl;
- }
-
- // element
- //
- if (he || (validation && hae))
- {
- // _start_element_impl
- //
- os << "virtual bool" << endl
- << "_start_element_impl (const " << string_type << "&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "*);"
- << endl;
-
- // end_element
- //
- os << "virtual bool" << endl
- << "_end_element_impl (const " << string_type << "&," << endl
- << "const " << string_type << "&);"
- << endl;
- }
-
- // attribute
- //
- if (validation)
- {
- if (ha)
- {
- os << "virtual bool" << endl
- << "_attribute_impl_phase_one (const " << string_type <<
- "&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "&);" << endl
- << endl;
- }
-
- if (haa)
- {
- os << "virtual bool" << endl
- << "_attribute_impl_phase_two (const " << string_type <<
- "&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "&);"
- << endl;
- }
- }
- else
- {
- if (ha)
- {
- os << "virtual bool" << endl
- << "_attribute_impl (const " << string_type << "&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "&);"
- << endl;
- }
- }
-
- // characters
- //
- if (validation && c.mixed_p ())
- {
- os << "virtual bool" << endl
- << "_characters_impl (const " << string_type << "&);"
- << endl;
- }
-
- if (!restriction && (he || ha))
- {
- os << "protected:" << endl;
- names (c, names_parser_member_);
- os << endl;
- }
-
- if (validation && (he || hae))
- {
- size_t depth (c.context ().get<size_t> ("depth"));
-
- os << "protected:" << endl;
-
- os << "struct v_state_descr_"
- << "{"
- << "void (" << fq_name (c) << "::*func) (" << endl
- << "unsigned long&," << endl
- << "unsigned long&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "&," << endl
- << "const " << string_type << "*," << endl
- << "bool);"
- << "unsigned long state;"
- << "unsigned long count;"
- << "};";
-
- // Allocate one extra slot for the special state.
- //
- os << "struct v_state_"
- << "{"
- << "v_state_descr_ data[" << depth + 1 << "UL];"
- << "unsigned long size;"
- << "};";
-
- os << "v_state_ v_state_first_;"
- << "::xsd::cxx::parser::pod_stack v_state_stack_;"
- << endl;
-
- os << "virtual void" << endl
- << "_pre_e_validate ();"
- << endl;
-
- os << "virtual void" << endl
- << "_post_e_validate ();"
- << endl;
-
- Particle t (*this);
- t.dispatch (c.contains_compositor ().compositor ());
- }
-
- if (validation && hra)
- {
- os << "protected:" << endl;
-
- os << "struct v_state_attr_"
- << "{";
-
- names (c, names_attribute_validation_state_);
-
- os << "};";
-
- os << "v_state_attr_ v_state_attr_first_;"
- << "::xsd::cxx::parser::pod_stack v_state_attr_stack_;"
- << endl;
-
- os << "virtual void" << endl
- << "_pre_a_validate ();"
- << endl;
-
- os << "virtual void" << endl
- << "_post_a_validate ();"
- << endl;
- }
-
- os << "};";
- }
-
- private:
- //
- //
- ParserCallback parser_callback_;
- Traversal::Names names_parser_callback_;
-
- //
- //
- ParserMember parser_member_;
- Traversal::Names names_parser_member_;
-
- //
- //
- ParserModifier parser_modifier_;
- Traversal::Names names_parser_modifier_;
-
- //
- //
- AttributeValidationState attribute_validation_state_;
- Traversal::Names names_attribute_validation_state_;
- };
-
- struct FundType : Context,
-
- Traversal::AnyType,
- Traversal::AnySimpleType,
-
- Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Traversal::Fundamental::Entity,
- Traversal::Fundamental::Entities
- {
- FundType (Context& c)
- : Context (c), xs_ns_ (xs_ns_name ())
- {
- impl_ns_ = "::xsd::cxx::parser::";
- impl_ns_ += (validation ? L"validating" : L"non_validating");
-
- if (char_type == L"char")
- string_type_ = L"::std::string";
- else if (char_type == L"wchar_t")
- string_type_ = L"::std::wstring";
- else
- string_type_ = L"::std::basic_string< " + char_type + L" >";
- }
-
- // anyType & anySimpleType.
- //
- virtual void
- traverse (SemanticGraph::AnyType& t)
- {
- gen_typedef (t, "void", "any_type_pskel", "any_type_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::AnySimpleType& t)
- {
- gen_typedef (t, "void",
- "any_simple_type_pskel", "any_simple_type_pimpl");
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- gen_typedef (t, "bool", "boolean_pskel", "boolean_pimpl");
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- gen_typedef (t, "signed char", "byte_pskel", "byte_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- gen_typedef (t, "unsigned char",
- "unsigned_byte_pskel", "unsigned_byte_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- gen_typedef (t, "short", "short_pskel", "short_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- gen_typedef (t, "unsigned short",
- "unsigned_short_pskel", "unsigned_short_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- gen_typedef (t, "int", "int_pskel", "int_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- gen_typedef (t, "unsigned int",
- "unsigned_int_pskel", "unsigned_int_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- gen_typedef (t, "long long", "long_pskel", "long_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- gen_typedef (t, "unsigned long long",
- "unsigned_long_pskel", "unsigned_long_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- gen_typedef (t, "long long", "integer_pskel", "integer_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- gen_typedef (t, "long long",
- "negative_integer_pskel", "negative_integer_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- gen_typedef (t, "long long",
- "non_positive_integer_pskel",
- "non_positive_integer_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- gen_typedef (t, "unsigned long long",
- "positive_integer_pskel", "positive_integer_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- gen_typedef (t, "unsigned long long",
- "non_negative_integer_pskel",
- "non_negative_integer_pimpl");
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- gen_typedef (t, "float", "float_pskel", "float_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- gen_typedef (t, "double", "double_pskel", "double_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- gen_typedef (t, "double", "decimal_pskel", "decimal_pimpl");
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- gen_typedef (t, string_type_, "string_pskel", "string_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- gen_typedef (t, string_type_,
- "normalized_string_pskel", "normalized_string_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- gen_typedef (t, string_type_, "token_pskel", "token_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- nmtoken_ = gen_typedef (t, string_type_,
- "nmtoken_pskel", "nmtoken_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens& t)
- {
- // NMTOKENS uses NMTOKEN implementation to parse individual items.
- // As a result, we don't generate NMTOKENS if we didn't generate
- // NMTOKEN. Here we assume NMTOKEN is handled before NMTOKENS.
- //
- if(nmtoken_)
- gen_typedef (t, xs_ns_ + L"::string_sequence",
- "nmtokens_pskel", "nmtokens_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- gen_typedef (t, string_type_, "name_pskel", "name_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- gen_typedef (t, string_type_, "ncname_pskel", "ncname_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language& t)
- {
- gen_typedef (t, string_type_, "language_pskel", "language_pimpl");
- }
-
- // Qualified name.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- gen_typedef (t, xs_ns_ + L"::qname", "qname_pskel", "qname_pimpl");
- }
-
- // ID/IDREF.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- gen_typedef (t, string_type_, "id_pskel", "id_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- idref_ = gen_typedef (t, string_type_, "idref_pskel", "idref_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs& t)
- {
- // IDREFS uses IDREF implementation to parse individual items.
- // As a result, we don't generate IDREFS if we didn't generate
- // IDREF. Here we assume IDREF is handled before IDREFS.
- //
- if (idref_)
- gen_typedef (t, xs_ns_ + L"::string_sequence",
- "idrefs_pskel", "idrefs_pimpl");
- }
-
- // URI.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI& t)
- {
- gen_typedef (t, string_type_, "uri_pskel", "uri_pimpl");
- }
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- String buffer (auto_ptr + L"< " + xs_ns_ + L"::buffer >");
- gen_typedef (t, buffer,
- "base64_binary_pskel", "base64_binary_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- String buffer (auto_ptr + L"< " + xs_ns_ + L"::buffer >");
- gen_typedef (t, buffer, "hex_binary_pskel", "hex_binary_pimpl");
- }
-
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- gen_typedef (t, xs_ns_ + L"::date", "date_pskel", "date_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- gen_typedef (t, xs_ns_ + L"::date_time",
- "date_time_pskel", "date_time_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- gen_typedef (t, xs_ns_ + L"::duration",
- "duration_pskel", "duration_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- gen_typedef (t, xs_ns_ + L"::gday", "gday_pskel", "gday_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- gen_typedef (t, xs_ns_ + L"::gmonth",
- "gmonth_pskel", "gmonth_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- gen_typedef (t, xs_ns_ + L"::gmonth_day",
- "gmonth_day_pskel", "gmonth_day_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- gen_typedef (t, xs_ns_ + L"::gyear", "gyear_pskel", "gyear_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- gen_typedef (t, xs_ns_ + L"::gyear_month",
- "gyear_month_pskel", "gyear_month_pimpl");
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- gen_typedef (t, xs_ns_ + L"::time", "time_pskel", "time_pimpl");
- }
-
- // Entity.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Entity&)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities&)
- {
- }
-
- private:
- bool
- gen_typedef (SemanticGraph::Type& t,
- String const& type,
- String const& pskel,
- String const& pimpl)
- {
- if (ret_type (t) == type)
- {
- os << "typedef " << impl_ns_ << "::" << pskel << "< " <<
- char_type << " > " << ename (t) << ";";
-
- String const& pimpl_name (t.context ().get<String> ("impl"));
-
- os << "typedef " << impl_ns_ << "::" << pimpl << "< " <<
- char_type << " > " << pimpl_name << ";"
- << endl;
-
- return true;
- }
-
- return false;
- }
-
- String xs_ns_;
- String impl_ns_;
- String string_type_;
-
- bool idref_;
- bool nmtoken_;
- };
-
- struct FundNamespace: Namespace, Context
- {
- FundNamespace (Context& c)
- : Namespace (c), Context (c)
- {
- }
-
- void
- traverse (Type& ns)
- {
- pre (ns);
-
- String impl ("::xsd::cxx::parser::");
- impl += (validation ? L"validating" : L"non_validating");
-
- String const c (char_type);
-
- os << "// Built-in XML Schema types mapping." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::string_sequence< " << c <<
- " > string_sequence;"
- << "typedef ::xsd::cxx::parser::qname< " << c << " > qname;"
- << "typedef ::xsd::cxx::parser::buffer buffer;"
- << "typedef ::xsd::cxx::parser::time_zone time_zone;"
- << "typedef ::xsd::cxx::parser::gday gday;"
- << "typedef ::xsd::cxx::parser::gmonth gmonth;"
- << "typedef ::xsd::cxx::parser::gyear gyear;"
- << "typedef ::xsd::cxx::parser::gmonth_day gmonth_day;"
- << "typedef ::xsd::cxx::parser::gyear_month gyear_month;"
- << "typedef ::xsd::cxx::parser::date date;"
- << "typedef ::xsd::cxx::parser::time time;"
- << "typedef ::xsd::cxx::parser::date_time date_time;"
- << "typedef ::xsd::cxx::parser::duration duration;"
- << endl;
-
- os << "// Base parser skeletons." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::parser_base< " << c <<
- " > parser_base;"
- << "typedef " << impl << "::empty_content< " << c <<
- " > empty_content;"
- << "typedef " << impl << "::simple_content< " << c <<
- " > simple_content;"
- << "typedef " << impl << "::complex_content< " << c <<
- " > complex_content;"
- << "typedef " << impl << "::list_base< " << c << " > list_base;"
- << endl;
-
- if (polymorphic)
- {
- os << "// Parser map interface and default implementation." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::parser_map< " << c <<
- " > parser_map;"
- << "typedef ::xsd::cxx::parser::parser_map_impl< " << c <<
- " > parser_map_impl;"
- << endl;
- }
-
- os << "// Parser skeletons and implementations for the XML Schema" << endl
- << "// built-in types." << endl
- << "//" << endl;
-
- names (ns);
-
- os << "// Exceptions. See libxsd/xsd/cxx/parser/exceptions.hxx " <<
- "for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::exception< " <<
- char_type << " > exception;"
- << endl
- << "// Parsing diagnostics." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::severity severity;"
- << "typedef ::xsd::cxx::parser::error< " << c << " > error;"
- << "typedef ::xsd::cxx::parser::diagnostics< " << c <<
- " > diagnostics;"
- << "typedef ::xsd::cxx::parser::parsing< " << c << " > parsing;"
- << endl;
-
- os << "// Error handler. See " <<
- "libxsd/xsd/cxx/xml/error-handler.hxx for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::xml::error_handler< " << c <<
- " > error_handler;"
- << endl;
-
- os << "// Read-only string." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::ro_string< " << c << " > ro_string;"
- << endl;
-
- if (xml_parser == L"xerces")
- {
- os << "// Parsing flags. See " <<
- "libxsd/xsd/cxx/parser/xerces/elements.hxx" << endl
- << "// for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::xerces::flags flags;"
- << endl;
-
- os << "// Parsing properties. See " <<
- "libxsd/xsd/cxx/parser/xerces/elements.hxx" << endl
- << "// for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::xerces::properties< " << c <<
- " > properties;"
- << endl;
-
- os << "// Document type. See " <<
- "libxsd/xsd/cxx/parser/xerces/elements.hxx" << endl
- << "// for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::xerces::document< " << c <<
- " > document;"
- << endl;
-
- }
- else if (xml_parser == L"expat")
- {
- os << "// Document type. See " <<
- "libxsd/xsd/cxx/parser/expat/elements.hxx" << endl
- << "// for details." << endl
- << "//" << endl
- << "typedef ::xsd::cxx::parser::expat::document< " << c <<
- " > document;"
- << endl;
- }
-
- post (ns);
- }
- };
- }
-
- void
- generate_parser_header (Context& ctx, bool generate_xml_schema)
- {
- String c (ctx.char_type);
-
- //
- //
- if (c == L"char")
- {
- ctx.os << "#ifndef XSD_USE_CHAR" << endl
- << "#define XSD_USE_CHAR" << endl
- << "#endif" << endl
- << endl;
-
- ctx.os << "#ifndef XSD_CXX_PARSER_USE_CHAR" << endl
- << "#define XSD_CXX_PARSER_USE_CHAR" << endl
- << "#endif" << endl
- << endl;
- }
- else if (c == L"wchar_t")
- {
- ctx.os << "#ifndef XSD_USE_WCHAR" << endl
- << "#define XSD_USE_WCHAR" << endl
- << "#endif" << endl
- << endl;
-
- ctx.os << "#ifndef XSD_CXX_PARSER_USE_WCHAR" << endl
- << "#define XSD_CXX_PARSER_USE_WCHAR" << endl
- << "#endif" << endl
- << endl;
- }
-
- //
- //
- NarrowString extern_xml_schema;
-
- if (!generate_xml_schema)
- extern_xml_schema = ctx.options.extern_xml_schema ();
-
- if (extern_xml_schema)
- {
- String name (ctx.hxx_expr->replace (extern_xml_schema));
-
- ctx.os << "#include " << ctx.process_include_path (name) << endl
- << endl;
-
- // Generate includes that came from the type map.
- //
- if (ctx.schema_root.context ().count ("includes"))
- {
- typedef set<String> Includes;
-
- Includes const& is (
- ctx.schema_root.context ().get<Includes> ("includes"));
-
- for (Includes::const_reverse_iterator i (is.rbegin ());
- i != is.rend (); ++i)
- {
- ctx.os << "#include " << *i << endl;
- }
-
- ctx.os << endl;
- }
- }
- else
- {
- if (ctx.char_type == L"char" &&
- ctx.xml_parser == L"xerces" &&
- ctx.char_encoding != L"custom")
- {
- ctx.os << "#include <xsd/cxx/xml/char-" << ctx.char_encoding << ".hxx>" << endl;
- }
-
- ctx.os << "#include <xsd/cxx/xml/error-handler.hxx>" << endl
- << "#include <xsd/cxx/parser/exceptions.hxx>" << endl
- << "#include <xsd/cxx/parser/elements.hxx>" << endl
- << "#include <xsd/cxx/parser/xml-schema.hxx>" << endl;
-
- if (ctx.polymorphic)
- ctx.os << "#include <xsd/cxx/parser/map.hxx>" << endl;
-
- if (ctx.validation)
- ctx.os << "#include <xsd/cxx/parser/validating/parser.hxx>" << endl
- << "#include <xsd/cxx/parser/validating/exceptions.hxx>" << endl
- << "#include <xsd/cxx/parser/validating/xml-schema-pskel.hxx>" << endl
- << "#include <xsd/cxx/parser/validating/xml-schema-pimpl.hxx>" << endl;
- else
- ctx.os << "#include <xsd/cxx/parser/non-validating/parser.hxx>" << endl
- << "#include <xsd/cxx/parser/non-validating/xml-schema-pskel.hxx>" << endl
- << "#include <xsd/cxx/parser/non-validating/xml-schema-pimpl.hxx>" << endl;
-
- ctx.os << "#include <xsd/cxx/parser/" << ctx.xml_parser <<
- "/elements.hxx>" << endl
- << endl;
-
- // Generate includes that came from the type map.
- //
- if (ctx.schema_root.context ().count ("includes"))
- {
- typedef set<String> Includes;
-
- Includes const& is (
- ctx.schema_root.context ().get<Includes> ("includes"));
-
- for (Includes::const_reverse_iterator i (is.rbegin ());
- i != is.rend (); ++i)
- {
- ctx.os << "#include " << *i << endl;
- }
-
- ctx.os << endl;
- }
-
- // Generate fundamental types.
- //
- if (generate_xml_schema)
- {
- Traversal::Schema schema;
- Traversal::Names names;
- FundNamespace ns (ctx);
-
- schema >> names >> ns;
-
- Traversal::Names ns_names;
- FundType type (ctx);
-
- ns >> ns_names >> type;
-
- schema.dispatch (ctx.schema_root);
- }
- else
- {
- Traversal::Schema schema, xsd;
- Traversal::Implies implies;
- Traversal::Names names;
- FundNamespace ns (ctx);
-
- schema >> implies >> xsd >> names >> ns;
-
- Traversal::Names ns_names;
- FundType type (ctx);
-
- ns >> ns_names >> type;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-
- // Generate user type mapping.
- //
- if (!generate_xml_schema)
- {
- Traversal::Schema schema;
-
- Sources sources;
- Includes includes (ctx, Includes::header);
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> includes;
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Union union_ (ctx);
- Complex complex (ctx);
- Enumeration enumeration (ctx);
-
- names >> list;
- names >> union_;
- names >> complex;
- names >> enumeration;
-
- schema.dispatch (ctx.schema_root);
- }
- }
- }
-}
diff --git a/xsd/cxx/parser/parser-header.hxx b/xsd/cxx/parser/parser-header.hxx
deleted file mode 100644
index 2656fff..0000000
--- a/xsd/cxx/parser/parser-header.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/parser-header.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_PARSER_HEADER_HXX
-#define CXX_PARSER_PARSER_HEADER_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_parser_header (Context&, bool generate_xml_schema);
- }
-}
-
-#endif // CXX_PARSER_PARSER_HEADER_HXX
diff --git a/xsd/cxx/parser/parser-inline.cxx b/xsd/cxx/parser/parser-inline.cxx
deleted file mode 100644
index fb7558e..0000000
--- a/xsd/cxx/parser/parser-inline.cxx
+++ /dev/null
@@ -1,399 +0,0 @@
-// file : xsd/cxx/parser/parser-inline.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/parser-inline.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- String const& name (ename (l));
- SemanticGraph::Type& t (l.argumented ().type ());
-
- String item (unclash (name, "item"));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // item_parser
- //
- os << inl
- << "void " << name << "::" << endl
- << unclash (name, "item_parser") << " (" <<
- fq_name (t) << "& " << item << ")"
- << "{"
- << "this->_xsd_" << item << "_ = &" << item << ";"
- << "}";
-
- // parsers
- //
- os << inl
- << "void " << name << "::" << endl
- << "parsers (" << fq_name (t) << "& " << item << ")"
- << "{"
- << "this->_xsd_" << item << "_ = &" << item << ";"
- << "}";
-
- // c-tor
- //
- os << inl
- << name << "::" << endl
- << name << " ()" << endl
- << ": _xsd_" << item << "_ (0)"
- << "{"
- << "}";
- }
- };
-
-
- //
- //
- struct ParserModifier: Traversal::Member, Context
- {
- ParserModifier (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- String const& scope (ename (m.scope ()));
- String const& parser (eparser (m));
-
- bool poly (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !anonymous (m.type ()));
-
- os << inl
- << "void " << scope << "::" << endl
- << parser << " (" << fq_name (m.type ()) << "& p)"
- << "{"
- << "this->" << emember (m) << " = &p;"
- << "}";
-
- if (poly)
- {
- os << inl
- << "void " << scope << "::" << endl
- << parser << " (const " << parser_map << "& m)"
- << "{"
- << "this->" << emember_map (m) << " = &m;"
- << "}";
- }
- }
- };
-
-
- //
- //
- struct ParserMemberSet: Traversal::Member, Context
- {
- ParserMemberSet (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m)) return;
-
- String const& name (ename (m));
-
- os << "this->" << emember (m) << " = &" << name << ";";
- }
- };
-
-
- //
- //
- struct ParserMemberInit: Traversal::Member, Context
- {
- ParserMemberInit (Context& c)
- : Context (c), first_ (true)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m)) return;
-
- if (first_)
- first_ = false;
- else
- os << "," << endl << " ";
-
- os << emember (m) << " (0)";
-
- if (polymorphic &&
- m.is_a<SemanticGraph::Element> () &&
- !anonymous (m.type ()))
- {
- os << "," << endl
- << " " << emember_map (m) << " (0)";
- }
- }
-
- bool
- comma () const
- {
- return !first_;
- }
-
- private:
- bool first_;
- };
-
- struct ParserBaseSet: Traversal::Complex,
- Traversal::List,
- Context
- {
- ParserBaseSet (Context& c)
- : Context (c), member_ (c)
- {
- inherits_ >> *this;
- names_ >> member_;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
-
- if (!restriction_p (c))
- names (c, names_);
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- String const& name (ename (l));
- String item (unclash (name, "item"));
-
- os << "this->_xsd_" << item << "_ = &" << name << "_item;";
- }
-
- private:
- Traversal::Inherits inherits_;
-
- ParserMemberSet member_;
- Traversal::Names names_;
- };
-
- struct Particle: Traversal::All, Context
- {
- Particle (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- if (!a.context().count ("comp-number"))
- return;
-
- size_t state_count (a.context().get<size_t> ("state-count"));
-
- os << "," << endl
- << " v_all_count_ (" << state_count << "UL, v_all_first_)";
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c),
- parser_modifier_ (c),
- parser_base_set_ (c),
- parser_member_set_ (c),
- particle_ (c)
- {
- names_parser_modifier_ >> parser_modifier_;
- inherits_parser_base_set_ >> parser_base_set_;
- names_parser_member_set_ >> parser_member_set_;
- }
-
- virtual void
- traverse (Type& c)
- {
- bool he (has<Traversal::Element> (c));
- bool ha (has<Traversal::Attribute> (c));
-
- bool hae (has_particle<Traversal::Any> (c));
-
- bool hra (false); // Has required attribute.
- if (ha)
- {
- RequiredAttributeTest test (hra);
- Traversal::Names names_test (test);
- names (c, names_test);
- }
-
- bool restriction (restriction_p (c));
-
- if (!((!restriction && (he || ha)) ||
- (validation && (he || hae || hra))))
- return;
-
- String const& name (ename (c));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- if (!restriction && (he || ha))
- {
- // <name>_parser ()
- //
- names (c, names_parser_modifier_);
-
-
- // parsers ()
- //
-
- os << inl
- << "void " << name << "::" << endl
- << "parsers (";
-
- {
- ParserParamDecl decl (*this, true);
- decl.traverse (c);
- }
-
- os << ")"
- << "{";
-
- inherits (c, inherits_parser_base_set_);
- names (c, names_parser_member_set_);
-
- os << "}";
- }
-
- // Default c-tor.
- //
- os << inl
- << name << "::" << endl
- << name << " ()" << endl
- << ": ";
-
- bool comma (false);
-
- if (!restriction && (he || ha))
- {
- ParserMemberInit member_init (*this);
- Traversal::Names names_member_init (member_init);
-
- names (c, names_member_init);
-
- comma = member_init.comma ();
- }
-
- if (validation && (he || hae))
- {
- if (comma)
- os << "," << endl << " ";
-
- os << "v_state_stack_ (sizeof (v_state_), &v_state_first_)";
-
- particle_.dispatch (c.contains_compositor ().compositor ());
-
- comma = true;
- }
-
- if (validation && (hra))
- {
- if (comma)
- os << "," << endl << " ";
-
- os << "v_state_attr_stack_ (sizeof (v_state_attr_), " <<
- "&v_state_attr_first_)";
- }
-
- os << "{"
- << "}";
- }
-
- private:
- //
- //
- ParserModifier parser_modifier_;
- Traversal::Names names_parser_modifier_;
-
- //
- //
- ParserBaseSet parser_base_set_;
- Traversal::Inherits inherits_parser_base_set_;
-
- //
- //
- ParserMemberSet parser_member_set_;
- Traversal::Names names_parser_member_set_;
-
- //
- //
- Particle particle_;
- };
- }
-
- void
- generate_parser_inline (Context& ctx)
- {
- // Emit "weak" header includes that are used in the file-per-type
- // compilation model.
- //
- if (!ctx.options.generate_inline ())
- {
- Traversal::Schema schema;
- Includes includes (ctx, Includes::source);
-
- schema >> includes;
- schema.dispatch (ctx.schema_root);
- }
-
- Traversal::Schema schema;
-
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Complex complex (ctx);
-
- names >> list;
- names >> complex;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/parser-inline.hxx b/xsd/cxx/parser/parser-inline.hxx
deleted file mode 100644
index 7c732fc..0000000
--- a/xsd/cxx/parser/parser-inline.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/parser-inline.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_PARSER_INLINE_HXX
-#define CXX_PARSER_PARSER_INLINE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_parser_inline (Context&);
- }
-}
-
-#endif // CXX_PARSER_PARSER_INLINE_HXX
diff --git a/xsd/cxx/parser/parser-source.cxx b/xsd/cxx/parser/parser-source.cxx
deleted file mode 100644
index 64c0075..0000000
--- a/xsd/cxx/parser/parser-source.cxx
+++ /dev/null
@@ -1,957 +0,0 @@
-// file : xsd/cxx/parser/parser-source.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/parser/parser-source.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- struct Enumeration: Traversal::Enumeration, Context
- {
- Enumeration (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- String const& name (ename (e));
- String const& ret (ret_type (e));
-
- SemanticGraph::Type& base (e.inherits ().base ());
-
- bool same (ret == ret_type (base));
-
- if (same || ret == L"void" || polymorphic)
- {
- os << "// " << name << endl
- << "//" << endl
- << endl;
- }
-
- if (same || ret == L"void")
- {
- os << ret << " " << name << "::" << endl
- << post_name (e) << " ()"
- << "{";
-
- if (same)
- {
- if (ret == L"void")
- os << post_name (base) << " ();";
- else
- os << "return " << post_name (base) << " ();";
- }
-
- os << "}";
- }
-
- if (polymorphic)
- {
- String id (e.name ());
-
- if (String ns = xml_ns_name (e))
- {
- id += L' ';
- id += ns;
- }
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_static_type ()"
- << "{"
- << "return " << strlit (id) << ";"
- << "}";
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_dynamic_type () const"
- << "{"
- << "return _static_type ();"
- << "}";
-
- if (validation)
- {
- bool gen (!anonymous (e));
-
- // We normally don't need to enter anonymous types into
- // the inheritance map. The only exception is when an
- // anonymous types is defined inside an element that
- // is a member of a substitution group.
- //
- if (!gen)
- {
- // The first instance that this anonymous type classifies
- // is the prototype for others if any. If this type does
- // not classify anything (e.g., it is a base), then we
- // don't need to do anything.
- //
- if (e.classifies_begin () != e.classifies_end ())
- {
- SemanticGraph::Instance& i (
- e.classifies_begin ()->instance ());
-
- if (SemanticGraph::Element* e =
- dynamic_cast<SemanticGraph::Element*> (&i))
- {
- if (e->substitutes_p ())
- gen = true;
- }
- }
- }
-
- if (gen)
- {
- os << "static" << endl
- << "const ::xsd::cxx::parser::validating::inheritance_map_entry< " <<
- char_type << " >" << endl
- << "_xsd_" << name << "_inheritance_map_entry_ (" << endl
- << name << "::_static_type ()," << endl
- << fq_name (base) << "::_static_type ());"
- << endl;
- }
- }
- }
- }
- };
-
- //
- //
- struct List: Traversal::List, Context
- {
- List (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& l)
- {
- String const& name (ename (l));
- SemanticGraph::Type& t (l.argumented ().type ());
-
- String item (unclash (name, "item"));
-
- os << "// " << name << endl
- << "//" << endl
- << endl;
-
- // item
- //
- String const& arg (arg_type (t));
-
- os << "void " << name << "::" << endl
- << item;
-
- if (arg == L"void")
- os << " ()";
- else
- os << " (" << arg << ")";
-
- os << "{"
- << "}";
-
- // post
- //
- if (ret_type (l) == L"void")
- os << "void " << name << "::" << endl
- << post_name (l) << " ()"
- << "{"
- << "}";
-
- // parse_item
- //
- String inst (L"_xsd_" + item + L"_");
- String const& post (post_name (t));
-
- os << "void " << name << "::" << endl
- << "_xsd_parse_item (const " << string_type << "& v)"
- << "{"
- << "if (this->" << inst << ")"
- << "{"
- << "this->" << inst << "->pre ();"
- << "this->" << inst << "->_pre_impl ();"
- << "this->" << inst << "->_characters (v);"
- << "this->" << inst << "->_post_impl ();";
-
- if (ret_type (t) == L"void")
- os << "this->" << inst << "->" << post << " ();"
- << "this->" << item << " ();";
- else
- os << "this->" << item << " (this->" << inst << "->" <<
- post << " ());";
-
- os << "}"
- << "}";
-
- //
- //
- if (polymorphic)
- {
- String id (l.name ());
-
- if (String ns = xml_ns_name (l))
- {
- id += L' ';
- id += ns;
- }
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_static_type ()"
- << "{"
- << "return " << strlit (id) << ";"
- << "}";
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_dynamic_type () const"
- << "{"
- << "return _static_type ();"
- << "}";
- }
- }
- };
-
- //
- //
- struct Union: Traversal::Union, Context
- {
- Union (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& u)
- {
- String const& name (ename (u));
- String const& ret (ret_type (u));
-
- if (ret == L"void" || polymorphic)
- {
- os << "// " << name << endl
- << "//" << endl
- << endl;
- }
-
- if (ret == L"void")
- {
- os << "void " << name << "::" << endl
- << post_name (u) << " ()"
- << "{"
- << "}";
- }
-
- if (polymorphic)
- {
- String id (u.name ());
-
- if (String ns = xml_ns_name (u))
- {
- id += L' ';
- id += ns;
- }
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_static_type ()"
- << "{"
- << "return " << strlit (id) << ";"
- << "}";
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_dynamic_type () const"
- << "{"
- << "return _static_type ();"
- << "}";
- }
- }
- };
-
- //
- //
- struct StartElement: Traversal::Element, Context
- {
- StartElement (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (skip (e))
- return;
-
- bool poly (polymorphic && !anonymous (e.type ()));
-
- os << "if (";
-
- if (poly && e.global_p ())
- os << "(";
-
- if (e.qualified_p () && e.namespace_ ().name ())
- {
- os << "n == " << strlit (e.name ()) << " && " <<
- "ns == " << strlit (e.namespace_ ().name ());
- }
- else
- {
- os << "n == " << strlit (e.name ()) << " && ns.empty ()";
- }
-
- // Only a globally-defined element can be a subst-group root.
- //
- if (poly && e.global_p ())
- {
- os << ") ||" << endl
- << "::xsd::cxx::parser::substitution_map_instance< " <<
- char_type << " > ().check (" << endl
- << "ns, n, " << strlit (e.namespace_ ().name ()) <<
- ", " << strlit (e.name ()) << ", t)";
- }
-
- os << ")"
- << "{";
-
- String inst;
-
- if (poly)
- {
- SemanticGraph::Type& t (e.type ());
- inst = "p";
-
- // For pre-computing length.
- //
- String type_id (t.name ());
-
- if (String type_ns = xml_ns_name (t))
- {
- type_id += L' ';
- type_id += type_ns;
- }
-
- String fq_type (fq_name (t));
- String const& member (emember (e));
- String const& member_map (emember_map (e));
-
- os << fq_type << "* p = 0;"
- << endl
- << "if (t == 0 && this->" << member << " != 0)" << endl
- << inst << " = this->" << member << ";"
- << "else"
- << "{"
- << string_type << " ts (" << fq_type <<
- "::_static_type (), " << type_id.size () << "UL);"
- << endl
- << "if (t == 0)" << endl
- << "t = &ts;"
- << endl
- << "if (this->" << member << " != 0 && *t == ts)" << endl
- << inst << " = this->" << member << ";"
- << "else if (this->" << member_map << " != 0)" << endl
- << inst << " = dynamic_cast< " << fq_type <<
- "* > (" << endl
- << "this->" << member_map << "->find (*t));"
- << "}";
- }
- else
- inst = L"this->" + emember (e);
-
- os << "this->" << complex_base << "::context_.top ().parser_ = " <<
- inst << ";"
- << endl
- << "if (" << inst << ")" << endl
- << inst << "->pre ();" // _start_element calls _pre
- << endl
- << "return true;"
- << "}";
- }
- };
-
-
- //
- //
- struct EndElement: Traversal::Element, Context
- {
- EndElement (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (skip (e))
- return;
-
- bool poly (polymorphic && !anonymous (e.type ()));
- String const& name (ename (e));
-
- os << "if (";
-
- if (poly && e.global_p ())
- os << "(";
-
- if (e.qualified_p () && e.namespace_ ().name ())
- {
- os << "n == " << strlit (e.name ()) << " && " <<
- "ns == " << strlit (e.namespace_ ().name ());
- }
- else
- {
- os << "n == " << strlit (e.name ()) << " && ns.empty ()";
- }
-
- // Only a globally-defined element can be a subst-group root.
- //
- if (poly && e.global_p ())
- {
- os << ") ||" << endl
- << "::xsd::cxx::parser::substitution_map_instance< " <<
- char_type << " > ().check (" << endl
- << "ns, n, " << strlit (e.namespace_ ().name ()) <<
- ", " << strlit (e.name ()) << ")";
- }
-
- os << ")"
- << "{";
-
- // _end_element calls post
- //
-
- SemanticGraph::Type& type (e.type ());
- String const& post (post_name (type));
- String inst;
-
- if (poly)
- {
- String const& fq_type (fq_name (type));
- inst = "p";
-
- os << fq_type << "* p =" << endl
- << "dynamic_cast< " << fq_type << "* > (" << endl
- << "this->" << complex_base << "::context_.top ().parser_);"
- << endl;
- }
- else
- inst = L"this->" + emember (e);
-
- os << "if (" << inst << ")";
-
- if (ret_type (type) == L"void")
- os << "{"
- << inst << "->" << post << " ();"
- << "this->" << name << " ();"
- << "}";
- else
- os << endl
- << "this->" << name << " (" << inst << "->" << post << " ());"
- << endl;
-
- os << "return true;"
- << "}";
- }
- };
-
- //
- //
- struct Attribute: Traversal::Attribute, Context
- {
- Attribute (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& a)
- {
- String const& name (ename (a));
- String const& inst (emember (a));
-
- if (a.qualified_p () && a.namespace_ ().name ())
- {
- os << "if (n == " << strlit (a.name ()) << " && " <<
- "ns == " << strlit (a.namespace_ ().name ()) << ")"
- << "{";
- }
- else
- {
- os << "if (n == " << strlit (a.name ()) << " && ns.empty ())"
- << "{";
- }
-
- SemanticGraph::Type& type (a.type ());
- String const& post (post_name (type));
- String const& ret (ret_type (type));
-
- os << "if (this->" << inst << ")"
- << "{"
- << "this->" << inst << "->pre ();"
- << "this->" << inst << "->_pre_impl ();"
- << "this->" << inst << "->_characters (v);"
- << "this->" << inst << "->_post_impl ();";
-
- if (ret == L"void")
- os << "this->" << inst << "->" << post << " ();"
- << "this->" << name << " ();";
- else
- os << "this->" << name << " (this->" << inst << "->" <<
- post << " ());";
-
- os << "}"
- << "return true;"
- << "}";
- }
- };
-
- //
- //
- struct ParserCallback: Traversal::Member, Context
- {
- ParserCallback (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& m)
- {
- if (skip (m))
- return;
-
- String const& arg (arg_type (m.type ()));
-
- os << "void " << ename (m.scope ()) << "::" << endl
- << ename (m);
-
- if (arg == L"void")
- os << " ()";
- else
- os << " (" << arg << ")";
-
- os << "{"
- << "}";
- }
- };
-
- //
- //
- struct Complex: Traversal::Complex, Context
- {
- Complex (Context& c)
- : Context (c),
- parser_callback_ (c),
- start_element_ (c),
- end_element_ (c),
- attribute_ (c)
- {
- names_parser_callback_ >> parser_callback_;
- names_start_element_ >> start_element_;
- names_end_element_ >> end_element_;
- names_attribute_ >> attribute_;
- }
-
- virtual void
- traverse (Type& c)
- {
- bool he (has<Traversal::Element> (c));
- bool ha (has<Traversal::Attribute> (c));
-
- String const& ret (ret_type (c));
- bool same (c.inherits_p () &&
- ret == ret_type (c.inherits ().base ()));
-
- String const& name (ename (c));
-
- if ((he || ha || same || ret == L"void") || polymorphic)
- {
- os << "// " << name << endl
- << "//" << endl
- << endl;
- }
-
- if (polymorphic)
- {
- String id (c.name ());
-
- if (String ns = xml_ns_name (c))
- {
- id += L' ';
- id += ns;
- }
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_static_type ()"
- << "{"
- << "return " << strlit (id) << ";"
- << "}";
-
- os << "const " << char_type << "* " << name << "::" << endl
- << "_dynamic_type () const"
- << "{"
- << "return _static_type ();"
- << "}";
-
- if (c.inherits_p () && validation)
- {
- bool gen (!anonymous (c));
-
- // We normally don't need to enter anonymous types into
- // the inheritance map. The only exception is when an
- // anonymous types is defined inside an element that
- // is a member of a substitution group.
- //
- if (!gen)
- {
- // The first instance that this anonymous type classifies
- // is the prototype for others if any. If this type does
- // not classify anything (e.g., it is a base), then we
- // don't need to do anything.
- //
- if (c.classifies_begin () != c.classifies_end ())
- {
- SemanticGraph::Instance& i (
- c.classifies_begin ()->instance ());
-
- if (SemanticGraph::Element* e =
- dynamic_cast<SemanticGraph::Element*> (&i))
- {
- if (e->substitutes_p ())
- gen = true;
- }
- }
- }
-
- if (gen)
- {
- SemanticGraph::Type& base (c.inherits ().base ());
-
- os << "static" << endl
- << "const ::xsd::cxx::parser::validating::inheritance_map_entry< " <<
- char_type << " >" << endl
- << "_xsd_" << name << "_inheritance_map_entry_ (" << endl
- << name << "::_static_type ()," << endl
- << fq_name (base) << "::_static_type ());"
- << endl;
- }
- }
- }
-
- if (!(he || ha || same || ret == L"void"))
- return;
-
- // Parser callbacks.
- //
- if (!restriction_p (c))
- names (c, names_parser_callback_);
-
- if (same || ret == L"void")
- {
- os << ret << " " << name << "::" << endl
- << post_name (c) << " ()"
- << "{";
-
- if (same)
- {
- SemanticGraph::Type& base (c.inherits ().base ());
-
- if (ret == L"void")
- os << post_name (base) << " ();";
- else
- os << "return " << post_name (base) << " ();";
- }
-
- os << "}";
- }
-
- // The rest is parsing/validation code which is generated in
- // *-validation-source.cxx.
- //
- if (validation)
- return;
-
- // Don't use restriction_p here since we don't want special
- // treatment of anyType.
- //
- bool restriction (
- c.inherits_p () &&
- c.inherits ().is_a<SemanticGraph::Restricts> ());
-
- // _start_element_impl & _end_element_impl
- //
- if (he)
- {
- os << "bool " << name << "::" << endl
- << "_start_element_impl (const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "* t)"
- << "{"
- << "XSD_UNUSED (t);"
- << endl;
-
- if (!restriction)
- {
- os << "if (this->";
-
- if (c.inherits_p ())
- os << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
- os << "::_start_element_impl (ns, n, t))" << endl
- << "return true;"
- << endl;
- }
-
- names (c, names_start_element_);
-
- os << "return false;"
- << "}";
-
-
- // _end_element_impl
- //
- os << "bool " << name << "::" << endl
- << "_end_element_impl (const " << string_type << "& ns," << endl
- << "const " << string_type << "& n)"
- << "{";
-
- if (!restriction)
- {
- os << "if (this->";
-
- if (c.inherits_p () && !restriction)
- os << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
- os << "::_end_element_impl (ns, n))" << endl
- << "return true;"
- << endl;
- }
-
- names (c, names_end_element_);
-
- os << "return false;"
- << "}";
- }
-
-
- if (ha)
- {
- // _attribute_impl
- //
- os << "bool " << name << "::" << endl
- << "_attribute_impl (const " << string_type << "& ns," << endl
- << "const " << string_type << "& n," << endl
- << "const " << string_type << "& v)"
- << "{";
-
- if (!restriction)
- {
- os << "if (this->";
-
- if (c.inherits_p ())
- os << fq_name (c.inherits ().base ());
- else
- os << complex_base;
-
- os << "::_attribute_impl (ns, n, v))" << endl
- << "return true;"
- << endl;
- }
-
- names (c, names_attribute_);
-
- os << "return false;"
- << "}";
- }
- }
-
- private:
- //
- //
- ParserCallback parser_callback_;
- Traversal::Names names_parser_callback_;
-
- //
- //
- StartElement start_element_;
- Traversal::Names names_start_element_;
-
- //
- //
- EndElement end_element_;
- Traversal::Names names_end_element_;
-
- //
- //
- Attribute attribute_;
- Traversal::Names names_attribute_;
- };
-
-
- // Generate substitution group map entries.
- //
- struct GlobalElement: Traversal::Element, Context
- {
- GlobalElement (Context& c)
- : Context (c)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (e.substitutes_p ())
- {
- String name (escape (e.name ()));
- Type& r (e.substitutes ().root ());
-
- SemanticGraph::Type& type (e.type ());
-
- os << "// Substitution map entry for " << comment (e.name ()) << "." << endl
- << "//" << endl
- << "static" << endl
- << "const ::xsd::cxx::parser::substitution_map_entry< " <<
- char_type << " >" << endl
- << "_xsd_" << name << "_substitution_map_entry_ (" << endl
- << strlit (e.namespace_ ().name ()) << "," << endl
- << strlit (e.name ()) << "," << endl
- << strlit (r.namespace_ ().name ()) << "," << endl
- << strlit (r.name ()) << "," << endl
- << fq_name (type) << "::_static_type ());"
- << endl;
- }
- }
- };
- }
-
- void
- generate_parser_source (Context& ctx)
- {
- if (ctx.polymorphic)
- {
- ctx.os << "#include <xsd/cxx/parser/substitution-map.hxx>" << endl;
-
- if (ctx.validation)
- ctx.os << "#include <xsd/cxx/parser/validating/inheritance-map.hxx>" << endl
- << endl;
- else
- ctx.os << endl;
-
- bool import_maps (ctx.options.import_maps ());
- bool export_maps (ctx.options.export_maps ());
-
- if (import_maps || export_maps)
- {
- ctx.os << "#ifndef XSD_NO_EXPORT" << endl
- << endl
- << "namespace xsd"
- << "{"
- << "namespace cxx"
- << "{"
- << "namespace parser"
- << "{"
- << "#ifdef _MSC_VER" << endl;
-
- if (export_maps)
- ctx.os << "template struct __declspec (dllexport) " <<
- "substitution_map_init< " << ctx.char_type << " >;";
-
- if (import_maps)
- ctx.os << "template struct __declspec (dllimport) " <<
- "substitution_map_init< " << ctx.char_type << " >;";
-
- if (ctx.validation && export_maps)
- ctx.os << "template struct __declspec (dllexport) " <<
- "inheritance_map_init< " << ctx.char_type << " >;";
-
- if (ctx.validation && import_maps)
- ctx.os << "template struct __declspec (dllimport) " <<
- "inheritance_map_init< " << ctx.char_type << " >;";
-
- ctx.os << "#elif defined(__GNUC__) && __GNUC__ >= 4" << endl
- << "template struct __attribute__ ((visibility(\"default\"))) " <<
- "substitution_map_init< " << ctx.char_type << " >;";
-
- if (ctx.validation)
- ctx.os << "template struct __attribute__ ((visibility(\"default\"))) " <<
- "inheritance_map_init< " << ctx.char_type << " >;";
-
- ctx.os << "#elif defined(XSD_MAP_VISIBILITY)" << endl
- << "template struct XSD_MAP_VISIBILITY " <<
- "substitution_map_init< " << ctx.char_type << " >;";
-
- if (ctx.validation)
- ctx.os << "template struct XSD_MAP_VISIBILITY " <<
- "inheritance_map_init< " << ctx.char_type << " >;";
-
- ctx.os << "#endif" << endl
- << "}" // parser
- << "}" // cxx
- << "}" // xsd
- << "#endif // XSD_NO_EXPORT" << endl
- << endl;
- }
-
- ctx.os << "static" << endl
- << "const ::xsd::cxx::parser::substitution_map_init< " <<
- ctx.char_type << " >" << endl
- << "_xsd_substitution_map_init_;"
- << endl;
-
- if (ctx.validation)
- {
- ctx.os << "static" << endl
- << "const ::xsd::cxx::parser::validating::inheritance_map_init< " <<
- ctx.char_type << " >" << endl
- << "_xsd_inheritance_map_init_;"
- << endl;
- }
- }
-
- // Emit "weak" header includes that are used in the file-per-type
- // compilation model.
- //
- if (ctx.options.generate_inline ())
- {
- Traversal::Schema schema;
- Includes includes (ctx, Includes::source);
-
- schema >> includes;
- schema.dispatch (ctx.schema_root);
- }
-
- Traversal::Schema schema;
- Sources sources;
- Traversal::Names schema_names;
-
- Namespace ns (ctx);
- Traversal::Names names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> names;
-
- List list (ctx);
- Union union_ (ctx);
- Complex complex (ctx);
- Enumeration enumeration (ctx);
- GlobalElement global_element (ctx);
-
- names >> list;
- names >> union_;
- names >> complex;
- names >> enumeration;
-
- if (ctx.polymorphic)
- names >> global_element;
-
- schema.dispatch (ctx.schema_root);
- }
- }
-}
diff --git a/xsd/cxx/parser/parser-source.hxx b/xsd/cxx/parser/parser-source.hxx
deleted file mode 100644
index 0f8f57e..0000000
--- a/xsd/cxx/parser/parser-source.hxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// file : xsd/cxx/parser/parser-source.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_PARSER_SOURCE_HXX
-#define CXX_PARSER_PARSER_SOURCE_HXX
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- void
- generate_parser_source (Context&);
- }
-}
-
-#endif // CXX_PARSER_PARSER_SOURCE_HXX
diff --git a/xsd/cxx/parser/print-impl-common.hxx b/xsd/cxx/parser/print-impl-common.hxx
deleted file mode 100644
index 66379f0..0000000
--- a/xsd/cxx/parser/print-impl-common.hxx
+++ /dev/null
@@ -1,641 +0,0 @@
-// file : xsd/cxx/parser/print-impl-common.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_PRINT_IMPL_COMMON_HXX
-#define CXX_PARSER_PRINT_IMPL_COMMON_HXX
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-#include <cxx/parser/elements.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- struct PrintCall: Traversal::Type,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Context
- {
- PrintCall (Context& c, String const& tag, String const& arg)
- : Context (c), tag_ (tag), arg_ (arg)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type&)
- {
- gen_user_type ();
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- if (default_type (t, "bool"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- if (default_type (t, "signed char"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") <<
- " << static_cast<short> (" << arg_ << ") << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- if (default_type (t, "unsigned char"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") <<
- " << static_cast<unsigned short> (" << arg_ << ") << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- if (default_type (t, "short"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- if (default_type (t, "unsigned short"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- if (default_type (t, "int"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- if (default_type (t, "unsigned int"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- if (default_type (t, "long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- if (default_type (t, "unsigned long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- if (default_type (t, "long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- if (default_type (t, "long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- if (default_type (t, "long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- if (default_type (t, "unsigned long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- if (default_type (t, "unsigned long long"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- if (default_type (t, "float"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- if (default_type (t, "double"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- if (default_type (t, "double"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- gen_string (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI& t)
- {
- gen_string (t);
- }
-
- // String sequences.
- //
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens& t)
- {
- gen_sequence (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs& t)
- {
- gen_sequence (t);
- }
-
- // QName
- //
-
- virtual void
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- if (default_type (t, xs_ns_name () + L"::qname"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << ";"
- << endl
- << "if (" << arg_ << ".prefix ().empty ())" << endl
- << cout_inst << " << " << arg_ << ".name ();"
- << "else" << endl
- << cout_inst << " << " << arg_ << ".prefix () << " << L <<
- "':' << " << arg_ << ".name ();"
- << endl
- << cout_inst << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- gen_buffer (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- gen_buffer (t);
- }
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- if (default_type (t, xs_ns_name () + L"::date"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << endl
- << " << " << arg_ << ".year () << '-'" << endl
- << " << " << arg_ << ".month () << '-'" << endl
- << " << " << arg_ << ".day ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- if (default_type (t, xs_ns_name () + L"::date_time"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << endl
- << " << " << arg_ << ".year () << '-'" << endl
- << " << " << arg_ << ".month () << '-'" << endl
- << " << " << arg_ << ".day () << 'T'" << endl
- << " << " << arg_ << ".hours () << ':'" << endl
- << " << " << arg_ << ".minutes () << ':'" << endl
- << " << " << arg_ << ".seconds ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- if (default_type (t, xs_ns_name () + L"::duration"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << ";"
- << endl
- << "if (" << arg_ << ".negative ())" << endl
- << cout_inst << " << '-';"
- << endl
- << cout_inst << " << 'P'" << endl
- << " << " << arg_ << ".years () << 'Y'" << endl
- << " << " << arg_ << ".months () << 'M'" << endl
- << " << " << arg_ << ".days () << " << L << "\"DT\"" << endl
- << " << " << arg_ << ".hours () << 'H'" << endl
- << " << " << arg_ << ".minutes () << 'M'" << endl
- << " << " << arg_ << ".seconds () << 'S'"
- << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- if (default_type (t, xs_ns_name () + L"::gday"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ---") <<
- " << " << arg_ << ".day ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- if (default_type (t, xs_ns_name () + L"::gmonth"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": --") <<
- " << " << arg_ << ".month ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- if (default_type (t, xs_ns_name () + L"::gmonth_day"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": --") << endl
- << " << " << arg_ << ".month () << '-'" << endl
- << " << " << arg_ << ".day ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- if (default_type (t, xs_ns_name () + L"::gyear"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << ".year ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- if (default_type (t, xs_ns_name () + L"::gyear_month"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << endl
- << " << " << arg_ << ".year () << '-'" << endl
- << " << " << arg_ << ".month ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- if (default_type (t, xs_ns_name () + L"::time"))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << endl
- << " << " << arg_ << ".hours () << ':'" << endl
- << " << " << arg_ << ".minutes () << ':'" << endl
- << " << " << arg_ << ".seconds ();";
-
- gen_time_zone ();
- }
- else
- gen_user_type ();
- }
-
- private:
- bool
- default_type (SemanticGraph::Type& t, String const& def_type)
- {
- return ret_type (t) == def_type;
- }
-
- void
- gen_user_type ()
- {
- os << "// TODO" << endl
- << "//" << endl;
- }
-
- void
- gen_string (SemanticGraph::Type& t)
- {
- if ((char_type == L"char" && default_type (t, "::std::string")) ||
- (char_type == L"wchar_t" && default_type (t, "::std::wstring")))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << " <<
- arg_ << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- void
- gen_sequence (SemanticGraph::Type& t)
- {
- String type (xs_ns_name () + L"::string_sequence");
-
- if (default_type (t, type))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << ";"
- << endl;
-
- os << "for (" << type << "::const_iterator i (" << arg_ <<
- ".begin ()), e (" << arg_ << ".end ());" << endl
- << "i != e;)"
- << "{"
- << cout_inst << " << *i++;"
- << "if (i != e)" << endl
- << cout_inst << " << ' ';"
- << "}"
- << cout_inst << " << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- void
- gen_buffer (SemanticGraph::Type& t)
- {
- String type (auto_ptr + L"< " + xs_ns_name () + L"::buffer >");
-
- if (default_type (t, type))
- {
- os << cout_inst << " << " << strlit (tag_ + L": ") << " << "
- << arg_ << "->size () << " << L << "\" bytes\" << std::endl;";
- }
- else
- gen_user_type ();
- }
-
- void
- gen_time_zone ()
- {
- os << endl
- << "if (" << arg_ << ".zone_present ())"
- << "{"
- << "if (" << arg_ << ".zone_hours () < 0)" << endl
- << cout_inst << " << " << arg_ << ".zone_hours () << ':' << -" <<
- arg_ << ".zone_minutes ();"
- << "else" << endl
- << cout_inst << " << '+' << " << arg_ << ".zone_hours () << " <<
- "':' << " << arg_ << ".zone_minutes ();";
-
- os << "}"
- << cout_inst << " << std::endl;";
- }
-
- private:
- String tag_;
- String arg_;
- };
- }
-}
-
-#endif // CXX_PARSER_PRINT_IMPL_COMMON_HXX
diff --git a/xsd/cxx/parser/state-processor.cxx b/xsd/cxx/parser/state-processor.cxx
deleted file mode 100644
index 423d0d8..0000000
--- a/xsd/cxx/parser/state-processor.cxx
+++ /dev/null
@@ -1,319 +0,0 @@
-// file : xsd/cxx/parser/state-processor.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <vector>
-#include <iostream>
-
-#include <cxx/parser/state-processor.hxx>
-
-#include <cxx/parser/elements.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- typedef vector<SemanticGraph::Particle*> Particles;
-
- /*
- void
- print (Particles const& p)
- {
- using std::wcerr;
- using std::endl;
-
- wcerr << "prefixes: " << endl;
-
- for (Particles::const_iterator i (p.begin ()); i != p.end (); ++i)
- {
- if (SemanticGraph::Element* e =
- dynamic_cast<SemanticGraph::Element*> (*i))
- {
- wcerr << e->name () << endl;
- }
- else
- {
- wcerr << "<any>" << endl;
- }
- }
-
- wcerr << endl;
- }
- */
-
- //
- //
- struct Particle: Traversal::All,
- Traversal::Choice,
- Traversal::Sequence
- {
- Particle (size_t& all,
- size_t& choice,
- size_t& sequence,
- size_t& depth)
- : all_ (all),
- choice_ (choice),
- sequence_ (sequence),
- depth_ (depth)
- {
- }
-
- virtual void
- traverse (SemanticGraph::All& a)
- {
- using SemanticGraph::Compositor;
-
- // Go over particles, collecting "prefix" particles in prefixes_,
- // assigning state numbers and calculating effective minOccurs.
- // If all prefixes of this compositor have minOccurs = 0, then
- // the compositor itself effectively has minOccurs = 0 regardless
- // of the actual value specified in the schema.
- //
- // Note that we don't need to care about depth since the 'all'
- // compositor cannot contain any nested compositors.
- //
-
- size_t state (0);
- size_t min (0);
-
- for (Compositor::ContainsIterator ci (a.contains_begin ());
- ci != a.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- // The 'all' compositor can only include elements.
- //
- prefixes_.push_back (&p);
-
- if (min == 0 && ci->min () != 0)
- min = 1;
-
- p.context ().set ("prefix", true);
- p.context ().set ("state", state++);
- }
-
- if (!prefixes_.empty ())
- {
- a.context ().set ("comp-number", choice_++);
- a.context ().set ("prefixes", prefixes_);
- a.context ().set ("state-count", size_t (prefixes_.size ()));
-
- // effective-min = min * actual-min
- //
- if (min == 1)
- min = a.min ();
-
- a.context ().set ("effective-min", min);
-
- // print (prefixes_);
- }
- }
-
- virtual void
- traverse (SemanticGraph::Choice& c)
- {
- using SemanticGraph::Compositor;
-
- // Go over particles, collecting "prefix" particles in prefixes_,
- // assigning state numbers and calculating effective minOccurs.
- // If any prefix of this compositor have minOccurs = 0, then the
- // compositor itself effectively has minOccurs = 0 regardless of
- // the actual value specified in the schema.
- //
-
- size_t state (0);
- size_t min (1);
-
- for (Compositor::ContainsIterator ci (c.contains_begin ());
- ci != c.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<SemanticGraph::Element> () ||
- p.is_a<SemanticGraph::Any> ())
- {
- prefixes_.push_back (&p);
-
- if (min == 1 && ci->min () == 0)
- min = 0;
- }
- else
- {
- size_t depth (0);
- Particle t (all_, choice_, sequence_, depth);
- t.dispatch (p);
-
- if (t.prefixes_.empty ())
- continue; // Skip empty compositors.
-
- if (++depth > depth_) // One for this compositor.
- depth_ = depth;
-
- prefixes_.insert (prefixes_.end (),
- t.prefixes_.begin ().base (),
- t.prefixes_.end ().base ());
-
- if (min == 1 &&
- p.context ().get<size_t> ("effective-min") == 0)
- min = 0;
- }
-
- p.context ().set ("prefix", true);
- p.context ().set ("state", state++);
- }
-
- if (!prefixes_.empty ())
- {
- c.context ().set ("comp-number", choice_++);
- c.context ().set ("prefixes", prefixes_);
-
- // effective-min = min * actual-min
- //
- if (min == 1)
- min = c.min ();
-
- c.context ().set ("effective-min", min);
-
- // print (prefixes_);
- }
- }
-
- virtual void
- traverse (SemanticGraph::Sequence& s)
- {
- using SemanticGraph::Compositor;
-
- // Go over particles, collecting "prefix" particles in prefixes_,
- // assigning state numbers and calculating effective minOccurs.
- // If all prefixes of this compositor have minOccurs = 0, then
- // the compositor itself effectively has minOccurs = 0 regardless
- // of the actual value specified in the schema.
- //
-
- bool prefix (true);
- size_t state (0);
- size_t min (0);
-
- for (Compositor::ContainsIterator ci (s.contains_begin ());
- ci != s.contains_end (); ++ci)
- {
- SemanticGraph::Particle& p (ci->particle ());
-
- if (p.is_a<SemanticGraph::Element> () ||
- p.is_a<SemanticGraph::Any> ())
- {
- if (prefix)
- {
- prefixes_.push_back (&p);
-
- if (ci->min () != 0)
- min = 1;
- }
- }
- else
- {
- size_t depth (0);
- Particle t (all_, choice_, sequence_, depth);
- t.dispatch (p);
-
- if (t.prefixes_.empty ())
- continue; // Skip empty compositors.
-
- if (++depth > depth_) // One for this compositor.
- depth_ = depth;
-
- if (prefix)
- {
- prefixes_.insert (prefixes_.end (),
- t.prefixes_.begin ().base (),
- t.prefixes_.end ().base ());
-
- if (p.context ().get<size_t> ("effective-min") != 0)
- min = 1;
- }
- }
-
- p.context ().set ("state", state++);
-
- if (prefix)
- p.context ().set ("prefix", true);
-
- if (prefix && min != 0)
- prefix = false;
- }
-
- if (!prefixes_.empty ())
- {
- s.context ().set ("comp-number", sequence_++);
- s.context ().set ("prefixes", prefixes_);
-
- // effective-min = min * actual-min
- //
- if (min == 1)
- min = s.min ();
-
- s.context ().set ("effective-min", min);
-
- // print (prefixes_);
- }
- }
-
- private:
- Particles prefixes_;
-
- size_t& all_;
- size_t& choice_;
- size_t& sequence_;
-
- size_t& depth_;
- };
-
-
- //
- //
- struct Complex: Traversal::Complex
- {
- virtual void
- traverse (Type& c)
- {
- if (c.contains_compositor_p ())
- {
- size_t all (0), choice (0), sequence (0), depth (0);
- Particle t (all, choice, sequence, depth);
- t.dispatch (c.contains_compositor ().compositor ());
-
- // Set the maximum stack depth for this type. Used to
- // allocate fixed-size state stack.
- //
- c.context ().set ("depth", depth + 1);
- }
- }
- };
- }
-
- void StateProcessor::
- process (SemanticGraph::Schema& tu, SemanticGraph::Path const&)
- {
- Traversal::Schema schema;
- Sources sources;
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
-
- schema >> sources >> schema;
- schema >> schema_names >> ns >> ns_names;
-
- Complex complex_type;
-
- ns_names >> complex_type;
-
- schema.dispatch (tu);
- }
- }
-}
diff --git a/xsd/cxx/parser/state-processor.hxx b/xsd/cxx/parser/state-processor.hxx
deleted file mode 100644
index e5559b4..0000000
--- a/xsd/cxx/parser/state-processor.hxx
+++ /dev/null
@@ -1,25 +0,0 @@
-// file : xsd/cxx/parser/state-processor.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_STATE_PROCESSOR_HXX
-#define CXX_PARSER_STATE_PROCESSOR_HXX
-
-#include <xsd-frontend/semantic-graph.hxx>
-
-#include <types.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- class StateProcessor
- {
- public:
- void
- process (XSDFrontend::SemanticGraph::Schema&,
- XSDFrontend::SemanticGraph::Path const& file);
- };
- }
-}
-
-#endif // CXX_PARSER_STATE_PROCESSOR_HXX
diff --git a/xsd/cxx/parser/type-processor.cxx b/xsd/cxx/parser/type-processor.cxx
deleted file mode 100644
index d1b2e68..0000000
--- a/xsd/cxx/parser/type-processor.cxx
+++ /dev/null
@@ -1,347 +0,0 @@
-// file : xsd/cxx/parser/type-processor.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <set>
-
-#include <cxx/parser/elements.hxx>
-#include <cxx/parser/type-processor.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- //
- //
- struct Type: Traversal::Type
- {
- Type (SemanticGraph::Schema& schema,
- TypeMap::Namespaces& type_map,
- bool add_includes)
- : schema_ (schema),
- type_map_ (type_map),
- add_includes_ (add_includes)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type& type)
- {
- using TypeMap::Namespace;
- using TypeMap::Namespaces;
-
- SemanticGraph::Context& tc (type.context ());
-
- // There are two situations where we may try to process the
- // same type more than once. The first is when the type is
- // used in several element declarations in the same schema.
- // The second situation only occurs when we are in the file-
- // per-type mode. In this case the type was processed as part
- // of another root schema. In the second case, while the ret
- // and arg types are assumed to be the same, we need to re-
- // match the type in order to add include directives to the
- // new root schema.
- //
- bool set (true);
-
- if (tc.count ("ret-type"))
- {
- SemanticGraph::Schema* s (
- tc.get<SemanticGraph::Schema*> ("root-schema"));
-
- if (&schema_ == s)
- return;
-
- set = false;
- }
-
- SemanticGraph::Namespace& ns (
- dynamic_cast<SemanticGraph::Namespace&> (type.scope ()));
-
- String ns_name (ns.name ());
- String t_name (type.name ());
-
- //std::wcerr << "traversing: " << ns_name << "#" << t_name << endl;
-
- for (Namespaces::const_iterator n (type_map_.begin ());
- n != type_map_.end (); ++n)
- {
- // Check if the namespace matches.
- //
- bool ns_match;
-
- if (!n->xsd_name ().empty ())
- {
- ns_match = n->xsd_name ().match (ns_name);
- }
- else
- ns_match = ns_name.empty ();
-
- //std::wcerr << "considering ns expr: " << n->xsd_name ()
- // << " for " << ns_name
- // << ": " << (ns_match ? "+" : "-") << endl;
-
- if (ns_match)
- {
- // Namespace matched. See if there is a type that matches.
- //
- for (Namespace::TypesIterator t (n->types_begin ());
- t != n->types_end (); ++t)
- {
- if (t->xsd_name ().match (t_name))
- {
- if (set)
- {
- // Got a match. See if the namespace has the C++
- // namespace mapping.
- //
- String cxx_ns;
-
- if (n->has_cxx_name ())
- {
- if (!n->xsd_name ().empty ())
- {
- cxx_ns = n->xsd_name ().replace (
- ns_name, n->cxx_name (), true);
- }
- else
- cxx_ns = n->cxx_name ();
-
- cxx_ns += L"::";
- }
-
- // Figure out ret and arg type names.
- //
- String ret_type (cxx_ns);
-
- ret_type += t->xsd_name ().replace (
- t_name, t->cxx_ret_name (), true);
-
- String arg_type;
-
- if (t->cxx_arg_name ())
- {
- arg_type = cxx_ns;
- arg_type += t->xsd_name ().replace (
- t_name, t->cxx_arg_name (), true);
- }
- else
- {
- if (ret_type == L"void")
- arg_type = ret_type;
- else
- {
- wchar_t last (ret_type[ret_type.size () - 1]);
-
- // If it is already a pointer or reference then use
- // it as is.
- //
- if (last == L'*' || last == L'&')
- arg_type = ret_type;
- else
- arg_type = L"const " + ret_type + L"&";
- }
- }
-
- tc.set ("ret-type", ret_type);
- tc.set ("arg-type", arg_type);
-
- //std::wcerr << t_name << " -> " << ret_type << endl;
- }
-
- tc.set ("root-schema", &schema_);
-
- // See of we need to add any includes to the translations
- // unit.
- //
- if (add_includes_)
- {
- if (n->includes_begin () != n->includes_end ())
- {
- typedef std::set<String> Includes;
-
- if (!schema_.context ().count ("includes"))
- schema_.context ().set ("includes", Includes ());
-
- Includes& is (
- schema_.context ().get<Includes> ("includes"));
-
- for (Namespace::IncludesIterator i (n->includes_begin ());
- i != n->includes_end (); ++i)
- {
- is.insert (*i);
- }
- }
- }
-
- return;
- }
- }
- }
- }
- }
-
- private:
- SemanticGraph::Schema& schema_;
- TypeMap::Namespaces& type_map_;
- bool add_includes_;
- };
-
-
- //
- //
- struct GlobalType: Traversal::Type,
- Traversal::List,
- Traversal::Complex,
- Traversal::Enumeration
- {
- GlobalType (SemanticGraph::Schema& schema,
- TypeMap::Namespaces& type_map,
- bool add_includes)
- : type_ (schema, type_map, add_includes)
- {
- inherits_ >> type_;
- names_ >> instance_ >> belongs_ >> type_;
- argumented_ >> type_;
- }
-
- virtual void
- traverse (SemanticGraph::Type& t)
- {
- type_.traverse (t);
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- type_.traverse (l);
- Traversal::List::argumented (l, argumented_);
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- type_.traverse (c);
- Complex::inherits (c, inherits_);
- Complex::names (c, names_);
- }
-
- virtual void
- traverse (SemanticGraph::Enumeration& e)
- {
- type_.traverse (e);
- Complex::inherits (e, inherits_);
- }
-
- private:
- Parser::Type type_;
- Traversal::Names names_;
- Traversal::Instance instance_;
- Traversal::Inherits inherits_;
- Traversal::Belongs belongs_;
- Traversal::Argumented argumented_;
- };
-
- void
- process_impl (options const& ops,
- XSDFrontend::SemanticGraph::Schema& tu,
- bool gen_driver,
- TypeMap::Namespaces& type_map)
- {
- if (tu.names_begin ()->named ().name () ==
- L"http://www.w3.org/2001/XMLSchema")
- {
- // XML Schema namespace.
- //
- Traversal::Schema schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- GlobalType global_type (tu, type_map, true);
-
- schema >> schema_names >> ns >> ns_names >> global_type;
-
- schema.dispatch (tu);
- }
- else
- {
- // If --extern-xml-schema is specified, then we don't want
- // includes from the XML Schema type map.
- //
- bool extern_xml_schema (ops.extern_xml_schema ());
-
- //
- //
- Traversal::Schema schema;
- Traversal::Schema xs_schema;
- Sources sources;
- Traversal::Implies implies;
-
- schema >> sources >> schema;
- schema >> implies >> xs_schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- GlobalType global_type (tu, type_map, true);
-
- schema >> schema_names >> ns >> ns_names >> global_type;
-
- Traversal::Names xs_schema_names;
- Traversal::Namespace xs_ns;
- Traversal::Names xs_ns_names;
- GlobalType xs_global_type (tu, type_map, !extern_xml_schema);
-
- xs_schema >> xs_schema_names >> xs_ns >> xs_ns_names >>
- xs_global_type;
-
- schema.dispatch (tu);
-
- // If we are generating the test driver, make sure the root
- // element type is processed.
- //
- if (gen_driver && ops.generate_test_driver ())
- {
- // Figure out the root element. Validator should have made sure
- // it is unique.
- //
- SemanticGraph::Element* root (0);
- {
- Traversal::Schema schema;
- Sources sources;
-
- schema >> sources >> schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- RootElement root_element (ops, root);
-
- schema >> schema_names >> ns >> ns_names >> root_element;
-
- schema.dispatch (tu);
- }
-
- global_type.dispatch (root->type ());
- }
- }
- }
- }
-
- void TypeProcessor::
- process (options const& ops,
- XSDFrontend::SemanticGraph::Schema& s,
- bool gen_driver,
- TypeMap::Namespaces& tm)
- {
- process_impl (ops, s, gen_driver, tm);
- }
- }
-}
diff --git a/xsd/cxx/parser/type-processor.hxx b/xsd/cxx/parser/type-processor.hxx
deleted file mode 100644
index 53fd970..0000000
--- a/xsd/cxx/parser/type-processor.hxx
+++ /dev/null
@@ -1,31 +0,0 @@
-// file : xsd/cxx/parser/type-processor.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_TYPE_PROCESSOR_HXX
-#define CXX_PARSER_TYPE_PROCESSOR_HXX
-
-#include <xsd-frontend/semantic-graph.hxx>
-
-#include <types.hxx>
-
-#include <type-map/type-map.hxx>
-
-#include <cxx/parser/options.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- class TypeProcessor
- {
- public:
- void
- process (options const&,
- XSDFrontend::SemanticGraph::Schema&,
- bool gen_driver,
- TypeMap::Namespaces&);
- };
- }
-}
-
-#endif // CXX_PARSER_TYPE_PROCESSOR_HXX
diff --git a/xsd/cxx/parser/validator.cxx b/xsd/cxx/parser/validator.cxx
deleted file mode 100644
index 6bf5b48..0000000
--- a/xsd/cxx/parser/validator.cxx
+++ /dev/null
@@ -1,718 +0,0 @@
-// file : xsd/cxx/parser/validator.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <set>
-#include <iostream>
-
-#include <cxx/parser/validator.hxx>
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-#include <cxx/parser/elements.hxx>
-
-using namespace std;
-
-namespace CXX
-{
- namespace Parser
- {
- namespace
- {
- class ValidationContext: public Context
- {
- public:
- ValidationContext (SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- Parser::options const& ops,
- const WarningSet& disabled_warnings,
- bool& valid_)
- : Context (std::wcerr, root, path, ops, 0, 0, 0, 0),
- disabled_warnings_ (disabled_warnings),
- disabled_warnings_all_ (false),
- valid (valid_),
- subst_group_warning_issued (subst_group_warning_issued_),
- subst_group_warning_issued_ (false)
- {
- }
-
- public:
- bool
- is_disabled (char const* w)
- {
- return disabled_warnings_all_ ||
- disabled_warnings_.find (w) != disabled_warnings_.end ();
- }
-
- public:
- String
- xpath (SemanticGraph::Nameable& n)
- {
- if (n.is_a<SemanticGraph::Namespace> ())
- return L"<namespace-level>"; // There is a bug if you see this.
-
- assert (n.named_p ());
-
- SemanticGraph::Scope& scope (n.scope ());
-
- if (scope.is_a<SemanticGraph::Namespace> ())
- return n.name ();
-
- return xpath (scope) + L"/" + n.name ();
- }
-
- protected:
- ValidationContext (ValidationContext& c)
- : Context (c),
- disabled_warnings_ (c.disabled_warnings_),
- disabled_warnings_all_ (c.disabled_warnings_all_),
- valid (c.valid),
- subst_group_warning_issued (c.subst_group_warning_issued)
- {
- }
-
- protected:
- const WarningSet& disabled_warnings_;
- bool disabled_warnings_all_;
- bool& valid;
- bool& subst_group_warning_issued;
- bool subst_group_warning_issued_;
- };
-
- //
- //
- struct Any: Traversal::Any, ValidationContext
- {
- Any (ValidationContext& c)
- : ValidationContext (c)
- {
- }
-
- struct Element: Traversal::Element, ValidationContext
- {
- Element (ValidationContext& c, SemanticGraph::Any& any)
- : ValidationContext (c),
- any_ (any),
- ns_ (any.definition_namespace ().name ())
- {
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- if (skip (e)) return;
-
- using SemanticGraph::Any;
-
- bool q (e.qualified_p ());
- String ns (q ? e.namespace_ ().name () : "");
-
- for (Any::NamespaceIterator i (any_.namespace_begin ());
- i != any_.namespace_end (); ++i)
- {
- bool failed (false);
-
- if (*i == L"##any")
- {
- failed = true;
- }
- else if (*i == L"##other")
- {
- if (ns_)
- {
- // Note that here I assume that ##other does not
- // include names without target namespace. This
- // is not what the spec says but that seems to be
- // the consensus.
- //
- failed = q && ns != ns_;
- }
- else
- {
- // No target namespace.
- //
- failed = q && ns != L"";
- }
- }
- else if (*i == L"##local")
- {
- failed = !q || ns == L"";
- }
- else if (*i == L"##targetNamespace")
- {
- failed = (q && ns_ == ns) || (!q && ns_ == L"");
- }
- else
- {
- failed = q && *i == ns;
- }
-
- if (failed)
- {
- Any& a (any_);
-
- os << a.file () << ":" << a.line () << ":" << a.column ()
- << ": warning P001: namespace '" << *i << "' allows for "
- << "element '" << e.name () << "'" << endl;
-
- os << a.file () << ":" << a.line () << ":" << a.column ()
- << ": warning P001: generated code may not associate element '"
- << e.name () << "' correctly if it appears in place of "
- << "this wildcard" << endl;
-
- os << e.file () << ":" << e.line () << ":" << e.column ()
- << ": info: element '" << e.name () << "' is defined "
- << "here" << endl;
-
- os << a.file () << ":" << a.line () << ":" << a.column ()
- << ": info: turn on validation to ensure correct "
- << "association" << endl;
- }
- }
- }
-
- private:
- SemanticGraph::Any& any_;
- String ns_;
- };
-
- struct Complex: Traversal::Complex
- {
- Complex ()
- : up_ (true), down_ (true)
- {
- }
-
- virtual void
- post (Type& c)
- {
- // Go down the inheritance hierarchy.
- //
- if (down_)
- {
- bool up = up_;
- up_ = false;
-
- if (c.inherits_p ())
- dispatch (c.inherits ().base ());
-
- up_ = up;
- }
-
- // Go up the inheritance hierarchy.
- //
- if (up_)
- {
- bool down = down_;
- down_ = false;
-
- for (Type::BegetsIterator i (c.begets_begin ());
- i != c.begets_end (); ++i)
- {
- dispatch (i->derived ());
- }
-
- down_ = down;
- }
- }
-
- private:
- bool up_, down_;
- };
-
- virtual void
- traverse (SemanticGraph::Any& a)
- {
- using SemanticGraph::Compositor;
-
- // Find our complex type.
- //
- Compositor* c (&a.contained_particle ().compositor ());
-
- while(!c->contained_compositor_p ())
- c = &c->contained_particle ().compositor ();
-
- SemanticGraph::Complex& type (
- dynamic_cast<SemanticGraph::Complex&> (
- c->contained_compositor ().container ()));
-
- Complex complex;
- Traversal::Names names;
- Element element (*this, a);
-
- complex >> names >> element;
-
- complex.dispatch (type);
- }
- };
-
-
- //
- //
- struct Traverser: Traversal::Schema,
- Traversal::Complex,
- Traversal::Type,
- Traversal::Element,
- ValidationContext
- {
- Traverser (ValidationContext& c)
- : ValidationContext (c),
- any_ (c)
- {
- *this >> sources_ >> *this;
- *this >> schema_names_ >> ns_ >> names_ >> *this;
-
- // Any
- //
- if (!validation && !is_disabled ("P001"))
- {
- *this >> contains_compositor_ >> compositor_ >> contains_particle_;
- contains_particle_ >> compositor_;
- contains_particle_ >> any_;
- }
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- using SemanticGraph::Schema;
-
- traverse (static_cast<SemanticGraph::Type&> (c));
-
- if (c.inherits_p ())
- {
- SemanticGraph::Type& t (c.inherits ().base ());
-
- if (t.named_p () &&
- types_.find (
- t.scope ().name () + L"#" + t.name ()) == types_.end ())
- {
- // Don't worry about types that are in included/imported
- // schemas.
- //
- Schema& s (dynamic_cast<Schema&> (t.scope ().scope ()));
-
- if (&s == &schema_root || sources_p (schema_root, s))
- {
- valid = false;
-
- wcerr << c.file () << ":" << c.line () << ":" << c.column ()
- << ": error: type '" << xpath (c) << "' inherits from "
- << "yet undefined type '" << xpath (t) << "'" << endl;
-
- wcerr << t.file () << ":" << t.line () << ":" << t.column ()
- << ": info: '" << xpath (t) << "' is defined here"
- << endl;
-
- wcerr << c.file () << ":" << c.line () << ":" << c.column ()
- << ": info: inheritance from a yet-undefined type is "
- << "not supported" << endl;
-
- wcerr << c.file () << ":" << c.line () << ":" << c.column ()
- << ": info: re-arrange your schema and try again"
- << endl;
- }
- }
- }
-
- Complex::traverse (c);
- }
-
- virtual void
- traverse (SemanticGraph::Type& t)
- {
- if (t.named_p ())
- {
- types_.insert (t.scope ().name () + L"#" + t.name ());
- }
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- if (is_disabled ("P002"))
- return;
-
- if (e.substitutes_p () &&
- !options.generate_polymorphic () &&
- !subst_group_warning_issued)
- {
- subst_group_warning_issued = true;
-
- os << e.file () << ":" << e.line () << ":" << e.column ()
- << ": warning P002: substitution groups are used but "
- << "--generate-polymorphic was not specified" << endl;
-
- os << e.file () << ":" << e.line () << ":" << e.column ()
- << ": info: generated code may not be able to parse "
- << "some conforming instances" << endl;
- }
- }
-
- // Return true if root sources s.
- //
- bool
- sources_p (SemanticGraph::Schema& root, SemanticGraph::Schema& s)
- {
- using SemanticGraph::Schema;
- using SemanticGraph::Sources;
-
- for (Schema::UsesIterator i (root.uses_begin ());
- i != root.uses_end (); ++i)
- {
- if (i->is_a<Sources> ())
- {
- if (&i->schema () == &s || sources_p (i->schema (), s))
- return true;
- }
- }
-
- return false;
- }
-
- private:
- set<String> types_;
-
- Sources sources_;
-
- Traversal::Names schema_names_;
- Traversal::Namespace ns_;
-
- Traversal::Names names_;
-
- // Any.
- //
- Any any_;
- Traversal::Compositor compositor_;
- Traversal::ContainsParticle contains_particle_;
- Traversal::ContainsCompositor contains_compositor_;
- };
-
-
- struct AnonymousType: Traversal::Schema,
- Traversal::Complex,
- Traversal::Element,
- Traversal::Attribute,
- ValidationContext
- {
- AnonymousType (ValidationContext& c)
- : ValidationContext (c),
- anonymous_error_issued_ (false)
- {
- *this >> sources_ >> *this;
- *this >> schema_names_ >> ns_ >> names_ >> *this;
- *this >> names_;
- }
-
- bool
- traverse_common (SemanticGraph::Member& m)
- {
- SemanticGraph::Type& t (m.type ());
-
- if (!t.named_p ()
- && !t.is_a<SemanticGraph::Fundamental::IdRef> ()
- && !t.is_a<SemanticGraph::Fundamental::IdRefs> ())
- {
- if (!anonymous_error_issued_)
- {
- valid = false;
- anonymous_error_issued_ = true;
-
- wcerr << t.file ()
- << ": error: anonymous types detected"
- << endl;
-
- wcerr << t.file ()
- << ": info: "
- << "anonymous types are not supported in this mapping"
- << endl;
-
- wcerr << t.file ()
- << ": info: consider explicitly naming these types or "
- << "remove the --preserve-anonymous option to "
- << "automatically name them"
- << endl;
-
- if (!options.show_anonymous ())
- wcerr << t.file ()
- << ": info: use --show-anonymous option to see these "
- << "types" << endl;
- }
-
- return true;
- }
-
- return false;
- }
-
- virtual void
- traverse (SemanticGraph::Element& e)
- {
- if (skip (e)) return;
-
- if (traverse_common (e))
- {
- if (options.show_anonymous ())
- {
- wcerr << e.file () << ":" << e.line () << ":" << e.column ()
- << ": error: element '" << xpath (e) << "' "
- << "is of anonymous type" << endl;
- }
- }
- else
- Traversal::Element::traverse (e);
- }
-
- virtual void
- traverse (SemanticGraph::Attribute& a)
- {
- if (traverse_common (a))
- {
- if (options.show_anonymous ())
- {
- wcerr << a.file () << ":" << a.line () << ":" << a.column ()
- << ": error: attribute '" << xpath (a) << "' "
- << "is of anonymous type" << endl;
- }
- }
- else
- Traversal::Attribute::traverse (a);
- }
-
- private:
- bool anonymous_error_issued_;
-
- set<String> types_;
-
- Sources sources_;
-
- Traversal::Names schema_names_;
- Traversal::Namespace ns_;
-
- Traversal::Names names_;
- };
-
- struct GlobalElement: Traversal::Element, ValidationContext
- {
- GlobalElement (ValidationContext& c, SemanticGraph::Element*& element)
- : ValidationContext (c), element_ (element)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (!valid)
- return;
-
- if (options.root_element_first ())
- {
- if (element_ == 0)
- element_ = &e;
- }
- else if (options.root_element_last ())
- {
- element_ = &e;
- }
- else if (String name = options.root_element ())
- {
- if (e.name () == name)
- element_ = &e;
- }
- else
- {
- if (element_ == 0)
- element_ = &e;
- else
- {
- wcerr << schema_root.file () << ": error: unable to generate "
- << "the test driver without a unique document root"
- << endl;
-
- wcerr << schema_root.file () << ": info: use --root-element-* "
- << "options to specify the document root" << endl;
-
- valid = false;
- }
- }
- }
-
- private:
- SemanticGraph::Element*& element_;
- };
-
- }
-
- bool Validator::
- validate (options const& ops,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- bool gen_driver,
- const WarningSet& disabled_warnings)
- {
- bool valid (true);
- ValidationContext ctx (root, path, ops, disabled_warnings, valid);
-
- //
- //
- if (ops.char_type () != "char" &&
- ops.char_type () != "wchar_t" &&
- !ctx.is_disabled ("P003"))
- {
- wcerr << "warning P003: unknown base character type '" <<
- ops.char_type ().c_str () << "'" << endl;
- }
-
- //
- //
- if (ops.xml_parser () != "xerces" &&
- ops.xml_parser () != "expat" &&
- !ctx.is_disabled ("P004"))
- {
- wcerr << "warning P004: unknown underlying XML parser '" <<
- ops.xml_parser ().c_str () << "'" << endl;
- }
-
- //
- //
- if (ops.xml_parser () == "expat" &&
- ops.char_type () == "wchar_t")
- {
- wcerr << "error: using expat with wchar_t is not supported"
- << endl;
-
- return false;
- }
-
- //
- //
- if (ops.xml_parser () == "expat" &&
- !ops.char_encoding ().empty () &&
- ops.char_encoding () != "utf8")
- {
- wcerr << "error: using expat with character encoding other than "
- << "utf8 is not supported"
- << endl;
-
- return false;
- }
-
- //
- //
- if (ops.generate_validation () && ops.suppress_validation ())
- {
- wcerr << "error: mutually exclusive options specified: "
- << "--generate-validation and --suppress-validation"
- << endl;
-
- return false;
- }
-
- //
- //
- if (ops.generate_noop_impl () && ops.generate_print_impl ())
- {
- wcerr << "error: mutually exclusive options specified: "
- << "--generate-noop-impl and --generate-print-impl"
- << endl;
-
- return false;
- }
-
- //
- //
- {
- bool ref (ops.root_element_first ());
- bool rel (ops.root_element_last ());
- bool re (ops.root_element ());
-
- if ((ref && rel) || (ref && re) || (rel && re))
- {
- wcerr << "error: mutually exclusive options specified: "
- << "--root-element-last, --root-element-first, and "
- << "--root-element"
- << endl;
-
- return false;
- }
- }
-
- //
- //
- bool import_maps (ops.import_maps ());
- bool export_maps (ops.export_maps ());
-
- if (import_maps && export_maps)
- {
- wcerr << "error: --import-maps and --export-maps are "
- << "mutually exclusive" << endl;
-
- return false;
- }
-
- if (import_maps && !ctx.polymorphic)
- {
- wcerr << "error: --import-maps can only be specified together with "
- << "--generate-polymorphic" << endl;
-
- return false;
- }
-
- if (export_maps && !ctx.polymorphic)
- {
- wcerr << "error: --export-maps can only be specified together with "
- << "--generate-polymorphic" << endl;
-
- return false;
- }
-
- // Test for anonymout types.
- //
- {
- AnonymousType traverser (ctx);
- traverser.dispatch (root);
- }
-
-
- // Test the rest.
- //
- if (valid)
- {
- Traverser traverser (ctx);
- traverser.dispatch (root);
- }
-
- // Test that the document root is unique.
- //
- if (valid && gen_driver)
- {
- SemanticGraph::Element* element (0);
-
- Traversal::Schema schema;
- Sources sources;
-
- schema >> sources >> schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- GlobalElement global_element (ctx, element);
-
- schema >> schema_names >> ns >> ns_names >> global_element;
-
- schema.dispatch (root);
-
- if (valid && element == 0)
- {
- wcerr << root.file () << ": error: unable to generate the "
- << "test driver without a global element (document root)"
- << endl;
-
- valid = false;
- }
- }
-
- return valid;
- }
- }
-}
diff --git a/xsd/cxx/parser/validator.hxx b/xsd/cxx/parser/validator.hxx
deleted file mode 100644
index 5f10526..0000000
--- a/xsd/cxx/parser/validator.hxx
+++ /dev/null
@@ -1,30 +0,0 @@
-// file : xsd/cxx/parser/validator.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_PARSER_VALIDATOR_HXX
-#define CXX_PARSER_VALIDATOR_HXX
-
-#include <xsd.hxx>
-#include <types.hxx>
-
-#include <cxx/parser/elements.hxx>
-#include <cxx/parser/options.hxx>
-
-namespace CXX
-{
- namespace Parser
- {
- class Validator
- {
- public:
- bool
- validate (options const&,
- SemanticGraph::Schema&,
- SemanticGraph::Path const& tu,
- bool gen_driver,
- const WarningSet& disabled_warnings);
- };
- }
-}
-
-#endif // CXX_PARSER_VALIDATOR_HXX
diff --git a/xsd/cxx/tree/counter.cxx b/xsd/cxx/tree/counter.cxx
deleted file mode 100644
index a5bdbb3..0000000
--- a/xsd/cxx/tree/counter.cxx
+++ /dev/null
@@ -1,260 +0,0 @@
-// file : xsd/cxx/tree/counter.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/tree/counter.hxx>
-
-#include <iostream>
-
-namespace CXX
-{
- namespace Tree
- {
- namespace
- {
- struct Member: Traversal::Member
- {
- Member (size_t& complexity)
- : complexity_ (complexity)
- {
- }
-
- virtual void
- traverse (Type&)
- {
- complexity_++;
- }
-
- size_t& complexity_;
- };
-
- struct Any: Traversal::Any, Traversal::AnyAttribute
- {
- Any (size_t& complexity)
- : complexity_ (complexity)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Any&)
- {
- complexity_++;
- }
-
- virtual void
- traverse (SemanticGraph::AnyAttribute&)
- {
- complexity_++;
- }
-
- size_t& complexity_;
- };
-
- struct TypeBase: Traversal::List,
- Traversal::Union,
- Traversal::Enumeration,
- Traversal::Complex,
- Context
- {
- TypeBase (Context& c, size_t& complexity)
- : Context (c), complexity_ (complexity)
- {
- }
-
- virtual void
- traverse (SemanticGraph::List&)
- {
- complexity_++;
- }
-
- virtual void
- traverse (SemanticGraph::Union&)
- {
- complexity_++;
- }
-
- virtual void
- traverse (SemanticGraph::Enumeration& e)
- {
- bool string_based (false);
- {
- IsStringBasedType t (string_based);
- t.dispatch (e);
- }
-
- complexity_ += (string_based ? 1 : 2);
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- complexity_++; // One for the type itself.
-
- // Plus some for each member.
- //
- Any any (complexity_);
- Member member (complexity_);
- Traversal::Names names;
-
- names >> member;
-
- if (options.generate_wildcard ())
- names >> any;
-
- Complex::names (c, names);
- }
-
- private:
- size_t& complexity_;
- };
-
-
- //
- //
- struct GlobalType: Traversal::Type, Context
-
- {
- GlobalType (Context& c, Counts& counts)
- : Context (c), counts_ (counts)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type& t)
- {
- counts_.global_types++;
-
- size_t complexity (0);
- TypeBase type (*this, complexity);
- type.dispatch (t);
-
- counts_.complexity_total += complexity;
- counts_.complexity.push_back (complexity);
- }
-
- private:
- Counts& counts_;
- };
-
- //
- //
- struct GlobalElement: Traversal::Element,
- GlobalElementBase,
- Context
- {
- GlobalElement (Context& c, Counts& counts)
- : GlobalElementBase (c),
- Context (c),
- counts_ (counts),
- last_ (0)
- {
- }
-
- ~GlobalElement ()
- {
- if (last_ != 0)
- {
- last_->context ().set ("last", true);
- count_last ();
- }
- }
-
- virtual void
- traverse (Type& e)
- {
- // Check if the previous element we saw needs to be generated.
- //
- if (last_ != 0)
- count_last ();
-
- last_ = &e;
-
- if (counts_.global_elements == 0)
- e.context ().set ("first", true);
-
- counts_.global_elements++;
- }
-
- private:
- void
- count_last ()
- {
- if (generate_p (*last_))
- {
- counts_.generated_global_elements++;
-
- size_t complexity (0);
-
- if (doc_root_p (*last_))
- {
- if (options.generate_element_type ())
- {
- complexity += 1; // For c-tors and d-tor.
-
- if (!options.suppress_parsing ())
- complexity += 1;
-
- if (options.generate_serialization ())
- complexity += 1;
- }
- else
- {
- if (!options.suppress_parsing ())
- complexity += 6; // 13 parsing functions.
-
- if (options.generate_serialization ())
- complexity += 4; // 8 serialization functions.
- }
- }
-
- if (complexity == 0)
- {
- // This element must be a substitution group members. For
- // such elements we are only generating an entry in a map.
- // We will assign it a complexity of 1 so that we don't
- // end up with the total complexity that is less than the
- // number of elements and types.
- //
- complexity = 1;
- }
-
- counts_.complexity_total += complexity;
- counts_.complexity.push_back (complexity);
- }
- }
-
- private:
- Counts& counts_;
- SemanticGraph::Element* last_;
- };
- }
-
- Counts Counter::
- count (options const& ops,
- SemanticGraph::Schema& tu,
- SemanticGraph::Path const& path)
- {
- Counts counts;
- Context ctx (std::wcerr, tu, path, ops, counts, false, 0, 0, 0, 0);
-
- Traversal::Schema schema;
- Sources sources;
-
- schema >> sources >> schema;
-
- Traversal::Names schema_names;
- Traversal::Namespace ns;
- Traversal::Names ns_names;
- GlobalType global_type (ctx, counts);
- GlobalElement global_element (ctx, counts);
-
- schema >> schema_names >> ns >> ns_names;
-
- ns_names >> global_element;
- ns_names >> global_type;
-
- schema.dispatch (tu);
-
- return counts;
- }
- }
-}
diff --git a/xsd/cxx/tree/counter.hxx b/xsd/cxx/tree/counter.hxx
deleted file mode 100644
index 28dccf2..0000000
--- a/xsd/cxx/tree/counter.hxx
+++ /dev/null
@@ -1,25 +0,0 @@
-// file : xsd/cxx/tree/counter.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_TREE_COUNTER_HXX
-#define CXX_TREE_COUNTER_HXX
-
-#include <cxx/tree/elements.hxx>
-#include <cxx/tree/options.hxx>
-
-namespace CXX
-{
- namespace Tree
- {
- class Counter
- {
- public:
- Counts
- count (options const&,
- SemanticGraph::Schema&,
- SemanticGraph::Path const&);
- };
- }
-}
-
-#endif // CXX_TREE_COUNTER_HXX
diff --git a/xsd/cxx/tree/default-value.cxx b/xsd/cxx/tree/default-value.cxx
deleted file mode 100644
index 24ec454..0000000
--- a/xsd/cxx/tree/default-value.cxx
+++ /dev/null
@@ -1,1273 +0,0 @@
-// file : xsd/cxx/tree/default-value.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/tree/default-value.hxx>
-
-using std::hex;
-using std::dec;
-
-namespace CXX
-{
- namespace Tree
- {
- namespace
- {
- void
- normalize (String& s)
- {
- size_t n (s.size ());
-
- for (size_t i (0); i < n; ++i)
- {
- wchar_t& c (s[i]);
-
- if (c == 0x0D || // carriage return
- c == 0x09 || // tab
- c == 0x0A)
- c = 0x20;
- }
- }
-
- void
- collapse (String& s)
- {
- size_t n (s.size ()), j (0);
- bool subs (false), trim (true);
-
- for (size_t i (0); i < n; ++i)
- {
- wchar_t c (s[i]);
-
- if (c == 0x20 || c == 0x09 || c == 0x0A)
- subs = true;
- else
- {
- if (subs)
- {
- subs = false;
-
- if (!trim)
- s[j++] = 0x20;
- }
-
- if (trim)
- trim = false;
-
- s[j++] = c;
- }
- }
-
- s.resize (j);
- }
-
- void
- strip_zeros (String& s)
- {
- size_t n (s.size ()), i (0);
-
- if (n > 0 && (s[i] == '-' || s[i] == '+'))
- i++;
-
- size_t j (i);
-
- bool strip (true);
-
- for (; i < n; ++i)
- {
- wchar_t c (s[i]);
-
- if (c == '0')
- {
- if (!strip)
- s[j++] = c;
- }
- else
- {
- s[j++] = c;
-
- if (strip)
- strip = false;
- }
- }
-
- if (strip && j < n)
- s[j++] = '0'; // There was nothing except zeros so add one back.
-
- s.resize (j);
- }
-
- void
- make_float (String& s)
- {
- if (s.find ('.') == String::npos &&
- s.find ('e') == String::npos &&
- s.find ('E') == String::npos)
- s += L".0";
- }
- }
-
- //
- // IsLiteralValue
- //
-
- IsLiteralValue::
- IsLiteralValue (bool& r)
- : IsFundamentalType (r)
- {
- *this >> inherits_ >> *this;
- }
-
- void IsLiteralValue::
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c);
- }
-
- //
- // LiteralValue
- //
-
- LiteralValue::
- LiteralValue (Context& c)
- : Context (c)
- {
- *this >> inherits_ >> *this;
- }
-
- String LiteralValue::
- dispatch (SemanticGraph::Node& type, String const& value)
- {
- literal_.clear ();
- value_ = value;
- Traversal::NodeBase::dispatch (type);
- return literal_;
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c);
- }
-
- // Boolean.
- //
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Boolean&)
- {
- collapse (value_);
- literal_ = (value_ == L"true" || value_ == L"1") ? L"true" : L"false";
- }
-
- // Integral types.
- //
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Byte&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_;
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::UnsignedByte&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"U";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Short&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_;
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::UnsignedShort&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"U";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Int&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_;
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::UnsignedInt&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"U";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Long&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_;
- literal_ += L"LL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::UnsignedLong&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_;
- literal_ += L"ULL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Integer&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"LL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::NonPositiveInteger&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"LL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::NonNegativeInteger&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"ULL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::PositiveInteger&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"ULL";
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::NegativeInteger&)
- {
- collapse (value_);
- strip_zeros (value_);
- literal_ = value_ + L"LL";
- }
-
- // Floats.
- //
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- collapse (value_);
-
- if (value_ == L"NaN")
- {
- literal_ = L"::std::numeric_limits< " + fq_name (t) +
- L" >::quiet_NaN ()";
- }
- else if (value_ == L"INF")
- {
- literal_ = L"::std::numeric_limits< " + fq_name (t) +
- L" >::infinity ()";
- }
- else if (value_ == L"-INF")
- {
- literal_ = L"- ::std::numeric_limits< " + fq_name (t) +
- L" >::infinity ()";
- }
- else
- {
- strip_zeros (value_);
- make_float (value_);
- literal_ = value_ + L"F";
- }
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- collapse (value_);
-
- if (value_ == L"NaN")
- {
- literal_ = L"::std::numeric_limits< " + fq_name (t) +
- L" >::quiet_NaN ()";
- }
- else if (value_ == L"INF")
- {
- literal_ = L"::std::numeric_limits< " + fq_name (t) +
- L" >::infinity ()";
- }
- else if (value_ == L"-INF")
- {
- literal_ = L"- ::std::numeric_limits< " + fq_name (t) +
- L" >::infinity ()";
- }
- else
- {
- strip_zeros (value_);
- make_float (value_);
- literal_ = value_;
- }
- }
-
- void LiteralValue::
- traverse (SemanticGraph::Fundamental::Decimal&)
- {
- collapse (value_);
- strip_zeros (value_);
- make_float (value_);
- literal_ = value_;
- }
-
- //
- // InitKind
- //
-
- InitKind::
- InitKind (Kind& r)
- : r_ (r)
- {
- *this >> inherits_ >> *this;
- }
-
- void InitKind::
- traverse (SemanticGraph::List&)
- {
- r_ = function;
- }
-
- void InitKind::
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c);
- }
-
- void InitKind::
- traverse (SemanticGraph::Fundamental::Base64Binary&)
- {
- r_ = data;
- }
-
- void InitKind::
- traverse (SemanticGraph::Fundamental::HexBinary&)
- {
- r_ = data;
- }
-
- void InitKind::
- traverse (SemanticGraph::Fundamental::NameTokens&)
- {
- r_ = function;
- }
-
- void InitKind::
- traverse (SemanticGraph::Fundamental::IdRefs&)
- {
- r_ = function;
- }
-
- void InitKind::
- traverse (SemanticGraph::Fundamental::Entities&)
- {
- r_ = function;
- }
-
- //
- // InitValue
- //
-
- InitValue::
- InitValue (Context& c)
- : Context (c), type_name_ (c), literal_value_ (c)
- {
- }
-
- void InitValue::
- dispatch (SemanticGraph::Node& type, String const& value)
- {
- value_ = value;
- Traversal::NodeBase::dispatch (type);
- }
-
- void InitValue::
- traverse (SemanticGraph::List& l)
- {
- collapse (value_);
-
- if (!value_)
- return;
-
- SemanticGraph::Type& t (l.argumented ().type ());
-
- String ov (value_);
- size_t b (0);
-
- for (size_t e (ov.find (' ')); ; e = ov.find (' ', b))
- {
- String v (ov, b, e != String::npos ? e - b : e);
-
- os << "{";
- type_name_.dispatch (t);
- os << " tmp (";
-
- String lit (literal_value_.dispatch (t, v));
-
- if (lit)
- os << lit;
- else
- {
- value_ = v;
- Traversal::NodeBase::dispatch (t);
- }
-
- os << ");"
- << "r.push_back (tmp);"
- << "}";
-
- if (e == String::npos)
- break;
-
- b = e + 1;
- }
-
- value_ = ov;
- }
-
- void InitValue::
- traverse (SemanticGraph::Union&)
- {
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Complex& c)
- {
- Traversal::NodeBase::dispatch (ultimate_base (c));
- }
-
- // anyType & anySimpleType.
- //
- void InitValue::
- traverse (SemanticGraph::AnyType& t)
- {
- os << fq_name (t) << " (" << strlit (value_) << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::AnySimpleType& t)
- {
- os << fq_name (t) << " (" << strlit (value_) << ")";
- }
-
- // Strings.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::String&)
- {
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::NormalizedString&)
- {
- normalize (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Token&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::NameToken&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::NameTokens&)
- {
- string_sequence_type (
- dynamic_cast<SemanticGraph::Type&> (
- xs_ns ().find ("NMTOKEN").first->named ()));
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Name&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::NCName&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Language&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- // Qualified name.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- size_t p (value_.rfind ('#'));
-
- if (p != String::npos)
- {
- String ns (value_, 0, p);
- String qname (value_, p + 1, String::npos);
-
- collapse (ns);
- collapse (qname);
-
- p = qname.find (':');
-
- String name;
- if (p != String::npos)
- name.assign (qname, p + 1, String::npos);
- else
- name = qname;
-
- os << fq_name (t) << " (" << strlit (ns) << ", " <<
- strlit (name) << ")";
- }
- else
- {
- // Unqualified name.
- //
- collapse (value_);
- os << fq_name (t) << " (" << strlit (value_) << ")";
- }
- }
-
- // ID/IDREF.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::Id&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::IdRef&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::IdRefs&)
- {
- string_sequence_type (
- dynamic_cast<SemanticGraph::Type&> (
- xs_ns ().find ("IDREF").first->named ()));
- }
-
- // URI.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::AnyURI&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- // Binary.
- //
- static unsigned char
- base64_decode (unsigned char c)
- {
- unsigned char r = 0xFF;
-
- if (c >= 'A' && c <= 'Z')
- r = static_cast<unsigned char> (c - 'A');
- else if (c >= 'a' && c <= 'z')
- r = static_cast<unsigned char> (c - 'a' + 26);
- else if (c >= '0' && c <= '9')
- r = static_cast<unsigned char> (c - '0' + 52);
- else if (c == '+')
- r = 62;
- else if (c == '/')
- r = 63;
-
- return r;
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- collapse (value_);
-
- if (dispatch_count_++ == 0)
- {
- if (value_)
- {
- os << "unsigned char " << data_ << "[] = {";
-
- // Decode.
- //
- size_t size (value_.size ());
-
- // Remove all whitespaces.
- //
- {
- size_t j (0);
- bool subs (false);
-
- for (size_t i (0); i < size; ++i)
- {
- wchar_t c (value_[i]);
-
- if (c == 0x20 || c == 0x0A || c == 0x0D || c == 0x09)
- subs = true;
- else
- {
- if (subs)
- subs = false;
-
- value_[j++] = c;
- }
- }
-
- size = j;
- value_.resize (size, '\0');
- }
-
- // Our length should be a multiple of four.
- //
- size_t quad_count (size / 4);
-
- // Source and destination indexes.
- //
- size_t si (0), di (0);
-
- // Process all quads except the last one.
- //
- unsigned short v;
- unsigned char b1, b2, b3, b4;
-
- wchar_t prev_fill (os.fill ('0'));
-
- for (size_t q (0); q < quad_count - 1; ++q)
- {
- b1 = base64_decode (value_[si++]);
- b2 = base64_decode (value_[si++]);
- b3 = base64_decode (value_[si++]);
- b4 = base64_decode (value_[si++]);
-
- if (q != 0)
- os << ", ";
-
- if (di % 9 == 0)
- os << endl;
-
- os << hex;
-
- v = static_cast<unsigned char> ((b1 << 2) | (b2 >> 4));
- os.width (2);
- os << "0x" << v;
-
- v = static_cast<unsigned char> ((b2 << 4) | (b3 >> 2));
- os.width (2);
- os << ", 0x" << v;
-
- v = static_cast<unsigned char> ((b3 << 6) | b4);
- os.width (2);
- os << ", 0x" << v;
-
- os << dec;
-
- di += 3;
- }
-
- // Process the last quad. The first two octets are always there.
- //
- b1 = base64_decode (value_[si++]);
- b2 = base64_decode (value_[si++]);
-
- wchar_t e3 (value_[si++]), e4 (value_[si++]);
-
- if (quad_count != 1)
- os << ", ";
-
- if (di % 9 == 0)
- os << endl;
-
- if (e4 == '=')
- {
- if (e3 == '=')
- {
- // Two pads. Last 4 bits in b2 should be zero.
- //
- v = static_cast<unsigned char> ((b1 << 2) | (b2 >> 4));
- os << "0x" << hex << v << dec;
- di++;
- }
- else
- {
- // One pad. Last 2 bits in b3 should be zero.
- //
- b3 = base64_decode (e3);
-
- os << hex;
-
- v = static_cast<unsigned char> ((b1 << 2) | (b2 >> 4));
- os.width (2);
- os << "0x" << v;
-
- v = static_cast<unsigned char> ((b2 << 4) | (b3 >> 2));
- os.width (2);
- os << ", 0x" << v;
-
- os << dec;
-
- di += 2;
- }
- }
- else
- {
- // No pads.
- //
- b3 = base64_decode (e3);
- b4 = base64_decode (e4);
-
- os << hex;
-
- v = static_cast<unsigned char> ((b1 << 2) | (b2 >> 4));
- os.width (2);
- os << "0x" << v;
-
- v = static_cast<unsigned char> ((b2 << 4) | (b3 >> 2));
- os.width (2);
- os << ", 0x" << v;
-
- v = static_cast<unsigned char> ((b3 << 6) | b4);
- os.width (2);
- os << ", 0x" << v;
-
- os << dec;
-
- di += 3;
- }
-
- os.fill (prev_fill);
-
- os << "};";
- }
- }
- else
- {
- os << fq_name (t) << " (";
-
- if (value_)
- os << data_ << "," << endl
- << "sizeof (" << data_ << ")," << endl
- << "sizeof (" << data_ << ")," << endl
- << "false";
- else
- os << "0";
-
-
- os << ")";
- }
- }
-
- static unsigned char
- hex_decode (unsigned char c)
- {
- unsigned char r = 0xFF;
-
- if (c >= '0' && c <= '9')
- r = static_cast<unsigned char> (c - '0');
- else if (c >= 'A' && c <= 'F')
- r = static_cast<unsigned char> (10 + (c - 'A'));
- else if (c >= 'a' && c <= 'f')
- r = static_cast<unsigned char> (10 + (c - 'a'));
-
- return r;
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- collapse (value_);
-
- if (dispatch_count_++ == 0)
- {
- if (value_)
- {
- os << "unsigned char " << data_ << "[] = {";
-
- // Decode.
- //
- size_t n (value_.size () / 2);
- wchar_t prev_fill (os.fill ('0'));
-
- for (size_t i (0); i < n; ++i)
- {
- unsigned char h (hex_decode (value_[2 * i]));
- unsigned char l (hex_decode (value_[2 * i + 1]));
-
- if (h == 0xFF || l == 0xFF)
- break;
-
- if (i != 0)
- os << ", ";
-
- if (i % 9 == 0)
- os << endl;
-
- unsigned short v = static_cast<unsigned char> ((h << 4) | l);
- os.width (2);
- os << "0x" << hex << v << dec;
- }
-
- os.fill (prev_fill);
-
- os << "};";
- }
- }
- else
- {
- os << fq_name (t) << " (";
-
- if (value_)
- os << data_ << "," << endl
- << "sizeof (" << data_ << ")," << endl
- << "sizeof (" << data_ << ")," << endl
- << "false";
- else
- os << "0";
-
-
- os << ")";
- }
- }
-
- // Date/time.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- // date := [-]CCYY[N]*-MM-DD[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- size_t b (0);
- size_t e (value_.find ('-', value_[0] == '-' ? 5 : 4));
- String year (value_, 0, e);
-
- b = e + 1;
- String month (value_, b, 2);
-
- b += 3;
- String day (value_, b, 2);
-
- strip_zeros (year);
- strip_zeros (month);
- strip_zeros (day);
-
- os << fq_name (t) << " (" << year << ", " << month << ", " << day;
- time_zone (b + 2);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- // date_time := [-]CCYY[N]*-MM-DDTHH:MM:SS[.S+][Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- size_t b (0);
- size_t e (value_.find ('-', value_[0] == '-' ? 5 : 4));
- String year (value_, 0, e);
- b = e + 1;
-
- String month (value_, b, 2);
- b += 3;
-
- String day (value_, b, 2);
- b += 3;
-
- String hours (value_, b, 2);
- b += 3;
-
- String minutes (value_, b, 2);
- b += 3;
-
- e = b + 2;
- for (; e < value_.size (); ++e)
- {
- wchar_t c (value_[e]);
-
- if (c == 'Z' || c == '+' || c == '-')
- break;
- }
-
- String seconds (value_, b, e - b);
-
- strip_zeros (year);
- strip_zeros (month);
- strip_zeros (day);
- strip_zeros (hours);
- strip_zeros (minutes);
- strip_zeros (seconds);
- make_float (seconds);
-
- os << fq_name (t) << " ("
- << year << ", " << month << ", " << day << ", "
- << hours << ", " << minutes << ", " << seconds;
- time_zone (e);
- os << ")";
- }
-
- namespace
- {
- size_t
- find_delim (String const& s, size_t pos)
- {
- for (; pos < s.size (); ++pos)
- {
- wchar_t c (s[pos]);
-
- if (c == 'Y' || c == 'D' || c == 'M' || c == 'H' ||
- c == 'M' || c == 'S' || c == 'T')
- break;
- }
-
- return pos;
- }
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- // duration := [-]P[nY][nM][nD][TnHnMn[.n+]S]
- //
- collapse (value_);
-
- size_t b (1), e, n (value_.size ());
-
- os << fq_name (t) << " (";
-
- if (value_[0] == '-')
- {
- os << "true, ";
- b++;
- }
- else
- os << "false, ";
-
- e = find_delim (value_, b);
-
- if (e < n && value_[e] == 'Y')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- os << v << ", ";
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0, ";
-
- if (e < n && value_[e] == 'M')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- os << v << ", ";
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0, ";
-
- if (e < n && value_[e] == 'D')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- os << v << ", ";
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0, ";
-
- if (e < n && value_[e] == 'T')
- {
- b = e + 1;
- e = find_delim (value_, b);
- }
-
- if (e < n && value_[e] == 'H')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- os << v << ", ";
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0, ";
-
- if (e < n && value_[e] == 'M')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- os << v << ", ";
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0, ";
-
- if (e < n && value_[e] == 'S')
- {
- String v (value_, b, e - b);
- strip_zeros (v);
- make_float (v);
- os << v;
-
- b = e + 1;
- e = find_delim (value_, b);
- }
- else
- os << "0.0";
-
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- // gday := ---DD[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- String day (value_, 3, 2);
- strip_zeros (day);
-
- os << fq_name (t) << " (" << day;
- time_zone (5);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- // gmonth := --MM[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- String month (value_, 2, 2);
- strip_zeros (month);
-
- os << fq_name (t) << " (" << month;
- time_zone (4);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- // gmonth_day := --MM-DD[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- String month (value_, 2, 2);
- String day (value_, 5, 2);
-
- strip_zeros (month);
- strip_zeros (day);
-
- os << fq_name (t) << " (" << month << ", " << day;
- time_zone (7);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- // gyear := [-]CCYY[N]*[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- size_t pos (value_[0] == '-' ? 5 : 4);
- for (; pos < value_.size (); ++pos)
- {
- wchar_t c (value_[pos]);
-
- if (c == 'Z' || c == '+' || c == '-')
- break;
- }
-
- String year (value_, 0, pos);
- strip_zeros (year);
-
- os << fq_name (t) << " (" << year;
- time_zone (pos);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- // gyear_month := [-]CCYY[N]*-MM[Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- size_t pos (value_.find ('-', value_[0] == '-' ? 5 : 4));
-
- String year (value_, 0, pos);
- String month (value_, pos + 1, 2);
-
- strip_zeros (year);
- strip_zeros (month);
-
- os << fq_name (t) << " (" << year << ", " << month;
- time_zone (pos + 3);
- os << ")";
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- // time := HH:MM:SS[.S+][Z|(+|-)HH:MM]
- //
- collapse (value_);
-
- String hours (value_, 0, 2);
- String minutes (value_, 3, 2);
-
- size_t e (8);
- for (; e < value_.size (); ++e)
- {
- wchar_t c (value_[e]);
-
- if (c == 'Z' || c == '+' || c == '-')
- break;
- }
-
- String seconds (value_, 6, e - 6);
-
- strip_zeros (hours);
- strip_zeros (minutes);
- strip_zeros (seconds);
- make_float (seconds);
-
- os << fq_name (t) << " (" << hours << ", " << minutes << ", " << seconds;
- time_zone (e);
- os << ")";
- }
-
- void InitValue::
- time_zone (size_t pos)
- {
- // time_zone := Z|(+|-)HH:MM
- //
- if (pos < value_.size ())
- {
- String h, m;
-
- if (value_[pos] == 'Z')
- {
- h = "0";
- m = "0";
- }
- else
- {
- if (value_[pos] == '-')
- {
- h = "-";
- m = "-";
- }
-
- h.append (value_, pos + 1, 2);
- m.append (value_, pos + 4, 2);
-
- strip_zeros (h);
- strip_zeros (m);
- }
-
- os << ", " << h << ", " << m;
- }
- }
-
- // Entity.
- //
- void InitValue::
- traverse (SemanticGraph::Fundamental::Entity&)
- {
- collapse (value_);
- os << strlit (value_);
- }
-
- void InitValue::
- traverse (SemanticGraph::Fundamental::Entities&)
- {
- string_sequence_type (
- dynamic_cast<SemanticGraph::Type&> (
- xs_ns ().find ("ENTITY").first->named ()));
- }
-
- void InitValue::
- string_sequence_type (SemanticGraph::Type& t)
- {
- collapse (value_);
-
- if (!value_)
- return;
-
- size_t b (0);
-
- for (size_t e (value_.find (' ')); ; e = value_.find (' ', b))
- {
- String v (value_, b, e != String::npos ? e - b : e);
-
- os << "{";
- type_name_.dispatch (t);
- os << " tmp (" << strlit (v) << ");"
- << "r.push_back (tmp);"
- << "}";
-
- if (e == String::npos)
- break;
-
- b = e + 1;
- }
- }
- }
-}
diff --git a/xsd/cxx/tree/default-value.hxx b/xsd/cxx/tree/default-value.hxx
deleted file mode 100644
index 3937d3a..0000000
--- a/xsd/cxx/tree/default-value.hxx
+++ /dev/null
@@ -1,355 +0,0 @@
-// file : xsd/cxx/tree/default-value.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_TREE_DEFAULT_VALUE_HXX
-#define CXX_TREE_DEFAULT_VALUE_HXX
-
-#include <xsd-frontend/semantic-graph.hxx>
-#include <xsd-frontend/traversal.hxx>
-
-#include <cxx/tree/elements.hxx>
-
-namespace CXX
-{
- namespace Tree
- {
- struct IsLiteralValue: IsFundamentalType, Traversal::Complex
- {
- IsLiteralValue (bool& r);
-
- virtual void
- traverse (SemanticGraph::Complex&);
-
- private:
- Traversal::Inherits inherits_;
- };
-
- struct LiteralValue: Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Complex,
-
- Context
- {
- LiteralValue (Context&);
-
- String
- dispatch (SemanticGraph::Node& type, String const& value);
-
- // Handle inheritance.
- //
- virtual void
- traverse (SemanticGraph::Complex&);
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean&);
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger&);
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal&);
-
- private:
- String value_;
- String literal_;
-
- Traversal::Inherits inherits_;
- };
-
- // Some initialization (e.g., list) need a function body while others
- // (e.g., *binary) require extra data.
- //
- struct InitKind: Traversal::List,
- Traversal::Complex,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::IdRefs,
- Traversal::Fundamental::Entities
- {
- enum Kind
- {
- simple,
- data,
- function
- };
-
- // Should be simple initially.
- //
- InitKind (Kind& r);
-
- virtual void
- traverse (SemanticGraph::List&);
-
- virtual void
- traverse (SemanticGraph::Complex&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities&);
-
- private:
- Kind& r_;
- Traversal::Inherits inherits_;
- };
-
- struct InitValue: Traversal::List,
- Traversal::Union,
- Traversal::Complex,
-
- Traversal::AnyType,
- Traversal::AnySimpleType,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Traversal::Fundamental::Entity,
- Traversal::Fundamental::Entities,
-
- Context
- {
- InitValue (Context&);
-
- void
- data (String const& data)
- {
- data_ = data;
- dispatch_count_ = 0;
- }
-
- void
- dispatch (SemanticGraph::Node& type, String const& value);
-
- virtual void
- traverse (SemanticGraph::List&);
-
- virtual void
- traverse (SemanticGraph::Union&);
-
- virtual void
- traverse (SemanticGraph::Complex&);
-
- // anyType & anySimpleType.
- //
- virtual void
- traverse (SemanticGraph::AnyType&);
-
- virtual void
- traverse (SemanticGraph::AnySimpleType&);
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language&);
-
- // Qualified name.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::QName&);
-
- // ID/IDREF.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Id&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs&);
-
- // URI.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI&);
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary&);
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time&);
-
- // Entity.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Entity&);
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities&);
-
- private:
- void
- string_sequence_type (SemanticGraph::Type& element_type);
-
- void
- time_zone (size_t pos);
-
- private:
- String value_;
- String data_;
- size_t dispatch_count_;
- MemberTypeName type_name_;
- LiteralValue literal_value_;
- };
- }
-}
-
-#endif // CXX_TREE_DEFAULT_VALUE_HXX
diff --git a/xsd/cxx/tree/elements.cxx b/xsd/cxx/tree/elements.cxx
deleted file mode 100644
index 78281cd..0000000
--- a/xsd/cxx/tree/elements.cxx
+++ /dev/null
@@ -1,1409 +0,0 @@
-// file : xsd/cxx/tree/elements.cxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#include <cxx/tree/elements.hxx>
-
-namespace CXX
-{
- namespace Tree
- {
- // Context
- //
- Context::
- Context (std::wostream& o,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- options_type const& ops,
- Counts const& counts_,
- bool generate_xml_schema__,
- StringLiteralMap const* map,
- Regex const* fe,
- Regex const* he,
- Regex const* ie)
- : CXX::Context (o, root, path, ops, map),
- options (ops),
- counts (counts_),
- any_type (any_type_),
- any_simple_type (any_simple_type_),
- element_type (element_type_),
- container (container_),
- flags_type (flags_type_),
- qname_type (qname_type_),
- xs_string_type (xs_string_type_),
- properties_type (properties_type_),
- error_handler_type (error_handler_type_),
- list_stream_type (list_stream_type_),
- namespace_infomap_type (namespace_infomap_type_),
- parser_type (parser_type_),
- std_ostream_type (std_ostream_type_),
- ostream_type (ostream_type_),
- istream_type (istream_type_),
- xerces_ns (xerces_ns_),
- dom_auto_ptr (dom_auto_ptr_),
- dom_node_key (dom_node_key_),
- as_double_type (as_double_type_),
- as_decimal_type (as_decimal_type_),
- generate_xml_schema (generate_xml_schema_),
- doxygen (doxygen_),
- polymorphic (ops.generate_polymorphic ()),
- polymorphic_all (ops.polymorphic_type_all ()),
- poly_plate (ops.polymorphic_plate ()),
- detach (ops.generate_detach ()),
- fwd_expr (fe),
- hxx_expr (he),
- ixx_expr (ie),
- ns_scope (ns_scope_),
- regex_custom_type_map (regex_custom_type_map_),
- direct_custom_type_map (direct_custom_type_map_),
- qname_type_ (L"::xsd::cxx::xml::qualified_name< " + char_type + L" >"),
- parser_type_ (L"::xsd::cxx::xml::dom::parser< " + char_type + L" >"),
- generate_xml_schema_ (generate_xml_schema__),
- doxygen_ (ops.generate_doxygen ()),
- ns_scope_stack (ns_scope_stack_),
- cxx_uq_id_expr_ (L"^[a-zA-Z_]\\w*$"),
- cxx_uq_id_expr (cxx_uq_id_expr_)
- {
- SemanticGraph::Namespace& xs (xs_ns ());
- SemanticGraph::Context& xsc (xs.context ());
-
- // Cache some often-used names from the XML Schema namespace
- // if names have already been processed.
- //
- if (xsc.count ("container"))
- {
- String xs_name (ns_name (xs));
-
- any_type = fq_name (xs.find ("anyType").first->named ());
- any_simple_type = fq_name (xs.find ("anySimpleType").first->named ());
- xs_string_type = fq_name (xs.find ("string").first->named ());
-
- container = xs_name + L"::" + xsc.get<String> ("container");
- flags_type = xs_name + L"::" + xsc.get<String> ("flags");
-
- if (ops.generate_element_type ())
- element_type = xs_name + L"::" + xsc.get<String> ("element-type");
-
- properties_type = xs_name + L"::" + xsc.get<String> ("properties");
-
- if (!ops.suppress_parsing () || ops.generate_serialization ())
- {
- error_handler_type = xs_name + L"::" +
- xsc.get<String> ("error-handler");
- }
-
- dom_auto_ptr_ = xs_name + (std >= cxx_version::cxx11
- ? L"::dom::unique_ptr"
- : L"::dom::auto_ptr");
-
- dom_node_key_ = xs_name + L"::dom::" +
- xsc.get<String> ("tree-node-key");
-
- if (ops.generate_serialization ())
- {
- as_double_type_ = xs_name + L"::" +
- xsc.get<String> ("as-double");
-
- as_decimal_type_ = xs_name + L"::" +
- xsc.get<String> ("as-decimal");
-
- list_stream_type = xs_name + L"::" +
- xsc.get<String> ("list-stream");
-
- namespace_infomap_type = xs_name + L"::" +
- xsc.get<String> ("namespace-infomap");
- }
-
- // istream and ostream are templates and for now use the same
- // names regardless of the naming convention.
- //
- if (!ops.generate_extraction ().empty ())
- istream_type = xs_name + L"::istream";
-
- if (!ops.generate_insertion ().empty ())
- ostream_type = xs_name + L"::ostream";
- }
-
- // Xerces-C++ namespace. IntelliSense for some reason does not like
- // it fully-qualified (maybe because it's a namespace alias).
- //
- if (ops.generate_intellisense ())
- xerces_ns = "xercesc";
- else
- xerces_ns = "::xercesc";
-
- //
- //
- if (char_type == L"char")
- std_ostream_type_ = L"::std::ostream";
- else if (char_type == L"wchar_t")
- std_ostream_type_ = L"::std::wostream";
- else
- std_ostream_type_ = L"::std::basic_ostream< " + char_type + L" >";
-
- // Custom type mapping.
- //
-
- // Direct custom type mapping.
- //
- {
- NarrowStrings const& v (ops.custom_type ());
-
- for (NarrowStrings::const_iterator i (v.begin ()),
- e (v.end ()); i != e; ++i)
- {
- String s (*i);
-
- if (s.empty ())
- throw InvalidCustomTypeMapping (s, "mapping string is empty");
-
- // Split the string in two parts at the last '='.
- //
- size_t pos (s.rfind ('='));
-
- // If no delimiter found then both type and base are empty.
- //
- if (pos == String::npos)
- {
- direct_custom_type_map[s].type.clear ();
- direct_custom_type_map[s].base.clear ();
- continue;
- }
-
- String name (s, 0, pos);
- String rest (s, pos + 1);
-
- // See if we've got the base part after '/'.
- //
- pos = rest.rfind ('/');
-
- String type, base;
-
- if (pos != String::npos)
- {
- type.assign (rest, 0, pos);
- base.assign (rest, pos + 1, String::npos);
- }
- else
- type = rest;
-
- // type can be a potentially-qualified template-id. base is
- // an unqualified C++ name.
- //
-
- if (!base.empty () && !cxx_uq_id_expr.match (base))
- throw InvalidCustomTypeMapping (s, "invalid C++ identifier");
-
- direct_custom_type_map[name].type = type;
- direct_custom_type_map[name].base = base;
- }
- }
-
- // Regex custom type mapping.
- //
- {
- NarrowStrings const& v (ops.custom_type_regex ());
-
- for (NarrowStrings::const_iterator i (v.begin ()),
- e (v.end ()); i != e; ++i)
- {
- String s (*i);
-
- if (s.empty ())
- throw InvalidCustomTypeMapping (s, "mapping string is empty");
-
- wchar_t delimiter (s[0]);
-
- // First get pattern.
- //
- size_t pos (s.find (delimiter, 1));
-
- if (pos == String::npos)
- throw InvalidCustomTypeMapping (
- s, "missing pattern-substitution separator");
-
- String pat (s, 1, pos - 1);
- String rest (s, pos + 1);
-
- String type, base;
-
- // See if we've got type and base.
- //
- if (!rest.empty ())
- {
- pos = rest.find (delimiter);
-
- if (pos == String::npos)
- throw InvalidCustomTypeMapping (
- s, "missing pattern-substitution separator");
-
- type.assign (rest, 0, pos);
- rest = String (rest, pos + 1);
-
- if (!rest.empty ())
- {
- pos = rest.find (delimiter);
-
- if (pos == String::npos)
- throw InvalidCustomTypeMapping (
- s, "missing pattern-substitution separator");
-
- base.assign (rest, 0, pos);
- rest = String (rest, pos + 1);
-
- if (!rest.empty ())
- throw InvalidCustomTypeMapping (s, "invalid format");
- }
- }
-
- regex_custom_type_map.push_back (
- RegexCustomTypeMapInfo (WideRegexPat (pat), type, base));
- }
- }
- }
-
- Context::
- Context (Context& c)
- : CXX::Context (c),
- options (c.options),
- counts (c.counts),
- any_type (c.any_type),
- any_simple_type (c.any_simple_type),
- element_type (c.element_type),
- container (c.container),
- flags_type (c.flags_type),
- qname_type (c.qname_type),
- xs_string_type (c.xs_string_type),
- properties_type (c.properties_type),
- error_handler_type (c.error_handler_type),
- list_stream_type (c.list_stream_type),
- namespace_infomap_type (c.namespace_infomap_type),
- parser_type (c.parser_type),
- std_ostream_type (c.std_ostream_type),
- ostream_type (c.ostream_type),
- istream_type (c.istream_type),
- xerces_ns (c.xerces_ns),
- dom_auto_ptr (c.dom_auto_ptr),
- dom_node_key (c.dom_node_key),
- as_double_type (c.as_double_type),
- as_decimal_type (c.as_decimal_type),
- generate_xml_schema (c.generate_xml_schema),
- doxygen (c.doxygen),
- polymorphic (c.polymorphic),
- polymorphic_all (c.polymorphic_all),
- poly_plate (c.poly_plate),
- detach (c.detach),
- fwd_expr (c.fwd_expr),
- hxx_expr (c.hxx_expr),
- ixx_expr (c.ixx_expr),
- ns_scope (c.ns_scope),
- regex_custom_type_map (c.regex_custom_type_map),
- direct_custom_type_map (c.direct_custom_type_map),
- ns_scope_stack (c.ns_scope_stack),
- cxx_uq_id_expr (c.cxx_uq_id_expr)
- {
- }
-
- Context::
- Context (Context& c, std::wostream& o)
- : CXX::Context (c, o),
- options (c.options),
- counts (c.counts),
- any_type (c.any_type),
- any_simple_type (c.any_simple_type),
- element_type (c.element_type),
- container (c.container),
- flags_type (c.flags_type),
- qname_type (c.qname_type),
- xs_string_type (c.xs_string_type),
- properties_type (c.properties_type),
- error_handler_type (c.error_handler_type),
- list_stream_type (c.list_stream_type),
- namespace_infomap_type (c.namespace_infomap_type),
- parser_type (c.parser_type),
- std_ostream_type (c.std_ostream_type),
- ostream_type (c.ostream_type),
- istream_type (c.istream_type),
- xerces_ns (c.xerces_ns),
- dom_auto_ptr (c.dom_auto_ptr),
- dom_node_key (c.dom_node_key),
- as_double_type (c.as_double_type),
- as_decimal_type (c.as_decimal_type),
- generate_xml_schema (c.generate_xml_schema),
- doxygen (c.doxygen),
- polymorphic (c.polymorphic),
- polymorphic_all (c.polymorphic_all),
- poly_plate (c.poly_plate),
- detach (c.detach),
- fwd_expr (c.fwd_expr),
- hxx_expr (c.hxx_expr),
- ixx_expr (c.ixx_expr),
- ns_scope (c.ns_scope),
- regex_custom_type_map (c.regex_custom_type_map),
- direct_custom_type_map (c.direct_custom_type_map),
- ns_scope_stack (c.ns_scope_stack),
- cxx_uq_id_expr (c.cxx_uq_id_expr)
- {
- }
-
- void Context::
- update_ns_scope ()
- {
- ns_scope.clear ();
-
- bool first (true);
-
- for (NamespaceStack::iterator i (ns_scope_stack.begin ());
- i != ns_scope_stack.end ();
- ++i)
- {
- // We only qualify names until the namespace level.
- //
- if (first)
- first = false;
- else
- ns_scope += L"::";
-
- ns_scope += *i;
- }
- }
-
- bool Context::
- custom_type (SemanticGraph::Type const& t, String& r) const
- {
- String const& name (t.name ());
-
- // First search the direct mapping.
- //
- {
- DirectCustomTypeMap::const_iterator i (
- direct_custom_type_map.find (name));
-
- if (i != direct_custom_type_map.end ())
- {
- r = i->second.type;
- return true;
- }
- }
-
-
- // Second search the regex mapping.
- //
- for (RegexCustomTypeMap::const_iterator
- i (regex_custom_type_map.begin ()),
- e (regex_custom_type_map.end ());
- i != e; ++i)
- {
- if (i->pat.match (name))
- {
- // Empty type sub tells us to use the original name.
- //
- if (i->type_sub.empty ())
- {
- r.clear ();
- return true;
- }
-
- r = i->pat.replace (name, i->type_sub);
- return true;
- }
- }
-
- return false;
- }
-
- String Context::
- custom_type (SemanticGraph::Type const& t) const
- {
- String r;
- if (custom_type (t, r))
- {
- // Empty type name tells us to use the original name.
- //
- if (r.empty ())
- r = ename (t);
- }
-
- return r;
- }
-
- bool Context::
- renamed_type (SemanticGraph::Type const& t, String& r) const
- {
- String const& name (t.name ());
-
- // First search the direct mapping.
- //
- {
- DirectCustomTypeMap::const_iterator i (
- direct_custom_type_map.find (name));
-
- if (i != direct_custom_type_map.end ())
- {
- r = i->second.base;
- return true;
- }
- }
-
-
- // Second search the regex mapping.
- //
- for (RegexCustomTypeMap::const_iterator
- i (regex_custom_type_map.begin ()),
- e (regex_custom_type_map.end ());
- i != e; ++i)
- {
- if (i->pat.match (name))
- {
- if (!i->base_sub.empty ())
- {
- r = i->pat.replace (name, i->base_sub);
- }
- else
- r.clear ();
-
- return true;
- }
- }
-
- return false;
- }
-
- void Context::
- write_annotation (SemanticGraph::Annotation& a)
- {
- String const& doc (a.documentation ());
- wchar_t const* s (doc.c_str ());
- size_t size (doc.size ());
-
- // Remove leading and trailing whitespaces.
- //
- while (*s == wchar_t (0x20) || *s == wchar_t (0x0A) ||
- *s == wchar_t (0x0D) || *s == wchar_t (0x09))
- {
- s++;
- size--;
- }
-
- if (size != 0)
- {
- wchar_t const* e (s + size - 1);
-
- while (e > s &&
- (*e == wchar_t (0x20) || *e == wchar_t (0x0A) ||
- *e == wchar_t (0x0D) || *e == wchar_t (0x09)))
- --e;
-
- size = s <= e ? e - s + 1 : 0;
- }
-
- if (size != 0)
- {
- os << " * ";
-
- // Go over the data, forcing newline after 80 chars and adding
- // ' * ' after each new line.
- //
- wchar_t const* last_space (0);
- wchar_t const* b (s);
- wchar_t const* e (s);
- bool after_newline (false);
- bool rogue (false);
-
- for (; e < s + size; ++e)
- {
- unsigned int u (unicode_char (e)); // May advance e.
-
- // We are going to treat \v and \f as rogue here even though
- // they can be present in C++ source code.
- //
- if (u > 127 || (u < 32 && u != '\t' && u != '\n'))
- rogue = true;
-
- if (u == ' ' || u == '\t')
- {
- if (after_newline)
- {
- if (e == b)
- b++; // Skip leading spaces after newline.
-
- continue;
- }
- else
- last_space = e;
- }
- else if (after_newline)
- {
- os << " * ";
- after_newline = false;
- }
-
- if (u == '\n')
- {
- write_rogue_text (b, e - b + 1, rogue);
-
- b = e + 1;
- last_space = 0;
- after_newline = true;
- rogue = false;
- continue;
- }
-
- if (e - b >= 70 && last_space != 0)
- {
- write_rogue_text (b, last_space - b, rogue);
- os << endl;
-
- b = last_space + 1;
- last_space = 0;
- after_newline = true;
- // Cannot reset rogue since we don't output the whole string.
- }
- }
-
- if (e != b)
- write_rogue_text (b, e - b, rogue);
-
- if (!after_newline)
- os << endl;
- }
- }
-
- void Context::
- write_rogue_text (wchar_t const* s, size_t size, bool rogue)
- {
- if (!rogue)
- os.write (s, size);
- else
- {
- for (wchar_t const* p (s); p < s + size; ++p)
- {
- unsigned int u (unicode_char (p)); // May advance p.
-
- // We are going to treat \v and \f as rogue here even though
- // they can be present in C++ source code.
- //
- if (u > 127 || (u < 32 && u != '\t' && u != '\n'))
- os.put ('?');
- else
- os.put (static_cast<wchar_t> (u));
- }
- }
- }
-
- bool Context::
- polymorphic_p (SemanticGraph::Type& t)
- {
- // IDREF templates cannot be polymorphic.
- //
- if (!t.named_p () &&
- (t.is_a<SemanticGraph::Fundamental::IdRef> () ||
- t.is_a<SemanticGraph::Fundamental::IdRefs> ()))
- return false;
-
- if (polymorphic_all)
- {
- bool fund (false);
- IsFundamentalType test (fund);
- test.dispatch (t);
- return !fund;
- }
- else
- return t.context ().get<bool> ("polymorphic");
- }
-
- bool Context::
- anonymous_substitutes_p (SemanticGraph::Type& t)
- {
- // IDREF templates cannot match.
- //
- if (!t.named_p () &&
- (t.is_a<SemanticGraph::Fundamental::IdRef> () ||
- t.is_a<SemanticGraph::Fundamental::IdRefs> ()))
- return false;
-
- // See which elements this type classifies.
- //
- for (SemanticGraph::Type::ClassifiesIterator i (t.classifies_begin ()),
- e (t.classifies_end ()); i != e; ++i)
- {
- if (SemanticGraph::Element* e =
- dynamic_cast<SemanticGraph::Element*> (&i->instance ()))
- {
- if (e->substitutes_p ())
- return true;
- }
- }
-
- return false;
- }
-
- // GenerateDefautCtor
- //
- GenerateDefaultCtor::
- GenerateDefaultCtor (Context& c, bool& generate, bool no_base)
- : Context (c), generate_ (generate), no_base_ (no_base)
- {
- *this >> inherits_ >> *this;
- *this >> names_ >> *this;
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Complex& c)
- {
- // Make sure we figure out if we have any required members before
- // we base our decision on the base type.
- //
- Complex::names (c, names_);
-
- if (!generate_)
- Complex::inherits (c, inherits_);
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Type&)
- {
- if (!no_base_)
- generate_ = true;
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Enumeration&)
- {
- if (!no_base_)
- generate_ = true;
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Element& e)
- {
- if (!skip (e) && min (e) == 1 && max (e) == 1)
- generate_ = true;
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Attribute& a)
- {
- if (min (a) == 1 && !a.fixed_p ())
- generate_ = true;
- }
-
- void GenerateDefaultCtor::
- traverse (SemanticGraph::Any& a)
- {
- if (options.generate_wildcard () &&
- min (a) == 1 && max (a) == 1)
- generate_ = true;
- }
-
-
- // GenerateFromBaseCtor
- //
- GenerateFromBaseCtor::
- GenerateFromBaseCtor (Context& c, bool& generate)
- : generate_ (generate),
- custom_ (false),
- traverser_ (c, generate, custom_)
- {
- inherits_ >> traverser_;
- }
-
- void GenerateFromBaseCtor::
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
-
- if (!generate_ && custom_)
- {
- // We have a customized type in the hierarchy. In this case we
- // want to generate the c-tor unless base and ultimate-base are
- // the same (see CtorArgs).
- //
- SemanticGraph::Type& b (c.inherits ().base ());
- generate_ = b.is_a<SemanticGraph::Complex> () &&
- !b.is_a<SemanticGraph::Enumeration> ();
- }
- }
-
- GenerateFromBaseCtor::Traverser::
- Traverser (Context& c, bool& generate, bool& custom)
- : Context (c), generate_ (generate), custom_ (custom)
- {
- *this >> inherits_ >> *this;
- *this >> names_ >> *this;
- }
-
- void GenerateFromBaseCtor::Traverser::
- traverse (SemanticGraph::Type& t)
- {
- if (!custom_)
- {
- String tmp;
- custom_ = custom_type (t, tmp);
- }
- }
-
- void GenerateFromBaseCtor::Traverser::
- traverse (SemanticGraph::Complex& c)
- {
- names (c, names_);
-
- if (!generate_)
- inherits (c, inherits_);
-
- if (!generate_)
- traverse (static_cast<SemanticGraph::Type&> (c));
- }
-
- void GenerateFromBaseCtor::Traverser::
- traverse (SemanticGraph::Element& e)
- {
- if (!skip (e) && min (e) == 1 && max (e) == 1)
- generate_ = true;
- }
-
- void GenerateFromBaseCtor::Traverser::
- traverse (SemanticGraph::Attribute& a)
- {
- if (min (a) == 1 && !a.fixed_p ())
- generate_ = true;
- }
-
- void GenerateFromBaseCtor::Traverser::
- traverse (SemanticGraph::Any& a)
- {
- if (options.generate_wildcard () &&
- min (a) == 1 && max (a) == 1)
- generate_ = true;
- }
-
- // HasComplexNonOptArgs
- //
- HasComplexPolyNonOptArgs::
- HasComplexPolyNonOptArgs (Context& c,
- bool base,
- bool& complex,
- bool& poly,
- bool& clash)
- : Context (c),
- complex_ (complex),
- poly_ (poly),
- clash_ (clash)
- {
- if (base)
- *this >> inherits_ >> *this;
-
- *this >> names_ >> *this;
- }
-
- void HasComplexPolyNonOptArgs::
- traverse (SemanticGraph::Complex& c)
- {
- // No optimizations: need to check every arg for clashes.
- //
- inherits (c, inherits_);
- names (c, names_);
- }
-
- void HasComplexPolyNonOptArgs::
- traverse (SemanticGraph::Element& e)
- {
- if (!skip (e) && min (e) == 1 && max (e) == 1)
- {
- bool poly (polymorphic && polymorphic_p (e.type ()));
-
- bool simple (true);
- IsSimpleType t (simple);
- t.dispatch (e.type ());
-
- if (poly)
- poly_ = true;
-
- if (!simple)
- complex_ = true;
-
- if (poly && simple)
- clash_ = false;
- }
- }
-
- // FromBaseCtorArg
- //
- FromBaseCtorArg::
- FromBaseCtorArg (Context& c, CtorArgType at, bool arg)
- : Context (c), arg_type_ (at), arg_ (arg)
- {
- }
-
- void FromBaseCtorArg::
- traverse (SemanticGraph::Any& a)
- {
- if (!options.generate_wildcard ())
- return;
-
- if (min (a) == 1 && max (a) == 1)
- {
- String const& name (ename (a));
-
- os << "," << endl
- << "const " << xerces_ns << "::DOMElement&";
-
- if (arg_)
- os << " " << name;
- }
- }
-
- void FromBaseCtorArg::
- traverse (SemanticGraph::Element& e)
- {
- if (skip (e))
- return;
-
- if (min (e) == 1 && max (e) == 1)
- {
- String const& name (ename (e));
-
- os << "," << endl;
-
- bool ptr (false);
-
- switch (arg_type_)
- {
- case CtorArgType::complex_auto_ptr:
- {
- bool simple (true);
- IsSimpleType t (simple);
- t.dispatch (e.type ());
- ptr = !simple;
- break;
- }
- case CtorArgType::poly_auto_ptr:
- {
- ptr = polymorphic && polymorphic_p (e.type ());
- break;
- }
- case CtorArgType::type:
- break;
- }
-
- if (ptr)
- os << auto_ptr << "< " << etype (e) << " >";
- else
- os << "const " << etype (e) << "&";
-
- if (arg_)
- os << " " << name;
- }
- }
-
- void FromBaseCtorArg::
- traverse (SemanticGraph::Attribute& a)
- {
- // Note that we are not going to include attributes with
- // default or required fixed values here. Instead we are
- // going to default-initialize them.
- //
- if (min (a) == 1 && !a.fixed_p ())
- {
- String const& name (ename (a));
-
- os << "," << endl
- << "const " << etype (a) << "&";
-
- if (arg_)
- os << " " << name;
- }
- }
-
- // CtorArgs
- //
- CtorArgs::
- CtorArgs (Context& c, CtorArgType at)
- : Context (c),
- arg_type_ (at),
- base_arg_ (0),
- first_ (true),
- member_name_ (c)
- {
- *this >> inherits_ >> *this;
- *this >> names_ >> *this;
- }
-
- CtorArgs::
- CtorArgs (Context& c, CtorArgType at, String& base_arg)
- : Context (c),
- arg_type_ (at),
- base_arg_ (&base_arg),
- first_ (true),
- member_name_ (c)
- {
- *this >> inherits_ >> *this;
- *this >> names_ >> *this;
- }
-
- void CtorArgs::
- traverse (SemanticGraph::Type& t)
- {
- os << comma () << "const ";
-
- member_name_.dispatch (t);
-
- os << "&";
-
- if (base_arg_ != 0)
- {
- // IDREF templates don't have a name.
- //
- *base_arg_ = t.named_p ()
- ? (L"_xsd_" + ename (t) + L"_base")
- : L"_xsd_base";
-
- os << " " << *base_arg_;
- }
- }
-
- void CtorArgs::
- traverse (SemanticGraph::Enumeration& e)
- {
- os << comma () << "const ";
-
- member_name_.traverse (e);
-
- os << "&";
-
- if (base_arg_ != 0)
- {
- *base_arg_ = L"_xsd_" + ename (e) + L"_base";
-
- os << " " << *base_arg_;
- }
- }
-
- void CtorArgs::
- traverse (SemanticGraph::Any& a)
- {
- if (!options.generate_wildcard ())
- return;
-
- if (min (a) == 1 && max (a) == 1)
- {
- os << comma () << "const " << xerces_ns << "::DOMElement&";
-
- if (base_arg_ != 0)
- os << " " << ename (a);
- }
- }
-
- void CtorArgs::
- traverse (SemanticGraph::Element& e)
- {
- if (skip (e))
- return;
-
- if (min (e) == 1 && max (e) == 1)
- {
- bool ptr (false);
-
- switch (arg_type_)
- {
- case CtorArgType::complex_auto_ptr:
- {
- bool simple (true);
- IsSimpleType t (simple);
- t.dispatch (e.type ());
- ptr = !simple;
- break;
- }
- case CtorArgType::poly_auto_ptr:
- {
- ptr = polymorphic && polymorphic_p (e.type ());
- break;
- }
- case CtorArgType::type:
- break;
- }
-
- if (ptr)
- os << comma () << auto_ptr << "< " << etype (e) << " >";
- else
- os << comma () << "const " << etype (e) << "&";
-
- if (base_arg_ != 0)
- os << " " << ename (e);
- }
- }
-
- void CtorArgs::
- traverse (SemanticGraph::Attribute& a)
- {
- // Note that we are not going to include attributes with
- // default or required fixed values here. Instead we are
- // going to default-initialize them.
- //
- if (min (a) == 1 && !a.fixed_p ())
- {
- os << comma () << "const " << etype (a) << "&";
-
- if (base_arg_ != 0)
- os << " " << ename (a);
- }
- }
-
- String CtorArgs::
- comma ()
- {
- bool tmp (first_);
- first_ = false;
- return tmp ? "" : ",\n";
- }
-
-
- // CtorArgsWithoutBase
- //
- CtorArgsWithoutBase::
- CtorArgsWithoutBase (Context& c, CtorArgType at, bool arg, bool first)
- : Context (c), arg_type_ (at), arg_ (arg), first_ (first)
- {
- *this >> inherits_ >> *this;
- *this >> names_ >> *this;
- }
-
- void CtorArgsWithoutBase::
- traverse (SemanticGraph::Any& a)
- {
- if (!options.generate_wildcard ())
- return;
-
- if (min (a) == 1 && max (a) == 1)
- {
- os << comma () << "const " << xerces_ns << "::DOMElement&";
-
- if (arg_)
- os << " " << ename (a);
- }
- }
-
- void CtorArgsWithoutBase::
- traverse (SemanticGraph::Element& e)
- {
- if (skip (e))
- return;
-
- if (min (e) == 1 && max (e) == 1)
- {
- bool ptr (false);
-
- switch (arg_type_)
- {
- case CtorArgType::complex_auto_ptr:
- {
- bool simple (true);
- IsSimpleType t (simple);
- t.dispatch (e.type ());
- ptr = !simple;
- break;
- }
- case CtorArgType::poly_auto_ptr:
- {
- ptr = polymorphic && polymorphic_p (e.type ());
- break;
- }
- case CtorArgType::type:
- break;
- }
-
- if (ptr)
- os << comma () << auto_ptr << "< " << etype (e) << " >";
- else
- os << comma () << "const " << etype (e) << "&";
-
- if (arg_)
- os << " " << ename (e);
- }
- }
-
- void CtorArgsWithoutBase::
- traverse (SemanticGraph::Attribute& a)
- {
- // Note that we are not going to include attributes with
- // default or required fixed values here. Instead we are
- // going to default-initialize them.
- //
- if (min (a) == 1 && !a.fixed_p ())
- {
- os << comma () << "const " << etype (a) << "&";
-
- if (arg_)
- os << " " << ename (a);
- }
- }
-
- String CtorArgsWithoutBase::
- comma ()
- {
- bool tmp (first_);
- first_ = false;
- return tmp ? "" : ",\n";
- }
-
- // GlobalElementBase
- //
- bool GlobalElementBase::
- generate_p (SemanticGraph::Element& e)
- {
- if (e.substitutes_p () && ctx_.polymorphic)
- return true;
-
- if (!doc_root_p (e))
- return false;
-
- // If we are not generating element types nor parsing/serialization
- // code then we won't generate anything from it.
- //
- if (!ctx_.options.generate_element_type () &&
- ctx_.options.suppress_parsing () &&
- !ctx_.options.generate_serialization ())
- return false;
-
- return true;
- }
-
- bool GlobalElementBase::
- doc_root_p (SemanticGraph::Element& e)
- {
- if (!ctx_.options.root_element_first () &&
- !ctx_.options.root_element_last () &&
- !ctx_.options.root_element_all () &&
- !ctx_.options.root_element_none () &&
- ctx_.options.root_element ().empty ())
- return true; // By default treat them all.
-
- if (ctx_.options.root_element_none ())
- return false;
-
- if (ctx_.options.root_element_all ())
- return true;
-
- if (ctx_.options.root_element_first () &&
- e.context ().count ("first") != 0)
- return true;
-
- if (ctx_.options.root_element_last () &&
- e.context ().count ("last") != 0)
- return true;
-
- NarrowStrings const& names (ctx_.options.root_element ());
-
- // Hopefully nobody will specify more than a handful of names ;-).
- //
- for (NarrowStrings::const_iterator i (names.begin ());
- i != names.end (); ++i)
- {
- String name (*i);
-
- if (e.name () == name)
- return true;
- }
-
- return false;
- }
-
- // Namespace
- //
- Namespace::
- Namespace (Context& c,
- size_t first,
- size_t last)
- : CXX::Namespace (c, *this),
- GlobalElementBase (c),
- ctx_ (c),
- first_ (first),
- last_ (last),
- count_ (0)
- {
- }
-
- void Namespace::
- traverse (Type& ns)
- {
- using SemanticGraph::Element;
-
- if (first_ > last_)
- CXX::Namespace::traverse (ns);
- else
- {
- bool opened (false);
-
- for (Type::NamesIterator i (ns.names_begin ());
- i != ns.names_end (); ++i)
- {
- SemanticGraph::Nameable& n (i->named ());
-
- if (n.is_a<SemanticGraph::Type> () ||
- (n.is_a<Element> () && generate_p (dynamic_cast<Element&> (n))))
- {
- if (count_ >= first_ && count_ <= last_)
- {
- if (!opened)
- {
- opened = true;
- pre (ns);
- }
-
- edge_traverser ().dispatch (*i);
- }
-
- ++count_;
- }
- }
-
- if (opened)
- post (ns);
- }
- }
-
- void Namespace::
- enter (Type&, String const& name, bool)
- {
- ctx_.enter_ns_scope (name);
- }
-
- void Namespace::
- leave ()
- {
- ctx_.leave_ns_scope ();
- }
-
- // Includes
- //
- void TypeForward::
- traverse (SemanticGraph::Type& t)
- {
- String const& name (ename (t));
-
- if (String custom = custom_type (t))
- {
- String new_name;
- renamed_type (t, new_name);
-
- if (new_name)
- os << "class " << new_name << ";";
-
- if (custom == name)
- os << "class " << name << ";";
- else
- os << "typedef " << custom << " " << name << ";";
- }
- else
- os << "class " << name << ";";
- }
-
- void Includes::
- traverse_ (SemanticGraph::Uses& u)
- {
- // Support for weak (forward) inclusion used in the file-per-type
- // compilation model.
- //
- Type t (type_);
- bool weak (u.context ().count ("weak"));
- SemanticGraph::Schema& s (u.schema ());
-
- if (weak && t == header)
- {
- // Generate forward declarations.
- //
- if (forward_)
- t = forward;
- else
- {
- schema_.dispatch (s);
- return;
- }
- }
-
- if (t == source && !weak)
- {
- if (u.user ().context ().count ("type-schema"))
- {
- // Strong include into a type schema -- this is a base class.
- // We have already included its header in our header so it
- // would seem we don't need to do anything here. There is one
- // subtle issue, however: Our constructors include arguments
- // for base members which we simply pass to the base. The base
- // header has only forward declarations for its members. This
- // is not a problem if we pass references to base members --
- // forward declarations are sufficient for this case. The
- // problematic case is when we pass them as auto/unique_ptr.
- // Because we pass them by value (which is done to support
- // unique_ptr move semantics), the compiler needs to be able
- // to destroy the member, presumably if an exception is thrown.
- // And for that forward declarations are not enough.
- //
- // So what we are going to do here is include all the base
- // member headers (transitively), just like the base's source
- // file does.
- //
- // Note that we only do this for source since in the inline
- // case the necessary files are already pulled via the the
- // .ixx file includes.
- //
- Traversal::Schema schema;
- schema >> *this;
- schema.dispatch (s);
- }
-
- return;
- }
-
- SemanticGraph::Path path (
- s.context ().count ("renamed")
- ? s.context ().get<SemanticGraph::Path> ("renamed")
- : u.path ());
- path.normalize ();
-
- // Try to use the portable representation of the path. If that
- // fails, fall back to the native representation.
- //
- NarrowString path_str;
- try
- {
- path_str = path.posix_string ();
- }
- catch (SemanticGraph::InvalidPath const&)
- {
- path_str = path.string ();
- }
-
- String inc_path;
-
- switch (t)
- {
- case forward:
- {
- inc_path = ctx_.fwd_expr->replace (path_str);
- break;
- }
- case header:
- case source:
- {
- inc_path = ctx_.hxx_expr->replace (path_str);
- break;
- }
- case inline_:
- {
- if (weak)
- {
- inc_path = ctx_.hxx_expr->replace (path_str);
- ctx_.os << "#include " << ctx_.process_include_path (inc_path)
- << endl;
- }
-
- inc_path = ctx_.ixx_expr->replace (path_str);
- break;
- }
- }
-
- ctx_.os << "#include " << ctx_.process_include_path (inc_path) << endl
- << endl;
- }
- }
-}
diff --git a/xsd/cxx/tree/elements.hxx b/xsd/cxx/tree/elements.hxx
deleted file mode 100644
index 57c3075..0000000
--- a/xsd/cxx/tree/elements.hxx
+++ /dev/null
@@ -1,2118 +0,0 @@
-// file : xsd/cxx/tree/elements.hxx
-// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
-
-#ifndef CXX_TREE_ELEMENTS_HXX
-#define CXX_TREE_ELEMENTS_HXX
-
-#include <map>
-#include <set>
-#include <deque>
-#include <vector>
-#include <sstream>
-
-#include <cutl/re.hxx>
-
-#include <types.hxx>
-
-#include <cxx/elements.hxx>
-
-#include <cxx/tree/options.hxx>
-
-namespace CXX
-{
- namespace Tree
- {
- struct Counts
- {
- Counts ()
- : global_types (0),
- global_elements (0),
- generated_global_elements (0),
- complexity_total (0)
- {
- }
-
- size_t global_types;
- size_t global_elements;
- size_t generated_global_elements;
-
- // Complexity value for each global type and generated global
- // element, in order.
- //
- std::vector<size_t> complexity;
- size_t complexity_total;
- };
-
- struct InvalidCustomTypeMapping
- {
- InvalidCustomTypeMapping (String const& mapping,
- String const& reason)
- : mapping_ (mapping), reason_ (reason)
- {
- }
-
- String const&
- mapping () const
- {
- return mapping_;
- }
-
- String const&
- reason () const
- {
- return reason_;
- }
-
- private:
- String mapping_;
- String reason_;
- };
-
- // A set of potentially qualified XML Schema type names.
- //
- struct TypeNameSet
- {
- template <typename I>
- TypeNameSet (I begin, I end)
- {
- for (; begin != end; ++begin)
- insert (*begin);
- }
-
- void
- insert (String const& name)
- {
- size_t p (name.rfind ('#'));
-
- if (p == String::npos)
- unames_.insert (name);
- else
- qnames_.insert (name);
- }
-
- bool
- find (SemanticGraph::Type& t)
- {
- if (!unames_.empty ())
- {
- if (unames_.find (t.name ()) != unames_.end ())
- return true;
- }
-
- if (!qnames_.empty ())
- {
- if (qnames_.find (t.scope ().name () + L"#" + t.name ()) !=
- qnames_.end ())
- return true;
- }
-
- return false;
- }
-
- private:
- typedef std::set<String> StringSet;
-
- StringSet unames_;
- StringSet qnames_;
- };
-
- //
- //
- class Context: public CXX::Context
- {
- public:
- typedef cutl::re::regexsub Regex;
- typedef cutl::re::wregex WideRegexPat;
-
- typedef Tree::options options_type;
-
- struct DirectCustomTypeMapInfo
- {
- DirectCustomTypeMapInfo (String const& t = L"",
- String const& b = L"")
- : type (t), base (b)
- {
- }
-
- String type;
- String base;
- };
-
- struct RegexCustomTypeMapInfo
- {
- RegexCustomTypeMapInfo (WideRegexPat const& p,
- String const& t,
- String const& b)
- : pat (p), type_sub (t), base_sub (b)
- {
- }
-
- WideRegexPat pat;
- String type_sub;
- String base_sub;
- };
-
- typedef std::vector<RegexCustomTypeMapInfo> RegexCustomTypeMap;
- typedef std::map<String, DirectCustomTypeMapInfo> DirectCustomTypeMap;
-
- public:
- Context (std::wostream& o,
- SemanticGraph::Schema& root,
- SemanticGraph::Path const& path,
- options_type const& ops,
- Counts const& counts_,
- bool generate_xml_schema,
- StringLiteralMap const*,
- Regex const* fwd_expr,
- Regex const* hxx_expr,
- Regex const* ixx_expr);
-
- protected:
- Context (Context& c);
- Context (Context& c, std::wostream& o);
-
- // Custom type mapping.
- //
- public:
- // Returns empty string if custom mapping is not required.
- //
- String
- custom_type (SemanticGraph::Type const&) const;
-
- // Returns true if custom mapping is required. name is
- // populated with the custom type name or empty if the
- // original name should be used.
- //
- bool
- custom_type (SemanticGraph::Type const&, String& name) const;
-
- // Returns true if this type has been renamed as part of the
- // customization process. If the function returns true, the
- // name string is populated with the new name or empty if
- // the type should not be generated at all.
- //
- bool
- renamed_type (SemanticGraph::Type const&, String& name) const;
-
- public:
- // Performs a number of processing steps, including forcing a new
- // line after 80 characters as well as "commentizing" the text by
- // adding '* ' after each newline.
- //
- void
- write_annotation (SemanticGraph::Annotation&);
-
- //
- //
- public:
- static bool
- ordered_p (SemanticGraph::Type const& t)
- {
- return t.context ().count ("ordered") &&
- t.context ().get<bool> ("ordered");
- }
-
- // Check if we are generating mixed support for this type. We only
- // do it for ordered types.
- //
- static bool
- mixed_p (SemanticGraph::Complex const& c)
- {
- return c.mixed_p () && ordered_p (c);
- }
-
- bool
- polymorphic_p (SemanticGraph::Type&);
-
- bool
- anonymous_p (SemanticGraph::Type const& t)
- {
- return t.context ().count ("anonymous");
- }
-
- // Return true if this anonymous type is defined in an element
- // that belongs to a substitution group.
- //
- bool
- anonymous_substitutes_p (SemanticGraph::Type&);
-
- // Escaped names.
- //
- public:
- // Accessor name.
- //
- static String const&
- eaname (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("aname");
- }
-
- static String const&
- eaname (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("aname");
- }
-
- static String const&
- eaname (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("aname");
- }
-
- // Modifier name.
- //
- static String const&
- emname (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("mname");
- }
-
- static String const&
- emname (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("mname");
- }
-
- static String const&
- emname (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("mname");
- }
-
- // Detach name.
- //
- static String const&
- edname (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("dname");
- }
-
- //
- //
- static String const&
- etype (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("type");
- }
-
- static String const&
- etraits (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("traits");
- }
-
- static String const&
- econtainer (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("container");
- }
-
- static String const&
- econtainer (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("container");
- }
-
- static String const&
- econtainer (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("container");
- }
-
- static String const&
- eiterator (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("iterator");
- }
-
- static String const&
- eiterator (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("iterator");
- }
-
- static String const&
- eiterator (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("iterator");
- }
-
- static String const&
- econst_iterator (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("const-iterator");
- }
-
- static String const&
- econst_iterator (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("const-iterator");
- }
-
- static String const&
- econst_iterator (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("const-iterator");
- }
-
- static String const&
- emember (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("member");
- }
-
- static String const&
- emember (SemanticGraph::Any const& a)
- {
- return a.context ().get<String> ("member");
- }
-
- static String const&
- emember (SemanticGraph::AnyAttribute const& a)
- {
- return a.context ().get<String> ("member");
- }
-
- static String const&
- edefault_value (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("default-value");
- }
-
- static String const&
- edefault_value_member (SemanticGraph::Member const& m)
- {
- return m.context ().get<String> ("default-value-member");
- }
-
- // Underlying enum value type.
- //
- static String const&
- evalue (SemanticGraph::Enumeration const& e)
- {
- return e.context ().get<String> ("value");
- }
-
- // dom_document
- //
- static bool
- edom_document_p (SemanticGraph::Complex const& c)
- {
- return c.context ().count ("dom-document");
- }
-
- static String const&
- edom_document (SemanticGraph::Complex const& c)
- {
- return c.context ().get<String> ("dom-document");
- }
-
- static bool
- edom_document_member_p (SemanticGraph::Complex const& c)
- {
- return c.context ().count ("dom-document-member");
- }
-
- static String const&
- edom_document_member (SemanticGraph::Complex const& c)
- {
- return c.context ().get<String> ("dom-document-member");
- }
-
- // Parsing and serialization function names.
- //
- static String const&
- eparser (SemanticGraph::Element const& e)
- {
- return e.context ().get<String> ("parser");
- }
-
- static String const&
- eserializer (SemanticGraph::Element const& e)
- {
- return e.context ().get<String> ("serializer");
- }
-
- public:
- void
- enter_ns_scope (String const& name)
- {
- ns_scope_stack.push_back (name);
- update_ns_scope ();
- }
-
- void
- leave_ns_scope ()
- {
- ns_scope_stack.pop_back ();
- update_ns_scope ();
- }
-
- private:
- void
- update_ns_scope ();
-
- private:
- // Write text that may contain characters that we will have
- // to escape (indicated by the rogue flag).
- //
- void
- write_rogue_text (wchar_t const* s, size_t size, bool rogue);
-
- public:
- options_type const& options;
- Counts const& counts;
- String& any_type;
- String& any_simple_type;
- String& element_type;
- String& container;
- String& flags_type;
- String& qname_type;
- String& xs_string_type;
- String& properties_type;
- String& error_handler_type;
- String& list_stream_type;
- String& namespace_infomap_type;
- String& parser_type;
- String& std_ostream_type;
- String& ostream_type;
- String& istream_type;
- String& xerces_ns;
- String& dom_auto_ptr;
- String& dom_node_key;
- String& as_double_type;
- String& as_decimal_type;
-
- bool& generate_xml_schema;
- bool& doxygen;
- bool polymorphic;
- bool polymorphic_all;
- unsigned long poly_plate;
- bool detach;
-
- Regex const* fwd_expr;
- Regex const* hxx_expr;
- Regex const* ixx_expr;
-
- String& ns_scope;
-
- RegexCustomTypeMap& regex_custom_type_map;
- DirectCustomTypeMap& direct_custom_type_map;
-
- private:
- String any_type_;
- String any_simple_type_;
- String element_type_;
- String container_;
- String flags_type_;
- String qname_type_;
- String xs_string_type_;
- String properties_type_;
- String error_handler_type_;
- String list_stream_type_;
- String namespace_infomap_type_;
- String parser_type_;
- String std_ostream_type_;
- String ostream_type_;
- String istream_type_;
- String xerces_ns_;
- String dom_auto_ptr_;
- String dom_node_key_;
- String as_double_type_;
- String as_decimal_type_;
-
- bool generate_xml_schema_;
- bool doxygen_;
-
- typedef std::deque<String> NamespaceStack;
- typedef std::deque<String> ScopeStack;
-
- String ns_scope_;
-
- NamespaceStack& ns_scope_stack;
- NamespaceStack ns_scope_stack_;
-
- RegexCustomTypeMap regex_custom_type_map_;
- DirectCustomTypeMap direct_custom_type_map_;
-
- private:
- WideRegexPat const cxx_uq_id_expr_;
- WideRegexPat const& cxx_uq_id_expr;
- };
-
- // Check whether this Schema type maps to a fundamental C++ type.
- //
- struct IsFundamentalType: Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal
-
- {
- IsFundamentalType (bool& r)
- : r_ (r)
- {
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger&)
- {
- r_ = true;
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean&)
- {
- r_ = true;
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal&)
- {
- r_ = true;
- }
-
- private:
- bool& r_;
- };
-
- // Check whether this is a string-based type.
- //
- struct IsStringBasedType: Traversal::Complex,
- Traversal::Union,
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language
- {
- IsStringBasedType (bool& r)
- : r_ (r)
- {
- *this >> inherits_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
- }
-
- virtual void
- traverse (SemanticGraph::Union&)
- {
- // Current mapping of union is string-based.
- //
- r_ = true;
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName&)
- {
- r_ = true;
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language&)
- {
- r_ = true;
- }
-
- private:
- bool& r_;
- Traversal::Inherits inherits_;
- };
-
-
- // Check whether this is a enumeration-based type.
- //
- struct IsEnumBasedType: Traversal::Complex
- {
- IsEnumBasedType (SemanticGraph::Enumeration*& e)
- : enum_ (e)
- {
- *this >> inherits_;
-
- inherits_ >> *this;
- inherits_ >> enum_;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- inherits (c, inherits_);
- }
-
- private:
- struct Enumeration: Traversal::Enumeration
- {
- Enumeration (SemanticGraph::Enumeration*& e)
- : e_ (e)
- {
- }
-
- virtual void
- traverse (Type& e)
- {
- if (e_ == 0)
- e_ = &e;
- }
-
- private:
- SemanticGraph::Enumeration*& e_;
- };
-
-
- private:
- Enumeration enum_;
- Traversal::Inherits inherits_;
- };
-
-
- //
- //
- struct MemberTypeName : Context,
- Traversal::Type,
- Traversal::List,
- Traversal::Union,
- Traversal::Complex,
-
- Traversal::AnyType,
- Traversal::AnySimpleType,
-
- Traversal::Fundamental::Byte,
- Traversal::Fundamental::UnsignedByte,
- Traversal::Fundamental::Short,
- Traversal::Fundamental::UnsignedShort,
- Traversal::Fundamental::Int,
- Traversal::Fundamental::UnsignedInt,
- Traversal::Fundamental::Long,
- Traversal::Fundamental::UnsignedLong,
- Traversal::Fundamental::Integer,
- Traversal::Fundamental::NonPositiveInteger,
- Traversal::Fundamental::NonNegativeInteger,
- Traversal::Fundamental::PositiveInteger,
- Traversal::Fundamental::NegativeInteger,
-
- Traversal::Fundamental::Boolean,
-
- Traversal::Fundamental::Float,
- Traversal::Fundamental::Double,
- Traversal::Fundamental::Decimal,
-
- Traversal::Fundamental::String,
- Traversal::Fundamental::NormalizedString,
- Traversal::Fundamental::Token,
- Traversal::Fundamental::Name,
- Traversal::Fundamental::NameToken,
- Traversal::Fundamental::NameTokens,
- Traversal::Fundamental::NCName,
- Traversal::Fundamental::Language,
-
- Traversal::Fundamental::QName,
-
- Traversal::Fundamental::Id,
- Traversal::Fundamental::IdRef,
- Traversal::Fundamental::IdRefs,
-
- Traversal::Fundamental::AnyURI,
-
- Traversal::Fundamental::Base64Binary,
- Traversal::Fundamental::HexBinary,
-
- Traversal::Fundamental::Date,
- Traversal::Fundamental::DateTime,
- Traversal::Fundamental::Duration,
- Traversal::Fundamental::Day,
- Traversal::Fundamental::Month,
- Traversal::Fundamental::MonthDay,
- Traversal::Fundamental::Year,
- Traversal::Fundamental::YearMonth,
- Traversal::Fundamental::Time,
-
- Traversal::Fundamental::Entity,
- Traversal::Fundamental::Entities
-
- {
- MemberTypeName (Context& c)
- : Context (c)
- {
- }
-
- MemberTypeName (Context& c, std::wostream& o)
- : Context (c, o)
- {
- }
-
- virtual void
- traverse (SemanticGraph::Type&)
- {
- abort ();
- }
-
- virtual void
- traverse (SemanticGraph::List& l)
- {
- os << fq_name (l);
- }
-
- virtual void
- traverse (SemanticGraph::Union& u)
- {
- os << fq_name (u);
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- os << fq_name (c);
- }
-
- // anyType & anySimpleType.
- //
- virtual void
- traverse (SemanticGraph::AnyType& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::AnySimpleType& t)
- {
- os << fq_name (t);
- }
-
- // Integral types.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- os << fq_name (t);
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- os << fq_name (t);
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- os << fq_name (t);
- }
-
- // Strings.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::String& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NormalizedString& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Token& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameToken& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NameTokens& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Name& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NCName& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Language& t)
- {
- os << fq_name (t);
- }
-
-
- // Qualified name.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::QName& t)
- {
- os << fq_name (t);
- }
-
-
- // ID/IDREF.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Id& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRef& t)
- {
- if (t.named_p ())
- {
- // IDREF<anyType>
- //
- os << fq_name (t);
- }
- else
- {
- SemanticGraph::Nameable& ncname (
- xs_ns ().find ("NCName").first->named ());
-
- os << "::xsd::cxx::tree::idref< " << char_type << ", " <<
- fq_name (ncname) << ", " <<
- type_name (t.argumented ().type ()) << " >";
- }
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::IdRefs& t)
- {
- if (t.named_p ())
- {
- // IDREFS<anyType>
- //
- os << fq_name (t);
- }
- else
- {
- SemanticGraph::Nameable& ncname (
- xs_ns ().find ("NCName").first->named ());
-
- os << "::xsd::cxx::tree::idrefs< " << char_type << ", " <<
- any_simple_type << ", ::xsd::cxx::tree::idref< " <<
- char_type << ", " << fq_name (ncname) << ", " <<
- type_name (t.argumented ().type ()) << " > >";
- }
- }
-
- // URI.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::AnyURI& t)
- {
- os << fq_name (t);
- }
-
- // Binary.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Base64Binary& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::HexBinary& t)
- {
- os << fq_name (t);
- }
-
-
- // Date/time.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Date& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::DateTime& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Duration& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Day& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Month& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::MonthDay& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Year& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::YearMonth& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Time& t)
- {
- os << fq_name (t);
- }
-
- // Entity.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Entity& t)
- {
- os << fq_name (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Entities& t)
- {
- os << fq_name (t);
- }
-
- private:
- // For idref/idrefs
- //
- String
- type_name (SemanticGraph::Type& t)
- {
- // This type is always named.
- //
- std::wostringstream o;
-
- MemberTypeName type (*this, o);
- type.dispatch (t);
-
- return o.str ();
- }
- };
-
-
- //
- //
- struct BaseTypeName : MemberTypeName
- {
- BaseTypeName (Context& c)
- : MemberTypeName (c)
- {
- }
-
- BaseTypeName (Context& c, std::wostream& o)
- : MemberTypeName (c, o)
- {
- }
-
- virtual void
- fundamental_base (SemanticGraph::Type& t)
- {
- os << "::xsd::cxx::tree::fundamental_base< " <<
- fq_name (t) << ", " << char_type << ", " <<
- any_simple_type << " >";
- }
-
- // Integrals.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Byte& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedByte& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Short& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedShort& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Int& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedInt& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Long& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::UnsignedLong& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Integer& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonPositiveInteger& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NonNegativeInteger& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::PositiveInteger& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::NegativeInteger& t)
- {
- fundamental_base (t);
- }
-
- // Boolean.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Boolean& t)
- {
- fundamental_base (t);
- }
-
- // Floats.
- //
- virtual void
- traverse (SemanticGraph::Fundamental::Float& t)
- {
- fundamental_base (t);
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Double& t)
- {
- os << "::xsd::cxx::tree::fundamental_base< " <<
- fq_name (t) << ", " << char_type << ", " <<
- any_simple_type << ", " <<
- "::xsd::cxx::tree::schema_type::double_ >";
- }
-
- virtual void
- traverse (SemanticGraph::Fundamental::Decimal& t)
- {
- os << "::xsd::cxx::tree::fundamental_base< " <<
- fq_name (t) << ", " << char_type << ", " <<
- any_simple_type << ", " <<
- "::xsd::cxx::tree::schema_type::decimal >";
- }
- };
-
- // Initial value should be true.
- //
- struct IsSimpleType: Traversal::Complex,
- Traversal::Member,
- Traversal::Any,
- Traversal::AnyAttribute
- {
- IsSimpleType (bool& v)
- : v_ (v)
- {
- *this >> names_ >> *this;
- *this >> inherits_ >> *this;
- }
-
- virtual void
- traverse (SemanticGraph::Complex& c)
- {
- if (c.mixed_p ())
- v_ = false;
-
- if (v_)
- names (c, names_);
-
- if (v_)
- inherits (c, inherits_);
- }
-
- virtual void
- traverse (SemanticGraph::Member&)
- {
- v_ = false;
- }
-
- virtual void
- traverse (SemanticGraph::Any&)
- {
- v_ = false;
- }
-
- virtual void
- traverse (SemanticGraph::AnyAttribute&)
- {
- v_ = false;
- }
-
- private:
- bool& v_;
- Traversal::Names names_;
- Traversal::Inherits inherits_;
- };
-
- // Test whether we need to generate default c-tor. Note that we are