Lines Matching refs:start
54 int start = info.function_token_position();
55 if (start == kNoSourcePosition) start = info.StartPosition();
56 return start;
60 DCHECK_NE(kNoSourcePosition, a.start);
61 DCHECK_NE(kNoSourcePosition, b.start);
62 if (a.start == b.start) return a.end > b.end;
63 return a.start < b.start;
130 nesting_stack_.emplace_back(function_->start, function_->end,
143 nesting_stack_.back().end <= block.start) {
147 DCHECK_IMPLIES(block.start >= function_->end,
149 DCHECK_NE(block.start, kNoSourcePosition);
179 return HasNext() && GetNextBlock().start < GetParent().end;
225 return lhs.start == rhs.start && lhs.end == rhs.end;
254 if (block.start >= function->end) {
261 block.end = iter.GetSiblingOrChild().start;
282 if (sibling.start == block.end && sibling.count == block.count) {
285 sibling.start = block.start;
316 if (block.start == SourceRange::kFunctionLiteralSourcePosition &&
341 bool aliases_start = block.start == previous_block.start;
347 // Likewise, the next block must have another start position since
349 DCHECK_IMPLIES(iter.HasNext(), iter.GetNextBlock().start != block.start);
370 if (block.start == block.end) iter.DeleteBlock();
440 // Remove singleton ranges with the same start position as a full range and
491 i::PrintF("{start: %d, end: %d, count: %d}\n", function->start, function->end,
494 i::PrintF("{start: %d, end: %d, count: %d}\n", block.start, block.end,
581 start(StartPosition(*info)),
585 // - start, ascending.
590 if (this->start != that.start) return this->start < that.start;
600 int start;
650 // Sort functions by start position, from outer to inner functions.
665 int start = v.start;
669 // Find the correct outer function based on start position.
695 while (!nesting.empty() && functions->at(nesting.back()).end <= start) {
716 CoverageFunction function(start, end, count, name);