| /src/usr.bin/vndcompress/ |
| vnduncompress.c | 88 const uint32_t n_blocks = be32toh(header.cl2h_n_blocks); local
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...] |
| /src/external/bsd/jemalloc/dist/src/ |
| base.c | 129 size_t n_blocks = with_new_block ? 2 : 1; local
131 n_blocks++;
135 return n_blocks;
|
| /src/external/bsd/jemalloc.old/dist/src/ |
| base.c | 134 size_t n_blocks = with_new_block ? 2 : 1; local
136 n_blocks++;
140 return n_blocks;
|
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| cortex-a57-fma-steering.cc | 925 int i, n_blocks, *bb_dfs_preorder; local
930 n_blocks = pre_and_rev_post_order_compute (bb_dfs_preorder, NULL, false);
934 for (i = 0; i < n_blocks; i++)
|
| aarch64-early-ra.cc | 3607 unsigned int n_blocks = df_get_n_blocks (DF_FORWARD); local
3609 for (unsigned int bbi = 0; bbi < n_blocks; ++bbi)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| dce.cc | 1080 int n_blocks = df_get_n_blocks (DF_BACKWARD); local
1101 for (i = 0; i < n_blocks; i++)
1110 for (i = 0; i < n_blocks; i++)
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks);
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
|
| early-remat.cc | 1007 unsigned int n_blocks = last_basic_block_for_fn (m_fn); local
1008 m_block_info.safe_grow_cleared (n_blocks, true);
1051 unsigned int n_blocks = last_basic_block_for_fn (m_fn); local
1054 rpo_index = new unsigned int[n_blocks];
|
| df.h | 589 int n_blocks; /* The number of blocks in reverse postorder. */
588 int n_blocks; \/* The number of blocks in reverse postorder. *\/ member in class:df_d
|
| function.cc | 4626 int n_blocks = 0;
4634 vector[n_blocks] = block;
4636 ++n_blocks;
4639 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
4640 vector ? vector + n_blocks : 0);
4644 return n_blocks;
4672 int n_blocks;
4675 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
4678 for (i = 1; i < n_blocks; ++i)
4610 int n_blocks = 0; local
4656 int n_blocks; local
|
| sel-sched-ir.cc | 3696 int *postorder, n_blocks;
3699 n_blocks = post_order_compute (postorder, false, false);
3702 for (n = 0, i = n_blocks - 1; i >= 0; i--)
4954 int n_blocks, i;
4966 n_blocks = post_order_compute (postorder, true, false);
4967 gcc_assert (n_basic_blocks_for_fn (cfun) == n_blocks);
4971 for (i = 0; i < n_blocks; i++)
3676 int *postorder, n_blocks; local
4930 int n_blocks, i; local
|
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| cortex-a57-fma-steering.cc | 925 int i, n_blocks, *bb_dfs_preorder; local
930 n_blocks = pre_and_rev_post_order_compute (bb_dfs_preorder, NULL, false);
934 for (i = 0; i < n_blocks; i++)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| dce.cc | 1080 int n_blocks = df_get_n_blocks (DF_BACKWARD); local
1101 for (i = 0; i < n_blocks; i++)
1110 for (i = 0; i < n_blocks; i++)
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks);
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
|
| early-remat.cc | 1009 unsigned int n_blocks = last_basic_block_for_fn (m_fn); local
1010 m_block_info.safe_grow_cleared (n_blocks, true);
1053 unsigned int n_blocks = last_basic_block_for_fn (m_fn); local
1056 postorder_index = new unsigned int[n_blocks];
|
| df.h | 589 int n_blocks; /* The number of blocks in reverse postorder. */
588 int n_blocks; \/* The number of blocks in reverse postorder. *\/ member in class:df_d
|
| function.cc | 4629 int n_blocks = 0;
4637 vector[n_blocks] = block;
4639 ++n_blocks;
4642 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
4643 vector ? vector + n_blocks : 0);
4647 return n_blocks;
4675 int n_blocks;
4686 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
4689 for (i = 1; i < n_blocks; ++i)
4613 int n_blocks = 0; local
4659 int n_blocks; local
|
| sel-sched-ir.cc | 3696 int *postorder, n_blocks;
3699 n_blocks = post_order_compute (postorder, false, false);
3702 for (n = 0, i = n_blocks - 1; i >= 0; i--)
4954 int n_blocks, i;
4966 n_blocks = post_order_compute (postorder, true, false);
4967 gcc_assert (n_basic_blocks_for_fn (cfun) == n_blocks);
4971 for (i = 0; i < n_blocks; i++)
3676 int *postorder, n_blocks; local
4930 int n_blocks, i; local
|
| /src/external/bsd/libpcap/dist/ |
| optimize.c | 264 u_int n_blocks; /* number of blocks in the CFG; guaranteed to be > 0, as it's a RET instruction at a minimum */ member in struct:__anon7260
266 u_int n_edges; /* twice n_blocks, so guaranteed to be > 0 */
412 memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));
436 i = opt_state->n_blocks * opt_state->nodewords;
518 opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets));
2160 for (i = 0; i < opt_state->n_blocks; ++i)
2381 for (i = 0; i < opt_state->n_blocks; ++i)
2386 for (i = opt_state->n_blocks - 1; i != 0; ) {
2390 for (j = i + 1; j < opt_state->n_blocks; ++j) {
2400 for (i = 0; i < opt_state->n_blocks; ++i)
[all...] |
