OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:findNearestCommonDominator
(Results
1 - 7
of
7
) sorted by null
/external/llvm/include/llvm/CodeGen/
MachinePostDominators.h
75
MachineBasicBlock *
findNearestCommonDominator
(MachineBasicBlock *A,
77
return DT->
findNearestCommonDominator
(A, B);
MachineDominators.h
111
///
findNearestCommonDominator
- Find nearest common dominator basic block
113
inline MachineBasicBlock *
findNearestCommonDominator
(MachineBasicBlock *A,
115
return DT->
findNearestCommonDominator
(A, B);
/external/llvm/include/llvm/Analysis/
PostDominators.h
73
inline BasicBlock *
findNearestCommonDominator
(BasicBlock *A, BasicBlock *B) {
74
return DT->
findNearestCommonDominator
(A, B);
77
inline const BasicBlock *
findNearestCommonDominator
(const BasicBlock *A,
79
return DT->
findNearestCommonDominator
(A, B);
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
125
inline CFGBlock *
findNearestCommonDominator
(CFGBlock *A, CFGBlock *B) {
126
return DT->
findNearestCommonDominator
(A, B);
129
inline const CFGBlock *
findNearestCommonDominator
(const CFGBlock *A,
131
return DT->
findNearestCommonDominator
(A, B);
/external/llvm/include/llvm/Support/
GenericDomTree.h
279
NewBBIDom = DT.
findNearestCommonDominator
(NewBBIDom, PredBlocks[i]);
435
///
findNearestCommonDominator
- Find nearest common dominator basic block
437
NodeT *
findNearestCommonDominator
(NodeT *A, NodeT *B) {
496
const NodeT *
findNearestCommonDominator
(const NodeT *A, const NodeT *B) {
499
return
findNearestCommonDominator
(const_cast<NodeT *>(A),
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp
171
findNearestCommonDominator
(MachineBasicBlock *A, MachineBasicBlock *B) {
172
return DT->
findNearestCommonDominator
(A, B);
[
all
...]
/external/mesa3d/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp
171
findNearestCommonDominator
(MachineBasicBlock *A, MachineBasicBlock *B) {
172
return DT->
findNearestCommonDominator
(A, B);
[
all
...]
Completed in 234 milliseconds