OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:DominatorTree
(Results
1 - 4
of
4
) sorted by null
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
38
class
DominatorTree
: public ManagedAnalysis {
43
DominatorTree
() {
47
~
DominatorTree
() {
69
inline bool compare(
DominatorTree
&Other) const {
167
///
DominatorTree
GraphTraits specialization so the
DominatorTree
can be
196
template <> struct GraphTraits< ::clang::
DominatorTree
* >
198
static NodeType *getEntryNode(::clang::
DominatorTree
*DT) {
202
static nodes_iterator nodes_begin(::clang::
DominatorTree
*N) {
206
static nodes_iterator nodes_end(::clang::
DominatorTree
*N)
[
all
...]
/external/llvm/include/llvm/IR/
Dominators.h
10
// This file defines the
DominatorTree
class, which provides fast and efficient
66
class
DominatorTree
: public DominatorTreeBase<BasicBlock> {
70
DominatorTree
() : DominatorTreeBase<BasicBlock>(false) {}
74
inline bool compare(const
DominatorTree
&Other) const {
114
//
DominatorTree
GraphTraits specializations so the
DominatorTree
can be
142
template <> struct GraphTraits<
DominatorTree
*>
144
static NodeType *getEntryNode(
DominatorTree
*DT) {
148
static nodes_iterator nodes_begin(
DominatorTree
*N) {
152
static nodes_iterator nodes_end(
DominatorTree
*N)
[
all
...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_ssa.cpp
30
//
DominatorTree
implements an algorithm for finding immediate dominators,
32
class
DominatorTree
: public Graph
35
DominatorTree
(Graph *cfg);
36
~
DominatorTree
() { }
65
void
DominatorTree
::debugPrint()
76
DominatorTree
::
DominatorTree
(Graph *cfgraph) : cfg(cfgraph),
97
void
DominatorTree
::buildDFS(Graph::Node *node)
109
void
DominatorTree
::squash(int v)
120
int
DominatorTree
::eval(int v
[
all
...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_ssa.cpp
30
//
DominatorTree
implements an algorithm for finding immediate dominators,
32
class
DominatorTree
: public Graph
35
DominatorTree
(Graph *cfg);
36
~
DominatorTree
() { }
65
void
DominatorTree
::debugPrint()
76
DominatorTree
::
DominatorTree
(Graph *cfgraph) : cfg(cfgraph),
97
void
DominatorTree
::buildDFS(Graph::Node *node)
109
void
DominatorTree
::squash(int v)
120
int
DominatorTree
::eval(int v
[
all
...]
Completed in 123 milliseconds