source/analyzer.cpp

   1 #include <msp/fs/utils.h>
   2 #include <msp/io/print.h>
   3 #include "analyzer.h"
   4 #include "builder.h"
   5 #include "objectfile.h"
   6 #include "sourcefile.h"
   7 #include "sourcepackage.h"
   8 #include "target.h"
   9 #include "tool.h"
  10
  11 using namespace std;
  12 using namespace Msp;
  13
  14 Analyzer::Analyzer(Builder &b):
  15         builder(b),
  16         mode(DEPS),
  17         max_depth(0),
  18         full_paths(false)
  19 { }
  20
  21 void Analyzer::analyze()
  22 {
  23         if(mode==RDEPS)
  24         {
  25                 rdepends.clear();
  26                 const Builder::TargetMap &targets = builder.get_targets();
  27                 for(Builder::TargetMap::const_iterator i=targets.begin(); i!=targets.end(); ++i)
  28                 {
  29                         const Target::Dependencies &depends = i->second->get_depends();
  30                         for(Target::Dependencies::const_iterator j=depends.begin(); j!=depends.end(); ++j)
  31                                 rdepends[*j].insert(i->second);
  32                 }
  33         }
  34
  35         table.clear();
  36
  37         TableRow row;
  38         row.push_back("Name");
  39         row.push_back("Package");
  40         row.push_back("Type");
  41         row.push_back("Tool");
  42         row.push_back("Rebuild");
  43         table.push_back(row);
  44
  45         Target &cmdline = *builder.get_target("cmdline");
  46         if(mode==RDEPS)
  47         {
  48                 const Target::Dependencies &deps = cmdline.get_depends();
  49                 for(Target::Dependencies::const_iterator i=deps.begin(); i!=deps.end(); ++i)
  50                         build_depend_table(**i, 0);
  51         }
  52         else
  53                 build_depend_table(cmdline, 0);
  54
  55         print_table();
  56 }
  57
  58 void Analyzer::build_depend_table(Target &tgt, unsigned depth)
  59 {
  60         Target *real = tgt.get_real_target();
  61         if(mode==DEPS)
  62         {
  63                 // Skip trivial targets
  64                 if(real!=&tgt)
  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);
  68         }
  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. */
  72                 return;
  73
  74         TableRow row;
  75
  76         string name;
  77         const FileTarget *ft = dynamic_cast<const FileTarget *>(&tgt);
  78         if(full_paths && ft)
  79                 name = ft->get_path().str();
  80         else
  81                 name = tgt.get_name();
  82         row.push_back(string(depth*2, ' ')+name);
  83
  84         const Package *pkg = tgt.get_package();
  85         if(pkg)
  86                 row.push_back(pkg->get_name());
  87         else
  88                 row.push_back("");
  89
  90         row.push_back(tgt.get_type());
  91         const Tool *tool = tgt.get_tool();
  92         if(tool)
  93                 row.push_back(tool->get_tag());
  94         else
  95                 row.push_back("");
  96
  97         if(tgt.needs_rebuild())
  98                 row.push_back(tgt.get_rebuild_reason());
  99
 100         table.push_back(row);
 101
 102         if(!max_depth || depth<max_depth-1)
 103         {
 104                 Target::Dependencies depends;
 105                 if(mode==RDEPS)
 106                 {
 107                         const set<Target *> &rdeps = rdepends[&tgt];
 108                         depends.assign(rdeps.begin(), rdeps.end());
 109                 }
 110                 else
 111                         depends = tgt.get_depends();
 112
 113                 depends.sort(full_paths ? target_order_full : target_order);
 114
 115                 for(Target::Dependencies::const_iterator i=depends.begin(); i!=depends.end(); ++i)
 116                         build_depend_table(**i, depth+1);
 117         }
 118 }
 119
 120 void Analyzer::print_table() const
 121 {
 122         vector<string::size_type> col_width;
 123
 124         // Determine column widths
 125         for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
 126         {
 127                 if(col_width.size()<i->size())
 128                         col_width.resize(i->size(), 0);
 129                 for(unsigned j=0; j<i->size(); ++j)
 130                         col_width[j] = max(col_width[j], (*i)[j].size());
 131         }
 132
 133         for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
 134         {
 135                 string line;
 136                 for(unsigned j=0; j<i->size(); ++j)
 137                 {
 138                         if(j>0)
 139                                 line += "  ";
 140                         line += lexical_cast((*i)[j], Fmt("%-s").width(col_width[j]));
 141                 }
 142                 IO::print("%s\n", line);
 143         }
 144 }
 145
 146 bool Analyzer::target_order(const Target *t1, const Target *t2)
 147 {
 148         return t1->get_name()<t2->get_name();
 149 }
 150
 151 bool Analyzer::target_order_full(const Target *t1, const Target *t2)
 152 {
 153         const FileTarget *ft1 = dynamic_cast<const FileTarget *>(t1);
 154         const FileTarget *ft2 = dynamic_cast<const FileTarget *>(t2);
 155         if(!ft1)
 156         {
 157                 if(ft2)
 158                         return true;
 159                 return target_order(t1, t2);
 160         }
 161         else if(!ft2)
 162                 return false;
 163         return ft1->get_path().str()<ft2->get_path().str();
 164 }