| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 25 /// <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
33 /// edge into the PBQP graph (by R2).
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
49 /// node/edge in the PBQP graph.
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g
[all...] |
| Solution.h | 18 #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 {
|
| HeuristicSolver.h | 19 #include "Graph.h"
29 /// to HeuristicSolver<HImpl>::solve(Graph&).
33 /// backpropagation phase, and maintains the internal copy of the graph on
43 typedef std::list<Graph::EdgeItr> SolverEdges;
47 /// \brief Iterator type for edges in the solver graph.
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
118 /// graph.
119 /// @param g The graph representing the problem instance to be solved
[all...] |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
25 /// PBQP Graph class.
27 class Graph {
139 inline void copyFrom(const Graph &other);
142 /// \brief Construct an empty PBQP graph.
143 Graph() : numNodes(0), numEdges(0) {}
145 /// \brief Copy construct this graph from "other". Note: Does not copy node
146 /// and edge data, only graph structure and costs
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 30 Analysis *Graph;
32 Graph = &getAnalysis<Analysis>();
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
35 ViewGraph(Graph, Name, Simple, Title);
57 Analysis *Graph;
63 Graph = &getAnalysis<Analysis>();
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
70 WriteGraph(File, Graph, Simple, Title);
|
| CFGPrinter.h | 36 const Function *Graph) {
48 const Function *Graph) {
76 const Function *Graph) {
78 return getSimpleNodeLabel(Node, Graph);
80 return getCompleteNodeLabel(Node, Graph);
|
| /external/llvm/include/llvm/Support/ |
| DOTGraphTraits.h | 12 // this file will produce a simple, but not very polished graph. By
41 /// getGraphName - Return the label for the graph as a whole. Printed at the
42 /// top of the graph.
45 static std::string getGraphName(const GraphType& Graph) { return ""; }
48 /// in the top level graph structure for dot.
51 static std::string getGraphProperties(const GraphType& Graph) {
55 /// renderGraphFromBottomUp - If this function returns true, the graph is
63 /// displayed in the graph.
68 /// getNodeLabel - Given a node and a pointer to the top level graph, return
71 std::string getNodeLabel(const void *Node, const GraphType& Graph) {
[all...] |
| DataFlow.h | 65 return G.Graph;
86 return G.Graph;
|
| CFG.h | 240 // graph of basic blocks...
270 // graph of basic blocks... and to walk it in inverse order. Inverse order for
277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
290 return G.Graph;
307 // graph of basic blocks... these are the same as the basic block iterators,
313 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
322 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
330 // graph of basic blocks... and to walk it in inverse order. Inverse order for
337 return &G.Graph->getEntryBlock();
343 return &G.Graph->getEntryBlock()
[all...] |
| /external/srec/tools/grxmlcompile/ |
| gr_iface.cpp | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
30 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
[all...] |
| grph.h | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
47 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
53 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGByteCodeParser.h | 40 // Populate the Graph with a basic block of code from the CodeBlock,
42 bool parse(Graph&, JSGlobalData*, CodeBlock*);
|
| DFGAliasTracker.h | 45 AliasTracker(Graph& graph)
46 : m_graph(graph)
112 // The graph, to look up potentially aliasing nodes.
113 Graph& m_graph;
|
| DFGScoreBoard.h | 38 // This class is used in performing a virtual register allocation over the graph.
45 ScoreBoard(Graph& graph, uint32_t firstTemporary)
46 : m_graph(graph)
113 // The graph, so we can get refCounts for nodes, to determine when values are dead.
114 Graph& m_graph;
|
| DFGGraph.cpp | 44 void Graph::dump(NodeIndex nodeIndex, CodeBlock* codeBlock)
68 // @# - a NodeIndex referencing a prior node in the graph.
125 void Graph::dump(CodeBlock* codeBlock)
138 void Graph::refChildren(NodeIndex op)
158 void Graph::derefChildren(NodeIndex op)
|
| DFGGraph.h | 62 // === Graph ===
64 // The dataflow graph is an ordered vector of nodes.
67 class Graph : public Vector<Node, 64> {
|
| /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
| Briggs.h | 11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
51 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;
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 21 #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; member in class:llvm::PBQPRAProblem
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) {
55 const ScheduleDAG *Graph) {
64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) {
90 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr() +
94 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr());
|
| /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!");
101 /// Nodes - The list of nodes for this graph
[all...] |
| /external/clang/lib/AST/ |
| StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) {
|
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 54 CvGraph* Graph;
163 // pLCM : in, information about graph
165 // Returns: pointer to graph node
196 // Purpose: Function create graph node
199 // pLCM : in, information about graph
200 // Returns: pointer to graph node
208 // Purpose: Function create graph edge
211 // pLCM : in, information about graph
212 // Returns: pointer to graph edge
223 // LCMNode : in, graph nod
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 86 const SelectionDAG *Graph) {
94 const SelectionDAG *Graph) {
114 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
116 const SelectionDAG *Graph) {
118 const std::string &Attrs = Graph->getGraphAttrs(N);
165 /// clearGraphAttrs - Clear all previously defined node graph attributes.
177 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
189 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
295 // Draw a special "GraphRoot" node to indicate the root of the graph.
|
| /external/llvm/tools/opt/ |
| GraphPrinters.cpp | 1 //===- GraphPrinters.cpp - DOT printers for various graph types -----------===//
11 // by the LLVM infrastructure. It uses the generic graph interface to convert
12 // the graph into a .dot graph. These graphs can then be processed with the
48 // Call Graph Printer
58 return "Call Graph";
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
91 "Print Call Graph to 'dot' file");
|
