| /external/v8/src/compiler/ |
| raw-machine-assembler.h | 10 #include "src/compiler/graph.h"
26 // The RawMachineAssembler produces a low-level IR graph. All nodes are wired
27 // into a graph and also placed into a schedule immediately, hence subsequent
34 // Also note that the generated graph is only valid together with the generated
35 // schedule, using one without the other is invalid as the graph is inherently
40 Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor,
47 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::RawMachineAssembler
48 Zone* zone() const { return graph()->zone();
[all...] |
| node-properties.cc | 6 #include "src/compiler/graph.h"
197 void NodeProperties::MergeControlToEnd(Graph* graph,
200 graph->end()->AppendInput(graph->zone(), node);
201 graph->end()->set_op(common->End(graph->end()->InputCount()));
|
| node.h | 19 class Graph;
22 // Marks are used during traversal of the graph to distinguish states of nodes.
|
| wasm-compiler.cc | 15 #include "src/compiler/graph-visualizer.h"
16 #include "src/compiler/graph.h"
20 #include "src/compiler/js-graph.h"
57 Graph* g = jsgraph->graph();
67 // A helper that handles building graph fragments for trapping.
76 graph_(builder->jsgraph() ? builder->jsgraph()->graph() : nullptr) {}
92 if (m.HasValue() && !m.Is(val)) return graph()->start();
97 graph()->NewNode(jsgraph()->machine()->Word32Equal(), node,
114 if (m.HasValue() && !m.Is(val)) return graph()->start()
188 Graph* graph() { return jsgraph_->graph(); } function in class:v8::internal::compiler::WasmTrapHelper
2902 Graph* WasmGraphBuilder::graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::WasmGraphBuilder
3110 Graph* graph = jsgraph_->graph(); local
[all...] |
| common-operator-reducer.cc | 10 #include "src/compiler/graph.h"
40 CommonOperatorReducer::CommonOperatorReducer(Editor* editor, Graph* graph,
44 graph_(graph),
47 dead_(graph->NewNode(common->Dead())) {}
79 // already properly optimized before we get here (as guaranteed by the graph
95 // since we tell the graph reducer that the {branch} was changed and the
96 // graph reduction logic will ensure that the uses are revisited properly.
132 // (as guaranteed by the graph reduction logic).
145 control = graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kEager)
[all...] |
| js-builtin-reducer.cc | 6 #include "src/compiler/js-graph.h"
100 Node* value = graph()->NewNode(simplified()->NumberAbs(), input);
112 Node* value = graph()->NewNode(simplified()->NumberAtan(), input);
127 Node* value = graph()->NewNode(simplified()->NumberAtan2(), left, right);
138 Node* value = graph()->NewNode(simplified()->NumberAtanh(), r.left());
150 Node* value = graph()->NewNode(simplified()->NumberCeil(), input);
162 Node* value = graph()->NewNode(simplified()->NumberClz32(), input);
174 Node* value = graph()->NewNode(simplified()->NumberCos(), input);
186 Node* value = graph()->NewNode(simplified()->NumberExp(), input);
197 Node* value = graph()->NewNode(simplified()->NumberExpm1(), r.left())
531 Graph* JSBuiltinReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSBuiltinReducer
[all...] |
| js-call-reducer.cc | 7 #include "src/compiler/js-graph.h"
156 node->InsertInput(graph()->zone(), static_cast<int>(arity),
285 graph()->zone(), i + 2,
317 Node* native_context = effect = graph()->NewNode(
320 array_function = effect = graph()->NewNode(
326 Node* check = graph()->NewNode(
329 control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
344 Node* check = graph()->NewNode(
347 control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
439 Node* native_context = effect = graph()->NewNode
502 Graph* JSCallReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSCallReducer
[all...] |
| js-intrinsic-lowering.cc | 11 #include "src/compiler/js-graph.h"
118 graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kEager),
120 NodeProperties::MergeControlToEnd(graph(), common(), deoptimize);
121 Revisit(graph()->end());
131 Node* renamed = graph()->NewNode(simplified()->TypeGuard(Type::Number()),
132 node->InputAt(0), graph()->start());
140 Node* renamed = graph()->NewNode(simplified()->TypeGuard(Type::Number()),
141 node->InputAt(0), graph()->start());
191 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value);
192 Node* branch = graph()->NewNode(common()->Branch(), check, control)
484 Graph* JSIntrinsicLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSIntrinsicLowering
[all...] |
| memory-optimizer.cc | 7 #include "src/compiler/js-graph.h"
26 EnqueueUses(graph()->start(), empty_state());
141 Node* top = graph()->NewNode(machine()->IntAdd(), state->top(),
143 effect = graph()->NewNode(
149 value = graph()->NewNode(
151 graph()->NewNode(machine()->IntAdd(), state->top(),
160 Node* size = graph()->NewNode(common()->Int32Constant(object_size));
164 graph()->NewNode(machine()->Load(MachineType::Pointer()), top_address,
166 Node* limit = effect = graph()->NewNode(
172 Node* check = graph()->NewNode
482 Graph* MemoryOptimizer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::MemoryOptimizer
[all...] |
| code-assembler.cc | 10 #include "src/compiler/graph.h"
52 isolate, new (zone) Graph(zone), call_descriptor,
71 isolate(), raw_assembler_->call_descriptor(), graph(), schedule, flags_,
702 Graph* CodeAssembler::graph() const { return raw_assembler_->graph(); } function in class:v8::internal::compiler::CodeAssembler
|
| js-create-lowering.cc | 12 #include "src/compiler/js-graph.h"
40 effect_ = graph()->NewNode(
43 graph()->NewNode(simplified()->Allocate(pretenure),
50 effect_ = graph()->NewNode(simplified()->StoreField(access), allocation_,
56 effect_ = graph()->NewNode(simplified()->StoreElement(access), allocation_,
87 return graph()->NewNode(common()->FinishRegion(), allocation_, effect_);
92 Graph* graph() { return jsgraph_->graph(); } function in class:v8::internal::compiler::__anon23624::final
130 // size of all objects that are part of the graph
1117 Graph* JSCreateLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSCreateLowering
[all...] |
| scheduler.cc | 13 #include "src/compiler/graph.h"
28 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags)
30 graph_(graph),
39 Schedule* Scheduler::ComputeSchedule(Zone* zone, Graph* graph, Flags flags) {
40 Schedule* schedule = new (graph->zone())
41 Schedule(graph->zone(), static_cast<size_t>(graph->NodeCount()));
42 Scheduler scheduler(zone, graph, schedule, flags)
[all...] |
| int64-lowering.cc | 8 #include "src/compiler/graph.h"
22 Int64Lowering::Int64Lowering(Graph* graph, MachineOperatorBuilder* machine,
26 graph_(graph),
29 state_(graph, 3),
33 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"),
34 graph->start())) {
35 DCHECK_NOT_NULL(graph);
36 DCHECK_NOT_NULL(graph->end());
37 replacements_ = zone->NewArray<Replacement>(graph->NodeCount())
[all...] |
| raw-machine-assembler.cc | 16 RawMachineAssembler::RawMachineAssembler(Isolate* isolate, Graph* graph,
21 graph_(graph),
30 graph->SetStart(graph->NewNode(common_.Start(param_count + 1)));
33 AddNode(common()->Parameter(static_cast<int>(i)), graph->start());
35 graph->SetEnd(graph->NewNode(common_.End(0)));
101 graph()->NewNode(common()->IfValue(case_value), switch_node);
107 Node* default_node = graph()->NewNode(common()->IfDefault(), switch_node)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 41 template<class Graph> class GraphWriter;
274 // Preds/Succs - The SUnits before/after us in the graph.
|
| /external/v8/test/cctest/compiler/ |
| test-instruction.cc | 7 #include "src/compiler/graph.h"
28 : graph(zone()),
34 Graph graph; member in class:v8::internal::compiler::InstructionTester
55 Node* node = graph.NewNode(common.Int32Constant(val));
61 Node* node = graph.NewNode(common.Float64Constant(val));
67 Node* node = graph.NewNode(common.Parameter(which));
73 Node* node = graph.NewNode(common.Int32Constant(111));
113 R.Int32Constant(i); // Add some nodes to the graph.
|
| test-js-constant-cache.cc | 6 #include "src/compiler/js-graph.h"
25 Graph main_graph_;
338 size_t count_before = T.graph()->NodeCount();
360 size_t count_before = T.graph()->NodeCount();
382 size_t count_before = T.graph()->NodeCount();
404 size_t count_before = T.graph()->NodeCount();
431 size_t count_before = T.graph()->NodeCount();
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | [all...] |
| /external/clang/test/SemaCXX/ |
| warn-thread-safety-analysis.cpp | [all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_peephole.cpp | [all...] |
| nv50_ir_lowering_nv50.cpp | 713 currBB->cfg.attach(&texiBB->cfg, Graph::Edge::FORWARD);
716 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
|
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | [all...] |
| /external/gmock/test/ |
| gmock-matchers_test.cc | [all...] |
| /external/llvm/lib/CodeGen/ |
| MachineFunction.cpp | 418 const MachineFunction *Graph) {
[all...] |
| /external/opencv/cvaux/include/ |
| cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder
314 int N; //graph size
342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse,
347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/
353 // Purpose: finds weight of subgraph in a graph
356 // graph - input graph.
364 // weight_vtx - optional vector of floats, with size = graph->total.
368 // that vertices of graph are inherited from CvGraphWeightedVtx.
369 // weight_edge - optional matrix of floats, of width and height = graph->total
[all...] |
