Lines Matching refs:mObjectsSize

474     size_t size = parcel->mObjectsSize;
524 if (mObjectsCapacity < mObjectsSize + numObjects) {
525 size_t newSize = ((mObjectsSize + numObjects)*3)/2;
526 if (newSize*sizeof(binder_size_t) < mObjectsSize) return NO_MEMORY; // overflow
537 int idx = mObjectsSize;
541 mObjectsSize++;
647 return mObjectsSize;
1308 const bool enoughObjects = mObjectsSize < mObjectsCapacity;
1324 mObjects[mObjectsSize] = mDataPos;
1326 mObjectsSize++;
1337 size_t newSize = ((mObjectsSize+2)*3)/2;
1338 if (newSize*sizeof(binder_size_t) < mObjectsSize) return NO_MEMORY; // overflow
1476 if (mObjectsSorted || mObjectsSize <= 1) {
1479 if (mNextObjectHint < mObjectsSize && upperBound > mObjects[mNextObjectHint]) {
1490 } while (nextObject < mObjectsSize && upperBound > mObjects[nextObject]);
1496 binder_size_t* currObj = mObjects + mObjectsSize - 1;
1511 // switch to std::sort(mObjects, mObjects + mObjectsSize);
1512 for (binder_size_t* iter0 = mObjects + 1; iter0 < mObjects + mObjectsSize; iter0++) {
1536 if (mObjectsSize > 0) {
1563 if (mObjectsSize > 0) {
1586 if (mObjectsSize > 0) {
2356 const size_t N = mObjectsSize;
2402 size_t i = mObjectsSize;
2434 return mObjectsSize;
2449 mObjectsSize = mObjectsCapacity = objectsCount;
2454 for (size_t i = 0; i < mObjectsSize; i++) {
2459 mObjectsSize = 0;
2496 size_t i = mObjectsSize;
2510 size_t i = mObjectsSize;
2532 mOwner(this, mData, mDataSize, mObjects, mObjectsSize, mOwnerCookie);
2608 mObjectsSize = mObjectsCapacity = 0;
2628 size_t objectsSize = mObjectsSize;
2668 size_t oldObjectsSize = mObjectsSize;
2669 mObjectsSize = objectsSize;
2671 mObjectsSize = oldObjectsSize;
2681 mOwner(this, mData, mDataSize, mObjects, mObjectsSize, mOwnerCookie);
2695 mObjectsSize = mObjectsCapacity = objectsSize;
2700 if (objectsSize < mObjectsSize) {
2703 for (size_t i=objectsSize; i<mObjectsSize; i++) {
2717 mObjectsSize = objectsSize;
2789 mObjectsSize = 0;
2815 for (size_t i=0; i<mObjectsSize; i++) {