Searched refs:mark_ (Results 1 – 7 of 7) sorted by relevance
/third_party/node/deps/v8/src/torque/ |
D | earley-parser.h | 284 : rule_(rule), mark_(mark), start_(start), pos_(pos) { in Item() 285 DCHECK_LE(mark_, right().size()); in Item() 291 DCHECK_LE(mark_, right().size()); in IsComplete() 292 return mark_ == right().size(); in IsComplete() 299 DCHECK_LT(mark_, right().size()); in NextSymbol() 300 return right()[mark_]; in NextSymbol() 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() 356 size_t mark_; variable
|
/third_party/ninja/src/ |
D | graph.h | 172 : rule_(NULL), pool_(NULL), dyndep_(NULL), env_(NULL), mark_(VisitNone), in Edge() 208 VisitMark mark_; member
|
D | graph.cc | 101 if (edge->mark_ == Edge::VisitDone) in RecomputeNodeDirty() 109 edge->mark_ = Edge::VisitInStack; in RecomputeNodeDirty() 219 edge->mark_ = Edge::VisitDone; in RecomputeNodeDirty() 231 if (edge->mark_ != Edge::VisitInStack) in VerifyDAG()
|
D | state.cc | 188 (*e)->mark_ = Edge::VisitNone; in Reset()
|
D | build.cc | 429 if (edge->mark_ != Edge::VisitNone) { in UnmarkDependents() 430 edge->mark_ = Edge::VisitNone; in UnmarkDependents()
|
/third_party/node/deps/v8/src/compiler/ |
D | node.h | 281 Mark mark() const { return mark_; } in mark() 282 void set_mark(Mark mark) { mark_ = mark; } in set_mark() 298 Mark mark_; variable
|
D | node.cc | 387 mark_(0), in Node()
|