Lines Matching defs:count
28 inline void Add(SharedFunctionInfo key, uint32_t count) {
31 if (UINT32_MAX - count < old_count) {
34 entry->value = old_count + count;
83 const int count = coverage_info.slots_block_count(i);
86 result.emplace_back(start_pos, until_pos, count);
131 function_->count);
238 next_block.count = std::max(block.count, next_block.count);
282 if (sibling.start == block.end && sibling.count == block.count) {
299 if (parent.count == block.count) {
301 // differing count.
318 // If a function-scope block exists, overwrite the function count. It has
319 // a more reliable count than what we get from the FeedbackVector (which
321 function->count = block.count;
361 if (block.count == 0 && parent.count == 0) iter.DeleteBlock();
379 if (block.count > 0) block.count = 1;
429 // To stay compatible with non-block coverage modes, the function-scope count
431 // This finds the function-scope counter, overwrites CoverageFunction::count,
464 // Filter out ranges with count == 0 unless the immediate parent range has
465 // a count != 0.
491 i::PrintF("{start: %d, end: %d, count: %d}\n", function->start, function->end,
492 function->count);
494 i::PrintF("{start: %d, end: %d, count: %d}\n", block.start, block.end,
495 block.count);
520 uint32_t count = static_cast<uint32_t>(vector.invocation_count());
522 counter_map->Add(shared, count);
543 uint32_t count = 0;
545 count =
552 // latter, we may incorrectly set a count of 1.
555 // atleast once. We don't have precise invocation count here.
556 count = 1;
558 counter_map->Add(shared, count);
561 // Also check functions on the stack to collect the count map. With lazy
575 // A {SFI, count} tuple is used to sort by source range (stored on
576 // the SFI) and call count (in the counter map).
578 SharedFunctionInfoAndCount(Handle<SharedFunctionInfo> info, uint32_t count)
580 count(count),
588 // - count, descending.
595 return this->count > that.count;
599 uint32_t count;
667 uint32_t count = v.count;
678 // source range) and those wrappers will have a call count of zero even if
682 // a non-zero call count, it gets recorded due to `function_is_relevant`
683 // below (e.g. script wrappers), while top-level SFIs with zero call count
686 // report them in decreasing order of call count, as in all known cases
688 // example above, we report the zero call count of `foo` last. As it turns
693 // that it follows the invariant that nesting order is descending count
699 if (count != 0) {
706 count = info->has_reported_binary_coverage() ? 0 : 1;
710 count = 1;
716 CoverageFunction function(start, end, count, name);
724 bool is_covered = (count != 0);
726 (!nesting.empty() && functions->at(nesting.back()).count != 0);
783 // increment invocation count.