1 #include <msp/fs/utils.h>
2 #include <msp/io/print.h>
6 #include "objectfile.h"
8 #include "sourcefile.h"
14 Analyzer::Analyzer(Builder &b):
21 void Analyzer::analyze()
26 const Builder::TargetMap &targets = builder.get_targets();
27 for(Builder::TargetMap::const_iterator i=targets.begin(); i!=targets.end(); ++i)
29 const TargetList &depends = i->second->get_depends();
30 for(TargetList::const_iterator j=depends.begin(); j!=depends.end(); ++j)
31 rdepends[*j].insert(i->second);
38 row.push_back("Name");
39 row.push_back("Package");
40 row.push_back("Type");
41 row.push_back("Rebuild");
44 Target &cmdline = *builder.get_target("cmdline");
47 const TargetList &deps = cmdline.get_depends();
48 for(TargetList::const_iterator i=deps.begin(); i!=deps.end(); ++i)
49 build_depend_table(**i, 0);
52 build_depend_table(cmdline, 0);
57 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
59 Target *real = tgt.get_real_target();
62 // Skip trivial targets
64 return build_depend_table(*real, depth);
65 if(const ObjectFile *obj = dynamic_cast<const ObjectFile *>(&tgt))
66 return build_depend_table(obj->get_source(), depth);
68 else if(mode==REBUILD && !tgt.get_rebuild() && !real->get_rebuild())
69 /* All targets that depend on to-be-built targets will be rebuilt
70 themselves, so we can stop here. */
76 const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
78 name = ft->get_path().str();
80 name = tgt.get_name();
81 row.push_back(string(depth*2, ' ')+name);
83 const Package *pkg = tgt.get_package();
85 row.push_back(pkg->get_name());
89 row.push_back(tgt.get_type());
93 if(tgt.get_rebuild_reason().empty())
94 row.push_back("Yes (no reason)");
96 row.push_back(tgt.get_rebuild_reason());
101 if(!max_depth || depth<max_depth-1)
106 const set<Target *> &rdeps = rdepends[&tgt];
107 depends.assign(rdeps.begin(), rdeps.end());
110 depends = tgt.get_depends();
112 depends.sort(full_paths ? target_order_full : target_order);
114 for(TargetList::const_iterator i=depends.begin(); i!=depends.end(); ++i)
115 build_depend_table(**i, depth+1);
119 void Analyzer::print_table() const
121 vector<string::size_type> col_width;
123 // Determine column widths
124 for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
126 if(col_width.size()<i->size())
127 col_width.resize(i->size(), 0);
128 for(unsigned j=0; j<i->size(); ++j)
129 col_width[j] = max(col_width[j], (*i)[j].size());
132 for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
135 for(unsigned j=0; j<i->size(); ++j)
139 line += lexical_cast((*i)[j], Fmt("%-s").width(col_width[j]));
141 IO::print("%s\n", line);
145 bool Analyzer::target_order(const Target *t1, const Target *t2)
147 return t1->get_name()<t2->get_name();
150 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
152 const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
153 const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
158 return target_order(t1, t2);
162 return ft1->get_path().str()<ft2->get_path().str();