Searched defs:newpos (Results 1 - 12 of 12) sorted by relevance
/external/chromium_org/ppapi/native_client/src/trusted/plugin/ |
H A D | temporary_file.cc | 106 nacl_off64_t newpos = read_wrapper_->Seek(0, SEEK_SET); local 107 return newpos >= 0;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
H A D | pagemap_unittest.cc | 53 const size_t newpos = rand() % (i + 1); local 55 (*elements)[i] = (*elements)[newpos]; 56 (*elements)[newpos] = tmp;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
H A D | pagemap_unittest.cc | 53 const size_t newpos = rand() % (i + 1); local 55 (*elements)[i] = (*elements)[newpos]; 56 (*elements)[newpos] = tmp;
|
/external/stlport/test/unit/ |
H A D | rope_test.cpp | 175 int newpos = pos; local 179 CPPUNIT_ASSERT(*i == expected[newpos]); 181 ++newpos;
|
/external/bsdiff/ |
H A D | bspatch.c | 68 off_t oldpos,newpos; local 144 oldpos=0;newpos=0; 145 while(newpos<newsize) { 156 if(newpos+ctrl[0]>newsize) 160 lenread = BZ2_bzRead(&dbz2err, dpfbz2, new + newpos, ctrl[0]); 168 new[newpos+i]+=old[oldpos+i]; 171 newpos+=ctrl[0]; 175 if(newpos+ctrl[1]>newsize) 179 lenread = BZ2_bzRead(&ebz2err, epfbz2, new + newpos, ctrl[1]); 185 newpos [all...] |
/external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
H A D | goobspatch.c | 375 off_t oldpos,newpos; local 464 oldpos=0;newpos=0; 465 while(newpos<newsize) { 473 if(newpos+ctrl[0]>newsize) 477 cfread(&df, new + newpos, ctrl[0]); 482 new[newpos+i]+=old[oldpos+i]; 485 newpos+=ctrl[0]; 489 if(newpos+ctrl[1]>newsize) 493 cfread(&ef, new + newpos, ctrl[1]); 496 newpos [all...] |
/external/chromium_org/third_party/icu/source/tools/genrb/ |
H A D | reslist.h | 37 int32_t oldpos, newpos; member in struct:KeyMapEntry
|
H A D | reslist.c | 200 return map[start].newpos; 1468 return compareInt32(((const KeyMapEntry *)l)->newpos, ((const KeyMapEntry *)r)->newpos); 1494 map[i].newpos = 0; 1501 map[i].newpos = 0; 1523 map[i].newpos = map[i].oldpos; 1545 map[j].newpos = map[i].oldpos + offset; /* yes, point to the earlier key */ 1556 * Re-sort by newpos, then modify the key characters array in-place 1557 * to squeeze out unused bytes, and readjust the newpos offsets. 1562 int32_t oldpos, newpos, limi local [all...] |
/external/icu4c/tools/genrb/ |
H A D | reslist.h | 37 int32_t oldpos, newpos; member in struct:KeyMapEntry
|
H A D | reslist.c | 202 return map[start].newpos; 1474 return compareInt32(((const KeyMapEntry *)l)->newpos, ((const KeyMapEntry *)r)->newpos); 1500 map[i].newpos = 0; 1507 map[i].newpos = 0; 1529 map[i].newpos = map[i].oldpos; 1551 map[j].newpos = map[i].oldpos + offset; /* yes, point to the earlier key */ 1562 * Re-sort by newpos, then modify the key characters array in-place 1563 * to squeeze out unused bytes, and readjust the newpos offsets. 1568 int32_t oldpos, newpos, limi local [all...] |
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | IncompleteLUT.h | 365 int newpos; local 368 newpos = ii + sizeu; 374 newpos = sizel; 378 ju(newpos) = j; 379 u(newpos) = -prod; 380 jr(j) = newpos;
|
/external/qemu/distrib/sdl-1.2.15/src/file/ |
H A D | SDL_rwops.c | 369 Uint8 *newpos; local 373 newpos = context->hidden.mem.base+offset; 376 newpos = context->hidden.mem.here+offset; 379 newpos = context->hidden.mem.stop+offset; 385 if ( newpos < context->hidden.mem.base ) { 386 newpos = context->hidden.mem.base; 388 if ( newpos > context->hidden.mem.stop ) { 389 newpos = context->hidden.mem.stop; 391 context->hidden.mem.here = newpos;
|
Completed in 1452 milliseconds