HomeSort by relevance Sort by last modified time
    Searched refs:predecessors_ (Results 1 - 15 of 15) sorted by null

  /external/v8/src/compiler/
liveness-analyzer.h 106 void AddPredecessor(LivenessAnalyzerBlock* b) { predecessors_.push_back(b); }
108 DCHECK(predecessors_.size() == 1);
109 return predecessors_[0];
147 return predecessors_.begin();
150 return predecessors_.end();
157 ZoneDeque<LivenessAnalyzerBlock*> predecessors_; member in class:v8::internal::compiler::LivenessAnalyzerBlock
schedule.h 65 BasicBlockVector& predecessors() { return predecessors_; }
66 const BasicBlockVector& predecessors() const { return predecessors_; }
67 size_t PredecessorCount() const { return predecessors_.size(); }
68 BasicBlock* PredecessorAt(size_t index) { return predecessors_[index]; }
69 void ClearPredecessors() { predecessors_.clear(); }
169 BasicBlockVector predecessors_; member in class:v8::internal::compiler::final
liveness-analyzer.cc 93 predecessors_(zone),
188 for (LivenessAnalyzerBlock* pred : predecessors_) {
schedule.cc 29 predecessors_(zone),
49 predecessors_.push_back(predecessor);
instruction.cc 624 predecessors_(zone),
640 for (InstructionBlock::Predecessors::const_iterator i = predecessors_.begin();
641 i != predecessors_.end(); ++i, ++j) {
    [all...]
instruction.h 1411 Predecessors predecessors_; member in class:v8::internal::compiler::final
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_ordering.h 95 // each instruction. Subclasses should fill in predecessors_.
108 return *predecessors_.at(computation);
112 return *predecessors_.at(computation);
128 predecessors_; member in class:xla::PredecessorHloOrdering
hlo_ordering.cc 262 return a != b && predecessors_.at(a->parent())->IsReachable(a, b);
276 if (predecessors_.at(computation)
293 predecessors_.emplace(computation, computation->ComputeReachability());
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/val/
basic_block.h 53 return &predecessors_;
57 std::vector<BasicBlock*>* predecessors() { return &predecessors_; }
201 std::vector<BasicBlock*> predecessors_; member in class:libspirv::BasicBlock
basic_block.cpp 29 predecessors_(),
57 block->predecessors_.push_back(this);
  /external/tensorflow/tensorflow/compiler/xla/service/gpu/
hlo_schedule.cc 112 predecessors_.emplace(module->entry_computation(),
125 predecessors_.emplace(computation, computation->ComputeReachability());
  /art/compiler/optimizing/
nodes.cc 391 header->predecessors_[pred] = to_swap;
392 header->predecessors_[0] = predecessor;
    [all...]
nodes.h 1293 ArenaVector<HBasicBlock*> predecessors_; member in class:art::HBasicBlock
    [all...]
  /external/v8/src/crankshaft/
hydrogen.h 81 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; }
82 bool HasPredecessor() const { return predecessors_.length() > 0; }
218 ZoneList<HBasicBlock*> predecessors_; member in class:v8::internal::final
    [all...]
hydrogen.cc 254 predecessors_(2, graph->zone()),
441 int length = predecessors_.length();
444 HBasicBlock* predecessor = predecessors_[i];
531 predecessors_.Add(pred, zone());
632 for (int i = 0; i < predecessors_.length(); ++i) {
633 if (predecessors_[i] == predecessor) return i;
647 if (predecessors_.length() > 1) {
648 for (int i = 0; i < predecessors_.length(); ++i) {
649 DCHECK(predecessors_[i]->end()->SecondSuccessor() == NULL);
    [all...]

Completed in 961 milliseconds