| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 47 #include "llvm/CodeGen/PBQP/Graph.h"
119 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
163 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::ConstNodeItr node) const {
169 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
203 PBQP::Graph &g = p->getGraph();
273 PBQP::Graph::NodeItr node =
299 PBQP::Graph::EdgeItr edge =
344 PBQP::Graph &g = p->getGraph();
391 PBQP::Graph::NodeItr node = p->getNodeForVReg(src);
397 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst)
[all...] |
| MachineFunction.cpp | 342 const MachineFunction *Graph) {
|
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGJITCompiler.h | 101 // DFG::JITCompiler is responsible for generating JIT code from the dataflow graph.
109 JITCompiler(JSGlobalData* globalData, Graph& dfg, CodeBlock* codeBlock)
119 Graph& graph() { return m_graph; }
253 return graph()[nodeIndex].isConstant();
257 return graph()[nodeIndex].op == Int32Constant;
261 return graph()[nodeIndex].op == DoubleConstant;
265 return graph()[nodeIndex].op == JSConstant;
272 return graph()[nodeIndex].int32Constant();
277 return graph()[nodeIndex].numericConstant()
[all...] |
| DFGByteCodeParser.cpp | 46 // This class is used to compile the dataflow graph from a CodeBlock.
49 ByteCodeParser(JSGlobalData* globalData, CodeBlock* codeBlock, Graph& graph)
52 , m_graph(graph)
190 // Avoid wastefully adding a JSConstant node to the graph, only to
202 // Avoid wastefully adding a JSConstant node to the graph, only to
430 // These methods create a node and add it to the graph. If nodes of this type are
462 Graph& m_graph;
480 // node in the graph, depending on the context in which it is being used.
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 130 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/srec/tools/grxmlcompile/ |
| grxmldoc.h | 35 class Graph;
84 // Take DOM object and create word graph. Creates SubGraph, rule, tag and label lists.
130 Graph *m_pGraph; // The top-level container object for the word graph;
141 // We store indices for all labels used in the word graph.
|
| grxmldoc.cpp | 27 #include "grph.h" // The word graph object and interface
28 #include "sub_grph.h" // The sub-graph object and interface
123 // Create the container for the word graph.
127 m_pGraph = new Graph("XML grammar");
439 // Create a Word Graph node for each rule node
636 // We can now treat a forward-referenced graph as if it was defined.
715 // not in subgraph but in graph?!
716 //graph.BeginCount(n);
1141 printf ("\nCreating semantic graph file\n");
[all...] |
| /external/llvm/lib/Analysis/ |
| DomPrinter.cpp | 12 // program, with a graph of the dominance/postdominance tree of that
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
|
| RegionPrinter.cpp | 41 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
65 return "Region Graph";
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 264 /// this can make the graph smaller.
426 // machine function as a graph of machine basic blocks... these are
436 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
447 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
459 // graph of basic blocks... and to walk it in inverse order. Inverse order for
466 return &G.Graph->front();
472 return &G.Graph->front();
|
| MachineBasicBlock.h | 466 // MachineFunction as a graph of MachineBasicBlocks...
496 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
505 return G.Graph;
519 return G.Graph;
|
| ScheduleDAG.h | 40 template<class Graph> class GraphWriter;
236 // Preds/Succs - The SUnits before/after us in the graph.
551 /// to form the scheduling dependency graph.
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| Executable.cpp | 207 DFG::Graph dfg;
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | 789 { return G.Graph; }
|
| /external/opencv/cvaux/include/ |
| cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder
314 int N; //graph size
342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse,
347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/
353 // Purpose: finds weight of subgraph in a graph
356 // graph - input graph.
364 // weight_vtx - optional vector of floats, with size = graph->total.
368 // that vertices of graph are inherited from CvGraphWeightedVtx.
369 // weight_edge - optional matrix of floats, of width and height = graph->total
[all...] |
| /external/clang/lib/Analysis/ |
| CFG.cpp | 204 /// build process. It consists of CFGBlock that specifies position in CFG graph
205 /// and LocalScope::const_iterator that specifies position in LocalScope graph.
[all...] |
| /external/v8/test/cctest/ |
| test-regexp.cc | [all...] |
