| /external/v8/src/ |
| machine-type.h | 27 kTagged
115 return MachineType(MachineRepresentation::kTagged, MachineSemantic::kAny);
121 return MachineType(MachineRepresentation::kTagged, MachineSemantic::kBool);
147 return MachineType(MachineRepresentation::kTagged, MachineSemantic::kNone);
190 case MachineRepresentation::kTagged:
|
| machine-type.cc | 29 case MachineRepresentation::kTagged:
|
| property-details.h | 98 kTagged,
106 static Representation Tagged() { return Representation(kTagged); }
175 bool IsTagged() const { return kind_ == kTagged; }
|
| types.h | 188 V(OtherUnsigned31, 1u << 1 | REPRESENTATION(kTagged | kUntaggedNumber)) \
189 V(OtherUnsigned32, 1u << 2 | REPRESENTATION(kTagged | kUntaggedNumber)) \
190 V(OtherSigned32, 1u << 3 | REPRESENTATION(kTagged | kUntaggedNumber)) \
191 V(OtherNumber, 1u << 4 | REPRESENTATION(kTagged | kUntaggedNumber))
194 V(Negative31, 1u << 5 | REPRESENTATION(kTagged | kUntaggedNumber)) \
198 V(Unsigned30, 1u << 9 | REPRESENTATION(kTagged | kUntaggedNumber)) \
199 V(MinusZero, 1u << 10 | REPRESENTATION(kTagged | kUntaggedNumber)) \
200 V(NaN, 1u << 11 | REPRESENTATION(kTagged | kUntaggedNumber)) \
209 V(Internal, 1u << 20 | REPRESENTATION(kTagged | kUntagged)) \
379 min, max, BitsetType::New(REPRESENTATION(BitsetType::kTagged |
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-representation-change.cc | 117 true_node, MachineRepresentation::kTagged, Type::None(),
123 false_node, MachineRepresentation::kTagged, Type::None(),
136 MachineRepresentation::kTagged);
151 MachineRepresentation::kTagged);
161 MachineRepresentation::kTagged);
171 MachineRepresentation::kTagged);
181 MachineRepresentation::kTagged);
191 MachineRepresentation::kTagged);
215 n, MachineRepresentation::kTagged, Type::None(),
278 n, MachineRepresentation::kTagged, Type::None()
[all...] |
| test-graph-visualizer.cc | 37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
56 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
75 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
|
| test-gap-resolver.cc | 189 return MachineRepresentation::kTagged;
|
| test-osr.cc | 94 return graph.NewNode(common.Phi(MachineRepresentation::kTagged, count),
318 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2),
321 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 3),
501 T.graph.NewNode(T.common.Phi(MachineRepresentation::kTagged, 2),
|
| /external/v8/test/unittests/compiler/ |
| live-range-builder.h | 43 new (zone_) TopLevelLiveRange(id_, MachineRepresentation::kTagged);
|
| loop-peeling-unittest.cc | 122 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), a,
138 common()->Phi(MachineRepresentation::kTagged, 2), base, base, w->loop);
187 r, IsReturn(IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
226 IsReturn(IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
302 EXPECT_THAT(back, IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
305 EXPECT_THAT(phi, IsPhi(MachineRepresentation::kTagged, IsInt32Constant(11),
351 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 3),
381 IsPhi(MachineRepresentation::kTagged,
382 IsPhi(MachineRepresentation::kTagged, IsInt32Constant(1),
388 r, IsReturn(IsPhi(MachineRepresentation::kTagged, phi, IsInt32Constant(0)
[all...] |
| js-intrinsic-lowering-unittest.cc | 152 MachineRepresentation::kTagged, IsFalseConstant(),
183 MachineRepresentation::kTagged, IsFalseConstant(),
214 MachineRepresentation::kTagged, IsFalseConstant(),
245 MachineRepresentation::kTagged, IsFalseConstant(),
277 MachineRepresentation::kTagged, IsFalseConstant(),
308 MachineRepresentation::kTagged, IsFalseConstant(),
436 MachineRepresentation::kTagged, input,
437 IsPhi(MachineRepresentation::kTagged,
|
| dead-code-elimination-unittest.cc | 43 MachineRepresentation::kFloat64, MachineRepresentation::kTagged};
194 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, merge);
221 common()->Phi(MachineRepresentation::kTagged, 4), v0, v1, v2, v3, merge);
231 IsPhi(MachineRepresentation::kTagged, v0, v3, r.replacement()));
279 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, loop);
308 common()->Phi(MachineRepresentation::kTagged, 4), v0, v1, v2, v3, loop);
318 IsPhi(MachineRepresentation::kTagged, v0, v3, r.replacement()));
|
| common-operator-reducer-unittest.cc | 62 MachineRepresentation::kFloat64, MachineRepresentation::kTagged};
311 common()->Phi(MachineRepresentation::kTagged, 2), p0, p0, loop);
448 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
483 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
495 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
507 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
519 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
531 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
543 common()->Select(MachineRepresentation::kTagged), TrueConstant(), p0, p1);
|
| scheduler-unittest.cc | 664 graph->NewNode(common->Phi(MachineRepresentation::kTagged, 2), tv, fv, m);
744 common()->Phi(MachineRepresentation::kTagged, 2), ttrue, ffalse, m1);
748 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
774 common()->Phi(MachineRepresentation::kTagged, 2), p0, p1, mA1);
781 common()->Phi(MachineRepresentation::kTagged, 2), p0, p1, mB1);
788 common()->Phi(MachineRepresentation::kTagged, 2), phiB1, c, mA2);
795 common()->Phi(MachineRepresentation::kTagged, 2), phiA1, c, mB2);
819 Node* ind = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
831 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
851 Node* ind = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2)
[all...] |
| change-lowering-unittest.cc | 114 EXPECT_THAT(r.replacement(), IsSelect(MachineRepresentation::kTagged, value,
196 IsStore(StoreRepresentation(MachineRepresentation::kTagged,
215 IsStore(StoreRepresentation(MachineRepresentation::kTagged,
261 IsStore(StoreRepresentation(MachineRepresentation::kTagged,
374 IsPhi(MachineRepresentation::kTagged,
477 MachineRepresentation::kTagged,
605 MachineRepresentation::kTagged,
|
| live-range-unittest.cc | 37 TopLevelLiveRange(new_id, MachineRepresentation::kTagged);
77 new (zone()) TopLevelLiveRange(1, MachineRepresentation::kTagged);
440 new (zone()) TopLevelLiveRange(101, MachineRepresentation::kTagged);
|
| /external/v8/src/compiler/ |
| representation-change.cc | 133 case MachineRepresentation::kTagged:
176 MachineRepresentation::kTagged);
196 MachineRepresentation::kTagged);
206 MachineRepresentation::kTagged);
252 } else if (output_rep == MachineRepresentation::kTagged) {
304 } else if (output_rep == MachineRepresentation::kTagged) {
362 } else if (output_rep == MachineRepresentation::kTagged) {
396 if (output_rep == MachineRepresentation::kTagged) {
|
| simplified-lowering.cc | 97 return UseInfo(MachineRepresentation::kTagged, Truncation::Any());
131 case MachineRepresentation::kTagged:
172 r2 == MachineRepresentation::kTagged;
180 r2 == MachineRepresentation::kTagged;
187 r2 == MachineRepresentation::kTagged;
192 r2 == MachineRepresentation::kTagged;
198 r2 == MachineRepresentation::kTagged;
201 r2 == MachineRepresentation::kTagged;
202 case MachineRepresentation::kTagged:
203 return r2 == MachineRepresentation::kTagged;
[all...] |
| common-operator.cc | 213 V(kTagged, 1) \
214 V(kTagged, 2) \
215 V(kTagged, 3) \
216 V(kTagged, 4) \
217 V(kTagged, 5) \
218 V(kTagged, 6) \
|
| js-intrinsic-lowering.cc | 227 return Change(node, common()->Phi(MachineRepresentation::kTagged, 2), vtrue,
266 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
310 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
359 common()->Phi(MachineRepresentation::kTagged, 2);
542 common()->Select(MachineRepresentation::kTagged),
551 common()->Select(MachineRepresentation::kTagged),
|
| js-generic-lowering.cc | 208 common()->Select(MachineRepresentation::kTagged));
431 node, machine()->Store(StoreRepresentation(MachineRepresentation::kTagged,
710 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
741 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
744 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
747 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
[all...] |
| change-lowering.cc | 155 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), value,
236 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
262 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
416 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
439 representation == MachineRepresentation::kTagged) {
|
| code-generator.cc | 641 } else if (type.representation() == MachineRepresentation::kTagged) {
659 } else if (type.representation() == MachineRepresentation::kTagged) {
681 type.representation() == MachineRepresentation::kTagged);
686 type.representation() == MachineRepresentation::kTagged);
690 DCHECK(type.representation() == MachineRepresentation::kTagged);
|
| fast-accessor-assembler.cc | 89 Node* phi = assembler_->Phi(MachineRepresentation::kTagged, internal_field,
|
| instruction-selector.h | 187 MarkAsRepresentation(MachineRepresentation::kTagged, node);
|
