/external/e2fsprogs/tests/progs/ |
test_icount_cmds.ct | 8 # Icount table commands 10 request do_create_icount, "Create an icount structure", 13 request do_free_icount, "Free an icount structure", 16 request do_fetch, "Fetch an icount entry", 19 request do_increment, "Increment an icount entry", 22 request do_decrement, "Decrement an icount entry", 25 request do_store, "Store an icount entry", 28 request do_get_size, "Get the size of the icount structure", 31 request do_dump, "Dump the icount structure", 34 request do_validate, "Validate the icount structure" [all...] |
test_icount.c | 37 * Helper function which assures that the icount structure is valid 43 com_err(request, 0, "The icount structure must be allocated."); 78 if (parse_inode(progname, "icount size", argv[0], &size)) 83 printf("Creating icount... flags=%d, size=%d\n", flags, (int) size); 88 com_err(progname, retval, "while creating icount"); 214 "while fetching icount for %lu", (unsigned long)i); 230 com_err(argv[0], retval, "while validating icount structure"); 233 printf("Icount structure successfully validated\n"); 243 printf("Size of icount is: %lu\n", (unsigned long)size);
|
/external/e2fsprogs/lib/ext2fs/ |
icount.c | 2 * icount.c --- an efficient inode count abstraction 26 * The data storage strategy used by icount relies on the observation 31 * Also, e2fsck tends to load the icount data sequentially. 72 void ext2fs_free_icount(ext2_icount_t icount) 74 if (!icount) 77 icount->magic = 0; 78 if (icount->list) 79 ext2fs_free_mem(&icount->list); 80 if (icount->single) 81 ext2fs_free_inode_bitmap(icount->single) 96 ext2_icount_t icount; local 179 ext2_icount_t icount; local 228 ext2_icount_t icount; local 648 ext2_icount_t icount; variable 754 ext2_icount_t icount; local [all...] |
Makefile.pq | 27 icount.obj \
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
draw_pt_vsplit_tmp.h | 38 unsigned istart, unsigned icount) 53 if (icount > vsplit->max_vertices) 56 for (i = 0; i < icount; i++) { 66 if (icount > vsplit->segment_size) 71 if (max_index - min_index > icount - 1) 88 for (i = 0; i < icount; i++) { 98 for (i = 0; i < icount; i++) { 113 draw_elts, icount, 0x0); 125 unsigned istart, unsigned icount, 134 assert(icount + !!close <= vsplit->segment_size) [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_pt_vsplit_tmp.h | 38 unsigned istart, unsigned icount) 53 if (icount > vsplit->max_vertices) 56 for (i = 0; i < icount; i++) { 66 if (icount > vsplit->segment_size) 71 if (max_index - min_index > icount - 1) 88 for (i = 0; i < icount; i++) { 98 for (i = 0; i < icount; i++) { 113 draw_elts, icount, 0x0); 125 unsigned istart, unsigned icount, 134 assert(icount + !!close <= vsplit->segment_size) [all...] |
/external/pdfium/core/include/fxcrt/ |
fx_ext.h | 71 void FX_Random_GenerateBase(FX_LPDWORD pBuffer, FX_INT32 iCount);
73 void FX_Random_GenerateMT(FX_LPDWORD pBuffer, FX_INT32 iCount);
75 void FX_Random_GenerateCrypto(FX_LPDWORD pBuffer, FX_INT32 iCount);
83 void ShellSort(baseType *pArray, FX_INT32 iCount)
85 FXSYS_assert(pArray != NULL && iCount > 0);
88 gap = iCount >> 1;
90 for (i = gap; i < iCount; i ++) {
|
fx_arb.h | 17 virtual FX_INT32 GetBidiInfo(FX_INT32 &iStart, FX_INT32 &iCount) = 0;
|
/external/pdfium/core/src/fxcrt/ |
fx_arabic.h | 23 virtual FX_INT32 GetBidiInfo(FX_INT32 &iStart, FX_INT32 &iCount);
|
fx_arabic.cpp | 72 FX_INT32 CFX_BidiChar::GetBidiInfo(FX_INT32 &iStart, FX_INT32 &iCount) 75 iCount = m_iLastCount;
|
fx_extension.cpp | 343 void FX_Random_GenerateMT(FX_LPDWORD pBuffer, FX_INT32 iCount)
354 while (iCount -- > 0) {
359 void FX_Random_GenerateBase(FX_LPDWORD pBuffer, FX_INT32 iCount)
375 while (iCount -- > 0) {
380 FX_BOOL FX_GenerateCryptoRandom(FX_LPDWORD pBuffer, FX_INT32 iCount)
386 ::CryptGenRandom(hCP, iCount * sizeof(FX_DWORD), (FX_LPBYTE)pBuffer);
391 void FX_Random_GenerateCrypto(FX_LPDWORD pBuffer, FX_INT32 iCount)
394 FX_GenerateCryptoRandom(pBuffer, iCount);
396 FX_Random_GenerateBase(pBuffer, iCount);
|
extension.h | 373 FX_INT32 iCount = m_Blocks.GetSize();
382 m_Blocks.SetAt(iCount ++, pBlock);
408 FX_BOOL FX_GenerateCryptoRandom(FX_LPDWORD pBuffer, FX_INT32 iCount);
|
/external/pdfium/core/src/fpdfdoc/ |
doc_formfield.cpp | 112 int iCount = CountControls();
113 if (iCount) {
115 for(int i = 0; i < iCount; i++) {
119 for (int i = 0; i < iCount; i ++) {
221 int iCount = m_ControlList.GetSize();
222 for (int i = 0; i < iCount; i ++) {
423 int iCount = m_ControlList.GetSize();
424 for (int i = 0; i < iCount; i ++) {
622 int iCount = CountOptions();
623 for (int i = 0; i < iCount; i ++) { [all...] |
doc_ocg.cpp | 67 FX_INT32 iCount = pConfigs->GetCount();
68 for (FX_INT32 i = 0; i < iCount; i ++) {
127 FX_INT32 iCount = pArray->GetCount();
128 for (FX_INT32 i = 0; i < iCount; i ++) {
198 FX_INT32 iCount = pExpression->GetCount();
216 for (FX_INT32 i = 1; i < iCount; i ++) {
263 FX_INT32 iCount = ((CPDF_Array*)pOCGObj)->GetCount();
264 for (FX_INT32 i = 0; i < iCount; i ++) {
|
/external/e2fsprogs/tests/progs/test_data/ |
expect.icount | 2 Icount structure successfully validated 20 Icount structure successfully validated 59 Size of icount is: 5 148 Size of icount is: 105 150 Icount structure successfully validated 191 Size of icount is: 105 193 Icount structure successfully validated
|
/external/e2fsprogs/tests/defaults/ |
e_script | 25 elif [ "$class" = icount ]; then
|
/external/pdfium/core/src/fpdfapi/fpdf_edit/ |
fpdf_edit_content.cpp | 130 int iCount = pArray->GetCount();
131 CPDF_StreamAcc** pContentArray = (CPDF_StreamAcc**)FX_Alloc(CPDF_StreamAcc*, iCount);
134 for (i = 0; i < iCount; ++i) {
146 for (i = 0; i < iCount; ++i) {
|
/external/chromium_org/third_party/skia/tests/ |
DataRefTest.cpp | 53 int icount = SK_ARRAY_COUNT(idata); local 56 icount)); 57 REPORTER_ASSERT(reporter, itable->count() == icount); 58 for (int i = 0; i < icount; ++i) {
|
/external/qemu/ |
cpus.c | 300 int64_t icount; 303 icount = qemu_icount; 308 icount -= (env->icount_decr.u16.low + env->icount_extra); 310 return qemu_icount_bias + (icount << icount_time_shift);
|
/external/skia/tests/ |
DataRefTest.cpp | 53 int icount = SK_ARRAY_COUNT(idata); local 56 icount)); 57 REPORTER_ASSERT(reporter, itable->count() == icount); 58 for (int i = 0; i < icount; ++i) {
|
/external/chromium_org/third_party/skia/experimental/StrokePathRenderer/ |
GrStrokePathRenderer.cpp | 120 int vCount = 0, iCount = 0; 231 iCount += 3; 259 iCount += 6; 289 SkASSERT(iCount <= maxIndexCount); 296 iCount);
|
/external/skia/experimental/StrokePathRenderer/ |
GrStrokePathRenderer.cpp | 120 int vCount = 0, iCount = 0; 231 iCount += 3; 259 iCount += 6; 289 SkASSERT(iCount <= maxIndexCount); 296 iCount);
|
/external/chromium_org/third_party/skia/src/gpu/ |
GrAAConvexPathRenderer.cpp | 116 int* iCount) { 129 *iCount = 0; 146 *iCount += 9; 149 *iCount += 12; 163 *iCount += 6; 273 int* iCount, 323 compute_vectors(segments, fanPt, dir, vCount, iCount); 657 int iCount; 668 if (!get_segments(*path, viewMatrix, &segments, &fanPt, &vCount, &iCount, &devBounds)) { 681 GrDrawTarget::AutoReleaseGeometry arg(target, vCount, iCount); [all...] |
/external/skia/src/gpu/ |
GrAAConvexPathRenderer.cpp | 116 int* iCount) { 129 *iCount = 0; 146 *iCount += 9; 149 *iCount += 12; 163 *iCount += 6; 273 int* iCount, 323 compute_vectors(segments, fanPt, dir, vCount, iCount); 657 int iCount; 668 if (!get_segments(*path, viewMatrix, &segments, &fanPt, &vCount, &iCount, &devBounds)) { 681 GrDrawTarget::AutoReleaseGeometry arg(target, vCount, iCount); [all...] |
/external/chromium_org/third_party/sqlite/src/test/ |
threadtest1.c | 50 static int db_is_locked(void *NotUsed, int iCount){ 52 if( verbose ) printf("BUSY %s #%d\n", (char*)NotUsed, iCount); 54 return iCount<25;
|