| /external/clang/test/SemaOpenCL/ |
| cl20-device-side-enqueue.cl | 33 enqueue_kernel(default_queue, flags, ndrange, ^(int i) { // expected-error{{blocks in this form of device side enqueue call are expected to have have no parameters}}
87 enqueue_kernel(default_queue, flags, ndrange, block_B, 1024, 1024); // expected-error{{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
144 size = get_kernel_work_group_size(^(local int *a) { // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
147 size = get_kernel_work_group_size(block_B); // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
148 size = get_kernel_work_group_size(block_D); // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
149 size = get_kernel_work_group_size(^(int a) { // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
161 size = get_kernel_preferred_work_group_size_multiple(^(local int *a) { // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
164 size = get_kernel_preferred_work_group_size_multiple(^(int a) { // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
167 size = get_kernel_preferred_work_group_size_multiple(block_B); // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}}
168 size = get_kernel_preferred_work_group_size_multiple(block_D); // expected-error {{blocks used in device side enqueue are expected to have parameters of type 'local void*'}
[all...] |
| /external/e2fsprogs/tests/r_32to64bit_move_itable/ |
| expect | 2 Creating filesystem with 786432 1k blocks and 98304 inodes
3 Superblock backups stored on blocks:
8 Creating journal (16384 blocks): done
9 Creating 727 huge file(s) with 1024 blocks each: done
12 Pass 1: Checking inodes, blocks, and sizes
21 The filesystem on test.img is now 786432 (1k) blocks long.
38 -Free blocks: 764
39 +Free blocks: 734
45 Blocks per group: 8192
101 Pass 1: Checking inodes, blocks, and size
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/val/ |
| Function.h | 125 /// Returns a vector of all the blocks in the function
128 /// Returns a vector of all the blocks in the function
137 /// Returns the number of blocks in the current function being parsed
143 /// Returns the number of blocks in the current function being parsed
209 /// The blocks in the function mapped by block ID
212 /// A list of blocks in the order they appeared in the binary
215 /// Blocks which are forward referenced by blocks but not defined
224 /// of all ordinary blocks without predecessors. It has no predecessors.
233 /// of all ordinary blocks without successors. It has no successors
[all...] |
| /external/e2fsprogs/e2fsck/ |
| e2fsck.8.in | 143 blocks. If any bad blocks are found, they are added to the bad block
202 Set the version of the extended attribute blocks which
212 During pass 1, print a detailed report of any discontiguous blocks for
216 Attempt to discard free blocks and unused inode blocks after the full
217 filesystem check (discarding blocks is useful on solid state devices and sparse
226 Do not attempt to discard free blocks and unused inode blocks. This option is
261 option, any existing bad blocks in the bad blocks list are preserved
[all...] |
| /external/e2fsprogs/ext2ed/doc/ |
| ext2fs-overview.sgml | 192 <Title>About blocks and block groups</Title>
196 into small units called <Literal remap="tt">blocks</Literal>. A block is the smallest unit which
214 Ext2fs groups together a fixed number of sequential blocks into a <Literal remap="tt">group
216 series of group blocks. This is done in order to keep related information
218 much of the filesystem management reduces to management of a single blocks
225 <Title>The view of inodes from the point of view of a blocks group</Title>
230 much like a <Literal remap="tt">block</Literal> - Each blocks group contains a limited number of
241 Each blocks group is accompanied by a <Literal remap="tt">group descriptor</Literal>. The group
252 __u32 bg_block_bitmap; /* Blocks bitmap block */
255 __u16 bg_free_blocks_count; /* Free blocks count *
[all...] |
| /build/make/tools/releasetools/ |
| ota_package_parser.py | 25 """Build a map to track stashed blocks during update simulation."""
34 def StashBlocks(self, SHA1, blocks):
36 logging.info("already stashed {}: {}".format(SHA1, blocks))
38 self.blocks_stashed += blocks.size()
39 self.current_stash_size += blocks.size()
41 self.stash_map[SHA1] = blocks
48 def HandleOverlapBlocks(self, SHA1, blocks):
49 self.StashBlocks(SHA1, blocks)
50 self.overlap_blocks_stashed += blocks.size()
135 logging.info("blocks written: {} (expected: {})".format
[all...] |
| /external/autotest/client/tests/disktest/src/ |
| disktest.c | 39 unsigned int blocks; variable
120 block, start_block, start_block+blocks,
126 block, start_block, start_block+blocks,
155 block = start_block + (unsigned int)(random() % blocks);
160 for (block = start_block; block < start_block + blocks; block++)
199 block = start_block + (unsigned int)(random() % blocks);
206 for (block = start_block; block < start_block + blocks; block++)
234 for (block = start_block; block < start_block + blocks; block++) {
293 blocks = megabytes * (1024 * 1024 / blocksize);
309 blocks = megabytes * (1024 * 1024 / blocksize)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // Blocks - The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
90 /// blocks, where depth 0 is used for blocks not inside any loops.
98 BlockT *getHeader() const { return Blocks.front(); }
131 /// getBlocks - Get a list of the basic blocks which make up this loop.
133 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
[all...] |
| /external/valgrind/memcheck/tests/ |
| leak-autofreepool.c | 14 // - Uses ITSELF to get large blocks to populate the pool (so these are marked
15 // as MALLOCLIKE blocks)
16 // - Then passes out MALLOCLIKE blocks out of these pool blocks
18 // because it spotted these (correctly) as overlapping blocks (test case 3
22 // Also, when one of these metapool blocks is freed, memcheck will not auto-free
23 // the MALLOCLIKE blocks allocated from the meta-pool, and report them as leaks.
141 // Without explicit free, these MALLOCLIKE_BLOCK blocks are considered
148 // Same as before, but now the MALLOCLIKE blocks are auto-freed.
165 // No auto-free, no cleanup. Leaves overlapping blocks detecte
[all...] |
| /system/extras/ext4_utils/ |
| allocate.c | 119 printf("%p: Blocks %d-%d (%d)\n", reg,
198 /* Marks a the first num_blocks blocks in a block group as used, and accounts
255 /* Reduces an existing allocation by len blocks by return the last blocks
256 to the free pool in their block group. Assumes that the blocks being
318 error("failed to reserve %u blocks in block group %u\n", bg->header_blocks, i);
409 error("failed to allocate %u blocks, out of space?", len);
420 error("failed to reserve %u blocks in block group %u\n", found_allocate_len, found_bg);
459 /* Allocate len blocks. The blocks may be spread across multiple block groups
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| CodePlacementOpt.cpp | 105 // Aggressively handle return blocks and similar constructs.
114 // Ignore blocks which look like they might have EH-related control flow.
117 // Such blocks contain EH_LABEL instructions, however they may be in the
149 /// EliminateUnconditionalJumpsToTop - Move blocks which unconditionally jump
181 DEBUG(dbgs() << "CGP: Moving blocks starting at BB#" << Pred->getNumber()
185 // Move it and all the blocks that can reach it via fallthrough edges
207 // Otherwise we can stop scanning and procede to move the blocks.
220 // Move the blocks.
244 /// MoveDiscontiguousLoopBlocks - Move any loop blocks that are not in the
255 // Determine a position to move orphaned loop blocks to. If TopMBB is no
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| ext2_fs.h | 32 * Define EXT2_RESERVATION to reserve data blocks for expanding files
35 /*max window size: 1024(direct blocks) + 3([t,d]indirect blocks) */
60 #define EXT2_BAD_INO 1 /* Bad blocks inode */
104 * Structure of a blocks group descriptor
108 __le32 bg_block_bitmap; /* Blocks bitmap block */
111 __le16 bg_free_blocks_count; /* Free blocks count */
126 * Constants relative to the data blocks
218 __le32 i_blocks; /* Blocks count */
231 __le32 i_block[EXT2_N_BLOCKS];/* Pointers to blocks */
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| ext2_fs.h | 33 * Define EXT2_RESERVATION to reserve data blocks for expanding files
36 /*max window size: 1024(direct blocks) + 3([t,d]indirect blocks) */
61 #define EXT2_BAD_INO 1 /* Bad blocks inode */
105 * Structure of a blocks group descriptor
109 __le32 bg_block_bitmap; /* Blocks bitmap block */
112 __le16 bg_free_blocks_count; /* Free blocks count */
127 * Constants relative to the data blocks
219 __le32 i_blocks; /* Blocks count */
232 __le32 i_block[EXT2_N_BLOCKS];/* Pointers to blocks */
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks(); local
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks(); local
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| LocalVariableExtractor.java | 39 private final ArrayList<SsaBasicBlock> blocks; field in class:LocalVariableExtractor
44 /** {@code non-null;} work set indicating blocks needing to be processed */
68 ArrayList<SsaBasicBlock> blocks = method.getBlocks(); local
71 this.blocks = blocks;
73 this.workSet = new BitSet(blocks.size());
105 SsaBasicBlock block = blocks.get(blockIndex);
|
| /device/generic/goldfish/camera/ |
| media_codecs_google_video.xml | 24 <Limit name="blocks-per-second" range="12-11880" />
41 <Limit name="blocks-per-second" range="1-244800" />
51 <Limit name="blocks-per-second" range="1-2000000" />
59 <Limit name="blocks-per-second" range="1-1000000" />
67 <Limit name="blocks-per-second" range="1-500000" />
85 <Limit name="blocks-per-second" range="1-244800" />
95 <Limit name="blocks-per-second" range="12-1485" />
|
