HomeSort by relevance Sort by last modified time
    Searched full:newsize (Results 76 - 100 of 374) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/e2fsprogs/resize/
extent.c 84 int newsize; local
88 newsize = extent->size + 100;
92 newsize, &extent->list);
95 extent->size = newsize;
  /external/freetype/src/cff/
cf2arrst.c 104 FT_Long newSize = (FT_Long)( numElements * arrstack->sizeItem );
111 FT_ASSERT( newSize > 0 ); /* avoid realloc with zero size */
113 if ( !FT_REALLOC( arrstack->ptr, arrstack->totalSize, newSize ) )
116 arrstack->totalSize = newSize;
  /external/lzma/CPP/7zip/
IStream.h 45 STDMETHOD(SetSize)(UInt64 newSize) PURE;
  /external/lzma/CPP/7zip/UI/Console/
ExtractCallbackConsole.h 34 const wchar_t *newName, const FILETIME *newTime, const UInt64 *newSize,
  /external/skia/src/images/
SkImageRef_ashmem.cpp 29 size_t newsize = (size + mask) & ~mask; local
30 // SkDebugf("---- oldsize %d newsize %d\n", size, newsize);
31 return newsize;
  /external/skia/src/views/mac/
SkNSView.h 42 - (void)resizeSkView:(NSSize)newSize;
  /external/smack/src/org/xbill/DNS/
DNSOutput.java 60 int newsize = array.length * 2; local
61 if (newsize < pos + n) {
62 newsize = pos + n;
64 byte [] newarray = new byte[newsize];
  /frameworks/base/core/java/android/util/
StateSet.java 143 public static int[] trimStateSet(int[] states, int newSize) {
144 if (states.length == newSize) {
148 int[] trimmedStates = new int[newSize];
149 System.arraycopy(states, 0, trimmedStates, 0, 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];
  /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;
  /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;
  /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/srec/portable/include/
pmemory.h 127 #define REALLOC(ptr, newSize) (prealloc(ptr, newSize, L(__FILE__), __LINE__))
132 #define REALLOC(ptr, newSize) (prealloc(ptr, newSize))
208 * @param newSize The new size required.
218 PORTABLE_API void *prealloc(void* ptr, size_t newSize, const LCHAR* file, int line);
220 PORTABLE_API void *prealloc(void* ptr, size_t newSize);
  /external/chromium_org/third_party/icu/source/common/
uvector.cpp 360 * Change the size of this vector as follows: If newSize is smaller,
362 * newSize. If newSize is larger, grow the array, filling in new
365 void UVector::setSize(int32_t newSize, UErrorCode &status) {
367 if (newSize < 0) {
370 if (newSize > count) {
371 if (!ensureCapacity(newSize, status)) {
377 for (i=count; i<newSize; ++i) {
382 for (i=count-1; i>=newSize; --i) {
386 count = newSize;
    [all...]
  /external/icu4c/common/
uvector.cpp 361 * Change the size of this vector as follows: If newSize is smaller,
363 * newSize. If newSize is larger, grow the array, filling in new
366 void UVector::setSize(int32_t newSize, UErrorCode &status) {
368 if (newSize < 0) {
371 if (newSize > count) {
372 if (!ensureCapacity(newSize, status)) {
378 for (i=count; i<newSize; ++i) {
383 for (i=count-1; i>=newSize; --i) {
387 count = newSize;
    [all...]
  /external/chromium_org/courgette/third_party/
bsdiff_create.cc 154 matchlen(const unsigned char *old,int oldsize,const unsigned char *newbuf,int newsize)
158 for(i=0;(i<oldsize)&&(i<newsize);i++)
166 const unsigned char *newbuf,int newsize,int st,int en,int *pos)
171 x=matchlen(old+I[st],oldsize-I[st],newbuf,newsize);
172 y=matchlen(old+I[en],oldsize-I[en],newbuf,newsize);
184 if(memcmp(old+I[x],newbuf,std::min(oldsize-I[x],newsize))<0) {
185 return search(I,old,oldsize,newbuf,newsize,x,en,pos);
187 return search(I,old,oldsize,newbuf,newsize,st,x,pos);
245 const int newsize = static_cast<int>(new_stream->Remaining()); local
296 while (scan < newsize) {
    [all...]
  /external/chromium_org/third_party/opus/src/src/
opus_demo.c 267 int random_framesize=0, newsize=0, delayed_celt=0; local
628 frame_size = newsize;
632 newsize = rand()%6;
633 switch(newsize)
635 case 0: newsize=sampling_rate/400; break;
636 case 1: newsize=sampling_rate/200; break;
637 case 2: newsize=sampling_rate/100; break;
638 case 3: newsize=sampling_rate/50; break;
639 case 4: newsize=sampling_rate/25; break;
640 case 5: newsize=3*sampling_rate/50; break
    [all...]
  /external/chromium_org/third_party/mesa/src/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);
  /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);
  /dalvik/vm/
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/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/dropbear/
buffer.c 81 void buf_resize(buffer *buf, unsigned int newsize) {
83 if (newsize > BUF_MAX_SIZE) {
87 buf->data = m_realloc(buf->data, newsize);
88 buf->size = newsize;
89 buf->len = MIN(newsize, buf->len);
90 buf->pos = MIN(newsize, buf->pos);
  /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/WebKit/Source/wtf/
Vector.h 743 void Vector<T, inlineCapacity>::fill(const T& val, size_t newSize)
745 if (size() > newSize)
746 shrink(newSize);
747 else if (newSize > capacity()) {
749 reserveCapacity(newSize);
754 TypeOperations::uninitializedFill(end(), begin() + newSize, val);
755 m_size = newSize;
893 size_t newSize = m_size + dataSize;
894 if (newSize > capacity()) {
895 data = expandCapacity(newSize, data)
    [all...]

Completed in 1106 milliseconds

1 2 34 5 6 7 8 91011>>