| /build/kati/testcase/ |
| multi_rule.mk | 3 # simplified case for gyp-generated action targets
|
| /external/v8/src/compiler/ |
| representation-change.cc | 224 op = simplified()->ChangeInt31ToTaggedSigned();
227 op = simplified()->ChangeInt32ToTagged();
229 op = simplified()->CheckedInt32ToTaggedSigned(use_info.feedback());
236 op = simplified()->CheckedUint32ToTaggedSigned(use_info.feedback());
245 op = simplified()->ChangeInt31ToTaggedSigned();
250 op = simplified()->ChangeInt32ToTagged();
252 op = simplified()->CheckedInt32ToTaggedSigned(use_info.feedback());
261 op = simplified()->CheckedUint32ToTaggedSigned(use_info.feedback());
263 op = simplified()->CheckedFloat64ToInt32(
270 op = simplified()->ChangeInt32ToTagged()
[all...] |
| js-call-reducer.cc | 20 #include "src/compiler/simplified-operator.h"
50 graph()->NewNode(simplified()->SpeculativeToNumber(
76 graph()->NewNode(simplified()->SpeculativeToNumber(
80 graph()->NewNode(simplified()->SpeculativeToNumber(
107 graph()->NewNode(simplified()->SpeculativeToNumber(
111 graph()->NewNode(simplified()->SpeculativeToNumber(
114 left = graph()->NewNode(simplified()->NumberToUint32(), left);
115 right = graph()->NewNode(simplified()->NumberToUint32(), right);
116 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right);
137 graph()->NewNode(simplified()->SpeculativeToNumber
7299 SimplifiedOperatorBuilder* JSCallReducer::simplified() const { function in class:v8::internal::compiler::JSCallReducer
[all...] |
| js-typed-lowering.cc | 119 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(),
133 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(),
145 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(),
151 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(),
164 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), left(),
171 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), right(),
184 simplified()->CheckInternalizedString(), left(), effect(), control());
190 graph()->NewNode(simplified()->CheckInternalizedString(), right(),
279 return simplified()->NumberAdd();
281 return simplified()->NumberSubtract()
362 SimplifiedOperatorBuilder* simplified() { return lowering_->simplified(); } function in class:v8::internal::compiler::final
2409 SimplifiedOperatorBuilder* JSTypedLowering::simplified() const { function in class:v8::internal::compiler::JSTypedLowering
[all...] |
| property-access-builder.cc | 12 #include "src/compiler/simplified-operator.h"
30 SimplifiedOperatorBuilder* PropertyAccessBuilder::simplified() const { function in class:v8::internal::compiler::PropertyAccessBuilder
31 return jsgraph()->simplified();
59 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), *receiver,
72 graph()->NewNode(simplified()->CheckNumber(VectorSlotPair()), *receiver,
124 receiver = *effect = graph()->NewNode(simplified()->CheckHeapObject(),
154 *effect = graph()->NewNode(simplified()->CheckMaps(flags, maps), receiver,
165 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected);
167 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue),
237 simplified()->LoadField(AccessBuilder::ForJSObjectPropertiesOrHash())
[all...] |
| js-type-hint-lowering.cc | 10 #include "src/compiler/simplified-operator.h"
105 return simplified()->SpeculativeSafeIntegerAdd(hint);
107 return simplified()->SpeculativeNumberAdd(hint);
112 return simplified()->SpeculativeSafeIntegerSubtract(hint);
114 return simplified()->SpeculativeNumberSubtract(hint);
117 return simplified()->SpeculativeNumberMultiply(hint);
119 return simplified()->SpeculativeNumberDivide(hint);
121 return simplified()->SpeculativeNumberModulus(hint);
123 return simplified()->SpeculativeNumberBitwiseAnd(hint);
125 return simplified()->SpeculativeNumberBitwiseOr(hint)
195 SimplifiedOperatorBuilder* simplified() { return jsgraph()->simplified(); } function in class:v8::internal::compiler::final
[all...] |
| allocation-builder.h | 10 #include "src/compiler/simplified-operator.h"
16 // A helper class to construct inline allocations on the simplified operator
34 graph()->NewNode(simplified()->Allocate(type, pretenure),
41 effect_ = graph()->NewNode(simplified()->StoreField(access), allocation_,
47 effect_ = graph()->NewNode(simplified()->StoreElement(access), allocation_,
100 SimplifiedOperatorBuilder* simplified() { return jsgraph_->simplified(); } function in class:v8::internal::compiler::final
|
| typed-optimization.cc | 13 #include "src/compiler/simplified-operator.h"
257 NodeProperties::ChangeOp(node, simplified()->NumberToUint32());
324 return simplified()->NumberEqual();
326 return simplified()->NumberLessThan();
328 return simplified()->NumberLessThanOrEqual();
385 graph()->NewNode(simplified()->NumberToInt32(), from_char_code_repl);
387 simplified()->NumberBitwiseAnd(), from_char_code_repl,
397 comparison_op = simplified()->NumberLessThan();
405 comparison_op = simplified()->NumberLessThanOrEqual();
430 left = graph()->NewNode(simplified()->NumberToInt32(), left)
639 SimplifiedOperatorBuilder* TypedOptimization::simplified() const { function in class:v8::internal::compiler::TypedOptimization
[all...] |
| js-native-context-specialization.cc | 294 Node* value = graph()->NewNode(simplified()->ToBoolean(), node);
599 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver,
602 simplified()->CheckIf(DeoptimizeReason::kReceiverNotAGlobalProxy),
657 simplified()->LoadField(ForPropertyCellValue(
676 graph()->NewNode(simplified()->ReferenceEqual(), value,
679 simplified()->CheckIf(DeoptimizeReason::kValueMismatch), check,
701 value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
706 graph()->NewNode(simplified()->CheckMaps(
715 simplified()->CheckSmi(VectorSlotPair()), value, effect, control);
719 effect = graph()->NewNode(simplified()->StoreField(ForPropertyCellValue
2964 SimplifiedOperatorBuilder* JSNativeContextSpecialization::simplified() const { function in class:v8::internal::compiler::JSNativeContextSpecialization
[all...] |
| js-graph.h | 29 JSOperatorBuilder* javascript, SimplifiedOperatorBuilder* simplified,
34 simplified_(simplified) {
81 SimplifiedOperatorBuilder* simplified() const { return simplified_; } function in class:v8::internal::compiler::JSGraph
|
| js-intrinsic-lowering.cc | 101 simplified()->LoadField(AccessBuilder::ForExternalUint8Value());
142 Operator const* const op = simplified()->StoreField(
154 Operator const* const op = simplified()->LoadField(
183 simplified()->LoadField(AccessBuilder::ForJSGeneratorObjectResumeMode());
199 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value);
209 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), value,
212 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), map, efalse,
215 graph()->NewNode(simplified()->NumberEqual(), map_instance_type,
231 return Change(node, simplified()->ObjectIsReceiver());
236 return Change(node, simplified()->ObjectIsSmi())
370 SimplifiedOperatorBuilder* JSIntrinsicLowering::simplified() const { function in class:v8::internal::compiler::JSIntrinsicLowering
[all...] |
| simplified-lowering.h | 11 #include "src/compiler/simplified-operator.h"
95 SimplifiedOperatorBuilder* simplified() { return jsgraph()->simplified(); } function in class:v8::internal::compiler::final
|
| js-inlining.h | 47 SimplifiedOperatorBuilder* simplified() const;
|
| simplified-operator-reducer.h | 56 SimplifiedOperatorBuilder* simplified() const;
|
| js-inlining-heuristic.h | 84 SimplifiedOperatorBuilder* simplified() const;
|
| property-access-builder.h | 62 SimplifiedOperatorBuilder* simplified() const;
|
| typed-optimization.h | 67 SimplifiedOperatorBuilder* simplified() const;
|
| graph-assembler.cc | 104 graph()->NewNode(simplified()->AllocateRaw(Type::Any(), pretenure),
110 graph()->NewNode(simplified()->LoadField(access), object,
117 graph()->NewNode(simplified()->LoadElement(access), object, index,
124 graph()->NewNode(simplified()->StoreField(access), object, value,
131 graph()->NewNode(simplified()->StoreElement(access), object, index,
|
| js-intrinsic-lowering.h | 79 SimplifiedOperatorBuilder* simplified() const;
|
| /development/tools/repo_diff/service/repodiff/tools/migrations/ |
| 2018_02_09__00_07_41_upgrade.sql | 10 /* Ideally the status field is represented as an int; leaving as string for now for simplified DataStudio usage */
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| TestExampleGenerator.java | 235 String simplified = ExampleGenerator.simplify(example, false); local
237 if (simplified.contains("null")) {
240 + simplified + "\t" + javaEscapedStarred);
245 } else if (!simplified.startsWith("?")) {
247 errln("Funny HTML:\t<" + value + ">\t" + simplified
250 } else if (!simplified.contains("?")
254 errln("No background:\t<" + value + ">\t" + simplified
567 String simplified = ExampleGenerator.simplify(text, local
572 skipLog = !assertEquals("Example text for «" + value + "»", expected, simplified);
[all...] |
| /external/deqp-deps/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); local
144 // Simplified should be in the form of REC(1,1)
145 EXPECT_EQ(simplified->GetType(), SENode::RecurrentAddExpr);
147 EXPECT_EQ(simplified->GetChild(0)->GetType(), SENode::Constant);
148 EXPECT_EQ(simplified->GetChild(0)->AsSEConstantNode()->FoldToSingleValue(),
151 EXPECT_EQ(simplified->GetChild(1)->GetType(), SENode::Constant);
152 EXPECT_EQ(simplified->GetChild(1)->AsSEConstantNode()->FoldToSingleValue(),
155 EXPECT_EQ(simplified->GetChild(0), simplified->GetChild(1));
269 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)) local
376 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); local
[all...] |
| /external/skia/modules/pathkit/tests/ |
| pathops.spec.js | 196 let simplified = path.simplify();
199 expect(simplified).toBeNull(`Test ${testName} should have not created output, but did`);
201 expect(simplified).not.toBeNull();
204 let diff = diffPaths(expected, simplified);
207 expect(simplified.getFillType().value).toEqual(getFillType(test.fillTypeOut).value);
211 addSVG('[Simplify] ' + testName, expected, simplified, diff);
222 // simplified === path, so we only have to delete one.
|
| /external/skqp/modules/pathkit/tests/ |
| pathops.spec.js | 196 let simplified = path.simplify();
199 expect(simplified).toBeNull(`Test ${testName} should have not created output, but did`);
201 expect(simplified).not.toBeNull();
204 let diff = diffPaths(expected, simplified);
207 expect(simplified.getFillType().value).toEqual(getFillType(test.fillTypeOut).value);
211 addSVG('[Simplify] ' + testName, expected, simplified, diff);
222 // simplified === path, so we only have to delete one.
|
| /external/swiftshader/third_party/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); local
144 // Simplified should be in the form of REC(1,1)
145 EXPECT_EQ(simplified->GetType(), SENode::RecurrentAddExpr);
147 EXPECT_EQ(simplified->GetChild(0)->GetType(), SENode::Constant);
148 EXPECT_EQ(simplified->GetChild(0)->AsSEConstantNode()->FoldToSingleValue(),
151 EXPECT_EQ(simplified->GetChild(1)->GetType(), SENode::Constant);
152 EXPECT_EQ(simplified->GetChild(1)->AsSEConstantNode()->FoldToSingleValue(),
155 EXPECT_EQ(simplified->GetChild(0), simplified->GetChild(1));
269 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)) local
376 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); local
[all...] |
