| /external/v8/test/cctest/compiler/ |
| test-machine-operator-reducer.cc | 7 #include "src/compiler/js-graph.h"
61 graph(main_zone()),
63 typer(isolate, &graph),
64 jsgraph(isolate, &graph, &common, &javascript, nullptr, &machine),
66 Node* s = graph.NewNode(common.Start(num_parameters));
67 graph.SetStart(s);
75 Graph graph; member in class:v8::internal::compiler::ReducerTester
83 return graph.NewNode(NewConstantOperator<T>(&common, value));
209 return graph.NewNode(common.Parameter(index), graph.start())
[all...] |
| test-osr.cc | 9 #include "src/compiler/graph.h"
10 #include "src/compiler/js-graph.h"
51 graph(main_zone()),
52 jsgraph(main_isolate(), &graph, &common, nullptr, nullptr, nullptr),
53 start(graph.NewNode(common.Start(1))),
54 p0(graph.NewNode(common.Parameter(0), start)),
55 end(graph.NewNode(common.End(1), start)),
56 osr_normal_entry(graph.NewNode(common.OsrNormalEntry(), start, start)),
57 osr_loop_entry(graph.NewNode(common.OsrLoopEntry(), start, start)),
58 self(graph.NewNode(common.Int32Constant(0xaabbccdd)))
68 Graph graph; member in class:v8::internal::compiler::OsrDeconstructorTester
118 AllNodes nodes(main_zone(), &graph); local
[all...] |
| test-representation-change.cc | 9 #include "test/cctest/compiler/graph-builder-tester.h"
28 Node* s = graph()->NewNode(common()->Start(num_parameters));
29 graph()->SetStart(s);
37 Graph* graph() { return main_graph_; } function in class:v8::internal::compiler::RepresentationChangerTester
81 Node* n = graph()->NewNode(common()->Parameter(index), graph()->start());
87 Node* n = graph()->NewNode(common()->Return(), input, graph()->start(),
88 graph()->start())
[all...] |
| test-js-typed-lowering.cc | 6 #include "src/compiler/js-graph.h"
31 graph(main_zone()),
32 typer(main_isolate(), &graph),
34 graph.SetStart(graph.NewNode(common.Start(num_parameters)));
35 graph.SetEnd(graph.NewNode(common.End(1), graph.start()));
47 Graph graph; member in class:v8::internal::compiler::JSTypedLoweringTester
82 JSGraph jsgraph(main_isolate(), &graph, &common, &javascript, &simplified, local
85 GraphReducer graph_reducer(main_zone(), &graph); local
[all...] |
| test-loop-analysis.cc | 7 #include "src/compiler/graph.h"
8 #include "src/compiler/graph-visualizer.h"
9 #include "src/compiler/js-graph.h"
40 graph(main_zone()),
41 jsgraph(main_isolate(), &graph, &common, nullptr, nullptr, nullptr),
42 start(graph.NewNode(common.Start(1))),
43 end(graph.NewNode(common.End(1), start)),
44 p0(graph.NewNode(common.Parameter(0), start)),
48 self(graph.NewNode(common.Int32Constant(0xaabbccdd))),
49 dead(graph.NewNode(common.Dead()))
61 Graph graph; member in class:v8::internal::compiler::LoopFinderTester
[all...] |
| /external/v8/test/cctest/wasm/ |
| wasm-run-utils.h | 15 #include "src/compiler/graph-visualizer.h"
17 #include "src/compiler/js-graph.h"
34 #include "test/cctest/compiler/graph-builder-tester.h"
277 os << AsRPO(*jsgraph->graph());
304 // Create the TF graph for the wrapper. The wrapper always takes four
311 graph()->SetStart(graph()->NewNode(common()->Start(6)));
312 Node* effect = graph()->start();
316 inner_code_node_ = graph()->NewNode(common()->Int32Constant(0));
320 parameters[parameter_count] = graph()->NewNode
492 Graph* graph() const { return main_graph_; } function in class:__anon23977::WasmFunctionCompiler
[all...] |
| /external/v8/src/compiler/ |
| js-generic-lowering.cc | 9 #include "src/compiler/js-graph.h"
126 node->AppendInput(zone(), graph()->start());
133 node->AppendInput(zone(), graph()->start());
140 node->AppendInput(zone(), graph()->start());
147 node->AppendInput(zone(), graph()->start());
161 Node* literals = effect = graph()->NewNode(
165 Node* vector = effect = graph()->NewNode(
185 Node* literals = effect = graph()->NewNode(
189 Node* vector = effect = graph()->NewNode(
211 Node* literals = effect = graph()->NewNode
721 Graph* JSGenericLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSGenericLowering
[all...] |
| js-native-context-specialization.cc | 12 #include "src/compiler/js-graph.h"
94 graph()->zone());
112 Node* check = graph()->NewNode(simplified()->ReferenceEqual(Type::Name()),
114 control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
131 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
132 Node* branch = graph()->NewNode(common()->Branch(), check, control);
133 control = graph()->NewNode(common()->IfFalse(), branch);
134 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch);
137 receiver = effect = graph()->NewNode(simplified()->CheckTaggedPointer(),
144 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap())
1066 Graph* JSNativeContextSpecialization::graph() const { function in class:v8::internal::compiler::JSNativeContextSpecialization
[all...] |
| machine-operator-reducer.cc | 12 #include "src/compiler/graph.h"
13 #include "src/compiler/js-graph.h"
28 return graph()->NewNode(common()->Float32Constant(value));
43 return graph()->NewNode(common()->Int64Constant(value));
48 Node* const node = graph()->NewNode(machine()->Word32And(), lhs, rhs);
56 return graph()->NewNode(machine()->Word32Sar(), lhs, Uint32Constant(rhs));
62 return graph()->NewNode(machine()->Word32Shr(), lhs, Uint32Constant(rhs));
67 return graph()->NewNode(machine()->Word32Equal(), lhs, rhs);
72 Node* const node = graph()->NewNode(machine()->Int32Add(), lhs, rhs);
79 Node* const node = graph()->NewNode(machine()->Int32Sub(), lhs, rhs)
1141 Graph* MachineOperatorReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::MachineOperatorReducer
[all...] |
| verifier.cc | 16 #include "src/compiler/graph.h"
193 // Dead is never connected to the graph.
375 // Type is merged from other values in the graph and could be any.
[all...] |
| js-typed-lowering.cc | 8 #include "src/compiler/js-graph.h"
136 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_);
221 Graph* graph() const { return lowering_->graph(); } function in class:v8::internal::compiler::final
226 Zone* zone() const { return graph()->zone(); }
253 return graph()->NewNode(op,
291 graph()->NewNode(stack->op(), stack->InputCount(), &new_values.front());
293 return graph()->NewNode(
309 return graph()->NewNode(simplified()->PlainPrimitiveToNumber(), node)
1990 Graph* JSTypedLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSTypedLowering
[all...] |
| typer.cc | 11 #include "src/compiler/graph-reducer.h"
33 Typer::Typer(Isolate* isolate, Graph* graph, Flags flags,
36 graph_(graph),
210 Graph* graph() { return typer_->graph(); } function in class:v8::internal::compiler::Typer::Visitor
305 GraphReducer graph_reducer(zone(), graph());
[all...] |
| bytecode-graph-builder.cc | 5 #include "src/compiler/bytecode-graph-builder.h"
43 // Preserve a checkpoint of the environment for the IR graph. Any
75 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::BytecodeGraphBuilder::Environment
199 Node* parameter = builder->graph()->NewNode(op, graph()->start());
356 Node* terminate = builder()->graph()->NewNode(
384 (*state_values) = graph()->NewNode(op, count, &values()->at(offset));
399 Node* result = graph()->NewNode
[all...] |
| effect-control-linearizer.cc | 9 #include "src/compiler/js-graph.h"
24 Graph* EffectControlLinearizer::graph() const { return js_graph_->graph(); } function in class:v8::internal::compiler::EffectControlLinearizer
181 DCHECK_EQ(graph()->start(), control);
182 effect = graph()->start();
205 inputs_buffer.resize(block->PredecessorCount(), graph()->start());
207 effect = graph()->NewNode(
521 Node* value32 = graph()->NewNode(machine()->RoundFloat64ToInt32(), value);
522 Node* check_same = graph()->NewNode
[all...] |
| simplified-lowering.cc | 44 // 1.) PROPAGATE: Traverse the graph from the end, pushing usage information
231 count_(jsgraph->graph()->NodeCount()),
251 typing_stack_.push({graph()->end(), 0});
252 GetInfo(graph()->end())->set_pushed();
558 EnqueueInitial(jsgraph_->graph()->end());
1062 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::RepresentationSelector
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_emit_nv50.cpp | [all...] |
| /external/clang/lib/Analysis/ |
| CFG.cpp | 280 /// LocalScope::const_iterator that specifies position in LocalScope graph.
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /external/v8/test/cctest/ |
| test-regexp.cc | [all...] |
| /prebuilts/tools/common/m2/repository/com/tunnelvisionlabs/antlr4/4.5/ |
| antlr4-4.5.jar | |
| /prebuilts/tools/common/offline-m2/com/tunnelvisionlabs/antlr4/4.5/ |
| antlr4-4.5.jar | |
| /prebuilts/tools/common/m2/repository/org/antlr/antlr/3.5.2/ |
| antlr-3.5.2.jar | |
| /prebuilts/tools/common/m2/repository/org/testng/testng/6.9.10/ |
| testng-6.9.10.jar | |
| /prebuilts/tools/common/offline-m2/org/antlr/antlr/3.5.2/ |
| antlr-3.5.2.jar | |
| /external/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 53 /// nodes in the graph, provide a cutoff to hide them.
[all...] |
