// boostdep - a tool to generate Boost dependency reports // // Copyright 2014, 2015 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt #include #include #include #include #include #include #include #include #include #include namespace fs = boost::filesystem; // header -> module static std::map< std::string, std::string > s_header_map; static std::set< std::string > s_modules; static void scan_module_headers( fs::path const & path ) { try { std::string module = path.generic_string().substr( 5 ); // strip "libs/" std::replace( module.begin(), module.end(), '/', '~' ); s_modules.insert( module ); fs::path dir = path / "include"; size_t n = dir.generic_string().size(); fs::recursive_directory_iterator it( dir ), last; for( ; it != last; ++it ) { fs::directory_entry const & e = *it; std::string p2 = e.path().generic_string(); p2 = p2.substr( n+1 ); // std::cout << module << ": " << p2 << std::endl; s_header_map[ p2 ] = module; } } catch( fs::filesystem_error const & x ) { std::cout << x.what() << std::endl; } } static void scan_submodules( fs::path const & path ) { fs::directory_iterator it( path ), last; for( ; it != last; ++it ) { fs::directory_entry const & e = *it; if( e.status().type() != fs::directory_file ) { continue; } fs::path path = e.path(); if( fs::exists( path / "include" ) ) { scan_module_headers( path ); } if( fs::exists( path / "sublibs" ) ) { scan_submodules( path ); } } } static void build_header_map() { scan_submodules( "libs" ); } static void scan_header_dependencies( std::string const & header, std::istream & is, std::map< std::string, std::set< std::string > > & deps, std::map< std::string, std::set< std::string > > & from ) { std::string line; while( std::getline( is, line ) ) { while( !line.empty() && ( line[0] == ' ' || line[0] == '\t' ) ) { line.erase( 0, 1 ); } if( line.empty() || line[0] != '#' ) continue; line.erase( 0, 1 ); while( !line.empty() && ( line[0] == ' ' || line[0] == '\t' ) ) { line.erase( 0, 1 ); } if( line.substr( 0, 7 ) != "include" ) continue; line.erase( 0, 7 ); while( !line.empty() && ( line[0] == ' ' || line[0] == '\t' ) ) { line.erase( 0, 1 ); } if( line.size() < 2 ) continue; char ch = line[0]; if( ch != '<' && ch != '"' ) continue; if( ch == '<' ) { ch = '>'; } line.erase( 0, 1 ); std::string::size_type k = line.find_first_of( ch ); if( k != std::string::npos ) { line.erase( k ); } std::map< std::string, std::string >::const_iterator i = s_header_map.find( line ); if( i != s_header_map.end() ) { deps[ i->second ].insert( line ); from[ line ].insert( header ); } else if( line.substr( 0, 6 ) == "boost/" ) { deps[ "(unknown)" ].insert( line ); from[ line ].insert( header ); } } } struct module_primary_actions { virtual void heading( std::string const & module ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void header_start( std::string const & header ) = 0; virtual void header_end( std::string const & header ) = 0; virtual void from_header( std::string const & header ) = 0; }; static fs::path module_include_path( std::string module ) { std::replace( module.begin(), module.end(), '~', '/' ); return fs::path( "libs" ) / module / "include"; } static fs::path module_source_path( std::string module ) { std::replace( module.begin(), module.end(), '~', '/' ); return fs::path( "libs" ) / module / "src"; } static fs::path module_build_path( std::string module ) { std::replace( module.begin(), module.end(), '~', '/' ); return fs::path( "libs" ) / module / "build"; } static void scan_module_dependencies( std::string const & module, module_primary_actions & actions, bool track_sources ) { // module -> [ header, header... ] std::map< std::string, std::set< std::string > > deps; // header -> included from [ header, header... ] std::map< std::string, std::set< std::string > > from; { fs::path dir = module_include_path( module ); size_t n = dir.generic_string().size(); fs::recursive_directory_iterator it( dir ), last; for( ; it != last; ++it ) { std::string header = it->path().generic_string().substr( n+1 ); fs::ifstream is( it->path() ); scan_header_dependencies( header, is, deps, from ); } } if( track_sources ) { fs::path dir = module_source_path( module ); size_t n = dir.generic_string().size(); if( fs::exists( dir ) ) { fs::recursive_directory_iterator it( dir ), last; for( ; it != last; ++it ) { std::string header = it->path().generic_string().substr( n+1 ); fs::ifstream is( it->path() ); scan_header_dependencies( header, is, deps, from ); } } } actions.heading( module ); for( std::map< std::string, std::set< std::string > >::iterator i = deps.begin(); i != deps.end(); ++i ) { if( i->first == module ) continue; actions.module_start( i->first ); for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { actions.header_start( *j ); std::set< std::string > const & f = from[ *j ]; for( std::set< std::string >::const_iterator k = f.begin(); k != f.end(); ++k ) { actions.from_header( *k ); } actions.header_end( *j ); } actions.module_end( i->first ); } } // module depends on [ module, module... ] static std::map< std::string, std::set< std::string > > s_module_deps; // header is included by [header, header...] static std::map< std::string, std::set< std::string > > s_header_deps; // [ module, module... ] depend on module static std::map< std::string, std::set< std::string > > s_reverse_deps; struct build_mdmap_actions: public module_primary_actions { std::string module_; std::string header_; void heading( std::string const & module ) { module_ = module; } void module_start( std::string const & module ) { s_module_deps[ module_ ].insert( module ); s_reverse_deps[ module ].insert( module_ ); } void module_end( std::string const & /*module*/ ) { } void header_start( std::string const & header ) { header_ = header; } void header_end( std::string const & /*header*/ ) { } void from_header( std::string const & header ) { s_header_deps[ header_ ].insert( header ); } }; static void build_module_dependency_map( bool track_sources ) { for( std::set< std::string >::iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { build_mdmap_actions actions; scan_module_dependencies( *i, actions, track_sources ); } } static void output_module_primary_report( std::string const & module, module_primary_actions & actions, bool track_sources ) { try { scan_module_dependencies( module, actions, track_sources ); } catch( fs::filesystem_error const & x ) { std::cout << x.what() << std::endl; } } struct module_secondary_actions { virtual void heading( std::string const & module ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void module_adds( std::string const & module ) = 0; }; static void exclude( std::set< std::string > & x, std::set< std::string > const & y ) { for( std::set< std::string >::const_iterator i = y.begin(); i != y.end(); ++i ) { x.erase( *i ); } } static void output_module_secondary_report( std::string const & module, module_secondary_actions & actions ) { actions.heading( module ); std::set< std::string > deps = s_module_deps[ module ]; deps.insert( module ); // build transitive closure for( ;; ) { std::set< std::string > deps2( deps ); for( std::set< std::string >::iterator i = deps.begin(); i != deps.end(); ++i ) { std::set< std::string > deps3 = s_module_deps[ *i ]; exclude( deps3, deps ); if( deps3.empty() ) { continue; } actions.module_start( *i ); for( std::set< std::string >::iterator j = deps3.begin(); j != deps3.end(); ++j ) { actions.module_adds( *j ); } actions.module_end( *i ); deps2.insert( deps3.begin(), deps3.end() ); } if( deps == deps2 ) { break; } else { deps = deps2; } } } struct header_inclusion_actions { virtual void heading( std::string const & header, std::string const & module ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void header( std::string const & header ) = 0; }; static void output_header_inclusion_report( std::string const & header, header_inclusion_actions & actions ) { std::string module = s_header_map[ header ]; actions.heading( header, module ); std::set< std::string > from = s_header_deps[ header ]; // classify 'from' dependencies by module // module -> [header, header...] std::map< std::string, std::set< std::string > > from2; for( std::set< std::string >::iterator i = from.begin(); i != from.end(); ++i ) { from2[ s_header_map[ *i ] ].insert( *i ); } for( std::map< std::string, std::set< std::string > >::iterator i = from2.begin(); i != from2.end(); ++i ) { actions.module_start( i->first ); for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { actions.header( *j ); } actions.module_end( i->first ); } } // output_module_primary_report struct module_primary_txt_actions: public module_primary_actions { void heading( std::string const & module ) { std::cout << "Primary dependencies for " << module << ":\n\n"; } void module_start( std::string const & module ) { std::cout << module << ":\n"; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void header_start( std::string const & header ) { std::cout << " <" << header << ">\n"; } void header_end( std::string const & /*header*/ ) { } void from_header( std::string const & header ) { std::cout << " from <" << header << ">\n"; } }; struct module_primary_html_actions: public module_primary_actions { void heading( std::string const & module ) { std::cout << "\n\n

