| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 327 /// this can make the graph smaller.
529 // machine function as a graph of machine basic blocks... these are
539 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
551 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
566 // graph of basic blocks... and to walk it in inverse order. Inverse order for
573 return &G.Graph->front();
579 return &G.Graph->front();
|
| MachineBasicBlock.h | [all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_print.cpp | 591 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
607 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())
|
| /external/v8/src/compiler/ |
| osr.cc | 12 #include "src/compiler/graph.h"
13 #include "src/compiler/graph-reducer.h"
14 #include "src/compiler/graph-trimmer.h"
15 #include "src/compiler/graph-visualizer.h"
16 #include "src/compiler/js-graph.h"
44 // Peel outer loops and rewire the graph so that control reduction can
45 // produce a properly formed graph.
46 static void PeelOuterLoopsForOsr(Graph* graph, CommonOperatorBuilder* common,
50 const size_t original_count = graph->NodeCount()
254 Graph* graph = jsgraph->graph(); local
[all...] |
| bytecode-graph-builder.h | 10 #include "src/compiler/js-graph.h"
18 // The BytecodeGraphBuilder produces a high-level IR graph based on
25 // Creates a graph by visiting bytecodes.
160 // entered and exited while the graph builder is iterating over the
172 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::BytecodeGraphBuilder
174 Zone* graph_zone() const { return graph()->zone(); }
|
| graph-reducer.cc | 8 #include "src/compiler/graph.h"
9 #include "src/compiler/graph-reducer.h"
29 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead)
30 : graph_(graph),
32 state_(graph, 4),
76 void GraphReducer::ReduceGraph() { ReduceNode(graph()->end()); }
130 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1);
171 if (node == graph()->start()) graph()->SetStart(replacement)
[all...] |
| code-assembler.h | 31 class Graph;
374 Graph* graph() const;
|
| graph-visualizer.cc | 5 #include "src/compiler/graph-visualizer.h"
12 #include "src/compiler/graph.h"
112 JSONGraphNodeWriter(std::ostream& os, Zone* zone, const Graph* graph,
114 : os_(os), all_(zone, graph), positions_(positions), first_node_(true) {}
173 JSONGraphEdgeWriter(std::ostream& os, Zone* zone, const Graph* graph)
174 : os_(os), all_(zone, graph), first_edge_(true) {}
226 JSONGraphNodeWriter(os, &tmp_zone, &ad.graph, ad.positions).Print();
228 JSONGraphEdgeWriter(os, &tmp_zone, &ad.graph).Print()
[all...] |
| js-inlining.cc | 11 #include "src/compiler/ast-graph-builder.h"
14 #include "src/compiler/graph-reducer.h"
146 NodeProperties::MergeControlToEnd(jsgraph_->graph(), jsgraph_->common(),
148 Revisit(jsgraph_->graph()->end());
162 Node* control_output = jsgraph_->graph()->NewNode(
166 Node* value_output = jsgraph_->graph()->NewNode(
169 Node* effect_output = jsgraph_->graph()->NewNode(
192 Node* node0 = jsgraph_->graph()->NewNode(op0);
199 Node* params_node = jsgraph_->graph()->NewNode(
201 return jsgraph_->graph()->NewNode(op, params_node, node0, node0
520 Graph* JSInliner::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSInliner
[all...] |
| loop-analysis.cc | 7 #include "src/compiler/graph.h"
45 // This loop finding algorithm works by traversing the graph in two directions,
53 LoopFinderImpl(Graph* graph, LoopTree* loop_tree, Zone* zone)
55 end_(graph->end()),
57 queued_(graph, 2),
58 info_(graph->NodeCount(), {nullptr, nullptr}, zone),
60 loop_num_(graph->NodeCount(), -1, zone),
450 LoopTree* LoopFinder::BuildLoopTree(Graph* graph, Zone* zone)
[all...] |
| wasm-compiler.h | 22 class Graph;
34 // Expose {Node} and {Graph} opaquely as {wasm::TFNode} and {wasm::TFGraph}.
68 // The graph zone is deallocated at the end of ExecuteCompilation.
92 // Abstracts details of building TurboFan graph nodes for WASM to separate
217 Graph* graph();
|
| branch-elimination.cc | 7 #include "src/compiler/js-graph.h"
19 node_conditions_(zone, js_graph->graph()->NodeCount()),
21 dead_(js_graph->graph()->NewNode(js_graph->common()->Dead())) {}
106 control = graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kEager),
109 NodeProperties::MergeControlToEnd(graph(), common(), control);
110 Revisit(graph()->end());
305 Graph* BranchElimination::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::BranchElimination
|
| control-flow-optimizer.cc | 8 #include "src/compiler/graph.h"
16 ControlFlowOptimizer::ControlFlowOptimizer(Graph* graph,
20 : graph_(graph),
24 queued_(graph, 2),
29 Enqueue(graph()->start());
75 // input graph as shown below and clones the Branch node for every predecessor
103 // The resulting graph (modulo the Phi and EffectPhi nodes) looks like this:
167 Node* branch1 = graph()->NewNode(common()->Branch(hint), cond1, control1);
168 merge_true_inputs[index] = graph()->NewNode(common()->IfTrue(), branch1)
[all...] |
| js-global-object-specialization.cc | 10 #include "src/compiler/js-graph.h"
66 Node* value = effect = graph()->NewNode(
118 Type::Class(property_cell_value_map, graph()->zone());
121 Node* value = effect = graph()->NewNode(
148 effect = graph()->NewNode(javascript()->StoreContext(0, result.index),
174 graph()->NewNode(simplified()->ReferenceEqual(Type::Tagged()), value,
176 control = effect = graph()->NewNode(common()->DeoptimizeUnless(), check,
184 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value);
188 control = effect = graph()->NewNode(common()->DeoptimizeIf(), check,
193 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap())
258 Graph* JSGlobalObjectSpecialization::graph() const { function in class:v8::internal::compiler::JSGlobalObjectSpecialization
[all...] |
| simplified-operator-reducer.cc | 7 #include "src/compiler/js-graph.h"
244 Graph* SimplifiedOperatorReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::SimplifiedOperatorReducer
|
| /external/clang/test/SemaCXX/ |
| warn-thread-safety-parsing.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| RegionPrinter.cpp | 44 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
67 static std::string getGraphName(const RegionInfo *) { return "Region Graph"; }
|
| /external/opencv3/modules/stitching/src/ |
| util.cpp | 95 void Graph::addEdge(int from, int to, float weight)
|
| motion_estimators.cpp | 157 Graph span_tree;
268 Graph span_tree;
691 str << "graph matches_graph{\n";
813 Graph &span_tree, std::vector<int> ¢ers)
815 Graph graph(num_images);
818 // Construct images graph and remember its edges
826 graph.addEdge(i, j, conf);
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Graph.py | 2 altgraph.Graph - Base Graph class
19 class Graph(object):
21 The Graph class represents a directed graph with *N* nodes and *E* edges.
36 edges to traverse the graph (goes forward).
61 return '<Graph: %d nodes, %d edges>' % (
66 Adds a new node to the graph. Arbitrary data can be attached to the
123 Hides an edge from the graph. The edge may be unhidden at some later
136 Hides a node from the graph. The incoming and outgoing edges of th
[all...] |
| /external/v8/test/cctest/compiler/ |
| codegen-tester.h | 34 main_isolate(), new (main_zone()) Graph(main_zone()),
67 Graph* graph = this->graph(); local
69 code_ = Pipeline::GenerateCodeForTesting(&info, call_descriptor, graph,
94 // to the constructed IR graph. Instead it passes a pointer to the parameter
95 // to the IR graph, and adds Load nodes to the IR graph to load the
97 // to the IR graph.
103 // The BufferedRawMachineAssemblerTester adds a Store node to the IR graph
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 15 * Simple graph class to implement topological sort (used to sort methods based on what groups
20 public class Graph<T> {
192 System.out.println("[Graph] " + s);
245 StringBuilder result = new StringBuilder("[Graph ");
|
| /external/v8/test/unittests/compiler/ |
| scheduler-unittest.cc | 8 #include "src/compiler/graph-visualizer.h"
9 #include "src/compiler/graph.h"
36 SourcePositionTable table(graph());
37 os << AsJSON(*graph(), &table);
41 Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kSplitNodes);
61 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::SchedulerTest
67 Graph graph_;
89 graph()->SetStart(graph()->NewNode(common()->Start(0)))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/ |
| Tool.java | 32 import org.antlr.misc.Graph;
561 Graph g = new Graph();
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/ |
| test_modulegraph.py | 9 from altgraph import Graph
530 g = Graph.Graph()
544 self.assertTrue(o.graph is g)
550 graph = modulegraph.ModuleGraph(path=[
555 pkgs = graph.nspackages
566 graph = modulegraph.ModuleGraph()
571 return [graph.createNode(modulegraph.Node, args[0])]
575 return [graph.createNode(modulegraph.Node, args[0])]
577 graph.import_hook = import_hoo
[all...] |
