OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:isReachableFromEntry
(Results
26 - 30
of
30
) sorted by null
1
2
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h
220
assert(
isReachableFromEntry
(B));
221
assert(
isReachableFromEntry
(A));
304
DT.
isReachableFromEntry
(ND)) {
315
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
327
if (DT.
isReachableFromEntry
(PredBlocks[i]))
455
///
isReachableFromEntry
- Return true if A is dominated by the entry
457
bool
isReachableFromEntry
(const NodeT *A) const {
460
return
isReachableFromEntry
(getNode(const_cast<NodeT *>(A)));
463
bool
isReachableFromEntry
(const DomTreeNodeBase<NodeT> *A) const { return A; }
475
if (!
isReachableFromEntry
(B)
[
all
...]
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h
220
assert(
isReachableFromEntry
(B));
221
assert(
isReachableFromEntry
(A));
304
DT.
isReachableFromEntry
(ND)) {
315
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
327
if (DT.
isReachableFromEntry
(PredBlocks[i]))
455
///
isReachableFromEntry
- Return true if A is dominated by the entry
457
bool
isReachableFromEntry
(const NodeT *A) const {
460
return
isReachableFromEntry
(getNode(const_cast<NodeT *>(A)));
463
bool
isReachableFromEntry
(const DomTreeNodeBase<NodeT> *A) const { return A; }
475
if (!
isReachableFromEntry
(B)
[
all
...]
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h
220
assert(
isReachableFromEntry
(B));
221
assert(
isReachableFromEntry
(A));
304
DT.
isReachableFromEntry
(ND)) {
315
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
327
if (DT.
isReachableFromEntry
(PredBlocks[i]))
455
///
isReachableFromEntry
- Return true if A is dominated by the entry
457
bool
isReachableFromEntry
(const NodeT *A) const {
460
return
isReachableFromEntry
(getNode(const_cast<NodeT *>(A)));
463
bool
isReachableFromEntry
(const DomTreeNodeBase<NodeT> *A) const { return A; }
475
if (!
isReachableFromEntry
(B)
[
all
...]
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h
220
assert(
isReachableFromEntry
(B));
221
assert(
isReachableFromEntry
(A));
304
DT.
isReachableFromEntry
(ND)) {
315
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
327
if (DT.
isReachableFromEntry
(PredBlocks[i]))
455
///
isReachableFromEntry
- Return true if A is dominated by the entry
457
bool
isReachableFromEntry
(const NodeT *A) const {
460
return
isReachableFromEntry
(getNode(const_cast<NodeT *>(A)));
463
bool
isReachableFromEntry
(const DomTreeNodeBase<NodeT> *A) const { return A; }
475
if (!
isReachableFromEntry
(B)
[
all
...]
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
Dominators.h
249
DT.
isReachableFromEntry
(ND)) {
260
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
272
if (DT.
isReachableFromEntry
(PredBlocks[i]))
368
///
isReachableFromEntry
- Return true if A is dominated by the entry
370
bool
isReachableFromEntry
(const NodeT* A) {
817
bool
isReachableFromEntry
(const BasicBlock* A) {
818
return DT->
isReachableFromEntry
(A);
Completed in 958 milliseconds
1
2