- Boost-users - lists.boost.org

Runtime memory corruption occurs when serializing tree-structure as binary-archive.
by Youhei Murakami 02 Dec '07

02 Dec '07

Hello everyone. I tried to compile a code that has written below and I had met runtime error. That error is the memory corruption. A memory corruption occurs when just before exit main function and causes are in binary-serialization, but I don't understand this fenomenon. If someone who knows the reason of this matter, please tell me. [environment] Windows XP 64bit Visual Studio 2005 sp1 boost-1_34_1 #define _SCL_SECURE_NO_WARNINGS #pragma warning(push) #pragma warning(disable: 4267) #pragma warning(disable: 4103) #include <stdio.h> #include <tchar.h> #define CRTDBG_MAP_ALLOC #include <stdlib.h> #include <crtdbg.h> #include <iostream> #include <fstream> #include <cstdlib> #include <vector> #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/weak_ptr.hpp> #include <boost/serialization/version.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/tracking.hpp> #include <boost/serialization/is_abstract.hpp> #include <boost/serialization/nvp.hpp> #include <boost/serialization/binary_object.hpp> #include <boost/serialization/split_member.hpp> #define BOOST_LIB_NAME boost_serialization #include <boost/config/auto_link.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/serialization/export.hpp> #pragma warning(pop) using namespace std; using namespace boost; using namespace boost::serialization; using namespace boost::archive; namespace test { class nodebase : public enable_shared_from_this<nodebase> { // occurs memory corruption when serializing public: typedef shared_ptr<nodebase> NodePointer; typedef weak_ptr<nodebase> NodeWeakPointer; typedef vector<NodePointer> Children; typedef Children::iterator ChildIterator; typedef vector<NodeWeakPointer> Parents; typedef Parents::iterator ParentIterator; public: nodebase(); nodebase( const string &n ); nodebase( const string &n, const Children &c ); nodebase( const string &n, const Children &c, const Parents &p ); virtual ~nodebase(); private: struct Impl { Impl(); Impl( const string &n ); Impl( const string &n, const Children &v ); Impl( const string &n, const Children &v, const Parents &p ); public: string name; Children children; Parents parents; private: friend class serialization::access; template <class Archive> void serialize( Archive &ar, const unsigned int version ); }; shared_ptr<Impl> pimpl; private: // serialization friend class serialization::access; template <class Archive> void serialize( Archive &ar, const unsigned int version ); public: string getname( void ){ return pimpl->name; } void SetParent( const NodePointer &parent ); void SetParents( const Parents &parents ); NodePointer GetParent( const string &name ); Parents GetParents( void ); Children GetChildren( void ); void AddChild( const NodePointer &child ); void RemoveChild( const NodePointer &child ); void Traverse( void ); private: void Traverse( const NodePointer &root ); }; nodebase::Impl::Impl() { } nodebase::Impl::Impl( const string &n ) : name(n) { } nodebase::Impl::Impl( const string &n, const Children &c ) : name(n), children(c) { } nodebase::Impl::Impl( const string &n, const Children &c, const Parents &p ) : name(n), children(c), parents(p) { } template <class Archive> void nodebase::Impl::serialize( Archive &ar, const unsigned int version ) { ar & make_nvp( "name", make_binary_object( &name, sizeof(name) ) ); ar & make_nvp( "children", make_binary_object( &children, sizeof(children) ) ); ar & make_nvp( "parents", make_binary_object( &parents, sizeof(parents) ) ); } nodebase::nodebase() { } nodebase::nodebase( const string &n ) : pimpl( new Impl( n ) ) { } nodebase::nodebase( const string &n, const Children &c ) : pimpl( new Impl( n, c ) ) { } nodebase::nodebase( const string &n, const Children &c, const Parents &p ) : pimpl( new Impl( n, c, p ) ) { } nodebase::~nodebase() { } template <class Archive> void nodebase::serialize( Archive &ar, const unsigned int version ) { ar & make_nvp( "pimpl", make_binary_object( &pimpl, sizeof(pimpl) ) ); } template void nodebase::serialize<archive::binary_oarchive>( archive::binary_oarchive &ar, const unsigned int version ); template void nodebase::serialize<archive::binary_iarchive>( archive::binary_iarchive &ar, const unsigned int version ); void nodebase::SetParent( const nodebase::NodePointer &p ) { assert( pimpl->parents.size()+1 < 2 ); pimpl->parents.push_back( p ); } nodebase::NodePointer nodebase::GetParent( const string &name ) { for( ParentIterator i = pimpl->parents.begin(); i != pimpl->parents.end(); i++ ){ NodePointer tmp((*i)); if( tmp->getname() == name ) { return tmp; } } return NodePointer(); } nodebase::Parents nodebase::GetParents( void ) { return pimpl->parents; } nodebase::Children nodebase::GetChildren( void ) { return pimpl->children; } void nodebase::AddChild( const nodebase::NodePointer &child ) { child->SetParent( shared_from_this() ); //!!!!ERROR!!!! incur a memory leak this->pimpl->children.push_back( child ); } void nodebase::RemoveChild( const NodePointer &child ) { for( ChildIterator i = pimpl->children.begin(); i != pimpl->children.end(); i++ ){ if( (*i).get() == child.get() ){ pimpl->children.erase( i ); break; } } } void nodebase::Traverse( void ) { Children children = this->GetChildren(); for( ChildIterator i = children.begin(); i != children.end(); i++ ){ Traverse( *i ); } } void nodebase::Traverse( const NodePointer &node ) { if( !node ){ return; } Children children = node->GetChildren(); for( ChildIterator i = children.begin(); i != children.end(); i++ ) { Traverse( *i ); } } class simple_class { // not occur memory corruption when serializing friend class access; string name; template <class Archive> void serialize( Archive &ar, unsigned int ) { ar & name; } }; }; BOOST_CLASS_TRACKING(test::nodebase, boost::serialization::track_always); int _tmain(int argc, _TCHAR* argv[]) { using namespace test; { shared_ptr<nodebase> root( new nodebase(string("root")) ); shared_ptr<nodebase> c1( new nodebase(string("c1")) ); shared_ptr<nodebase> c2( new nodebase(string("c2")) ); shared_ptr<nodebase> c3( new nodebase(string("c3")) ); shared_ptr<nodebase> c4( new nodebase(string("c4")) ); shared_ptr<nodebase> c5( new nodebase(string("c5")) ); c3->AddChild( c5 ); c1->AddChild( c3 ); c2->AddChild( c4 ); root->AddChild( c1 ); root->AddChild( c2 ); root->Traverse(); { // output ofstream ofile( "serialized", ios::binary ); try { boost::archive::binary_oarchive oa( ofile ); oa << BOOST_SERIALIZATION_NVP(root); } catch( boost::archive::archive_exception &e ) { cout << "At the output : " << e.what() << endl; ofile.close(); getchar(); exit(1); } ofile.close(); } shared_ptr<nodebase> in; { // input ifstream ifile( "serialized", ios::binary ); try { boost::archive::binary_iarchive ia( ifile ); ia >> BOOST_SERIALIZATION_NVP(in); in->Traverse(); } catch( boost::archive::archive_exception &e ) { cout << "At the input : " << e.what() << endl; ifile.close(); getchar(); exit(e.code); } ifile.close(); } } getchar(); return 0; }

