+/* $Id$
+
+This file is part of builder
+Copyright © 2006-2009 Mikko Rasa, Mikkosoft Productions
+Distributed under the LGPL
+*/
+
#include <iomanip>
#include <iostream>
#include <sstream>
-#include <msp/path/path.h>
+#include <msp/fs/utils.h>
#include "analyzer.h"
#include "builder.h"
#include "install.h"
#include "objectfile.h"
#include "package.h"
+#include "sourcefile.h"
#include "target.h"
using namespace std;
Analyzer::Analyzer(Builder &b):
builder(b),
+ mode(DEPS),
max_depth(0),
full_paths(false)
{ }
{
if(mode!=REBUILD && mode!=ALLDEPS)
{
- if(dynamic_cast<ObjectFile *>(&tgt))
- return build_depend_table(*tgt.get_depends().front(), depth);
- else if(dynamic_cast<Install *>(&tgt))
- return build_depend_table(*tgt.get_depends().front(), depth);
+ // Skip trivial targets
+ if(ObjectFile *obj=dynamic_cast<ObjectFile *>(&tgt))
+ return build_depend_table(obj->get_source(), depth);
+ else if(Install *inst=dynamic_cast<Install *>(&tgt))
+ return build_depend_table(inst->get_source(), depth);
}
else if(mode==REBUILD && !tgt.get_rebuild())
+ /* All targets that depend on to-be-built targets will be rebuilt
+ themselves, so we cn stop here. */
return;
TableRow row;
if(full_paths)
fn=tgt.get_name();
else
- fn=Path::Path(tgt.get_name())[-1];
+ fn=FS::basename(tgt.get_name());
row.push_back(string(depth*2, ' ')+fn);
const Package *pkg=tgt.get_package();
if(!max_depth || depth<max_depth-1)
{
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)
build_depend_table(**i, depth+1);
{
vector<unsigned> col_width;
+ // Determine column widths
for(Table::const_iterator i=table.begin(); i!=table.end(); ++i)
{
if(col_width.size()<i->size())