00001 #ifndef s11n_DATA_NODE_FORMAT_H_INCLUDED
00002 #define s11n_DATA_NODE_FORMAT_H_INCLUDED
00003
00004 // data_node_format.hpp
00005
00006
00007
00008
00009
00010
00011
00012 #include <string>
00013 #include <list>
00014 #include <map>
00015 #include <stdexcept>
00016
00017 #include <s11n.net/s11n/s11n_debuggering_macros.hpp>
00018 #include <s11n.net/s11n/phoenix.hpp>
00019 #include <s11n.net/s11n/io/strtool.hpp>
00020 #include <s11n.net/s11n/classload.hpp>
00021
00022 #include <s11n.net/s11n/algo.hpp>
00023 #include <s11n.net/s11n/serialize.hpp>
00024
00025 #include <s11n.net/s11n/traits.hpp>
00026 #include <s11n.net/s11n/io/data_node_io.hpp>
00027
00028
00029
00030
00031
00032 #include <s11n.net/s11n/io/FlexLexer.hpp>
00033
00034
00035
00036 namespace s11n {
00037 namespace io {
00038
00039 namespace Private {
00040
00041
00042
00043
00044
00045
00046
00047
00048 int lex_api_hider_yylex( FlexLexer *, std::istream & );
00049
00050 }
00051
00052
00053
00054
00055
00056 typedef std::map<std::string,std::string> entity_translation_map;
00057
00058
00059
00060
00061
00062
00063
00064
00065
00066
00067
00068
00069
00070
00071
00072 class tree_builder
00073 {
00074 public:
00075 tree_builder() : m_autodel(true) {}
00076
00077 virtual ~tree_builder() {}
00078
00079
00080
00081
00082
00083
00084
00085 virtual bool
00086 open_node( const std::string & classname, const std::string & nodename ) = 0;
00087
00088
00089
00090
00091
00092
00093 virtual bool
00094 close_node() = 0;
00095
00096
00097
00098
00099
00100
00101 virtual bool
00102 add_property( const std::string & key, const std::string & val ) = 0;
00103
00104
00105
00106
00107
00108 virtual size_t node_depth() const = 0;
00109
00110
00111
00112
00113
00114
00115 virtual bool change_node_class( const std::string & newclassname ) = 0;
00116
00117
00118
00119
00120
00121
00122
00123
00124
00125 void auto_delete( bool b )
00126 {
00127 this->m_autodel = b;
00128 }
00129
00130
00131
00132
00133 bool auto_delete() const
00134 {
00135 return this->m_autodel;
00136 }
00137
00138
00139
00140
00141
00142
00143
00144
00145 virtual void reset()
00146 {
00147 }
00148
00149 private:
00150 bool m_autodel;
00151
00152 };
00153
00154
00155
00156
00157
00158
00159
00160
00161
00162
00163
00164
00165
00166
00167
00168
00169
00170
00171
00172
00173
00174
00175
00176
00177
00178
00179
00180
00181 template <typename ContextT>
00182 class tree_builder_context
00183 {
00184 public:
00185
00186 typedef ContextT context_type;
00187
00188
00189
00190
00191
00192
00193
00194
00195
00196
00197
00198
00199
00200
00201
00202
00203
00204
00205
00206
00207
00208 static void bind( const FlexLexer * lexer, tree_builder * builder )
00209 {
00210 lmap()[lexer].builder = builder;
00211 }
00212
00213
00214
00215
00216
00217 static void unbind( const FlexLexer * lexer )
00218 {
00219 lmap().erase( lexer );
00220 }
00221
00222
00223
00224
00225
00226
00227
00228
00229
00230 static tree_builder * builder( const FlexLexer * lexer )
00231 {
00232 return lmap()[lexer].builder;
00233 }
00234
00235
00236 #define IFNOLEXER(RET) if( lmap().end() == lmap().find(lexer) ) return RET;
00237
00238
00239
00240 static bool open_node( const FlexLexer * lexer,
00241 const std::string & classname,
00242 const std::string & nodename )
00243 {
00244 IFNOLEXER(false);
00245 return lmap()[lexer].builder->open_node( classname, nodename );
00246 }
00247
00248
00249
00250
00251 static bool close_node( const FlexLexer * lexer )
00252 {
00253 IFNOLEXER(false);
00254 return lmap()[lexer].builder->close_node();
00255 }
00256
00257
00258
00259
00260 static bool
00261 add_property( const FlexLexer * lexer,
00262 const std::string & key,
00263 const std::string & val )
00264 {
00265 IFNOLEXER(false);
00266 return lmap()[lexer].builder->add_property( key, val );
00267 }
00268
00269
00270
00271
00272 static size_t node_depth( const FlexLexer * lexer )
00273 {
00274 IFNOLEXER(0);
00275 return lmap()[lexer].builder->node_depth();
00276 }
00277
00278
00279
00280
00281 static bool change_node_class( const FlexLexer * lexer,
00282 const std::string & newclassname )
00283 {
00284 IFNOLEXER(false);
00285 return lmap()[lexer].builder->change_node_class( newclassname );
00286 }
00287 #undef IFNOLEXER
00288
00289
00290
00291
00292
00293
00294
00295
00296
00297
00298 struct lexer_metadata
00299 {
00300 tree_builder * builder;
00301
00302 size_t internaldepth;
00303 std::string nodename;
00304 std::string nodeclass;
00305 std::string property;
00306 std::string bufferyy;
00307 lexer_metadata()
00308 {
00309 builder = 0;
00310 internaldepth = 0;
00311 nodename = nodeclass = property = bufferyy = "";
00312 }
00313 };
00314
00315
00316
00317
00318
00319
00320 static lexer_metadata & metadata( const FlexLexer * lexer )
00321 {
00322 return lmap()[lexer];
00323 }
00324
00325 private:
00326
00327 typedef tree_builder_context<context_type> this_type;
00328
00329 typedef std::map<const FlexLexer *,lexer_metadata> lexer_map;
00330 static lexer_map & lmap()
00331 {
00332 return ::s11n::Detail::phoenix<
00333 lexer_map,
00334 this_type
00335 >::instance();
00336 }
00337
00338 };
00339
00340
00341
00342
00343
00344
00345
00346
00347
00348
00349
00350
00351
00352
00353
00354
00355
00356
00357
00358
00359 template <typename NodeType>
00360 class data_node_tree_builder : public tree_builder
00361 {
00362 public:
00363 typedef NodeType node_type;
00364
00365 typedef std::list< node_type * > child_list_type;
00366
00367
00368 data_node_tree_builder() : m_node_count(0), m_node(0),m_root(0)
00369 {
00370 }
00371
00372
00373
00374
00375
00376 virtual ~data_node_tree_builder()
00377 {
00378 if( this->auto_delete() && this->m_root )
00379 {
00380
00381 delete( this->m_root );
00382 }
00383 else
00384 {
00385
00386 }
00387 }
00388
00389
00390
00391
00392
00393
00394
00395
00396
00397
00398
00399
00400
00401
00402
00403
00404
00405
00406 bool open_node( const std::string & classname, const std::string & nodename )
00407 {
00408 ++m_node_count;
00409
00410 this->m_node = ( this->m_nodestack.empty()
00411 ? 0
00412 : this->m_nodestack.back() );
00413 typedef ::s11n::node_traits<node_type> NTR;
00414 node_type * newnode = new node_type();
00415 if ( m_node )
00416 {
00417 NTR::children( *m_node ).push_back( newnode );
00418 }
00419 this->m_node = newnode;
00420 NTR::name( *m_node, nodename );
00421 NTR::class_name( *m_node, classname );
00422 this->m_nodestack.push_back( m_node );
00423 bool ret = true;
00424 if ( 1 == this->m_nodestack.size() )
00425 {
00426 if( m_root )
00427 {
00428 CERR << "open_node("<<classname<<","<<nodename<<") WARNING: deleting extra root node!\n";
00429 delete( m_node );
00430 m_node = 0;
00431 ret = false;
00432 }
00433 else
00434 {
00435 m_root = m_node;
00436 }
00437 }
00438 return ret;
00439 }
00440
00441
00442
00443
00444
00445
00446
00447
00448
00449
00450 virtual bool close_node()
00451 {
00452 if ( !m_node || m_nodestack.empty() )
00453 {
00454 CERR << "close_node() error: called with an empty node stack!" << std::endl;
00455 return false;
00456 }
00457 m_nodestack.pop_back();
00458 if ( m_nodestack.empty() )
00459 {
00460 m_node = NULL;
00461 }
00462 else
00463 {
00464 m_node = m_nodestack.back();
00465 }
00466 return true;
00467 }
00468
00469
00470
00471
00472
00473
00474
00475 virtual bool add_property( const std::string & key, const std::string & val )
00476 {
00477 if( ! this->m_node ) return false;
00478 typedef ::s11n::node_traits<node_type> NTR;
00479 NTR::set( *m_node, key, val );
00480 return true;
00481 }
00482
00483
00484
00485
00486 size_t node_count() const
00487 {
00488 return m_node_count;
00489 }
00490
00491
00492
00493
00494
00495
00496
00497
00498 size_t node_depth() const
00499 {
00500 return m_nodestack.size();
00501 }
00502
00503
00504
00505
00506
00507
00508
00509
00510
00511 node_type * root_node() const
00512 {
00513 return m_root;
00514 }
00515
00516
00517
00518
00519
00520
00521
00522
00523 node_type * current_node() const
00524 {
00525 return m_node;
00526 }
00527
00528
00529
00530
00531
00532
00533 virtual bool change_node_class( const std::string & newclassname )
00534 {
00535 if( ! this->m_node ) return false;
00536 typedef ::s11n::node_traits<node_type> NTR;
00537 NTR::class_name( *(this->m_node), newclassname );
00538 return true;
00539 }
00540
00541
00542
00543
00544
00545
00546 virtual void reset()
00547 {
00548 if( this->auto_delete() && this->m_root ) delete this->m_root;
00549 this->m_root = 0;
00550
00551 this->m_node = 0;
00552 this->m_node_count = 0;
00553 this->m_nodestack = node_stack();
00554 }
00555
00556 private:
00557 size_t m_node_count;
00558 node_type * m_node;
00559 node_type * m_root;
00560 typedef std::deque < node_type * > node_stack;
00561 node_stack m_nodestack;
00562 };
00563
00564
00565
00566
00567
00568
00569
00570
00571
00572
00573
00574
00575
00576
00577
00578
00579
00580
00581
00582
00583
00584
00585
00586
00587
00588
00589
00590
00591
00592 template <typename NodeType, typename BuilderContext>
00593 NodeType * deserialize_lex_forwarder( const std::string & lexerClassName,
00594 std::istream & src
00595 )
00596 {
00597
00598 std::auto_ptr<FlexLexer> lexer( ::s11n::cl::classload<FlexLexer>( lexerClassName ) );
00599 if( ! lexer.get() )
00600 {
00601 throw ::s11n::s11n_exception(
00602 "%s:%d: s11n::io::deserialize_lex_forwarder(): Lexer '%s' was not found by classload<FlexLexer>(). It is probably not registered with the classloader.",
00603 __FILE__,
00604 __LINE__,
00605 lexerClassName.c_str() );
00606 }
00607
00608 typedef s11n::io::data_node_tree_builder<NodeType> BuilderType;
00609 typedef tree_builder_context<BuilderContext> BC;
00610 std::auto_ptr<BuilderType> treebuilder( new BuilderType );
00611 treebuilder->auto_delete( true );
00612 try
00613 {
00614 BC::bind( lexer.get(), treebuilder.get() );
00615
00616 Private::lex_api_hider_yylex(lexer.get(),src);
00617 }
00618 catch ( const std::exception & ex )
00619 {
00620 BC::unbind( lexer.get() );
00621 throw ex;
00622 }
00623 catch (...)
00624 {
00625 BC::unbind( lexer.get() );
00626 throw;
00627 }
00628 BC::unbind( lexer.get() );
00629 treebuilder->auto_delete( false );
00630 return treebuilder->root_node();
00631 }
00632
00633
00634
00635
00636
00637
00638
00639
00640
00641
00642
00643
00644 template <typename NodeType, typename LexerSharingContext>
00645 class tree_builder_lexer : public data_node_serializer<NodeType>
00646 {
00647 public:
00648
00649 typedef NodeType node_type;
00650 typedef LexerSharingContext sharing_context;
00651 typedef data_node_serializer<NodeType> parent_type;
00652
00653
00654
00655
00656
00657 explicit tree_builder_lexer( const std::string & lexerClassName )
00658 : m_impl(lexerClassName)
00659 {}
00660
00661 virtual ~tree_builder_lexer(){}
00662
00663
00664
00665
00666
00667
00668 virtual node_type * deserialize( std::istream & src )
00669 {
00670 return deserialize_lex_forwarder<
00671 node_type,
00672 sharing_context
00673 >( this->lexer_class(), src );
00674 }
00675
00676 virtual node_type * deserialize( const std::string & src )
00677 {
00678
00679
00680 return this->parent_type::deserialize( src );
00681 }
00682
00683
00684
00685
00686
00687 std::string lexer_class() const { return this->m_impl; }
00688
00689
00690 protected:
00691
00692
00693
00694 void lexer_class( const std::string & classname )
00695 {
00696 this->m_impl = classname;
00697 }
00698
00699 private:
00700 std::string m_impl;
00701 };
00702
00703
00704
00705
00706
00707
00708
00709
00710
00711
00712
00713
00714
00715 template <typename NodeType>
00716 class key_value_serializer
00717 {
00718 public:
00719 typedef NodeType node_type;
00720 typedef typename node_type::value_type pair_type;
00721
00722 typedef std::map<std::string,std::string> entity_translation_map;
00723
00724
00725
00726
00727
00728
00729
00730
00731
00732
00733
00734
00735
00736
00737
00738
00739 key_value_serializer( const entity_translation_map * map,
00740 std::ostream & dest,
00741 const std::string & prefix,
00742 const std::string & separator,
00743 const std::string & suffix
00744 )
00745 : m_pre(prefix), m_sep(separator), m_suf(suffix), m_os(dest), m_map(map)
00746 {
00747 }
00748
00749
00750
00751
00752
00753
00754
00755 void operator()( const pair_type & src ) const
00756 {
00757 static const std::string errval = "";
00758 std::string key = strtool::to( src.first );
00759 std::string val = strtool::to( src.second );
00760
00761 if( this->m_map )
00762 {
00763 strtool::translate_entities( val, *(this->m_map) );
00764 }
00765 this->m_os << this->m_pre;
00766 this->m_os << key;
00767 this->m_os << this->m_sep;
00768 this->m_os << val;
00769 this->m_os << this->m_suf;
00770 }
00771 private:
00772 std::string m_pre;
00773 std::string m_sep;
00774 std::string m_suf;
00775 std::ostream & m_os;
00776 const entity_translation_map * m_map;
00777 };
00778
00779
00780
00781
00782
00783
00784
00785
00786
00787
00788
00789
00790
00791
00792
00793 template <typename SerializerT>
00794 struct node_child_simple_formatter
00795 {
00796 typedef SerializerT serializer_type;
00797
00798
00799
00800
00801
00802
00803
00804
00805
00806
00807
00808
00809 node_child_simple_formatter( serializer_type & ser, std::ostream & os,
00810 const std::string & prefix = "", const std::string & suffix = "\n" )
00811 : m_ser(ser), m_os(&os), m_pre(prefix), m_suf(suffix)
00812 {
00813 }
00814
00815
00816
00817
00818
00819 template <typename NodeType>
00820 bool operator()( const NodeType * src ) const
00821 {
00822 if( ! src ) return false;
00823 if( ! this->m_pre.empty() ) *(this->m_os) << this->m_pre;
00824 bool b = this->m_ser.serialize( *src, *(this->m_os) );
00825 if( ! this->m_suf.empty() ) *(this->m_os) << this->m_suf;
00826 return b;
00827 }
00828
00829 private:
00830 serializer_type & m_ser;
00831 std::ostream * m_os;
00832 std::string m_pre;
00833 std::string m_suf;
00834 };
00835
00836
00837
00838 }
00839 }
00840
00841
00842 #include <s11n.net/s11n/factory.hpp>
00843 #define S11N_FACREG_TYPE s11n::io::tree_builder
00844 #define S11N_FACREG_TYPE_NAME "s11n::io::tree_builder"
00845 #define S11N_FACREG_TYPE_IS_ABSTRACT 1
00846 #include <s11n.net/s11n/factory_reg.hpp>
00847
00848 #endif // s11n_DATA_NODE_FORMAT_H_INCLUDED