1 #include <msp/core/algorithm.h>
2 #include <msp/fs/utils.h>
3 #include <msp/io/print.h>
6 #include "buildgraph.h"
7 #include "objectfile.h"
8 #include "sourcefile.h"
9 #include "sourcepackage.h"
16 Analyzer::Analyzer(Builder &b):
20 void Analyzer::analyze()
25 for(const auto &kvp: builder.get_build_graph().get_targets())
27 for(Target *d: kvp.second->get_dependencies())
28 rdepends[d].insert(kvp.second);
29 for(Target *d: kvp.second->get_transitive_dependencies())
30 rdepends[d].insert(kvp.second);
37 row.push_back("Name");
38 row.push_back("Package");
39 row.push_back("Type");
40 row.push_back("Tool");
41 row.push_back("Rebuild");
44 Target &goals = builder.get_build_graph().get_goals();
47 for(Target *d: goals.get_dependencies())
48 build_depend_table(*d, 0);
51 build_depend_table(goals, 0);
56 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
58 Target *real = tgt.get_real_target();
61 // Skip trivial targets
63 return build_depend_table(*real, depth);
64 if(const ObjectFile *obj = dynamic_cast<const ObjectFile *>(&tgt))
65 return build_depend_table(obj->get_source(), depth);
67 else if(mode==REBUILD && !tgt.needs_rebuild())
68 /* All targets that depend on to-be-built targets will be rebuilt
69 themselves, so we can stop here. */
75 const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
77 name = ft->get_path().str();
79 name = tgt.get_name();
80 row.push_back(string(depth*2, ' ')+name);
82 const Package *pkg = tgt.get_package();
84 row.push_back(pkg->get_name());
88 row.push_back(tgt.get_type());
89 const Tool *tool = tgt.get_tool();
91 row.push_back(tool->get_tag());
95 if(tgt.needs_rebuild())
96 row.push_back(tgt.get_rebuild_reason());
100 if(!max_depth || depth<max_depth-1)
102 Target::Dependencies depends;
105 const set<Target *> &rdeps = rdepends[&tgt];
106 depends.assign(rdeps.begin(), rdeps.end());
110 depends = tgt.get_dependencies();
111 const Target::Dependencies &tdeps = tgt.get_transitive_dependencies();
112 depends.insert(depends.end(), tdeps.begin(), tdeps.end());
115 sort(depends, (full_paths ? target_order_full : target_order));
117 for(Target *d: depends)
118 build_depend_table(*d, depth+1);
122 void Analyzer::print_table() const
124 vector<string::size_type> col_width;
126 // Determine column widths
127 for(const vector<string> &r: table)
129 if(col_width.size()<r.size())
130 col_width.resize(r.size(), 0);
131 for(unsigned j=0; j<r.size(); ++j)
132 col_width[j] = max(col_width[j], r[j].size());
135 for(const vector<string> &r: table)
138 for(unsigned j=0; j<r.size(); ++j)
142 line += lexical_cast<string>(r[j], Fmt("%-s").width(col_width[j]));
144 IO::print("%s\n", line);
148 bool Analyzer::target_order(const Target *t1, const Target *t2)
150 return t1->get_name()<t2->get_name();
153 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
155 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
156 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
161 return target_order(t1, t2);
165 return ft1->get_path().str()<ft2->get_path().str();