Search

Home

Sort by

Searched defs:nblock (Results 1 - 11 of 11) sorted by relevance

/external/bzip2/
H A D	decompress.c	`125 Int32 nblock; local 179 nblock = s->save_nblock; 372 nblock = 0; 404 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 405 s->ll16[nblock] = (UInt16)uc; 406 nblock++; 411 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 412 s->tt[nblock] = (UInt32)uc; 413 nblock++; 421 if (nblock > [all...]`
H A D	blocksort.c	193 nblock > 0 194 eclass exists for [0 .. nblock-1] 195 ((UChar)eclass) [0 .. nblock-1] holds block 196 ptr exists for [0 .. nblock-1] 199 ((UChar)eclass) [0 .. nblock-1] holds block 201 fmap [0 .. nblock-1] holds sorted order 202 bhtab [ 0 .. 2+(nblock/32) ] destroyed 215 Int32 nblock, 232 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; 236 for (i = 0; i < nblock; 212 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 347 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 485 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 621 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 751 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 1036 Int32 nblock = s->nblock; local [all...]
H A D	bzlib_private.h	`230 Int32 nblock; member in struct:__anon1464`
/external/qemu/
H A D	arch_init.c	`233 RAMBlock block, nblock, **blocks; local 241 QLIST_FOREACH_SAFE(block, &ram_list.blocks, next, nblock) {`
/external/e2fsprogs/e2fsck/
H A D	pass1.c	`1980 int nblock = inode->i_size >> EXT2_BLOCK_SIZE_BITS(fs->super); local 1983 else if (nblock > (pb.last_block + 1)) 1985 else if (nblock < (pb.last_block + 1)) { 1986 if (((pb.last_block + 1) - nblock) >`
/external/valgrind/main/VEX/switchback/
H A D	test_bzip2.c	596 Int32 nblock; member in struct:__anon13455 1475 Int32 nblock; local 1529 nblock = s->save_nblock; 1722 nblock = 0; 1747 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1748 s->ll16[nblock] = (UInt16)uc; 1749 nblock++; 1754 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1755 s->tt[nblock] = (UInt32)uc; 1756 nblock 2234 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2369 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2507 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2643 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2773 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 3058 Int32 nblock = s->nblock; local [all...]
/external/valgrind/main/exp-sgcheck/tests/
H A D	hackedbz2.c	619 Int32 nblock; member in struct:__anon13909 1499 Int32 nblock; local 1553 nblock = s->save_nblock; 1746 nblock = 0; 1771 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1772 s->ll16[nblock] = (UInt16)uc; 1773 nblock++; 1778 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1779 s->tt[nblock] = (UInt32)uc; 1780 nblock 2258 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2393 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2531 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2667 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2797 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 3082 Int32 nblock = s->nblock; local [all...]
/external/valgrind/main/memcheck/tests/
H A D	origin5-bz2.c	612 Int32 nblock; member in struct:__anon14102 1490 Int32 nblock; local 1544 nblock = s->save_nblock; 1737 nblock = 0; 1762 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1763 s->ll16[nblock] = (UInt16)uc; 1764 nblock++; 1769 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1770 s->tt[nblock] = (UInt32)uc; 1771 nblock 2249 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2384 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2522 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2658 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2788 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 3073 Int32 nblock = s->nblock; local [all...]
H A D	varinfo6.c	650 Int32 nblock; member in struct:__anon14132 1528 Int32 nblock; local 1582 nblock = s->save_nblock; 1776 nblock = 0; 1801 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1802 s->ll16[nblock] = (UInt16)uc; 1803 nblock++; 1808 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1809 s->tt[nblock] = (UInt32)uc; 1810 nblock 2287 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2421 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2559 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2694 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2824 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 3111 Int32 nblock = s->nblock; local [all...]
/external/valgrind/main/perf/
H A D	bz2.c	612 Int32 nblock; member in struct:__anon14220 1490 Int32 nblock; local 1544 nblock = s->save_nblock; 1737 nblock = 0; 1762 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1763 s->ll16[nblock] = (UInt16)uc; 1764 nblock++; 1769 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); 1770 s->tt[nblock] = (UInt32)uc; 1771 nblock 2249 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2384 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2522 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2658 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2788 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 3073 Int32 nblock = s->nblock; local [all...]
H A D	test_input_for_tinycc.c	1040 Int32 nblock; member in struct:__anon14233 1447 Int32 nblock; local 1501 nblock = s->save_nblock; 1694 nblock = 0; 1719 if (nblock >= nblockMAX) { retVal = (-4); goto save_state_and_return; };; 1720 s->ll16[nblock] = (UInt16)uc; 1721 nblock++; 1726 if (nblock >= nblockMAX) { retVal = (-4); goto save_state_and_return; };; 1727 s->tt[nblock] = (UInt32)uc; 1728 nblock 2060 fallbackSort( UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb ) argument 2174 mainGtU( UInt32 i1, UInt32 i2, UChar* block, UInt16* quadrant, UInt32 nblock, Int32* budget ) argument 2304 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument 2390 mainQSort3( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 loSt, Int32 hiSt, Int32 dSt, Int32* budget ) argument 2489 mainSort( UInt32* ptr, UChar* block, UInt16* quadrant, UInt32* ftab, Int32 nblock, Int32 verb, Int32* budget ) argument 2695 Int32 nblock = s->nblock; local [all...]

Completed in 293 milliseconds