HomeSort by relevance Sort by last modified time
    Searched refs:newSize (Results 51 - 75 of 287) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/mesa3d/src/mesa/main/
imports.c 193 _mesa_align_realloc(void *oldBuffer, size_t oldSize, size_t newSize,
198 return _aligned_realloc(oldBuffer, newSize, alignment);
200 const size_t copySize = (oldSize < newSize) ? oldSize : newSize;
201 void *newBuf = _mesa_align_malloc(newSize, alignment);
215 _mesa_realloc(void *oldBuffer, size_t oldSize, size_t newSize)
217 const size_t copySize = (oldSize < newSize) ? oldSize : newSize;
218 void *newBuffer = malloc(newSize);
  /libcore/luni/src/main/java/java/util/
ComparableTimSort.java     [all...]
TimSort.java     [all...]
  /dalvik/dexgen/src/com/android/dexgen/util/
IntList.java 322 * @param newSize {@code >= 0;} the new size
324 public void shrink(int newSize) {
325 if (newSize < 0) {
326 throw new IllegalArgumentException("newSize < 0");
329 if (newSize > size) {
330 throw new IllegalArgumentException("newSize > size");
335 size = newSize;
  /dalvik/dx/src/com/android/dx/util/
IntList.java 322 * @param newSize {@code >= 0;} the new size
324 public void shrink(int newSize) {
325 if (newSize < 0) {
326 throw new IllegalArgumentException("newSize < 0");
329 if (newSize > size) {
330 throw new IllegalArgumentException("newSize > size");
335 size = newSize;
  /dalvik/vm/
LinearAlloc.h 69 void* dvmLinearRealloc(Object* classLoader, void* mem, size_t newSize);
BitVector.cpp 112 unsigned int newSize = (num + 1 + 31) >> 5;
113 assert(newSize > pBits->storageSize);
114 pBits->storage = (u4*)realloc(pBits->storage, newSize * sizeof(u4));
116 ALOGE("BitVector expansion to %d failed", newSize * sizeof(u4));
120 (newSize - pBits->storageSize) * sizeof(u4));
121 pBits->storageSize = newSize;
  /external/chromium_org/third_party/WebKit/public/web/
WebWidgetClient.h 59 virtual void didAutoResize(const WebSize& newSize) { }
  /external/dexmaker/src/dx/java/com/android/dx/util/
IntList.java 322 * @param newSize {@code >= 0;} the new size
324 public void shrink(int newSize) {
325 if (newSize < 0) {
326 throw new IllegalArgumentException("newSize < 0");
329 if (newSize > size) {
330 throw new IllegalArgumentException("newSize > size");
335 size = newSize;
  /external/lzma/CPP/7zip/UI/Common/
IFileExtractCallback.h 27 const wchar_t *newName, const FILETIME *newTime, const UInt64 *newSize,
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowCameraParameters.java 154 Camera.Size newSize = Robolectric.newInstanceOf(Camera.class).new Size(0, 0);
155 newSize.width = width;
156 newSize.height = height;
157 sizes.add(newSize);
  /frameworks/base/graphics/java/android/graphics/drawable/
LevelListDrawable.java 201 public void growArray(int oldSize, int newSize) {
202 super.growArray(oldSize, newSize);
203 int[] newInts = new int[newSize];
206 newInts = new int[newSize];
  /system/core/libpixelflinger/codeflinger/
CodeCache.cpp 141 ssize_t Assembly::resize(size_t newSize)
143 mBase = (uint32_t*)mspace_realloc(getMspace(), mBase, newSize);
146 "of size %zd", newSize, kMaxCodeCacheCapacity);
147 mSize = newSize;
  /external/lzma/CPP/Windows/
FileFind.cpp 401 UINT32 newSize = GetLogicalDriveStrings(size, buffer.GetBuffer(size));
402 if (newSize == 0)
404 if (newSize > size)
407 for (UINT32 i = 0; i < newSize; i++)
433 UINT32 newSize = GetLogicalDriveStringsW(size, buffer.GetBuffer(size));
434 if (newSize == 0)
436 if (newSize > size)
439 for (UINT32 i = 0; i < newSize; i++)
  /external/chromium_org/third_party/WebKit/Source/web/
WebPagePopupImpl.cpp 248 void WebPagePopupImpl::resize(const WebSize& newSize)
250 m_windowRectInScreen = WebRect(m_windowRectInScreen.x, m_windowRectInScreen.y, newSize.width, newSize.height);
254 m_page->mainFrame()->view()->resize(newSize);
255 m_widgetClient->didInvalidateRect(WebRect(0, 0, newSize.width, newSize.height));
  /external/chromium_org/third_party/icu/source/common/
uvectr32.cpp 268 * Change the size of this vector as follows: If newSize is smaller,
270 * newSize. If newSize is larger, grow the array, filling in new
273 void UVector32::setSize(int32_t newSize) {
275 if (newSize < 0) {
278 if (newSize > count) {
280 if (!ensureCapacity(newSize, ec)) {
283 for (i=count; i<newSize; ++i) {
287 count = newSize;
  /external/icu4c/common/
uvectr32.cpp 268 * Change the size of this vector as follows: If newSize is smaller,
270 * newSize. If newSize is larger, grow the array, filling in new
273 void UVector32::setSize(int32_t newSize) {
275 if (newSize < 0) {
278 if (newSize > count) {
280 if (!ensureCapacity(newSize, ec)) {
283 for (i=count; i<newSize; ++i) {
287 count = newSize;
  /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
SparseWeakArray.java 145 int newSize = ArrayUtils.idealIntArraySize(mSize);
146 if (newSize < mKeys.length) {
147 int[] nkeys = new int[newSize];
148 WeakReference<?>[] nvalues = new WeakReference[newSize];
150 System.arraycopy(mKeys, 0, nkeys, 0, newSize);
151 System.arraycopy(mValues, 0, nvalues, 0, newSize);
  /external/chromium_org/third_party/skia/include/core/
SkPathRef.h 329 size_t newSize = sizeof(uint8_t) * verbCount + sizeof(SkPoint) * pointCount;
331 size_t minSize = newSize + newReserve;
345 fFreeSpace -= newSize;
390 size_t newSize = oldSize + growSize;
393 fPoints = reinterpret_cast<SkPoint*>(sk_realloc_throw(fPoints, newSize));
396 reinterpret_cast<intptr_t>(fPoints) + newSize - oldVerbSize);
400 fVerbs = reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(fPoints) + newSize);
  /external/skia/include/core/
SkPathRef.h 329 size_t newSize = sizeof(uint8_t) * verbCount + sizeof(SkPoint) * pointCount;
331 size_t minSize = newSize + newReserve;
345 fFreeSpace -= newSize;
390 size_t newSize = oldSize + growSize;
393 fPoints = reinterpret_cast<SkPoint*>(sk_realloc_throw(fPoints, newSize));
396 reinterpret_cast<intptr_t>(fPoints) + newSize - oldVerbSize);
400 fVerbs = reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(fPoints) + newSize);
  /bootable/recovery/minzip/
Hash.c 137 static bool resizeHash(HashTable* pHashTable, int newSize)
145 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable));
156 newIdx = hashValue & (newSize-1);
158 newIdx = (newIdx + 1) & (newSize-1);
167 pHashTable->tableSize = newSize;
  /external/chromium_org/third_party/icu/source/i18n/
sortkey.cpp 304 CollationKey::ensureCapacity(int32_t newSize)
306 if (fCapacity < newSize)
310 fBytes = (uint8_t *)uprv_malloc(newSize);
318 fCapacity = newSize;
322 fCount = newSize;
  /external/jmonkeyengine/engine/src/core/com/jme3/animation/
CompactArray.java 149 int newSize = indexPool.size() * getTupleSize();
150 if (array == null || Array.getLength(array) < newSize) {
151 array = ensureCapacity(array, newSize);
  /external/chromium_org/third_party/WebKit/Source/wtf/text/
StringBuilder.cpp 76 void StringBuilder::resize(unsigned newSize)
78 // Check newSize < m_length, hence m_length > 0.
79 ASSERT(newSize <= m_length);
80 if (newSize == m_length)
93 m_length = newSize;
100 ASSERT(newSize < m_string.length());
101 m_length = newSize;
  /development/samples/training/threadsample/src/com/example/android/threadsample/
PhotoDownloadRunnable.java 259 int newSize = tempBuffer.length + READ_SIZE;
267 byte[] expandedBuffer = new byte[newSize];

Completed in 523 milliseconds

1 23 4 5 6 7 8 91011>>