/external/v8/test/cctest/compiler/ |
simplified-graph-builder.h | 11 #include "src/compiler/simplified-operator.h" 23 SimplifiedOperatorBuilder* simplified); 30 SimplifiedOperatorBuilder* simplified() const { return simplified_; } function in class:v8::internal::compiler::SimplifiedGraphBuilder 53 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } 56 return NewNode(simplified()->NumberEqual(), a, b); 59 return NewNode(simplified()->NumberLessThan(), a, b); 62 return NewNode(simplified()->NumberLessThanOrEqual(), a, b); 65 return NewNode(simplified()->NumberAdd(), a, b); 68 return NewNode(simplified()->NumberSubtract(), a, b); 71 return NewNode(simplified()->NumberMultiply(), a, b) [all...] |
simplified-graph-builder.cc | 5 #include "test/cctest/compiler/simplified-graph-builder.h" 16 MachineOperatorBuilder* machine, SimplifiedOperatorBuilder* simplified) 22 simplified_(simplified) {}
|
test-simplified-lowering.cc | 14 #include "src/compiler/simplified-lowering.h" 735 return graph()->NewNode(simplified()->ReferenceEqual(Type::Any()), node, 753 SimplifiedOperatorBuilder* simplified() { return &main_simplified_; } function in class:TestingGraph 764 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); 779 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); 796 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); 811 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); 828 Node* cnv = t.graph()->NewNode(t.simplified()->BooleanToNumber(), b); 840 Node* cnv = t.graph()->NewNode(t.simplified()->BooleanToNumber(), b); 855 Node* cnv = t.graph()->NewNode(t.simplified()->BooleanToNumber(), b) [all...] |
test-changes-lowering.cc | 165 t.BuildAndLower(t.simplified()->ChangeTaggedToInt32()); 195 t.BuildAndLower(t.simplified()->ChangeTaggedToUint32()); 227 t.simplified()->ChangeTaggedToFloat64(), 275 t.BuildAndLower(t.simplified()->ChangeBoolToBit()); 293 t.BuildAndLower(t.simplified()->ChangeBitToBool()); 315 t.BuildLoadAndLower(t.simplified()->ChangeInt32ToTagged(), 332 t.BuildLoadAndLower(t.simplified()->ChangeUint32ToTagged(), 350 t.BuildLoadAndLower(t.simplified()->ChangeInt32ToTagged(), 372 t.BuildLoadAndLower(t.simplified()->ChangeUint32ToTagged(), 395 t.BuildLoadAndLower(t.simplified()->ChangeFloat64ToTagged() [all...] |
test-js-typed-lowering.cc | 24 simplified(main_zone()), 39 SimplifiedOperatorBuilder simplified; member in class:JSTypedLoweringTester 235 R.javascript.Add(), R.simplified.NumberAdd(), 236 R.javascript.Subtract(), R.simplified.NumberSubtract(), 237 R.javascript.Multiply(), R.simplified.NumberMultiply(), 238 R.javascript.Divide(), R.simplified.NumberDivide(), 239 R.javascript.Modulus(), R.simplified.NumberModulus(), 423 Node* add = R.graph.NewNode(R.simplified.ReferenceEqual(Type::Any()), n, c); 544 Node* add = R.graph.NewNode(R.simplified.ReferenceEqual(Type::Any()), n, c); 618 Node* add = R.graph.NewNode(R.simplified.ReferenceEqual(Type::Any()), n, c) [all...] |
test-js-context-specialization.cc | 34 SimplifiedOperatorBuilder* simplified() { return &simplified_; } function in class:ContextSpecializationTester 216 Node* value_use = t.NewNode(t.simplified()->ChangeTaggedToInt32(), load); 221 t.NewNode(t.simplified()->ChangeTaggedToInt32(), other_load);
|
/external/v8/src/compiler/ |
simplified-operator-reducer-unittest.cc | 7 #include "src/compiler/simplified-operator.h" 8 #include "src/compiler/simplified-operator-reducer.h" 32 SimplifiedOperatorBuilder* simplified() { return &simplified_; } function in class:v8::internal::compiler::SimplifiedOperatorReducerTest 165 graph()->NewNode((simplified()->*unop.constructor)(), Parameter(0))); 182 graph()->NewNode(simplified()->BooleanNot(), 183 graph()->NewNode(simplified()->BooleanNot(), param0))); 191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); 199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); 212 simplified()->ChangeBitToBool(), 213 graph()->NewNode(simplified()->ChangeBoolToBit(), param0))) [all...] |
js-typed-lowering.cc | 103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); 134 SimplifiedOperatorBuilder* simplified() { return lowering_->simplified(); } function in class:v8::internal::compiler::JSBinopReduction 212 const Operator* op = is_signed ? simplified()->NumberToInt32() 213 : simplified()->NumberToUint32(); 228 return r.ChangeToPureOperator(simplified()->NumberAdd()); 234 return r.ChangeToPureOperator(simplified()->NumberAdd()); 246 return r.ChangeToPureOperator(simplified()->StringAdd()); 296 stringOp = simplified()->StringLessThan(); 299 stringOp = simplified()->StringLessThan() [all...] |
representation-change.h | 12 #include "src/compiler/simplified-operator.h" 19 // and other nodes, as well as lowering Simplified->Machine operators. 23 RepresentationChanger(JSGraph* jsgraph, SimplifiedOperatorBuilder* simplified, 26 simplified_(simplified), 97 op = simplified()->ChangeBitToBool(); 100 op = simplified()->ChangeUint32ToTagged(); 102 op = simplified()->ChangeInt32ToTagged(); 107 op = simplified()->ChangeFloat64ToTagged(); 143 op = simplified()->ChangeTaggedToFloat64(); 182 op = simplified()->ChangeTaggedToUint32() 353 SimplifiedOperatorBuilder* simplified() { return simplified_; } function in class:v8::internal::compiler::RepresentationChanger [all...] |
simplified-operator-unittest.cc | 5 #include "src/compiler/simplified-operator.h" 90 SimplifiedOperatorBuilder simplified(zone()); 92 const Operator* op = (simplified.*pop.constructor)(); 106 SimplifiedOperatorBuilder simplified(zone()); 108 const Operator* op = (simplified.*pop.constructor)(); 114 SimplifiedOperatorBuilder simplified(zone()); 116 const Operator* op = (simplified.*pop.constructor)(); 177 SimplifiedOperatorBuilder simplified(zone()); 179 const Operator* op = simplified.LoadElement(access); 197 SimplifiedOperatorBuilder simplified(zone()) [all...] |
js-builtin-reducer.h | 12 #include "src/compiler/simplified-operator.h" 31 SimplifiedOperatorBuilder* simplified() { return &simplified_; } function in class:v8::internal::compiler::FINAL
|
change-lowering-unittest.cc | 10 #include "src/compiler/simplified-operator.h" 86 SimplifiedOperatorBuilder* simplified() { return &simplified_; } function in class:v8::internal::compiler::ChangeLoweringTest 127 Node* node = graph()->NewNode(simplified()->ChangeBitToBool(), val); 144 Node* node = graph()->NewNode(simplified()->ChangeBoolToBit(), val); 154 Node* node = graph()->NewNode(simplified()->ChangeFloat64ToTagged(), val); 173 graph()->NewNode(simplified()->StringAdd(), Parameter(0), Parameter(1)); 198 Node* node = graph()->NewNode(simplified()->ChangeInt32ToTagged(), val); 228 Node* node = graph()->NewNode(simplified()->ChangeTaggedToFloat64(), val); 257 Node* node = graph()->NewNode(simplified()->ChangeTaggedToInt32(), val); 283 Node* node = graph()->NewNode(simplified()->ChangeTaggedToUint32(), val) [all...] |
js-typed-lowering.h | 12 #include "src/compiler/simplified-operator.h" 18 // Lowers JS-level operators to simplified operators based on types. 53 SimplifiedOperatorBuilder* simplified() { return &simplified_; } function in class:v8::internal::compiler::FINAL
|
js-inlining.cc | 16 #include "src/compiler/simplified-operator.h" 240 SimplifiedOperatorBuilder simplified(jsgraph->zone()); 242 simplified.LoadField(AccessBuilder::ForJSFunctionContext()),
|
js-builtin-reducer.cc | 127 Node* tag = graph()->NewNode(simplified()->NumberLessThan(), value, p);
|
simplified-lowering.cc | 5 #include "src/compiler/simplified-lowering.h" 13 #include "src/compiler/simplified-lowering.h" 14 #include "src/compiler/simplified-operator.h" 25 // Representation selection and lowering of {Simplified} operators to machine 27 // output representation and the best possible lowering for {Simplified} nodes. 42 // 2.) LOWER: perform lowering for all {Simplified} nodes by replacing some 95 TRACE(("--{Simplified lowering phase}--\n")); 411 // to Simplified and that they will always require tagged value inputs 423 // Simplified operators. 797 SimplifiedOperatorBuilder simplified(graph()->zone()) 798 RepresentationChanger changer(jsgraph(), &simplified, local [all...] |
/external/regex-re2/re2/testing/ |
simplify_test.cc | 16 const char* simplified; member in struct:re2::Test 154 if (strcmp(tests[i].regexp, tests[i].simplified) == 0) { 159 EXPECT_EQ(tests[i].simplified, sre->ToString())
|
/libcore/luni/src/main/java/libcore/reflect/ |
Types.java | 131 Type simplified = ((GenericArrayType) type).getGenericComponentType(); local 132 appendGenericType(out, simplified);
|
/external/llvm/test/MC/ARM/ |
eh-directive-integrated-test.s | 3 @ This is a simplified real world test case generated from this C++ code
|
/external/v8/ |
Android.v8common.mk | 71 src/compiler/simplified-lowering.cc \ 72 src/compiler/simplified-operator-reducer.cc \ 73 src/compiler/simplified-operator.cc \
|
/external/v8/benchmarks/spinning-balls/ |
splay-tree.js | 192 * tree. This is the simplified top-down splaying algorithm from:
|
/external/v8/tools/ |
splaytree.js | 218 * tree. This is the simplified top-down splaying algorithm from:
|
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
splay.js | 287 * tree. This is the simplified top-down splaying algorithm from:
|
/external/libvorbis/doc/ |
07-floor1.tex | 22 prediction in a process roughly equivalent to the following simplified
|
/external/v8/benchmarks/ |
splay.js | 287 * tree. This is the simplified top-down splaying algorithm from:
|