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

  /external/v8/src/compiler/
checkpoint-elimination.cc 24 effect->op()->EffectInputCount() == 1) {
node-properties.cc 44 return FirstEffectIndex(node) + node->op()->EffectInputCount();
77 DCHECK(0 <= index && index < node->op()->EffectInputCount());
117 node->op()->EffectInputCount());
188 DCHECK(index < node->op()->EffectInputCount());
262 DCHECK_EQ(1, effect->op()->EffectInputCount());
484 if (effect->op()->EffectInputCount() != 1) {
502 DCHECK_EQ(1, effect->op()->EffectInputCount());
547 if (effect->op()->EffectInputCount() == 1 &&
redundancy-elimination.cc 241 DCHECK_EQ(1, node->op()->EffectInputCount());
278 int const input_count = node->op()->EffectInputCount();
300 if (node->op()->EffectInputCount() == 1) {
308 DCHECK_EQ(0, node->op()->EffectInputCount());
dead-code-elimination.cc 198 int const effect_input_count = node->op()->EffectInputCount();
236 DCHECK_EQ(0, node->op()->EffectInputCount());
260 DCHECK_EQ(1, node->op()->EffectInputCount());
escape-analysis-reducer.cc 54 DCHECK_EQ(1, original->op()->EffectInputCount());
123 // it is working. For now we use EffectInputCount > 0 to determine
125 if (node->op()->EffectInputCount() > 0) {
153 DCHECK_GE(node->op()->EffectInputCount(), 1);
operator-properties.cc 140 GetFrameStateInputCount(op) + op->EffectInputCount() +
store-store-elimination.cc 364 bool isEffectful = (node->op()->EffectInputCount() >= 1);
395 for (int i = 0; i < node->op()->EffectInputCount(); i++) {
graph-reducer.cc 226 if (effect == nullptr && node->op()->EffectInputCount() > 0) {
operator.h 100 int EffectInputCount() const { return effect_in_; }
load-elimination.cc 76 if (node->op()->EffectInputCount() > 0) {
88 for (int i = 0; i < node->op()->EffectInputCount(); ++i) {
    [all...]
escape-analysis.cc 370 int effect_inputs = node->op()->EffectInputCount();
398 int arity = effect_phi->op()->EffectInputCount();
graph-visualizer.cc 319 << node->op()->EffectInputCount() << " eff "
550 PrintInputs(&i, node->op()->EffectInputCount(), " Eff:");
graph-assembler.h 435 int size = static_cast<int>(sizeof...(args)) + op->EffectInputCount() +
js-type-hint-lowering.cc 162 DCHECK_EQ(1, op->EffectInputCount());
memory-optimizer.cc 79 DCHECK_LT(0, node->op()->EffectInputCount());
js-typed-lowering.cc 220 DCHECK_EQ(0, op->EffectInputCount());
226 if (node_->op()->EffectInputCount() > 0) {
243 DCHECK_EQ(1, op->EffectInputCount());
251 DCHECK_EQ(1, node_->op()->EffectInputCount());
    [all...]
verifier.cc 100 int effect_count = node->op()->EffectInputCount();
    [all...]
simplified-lowering.cc 176 if (node->op()->EffectInputCount() > 0) {
    [all...]
bytecode-graph-builder.cc 628 DCHECK_EQ(1, effect->op()->EffectInputCount());
    [all...]
effect-control-linearizer.cc 99 DCHECK_EQ(static_cast<size_t>(node->op()->EffectInputCount()),
101 for (int i = 0; i < node->op()->EffectInputCount(); i++) {
578 if (node->op()->EffectInputCount() > 0) {
579 DCHECK_EQ(1, node->op()->EffectInputCount());
    [all...]
scheduler.cc     [all...]

Completed in 470 milliseconds