Searched
full:blocks (Results
1401 -
1425 of
5464) sorted by null
<<51525354555657585960>>
/external/e2fsprogs/lib/ext2fs/ |
ext2_err.c | 94 "Journal must be at least 1024 blocks", 102 "Too many reserved group descriptor blocks",
|
/external/e2fsprogs/tests/f_journal/ |
expect.1 | 54 Pass 1: Checking inodes, blocks, and sizes 61 test_filesys: 53/2048 files (1.9% non-contiguous), 1409/8192 blocks
|
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/sftp/ |
AttribBits.java | 86 * The file is a sparse file; this means that file blocks that have 89 * the blocks between the previous EOF marker and the 10 M offset would
|
/external/grub/stage2/ |
fsys_vstafs.c | 81 a = FILE_INFO->blocks; 198 a = FILE_INFO->blocks;
|
pc_slice.h | 236 #define FS_V71K 5 /* V7 with 1K blocks (4.1, 2.9) */ 237 #define FS_V8 6 /* Eighth Edition, 4K blocks */
|
/external/icu4c/common/ |
bmpset.h | 120 * The bits are organized vertically; consecutive 64-code point blocks 148 * for mixed BMP blocks and for supplementary code points.
|
/external/icu4c/tools/makeconv/ |
genmbcs.h | 63 * that covers small-script blocks which usually have either dense mappings 95 /* =4 number of regular stage 3 blocks for final UTF-8 trail byte */
|
/external/jmonkeyengine/engine/src/networking/com/jme3/network/base/ |
ConnectorAdapter.java | 89 // The backlog makes sure that the outbound channel blocks once 111 // can go out in a way that blocks reads.
|
/external/jpeg/ |
transupp.h | 60 * bother to preserve DCT blocks that appear to be completely outside the 69 * and process edge blocks in a way that preserves the equivalence.
|
/external/kernel-headers/original/linux/ |
filter.h | 35 unsigned short len; /* Number of filter blocks */ 153 unsigned int len; /* Number of filter blocks */
|
/external/libnfc-nci/src/nfc/include/ |
tags_defs.h | 58 #define T1T_BLOCKS_PER_SEGMENT 0x10 /* Number of blocks present in a segment */ 179 #define T2T_CMD_READ 0x30 /* read 4 blocks (16 bytes) */ 230 #define T3T_FELICALITE_NMAXB 13 /* Maximum number of blocks for NDEF message for Felica Lite tags */ 281 #define T3T_MSG_NUM_BLOCKS_UPDATE_MAX 13 /* Max Number of Blocks per UPDATE command */ 282 #define T3T_MSG_NUM_BLOCKS_CHECK_MAX 15 /* Max Number of Blocks per CHECK command */ 460 #define I93_CMD_READ_MULTI_BLOCK 0x23 /* Read multiple blocks */ 461 #define I93_CMD_WRITE_MULTI_BLOCK 0x24 /* Write multiple blocks */ 478 #define I93_MAX_NUM_BLOCK 256 /* Max number of blocks */
|
/external/libvpx/libvpx/vp8/common/ |
blockd.h | 133 modes for the Y blocks to the left and above us; for interframes, there 219 /* 16 Y blocks, 4 U, 4 V, 1 DC 2nd order block, each with 16 entries. */
|
/external/libvpx/libvpx/vp9/common/ |
vp9_entropy.h | 77 block type is 0), we look at the (already encoded) blocks above and to the 79 of these blocks having nonzero coefficients.
|
/external/llvm/docs/ |
SegmentedStacks.rst | 13 done by allocating stack blocks (henceforth called *stacklets*) and linking them 69 intrinsic to allocate dynamically sized blocks of memory on the stack. When
|
/external/llvm/include/llvm/CodeGen/ |
MachineLoopInfo.h | 16 // contained entirely within the loop and the basic blocks the make up the loop. 23 // * the successor blocks of the loop
|
MachineSSAUpdater.h | 32 /// registers defined in multiple blocks. This is used when code duplication 94 /// their respective blocks. However, the use of X happens in the *middle* of
|
/external/llvm/lib/Analysis/ |
IntervalPartition.cpp | 41 // and then add mappings from all of the basic blocks in the interval to the 47 // Add mappings for all of the basic blocks in I to the IntervalPartition
|
/external/llvm/lib/CodeGen/ |
PrologEpilogInserter.h | 83 // Entry and return blocks of the current function. 150 // Convenience for recognizing return blocks.
|
/external/llvm/lib/Target/Hexagon/ |
HexagonFixupHwLoops.cpp | 98 /// This function makes two passes over the basic blocks. The first 121 // Loop over all the basic blocks.
|
/external/llvm/lib/Transforms/Utils/ |
LoopUnroll.cpp | 14 // The process of unrolling can produce extraneous basic blocks linked with 65 // Merge basic blocks into their predecessor if there is only one distinct 97 // ScalarEvolution holds references to loop exit blocks. 260 // The current on-the-fly SSA update requires blocks to be processed in 266 // Stash the DFS iterators before adding blocks to the loop. 299 // Add phi entries for newly created values to all exit blocks. 350 // Now that all the basic blocks for the unrolled iterations are in place, 402 // Merge adjacent basic blocks, if possible.
|
/external/llvm/test/CodeGen/SystemZ/Large/ |
branch-range-03.py | 23 # so the final (0x34 - 6) / 12 == 3 blocks can use short branches. 24 # The ones after "main:" do not, so the first 0x34 / 12 == 4 blocks
|
branch-range-04.py | 23 # so the final (0x34 - 6) / 12 == 3 blocks can use short branches. 24 # The ones after "main:" do not, so the first 0x34 / 12 == 4 blocks
|
branch-range-05.py | 23 # so the final (0x34 - 6) / 12 == 3 blocks can use short branches. 24 # The ones after "main:" do not, so the first 0x34 / 12 == 4 blocks
|
branch-range-06.py | 23 # so the final (0x34 - 6) / 12 == 3 blocks can use short branches. 24 # The ones after "main:" do not, so the first 0x34 / 12 == 4 blocks
|
/external/mesa3d/src/gallium/drivers/r300/ |
r300_texture_desc.c | 241 /* Compute the number of blocks in Y, see if the CBZB clear can be 334 * but the blocks have very weird ordering. 337 * clearing 4 dwords clears blocks like this: 341 * where numbers correspond to dword indices. The blocks are interleaved 342 * in the X direction, so the alignment must be 4x1 blocks (32x8 pixels). 345 * clearing 8 dwords clears blocks like this: 350 * where numbers correspond to dword indices. The blocks are interleaved 351 * in both directions, so the alignment must be 4x4 blocks (32x32 pixels)
|
Completed in 1401 milliseconds
<<51525354555657585960>>