HomeSort by relevance Sort by last modified time
    Searched defs:isReachableFromEntry (Results 26 - 48 of 48) sorted by null

12

  /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Analysis/Analyses/
Dominators.h 142 bool isReachableFromEntry(const CFGBlock *A) {
143 return DT->isReachableFromEntry(A);
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/
MachineDominators.h 218 /// isReachableFromEntry - Return true if A is dominated by the entry
220 bool isReachableFromEntry(const MachineBasicBlock *A) {
222 return DT->isReachableFromEntry(A);
  /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Analysis/Analyses/
Dominators.h 142 bool isReachableFromEntry(const CFGBlock *A) {
143 return DT->isReachableFromEntry(A);
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
MachineDominators.h 218 /// isReachableFromEntry - Return true if A is dominated by the entry
220 bool isReachableFromEntry(const MachineBasicBlock *A) {
222 return DT->isReachableFromEntry(A);
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Analysis/Analyses/
Dominators.h 142 bool isReachableFromEntry(const CFGBlock *A) {
143 return DT->isReachableFromEntry(A);
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/
MachineDominators.h 218 /// isReachableFromEntry - Return true if A is dominated by the entry
220 bool isReachableFromEntry(const MachineBasicBlock *A) {
222 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 210 /// isReachableFromEntry - Return true if A is dominated by the entry
212 bool isReachableFromEntry(const MachineBasicBlock *A) {
214 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/Support/
GenericDomTree.h 194 assert(isReachableFromEntry(B));
195 assert(isReachableFromEntry(A));
278 DT.isReachableFromEntry(ND)) {
289 if (DT.isReachableFromEntry(PredBlocks[i])) {
301 if (DT.isReachableFromEntry(PredBlocks[i]))
425 /// isReachableFromEntry - Return true if A is dominated by the entry
427 bool isReachableFromEntry(const NodeT *A) const {
430 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
433 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
445 if (!isReachableFromEntry(B)
    [all...]
  /prebuilts/clang/host/darwin-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...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/
GenericDomTree.h 220 assert(isReachableFromEntry(B));
221 assert(isReachableFromEntry(A));
297 isReachableFromEntry(Pred)) {
308 if (isReachableFromEntry(PredBlocks[i])) {
320 if (isReachableFromEntry(PredBlocks[i]))
448 /// isReachableFromEntry - Return true if A is dominated by the entry
450 bool isReachableFromEntry(const NodeT *A) const {
453 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
456 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
468 if (!isReachableFromEntry(B)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
GenericDomTree.h 220 assert(isReachableFromEntry(B));
221 assert(isReachableFromEntry(A));
297 isReachableFromEntry(Pred)) {
308 if (isReachableFromEntry(PredBlocks[i])) {
320 if (isReachableFromEntry(PredBlocks[i]))
448 /// isReachableFromEntry - Return true if A is dominated by the entry
450 bool isReachableFromEntry(const NodeT *A) const {
453 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
456 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
468 if (!isReachableFromEntry(B)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(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...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
GenericDomTree.h 220 assert(isReachableFromEntry(B));
221 assert(isReachableFromEntry(A));
297 isReachableFromEntry(Pred)) {
308 if (isReachableFromEntry(PredBlocks[i])) {
320 if (isReachableFromEntry(PredBlocks[i]))
448 /// isReachableFromEntry - Return true if A is dominated by the entry
450 bool isReachableFromEntry(const NodeT *A) const {
453 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
456 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
468 if (!isReachableFromEntry(B)
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
GenericDomTree.h 220 assert(isReachableFromEntry(B));
221 assert(isReachableFromEntry(A));
297 isReachableFromEntry(Pred)) {
308 if (isReachableFromEntry(PredBlocks[i])) {
320 if (isReachableFromEntry(PredBlocks[i]))
448 /// isReachableFromEntry - Return true if A is dominated by the entry
450 bool isReachableFromEntry(const NodeT *A) const {
453 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
456 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
468 if (!isReachableFromEntry(B)
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(isReachableFromEntry(B))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 396 /// isReachableFromEntry - Return true if A is dominated by the entry
398 bool isReachableFromEntry(const NodeT *A) const {
401 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
404 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
416 if (!isReachableFromEntry(B))
420 if (!isReachableFromEntry(A))
788 isReachableFromEntry(Pred)) {
799 if (isReachableFromEntry(PredBlocks[i])) {
810 if (isReachableFromEntry(PredBlocks[i]))
829 assert(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 575 milliseconds

12