Home
last modified time | relevance | path

Searched refs:rule_ (Results 1 – 6 of 6) sorted by relevance

/third_party/node/deps/v8/src/torque/
Dearley-parser.h284 : rule_(rule), mark_(mark), start_(start), pos_(pos) { in Item()
314 Item result(rule_, mark_ + 1, start_, new_pos);
340 return rule_ == other.rule_ && mark_ == other.mark_ &&
345 return base::hash_combine(i.rule_, i.mark_, i.start_, i.pos_); in hash_value()
348 const Rule* rule() const { return rule_; } in rule()
349 Symbol* left() const { return rule_->left(); } in left()
350 const std::vector<Symbol*>& right() const { return rule_->right(); } in right()
355 const Rule* rule_;
/third_party/ninja/src/
Dgraphviz.cc58 edge->inputs_[0], edge->outputs_[0], edge->rule_->name().c_str()); in AddTarget()
61 edge, edge->rule_->name().c_str()); in AddTarget()
Dgraph.h172 : rule_(NULL), pool_(NULL), dyndep_(NULL), env_(NULL), mark_(VisitNone), in Edge()
201 const Rule* rule_; member
215 const Rule& rule() const { return *rule_; } in rule()
Dninja.cc401 printf(" input: %s\n", edge->rule_->name().c_str()); in ToolQuery()
472 printf("%s: %s\n", target, (*n)->in_edge()->rule_->name().c_str()); in ToolTargetsList()
500 if ((*e)->rule_->name() == rule_name) { in ToolTargetsList()
524 (*e)->rule_->name().c_str()); in ToolTargetsList()
969 if ((*e)->rule_->name() == argv[i]) { in ToolCompilationDatabase()
Dgraph.cc429 const EvalString* eval = edge_->rule_->GetBinding(var); in LookupVariable()
521 printf("--%s-> ", rule_->name().c_str()); in Dump()
544 return rule_ == &State::kPhonyRule; in is_phony()
Dstate.cc88 edge->rule_ = rule; in AddEdge()