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 for(const auto &kvp: builder.get_build_graph().get_targets())
29 for(Target *d: kvp.second->get_dependencies())
30 rdepends[d].insert(kvp.second);
31 for(Target *d: kvp.second->get_transitive_dependencies())
32 rdepends[d].insert(kvp.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 for(Target *d: goals.get_dependencies())
50 build_depend_table(*d, 0);
53 build_depend_table(goals, 0);
58 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
60 Target *real = tgt.get_real_target();
63 // Skip trivial targets
65 return build_depend_table(*real, depth);
66 if(const ObjectFile *obj = dynamic_cast<const ObjectFile *>(&tgt))
67 return build_depend_table(obj->get_source(), depth);
69 else if(mode==REBUILD && !tgt.needs_rebuild())
70 /* All targets that depend on to-be-built targets will be rebuilt
71 themselves, so we can stop here. */
77 const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
79 name = ft->get_path().str();
81 name = tgt.get_name();
82 row.push_back(string(depth*2, ' ')+name);
84 const Package *pkg = tgt.get_package();
86 row.push_back(pkg->get_name());
90 row.push_back(tgt.get_type());
91 const Tool *tool = tgt.get_tool();
93 row.push_back(tool->get_tag());
97 if(tgt.needs_rebuild())
98 row.push_back(tgt.get_rebuild_reason());
100 table.push_back(row);
102 if(!max_depth || depth<max_depth-1)
104 Target::Dependencies depends;
107 const set<Target *> &rdeps = rdepends[&tgt];
108 depends.assign(rdeps.begin(), rdeps.end());
112 depends = tgt.get_dependencies();
113 const Target::Dependencies &tdeps = tgt.get_transitive_dependencies();
114 depends.insert(depends.end(), tdeps.begin(), tdeps.end());
117 depends.sort(full_paths ? target_order_full : target_order);
119 for(Target *d: depends)
120 build_depend_table(*d, depth+1);
124 void Analyzer::print_table() const
126 vector<string::size_type> col_width;
128 // Determine column widths
129 for(const vector<string> &r: table)
131 if(col_width.size()<r.size())
132 col_width.resize(r.size(), 0);
133 for(unsigned j=0; j<r.size(); ++j)
134 col_width[j] = max(col_width[j], r[j].size());
137 for(const vector<string> &r: table)
140 for(unsigned j=0; j<r.size(); ++j)
144 line += lexical_cast<string>(r[j], Fmt("%-s").width(col_width[j]));
146 IO::print("%s\n", line);
150 bool Analyzer::target_order(const Target *t1, const Target *t2)
152 return t1->get_name()<t2->get_name();
155 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
157 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
158 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
163 return target_order(t1, t2);
167 return ft1->get_path().str()<ft2->get_path().str();