1 0

Sequence modifying routines??
by John Femiani 01 Dec '07

01 Dec '07

Is there a reason that fusion seems devoid of sequence modifying routines except for the built-in assignment operators? For instance, if I wanted to operate on boost::array, I would seem to have no way to write the results back into an array through fusion (unless I miss something). I am looking for something like copy(input_sequence, output_sequence) -- John Femiani

1 0

BGL : maximum weighted matching
by Alessio Dore 01 Dec '07

01 Dec '07

Dear all, I am implementing an algorithm for which I would need to compute the maximum weighted matching of a bipartite graphs. I have seen that LEDA libraries has this sort of functions but their license is restrictive. BGL allows maximum cardinality matching but, if I understood well, it works for non-weighted graphs. In a previous message on this list it was mentioned that this functionality could have been added but I didn't find it. Is it available? Does anyone of you know if there are other libraries to perform it? Thanks. Regrads, Alessio

2 1

[statechart] context sensitive history
by Chris Paulse 01 Dec '07

01 Dec '07

I have the following requirement: States A and B, where B has two substates B1 and B2. When transition occurs from B to A, and then from A back to B, under some conditions it is desired for B1 to be the initial substate, while in others we would like the substate to be chosen based on B's shallow history. Is there a concise way to obtain this behavior from the statecharts library? Thanks, Chris

