Lines Matching refs:targets
118 std::ostream& os, const std::vector<BasicBlock*>& targets,
123 for (size_t i = 0; i < targets.size(); ++i) {
129 targets_starting_here.find(targets[i]) != targets_starting_here.end()) {
136 if (c.connected == 0 && targets[i] != nullptr) {
145 size_t AddTarget(std::vector<BasicBlock*>& targets, BasicBlock* target) {
146 if (targets.size() == 0 || targets.back() != nullptr) {
147 targets.push_back(target);
148 return targets.size() - 1;
151 size_t i = targets.size();
153 if (targets[i - 1] != nullptr) break;
156 targets[i] = target;
164 bool AddTargetIfNotNext(std::vector<BasicBlock*>& targets, BasicBlock* target,
168 size_t index = AddTarget(targets, target);
177 std::vector<BasicBlock*>* targets)
178 : std::ostream(this), os_(os), targets_(targets), padding_size_(0) {}
228 // Precalculate the maximum number of targets.
307 void PrintEagerDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
311 PrintVerticalArrows(os, targets);
332 void MaybePrintEagerDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
338 PrintEagerDeopt<Name>(os, targets, node->Cast<Name>(), state); \
347 void PrintLazyDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
351 PrintVerticalArrows(os, targets);
377 void MaybePrintLazyDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
383 PrintLazyDeopt<Name>(os, targets, node->Cast<Name>(), state); \