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):
23 void Analyzer::analyze()
28 for(const auto &kvp: builder.get_build_graph().get_targets())
30 for(Target *d: kvp.second->get_dependencies())
31 rdepends[d].insert(kvp.second);
32 for(Target *d: kvp.second->get_transitive_dependencies())
33 rdepends[d].insert(kvp.second);
40 row.push_back("Name");
41 row.push_back("Package");
42 row.push_back("Type");
43 row.push_back("Tool");
44 row.push_back("Rebuild");
47 Target &goals = builder.get_build_graph().get_goals();
50 for(Target *d: goals.get_dependencies())
51 build_depend_table(*d, 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());
113 depends = tgt.get_dependencies();
114 const Target::Dependencies &tdeps = tgt.get_transitive_dependencies();
115 depends.insert(depends.end(), tdeps.begin(), tdeps.end());
118 sort(depends, (full_paths ? target_order_full : target_order));
120 for(Target *d: depends)
121 build_depend_table(*d, depth+1);
125 void Analyzer::print_table() const
127 vector<string::size_type> col_width;
129 // Determine column widths
130 for(const vector<string> &r: table)
132 if(col_width.size()<r.size())
133 col_width.resize(r.size(), 0);
134 for(unsigned j=0; j<r.size(); ++j)
135 col_width[j] = max(col_width[j], r[j].size());
138 for(const vector<string> &r: table)
141 for(unsigned j=0; j<r.size(); ++j)
145 line += lexical_cast<string>(r[j], Fmt("%-s").width(col_width[j]));
147 IO::print("%s\n", line);
151 bool Analyzer::target_order(const Target *t1, const Target *t2)
153 return t1->get_name()<t2->get_name();
156 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
158 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
159 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
164 return target_order(t1, t2);
168 return ft1->get_path().str()<ft2->get_path().str();