1 #include <msp/builder/builder.h>
2 #include <msp/builder/buildgraph.h>
3 #include <msp/builder/objectfile.h>
4 #include <msp/builder/sourcefile.h>
5 #include <msp/builder/sourcepackage.h>
6 #include <msp/builder/target.h>
7 #include <msp/builder/tool.h>
8 #include <msp/core/algorithm.h>
9 #include <msp/fs/utils.h>
10 #include <msp/io/print.h>
16 void Analyzer::analyze()
21 for(const auto &kvp: builder.get_build_graph().get_targets())
23 for(Target *d: kvp.second->get_dependencies())
24 rdepends[d].insert(kvp.second);
25 for(Target *d: kvp.second->get_transitive_dependencies())
26 rdepends[d].insert(kvp.second);
33 row.push_back("Name");
34 row.push_back("Package");
35 row.push_back("Type");
36 row.push_back("Tool");
37 row.push_back("Rebuild");
40 Target &goals = builder.get_build_graph().get_goals();
43 for(Target *d: goals.get_dependencies())
44 build_depend_table(*d, 0);
47 build_depend_table(goals, 0);
52 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
54 Target *real = tgt.get_real_target();
57 // Skip trivial targets
59 return build_depend_table(*real, depth);
60 if(const ObjectFile *obj = dynamic_cast<const ObjectFile *>(&tgt))
61 return build_depend_table(obj->get_source(), depth);
63 else if(mode==REBUILD && !tgt.needs_rebuild())
64 /* All targets that depend on to-be-built targets will be rebuilt
65 themselves, so we can stop here. */
71 const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
73 name = ft->get_path().str();
75 name = tgt.get_name();
76 row.push_back(string(depth*2, ' ')+name);
78 const Package *pkg = tgt.get_package();
80 row.push_back(pkg->get_name());
84 row.push_back(tgt.get_type());
85 const Tool *tool = tgt.get_tool();
87 row.push_back(tool->get_tag());
91 if(tgt.needs_rebuild())
92 row.push_back(tgt.get_rebuild_reason());
96 if(!max_depth || depth<max_depth-1)
98 Target::Dependencies depends;
101 const set<Target *> &rdeps = rdepends[&tgt];
102 depends.assign(rdeps.begin(), rdeps.end());
106 depends = tgt.get_dependencies();
107 const Target::Dependencies &tdeps = tgt.get_transitive_dependencies();
108 depends.insert(depends.end(), tdeps.begin(), tdeps.end());
111 sort(depends, (full_paths ? target_order_full : target_order));
113 for(Target *d: depends)
114 build_depend_table(*d, depth+1);
118 void Analyzer::print_table() const
120 vector<string::size_type> col_width;
122 // Determine column widths
123 for(const vector<string> &r: table)
125 if(col_width.size()<r.size())
126 col_width.resize(r.size(), 0);
127 for(unsigned j=0; j<r.size(); ++j)
128 col_width[j] = max(col_width[j], r[j].size());
131 for(const vector<string> &r: table)
134 for(unsigned j=0; j<r.size(); ++j)
138 line += lexical_cast<string>(r[j], Fmt("%-s").width(col_width[j]));
140 IO::print("%s\n", line);
144 bool Analyzer::target_order(const Target *t1, const Target *t2)
146 return t1->get_name()<t2->get_name();
149 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
151 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
152 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
157 return target_order(t1, t2);
161 return ft1->get_path().str()<ft2->get_path().str();