build/algorithm.cxx


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

// file      : build/algorithm.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license   : MIT; see accompanying LICENSE file

#include <build/algorithm>

#include <memory>   // unique_ptr
#include <utility>  // move
#include <cassert>
#include <iostream>

#include <build/path>
#include <build/scope>
#include <build/target>
#include <build/prerequisite>
#include <build/rule>
#include <build/diagnostics>

using namespace std;

namespace build
{
  target*
  search (prerequisite& p)
  {
    tracer tr ("search");

    assert (p.target == nullptr);

    //@@ TODO for now we just default to the directory scope.
    //
    path d;
    if (p.directory.absolute ())
      d = p.directory; // Already normalized.
    else
    {
      d = p.scope.path () / p.directory;
      d.normalize ();
    }

    //@@ TODO: would be nice to first check if this target is
    //   already in the set before allocating a new instance.

    // Find or insert.
    //
    auto r (
      targets.emplace (
        unique_ptr<target> (p.type.factory (move (d), p.name, p.ext))));

    target& t (**r.first);

    trace (4, [&]{
        tr << (r.second ? "new" : "existing") << " target " << t
           << " for prerequsite " << p;});

    // Update extension if the existing target has it unspecified.
    //
    if (t.ext != p.ext)
    {
      trace (4, [&]{
          tracer::record r (tr);
          r << "assuming target " << t << " is the same as the one with ";
          if (p.ext == nullptr)
            r << "unspecified extension";
          else if (p.ext->empty ())
            r << "no extension";
          else
            r << "extension " << *p.ext;
        });

      if (p.ext != nullptr)
        t.ext = p.ext;
    }

    return (p.target = &t);
  }

  bool
  match (target& t)
  {
    assert (!t.recipe ());

    for (auto tt (&t.type ());
         tt != nullptr && !t.recipe ();
         tt = tt->base)
    {
      for (auto rs (rules.equal_range (tt->id));
           rs.first != rs.second;
           ++rs.first)
      {
        const rule& ru (rs.first->second);

        recipe re;

        {
          auto g (
            make_exception_guard (
              [] (target& t)
              {
                cerr << "info: while matching a rule for target " << t << endl;
              },
              t));

          re = ru.match (t);
        }

        if (re)
        {
          t.recipe (re);
          break;
        }
      }
    }

    return bool (t.recipe ());
  }
}