| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 45 /// slow and we need to iterate over the blocks at least a few times.
53 unsigned NumPreds; // Number of predecessor blocks.
54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
100 /// through its predecessors until reaching blocks with known values.
101 /// Create BBInfo structures for the blocks and append them to the block
112 // when reaching blocks that define the value. Record those defining
113 // blocks on the RootList.
150 // Now that we know what blocks are backwards-reachable from the starting
152 // to those blocks.
199 /// finding dominators. Given two basic blocks, it walks up the dominato
[all...] |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| EdgeBundles.h | 34 /// Blocks - Map each bundle to a list of basic block numbers.
35 SmallVector<SmallVector<unsigned, 8>, 4> Blocks;
48 /// getBlocks - Return an array of blocks that are connected to Bundle.
49 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 45 /// slow and we need to iterate over the blocks at least a few times.
53 unsigned NumPreds; // Number of predecessor blocks.
54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
100 /// through its predecessors until reaching blocks with known values.
101 /// Create BBInfo structures for the blocks and append them to the block
112 // when reaching blocks that define the value. Record those defining
113 // blocks on the RootList.
150 // Now that we know what blocks are backwards-reachable from the starting
152 // to those blocks.
199 /// finding dominators. Given two basic blocks, it walks up the dominato
[all...] |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| EdgeBundles.h | 34 /// Blocks - Map each bundle to a list of basic block numbers.
35 SmallVector<SmallVector<unsigned, 8>, 4> Blocks;
48 /// getBlocks - Return an array of blocks that are connected to Bundle.
49 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 45 /// slow and we need to iterate over the blocks at least a few times.
53 unsigned NumPreds; // Number of predecessor blocks.
54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
100 /// through its predecessors until reaching blocks with known values.
101 /// Create BBInfo structures for the blocks and append them to the block
112 // when reaching blocks that define the value. Record those defining
113 // blocks on the RootList.
150 // Now that we know what blocks are backwards-reachable from the starting
152 // to those blocks.
199 /// finding dominators. Given two basic blocks, it walks up the dominato
[all...] |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| tar.h | 24 /* A tar archive consists of 512-byte blocks.
25 Each file in the archive has a header block followed by 0+ data blocks.
26 Two blocks of NUL bytes indicate the end of the archive. */
28 /* The fields of header blocks:
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/ |
| tar.h | 24 /* A tar archive consists of 512-byte blocks.
25 Each file in the archive has a header block followed by 0+ data blocks.
26 Two blocks of NUL bytes indicate the end of the archive. */
28 /* The fields of header blocks:
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| checkbce.go | 16 for _, b := range f.Blocks {
|
| /prebuilts/go/darwin-x86/src/cmd/vet/internal/cfg/ |
| cfg_test.go | 145 // Mark blocks reachable from entry.
156 visit(g.Blocks[0])
158 // Print statements in unreachable blocks
161 for _, b := range g.Blocks {
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| checkbce.go | 16 for _, b := range f.Blocks {
|
| /prebuilts/go/linux-x86/src/cmd/vet/internal/cfg/ |
| cfg_test.go | 145 // Mark blocks reachable from entry.
156 visit(g.Blocks[0])
158 // Print statements in unreachable blocks
161 for _, b := range g.Blocks {
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
| inst-po-3.d | 1 #name: .inst pseudo-opcode with automatic IT blocks test
|
| /external/f2fs-tools/fsck/ |
| f2fs.h | 65 unsigned short valid_blocks; /* # of valid blocks */
66 unsigned char *cur_valid_map; /* validity bitmap of blocks */
68 * # of valid blocks and the validity bitmap stored in the the last
80 unsigned int valid_blocks; /* # of valid blocks in a section */
86 block_t sit_blocks; /* # of blocks used by SIT area */
87 block_t written_valid_blocks; /* # of valid blocks in main area */
183 unsigned int log_blocks_per_seg; /* log2 blocks per segment */
184 unsigned int blocks_per_seg; /* blocks per segment */
193 block_t user_block_count; /* # of user blocks */
194 block_t total_valid_block_count; /* # of valid blocks */
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
134 /// all edges between the two blocks and return true. This updates all of the
150 /// the two blocks. It updates the analyses passed in the options struct
177 /// block. The two blocks are joined by an unconditional branch and the loop
204 /// blocks into the function. One of those new basic blocks gets the
207 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
232 /// SplitBefore is moved to a new block. The two blocks are connected by
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 13 // * Removes basic blocks with no predecessors.
16 // * Eliminates PHI nodes for basic blocks with a single predecessor.
52 STATISTIC(NumSimpl, "Number of blocks simplified");
54 /// If we have more than one empty (other than phi node) return blocks,
61 // Scan all the blocks in the function, looking for empty return blocks.
65 // Only look at return blocks.
95 // blocks.
119 // block. This handles the case when the two return blocks have a common
129 /// Call SimplifyCFG on all the blocks in the function
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/ir/optimize/ |
| PeepholeOptimizer.java | 40 * Identify common suffixes in predecessor blocks and share them.
43 Collection<BasicBlock> blocks = code.blocks; local
47 for (BasicBlock block : blocks) {
49 // Group interesting predecessor blocks by their last instruction.
96 // Go through all the newly introduced blocks to find more common suffixes to share.
97 blocks = newBlocks.values();
98 } while (!blocks.isEmpty());
158 // then start over. Restarting when one blocks predecessors have been rewritten simplifies
163 for (BasicBlock block : code.blocks) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
135 /// all edges between the two blocks and return true. This updates all of the
151 /// the two blocks. It updates the analyses passed in the options struct
178 /// block. The two blocks are joined by an unconditional branch and the loop
205 /// blocks into the function. One of those new basic blocks gets the
208 /// of the new basic blocks. The new blocks are given the suffixes 'Suffix1' and
233 /// in the BB are moved to a new block. The two blocks are connected by
[all...] |
| /external/libxml2/ |
| testapi.c | 122 int blocks, mem; local
157 blocks = xmlMemBlocks();
159 if ((blocks != 0) || (mem != 0)) {
160 printf("testapi leaked %d bytes in %d blocks\n", mem, blocks);
[all...] |
