// file : xsd/cxx/tree/stream-insertion-source.cxx // license : GNU GPL v2 + exceptions; see accompanying LICENSE file #include #include #include namespace CXX { namespace Tree { namespace { struct List: Traversal::List, Context { List (Context& c) : Context (c) { } virtual void traverse (Type& l) { String name (ename (l)); // If renamed name is empty then we do not need to generate // anything for this type. // if (renamed_type (l, name) && !name) return; SemanticGraph::Type& item_type (l.argumented ().type ()); String base (L"::xsd::cxx::tree::list< " + item_type_name (item_type) + L", " + char_type); if (item_type.is_a ()) base += L", ::xsd::cxx::tree::schema_type::double_"; else if (item_type.is_a ()) base += L", ::xsd::cxx::tree::schema_type::decimal"; base += L" >"; size_t n (0); NarrowStrings const& st (options.generate_insertion ()); for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream_type ("::xsd::cxx::tree::ostream< " + *i + " >"); os << stream_type << "&" << endl << "operator<< (" << stream_type << "& s," << endl << "const " << name << "& x)" << "{" << "return s << static_cast< const " << base << "& > (x);" << "}"; // Register with type map. // if (polymorphic && polymorphic_p (l) && (!anonymous_p (l) || anonymous_substitutes_p (l))) { // Note that we are using the original type name. // String const& name (ename (l)); os << "static" << endl << "const ::xsd::cxx::tree::stream_insertion_initializer< " << poly_plate << ", " << i->c_str () << ", " << char_type << ", " << name << " >" << endl << "_xsd_" << name << "_stream_insertion_init_" << n++ << " (" << endl << strlit (l.name ()) << "," << endl << strlit (xml_ns_name (l)) << ");" << endl; } } } private: String item_type_name (SemanticGraph::Type& t) { std::wostringstream o; MemberTypeName type (*this, o); type.dispatch (t); return o.str (); } }; struct Union: Traversal::Union, Context { Union (Context& c) : Context (c) { } virtual void traverse (Type& u) { String name (ename (u)); // If renamed name is empty then we do not need to generate // anything for this type. // if (renamed_type (u, name) && !name) return; String const& base (xs_string_type); size_t n (0); NarrowStrings const& st (options.generate_insertion ()); for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream_type ("::xsd::cxx::tree::ostream< " + *i + " >"); os << stream_type << "&" << endl << "operator<< (" << stream_type << "& s," << endl << "const " << name << "& x)" << "{" << "return s << static_cast< const " << base << "& > (x);" << "}"; // Register with type map. // if (polymorphic && polymorphic_p (u) && (!anonymous_p (u) || anonymous_substitutes_p (u))) { // Note that we are using the original type name. // String const& name (ename (u)); os << "static" << endl << "const ::xsd::cxx::tree::stream_insertion_initializer< " << poly_plate << ", " << i->c_str () << ", " << char_type << ", " << name << " >" << endl << "_xsd_" << name << "_stream_insertion_init_" << n++ << " (" << endl << strlit (u.name ()) << "," << endl << strlit (xml_ns_name (u)) << ");" << endl; } } } }; struct Enumeration: Traversal::Enumeration, Context { Enumeration (Context& c) : Context (c), base_ (c) { inherits_base_ >> base_; } virtual void traverse (Type& e) { String name (ename (e)); // If renamed name is empty then we do not need to generate // anything for this type. // if (renamed_type (e, name) && !name) return; bool string_based (false); { IsStringBasedType t (string_based); t.dispatch (e); } bool enum_based (false); if (string_based) { SemanticGraph::Enumeration* base_enum (0); IsEnumBasedType t (base_enum); t.dispatch (e); enum_based = (base_enum != 0); } String value; if (string_based) value = evalue (e); size_t n (0); NarrowStrings const& st (options.generate_insertion ()); for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream_type ("::xsd::cxx::tree::ostream< " + *i + " >"); os << stream_type << "&" << endl << "operator<< (" << stream_type << "& s," << endl << "const " << name << "& x)" << "{"; if (!string_based || enum_based) { os << "return s << static_cast< const "; inherits (e, inherits_base_); os << "& > (x);"; } else { os << name << "::" << value << " v (x);" << "return s << static_cast< unsigned int > (v);"; } os << "}"; // Register with type map. // if (polymorphic && polymorphic_p (e) && (!anonymous_p (e) || anonymous_substitutes_p (e))) { // Note that we are using the original type name. // String const& name (ename (e)); os << "static" << endl << "const ::xsd::cxx::tree::stream_insertion_initializer< " << poly_plate << ", " << i->c_str () << ", " << char_type << ", " << name << " >" << endl << "_xsd_" << name << "_stream_insertion_init_" << n++ << " (" << endl << strlit (e.name ()) << "," << endl << strlit (xml_ns_name (e)) << ");" << endl; } } } private: Traversal::Inherits inherits_base_; BaseTypeName base_; }; struct Element: Traversal::Element, Context { Element (Context& c, String const& scope_, String const& stream_) : Context (c), scope (scope_), stream (stream_) { } virtual void traverse (Type& e) { if (skip (e)) return; String const& aname (eaname (e)); SemanticGraph::Type& t (e.type ()); String type (scope + L"::" + etype (e)); // Figure out if we need to generate polymorphic code. If this // elemen's type is anonymous then we don't need to do anything. // Note that if the type is anonymous then it can't be derived // from which makes it impossible to substitute or dynamically- // type with xsi:type. // bool poly (polymorphic && polymorphic_p (t) && !anonymous_p (t)); // Check if this element is abstract. // bool abst (false); if (poly) { SemanticGraph::Complex* tc; abst = (tc = dynamic_cast (&t)) != 0 && tc->abstract_p (); } if (max (e) != 1) { // sequence // os << "{" << "const " << scope << "::" << econtainer (e) << "& c (" << "x." << aname << " ());" << "s << ::xsd::cxx::tree::ostream_common::as_size< " << "::std::size_t > (c.size ());"; os << "for (" << scope << "::" << econst_iterator (e) << endl << "i (c.begin ()), e (c.end ());" << endl << "i != e; ++i)" << "{"; if (poly) { if (!abst) os << "bool d (typeid (" << type << ") != typeid (*i));" << "s << d;" << "if (!d)" << endl << "s << *i;" << "else" << endl; os << "::xsd::cxx::tree::stream_insertion_map_instance< " << poly_plate << ", " << stream << ", " << char_type << " > ().insert (s, *i);"; } else os << "s << *i;"; os << "}" // for << "}"; } else if (min (e) == 0) { // optional // os << "{" << "bool p (x." << aname << " ());" << "s << p;" << "if (p)"; if (poly) { os << "{" << "const " << type << "& i (*x." << aname << " ());"; if (!abst) os << "bool d (typeid (" << type << ") != typeid (i));" << "s << d;" << "if (!d)" << endl << "s << i;" << "else" << endl; os << "::xsd::cxx::tree::stream_insertion_map_instance< " << poly_plate << ", " << stream << ", " << char_type << " > ().insert (s, i);" << "}"; } else os << endl << "s << *x." << aname << " ();"; os << "}"; } else { // one // if (poly) { os << "{" << "const " << type << "& i (x." << aname << " ());"; if (!abst) os << "bool d (typeid (" << type << ") != typeid (i));" << "s << d;" << "if (!d)" << endl << "s << i;" << "else" << endl; os << "::xsd::cxx::tree::stream_insertion_map_instance< " << poly_plate << ", " << stream << ", " << char_type << " > ().insert (s, i);" << "}"; } else os << "s << x." << aname << " ();"; } } private: String scope; String stream; }; struct Attribute: Traversal::Attribute, Context { Attribute (Context& c) : Context (c) { } virtual void traverse (Type& a) { String const& aname (eaname (a)); if (a.optional_p () && !a.default_p ()) { os << "{" << "bool p (x." << aname << " ());" << "s << p;" << "if (p)" << endl << "s << *x." << aname << " ();" << "}"; } else { os << "s << x." << aname << " ();"; } } }; struct Complex: Traversal::Complex, Context { Complex (Context& c) : Context (c), base_ (c) { inherits_ >> base_; } virtual void traverse (Type& c) { SemanticGraph::Context& ctx (c.context ()); String name (ename (c)); // If renamed name is empty then we do not need to generate // anything for this type. // if (renamed_type (c, name) && !name) return; bool ordered (ordered_p (c) && !ctx.count ("order-in-base")); bool has_body (ordered || has (c) || c.inherits_p ()); size_t n (0); NarrowStrings const& st (options.generate_insertion ()); for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream_type ("::xsd::cxx::tree::ostream< " + *i + " >"); os << stream_type << "&" << endl << "operator<< (" << stream_type << "& s," << endl << "const " << name << "&" << (has_body ? " x" : "") << ")" << "{"; if (c.inherits_p ()) { os << "s << static_cast< const "; inherits (c, inherits_); os << "& > (x);"; } // Write the order sequence. // if (ordered) { String const& ci (ctx.get ("order-const-iterator")); String const& an (ctx.get ("order-aname")); os << "s << ::xsd::cxx::tree::ostream_common::as_size< " << "::std::size_t > (" << endl << "x." << an << " ().size ());" << endl << "for (" << name << "::" << ci << endl << "b (x." << an << " ().begin ()), n (x." << an << " ().end ());" << endl << "b != n; ++b)" << "{" << "s << ::xsd::cxx::tree::ostream_common::as_size< " << "::std::size_t > (b->id);" << "s << ::xsd::cxx::tree::ostream_common::as_size< " << "::std::size_t > (b->index);" << "}"; } { Traversal::Names names_member; Element element (*this, name, *i); Attribute attribute (*this); names_member >> element; names_member >> attribute; names (c, names_member); } os << "return s;" << "}"; // Register with type map. // if (polymorphic && polymorphic_p (c) && !c.abstract_p () && (!anonymous_p (c) || anonymous_substitutes_p (c))) { // Note that we are using the original type name. // String const& name (ename (c)); os << "static" << endl << "const ::xsd::cxx::tree::stream_insertion_initializer< " << poly_plate << ", " << i->c_str () << ", " << char_type << ", " << name << " >" << endl << "_xsd_" << name << "_stream_insertion_init_" << n++ << " (" << endl << strlit (c.name ()) << "," << endl << strlit (xml_ns_name (c)) << ");" << endl; } } } private: Traversal::Inherits inherits_; BaseTypeName base_; }; } void generate_stream_insertion_source (Context& ctx) { if (ctx.polymorphic) { NarrowStrings const& st (ctx.options.generate_insertion ()); ctx.os << "#include " << endl << 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 tree" << "{"; for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream (*i); ctx.os << "#ifdef _MSC_VER" << endl; if (export_maps) ctx.os << "template struct __declspec (dllexport) " << "stream_insertion_plate< " << ctx.poly_plate << ", " << stream << ", " << ctx.char_type << " >;"; if (import_maps) ctx.os << "template struct __declspec (dllimport) " << "stream_insertion_plate< " << ctx.poly_plate << ", " << stream << ", " << ctx.char_type << " >;"; ctx.os << "#elif defined(__GNUC__) && __GNUC__ >= 4" << endl << "template struct __attribute__ ((visibility(\"default\"))) " << "stream_insertion_plate< " << ctx.poly_plate << ", " << stream << ", " << ctx.char_type << " >;" << "#elif defined(XSD_MAP_VISIBILITY)" << endl << "template struct XSD_MAP_VISIBILITY " << "stream_insertion_plate< " << ctx.poly_plate << ", " << stream << ", " << ctx.char_type << " >;" << "#endif" << endl; } ctx.os << "}" // tree << "}" // cxx << "}" // xsd << "#endif // XSD_NO_EXPORT" << endl << endl; } ctx.os << "namespace _xsd" << "{"; size_t n (0); for (NarrowStrings::const_iterator i (st.begin ()); i != st.end (); ++i) { String stream (*i); ctx.os << "static" << endl << "const ::xsd::cxx::tree::stream_insertion_plate< " << ctx.poly_plate << ", " << stream << ", " << ctx.char_type << " >" << endl << "stream_insertion_plate_init_" << n++ << ";"; } ctx.os << "}"; } Traversal::Schema schema; Sources sources; Traversal::Names names_ns, names; Namespace ns (ctx); List list (ctx); Union union_ (ctx); Complex complex (ctx); Enumeration enumeration (ctx); schema >> sources >> schema; schema >> names_ns >> ns >> names; names >> list; names >> union_; names >> complex; names >> enumeration; schema.dispatch (ctx.schema_root); } } }