/external/u-boot/lib/bzip2/ |
D | bzlib_blocksort.c | 255 Int32 nblock, in fallbackSort() argument 272 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; in fallbackSort() 276 for (i = 0; i < nblock; i++) { in fallbackSort() 283 nBhtab = 2 + (nblock / 32); in fallbackSort() 295 SET_BH(nblock + 2*i); in fallbackSort() 296 CLEAR_BH(nblock + 2*i + 1); in fallbackSort() 307 for (i = 0; i < nblock; i++) { in fallbackSort() 309 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort() 325 if (l >= nblock) break; in fallbackSort() 332 if (r >= nblock) break; in fallbackSort() [all …]
|
D | bzlib.c | 172 s->nblock = 0; in prepare_new_block() 277 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 280 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 281 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 284 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 285 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 286 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 290 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 291 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() 292 s->block[s->nblock] = (UChar)ch; s->nblock++; in add_pair_to_block() [all …]
|
D | bzlib_decompress.c | 168 Int32 nblock; in BZ2_decompress() local 222 nblock = s->save_nblock; in BZ2_decompress() 415 nblock = 0; in BZ2_decompress() 443 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() 444 s->ll16[nblock] = (UInt16)uc; in BZ2_decompress() 445 nblock++; in BZ2_decompress() 450 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() 451 s->tt[nblock] = (UInt32)uc; in BZ2_decompress() 452 nblock++; in BZ2_decompress() 460 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() [all …]
|
D | bzlib_compress.c | 203 for (i = 0; i < s->nblock; i++) { in generateMTFValues() 206 j = ptr[i]-1; if (j < 0) j += s->nblock; in generateMTFValues() 305 s->nblock, s->nMTF, s->nInUse ); in sendMTFValues() 645 if (s->nblock > 0) { in BZ2_compressBlock() 655 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock ); in BZ2_compressBlock() 660 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock() 671 if (s->nblock > 0) { in BZ2_compressBlock()
|
D | bzlib_private.h | 262 Int32 nblock; member
|
/external/bzip2/ |
D | blocksort.c | 215 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 …]
|
D | decompress.c | 125 Int32 nblock; in BZ2_decompress() local 179 nblock = s->save_nblock; in BZ2_decompress() 373 nblock = 0; in BZ2_decompress() 405 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() 406 s->ll16[nblock] = (UInt16)uc; in BZ2_decompress() 407 nblock++; in BZ2_decompress() 412 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() 413 s->tt[nblock] = (UInt32)uc; in BZ2_decompress() 414 nblock++; in BZ2_decompress() 422 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); in BZ2_decompress() [all …]
|
D | bzlib.c | 120 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 …]
|
D | compress.c | 163 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()
|
D | bzlib_private.h | 230 Int32 nblock; member
|
/external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/bzip2/ |
D | BlockSort.java | 473 final void fallbackSort(final int[] fmap, final byte[] block, final int nblock) { in fallbackSort() argument 480 for (i = 0; i < nblock; i++) { in fallbackSort() 487 for (i = 0; i < nblock; i++) { in fallbackSort() 494 for (i = 0; i < nblock; i++) { in fallbackSort() 501 nBhtab = 64 + nblock; in fallbackSort() 515 bhtab.set(nblock + 2 * i); in fallbackSort() 516 bhtab.clear(nblock + 2 * i + 1); in fallbackSort() 524 for (i = 0; i < nblock; i++) { in fallbackSort() 530 k += nblock; in fallbackSort() 543 if (l >= nblock) { in fallbackSort() [all …]
|
/external/f2fs-tools/fsck/ |
D | dir.c | 112 unsigned int nbucket, nblock; in find_in_level() local 126 nblock = bucket_blocks(level); in find_in_level() 129 end_block = bidx + nblock; in find_in_level() 224 int nbucket, nblock, bidx, block; in f2fs_add_link() local 258 nblock = bucket_blocks(level); in f2fs_add_link() 262 for (block = bidx; block <= (bidx + nblock - 1); block++) { in f2fs_add_link()
|
D | fsck.c | 1297 unsigned int nbucket, nblock; in f2fs_check_dirent_position() local 1304 nblock = bucket_blocks(level); in f2fs_check_dirent_position() 1308 end_block = bidx + nblock; in f2fs_check_dirent_position()
|
/external/u-boot/arch/arm/mach-exynos/ |
D | spl_boot.c | 187 u32 (*copy_bl2)(u32 offset, u32 nblock, u32 dst) = NULL; in copy_uboot_to_ram() 193 u32 (*copy_bl2_from_emmc)(u32 nblock, u32 dst); in copy_uboot_to_ram()
|
/external/eigen/bench/ |
D | benchmark-blocking-sizes.cpp | 577 for (size_t nblock = minsize; nblock <= nsize; nblock *= 2) { in run() local 578 benchmarks.emplace_back(ksize, msize, nsize, kblock, mblock, nblock); in run()
|
/external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
D | ir3_compiler_nir.c | 141 static struct ir3_block * get_block(struct ir3_context *ctx, nir_block *nblock); 2672 get_block(struct ir3_context *ctx, nir_block *nblock) in get_block() argument 2676 entry = _mesa_hash_table_search(ctx->block_ht, nblock); in get_block() 2681 block->nblock = nblock; in get_block() 2682 _mesa_hash_table_insert(ctx->block_ht, nblock, block); in get_block() 2688 emit_block(struct ir3_context *ctx, nir_block *nblock) in emit_block() argument 2690 struct ir3_block *block = get_block(ctx, nblock); in emit_block() 2693 if (nblock->successors[i]) { in emit_block() 2695 get_block(ctx, nblock->successors[i]); in emit_block() 2708 nir_foreach_instr(instr, nblock) { in emit_block()
|
D | ir3.h | 476 nir_block *nblock; member
|
/external/clang/test/CodeGenObjC/ |
D | arc-blocks.m | 476 @property (nonatomic, strong) void(^nblock)(void); 479 @synthesize ablock, nblock; 486 // CHECK: define internal void ()* @"\01-[Test12 nblock]"(
|
/external/e2fsprogs/e2fsck/ |
D | pass1.c | 3419 unsigned nblock = inode->i_size >> EXT2_BLOCK_SIZE_BITS(fs->super); in check_blocks() local 3439 else if (nblock > (pb.last_block + 1)) in check_blocks() 3441 else if (nblock < (pb.last_block + 1)) { in check_blocks() 3442 if (((pb.last_block + 1) - nblock) > in check_blocks()
|
/external/e2fsprogs/po/ |
D | sv.po | 175 msgstr "%s: %s filnamn nblock blockstorlek\n"
|
/external/jarjar/lib/ |
D | apache-ant-1.9.4.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/apache/
org/ ... |