HomeSort by relevance Sort by last modified time
    Searched refs:DepNode (Results 1 - 9 of 9) sorted by null

  /build/kati/
exec.h 22 struct DepNode;
25 void Exec(const vector<DepNode*>& roots, Evaluator* ev);
command.h 24 struct DepNode;
40 void Eval(DepNode* n, vector<Command*>* commands);
41 const DepNode* current_dep_node() const { return current_dep_node_; }
45 DepNode* current_dep_node_;
dep.h 32 struct DepNode {
33 DepNode(Symbol output, bool is_phony, bool is_restat);
37 vector<DepNode*> deps;
38 vector<DepNode*> order_onlys;
39 vector<DepNode*> parents;
59 vector<DepNode*>* nodes);
ninja.h 27 struct DepNode;
30 void GenerateNinja(const vector<DepNode*>& nodes,
exec.cc 51 double ExecNode(DepNode* n, DepNode* needed_by) {
78 for (DepNode* d : n->order_onlys) {
87 for (DepNode* d : n->deps) {
143 void Exec(const vector<DepNode*>& roots, Evaluator* ev) {
145 for (DepNode* root : roots) {
149 for (DepNode* root : roots) {
dep.cc 38 static vector<DepNode*>* g_dep_node_pool;
179 DepNode* n) const {
193 void FillDepNodeLoc(const Rule* r, DepNode* n) const {
201 DepNode* n) const {
223 DepNode::DepNode(Symbol o, bool p, bool r)
303 void Build(vector<Symbol> targets, vector<DepNode*>* nodes) {
335 DepNode* n = BuildPlan(target, Intern(""));
443 bool CanPickImplicitRule(const Rule* rule, Symbol output, DepNode* n,
501 DepNode* n
    [all...]
ninja.cc 172 const DepNode* node;
200 void Generate(const vector<DepNode*>& nodes,
221 void PopulateNinjaNodes(const vector<DepNode*>& nodes) {
223 for (DepNode* node : nodes) {
228 void PopulateNinjaNode(DepNode* node) {
249 for (DepNode* d : node->deps) {
252 for (DepNode* d : node->order_onlys) {
463 bool GetDepfile(const DepNode* node, string* cmd_buf, string* depfile) {
478 const DepNode* node = nn->node;
487 const DepNode* node = nn->node
    [all...]
command.cc 125 const DepNode* n = ce_->current_dep_node();
191 void CommandEvaluator::Eval(DepNode* n, vector<Command*>* commands) {
main.cc 175 vector<DepNode*> nodes;

Completed in 156 milliseconds