OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:InputCount
(Results
1 - 25
of
92
) sorted by null
1
2
3
4
/external/v8/src/compiler/
node-matchers.cc
36
if (merge->
InputCount
() != 2) return;
39
if (input0->
InputCount
() != 1) return;
41
if (input1->
InputCount
() != 1) return;
node.cc
120
int const input_count = node->
InputCount
();
153
int input_count =
InputCount
();
187
DCHECK_LT(index,
InputCount
());
188
AppendInput(zone, InputAt(
InputCount
() - 1));
189
for (int i =
InputCount
() - 1; i > index; --i) {
200
DCHECK_LT(index,
InputCount
());
202
AppendInput(zone, InputAt(Max(
InputCount
() - count, 0)));
204
for (int i =
InputCount
() - count - 1; i >= Max(index, count); --i) {
215
DCHECK_LT(index,
InputCount
());
216
for (; index <
InputCount
() - 1; ++index)
[
all
...]
value-numbering-reducer.cc
20
size_t h = base::hash_combine(node->op()->HashCode(), node->
InputCount
());
21
for (int j = 0; j < node->
InputCount
(); ++j) {
34
if (a->
InputCount
() != b->
InputCount
()) return false;
35
for (int j = 0; j < a->
InputCount
(); ++j) {
graph-replay.cc
30
for (int i = 0; i < node->
InputCount
(); ++i) {
38
for (int i = 0; i < node->
InputCount
(); i++) {
common-operator-reducer.cc
171
if (node->
InputCount
() == 2) {
198
int const input_count = node->
InputCount
() - 1;
202
DCHECK_EQ(input_count, merge->
InputCount
());
222
int const input_count = node->
InputCount
() - 1;
226
DCHECK_EQ(input_count, merge->
InputCount
());
303
int const control_input_count = control->
InputCount
();
305
DCHECK_EQ(control_input_count, value->
InputCount
() - 1);
306
DCHECK_EQ(control_input_count, effect->
InputCount
() - 1);
308
DCHECK_NE(0, graph()->end()->
InputCount
());
int64-lowering.cc
50
if (top.input_index == top.node->
InputCount
()) {
163
if (node->
InputCount
() > 2) {
218
if (node->
InputCount
() > 3) {
254
DCHECK(node->
InputCount
() == 1);
307
DCHECK(node->
InputCount
() == 2);
321
DCHECK(node->
InputCount
() == 1);
328
DCHECK(node->
InputCount
() == 2);
348
DCHECK(node->
InputCount
() == 2);
368
DCHECK(node->
InputCount
() == 2);
388
DCHECK(node->
InputCount
() == 2)
[
all
...]
tail-call-optimization.cc
69
DCHECK_EQ(4, node->
InputCount
());
osr.cc
96
if (orig->
InputCount
() == 0 || orig->opcode() == IrOpcode::kParameter ||
109
copy = graph->NewNode(orig->op(), orig->
InputCount
(), &tmp_inputs[0]);
121
for (int j = 0; j < copy->
InputCount
(); j++) {
144
for (int i = 1; i < loop_header->
InputCount
(); i++) {
244
int const input_count = end->
InputCount
();
249
NodeProperties::ChangeOp(end, common->End(end->
InputCount
()));
348
int const live_input_count = osr_loop->
InputCount
() - 1;
node.h
49
bool IsDead() const { return
InputCount
() > 0 && !InputAt(0); }
61
int
InputCount
() const {
70
if (index < 0 || index >=
InputCount
()) { \
358
DCHECK_LT(index, use_->from()->
InputCount
());
431
return Node::InputEdges::iterator(this->node_, this->node_->
InputCount
());
474
return const_iterator(this->node_, this->node_->
InputCount
());
loop-peeling.cc
132
Node* copy = graph->NewNode(node->op(), node->
InputCount
(), &inputs[0]);
142
for (int i = 0; i < copy->
InputCount
(); i++) {
234
int backedges = loop_node->
InputCount
() - 1;
239
for (int i = 1; i < loop_node->
InputCount
(); i++) {
dead-code-elimination.cc
43
int const input_count = node->
InputCount
();
68
int const input_count = node->
InputCount
();
86
DCHECK_EQ(input_count + 1, use->
InputCount
());
graph-reducer.cc
117
int start = entry.input_index < node->
InputCount
() ? entry.input_index : 0;
118
for (int i = start; i < node->
InputCount
(); i++) {
142
for (int i = 0; i < node->
InputCount
(); ++i) {
loop-variable-optimizer.cc
218
for (int i = 1; i < node->
InputCount
(); i++) {
356
induction_var->phi()->
InputCount
() - 1,
361
graph()->zone(), induction_var->phi()->
InputCount
() - 1, bound.bound);
365
graph()->zone(), induction_var->phi()->
InputCount
() - 1, bound.bound);
369
common()->InductionVariablePhi(induction_var->phi()->
InputCount
() - 1));
state-values-utils.cc
47
if (key->count != static_cast<size_t>(node->
InputCount
())) {
246
if (index >= node->
InputCount
()) {
303
for (int i = 0; i < node_->
InputCount
(); i++) {
simd-scalar-lowering.cc
46
if (top.input_index == top.node->
InputCount
()) {
149
DCHECK(node->
InputCount
() == 1);
231
DCHECK(node->
InputCount
() == 2);
265
DCHECK(node->
InputCount
() == 2);
register-allocator-verifier.cc
16
return instr->
InputCount
() + instr->OutputCount() + instr->TempCount();
67
for (size_t i = 0; i < instr->
InputCount
(); ++i, ++count) {
78
CHECK(instr->
InputCount
() > 0);
128
for (size_t i = 0; i < instr->
InputCount
(); ++i, ++count) {
496
for (size_t i = 0; i < instr->
InputCount
(); ++i, ++count) {
linkage.cc
49
<< "s" << d.StackParameterCount() << "i" << d.
InputCount
() << "f"
80
for (size_t i = 0; i <
InputCount
(); ++i) {
92
for (size_t i = 0; i < tail_caller->
InputCount
(); ++i) {
200
for (size_t i = 0; i <
InputCount
(); ++i) {
node-matchers.h
287
if (node->
InputCount
() < 2) return;
481
if (node->
InputCount
() < 2) return;
689
DCHECK_EQ(3, phi->
InputCount
());
696
DCHECK_EQ(3, phi->
InputCount
());
branch-elimination.cc
146
for (int i = 0; i < node->
InputCount
(); i++) {
158
for (int i = 1; i < node->
InputCount
(); i++) {
simplified-operator-reducer.cc
216
DCHECK_EQ(node->
InputCount
(), OperatorProperties::GetTotalInputCount(op));
217
DCHECK_LE(1, node->
InputCount
());
/external/v8/src/compiler/x64/
instruction-scheduler-x64.cc
149
DCHECK(instr->
InputCount
() >= 1);
160
DCHECK(instr->
InputCount
() >= 1);
/external/v8/src/crankshaft/
lithium-inl.h
62
: instr_(instr), limit_(instr->
InputCount
()), current_(0) {
/art/compiler/optimizing/
locations.cc
32
: inputs_(instruction->
InputCount
(),
common_arm.h
140
DCHECK_EQ(instr->
InputCount
(), 1u);
154
DCHECK_EQ(instr->
InputCount
(), 1u);
dead_code_elimination.cc
208
// Note that phi->
InputCount
() may change inside the loop.
209
for (size_t i = 0; i < phi->
InputCount
();) {
245
if (phi->
InputCount
() == 1) {
Completed in 630 milliseconds
1
2
3
4