| /external/v8/src/compiler/ |
| liveness-analyzer.h | 119 void SetQueued() { queued_ = true; }
120 bool IsQueued() { return queued_; }
136 bool queued_; member in class:v8::internal::compiler::LivenessAnalyzerBlock
|
| control-flow-optimizer.h | 46 NodeMarker<bool> queued_; member in class:v8::internal::compiler::final
|
| loop-analysis.cc | 57 queued_(graph, 2),
109 NodeMarker<bool> queued_; member in class:v8::internal::compiler::LoopFinderImpl
188 queued_.Set(node, false);
276 queued_.Set(node, false);
304 if (!queued_.Get(node)) {
306 queued_.Set(node, true);
|
| control-flow-optimizer.cc | 24 queued_(graph, 2),
48 if (node->IsDead() || queued_.Get(node)) return;
49 queued_.Set(node, true);
|
| liveness-analyzer.cc | 91 queued_(false),
96 queued_ = false;
|
| scheduler.cc | 221 queued_(scheduler->graph_, 2),
296 if (!queued_.Get(node)) {
299 queued_.Set(node, true);
560 NodeMarker<bool> queued_; // Mark indicating whether node is queued. member in class:v8::internal::compiler::CFGBuilder
[all...] |
| simplified-lowering.cc | 316 void set_queued(bool value) { queued_ = value; }
317 bool queued() const { return queued_; }
329 bool queued_ = false; // Bookkeeping for the traversal. member in class:v8::internal::compiler::RepresentationSelector::NodeInfo
[all...] |
| /external/v8/src/arm64/ |
| macro-assembler-arm64.cc | 943 if (queued_.empty()) return;
949 size_t count = queued_.size();
957 batch[batch_index++] = queued_[index++];
959 batch[0].IsSameSizeAndType(queued_[index]));
965 queued_.clear();
970 if (queued_.empty()) return;
972 size_t count = queued_.size();
980 batch[batch_index++] = queued_[index++];
982 batch[0].IsSameSizeAndType(queued_[index]));
[all...] |
| macro-assembler-arm64.h | 668 DCHECK(queued_.empty());
673 queued_.push_back(rt);
686 std::vector<CPURegister> queued_; member in class:v8::internal::MacroAssembler::PushPopQueue
[all...] |
