HomeSort by: relevance | last modified time | path
    Searched defs:n_blocks (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.bin/vndcompress/
vnduncompress.c 88 const uint32_t n_blocks = be32toh(header.cl2h_n_blocks); local in function:vnduncompress
107 if (MAX_N_BLOCKS < n_blocks)
109 n_blocks, (uint32_t)MAX_N_BLOCKS);
114 const uint32_t n_offsets = (n_blocks + 1);
166 for (blkno = 0; blkno < n_blocks; blkno++) {
210 if (((blkno + 1) < n_blocks) && (uncomplen != blocksize))
vnduncompress.c 88 const uint32_t n_blocks = be32toh(header.cl2h_n_blocks); local in function:vnduncompress
107 if (MAX_N_BLOCKS < n_blocks)
109 n_blocks, (uint32_t)MAX_N_BLOCKS);
114 const uint32_t n_offsets = (n_blocks + 1);
166 for (blkno = 0; blkno < n_blocks; blkno++) {
210 if (((blkno + 1) < n_blocks) && (uncomplen != blocksize))
vndcompress.c 71 uint32_t n_blocks; /* ceiling(size/blocksize) */ member in struct:compress_state
72 uint32_t n_offsets; /* n_blocks + 1 */
161 while (S->blkno < S->n_blocks) {
216 assert(S->blkno == S->n_blocks);
313 assert(S->n_blocks > 0);
318 ((uint64_t)S->n_blocks * sizeof(uint64_t)))?
481 S->n_blocks = HOWMANY(S->size, S->blocksize);
482 assert(S->n_full_blocks <= S->n_blocks);
483 assert(S->n_blocks <= MAX_N_BLOCKS);
491 S->n_offsets = (S->n_blocks + 1)
    [all...]
vndcompress.c 71 uint32_t n_blocks; /* ceiling(size/blocksize) */ member in struct:compress_state
72 uint32_t n_offsets; /* n_blocks + 1 */
161 while (S->blkno < S->n_blocks) {
216 assert(S->blkno == S->n_blocks);
313 assert(S->n_blocks > 0);
318 ((uint64_t)S->n_blocks * sizeof(uint64_t)))?
481 S->n_blocks = HOWMANY(S->size, S->blocksize);
482 assert(S->n_full_blocks <= S->n_blocks);
483 assert(S->n_blocks <= MAX_N_BLOCKS);
491 S->n_offsets = (S->n_blocks + 1)
    [all...]

Completed in 26 milliseconds