if(mode!=REBUILD && mode!=ALLDEPS)
{
// Skip trivial targets
- if(ObjectFile *obj=dynamic_cast<ObjectFile *>(&tgt))
+ if(ObjectFile *obj = dynamic_cast<ObjectFile *>(&tgt))
return build_depend_table(obj->get_source(), depth);
- else if(Install *inst=dynamic_cast<Install *>(&tgt))
+ else if(Install *inst = dynamic_cast<Install *>(&tgt))
return build_depend_table(inst->get_source(), depth);
}
else if(mode==REBUILD && !tgt.get_rebuild())
string fn;
if(full_paths)
- fn=tgt.get_name();
+ fn = tgt.get_name();
else
- fn=FS::basename(tgt.get_name());
+ fn = FS::basename(tgt.get_name());
row.push_back(string(depth*2, ' ')+fn);
- const Package *pkg=tgt.get_package();
+ const Package *pkg = tgt.get_package();
if(pkg)
row.push_back(pkg->get_name());
else
if(!max_depth || depth<max_depth-1)
{
- const TargetList &depends=tgt.get_depends();
+ const TargetList &depends = tgt.get_depends();
//XXX If we want to sort the targets, we need to take the value of full_paths into account
//depends.sort(target_order);
for(TargetList::const_iterator i=depends.begin(); i!=depends.end(); ++i)
if(col_width.size()<i->size())
col_width.resize(i->size(), 0);
for(unsigned j=0; j<i->size(); ++j)
- col_width[j]=max(col_width[j], (*i)[j].size());
+ col_width[j] = max(col_width[j], (*i)[j].size());
}
for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
for(unsigned j=0; j<i->size(); ++j)
{
if(j>0)
- line+=" ";
- line+=lexical_cast((*i)[j], Fmt("%-s").width(col_width[j]));
+ line += " ";
+ line += lexical_cast((*i)[j], Fmt("%-s").width(col_width[j]));
}
IO::print("%s\n", line);
}