Lines Matching defs:split
82 base::TimingLogger::SplitTiming split = *it;
83 uint64_t split_time = split.first;
84 const char* split_name = split.second;
134 DCHECK(new_split_label != NULL) << "Starting split (" << new_split_label << ") with null label.";
140 CHECK(current_split_ != NULL) << "Ending a non-existent split.";
142 DCHECK(current_split_->explicit_ == true) << "Explicitly ending scoped split: " << current_split_->label_;
147 // Ends the current split and starts the one given by the label.
149 CHECK(current_split_ != NULL) << "Inserting a new split (" << new_split_label
150 << ") into a non-existent split.";
151 DCHECK(new_split_label != NULL) << "New split (" << new_split_label << ") with null label.";
160 base::TimingLogger::SplitTiming split = *it;
161 total_ns += split.first;
171 base::TimingLogger::SplitTiming split = *it;
172 uint64_t split_time = split.first;
182 base::TimingLogger::SplitTiming split = *it;
183 uint64_t split_time = split.first;
189 << split.second << "\n";
196 DCHECK(label != NULL) << "New scoped split (" << label << ") with null label.";
197 CHECK(timing_logger != NULL) << "New scoped split (" << label << ") without TimingLogger.";
203 // Stash away the current split and pause it.
238 CHECK(current != NULL) << "Missing scoped split (" << this->label_
252 // Sleight of hand here: Rather than embedding a new scoped split, we're updating the current
253 // scoped split in place. Basically, it's one way to make explicit and scoped splits compose
254 // well while maintaining the current semantics of NewSplit. An alternative is to push a new split
255 // since we unwind the stack of scoped splits in the scoped split destructor. However, this implies
256 // that the current split is not ended by NewSplit (which calls TailInsertSplit), which would