2 1

Building Python.Boost 2 with VC
by Marko Bozikovic 30 Nov '07

30 Nov '07

Hi all, I'm having problems building Boost.Python with VC 2003. I'm reading the howto, but I must be missing something. My Python 2.4 is installed in C:\Python (using official Windows installer) My user-config.jam looks like this: import toolset : using ; using msvc : 7.1 ; using python : 2.4 : C:\\Python ; (I have tried C:\Python and C:/Python, no luck) When I run bjam: tools\bjam.exe --with-python I get the following error: WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets warning: Python location is not configured warning: the Boost.Python library won't be built ...found 1 target... user-config.jam is begin read, because bjam reports errors in it. What am I missing? Thank you, -- Marko ICQ: 5990814 I'm not under the alkafluence of inkahol that some thinkle peep I am. It's just the drunker I sit here the longer I get.

2 3

Serialization: Visual C+ Template Bug ?
by Oliver Kania 30 Nov '07

30 Nov '07

Hello ! When linking a program that consists only of main.cpp with a library that serializes a class "Palo Cllient" I get the following message (sry for the mess): ================================================== error LNK2019: unresolved external symbol "private: void __thiscall jedox::palo::PaloClient::serialize<class boost::archive::text_oarchive>(class boost::archive::text_oarchive &,unsigned int)" (??$serialize@ Vtext_oarchive@archive@boost@@@ PaloClient@palo@jedox@@AAEXAAVtext_oarchive@archive@boost@@I@Z) referenced in function "public: static void __cdecl boost::serialization::access::serialize<class boost::archive::text_oarchive,class jedox::palo::PaloClient>(class boost::archive::text_oarchive &,class jedox::palo::PaloClient &,unsigned int)" (??$serialize@ Vtext_oarchive@archive@boost@@VPaloClient@palo@jedox@@@ access@serialization@boost@@SAXAAVtext_oarchive@archive@2@AAVPaloClient@ palo@jedox@@I@Z) ================================================== This happens even though I do NOT explicitly serialize anything. Main.cpp includes: #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> For the class PaloClient, I do use the Pimpl idiom and serialize as it is recommended in the documentation: PaloClient.cpp: -------------------------------------------------------------- #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/scoped_ptr.hpp> .... template<class Archive> void PaloClient::serialize( Archive &ar, const unsigned int version ) { ar & m_PaloClientImpl; } template void PaloClient::serialize<boost::archive::text_iarchive>( boost::archive::text_iarchive & ar, const unsigned int file_version ); template void PaloClient::serialize<boost::archive::text_oarchive>( boost::archive::text_oarchive & ar, const unsigned int file_version ); ------------------------------------------------------------------------ Now, when I change this to void PaloClient::serialize(boost::archive::text_iarchive & ar, const unsigned int file_version) { ar & m_PaloClientImpl; } void PaloClient::serialize (boost::archive::text_oarchive & ar, const unsigned int file_version) { ar & m_PaloClientImpl; } The linkage error disappears. I guess this is a Visual C++ compiler problem but I wanted to post this in case someone else has similar problems. Kind regards, Oliver PS: Thanks for this great serialization library, it saved me many weeks of programming.

2 2

