| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) {
58 const ScheduleDAG *Graph) {
67 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
69 const ScheduleDAG *Graph) {
100 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
| /external/v8/src/compiler/ |
| all-nodes.h | 15 // A helper utility that traverses the graph and gathers all nodes reachable
19 // Constructor. Traverses the graph and builds the {live} sets.
20 AllNodes(Zone* local_zone, const Graph* graph);
|
| common-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
24 CommonOperatorReducer(Editor* editor, Graph* graph,
43 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
48 Graph* const graph_;
|
| node-marker.cc | 7 #include "src/compiler/graph.h"
13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states)
14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) {
|
| loop-peeling.h | 33 static PeeledIteration* Peel(Graph* graph, CommonOperatorBuilder* common,
|
| scheduler.h | 22 class Graph;
26 // Computes a schedule from a graph, placing nodes into basic blocks and
35 // nodes from the graph into it.
36 static Schedule* ComputeSchedule(Zone* zone, Graph* graph, Flags flags);
64 Graph* graph_;
75 Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags);
89 // Phase 1: Build control-flow graph.
|
| node-marker.h | 15 class Graph;
21 NodeMarkerBase(Graph* graph, uint32_t num_states);
45 // A NodeMarker assigns a local "state" to every node of a graph in constant
46 // memory. Only one NodeMarker per graph is valid at a given time, that is,
64 V8_INLINE NodeMarker(Graph* graph, uint32_t num_states)
65 : NodeMarkerBase(graph, num_states) {}
|
| typer.h | 9 #include "src/compiler/graph.h"
33 Typer(Isolate* isolate, Graph* graph, Flags flags = kNoFlags,
39 // TODO(bmeurer,jarin): Remove this once we have a notion of "roots" on Graph.
46 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::Typer
47 Zone* zone() const { return graph()->zone(); }
55 Graph* const graph_;
|
| int64-lowering.h | 9 #include "src/compiler/graph.h"
20 Int64Lowering(Graph* graph, MachineOperatorBuilder* machine,
41 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::Int64Lowering
68 Graph* const graph_;
|
| all-nodes.cc | 7 #include "src/compiler/graph.h"
13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph)
14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) {
15 Node* end = graph->end();
25 if (input->id() >= graph->NodeCount()) {
|
| graph-reducer.h | 16 class Graph;
25 // Represents the result of trying to reduce a node in the graph.
39 // inputs. This class functions as an extension point for the graph reducer for
41 // folding of low-level operators) can be integrated into the graph reduction
88 // Helper functions for subclasses to edit the graph.
105 // TODO(turbofan): replace the effect input to {node} with {graph->start()}.
121 // Performs an iterative reduction of a node graph.
124 GraphReducer(Zone* zone, Graph* graph, Node* dead = nullptr);
127 Graph* graph() const { return graph_; function in class:v8::internal::compiler::GraphReducer
[all...] |
| /system/update_engine/payload_generator/ |
| inplace_generator.h | 59 // each of which has a corresponding vertex in a graph.
71 // Checks all the operations in the graph have a type assigned.
72 static void CheckGraph(const Graph& graph);
86 // Cuts 'edges' from 'graph' according to the AU algorithm. This means
93 static bool CutEdges(Graph* graph,
97 // Creates all the edges for the graph. Writers of a block point to
100 static void CreateEdges(Graph* graph,
[all...] |
| topological_sort.cc | 30 void TopologicalSortVisit(const Graph& graph,
39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin();
40 it != graph[node].out_edges.end(); ++it) {
41 TopologicalSortVisit(graph, visited_nodes, nodes, it->first);
48 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) {
51 for (Vertex::Index i = 0; i < graph.size(); i++) {
52 TopologicalSortVisit(graph, &visited_nodes, out, i);
|
| tarjan.cc | 35 Graph* graph,
40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it)
44 Tarjan(vertex, graph);
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
99 /// Nodes - The list of nodes for this graph
[all...] |
| /external/llvm/lib/Analysis/ |
| CallPrinter.cpp | 1 //===- CallPrinter.cpp - DOT printer for call graph -----------------------===//
11 // containing the call graph of a module.
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; }
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
77 INITIALIZE_PASS(CallGraphViewer, "view-callgraph", "View call graph", false,
82 "Print call graph to 'dot' file", false, false)
|
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering.h | 36 #include "ceres/graph.h"
74 // Builds a graph on the parameter blocks of a Problem, whose
79 Graph<ParameterBlock*>* CreateHessianGraph(const Program& program);
|
| parameter_block_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
51 const HashSet<ParameterBlock*>& vertices = graph->vertices();
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering);
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
76 int independent_set_size = IndependentSetOrdering(*graph, ordering);
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program))
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); local
[all...] |
| single_linkage_clustering_test.cc | 39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
51 // Graph structure:
54 graph.AddEdge(0, 1, 1.0);
55 graph.AddEdge(1, 2, 1.0);
56 graph.AddEdge(2, 3, 1.0);
57 graph.AddEdge(4, 5, 1.0);
61 ComputeSingleLinkageClustering(options, graph, &membership)
73 Graph<int> graph; local
102 Graph<int> graph; local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_altgraph.py | 5 from altgraph import Graph, GraphAlgo
18 self.g = Graph.Graph()
|
| test_dot.py | 5 from altgraph import Graph
12 g = Graph.Graph([
55 graphtype="graph")
64 self.assertEqual(dot.type, 'graph')
81 g = Graph.Graph([])
94 g = Graph.Graph([
126 g = Graph.Graph(
[all...] |
| test_graphstat.py | 4 from altgraph import Graph
10 a = Graph.Graph()
|
| /external/testng/src/test/java/test/ |
| GraphTest.java | 6 import org.testng.internal.Graph;
21 Graph<String> g = new Graph<>();
54 Graph<String> g = createCyclicGraph();
60 Graph<String> g = null;
72 private Graph<String> createCyclicGraph() {
73 Graph<String> g = new Graph<>();
87 Graph<String> g = new Graph<>();
[all...] |
| /system/core/libmemunreachable/ |
| Tarjan.h | 54 using Graph = allocator::vector<Node<T>*>;
68 void Execute(Graph<T>& graph, SCCList<T>& out);
71 void Tarjan(Node<T>* vertex, Graph<T>& graph);
79 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) {
83 for (auto& it: graph) {
88 for (auto& it: graph) {
90 Tarjan(it, graph);
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| Tarjan.java | 12 * Implementation of the Tarjan algorithm to find and display a cycle in a graph.
22 public Tarjan(Graph<T> graph, T start) {
24 run(graph, start);
27 private void run(Graph<T> graph, T v) {
33 for (T vprime : graph.getPredecessors(v)) {
35 run(graph, vprime);
56 Graph<String> g = new Graph<>();
[all...] |
