| /external/v8/test/unittests/compiler/ |
| D | load-elimination-unittest.cc | 45 Reduction r1 = Reduce(graph()->NewNode(simplified()->LoadField(access1), in TEST_F()
53 Reduction r2 = Reduce(graph()->NewNode(simplified()->LoadField(access2), in TEST_F()
62 Reduction r3 = Reduce(graph()->NewNode(simplified()->LoadField(access1), in TEST_F()
66 Reduction r4 = Reduce(graph()->NewNode(simplified()->LoadField(access1), in TEST_F()
|
| D | change-lowering-unittest.cc | 222 TARGET_TEST_P(ChangeLoweringCommonTest, LoadField) { in TARGET_TEST_P() argument
227 Node* load = graph()->NewNode(simplified()->LoadField(access), p0, in TARGET_TEST_P()
|
| D | escape-analysis-unittest.cc | 96 return graph()->NewNode(simplified()->LoadField(access), from, effect, in Load()
|
| /external/v8/src/compiler/ |
| D | js-intrinsic-lowering.cc | 184 graph()->NewNode(simplified()->LoadField(access), cnt, effect, control); in ReduceIncrementStatsCounter()
213 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceIsInstanceType()
214 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), value, in ReduceIsInstanceType()
256 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceIsFunction()
257 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceIsFunction()
300 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceIsJSReceiver()
301 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceIsJSReceiver()
327 return Change(node, simplified()->LoadField(AccessBuilder::ForValue()), value, in ReduceJSValueGetValue()
379 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceValueOf()
380 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceValueOf()
[all …]
|
| D | js-native-context-specialization.cc | 119 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceNamedAccess()
135 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceNamedAccess()
226 graph()->NewNode(simplified()->LoadField( in ReduceNamedAccess()
230 graph()->NewNode(simplified()->LoadField( in ReduceNamedAccess()
253 simplified()->LoadField(AccessBuilder::ForJSObjectProperties()), in ReduceNamedAccess()
263 graph()->NewNode(simplified()->LoadField(field_access), in ReduceNamedAccess()
271 graph()->NewNode(simplified()->LoadField(field_access), in ReduceNamedAccess()
308 graph()->NewNode(simplified()->LoadField(field_access), in ReduceNamedAccess()
339 simplified()->LoadField(AccessBuilder::ForMap()), this_value, in ReduceNamedAccess()
537 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceElementAccess()
[all …]
|
| D | js-typed-lowering.cc | 748 Node* length = graph()->NewNode(simplified()->LoadField(access), input, in ReduceJSToBoolean()
904 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceJSToObject()
907 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceJSToObject()
967 simplified()->LoadField(AccessBuilder::ForStringLength()), receiver, in ReduceJSLoadNamed()
1170 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceJSInstanceOf()
1185 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMapBitField()), in ReduceJSInstanceOf()
1206 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), in ReduceJSInstanceOf()
1230 simplified()->LoadField(AccessBuilder::ForMapPrototype()), in ReduceJSInstanceOf()
1255 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceJSInstanceOf()
1294 simplified()->LoadField( in ReduceJSLoadContext()
[all …]
|
| D | change-lowering.h | 53 Reduction LoadField(Node* node);
|
| D | js-global-object-specialization.cc | 134 simplified()->LoadField( in ReduceJSLoadGlobal()
220 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceJSStoreGlobal()
|
| D | simplified-operator.h | 175 const Operator* LoadField(FieldAccess const&);
|
| D | change-lowering.cc | 43 return LoadField(node); in Reduce()
484 Reduction ChangeLowering::LoadField(Node* node) { in LoadField() function in v8::internal::compiler::ChangeLowering
|
| D | opcodes.h | 198 V(LoadField) \
|
| D | simplified-operator.cc | 297 V(LoadField, FieldAccess, Operator::kNoWrite, 1, 1, 1) \
|
| /external/v8/test/cctest/compiler/ |
| D | test-simplified-lowering.cc | 104 Node* loaded = t.LoadField(load, t.PointerConstant(&input)); in TEST()
131 Node* loaded = t.LoadField(load, t.PointerConstant(&input)); in TEST()
162 Node* load = t.LoadField(access, t.Parameter(0)); in TEST()
197 Node* load = t.LoadField(access, t.Parameter(0)); in TEST()
214 Node* load = t.LoadField(access, t.Parameter(0)); in TEST()
260 Node* backing_store = t.LoadField( in TEST()
298 Node* load = t.LoadField(access, t.PointerConstant(smis)); in TEST()
458 Node* load = t.LoadField(from_access, ptr); in RunCopyField()
1341 Node* load = t.graph()->NewNode(t.simplified()->LoadField(access), t.p0, in TEST()
1525 Node* load = t.graph()->NewNode(t.simplified()->LoadField(access), t.p0, in TEST()
[all …]
|
| D | graph-builder-tester.h | 178 Node* LoadField(const FieldAccess& access, Node* object) { in LoadField() function
179 return NewNode(simplified()->LoadField(access), object); in LoadField()
|
| /external/pdfium/core/src/fpdfdoc/ |
| D | doc_form.cpp | 247 LoadField(pFields->GetDict(i)); in CPDF_InterForm()
875 void CPDF_InterForm::LoadField(CPDF_Dictionary* pFieldDict, int nLevel) { in LoadField() function in CPDF_InterForm
897 LoadField(pChildDict, nLevel + 1); in LoadField()
921 LoadField(pAnnot); in FixPageFields()
|
| /external/pdfium/core/include/fpdfdoc/ |
| D | fpdf_doc.h | 666 void LoadField(CPDF_Dictionary* pFieldDict, int nLevel = 0);
|
| /external/v8/src/ |
| D | code-stubs.h | 106 V(LoadField) \
1024 DEFINE_HANDLER_CODE_STUB(LoadField, HandlerStub);
|