Primary dependencies for " << module << "

\n"; } void module_start( std::string const & module ) { std::cout << "

" << module << "

\n"; } void module_end( std::string const & /*module*/ ) { } void header_start( std::string const & header ) { std::cout << "

<" << header << ">

    \n"; } void header_end( std::string const & /*header*/ ) { std::cout << "
\n"; } void from_header( std::string const & header ) { std::cout << "
  • from <" << header << ">
  • \n"; } }; static void output_module_primary_report( std::string const & module, bool html, bool track_sources ) { if( html ) { module_primary_html_actions actions; output_module_primary_report( module, actions, track_sources ); } else { module_primary_txt_actions actions; output_module_primary_report( module, actions, track_sources ); } } // output_module_secondary_report struct module_secondary_txt_actions: public module_secondary_actions { void heading( std::string const & module ) { std::cout << "Secondary dependencies for " << module << ":\n\n"; } void module_start( std::string const & module ) { std::cout << module << ":\n"; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void module_adds( std::string const & module ) { std::cout << " adds " << module << "\n"; } }; struct module_secondary_html_actions: public module_secondary_actions { std::string m2_; void heading( std::string const & module ) { std::cout << "\n\n

    Secondary dependencies for " << module << "

    \n"; } void module_start( std::string const & module ) { std::cout << "

    " << module << "

      \n"; m2_ = module; } void module_end( std::string const & /*module*/ ) { std::cout << "
    \n"; } void module_adds( std::string const & module ) { std::cout << "
  • adds " << module << "
  • \n"; } }; static void output_module_secondary_report( std::string const & module, bool html ) { if( html ) { module_secondary_html_actions actions; output_module_secondary_report( module, actions ); } else { module_secondary_txt_actions actions; output_module_secondary_report( module, actions ); } } // output_header_report struct header_inclusion_txt_actions: public header_inclusion_actions { void heading( std::string const & header, std::string const & module ) { std::cout << "Inclusion report for <" << header << "> (in module " << module << "):\n\n"; } void module_start( std::string const & module ) { std::cout << " from " << module << ":\n"; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void header( std::string const & header ) { std::cout << " <" << header << ">\n"; } }; struct header_inclusion_html_actions: public header_inclusion_actions { void heading( std::string const & header, std::string const & module ) { std::cout << "

    Inclusion report for <" << header << "> (in module " << module << ")

    \n"; } void module_start( std::string const & module ) { std::cout << "

    From " << module << "

      \n"; } void module_end( std::string const & /*module*/ ) { std::cout << "
    \n"; } void header( std::string const & header ) { std::cout << "
  • <" << header << ">
  • \n"; } }; static void output_header_report( std::string const & header, bool html ) { if( html ) { header_inclusion_html_actions actions; output_header_inclusion_report( header, actions ); } else { header_inclusion_txt_actions actions; output_header_inclusion_report( header, actions ); } } // output_module_reverse_report struct module_reverse_actions { virtual void heading( std::string const & module ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void header_start( std::string const & header ) = 0; virtual void header_end( std::string const & header ) = 0; virtual void from_header( std::string const & header ) = 0; }; static void output_module_reverse_report( std::string const & module, module_reverse_actions & actions ) { actions.heading( module ); std::set< std::string > const from = s_reverse_deps[ module ]; for( std::set< std::string >::const_iterator i = from.begin(); i != from.end(); ++i ) { actions.module_start( *i ); for( std::map< std::string, std::set< std::string > >::iterator j = s_header_deps.begin(); j != s_header_deps.end(); ++j ) { if( s_header_map[ j->first ] == module ) { bool header_started = false; for( std::set< std::string >::iterator k = j->second.begin(); k != j->second.end(); ++k ) { if( s_header_map[ *k ] == *i ) { if( !header_started ) { actions.header_start( j->first ); header_started = true; } actions.from_header( *k ); } } if( header_started ) { actions.header_end( j->first ); } } } actions.module_end( *i ); } } struct module_reverse_txt_actions: public module_reverse_actions { void heading( std::string const & module ) { std::cout << "Reverse dependencies for " << module << ":\n\n"; } void module_start( std::string const & module ) { std::cout << module << ":\n"; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void header_start( std::string const & header ) { std::cout << " <" << header << ">\n"; } void header_end( std::string const & /*header*/ ) { } void from_header( std::string const & header ) { std::cout << " from <" << header << ">\n"; } }; struct module_reverse_html_actions: public module_reverse_actions { void heading( std::string const & module ) { std::cout << "\n\n

    Reverse dependencies for " << module << "

    \n"; } void module_start( std::string const & module ) { std::cout << "

    " << module << "

    \n"; } void module_end( std::string const & /*module*/ ) { } void header_start( std::string const & header ) { std::cout << "

    <" << header << ">

      \n"; } void header_end( std::string const & /*header*/ ) { std::cout << "
    \n"; } void from_header( std::string const & header ) { std::cout << "
  • from <" << header << ">
  • \n"; } }; static void output_module_reverse_report( std::string const & module, bool html ) { if( html ) { module_reverse_html_actions actions; output_module_reverse_report( module, actions ); } else { module_reverse_txt_actions actions; output_module_reverse_report( module, actions ); } } // module_level_report int const unknown_level = INT_MAX / 2; struct module_level_actions { virtual void heading() = 0; virtual void level_start( int level ) = 0; virtual void level_end( int level ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void module2( std::string const & module, int level ) = 0; }; static void output_module_level_report( module_level_actions & actions ) { // build module level map std::map< std::string, int > level_map; for( std::set< std::string >::iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { if( s_module_deps[ *i ].empty() ) { level_map[ *i ] = 0; // std::cerr << *i << ": " << 0 << std::endl; } else { level_map[ *i ] = unknown_level; } } // build transitive closure to see through cycles std::map< std::string, std::set< std::string > > deps2 = s_module_deps; { bool done; do { done = true; for( std::map< std::string, std::set< std::string > >::iterator i = deps2.begin(); i != deps2.end(); ++i ) { std::set< std::string > tmp = i->second; for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { std::set< std::string > tmp2 = deps2[ *j ]; tmp.insert( tmp2.begin(), tmp2.end() ); } if( tmp.size() != i->second.size() ) { i->second = tmp; done = false; } } } while( !done ); } // compute acyclic levels for( int k = 1, n = s_modules.size(); k < n; ++k ) { for( std::map< std::string, std::set< std::string > >::iterator i = s_module_deps.begin(); i != s_module_deps.end(); ++i ) { // i->first depends on i->second if( level_map[ i->first ] >= unknown_level ) { int level = 0; for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { level = std::max( level, level_map[ *j ] + 1 ); } if( level == k ) { level_map[ i->first ] = level; // std::cerr << i->first << ": " << level << std::endl; } } } } // min_level_map[ M ] == L means the level is unknown, but at least L std::map< std::string, int > min_level_map; // initialize min_level_map for acyclic dependencies for( std::map< std::string, int >::iterator i = level_map.begin(); i != level_map.end(); ++i ) { if( i->second < unknown_level ) { min_level_map[ i->first ] = i->second; } } // compute levels for cyclic modules for( int k = 1, n = s_modules.size(); k < n; ++k ) { for( std::map< std::string, std::set< std::string > >::iterator i = s_module_deps.begin(); i != s_module_deps.end(); ++i ) { if( level_map[ i->first ] >= unknown_level ) { int level = 0; for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { int jl = level_map[ *j ]; if( jl < unknown_level ) { level = std::max( level, jl + 1 ); } else { int ml = min_level_map[ *j ]; if( deps2[ *j ].count( i->first ) == 0 ) { // *j does not depend on i->first, so // the level of i->first is at least // 1 + the minimum level of *j ++ml; } level = std::max( level, ml ); } } min_level_map[ i->first ] = level; } } } // reverse level map std::map< int, std::set< std::string > > reverse_level_map; for( std::map< std::string, int >::iterator i = level_map.begin(); i != level_map.end(); ++i ) { int level = i->second; if( level >= unknown_level ) { int min_level = min_level_map[ i->first ]; if( min_level != 0 ) { level = min_level; } } reverse_level_map[ level ].insert( i->first ); } // output report actions.heading(); for( std::map< int, std::set< std::string > >::iterator i = reverse_level_map.begin(); i != reverse_level_map.end(); ++i ) { actions.level_start( i->first ); for( std::set< std::string >::iterator j = i->second.begin(); j != i->second.end(); ++j ) { actions.module_start( *j ); std::set< std::string > mdeps = s_module_deps[ *j ]; for( std::set< std::string >::iterator k = mdeps.begin(); k != mdeps.end(); ++k ) { int level = level_map[ *k ]; if( level >= unknown_level ) { int min_level = min_level_map[ *k ]; if( min_level != 0 ) { level = min_level; } } actions.module2( *k, level ); } actions.module_end( *j ); } actions.level_end( i->first ); } } struct module_level_txt_actions: public module_level_actions { int level_; void heading() { std::cout << "Module Levels:\n\n"; } void level_start( int level ) { if( level >= unknown_level ) { std::cout << "Level (undetermined):\n"; } else { std::cout << "Level " << level << ":\n"; } level_ = level; } void level_end( int /*level*/ ) { std::cout << "\n"; } void module_start( std::string const & module ) { std::cout << " " << module; if( level_ > 0 ) { std::cout << " ->"; } } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void module2( std::string const & module, int level ) { std::cout << " " << module << "("; if( level >= unknown_level ) { std::cout << "-"; } else { std::cout << level; } std::cout << ")"; } }; struct module_level_html_actions: public module_level_actions { int level_; void heading() { std::cout << "

    Module Levels

    \n"; } void level_start( int level ) { std::cout << "

    Level "; if( level >= unknown_level ) { std::cout << "undetermined"; } else { std::cout << level; } std::cout << "

      \n"; level_ = level; } void level_end( int /*level*/ ) { std::cout << "
    \n"; } void module_start( std::string const & module ) { std::cout << "
  • " << module << ""; if( level_ > 0 ) { std::cout << "
    ⇢"; } } void module_end( std::string const & /*module*/ ) { std::cout << "
  • \n"; } void module2( std::string const & module, int level ) { std::cout << " "; bool important = level < unknown_level && level > 1 && level >= level_ - 1; if( important ) { std::cout << ""; } std::cout << module; if( level < unknown_level ) { std::cout << "" << level << ""; } if( important ) { std::cout << ""; } } }; static void output_module_level_report( bool html ) { if( html ) { module_level_html_actions actions; output_module_level_report( actions ); } else { module_level_txt_actions actions; output_module_level_report( actions ); } } // module_overview_report struct module_overview_actions { virtual void heading() = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void module2( std::string const & module ) = 0; }; static void output_module_overview_report( module_overview_actions & actions ) { actions.heading(); for( std::set< std::string >::iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { actions.module_start( *i ); std::set< std::string > const mdeps = s_module_deps[ *i ]; for( std::set< std::string >::const_iterator j = mdeps.begin(); j != mdeps.end(); ++j ) { actions.module2( *j ); } actions.module_end( *i ); } } struct module_overview_txt_actions: public module_overview_actions { bool deps_; void heading() { std::cout << "Module Overview:\n\n"; } void module_start( std::string const & module ) { std::cout << module; deps_ = false; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void module2( std::string const & module ) { if( !deps_ ) { std::cout << " ->"; deps_ = true; } std::cout << " " << module; } }; struct module_overview_html_actions: public module_overview_actions { bool deps_; void heading() { std::cout << "

    Module Overview

    \n"; } void module_start( std::string const & module ) { std::cout << "

    " << module << "

    "; deps_ = false; } void module_end( std::string const & /*module*/ ) { std::cout << "

    \n"; } void module2( std::string const & module ) { if( !deps_ ) { std::cout << "⇢"; deps_ = true; } std::cout << " " << module; } }; static void output_module_overview_report( bool html ) { if( html ) { module_overview_html_actions actions; output_module_overview_report( actions ); } else { module_overview_txt_actions actions; output_module_overview_report( actions ); } } // list_dependencies struct list_dependencies_actions: public module_overview_actions { void heading() { } void module_start( std::string const & module ) { std::cout << module << " ->"; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void module2( std::string const & module ) { if( module != "(unknown)" ) { std::cout << " " << module; } } }; static void list_dependencies() { list_dependencies_actions actions; output_module_overview_report( actions ); } // static void output_html_header( std::string const & title ) { std::cout << "\n"; std::cout << "\n"; std::cout << "" << title << "\n"; std::cout << "\n"; std::cout << "\n"; } static void output_html_footer( std::string const & footer ) { std::cout << "
    \n"; std::cout << "

    " << footer << "

    \n"; std::cout << "\n"; std::cout << "\n"; } static void enable_secondary( bool & secondary, bool track_sources ) { if( !secondary ) { try { build_module_dependency_map( track_sources ); } catch( fs::filesystem_error const & x ) { std::cout << x.what() << std::endl; } secondary = true; } } static void list_modules() { for( std::set< std::string >::iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { std::cout << *i << "\n"; } } static void list_buildable() { for( std::set< std::string >::iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { if( fs::exists( module_build_path( *i ) ) && fs::exists( module_source_path( *i ) ) ) { std::cout << *i << "\n"; } } } // module_weight_report struct module_weight_actions { virtual void heading() = 0; virtual void weight_start( int weight ) = 0; virtual void weight_end( int weight ) = 0; virtual void module_start( std::string const & module ) = 0; virtual void module_end( std::string const & module ) = 0; virtual void module_primary_start() = 0; virtual void module_primary( std::string const & module, int weight ) = 0; virtual void module_primary_end() = 0; virtual void module_secondary_start() = 0; virtual void module_secondary( std::string const & module, int weight ) = 0; virtual void module_secondary_end() = 0; }; static void output_module_weight_report( module_weight_actions & actions ) { // gather secondary dependencies struct build_secondary_deps: public module_secondary_actions { std::map< std::string, std::set< std::string > > * pm_; build_secondary_deps( std::map< std::string, std::set< std::string > > * pm ): pm_( pm ) { } std::string module_; void heading( std::string const & module ) { module_ = module; } void module_start( std::string const & /*module*/ ) { } void module_end( std::string const & /*module*/ ) { } void module_adds( std::string const & module ) { (*pm_)[ module_ ].insert( module ); } }; std::map< std::string, std::set< std::string > > secondary_deps; build_secondary_deps bsd( &secondary_deps ); for( std::set< std::string >::const_iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { output_module_secondary_report( *i, bsd ); } // build weight map std::map< int, std::set< std::string > > modules_by_weight; for( std::set< std::string >::const_iterator i = s_modules.begin(); i != s_modules.end(); ++i ) { int w = s_module_deps[ *i ].size() + secondary_deps[ *i ].size(); modules_by_weight[ w ].insert( *i ); } // output report actions.heading(); for( std::map< int, std::set< std::string > >::const_iterator i = modules_by_weight.begin(); i != modules_by_weight.end(); ++i ) { actions.weight_start( i->first ); for( std::set< std::string >::const_iterator j = i->second.begin(); j != i->second.end(); ++j ) { actions.module_start( *j ); if( !s_module_deps[ *j ].empty() ) { actions.module_primary_start(); for( std::set< std::string >::const_iterator k = s_module_deps[ *j ].begin(); k != s_module_deps[ *j ].end(); ++k ) { int w = s_module_deps[ *k ].size() + secondary_deps[ *k ].size(); actions.module_primary( *k, w ); } actions.module_primary_end(); } if( !secondary_deps[ *j ].empty() ) { actions.module_secondary_start(); for( std::set< std::string >::const_iterator k = secondary_deps[ *j ].begin(); k != secondary_deps[ *j ].end(); ++k ) { int w = s_module_deps[ *k ].size() + secondary_deps[ *k ].size(); actions.module_secondary( *k, w ); } actions.module_secondary_end(); } actions.module_end( *j ); } actions.weight_end( i->first ); } } struct module_weight_txt_actions: public module_weight_actions { void heading() { std::cout << "Module Weights:\n\n"; } void weight_start( int weight ) { std::cout << "Weight " << weight << ":\n"; } void weight_end( int /*weight*/ ) { std::cout << "\n"; } void module_start( std::string const & module ) { std::cout << " " << module; } void module_end( std::string const & /*module*/ ) { std::cout << "\n"; } void module_primary_start() { std::cout << " ->"; } void module_primary( std::string const & module, int weight ) { std::cout << " " << module << "(" << weight << ")"; } void module_primary_end() { } void module_secondary_start() { std::cout << " ->"; } void module_secondary( std::string const & module, int /*weight*/ ) { std::cout << " " << module; } void module_secondary_end() { } }; struct module_weight_html_actions: public module_weight_actions { int weight_; void heading() { std::cout << "

    Module Weights

    \n"; } void weight_start( int weight ) { std::cout << "

    Weight " << weight << "

      \n"; weight_ = weight; } void weight_end( int /*weight*/ ) { std::cout << "
    \n"; } void module_start( std::string const & module ) { std::cout << "
  • " << module << ""; } void module_end( std::string const & /*module*/ ) { std::cout << "
  • \n"; } void module_primary_start() { std::cout << "
    ⇢"; } void module_primary( std::string const & module, int weight ) { std::cout << " "; bool heavy = weight >= 0.8 * weight_; if( heavy ) { std::cout << ""; } std::cout << module << "" << weight << ""; if( heavy ) { std::cout << ""; } } void module_primary_end() { } void module_secondary_start() { std::cout << "
    ⇢"; } void module_secondary( std::string const & module, int /*weight*/ ) { std::cout << " " << module; } void module_secondary_end() { std::cout << ""; } }; static void output_module_weight_report( bool html ) { if( html ) { module_weight_html_actions actions; output_module_weight_report( actions ); } else { module_weight_txt_actions actions; output_module_weight_report( actions ); } } int main( int argc, char const* argv[] ) { if( argc < 2 ) { std::cout << "Usage:\n" "\n" " boostdep --list-modules\n"; " boostdep --list-buildable\n"; " boostdep [--track-sources] --list-dependencies\n"; "\n"; " boostdep [options] --module-overview\n"; " boostdep [options] --module-levels\n"; " boostdep [options] --module-weights\n"; "\n"; " boostdep [options] [--primary] \n"; " boostdep [options] --secondary \n"; " boostdep [options] --reverse \n"; " boostdep [options] [--header]
    \n"; "\n"; " [options]: [--track-sources] [--title ] [--footer <footer>] [--html]\n"; return -1; } try { build_header_map(); } catch( fs::filesystem_error const & x ) { std::cout << x.what() << std::endl; } bool html = false; bool secondary = false; bool track_sources = false; std::string title = "Boost Dependency Report"; std::string footer; for( int i = 1; i < argc; ++i ) { std::string option = argv[ i ]; if( option == "--list-modules" ) { list_modules(); } else if( option == "--list-buildable" ) { list_buildable(); } else if( option == "--title" ) { if( i + 1 < argc ) { title = argv[ ++i ]; } } else if( option == "--footer" ) { if( i + 1 < argc ) { footer = argv[ ++i ]; } } else if( option == "--html" ) { if( !html ) { html = true; output_html_header( title ); } } else if( option == "--track-sources" ) { track_sources = true; } else if( option == "--primary" ) { if( i + 1 < argc ) { output_module_primary_report( argv[ ++i ], html, track_sources ); } } else if( option == "--secondary" ) { if( i + 1 < argc ) { enable_secondary( secondary, track_sources ); output_module_secondary_report( argv[ ++i ], html ); } } else if( option == "--reverse" ) { if( i + 1 < argc ) { enable_secondary( secondary, track_sources ); output_module_reverse_report( argv[ ++i ], html ); } } else if( option == "--header" ) { if( i + 1 < argc ) { enable_secondary( secondary, track_sources ); output_header_report( argv[ ++i ], html ); } } else if( option == "--module-levels" ) { enable_secondary( secondary, track_sources ); output_module_level_report( html ); } else if( option == "--module-overview" ) { enable_secondary( secondary, track_sources ); output_module_overview_report( html ); } else if( option == "--module-weights" ) { enable_secondary( secondary, track_sources ); output_module_weight_report( html ); } else if( option == "--list-dependencies" ) { enable_secondary( secondary, track_sources ); list_dependencies(); } else if( s_modules.count( option ) ) { output_module_primary_report( option, html, track_sources ); } else if( s_header_map.count( option ) ) { enable_secondary( secondary, track_sources ); output_header_report( option, html ); } else { std::cerr << "'" << option << "': not an option, module or header.\n"; } } if( html ) { output_html_footer( footer ); } }