| /external/v8/src/compiler/ |
| node-properties.cc | 24 return FirstValueIndex(node) + node->op()->ValueInputCount();
56 DCHECK(0 <= index && index < node->op()->ValueInputCount());
93 node->op()->ValueInputCount());
157 DCHECK(index < node->op()->ValueInputCount());
164 int value_input_count = node->op()->ValueInputCount();
202 node->TrimInputCount(node->op()->ValueInputCount());
208 int value_input_count = node->op()->ValueInputCount();
641 int input_count = node->op()->ValueInputCount();
|
| js-call-reducer.cc | 39 if (node->op()->ValueInputCount() < 3) {
63 if (node->op()->ValueInputCount() < 3) {
72 Node* right = node->op()->ValueInputCount() > 3
94 if (node->op()->ValueInputCount() < 3) {
100 Node* right = node->op()->ValueInputCount() > 3
127 if (node->op()->ValueInputCount() < 3) {
154 if (node->op()->ValueInputCount() <= 2) {
165 for (int i = 3; i < node->op()->ValueInputCount(); i++) {
397 Node* bound_this = (node->op()->ValueInputCount() < 3)
472 int const arity = std::max(0, node->op()->ValueInputCount() - 3)
[all...] |
| operator-properties.cc | 139 return op->ValueInputCount() + GetContextInputCount(op) +
|
| machine-graph-verifier.cc | 539 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
544 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
549 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
592 if (node->op()->ValueInputCount() != 0) {
[all...] |
| operator.h | 99 int ValueInputCount() const { return value_in_; }
|
| simplified-lowering.cc | 182 node->TrimInputCount(new_op->ValueInputCount());
402 int arity = node->op()->ValueInputCount();
426 for (int i = 0; i < node->op()->ValueInputCount(); i++) {
719 DCHECK_EQ(1, node->op()->ValueInputCount());
724 DCHECK_EQ(1, node->op()->ValueInputCount());
737 DCHECK_EQ(2, node->op()->ValueInputCount());
748 DCHECK_EQ(2, node->op()->ValueInputCount());
815 int tagged_count = node->op()->ValueInputCount() +
829 int tagged_limit = node->op()->ValueInputCount() +
847 int value_count = node->op()->ValueInputCount()
[all...] |
| js-inlining-heuristic.cc | 34 int const value_input_count = m.node()->op()->ValueInputCount();
332 DCHECK_EQ(num_calls, callee->op()->ValueInputCount());
|
| js-inlining.cc | 72 return call_->op()->ValueInputCount() - 2;
104 int inliner_inputs = call->op()->ValueInputCount();
|
| redundancy-elimination.cc | 176 for (int i = a->op()->ValueInputCount(); --i >= 0;) {
|
| dead-code-elimination.cc | 224 int input_count = node->op()->ValueInputCount();
|
| escape-analysis-reducer.cc | 182 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
|
| loop-variable-optimizer.cc | 222 DCHECK_EQ(2, phi->op()->ValueInputCount());
|
| graph-visualizer.cc | 318 os_ << ",\"opinfo\":\"" << node->op()->ValueInputCount() << " v "
545 PrintInputs(&i, node->op()->ValueInputCount(), " ");
|
| typed-optimization.cc | 150 for (int i = 1; i < node->op()->ValueInputCount(); ++i) {
289 int arity = node->op()->ValueInputCount();
|
| load-elimination.cc | 78 if (node->op()->ValueInputCount() > 0) {
80 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
144 for (int i = a->op()->ValueInputCount(); --i >= 0;) {
[all...] |
| js-type-hint-lowering.cc | 161 DCHECK_EQ(2, op->ValueInputCount());
|
| int64-lowering.cc | [all...] |
| verifier.cc | 96 int value_count = node->op()->ValueInputCount();
[all...] |
| escape-analysis.cc | 736 int value_input_count = op->ValueInputCount();
|
| instruction-selector.cc | 581 int const input_count = input->op()->ValueInputCount();
825 call->op()->ValueInputCount(),
[all...] |
| simd-scalar-lowering.cc | [all...] |
| js-typed-lowering.cc | 223 DCHECK_EQ(2, op->ValueInputCount());
249 DCHECK_EQ(2, op->ValueInputCount());
254 DCHECK_EQ(2, node_->op()->ValueInputCount());
[all...] |
| common-operator.cc | 80 return op->ValueInputCount() - 1;
[all...] |
| bytecode-graph-builder.cc | [all...] |
| typer.cc | 732 int arity = node->op()->ValueInputCount();
[all...] |
