| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 34 template<class BlockT, class LoopT>
35 void LoopBase<BlockT, LoopT>::
36 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
37 typedef GraphTraits<BlockT*> BlockTraits;
51 template<class BlockT, class LoopT>
52 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
53 SmallVector<BlockT*, 8> ExitingBlocks;
63 template<class BlockT, class LoopT>
64 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N,
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) {
50 template <class BlockT>
[all...] |
| LoopInfoImpl.h | 33 template<class BlockT, class LoopT>
34 void LoopBase<BlockT, LoopT>::
35 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const {
36 typedef GraphTraits<BlockT*> BlockTraits;
50 template<class BlockT, class LoopT>
51 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const {
52 SmallVector<BlockT*, 8> ExitingBlocks;
62 template<class BlockT, class LoopT>
63 void LoopBase<BlockT, LoopT>:
[all...] |
| DominanceFrontier.h | 32 template <class BlockT>
35 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
36 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
39 typedef GraphTraits<BlockT *> BlockTraits;
42 std::vector<BlockT *> Roots;
52 inline const std::vector<BlockT *> &getRoots() const {
56 BlockT *getRoot() const {
78 iterator find(BlockT *B) { return Frontiers.find(B); }
79 const_iterator find(BlockT *B) const { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 41 template<class BlockT, class FunctionT, class BlockProbInfoT>
44 DenseMap<BlockT *, BlockFrequency> Freqs;
50 typedef GraphTraits< Inverse<BlockT *> > GT;
68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) {
75 BlockFrequency getEdgeFreq(BlockT *Src, BlockT *Dst) const {
82 void incBlockFreq(BlockT *BB, BlockFrequency Freq) {
90 void divBlockFreq(BlockT *BB, BranchProbability Prob) {
106 std::vector<BlockT *> POT;
109 DenseMap<BlockT *, unsigned> RPO
[all...] |
