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

12

/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the
28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g;
66 void addToOptimalReductionList(Graph::NodeItr nItr) {
86 Graph
[all...]
H A DSolution.h18 #include "Graph.h"
30 typedef std::map<Graph::ConstNodeItr, unsigned,
77 void setSelection(Graph::NodeItr nItr, unsigned selection) {
84 unsigned getSelection(Graph::ConstNodeItr nItr) const {
H A DHeuristicSolver.h19 #include "Graph.h"
29 /// to HeuristicSolver<HImpl>::solve(Graph&).
43 typedef std::list<Graph::EdgeItr> SolverEdges;
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
120 HeuristicSolverImpl(Graph &g) : g(g), h(*this) {}
125 Graph& getGraph() { return g; }
130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) {
137 HeuristicEdgeData& getHeuristicEdgeData(Graph
[all...]
H A DGraph.h1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
25 /// PBQP Graph class.
27 class Graph { class in namespace:PBQP
139 inline void copyFrom(const Graph &other);
143 Graph() : numNodes(0), numEdges(0) {} function in class:PBQP::Graph
148 Graph(const Graph &other) : numNodes(0), numEdges(0) { function in class:PBQP::Graph
159 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...]
H A Dgrph.h23 class Graph class
26 Graph (const char *name) function in class:Graph
36 ~Graph()
/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/webkit/Source/JavaScriptCore/dfg/
H A DDFGByteCodeParser.h40 // Populate the Graph with a basic block of code from the CodeBlock,
42 bool parse(Graph&, JSGlobalData*, CodeBlock*);
H A DDFGScoreBoard.h45 ScoreBoard(Graph& graph, uint32_t firstTemporary)
114 Graph& m_graph;
H A DDFGGraph.cpp44 void Graph::dump(NodeIndex nodeIndex, CodeBlock* codeBlock)
125 void Graph::dump(CodeBlock* codeBlock)
138 void Graph::refChildren(NodeIndex op)
158 void Graph::derefChildren(NodeIndex op)
H A DDFGAliasTracker.h45 AliasTracker(Graph& graph)
113 Graph& m_graph;
H A DDFGGraph.h62 // === Graph ===
67 class Graph : public Vector<Node, 64> { class in namespace:JSC::DFG
/external/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h30 Analysis *Graph; local
32 Graph = &getAnalysis<Analysis>();
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
35 ViewGraph(Graph, Name, Simple, Title);
57 Analysis *Graph; local
63 Graph = &getAnalysis<Analysis>();
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
70 WriteGraph(File, Graph, Simple, Title);
H A DCFGPrinter.h76 const Function *Graph) {
78 return getSimpleNodeLabel(Node, Graph);
80 return getCompleteNodeLabel(Node, Graph);
75 getNodeLabel(const BasicBlock *Node, const Function *Graph) argument
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
78 Graph *g;
81 typedef std::list<Graph::NodeItr> RNAllocableList;
84 typedef std::list<Graph::NodeItr> RNUnallocableList;
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) {
137 void addToHeuristicReduceList(Graph::NodeItr nItr) {
163 Graph
[all...]
/external/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h21 #include "llvm/CodeGen/PBQP/Graph.h"
43 PBQP::Graph& getGraph() { return graph; }
45 const PBQP::Graph& getGraph() const { return graph; }
54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
66 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
94 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node;
99 PBQP::Graph graph;
/external/llvm/lib/CodeGen/
H A DScheduleDAGPrinter.cpp46 const ScheduleDAG *Graph) {
54 const ScheduleDAG *Graph) {
63 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
65 const ScheduleDAG *Graph) {
96 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
45 hasNodeAddressLabel(const SUnit *Node, const ScheduleDAG *Graph) argument
52 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument
64 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
H A DRegAllocPBQP.cpp50 #include "llvm/CodeGen/PBQP/Graph.h"
123 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
164 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::ConstNodeItr node) const {
170 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
204 PBQP::Graph &g = p->getGraph();
308 PBQP::Graph::NodeItr node =
334 PBQP::Graph::EdgeItr edge =
379 PBQP::Graph &g = p->getGraph();
426 PBQP::Graph::NodeItr node = p->getNodeForVReg(src);
432 PBQP::Graph
[all...]
/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/clang/lib/AST/
H A DStmtViz.cpp35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { argument
/external/llvm/include/llvm/Support/
H A DDataFlow.h65 return G.Graph;
86 return G.Graph;
/external/opencv/cvaux/src/
H A Dcvlcm.cpp54 CvGraph* Graph; member in struct:CvLCM
303 LCM.Graph = cvCreateGraph(CV_SEQ_KIND_GRAPH|CV_GRAPH_FLAG_ORIENTED,
309 cvReleaseLinearContorModelStorage(&LCM.Graph);
313 return LCM.Graph;
316 CV_IMPL int cvReleaseLinearContorModelStorage(CvGraph** Graph) argument
325 if(!Graph || !(*Graph))
328 LCMNodeSeq = (CvSeq*)(*Graph);
329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges;
342 if((*Graph)
[all...]
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp84 const SelectionDAG *Graph) {
92 const SelectionDAG *Graph) {
112 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
114 const SelectionDAG *Graph) {
116 const std::string &Attrs = Graph->getGraphAttrs(N);
83 hasNodeAddressLabel(const SDNode *Node, const SelectionDAG *Graph) argument
91 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument
113 getNodeAttributes(const SDNode *N, const SelectionDAG *Graph) argument
/external/llvm/tools/opt/
H A DGraphPrinters.cpp48 // Call Graph Printer
58 return "Call Graph";
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument
91 "Print Call Graph to 'dot' file");

Completed in 235 milliseconds

12