| /external/valgrind/main/memcheck/tests/ |
| leak-pool-5.stderr.exp | 4 in use at exit: ... bytes in ... blocks
|
| mallinfo.stderr.exp | 5 in use at exit: ... bytes in ... blocks
|
| new_override.stderr.exp | 4 in use at exit: ... bytes in ... blocks
|
| sbfragment.stderr.exp | 4 in use at exit: ... bytes in ... blocks
|
| /external/valgrind/main/memcheck/tests/linux/ |
| brk.stderr.exp | 4 in use at exit: ... bytes in ... blocks
|
| capget.stderr.exp | 8 in use at exit: ... bytes in ... blocks
|
| lsframe1.stderr.exp | 6 in use at exit: ... bytes in ... blocks
|
| lsframe2.stderr.exp | 6 in use at exit: ... bytes in ... blocks
|
| sigqueue.stderr.exp | 5 in use at exit: 0 bytes in 0 blocks
|
| syscalls-2007.stderr.exp | 4 in use at exit: ... bytes in ... blocks
|
| syslog-syscall.stderr.exp | 5 in use at exit: ... bytes in ... blocks
|
| /external/valgrind/main/memcheck/tests/ppc32/ |
| power_ISA2_05.stderr.exp | 4 in use at exit: 0 bytes in 0 blocks
|
| /external/valgrind/main/memcheck/tests/ppc64/ |
| power_ISA2_05.stderr.exp | 4 in use at exit: 0 bytes in 0 blocks
|
| /external/chromium_org/third_party/angle_dx11/src/third_party/murmurhash/ |
| MurmurHash3.cpp | 108 const uint32_t * blocks = (const uint32_t *)(data + nblocks*4);
local
112 uint32_t k1 = getblock(blocks,i);
169 const uint32_t * blocks = (const uint32_t *)(data + nblocks*16);
local
173 uint32_t k1 = getblock(blocks,i*4+0);
174 uint32_t k2 = getblock(blocks,i*4+1);
175 uint32_t k3 = getblock(blocks,i*4+2);
176 uint32_t k4 = getblock(blocks,i*4+3);
270 const uint64_t * blocks = (const uint64_t *)(data);
local
274 uint64_t k1 = getblock(blocks,i*2+0);
275 uint64_t k2 = getblock(blocks,i*2+1);
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| MurmurHash3.cpp | 108 const uint32_t * blocks = (const uint32_t *)(data + nblocks*4); local
112 uint32_t k1 = getblock(blocks,i);
169 const uint32_t * blocks = (const uint32_t *)(data + nblocks*16); local
173 uint32_t k1 = getblock(blocks,i*4+0);
174 uint32_t k2 = getblock(blocks,i*4+1);
175 uint32_t k3 = getblock(blocks,i*4+2);
176 uint32_t k4 = getblock(blocks,i*4+3);
270 const uint64_t * blocks = (const uint64_t *)(data); local
274 uint64_t k1 = getblock(blocks,i*2+0);
275 uint64_t k2 = getblock(blocks,i*2+1)
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 234 // boundaries of basic blocks.
343 // Textbook implementation of a basic block generator. All basic blocks
356 SANDBOX_DIE("Internal compiler error; cannot compute basic blocks");
409 // basic block and any blocks referenced by this block. This function can be
411 // blocks in STL containers; this gives an easy option to use STL to find
412 // shared tail sequences of basic blocks.
414 const TargetsToBlocks& blocks) {
422 // We compare the sequence of instructions in both basic blocks.
429 // both basic blocks, we know the relative ordering between the two blocks
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils_test.cc | 43 vector<int> blocks; local
47 blocks.push_back(1);
48 blocks.push_back(2);
49 blocks.push_back(3);
50 blocks.push_back(3);
51 blocks.push_back(1);
77 BlockOrderingToScalarOrdering(blocks,
|
| compressed_row_sparse_matrix.cc | 292 const vector<int>& blocks) {
295 for (int i = 0; i < blocks.size(); ++i) {
296 num_rows += blocks[i];
297 num_nonzeros += blocks[i] * blocks[i];
310 for (int i = 0; i < blocks.size(); ++i) {
311 const int block_size = blocks[i];
323 *matrix->mutable_row_blocks() = blocks;
324 *matrix->mutable_col_blocks() = blocks;
|
| block_random_access_crs_matrix.cc | 49 const vector<int>& blocks,
52 blocks_(blocks) {
53 CHECK_LT(blocks.size(), kMaxRowBlocks);
94 // Add entries to layout_ for all the blocks for this row.
132 // Assume that the user does not hold any locks on any cell blocks
163 // Assume that the user does not hold any locks on any cell blocks
|
| block_random_access_sparse_matrix.cc | 48 const vector<int>& blocks,
51 blocks_(blocks) {
52 CHECK_LT(blocks.size(), kMaxRowBlocks);
118 // Assume that the user does not hold any locks on any cell blocks
148 // Assume that the user does not hold any locks on any cell blocks
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs_live_variables.cpp | 55 fs_bblock *block = cfg->blocks[b];
59 assert(cfg->blocks[b - 1]->end_ip == ip - 1);
120 foreach_list(block_node, &cfg->blocks[b]->children) {
212 def[i] = MIN2(def[i], cfg.blocks[b]->start_ip);
213 use[i] = MAX2(use[i], cfg.blocks[b]->start_ip);
217 def[i] = MIN2(def[i], cfg.blocks[b]->end_ip);
218 use[i] = MAX2(use[i], cfg.blocks[b]->end_ip);
|
| /external/e2fsprogs/lib/ext2fs/ |
| getsize.c | 139 * Returns the number of blocks in a partition
280 blk64_t blocks;
282 retval = ext2fs_get_device_size2(file, blocksize, &blocks);
285 if (blocks >= (1ULL << 32))
287 *retblocks = (blk_t) blocks;
296 blk_t blocks;
304 retval = ext2fs_get_device_size(argv[1], 1024, &blocks);
310 printf("Device %s has %u 1k blocks.\n", argv[1], blocks);
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_live_variables.cpp | 55 fs_bblock *block = cfg->blocks[b];
59 assert(cfg->blocks[b - 1]->end_ip == ip - 1);
120 foreach_list(block_node, &cfg->blocks[b]->children) {
212 def[i] = MIN2(def[i], cfg.blocks[b]->start_ip);
213 use[i] = MAX2(use[i], cfg.blocks[b]->start_ip);
217 def[i] = MIN2(def[i], cfg.blocks[b]->end_ip);
218 use[i] = MAX2(use[i], cfg.blocks[b]->end_ip);
|
| /bionic/libc/kernel/tools/ |
| cpp.py | [all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-deoptimizing-mark.cc | 35 ZoneList<HBasicBlock*> stack(graph()->blocks()->length(), zone());
52 // All blocks processed.
61 for (int i = 0; i < graph()->blocks()->length(); ++i) {
62 HBasicBlock* block = graph()->blocks()->at(i);
|
