HomeSort by relevance Sort by last modified time
    Searched defs:exit (Results 251 - 275 of 937) sorted by null

<<11121314151617181920>>

  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/
RegionInfo.h 10 // Calculate a program structure tree built out of single entry single exit
187 /// @brief A single entry single exit Region.
198 /// BasicBlocks that merge several entry or exit edges so that after the merge
199 /// just one entry and one exit edge exists.
205 /// The \e Exit of a Region is the first BasicBlock that is passed after
206 /// leaving the Region. It is not an element of the Region. The exit BasicBlock,
273 // The exit BasicBlock of this region.
275 BlockT *exit; member in class:llvm::RegionBase
303 /// @param Exit The exit basic block of the region
    [all...]
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
34 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
37 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
53 assert(exit && "No exit to replace!");
54 exit = BB;
100 BlockT *entry = getEntry(), *exit = getExit();
103 if (!exit)
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
172 BlockT *exit = getExit(); local
226 BlockT *entry = getEntry(), *exit = getExit(); local
247 BlockT *exit = getExit(); local
664 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit,
47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
63 assert(exit && "No exit to replace!");
64 exit = BB;
110 BlockT *entry = getEntry(), *exit = getExit();
113 if (!exit)
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)))
205 BlockT *exit = getExit(); local
259 BlockT *entry = getEntry(), *exit = getExit(); local
280 BlockT *exit = getExit(); local
699 BlockT *exit = N->getBlock(); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
tree-flow.h 328 basic_block exit; member in struct:omp_region
403 extern void gather_blocks_in_sese_region (basic_block entry, basic_block exit,
590 the loop will exit in the first iteration (i.e.
600 /* The simplified shape of the exit condition. The loop exits if
  /prebuilts/go/darwin-x86/src/runtime/
os3_solaris.go 16 //go:cgo_import_dynamic libc_exit exit "libc.so"
390 func exit(r int32) { func
  /prebuilts/go/linux-x86/src/runtime/
os3_solaris.go 16 //go:cgo_import_dynamic libc_exit exit "libc.so"
390 func exit(r int32) { func
  /frameworks/base/services/net/java/android/net/dhcp/
DhcpClient.java 522 public void exit() { method in class:DhcpClient.LoggingState
627 public void exit() { method in class:DhcpClient.DhcpState
714 public void exit() { method in class:DhcpClient.PacketRetransmittingState
715 super.exit();
836 public void exit() { method in class:DhcpClient.DhcpHaveLeaseState
891 public void exit() { method in class:DhcpClient.DhcpBoundState
    [all...]
  /frameworks/rs/tests/java_api/ImageProcessing2/src/com/android/rs/image/
ImageProcessingActivity2.java 430 // We may have been asked to exit while waiting
531 public void exit() { method in class:ImageProcessingActivity2.Processor
696 mProcessor.exit();

Completed in 1334 milliseconds

<<11121314151617181920>>