/external/valgrind/main/memcheck/tests/ |
H A D | leak-0.stderr.exp | 1 leaked: 0 bytes in 0 blocks 2 dubious: 0 bytes in 0 blocks 3 reachable: 0 bytes in 1 blocks 4 suppressed: 0 bytes in 0 blocks
|
H A D | leak-cases-summary.stderr.exp | 1 leaked: 80 bytes in 5 blocks 2 dubious: 96 bytes in 6 blocks 3 reachable: 64 bytes in 4 blocks 4 suppressed: 0 bytes in 0 blocks
|
H A D | error_counts.stderr.exp | 7 leaked: 0 bytes in 0 blocks 8 dubious: 0 bytes in 0 blocks 9 reachable: 0 bytes in 0 blocks 10 suppressed: 0 bytes in 0 blocks 14 leaked: 77 bytes in 1 blocks 15 dubious: 88 bytes in 1 blocks 16 reachable: 99 bytes in 1 blocks 17 suppressed: 0 bytes in 0 blocks
|
H A D | leak-tree.stderr.exp | 1 leaked: 64 bytes in 4 blocks 2 dubious: 0 bytes in 0 blocks 3 reachable: 48 bytes in 3 blocks 4 suppressed: 0 bytes in 0 blocks 5 16 bytes in 1 blocks are definitely lost in loss record ... of ... 11 48 (16 direct, 32 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
|
H A D | pointer-trace.stderr.exp | 1 1,000 bytes in 1 blocks are definitely lost in loss record ... of ...
|
H A D | leak-cycle.stderr.exp | 1 leaked: 288 bytes in 18 blocks 2 dubious: 0 bytes in 0 blocks 3 reachable: 0 bytes in 0 blocks 4 suppressed: 0 bytes in 0 blocks 5 48 (16 direct, 32 indirect) bytes in 1 blocks are definitely lost in loss record ... of ... 11 48 (16 direct, 32 indirect) bytes in 1 blocks are definitely lost in loss record ... of ... 17 96 (16 direct, 80 indirect) bytes in 1 blocks are definitely lost in loss record ... of ... 23 96 (16 direct, 80 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
|
H A D | leak-delta.stderr.exp | 2 10 bytes in 1 blocks are still reachable in loss record ... of ... 9 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ... 14 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 20 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ... 27 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 33 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ... 38 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ... 44 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ... 49 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 55 32 (+32) bytes in 1 (+1) blocks ar [all...] |
/external/webkit/Tools/Scripts/webkitpy/tool/steps/ |
H A D | createbug.py | 39 Options.blocks, 49 blocks = self._options.blocks 50 if not blocks: 51 blocks = state.get("bug_blocked") 52 state["bug_id"] = self._tool.bugs.create_bug(state["bug_title"], state["bug_description"], blocked=blocks, component=self._options.component, cc=cc)
|
/external/webkit/Source/JavaScriptCore/heap/ |
H A D | HandleStack.cpp | 44 const Vector<HandleSlot>& blocks = m_blockStack.blocks(); local 47 int end = blocks.size() - 1; 49 HandleSlot block = blocks[i]; 52 HandleSlot block = blocks[end];
|
H A D | HandleStack.h | 85 const Vector<HandleSlot>& blocks = m_blockStack.blocks(); 88 int i = blocks.size() - 1; 89 for ( ; blocks[i] + m_blockStack.blockLength != lastFrame.m_end; --i) { 91 blocks[i][j] = JSValue(); 94 for (HandleSlot it = blocks[i] + m_blockStack.blockLength - 1; it != lastFrame.m_next - 1; --it)
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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/genext2fs/ |
H A D | test.sh | 31 # Usage: dtest file-size number-of-blocks correct-checksum 33 size=$1; blocks=$2; checksum=$3 35 dgen $size $blocks 43 # Usage: ftest spec-file number-of-blocks correct-checksum 45 fname=$1; blocks=$2; checksum=$3 47 fgen $fname $blocks
|
H A D | test-mount.sh | 34 # Usage: dtest-mount file-size number-of-blocks 36 size=$1; blocks=$2 38 dgen $size $blocks 47 pass dtest $size $blocks 54 # Usage: ftest-mount spec-file number-of-blocks 56 fname=$1; blocks=$2 58 fgen $fname $blocks 75 pass ftest $fname $blocks
|
H A D | test-gen.lib | 9 # Usage: dgen file-size number-of-blocks 11 size=$1; blocks=$2 23 ./genext2fs -N 17 -b $blocks -d test -f -q ext2.img 28 # Usage: fgen spec-file number-of-blocks 30 fname=$1; blocks=$2; 34 ./genext2fs -N 92 -b $blocks -D test/$fname -f ext2.img
|
/external/markdown/markdown/ |
H A D | blockparser.py | 38 """ Parse Markdown blocks into an ElementTree object. 67 blocks which will be split on blank lines, it could contain only one 77 def parseBlocks(self, parent, blocks): 78 """ Process blocks of markdown text and attach to given etree node. 80 Given a list of ``blocks``, each blockprocessor is stepped through 81 until there are no blocks left. While an extension could potentially 89 while blocks: 91 if processor.test(parent, blocks[0]): 92 processor.run(parent, blocks)
|
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | 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/wpa_supplicant_8/src/crypto/ |
H A D | 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/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | 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/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | RopMethod.java | 28 private final BasicBlockList blocks; field in class:RopMethod 41 * the labels for the blocks that return, if calculated 48 * @param blocks {@code non-null;} basic block list of the method 51 public RopMethod(BasicBlockList blocks, int firstLabel) { argument 52 if (blocks == null) { 53 throw new NullPointerException("blocks == null"); 60 this.blocks = blocks; 73 return blocks; 130 RopMethod result = new RopMethod(blocks [all...] |
/external/valgrind/main/gdbserver_tests/ |
H A D | mcleak.stderr.exp | 5 10 bytes in 1 blocks are still reachable in loss record ... of ... 19 leaked: 32 bytes in 1 blocks 20 dubious: 0 bytes in 0 blocks 21 reachable: 64 bytes in 3 blocks 22 suppressed: 0 bytes in 0 blocks 23 10 bytes in 1 blocks are still reachable in loss record ... of ... 28 21 bytes in 1 blocks are still reachable in loss record ... of ... 33 32 bytes in 1 blocks are definitely lost in loss record ... of ... 38 33 bytes in 1 blocks are still reachable in loss record ... of ...
|
/external/openssl/crypto/modes/ |
H A D | 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/openssl/crypto/evp/ |
H A D | e_rc4_hmac_md5.c | 81 MD5_CTX *ctx,const void *inp,size_t blocks); 123 blocks; local 137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) && 143 &key->md,in+md5_off,blocks); 144 blocks *= MD5_CBLOCK; 145 rc4_off += blocks; 146 md5_off += blocks; 147 key->md.Nh += blocks>>29; 148 key->md.Nl += blocks<<=3; 149 if (key->md.Nl<(unsigned int)blocks) ke [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | 2006-09-12-OpaqueStructCrash.cpp | 24 B<C<Ty> > blocks; member in struct:D
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding 50 BasicBlockList blocks = method.getBlocks(); 51 int maxLabel = blocks.getMaxLabel(); 127 BasicBlockList blocks = method.getBlocks(); 128 int sz = blocks.size(); 131 BasicBlock one = blocks.get(i);
|
/external/dbus/dbus/ |
H A D | dbus-mempool.c | 35 * blocks of small uniformly-sized objects. The main point is to avoid 84 * only saved so we can free all the blocks 104 DBusMemBlock *blocks; /**< blocks of memory from malloc() */ member in struct:DBusMemPool 188 block = pool->blocks; 234 block->next = pool->blocks; 235 pool->blocks = block; 268 if (pool->blocks == NULL || 269 pool->blocks->used_so_far == pool->block_size) 313 block->next = pool->blocks; [all...] |