1 #include <msp/fs/utils.h>
2 #include <msp/io/print.h>
5 #include "buildgraph.h"
6 #include "objectfile.h"
7 #include "sourcefile.h"
8 #include "sourcepackage.h"
15 Analyzer::Analyzer(Builder &b):
22 void Analyzer::analyze()
27 const BuildGraph::TargetMap &targets = builder.get_build_graph().get_targets();
28 for(BuildGraph::TargetMap::const_iterator i=targets.begin(); i!=targets.end(); ++i)
30 const Target::Dependencies &depends = i->second->get_dependencies();
31 for(Target::Dependencies::const_iterator j=depends.begin(); j!=depends.end(); ++j)
32 rdepends[*j].insert(i->second);
39 row.push_back("Name");
40 row.push_back("Package");
41 row.push_back("Type");
42 row.push_back("Tool");
43 row.push_back("Rebuild");
46 Target &goals = builder.get_build_graph().get_goals();
49 const Target::Dependencies &deps = goals.get_dependencies();
50 for(Target::Dependencies::const_iterator i=deps.begin(); i!=deps.end(); ++i)
51 build_depend_table(**i, 0);
54 build_depend_table(goals, 0);
59 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
61 Target *real = tgt.get_real_target();
64 // Skip trivial targets
66 return build_depend_table(*real, depth);
67 if(const ObjectFile *obj = dynamic_cast<const ObjectFile *>(&tgt))
68 return build_depend_table(obj->get_source(), depth);
70 else if(mode==REBUILD && !tgt.needs_rebuild())
71 /* All targets that depend on to-be-built targets will be rebuilt
72 themselves, so we can stop here. */
78 const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
80 name = ft->get_path().str();
82 name = tgt.get_name();
83 row.push_back(string(depth*2, ' ')+name);
85 const Package *pkg = tgt.get_package();
87 row.push_back(pkg->get_name());
91 row.push_back(tgt.get_type());
92 const Tool *tool = tgt.get_tool();
94 row.push_back(tool->get_tag());
98 if(tgt.needs_rebuild())
99 row.push_back(tgt.get_rebuild_reason());
101 table.push_back(row);
103 if(!max_depth || depth<max_depth-1)
105 Target::Dependencies depends;
108 const set<Target *> &rdeps = rdepends[&tgt];
109 depends.assign(rdeps.begin(), rdeps.end());
112 depends = tgt.get_dependencies();
114 depends.sort(full_paths ? target_order_full : target_order);
116 for(Target::Dependencies::const_iterator i=depends.begin(); i!=depends.end(); ++i)
117 build_depend_table(**i, depth+1);
121 void Analyzer::print_table() const
123 vector<string::size_type> col_width;
125 // Determine column widths
126 for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
128 if(col_width.size()<i->size())
129 col_width.resize(i->size(), 0);
130 for(unsigned j=0; j<i->size(); ++j)
131 col_width[j] = max(col_width[j], (*i)[j].size());
134 for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
137 for(unsigned j=0; j<i->size(); ++j)
141 line += lexical_cast<string>((*i)[j], Fmt("%-s").width(col_width[j]));
143 IO::print("%s\n", line);
147 bool Analyzer::target_order(const Target *t1, const Target *t2)
149 return t1->get_name()<t2->get_name();
152 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
154 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
155 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
160 return target_order(t1, t2);
164 return ft1->get_path().str()<ft2->get_path().str();