[statechart] round trip eng. diagramming tool
by Chris Paulse 30 Nov '07

30 Nov '07

I seem to remember seeing an open request for a diagramming tool for Boost statecharts that would be similar in concept to the Rhapsody product. Has there been any further development on this front? Thanks. Chris

2 1

boost::serialization and boost::shared_ptr are not working on tree data structure uses PIMPL idiom
by Youhei Murakami 29 Nov '07

29 Nov '07

Hello everyone. I tried to serialize tree data structure. Tree-structure's "node"-class holds "Impl"-structure and Impl-structure holds child nodes as vector<shared_ptr<node> >. Problems occur when serializing a tree structure that was constructed using above structures. Compile errors not occur, but run-time error occures at serialization of input-stream. If exists someone who knows the reason of it., please teach me that. please god bless me! A problematic souce code has been written below and is attached on this mail. [Emveironment] -Windows XP 64bit -Visual Studio 2005 sp1 -boost-1_34_1 #include <iostream> #include <fstream> #include <cstdlib> #include <vector> #include <boost/shared_ptr.hpp> #include <boost/intrusive_ptr.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/version.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/tracking.hpp> #include <boost/serialization/is_abstract.hpp> #include <boost/serialization/nvp.hpp> #define BOOST_LIB_NAME boost_serialization #include <boost/config/auto_link.hpp> #include <boost/archive/text_woarchive.hpp> #include <boost/archive/text_wiarchive.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/split_member.hpp> using namespace std; using namespace boost; using namespace boost::serialization; namespace test { class nodebase { public: typedef shared_ptr<nodebase> NodePointer; typedef vector<NodePointer> Children; typedef Children::iterator ChildIterator; public: nodebase(){} nodebase( const wstring &n ) : name(n) {} virtual ~nodebase(){} wstring getname() { return name; } void setname( const wstring &newname ) { name = newname; } private: wstring name; private: friend class serialization::access; template <class Archive> void serialize( Archive &ar, const unsigned int version ) { ar.register_type<nodebase>(); ar & name; } public: virtual void SetParent( const NodePointer &parent ) = 0; virtual Children GetChildren( void ) = 0; virtual void AddChild( const NodePointer &child ) = 0; virtual void RemoveChild( const NodePointer &child ) = 0; virtual void Traverse( const NodePointer &root ) = 0; }; class node : public nodebase { private: struct Impl { Impl() {} Impl( const Children &v ) : children(v) {} Impl( const Children &v, const NodePointer &p ) : children(v), parent(p) {} public: Children children; NodePointer parent; private: friend class serialization::access; template <class Archive> void serialize( Archive &ar, const unsigned int version ) { ar.register_type<Impl>(); ar & children; //ar & parent; } }; shared_ptr<Impl> pimpl; public: // constructor/destructor node() : pimpl( new Impl ) {} node( const wstring &n ) : nodebase(n), pimpl( new Impl ) {} node( const Children &v ) : pimpl( new Impl( v ) ) {} node( const Children &v, const NodePointer &p ) : pimpl( new Impl( v, p ) ) {} private: // serialization friend class serialization::access; template <class Archive> void serialize( Archive &ar, const unsigned int version ) { base_object<nodebase>(*this); void_cast_register<node, nodebase>(); ar.register_type<node>(); ar & pimpl; } public: // operations virtual void SetParent( const NodePointer &p ) { pimpl->parent = p; } virtual Children GetChildren( void ) { return pimpl->children; } virtual void AddChild( const NodePointer &child ) { this->pimpl->children.push_back( child ); } virtual void RemoveChild( const shared_ptr<nodebase> &child ) { for( ChildIterator i = pimpl->children.begin(); i != pimpl->children.end(); i++ ) { if( (*i).get() == child.get() ) { pimpl->children.erase( i ); break; } } } virtual void Traverse( const shared_ptr<nodebase> &node ) { if( !node ) { return; } #ifdef _DEBUG wcout << node->getname() << endl; #endif Children children = node->GetChildren(); for( ChildIterator i = children.begin(); i != children.end(); i++ ) { Traverse( *i ); } } void print() { for( Children::iterator i = pimpl->children.begin(); i != pimpl->children.end(); i++ ) { wcout << i->get()->getname() << endl; } } }; }; BOOST_CLASS_TRACKING(test::nodebase, boost::serialization::track_always); BOOST_CLASS_TRACKING(test::node, boost::serialization::track_always); int _tmain(int argc, _TCHAR* argv[]) { using namespace test; { node::NodePointer root( new node(wstring(L"root")) ); node::NodePointer c1( new node(wstring(L"c1")) ); node::NodePointer c2( new node(wstring(L"c2")) ); node::NodePointer c3( new node(wstring(L"c3")) ); node::NodePointer c4( new node(wstring(L"c4")) ); node::NodePointer c5( new node(wstring(L"c5")) ); c3->AddChild( c5 ); c1->AddChild( c3 ); c2->AddChild( c4 ); root->AddChild( c1 ); root->AddChild( c2 ); root->Traverse( root ); { // output wofstream ofile( "serialized.txt" ); try { archive::text_woarchive oa( ofile ); oa << (const node&)(*root); } catch( boost::archive::archive_exception &e ) { cout << "At the output : " << e.what() << endl; getchar(); ofile.close(); exit(1); } ofile.close(); } node::NodePointer in; { // input wifstream ifile( "serialized.txt" ); try { archive::text_wiarchive ia( ifile ); ia >> in; } catch( boost::archive::archive_exception &e ) { cout << "At the input : " << e.what() << endl; getchar(); ifile.close(); exit(e.code); } ifile.close(); } } getchar(); return 0; }

