/external/e2fsprogs/tests/r_32to64bit/ |
expect | 2 Creating filesystem with 524288 1k blocks and 65536 inodes 3 Superblock backups stored on blocks: 8 Creating journal (16384 blocks): done 9 Creating 477 huge file(s) with 1024 blocks each: done 12 Pass 1: Checking inodes, blocks, and sizes 21 The filesystem on test.img is now 524288 (1k) blocks long. 38 -Reserved GDT blocks: 256 40 +Reserved GDT blocks: 254 41 Blocks per group: 8192 88 Pass 1: Checking inodes, blocks, and size [all...] |
/external/e2fsprogs/tests/r_32to64bit_meta/ |
expect | 2 Creating filesystem with 524288 1k blocks and 65536 inodes 3 Superblock backups stored on blocks: 8 Creating journal (16384 blocks): done 9 Creating 479 huge file(s) with 1024 blocks each: done 12 Pass 1: Checking inodes, blocks, and sizes 21 The filesystem on test.img is now 524288 (1k) blocks long. 38 -Free blocks: 858 39 +Free blocks: 852 45 Blocks per group: 8192 74 Pass 1: Checking inodes, blocks, and size [all...] |
/external/e2fsprogs/tests/r_64to32bit_meta/ |
expect | 2 Creating filesystem with 524288 1k blocks and 65536 inodes 3 Superblock backups stored on blocks: 8 Creating journal (16384 blocks): done 9 Creating 479 huge file(s) with 1024 blocks each: done 12 Pass 1: Checking inodes, blocks, and sizes 21 The filesystem on test.img is now 524288 (1k) blocks long. 38 -Free blocks: 852 39 +Free blocks: 858 45 Blocks per group: 8192 74 Pass 1: Checking inodes, blocks, and size [all...] |
/external/pdfium/third_party/bigint/ |
NumberlikeArray.hh | 36 // The current allocated capacity of this NumberlikeArray (in blocks) 38 // The actual length of the value stored in this NumberlikeArray (in blocks) 40 // Heap-allocated array of the blocks (can be NULL if len == 0) 75 // Constructor that copies from a given array of blocks 120 // Copy number blocks 135 // Copy blocks 151 // Copy number blocks 162 // Copy blocks 174 // Compare corresponding blocks one by one. 179 // No blocks differed, so the objects are equal [all...] |
/external/freetype/src/gzip/ |
inflate.c | 20 BLOCKS, /* decompressing blocks */ 49 *blocks; /* current inflate_blocks state */ member in struct:internal_state 61 z->state->mode = z->state->nowrap ? BLOCKS : METHOD; 62 inflate_blocks_reset(z->state->blocks, z, Z_NULL); 73 if (z->state->blocks != Z_NULL) 74 inflate_blocks_free(z->state->blocks, z); 105 z->state->blocks = Z_NULL; 124 if ((z->state->blocks = 190 z->state->mode = BLOCKS; [all...] |
/external/llvm/lib/CodeGen/ |
UnreachableBlockElim.cpp | 1 //===-- UnreachableBlockElim.cpp - Remove unreachable blocks for codegen --===// 11 // job is to delete LLVM basic blocks that are not reachable from the entry 17 // blocks. Until LLVM has a more systematic way of defining instruction 45 // Mark all reachable blocks. 47 (void)BB/* Mark all reachable blocks */; 49 // Loop over all dead blocks, remembering them and deleting all instructions 65 // Actually remove the blocks now. 93 "Remove unreachable blocks from the CFG", false, false) 122 "Remove unreachable machine basic blocks", false, false) 140 // Mark all reachable blocks [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
UnreachableBlockElim.cpp | 1 //===-- UnreachableBlockElim.cpp - Remove unreachable blocks for codegen --===// 11 // job is to delete LLVM basic blocks that are not reachable from the entry 17 // blocks. Until LLVM has a more systematic way of defining instruction 59 "Remove unreachable blocks from the CFG", false, false) 68 // Mark all reachable blocks. 71 /* Mark all reachable blocks */; 73 // Loop over all dead blocks, remembering them and deleting all instructions 89 // Actually remove the blocks now. 113 "Remove unreachable machine basic blocks", false, false) 131 // Mark all reachable blocks [all...] |
/dalvik/dx/src/com/android/dx/ssa/back/ |
SsaToRop.java | 131 * Removes all blocks containing only GOTOs from the control flow. 135 * blocks containing the real return or throw statements must be 139 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local 151 SsaBasicBlock pb = blocks.get(i); 166 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local 168 for (SsaBasicBlock block : blocks) { 169 // Add moves in all the pred blocks for each phi insn. 170 block.forEachPhiInsn(new PhiVisitor(blocks)); 180 for (SsaBasicBlock block : blocks) { 190 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor 242 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local [all...] |
/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
deadcode.go | 7 // findlive returns the reachable blocks and live values in f. 14 // reachableBlocks returns the reachable blocks in f. 56 // Starting set: all control values of reachable blocks are live. 58 for _, b := range f.Blocks { 108 // Find reachable blocks. 112 for _, b := range f.Blocks { 127 for _, b := range f.Blocks { 177 for _, b := range f.Blocks { 188 // Remove dead values from blocks' value list. Return dead 190 for _, b := range f.Blocks { [all...] |
/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
deadcode.go | 7 // findlive returns the reachable blocks and live values in f. 14 // reachableBlocks returns the reachable blocks in f. 56 // Starting set: all control values of reachable blocks are live. 58 for _, b := range f.Blocks { 108 // Find reachable blocks. 112 for _, b := range f.Blocks { 127 for _, b := range f.Blocks { 177 for _, b := range f.Blocks { 188 // Remove dead values from blocks' value list. Return dead 190 for _, b := range f.Blocks { [all...] |
/system/update_engine/payload_generator/ |
ext2_filesystem.cc | 46 // Processes all blocks belonging to an inode and adds them to the extent list. 60 // blocks belonging to an inode. This function should match the prototype of 68 set<uint64_t>* blocks = static_cast<set<uint64_t>*>(priv); local 77 blocks->insert(*blocknr); 218 // Process the inode data and metadata blocks. 219 // For normal files, inode blocks are indirect, double indirect 220 // and triple indirect blocks (no data blocks). For directories and 221 // the journal, all blocks are considered metadata blocks [all...] |
/external/deqp/doc/testspecs/GLES31/ |
functional.ssbo.txt | 29 + Binding SSBOs to buffer blocks 36 + Buffer blocks GLSL 37 - Basic scalar, vector and matrix types in buffer blocks 38 - Samplers in buffer blocks - as negative case! 39 - Structures and arrays in buffer blocks 44 - Unused variables in buffer blocks
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/iface/ |
MethodImplementation.java | 59 * Gets a list of the try blocks defined for this method. 61 * Try blocks may overlap freely, and do not need to be strictly nested, as in java. This is a more relaxed 62 * requirement than specified by the dex format, where try blocks may not overlap, and must be specified in 63 * ascending order. When writing to a dex file, the try blocks will be massaged into the appropriate format. 65 * In any region where there are overlapping try blocks, set of exception handlers for the overlapping region will 68 * If multiple overlapping try blocks define a handler for the same exception type, or define a catch-all
|
/system/chre/util/include/chre/util/ |
memory_pool.h | 39 * of unused blocks is stored in the space of unused blocks. This means that 85 //! Intentionally not destructing any leaked blocks, will consider doing 97 * Obtains a pointer to the underlying storage for the memory pool blocks. 101 MemoryPoolBlock *blocks(); 103 //! Storage for memory pool blocks. To avoid static initialization of members,
|
/system/nfc/src/nfc/int/ |
ce_int.h | 49 nbr; /* NBr: number of blocks that can be read using one Check command */ 50 uint8_t nbw; /* Nbw: number of blocks that can be written using one Update 52 uint16_t nmaxb; /* Nmaxb: maximum number of blocks available for NDEF data */ 85 /* CE Type 4 Tag control blocks */ 122 /* CE memory control blocks */ 128 /* CE control blocks */
|
/art/compiler/optimizing/ |
side_effects_analysis.h | 39 // Compute side effects of individual blocks and loops. 55 // Side effects of individual blocks, that is the union of the side effects 60 // blocks contained in that loop.
|
/development/tutorials/MoarRam/jni/ |
baz.c | 51 ALOGW("%d %d-byte blocks allocated so far (just allocated %p)", 73 ALOGW("All %d-byte blocks are freed", size); 79 ALOGW("%d %d-byte blocks allocated so far (just freed %p)",
|
/external/boringssl/src/crypto/fipsmodule/modes/ |
ctr.c | 176 size_t blocks = len / 16; local 180 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28)) { 181 blocks = (1U << 28); 186 * amount of blocks to the exact overflow point... */ 187 ctr32 += (uint32_t)blocks; 188 if (ctr32 < blocks) { 189 blocks -= ctr32; 192 (*func)(in, out, blocks, key, ivec); 199 blocks *= 16; 200 len -= blocks; [all...] |
/external/e2fsprogs/lib/ext2fs/ |
read_bb_file.c | 2 * read_bb_file.c --- read a list of bad blocks from a FILE * 31 * Reads a list of bad blocks from a FILE * 95 * Reads a list of bad blocks from a FILE *
|
/external/e2fsprogs/lib/support/ |
quotaio_tree.h | 12 #define QT_TREEOFF 1 /* Offset of tree in file in blocks */ 47 unsigned int dqi_blocks; /* # of blocks in quota file */ 48 unsigned int dqi_free_blk; /* First block in list of free blocks */
|
/external/e2fsprogs/tests/f_baddir/ |
expect.1 | 3 Pass 1: Checking inodes, blocks, and sizes 42 Free blocks count wrong (74, counted=75). 53 test_filesys: 14/32 files (0.0% non-contiguous), 25/100 blocks
|
/external/e2fsprogs/tests/f_convert_bmap_and_extent/ |
expect.1 | 13 BLOCKS: 24 Pass 1: Checking inodes, blocks, and sizes 32 test_filesys: 13/128 files (15.4% non-contiguous), 574/2048 blocks
|
/external/e2fsprogs/tests/f_yesall/ |
expect | 1 Pass 1: Checking inodes, blocks, and sizes 53 Free blocks count wrong for group #0 (0, counted=494). 61 test_filesys: 14/128 files (0.0% non-contiguous), 18/512 blocks
|
/external/e2fsprogs/tests/ |
filter.sed | 11 /Discarding device blocks/d 23 /Reserved blocks uid:/s/ (user .*)// 24 /Reserved blocks gid:/s/ (group .*)//
|
/external/e2fsprogs/tests/j_long_trans_mcsum_32bit/ |
expect | 2 Creating filesystem with 524288 1k blocks and 32768 inodes 3 Superblock backups stored on blocks: 8 Creating journal (16384 blocks): done 11 Pass 1: Checking inodes, blocks, and sizes 16 test_filesys: 11/32768 files (0.0% non-contiguous), 27050/524288 blocks 100 Pass 1: Checking inodes, blocks, and sizes 114 Free blocks count wrong for group #0 (5837, counted=5850). 117 Free blocks count wrong for group #17 (0, counted=8192). 120 Free blocks count wrong for group #18 (0, counted=8192). 123 Free blocks count wrong (497236, counted=513633) [all...] |