| /external/e2fsprogs/lib/ext2fs/ |
| tst_getsize.c | 31 blk_t blocks; local
38 retval = ext2fs_get_device_size(argv[1], 1024, &blocks);
43 printf("%s is device has %u blocks.\n", argv[1], blocks);
|
| /external/llvm/test/CodeGen/SystemZ/Large/ |
| branch-range-02.py | 3 # RUN: python %s | llc -mtriple=s390x-linux-gnu -align-all-blocks=8 | FileCheck %s
19 # with N == 256 + 4. The -align-all-blocks=8 option ensures that all blocks
20 # are 256 bytes in size. The first 4 blocks and the last 4 blocks are then
39 # ...lots of other blocks...
59 blocks = 256 + 4 variable
67 for i in xrange(blocks):
70 next = 'b%d' % (i + 1) if i + 1 < blocks else 'end'
71 other = 'end' if 2 * i < blocks else 'b0
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.h | 30 * cost of being unable to explicitly free one of the allocated blocks.
41 struct memory_block * blocks; member in struct:memory_pool
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 83 const int blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; local
84 TestCode(data, blocks, 9);
108 const int blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; local
109 TestCode(data, blocks, 9);
135 const int blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; local
136 TestCode(data, blocks, 10);
165 const int blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; local
166 TestCode(data, blocks, 12);
195 const int blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; local
196 TestCode(data, blocks, 12)
221 const int blocks[] = {0, 1, 2, 3, 4, 6, 9, 8, 5, 7}; local
249 const int blocks[] = {0, 1, 2, 3, 4, 9, 8, 6, 5, 7}; local
[all...] |
| find_loops_test.cc | 131 const BitVector& blocks = info->GetBlocks(); local
132 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks);
134 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i]));
197 // incoming blocks and one back edge.
|
| /external/boringssl/src/crypto/modes/ |
| ctr.c | 181 size_t blocks = len / 16; local
185 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28)) {
186 blocks = (1U << 28);
191 * amount of blocks to the exact overflow point... */
192 ctr32 += (uint32_t)blocks;
193 if (ctr32 < blocks) {
194 blocks -= ctr32;
197 (*func)(in, out, blocks, key, ivec);
204 blocks *= 16;
205 len -= blocks;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| 2006-09-12-OpaqueStructCrash.cpp | 25 B<C<Ty> > blocks; member in struct:D
|
| /external/harfbuzz_ng/src/ |
| gen-arabic-table.py | 7 print >>sys.stderr, "usage: ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
17 blocks = {} variable
19 global blocks
40 blocks[u] = t
74 all_blocks = set([blocks[u] for u in uu])
97 block = blocks.get(u, last_block)
248 print " * ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
|
| /external/openssh/ |
| hash.c | 15 #define blocks crypto_hashblocks_sha512 macro
39 blocks(h,in,inlen);
58 blocks(h,padded,128);
70 blocks(h,padded,256);
|
| /external/pdfium/third_party/bigint/ |
| BigIntegerUtils.hh | 58 BigInteger::Blk *blocks = new BigInteger::Blk[numBlocks]; local
68 blocks[blockNum] = curBlock;
72 BigInteger x(blocks, numBlocks, sign);
74 delete [] blocks;
|
| /external/wpa_supplicant_8/src/crypto/ |
| aes-cbc.c | 29 int i, j, blocks; local
36 blocks = data_len / AES_BLOCK_SIZE;
37 for (i = 0; i < blocks; i++) {
62 int i, j, blocks; local
69 blocks = data_len / AES_BLOCK_SIZE;
70 for (i = 0; i < blocks; i++) {
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_dense_matrix_test.cc | 40 vector<int> blocks; local
41 blocks.push_back(3);
42 blocks.push_back(4);
43 blocks.push_back(5);
45 BlockRandomAccessDenseMatrix m(blocks);
50 for (int i = 0; i < blocks.size(); ++i) {
52 for (int j = 0; j < blocks.size(); ++j) {
65 col_idx += blocks[j];
67 row_idx += blocks[i];
72 vector<int> blocks; local
[all...] |
| block_random_access_diagonal_matrix_test.cc | 43 vector<int> blocks; local
44 blocks.push_back(3);
45 blocks.push_back(4);
46 blocks.push_back(5);
50 BlockRandomAccessDiagonalMatrix m(blocks);
54 for (int i = 0; i < blocks.size(); ++i) {
62 for (int j = 0; j < blocks.size(); ++j) {
76 EXPECT_EQ(row_stride, blocks[row_block_id]);
77 EXPECT_EQ(col_stride, blocks[col_block_id]);
81 row, col, blocks[row_block_id], blocks[col_block_id])
[all...] |
| /external/chromium-trace/trace-viewer/third_party/webapp2/tests/resources/jinja2_templates_compiled/ |
| tmpl_3a79873b1b49be244fd5444b1258ce348be26de8.py | 10 blocks = {} variable
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_dense_alloc_test.cc | 34 IndexT blocks[N]; local
38 blocks[i] = idx;
45 IndexT idx = blocks[i];
|
| /external/fio/crc/ |
| murmur3.c | 52 const uint32_t *blocks = (const uint32_t *)(data + nblocks * 4); local
56 uint32_t k1 = blocks[i];
|
| /external/v8/src/ |
| hydrogen-mark-unreachable.cc | 15 const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); local
18 for (int i = 0; i < blocks->length(); i++) {
19 HBasicBlock* block = blocks->at(i);
21 bool is_reachable = blocks->at(0) == block;
|
| /bionic/libc/kernel/uapi/linux/mmc/ |
| ioctl.h | 32 unsigned int blocks; member in struct:mmc_ioc_cmd
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /development/ndk/platforms/android-21/include/linux/mmc/ |
| ioctl.h | 32 unsigned int blocks; member in struct:mmc_ioc_cmd
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /external/kernel-headers/original/uapi/linux/mmc/ |
| ioctl.h | 18 unsigned int blocks; member in struct:mmc_ioc_cmd
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 78 /// checked for unique exit and exiting blocks, and that the code is in LCSSA
95 // Make sure all exiting blocks produce the same incoming value for the exit
97 // blocks, then it is impossible to statically determine which value should
207 // Update the dominator tree and remove the instructions and blocks that will
229 // Erase the instructions and the blocks without having to worry
237 // Finally, the blocks from loopinfo. This has to happen late because
240 SmallPtrSet<BasicBlock*, 8> blocks; local
241 blocks.insert(L->block_begin(), L->block_end());
242 for (BasicBlock *BB : blocks)
|
| /external/mesa3d/src/gallium/state_trackers/xvmc/tests/ |
| test_blocks.c | 45 XvMCBlockArray blocks = {0}; local
78 assert(XvMCCreateBlocks(display, NULL, 1, &blocks) == XvMCBadContext);
79 /* Test 0 blocks */
80 assert(XvMCCreateBlocks(display, &context, 0, &blocks) == BadValue);
82 assert(XvMCCreateBlocks(display, &context, min_required_blocks, &blocks) == Success);
84 assert(blocks.context_id == context.context_id);
85 /* Test number of blocks assigned and correct */
86 assert(blocks.num_blocks == min_required_blocks);
88 assert(blocks.blocks != NULL)
[all...] |