2 1

boost::filesystem drive letters?
by Jay Lawrence 29 Nov '07

29 Nov '07

Hi all, After a bit of searching around I am pretty sure I can't get a list of available drive letters with this library, does anyone know of a way to achieve? (platform independant would be ideal) Best, Jay

2 2

mpl::vector to boost::function
by Michael Linck 29 Nov '07

29 Nov '07

This my first attempt at using the boost::mpl library, so I may be off on the wrong track. If that's the case, please let me know and I'll come up with a different way to solve my problem. This seemed like a good practice case though. I'm trying to write a class that can test a function (eventually any function). The idea is that you specialize some number of arguments ( up to ten ) and then hand it a function. Then you feed "test cases" into it, which consist of arguments and an expected result. It seemed to me that TMP might be the key avoid having to write the template class 10 times (once for each number of template parameters). I thought it would look something like this: template<typename TestResultTA, typename TestInput1TA, typename TestInput2TA = void, typename TestInput3TA = void, typename TestInput4TA = void, typename TestInput5TA = void, typename TestInput6TA = void, typename TestInput7TA = void, typename TestInput8TA = void, typename TestInput9TA = void, typename TestInput10TA = void> class TestScenario { typedef boost::mpl::vector<TestInput1TA, TestInput2TA, TestInput3TA, TestInput4TA, TestInput5TA, TestInput6TA, TestInput7TA, TestInput8TA, TestInput9TA, TestInput10TA> TenArgs; typedef typename boost::mpl::find<TenArgs, void>::type FirstUnusedArg; typedef typename TenArgs::erase<TenArgs, FirstUnusedArg, TenArgs::end> JustTheArgs; // I know this is non-sense but what should go here? typedef boost::function2<TestResultTA, JustTheArgs> TestFunctionTS; . . . So far so good. I have a type that is a vector of the subset of template arguments that are initialized. I've thought about maybe trying to use #defines and recursion to create a template argument string for the boost::function, or something. That seems totally hideous, likely to fail, and my coworkers wouldn't accept it as maintainable code anyway just because of the #defines' presence. Is there an elegant way to go from a vector of types to an argument list for another template? I would have to use this mechanism to also specialize various other functions, like the one that accepts sets of arguments, and some kind of struct for holding those arguments at run-time. Thank you, mike

2 1