Searched refs:Graph (Results 1 - 25 of 161) sorted by relevance

1234567

/external/chromium_org/v8/src/compiler/
H A Dgraph-visualizer.h17 class Graph;
20 explicit AsDOT(const Graph& g) : graph(g) {}
21 const Graph& graph;
H A Dgraph-replay.h15 class Graph;
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
H A Dverifier.h14 class Graph;
21 static void Run(Graph* graph);
H A Dpipeline.h20 class Graph;
34 Handle<Code> GenerateCodeForMachineGraph(Linkage* linkage, Graph* graph,
50 Schedule* ComputeSchedule(Graph* graph);
51 void VerifyAndPrintGraph(Graph* graph, const char* phase);
52 Handle<Code> GenerateCode(Linkage* linkage, Graph* graph, Schedule* schedule,
H A Dgraph-inl.h16 void Graph::VisitNodeUsesFrom(Node* node, Visitor* visitor) {
23 void Graph::VisitNodeUsesFromStart(Visitor* visitor) {
29 void Graph::VisitNodeInputsFromEnd(Visitor* visitor) {
H A Dgraph.cc21 Graph::Graph(Zone* zone) : GenericGraph<Node>(zone), decorators_(zone) {} function in class:v8::internal::compiler::Graph
24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) {
H A Dgraph-reducer.h15 class Graph;
58 explicit GraphReducer(Graph* graph);
60 Graph* graph() const { return graph_; }
70 Graph* graph_;
H A Dscheduler.h24 static Schedule* ComputeSchedule(Graph* graph);
31 static void ComputeCFG(Graph* graph, Schedule* schedule);
48 Graph* graph_;
55 Scheduler(Zone* zone, Graph* graph, Schedule* schedule);
H A Dtyper.h23 void Run(Graph* graph, MaybeHandle<Context> context);
24 void Narrow(Graph* graph, Node* node, MaybeHandle<Context> context);
25 void Widen(Graph* graph, Node* node, MaybeHandle<Context> context);
27 void DecorateGraph(Graph* graph);
/external/ceres-solver/internal/ceres/
H A Dgraph_test.cc40 TEST(Graph, EmptyGraph) {
41 Graph<int> graph;
45 TEST(Graph, AddVertexAndEdge) {
46 Graph<int> graph;
61 TEST(Graph, AddVertexIdempotence) {
62 Graph<int> graph;
86 TEST(Graph, DieOnNonExistentVertex) {
87 Graph<int> graph;
96 TEST(Graph, NonExistentEdge) {
97 Graph<in
[all...]
H A Dsingle_linkage_clustering.h50 // Graph edges with edge weight less than min_similarity are ignored
67 const Graph<int>& graph,
H A Dcanonical_views_clustering.h63 // interchangably. Given a weighted Graph G(V,E), the canonical views
104 const Graph<int>& graph,
H A Dvisibility.h75 // Caller acquires ownership of the returned Graph pointer
77 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility);
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph class in namespace:nv50_ir
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph; }
136 Graph *grap
[all...]
H A Dnv50_ir_graph.cpp31 Graph::Graph() function in class:nv50_ir::Graph
38 Graph::~Graph()
44 void Graph::insert(Node *node)
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind)
129 bool Graph
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph class in namespace:nv50_ir
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph; }
136 Graph *grap
[all...]
H A Dnv50_ir_graph.cpp31 Graph::Graph() function in class:nv50_ir::Graph
38 Graph::~Graph()
44 void Graph::insert(Node *node)
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind)
129 bool Graph
[all...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTopologicalSort.java30 import org.antlr.misc.Graph;
39 Graph g = new Graph();
60 Graph g = new Graph();
74 Graph g = new Graph();
88 Graph g = new Graph();
102 Graph
[all...]
/external/srec/tools/grxmlcompile/
H A Dgr_iface.cpp30 int Graph::addSubGraph (SubGraph *sbGraph)
68 int Graph::getSubGraphIndex (int subId)
76 int Graph::getSubGraphIndex (SubGraph *sGraph)
86 void Graph::BeginRule (SubGraph *subg)
95 void Graph::EndRule (SubGraph *subg)
104 void Graph::BeginItem (SubGraph *subg)
113 void Graph::BeginItemRepeat (SubGraph *subg, int minCount, int maxCount)
122 void Graph::AddRuleRef (SubGraph *subg, int ruleNo)
132 void Graph::AddLabel (SubGraph *subg, int labNo)
141 void Graph
[all...]
/external/llvm/include/llvm/ADT/
H A DGraphTraits.h1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
79 const GraphType &Graph; member in struct:llvm::Inverse
81 inline Inverse(const GraphType &G) : Graph(G) {}
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
/external/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h40 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable
41 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
44 ViewGraph(Graph, Name, IsSimple, Title);
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable
74 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
78 WriteGraph(File, Graph, IsSimple, Title);
104 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable
105 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
107 ViewGraph(Graph, Name, IsSimple, Title);
130 GraphT Graph variable
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dgraph-tester.h18 class GraphTester : public HandleAndZoneScope, public Graph {
20 GraphTester() : Graph(main_zone()) {}
/external/llvm/lib/CodeGen/
H A DScheduleDAGPrinter.cpp48 const ScheduleDAG *Graph) {
56 const ScheduleDAG *Graph) {
65 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
67 const ScheduleDAG *Graph) {
98 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
47 hasNodeAddressLabel(const SUnit *Node, const ScheduleDAG *Graph) argument
54 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument
66 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph { class in namespace:llvm
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
105 /// Graph - Default constructor. Creates an empty graph.
106 Graph() {
131 // on taking a constant Graph
[all...]
/external/llvm/lib/Analysis/IPA/
H A DCallPrinter.cpp28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } argument
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument

Completed in 5654 milliseconds

1234567