HomeSort by: relevance | last modified time | path
    Searched refs:BLOCKS (Results 1 - 3 of 3) sorted by relevancy

  /src/sbin/scan_ffs/
scan_ffs.c 107 enum { NADA=0, VERBOSE=1, LABELS=2, BLOCKS=4 };
206 case BLOCKS:
214 if (flag == BLOCKS)
234 if (flags & BLOCKS) {
235 ffs_printpart(sbi, BLOCKS, 0, n);
298 case BLOCKS:
336 if (flags & BLOCKS) {
338 lfs_printpart(sbi, BLOCKS, n);
421 n = snprintf(buf, sizeof(buf), "%s: done %ju of %ju blocks (%3.2f%%)\n",
514 flags |= BLOCKS;
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
sel-sched-ir.h 244 blocks code motion through it when pipelining. */
620 from flow that is accumulated in the basic blocks. These two infos
623 basic blocks. When this scheduler will be switched to use dataflow,
876 #define SET_LOOP_PREHEADER_BLOCKS(LOOP,BLOCKS) ((LOOP)->aux \
877 = (BLOCKS != NULL \
878 ? BLOCKS \
969 /* Saves pipelined blocks. Bitmap is indexed by bb->index. */
997 /* The previous edge saved after skipping empty blocks. */
1000 /* Edge iterator used when there are successors in other basic blocks. */
1378 empty blocks. When E2P is not null, the resulting edge is written there
    [all...]
  /src/sys/net/
zlib.c 496 * all blocks if lit_bufsize is not greater than 32K.)
1705 /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
2984 * the last real code. In this case we send two empty static blocks instead
3158 * on 16 bit machines and because stored blocks are restricted to
3378 BLOCKS, /* decompressing blocks */
3407 *blocks; /* current inflate_blocks state */ member in struct:internal_state
3418 z->state->mode = z->state->nowrap ? BLOCKS : METHOD;
3419 inflate_blocks_reset(z->state->blocks, z, Z_NULL);
3429 if (z->state->blocks != Z_NULL
    [all...]

Completed in 35 milliseconds