| /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/chromium_org/third_party/mesa/src/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
|
| /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
|
| /external/qemu/android/base/memory/ |
| MallocUsableSize_unittest.cpp | 29 void* blocks[kCount]; local
31 blocks[n] = ::malloc(computeSize(n));
32 EXPECT_TRUE(blocks[n]);
37 EXPECT_LE(size, ::malloc_usable_size(blocks[n]))
42 ::free(blocks[n - 1U]);
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 80 const int blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; local
81 TestCode(data, blocks, 9);
105 const int blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; local
106 TestCode(data, blocks, 9);
132 const int blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; local
133 TestCode(data, blocks, 10);
162 const int blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; local
163 TestCode(data, blocks, 12);
192 const int blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; local
193 TestCode(data, blocks, 12)
[all...] |
| find_loops_test.cc | 126 const BitVector& blocks = info->GetBlocks(); local
127 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks);
129 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i]));
190 // incoming blocks and one back edge.
|
| /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/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_org/third_party/openssl/openssl/crypto/modes/ |
| ctr128.c | 210 size_t blocks = len/16; local
216 if (sizeof(size_t)>sizeof(unsigned int) && blocks>(1U<<28))
217 blocks = (1U<<28);
222 * amount of blocks to the exact overflow point...
224 ctr32 += (u32)blocks;
225 if (ctr32 < blocks) {
226 blocks -= ctr32;
229 (*func)(in,out,blocks,key,ivec);
234 blocks *= 16;
235 len -= blocks;
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkTObjectPool.h | 73 * Returns the number of blocks of items the pool has allocated so far.
75 int blocks() const { return fBlocks.getCount(); } function in class:SkTObjectPool
|
| /external/chromium_org/third_party/skia/tests/ |
| ObjectPoolTest.cpp | 24 int available, int blocks) {
30 if (blocks != pool.blocks()) {
31 ERRORF(reporter, "%s - Pool blocks is %d not %d",
32 stage, pool.blocks(), blocks);
45 int blocks = (index / kNumItemsPerBlock) + 1; local
46 int available = (blocks * kNumItemsPerBlock) - (index + 1);
47 if (!verifyPool(reporter, pool, "acquire", available, blocks)) {
52 int blocks = pool.blocks() local
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| Random.h | 74 uint32_t * blocks = reinterpret_cast<uint32_t*>(blob); local
78 blocks[0] = rand_u32();
79 blocks++;
83 uint8_t * tail = reinterpret_cast<uint8_t*>(blocks);
101 uint32_t * blocks = (uint32_t*)blob; local
105 *blocks++ = rand_u32();
109 uint8_t * tail = (uint8_t*)blocks;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| malloc_extension_c_test.c | 98 int blocks; local
106 MallocExtension_MallocMemoryStats(&blocks, &total, hist);
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| malloc_extension_c_test.c | 98 int blocks; local
106 MallocExtension_MallocMemoryStats(&blocks, &total, hist);
|
| /external/chromium_org/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;
|
| /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/jemalloc/include/jemalloc/internal/ |
| tsd.h | 116 ql_head_initializer(blocks), \
408 ql_head(tsd_init_block_t) blocks; member in struct:tsd_init_head_s
|
| /external/openssl/crypto/modes/ |
| ctr128.c | 210 size_t blocks = len/16; local
216 if (sizeof(size_t)>sizeof(unsigned int) && blocks>(1U<<28))
217 blocks = (1U<<28);
222 * amount of blocks to the exact overflow point...
224 ctr32 += (u32)blocks;
225 if (ctr32 < blocks) {
226 blocks -= ctr32;
229 (*func)(in,out,blocks,key,ivec);
234 blocks *= 16;
235 len -= blocks;
[all...] |
| /external/skia/src/core/ |
| SkTObjectPool.h | 73 * Returns the number of blocks of items the pool has allocated so far.
75 int blocks() const { return fBlocks.getCount(); } function in class:SkTObjectPool
|
| /external/skia/tests/ |
| ObjectPoolTest.cpp | 24 int available, int blocks) {
30 if (blocks != pool.blocks()) {
31 ERRORF(reporter, "%s - Pool blocks is %d not %d",
32 stage, pool.blocks(), blocks);
45 int blocks = (index / kNumItemsPerBlock) + 1; local
46 int available = (blocks * kNumItemsPerBlock) - (index + 1);
47 if (!verifyPool(reporter, pool, "acquire", available, blocks)) {
52 int blocks = pool.blocks() local
[all...] |
| /bionic/libc/kernel/uapi/linux/mmc/ |
| ioctl.h | 32 unsigned int blocks; member in struct:mmc_ioc_cmd
|
