Home
last modified time | relevance | path

Searched refs:nblock (Results 1 – 25 of 34) sorted by relevance

12

/third_party/bzip2/
Dblocksort.c215 Int32 nblock, in fallbackSort() argument
232 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; in fallbackSort()
236 for (i = 0; i < nblock; i++) { in fallbackSort()
243 nBhtab = 2 + (nblock / 32); in fallbackSort()
255 SET_BH(nblock + 2*i); in fallbackSort()
256 CLEAR_BH(nblock + 2*i + 1); in fallbackSort()
267 for (i = 0; i < nblock; i++) { in fallbackSort()
269 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort()
285 if (l >= nblock) break; in fallbackSort()
292 if (r >= nblock) break; in fallbackSort()
[all …]
Ddecompress.c125 Int32 nblock; in BZ2_decompress() local
179 nblock = s->save_nblock; in BZ2_decompress()
378 nblock = 0; in BZ2_decompress()
410 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
411 s->ll16[nblock] = (UInt16)uc; in BZ2_decompress()
412 nblock++; in BZ2_decompress()
417 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
418 s->tt[nblock] = (UInt32)uc; in BZ2_decompress()
419 nblock++; in BZ2_decompress()
427 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
[all …]
Dbzlib.c120 s->nblock = 0; in prepare_new_block()
226 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
229 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
230 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
233 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
234 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
235 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
239 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
240 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
241 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
[all …]
Dcompress.c163 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
166 j = ptr[i]-1; if (j < 0) j += s->nblock; in generateMTFValues()
264 s->nblock, s->nMTF, s->nInUse ); in sendMTFValues()
604 if (s->nblock > 0) { in BZ2_compressBlock()
614 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock ); in BZ2_compressBlock()
619 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
630 if (s->nblock > 0) { in BZ2_compressBlock()
Dbzlib_private.h230 Int32 nblock; member
/third_party/boost/tools/boost_install/test/iostreams/bzip2-1.0.8/
Dblocksort.c215 Int32 nblock, in fallbackSort() argument
232 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; in fallbackSort()
236 for (i = 0; i < nblock; i++) { in fallbackSort()
243 nBhtab = 2 + (nblock / 32); in fallbackSort()
255 SET_BH(nblock + 2*i); in fallbackSort()
256 CLEAR_BH(nblock + 2*i + 1); in fallbackSort()
267 for (i = 0; i < nblock; i++) { in fallbackSort()
269 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort()
285 if (l >= nblock) break; in fallbackSort()
292 if (r >= nblock) break; in fallbackSort()
[all …]
Ddecompress.c125 Int32 nblock; in BZ2_decompress() local
179 nblock = s->save_nblock; in BZ2_decompress()
378 nblock = 0; in BZ2_decompress()
410 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
411 s->ll16[nblock] = (UInt16)uc; in BZ2_decompress()
412 nblock++; in BZ2_decompress()
417 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
418 s->tt[nblock] = (UInt32)uc; in BZ2_decompress()
419 nblock++; in BZ2_decompress()
427 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
[all …]
Dbzlib.c120 s->nblock = 0; in prepare_new_block()
226 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
229 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
230 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
233 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
234 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
235 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
239 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
240 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
241 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
[all …]
Dcompress.c163 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
166 j = ptr[i]-1; if (j < 0) j += s->nblock; in generateMTFValues()
264 s->nblock, s->nMTF, s->nInUse ); in sendMTFValues()
604 if (s->nblock > 0) { in BZ2_compressBlock()
614 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock ); in BZ2_compressBlock()
619 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
630 if (s->nblock > 0) { in BZ2_compressBlock()
/third_party/boost/tools/boost_install/test/iostreams/bzip2-1.0.6/
Dblocksort.c215 Int32 nblock, in fallbackSort() argument
232 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; in fallbackSort()
236 for (i = 0; i < nblock; i++) { in fallbackSort()
243 nBhtab = 2 + (nblock / 32); in fallbackSort()
255 SET_BH(nblock + 2*i); in fallbackSort()
256 CLEAR_BH(nblock + 2*i + 1); in fallbackSort()
267 for (i = 0; i < nblock; i++) { in fallbackSort()
269 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort()
285 if (l >= nblock) break; in fallbackSort()
292 if (r >= nblock) break; in fallbackSort()
[all …]
Ddecompress.c125 Int32 nblock; in BZ2_decompress() local
179 nblock = s->save_nblock; in BZ2_decompress()
372 nblock = 0; in BZ2_decompress()
404 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
405 s->ll16[nblock] = (UInt16)uc; in BZ2_decompress()
406 nblock++; in BZ2_decompress()
411 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
412 s->tt[nblock] = (UInt32)uc; in BZ2_decompress()
413 nblock++; in BZ2_decompress()
421 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress()
[all …]
Dbzlib.c120 s->nblock = 0; in prepare_new_block()
226 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
229 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
230 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
233 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
234 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
235 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
239 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
240 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
241 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block()
[all …]
Dcompress.c163 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
166 j = ptr[i]-1; if (j < 0) j += s->nblock; in generateMTFValues()
264 s->nblock, s->nMTF, s->nInUse ); in sendMTFValues()
604 if (s->nblock > 0) { in BZ2_compressBlock()
614 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock ); in BZ2_compressBlock()
619 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
630 if (s->nblock > 0) { in BZ2_compressBlock()
/third_party/boost/boost/sort/flat_stable_sort/
Dflat_stable_sort.hpp116 size_t nblock = size_t(itx_last - itx_first); in divide() local
117 if (nblock < 5) in divide()
121 if ( nblock > 7) in divide()
125 size_t nblock1 = (nblock + 1) >> 1; in divide()
142 size_t nblock = size_t(itx_last - itx_first); in sort_small() local
143 assert(nblock > 0 and nblock < 5); in sort_small()
145 range_it rng_data = get_group_range(*itx_first, nblock); in sort_small()
147 if (nblock < 3) in sort_small()
157 size_t nblock1 = (nblock + 1) >> 1; in sort_small()
179 size_t nblock = size_t(itx_last - itx_first); in is_sorted_forward() local
[all …]
/third_party/boost/boost/sort/block_indirect_sort/blk_detail/
Dbackbone.hpp76 size_t nblock; member
121 (pos == (nblock - 1)) ? global_range.last : it1 + Block_size; in get_range()
186 nblock = (nelem + Block_size - 1) / Block_size; in backbone()
188 index.reserve (nblock + 1); in backbone()
190 for (size_t i = 0; i < nblock; ++i) index.emplace_back (block_pos (i)); in backbone()
193 (ntail == 0) ? last : (first + ((nblock - 1) * Block_size)); in backbone()
Dmerge_blocks.hpp205 if (vpos2.back().pos() == (bk.nblock - 1) in merge_blocks()
/third_party/boost/boost/sort/common/
Dmerge_block.hpp66 size_t nblock; member
107 nblock = (nelem + BLOCK_SIZE - 1) / BLOCK_SIZE; in merge_block()
109 index.reserve(nblock + 1); in merge_block()
111 for (size_t i = 0; i < nblock; ++i) in merge_block()
114 range_tail.first = first + ((nblock - 1) << LOG_BLOCK); in merge_block()
143 Iter_t it2 = (pos == (nblock - 1)) ? in get_range()
159 …Iter_t it2 = ((pos + nrange) == nblock)?global_range.last: global_range.first + ((pos + nrange) <<… in get_group_range()
173 return (pos == (nblock - 1) and ntail != 0); in is_tail()
317 if (ntail != 0 and indexB.back() == (nblock - 1)) // exist tail in merge_range_pos()
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
Dnir.c552 static ppir_block *ppir_get_block(ppir_compiler *comp, nir_block *nblock) in ppir_get_block() argument
554 ppir_block *block = _mesa_hash_table_u64_search(comp->blocks, (uintptr_t)nblock); in ppir_get_block()
620 static bool ppir_emit_block(ppir_compiler *comp, nir_block *nblock) in ppir_emit_block() argument
622 ppir_block *block = ppir_get_block(comp, nblock); in ppir_emit_block()
628 nir_foreach_instr(instr, nblock) { in ppir_emit_block()
674 nir_block *nblock = nir_if_last_else_block(if_stmt); in ppir_emit_if() local
675 assert(nblock->successors[0]); in ppir_emit_if()
676 assert(!nblock->successors[1]); in ppir_emit_if()
677 else_branch->target = ppir_get_block(comp, nblock->successors[0]); in ppir_emit_if()
894 nir_foreach_block(nblock, function->impl) { in ppir_compile_nir()
[all …]
/third_party/boost/boost/sort/block_indirect_sort/
Dblock_indirect_sort.hpp302 size_t nblock = pos_index2 - pos_index1; in split_range() local
310 if (nblock < Group_size) in split_range()
316 size_t pos_index_mid = pos_index1 + (nblock >> 1); in split_range()
336 Iter_t mid = first + ((nblock >> 1) * Block_size); in split_range()
368 split_range(0, bk.nblock, level_thread - 1); in start_function()
/third_party/f2fs-tools/fsck/
Ddir.c112 unsigned int nbucket, nblock; in find_in_level() local
127 nblock = bucket_blocks(level); in find_in_level()
130 end_block = bidx + nblock; in find_in_level()
225 int nbucket, nblock, bidx, block; in f2fs_add_link() local
261 nblock = bucket_blocks(level); in f2fs_add_link()
265 for (block = bidx; block <= (bidx + nblock - 1); block++) { in f2fs_add_link()
/third_party/mesa3d/src/freedreno/ir3/
Dir3_compiler_nir.c2816 const nir_block *nblock);
2822 if (!blk->nblock) { in read_phi_src()
2840 if (blk->nblock == nsrc->pred) { in read_phi_src()
2951 get_block(struct ir3_context *ctx, const nir_block *nblock) in get_block() argument
2956 hentry = _mesa_hash_table_search(ctx->block_ht, nblock); in get_block()
2961 block->nblock = nblock; in get_block()
2962 _mesa_hash_table_insert(ctx->block_ht, nblock, block); in get_block()
2968 get_block_or_continue(struct ir3_context *ctx, const nir_block *nblock) in get_block_or_continue() argument
2972 hentry = _mesa_hash_table_search(ctx->continue_block_ht, nblock); in get_block_or_continue()
2976 return get_block(ctx, nblock); in get_block_or_continue()
[all …]
/third_party/alsa-utils/alsaloop/
Dalsaloop.h103 unsigned int nblock:1; /* do block (period size) transfers */ member
Dalsaloop.c620 play->nblock = capt->nblock = arg_nblock ? 1 : 0; in parse_config()
/third_party/littlefs/
Dlfs.c2322 lfs_block_t nblock; in lfs_ctz_extend() local
2323 int err = lfs_alloc(lfs, &nblock); in lfs_ctz_extend()
2329 err = lfs_bd_erase(lfs, nblock); in lfs_ctz_extend()
2338 *block = nblock; in lfs_ctz_extend()
2360 nblock, i, &data, 1); in lfs_ctz_extend()
2369 *block = nblock; in lfs_ctz_extend()
2381 nblock, 4*i, &nhead, 4); in lfs_ctz_extend()
2401 *block = nblock; in lfs_ctz_extend()
2407 LFS_DEBUG("Bad block at 0x%"PRIx32, nblock); in lfs_ctz_extend()
2653 lfs_block_t nblock; local
[all …]
/third_party/ffmpeg/libavcodec/
Dshorten.c188 int nblock = FFMAX(1, s->nmean); in init_offset() local
205 for (i = 0; i < nblock; i++) in init_offset()

12