/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-2646.js | 31 itemSize = 5, 32 heap = new ArrayBuffer(expectedItemsCount * itemSize * 8), 36 storage.push(new Float64Array(heap, 0, itemSize));
|
/external/srec/portable/src/ |
H A D | pendian.c | 27 void swap_byte_order(void *buffer, size_t count, size_t itemSize) argument 36 q = data + itemSize - 1; 46 data += itemSize;
|
H A D | pmemory.c | 701 void *pcalloc(size_t nbItems, size_t itemSize, const LCHAR* tag, const LCHAR* file, int line) argument 703 void *pcalloc(size_t nbItems, size_t itemSize) 711 result = (MemoryData *)pmalloc(nbItems * itemSize, tag, file, line); 713 result = (MemoryData *)pmalloc(nbItems * itemSize); 716 memset(result, 0, nbItems * itemSize);
|
/external/qemu/android/utils/ |
H A D | vector.c | 5 _avector_ensure( void** items, size_t itemSize, unsigned* pMaxItems, unsigned newCount ) argument 11 unsigned bigMax = UINT_MAX / itemSize; 13 if (itemSize == 0) { 19 itemSize, newCount, bigMax); 29 *items = _android_array_realloc( *items, itemSize, newMax );
|
H A D | system.c | 84 _android_array_alloc( size_t itemSize, size_t count ) argument 89 if (itemSize == 0) 92 maxSize = (~(size_t)0) / itemSize; 96 return android_alloc(itemSize * count); 100 _android_array_alloc0( size_t itemSize, size_t count ) argument 102 void* block = _android_array_alloc(itemSize, count); 103 memset(block, 0, itemSize*count); 108 _android_array_realloc( void* block, size_t itemSize, size_t count ) argument 113 if (itemSize == 0) 116 maxSize = (~(size_t)0) / itemSize; [all...] |
H A D | system.h | 27 void* _android_array_alloc( size_t itemSize, size_t count ); 28 void* _android_array_alloc0( size_t itemSize, size_t count ); 29 void* _android_array_realloc( void* block, size_t itemSize, size_t count );
|
H A D | vector.h | 73 extern void _avector_ensure( void** items, size_t itemSize,
|
/external/qemu/android/base/containers/ |
H A D | PodVector.cpp | 68 void PodVectorBase::resize(size_t newSize, size_t itemSize) { argument 69 const size_t kMaxSize = maxItemCapacity(itemSize); 75 size_t oldCapacity = itemCapacity(itemSize); 76 const size_t kMinCapacity = 256 / itemSize; 81 reserve(newSize, itemSize); 93 reserve(newCapacity, itemSize); 95 mEnd = mBegin + newSize * itemSize; 98 void PodVectorBase::reserve(size_t newSize, size_t itemSize) { argument 99 const size_t kMaxSize = maxItemCapacity(itemSize); 114 size_t newByteCapacity = newSize * itemSize; 137 removeAt(size_t itemPos, size_t itemSize) argument 149 insertAt(size_t itemPos, size_t itemSize) argument [all...] |
H A D | PodVector.h | 61 void* itemAt(size_t pos, size_t itemSize) { argument 62 const size_t kMaxCapacity = SIZE_MAX / itemSize; 64 return mBegin + pos * itemSize; 67 const void* itemAt(size_t pos, size_t itemSize) const { 68 const size_t kMaxCapacity = SIZE_MAX / itemSize; 70 return mBegin + pos * itemSize; 75 inline size_t itemCount(size_t itemSize) const { 76 DCHECK(itemSize > 0) << "Item size cannot be 0!"; 77 return byteSize() / itemSize; 80 inline size_t itemCapacity(size_t itemSize) cons [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument 72 int32_t diff=cmp(context, item, array+i*itemSize); 96 int32_t diff=cmp(context, item, array+start*itemSize); 108 doInsertionSort(char *array, int32_t length, int32_t itemSize, argument 113 char *item=array+j*itemSize; 114 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); 121 char *dest=array+insertionPoint*itemSize; 122 uprv_memcpy(pv, item, itemSize); /* v=array[j] */ 123 uprv_memmove(dest+itemSize, dest, (j-insertionPoint)*itemSize); 130 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 234 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 265 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
H A D | uarrsort.h | 50 * @param itemSize The size in bytes of each array item. 59 uprv_sortArray(void *array, int32_t length, int32_t itemSize, 98 uprv_stableBinarySearch(char *array, int32_t length, void *item, int32_t itemSize,
|
/external/icu/icu4c/source/common/ |
H A D | uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument 72 int32_t diff=cmp(context, item, array+i*itemSize); 96 int32_t diff=cmp(context, item, array+start*itemSize); 108 doInsertionSort(char *array, int32_t length, int32_t itemSize, argument 113 char *item=array+j*itemSize; 114 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); 121 char *dest=array+insertionPoint*itemSize; 122 uprv_memcpy(pv, item, itemSize); /* v=array[j] */ 123 uprv_memmove(dest+itemSize, dest, (j-insertionPoint)*itemSize); 130 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 234 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 265 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
H A D | uarrsort.h | 50 * @param itemSize The size in bytes of each array item. 59 uprv_sortArray(void *array, int32_t length, int32_t itemSize, 98 uprv_stableBinarySearch(char *array, int32_t length, void *item, int32_t itemSize,
|
/external/glide/library/src/main/java/com/bumptech/glide/util/ |
H A D | LruCache.java | 51 final int itemSize = getSize(item); 52 if (itemSize >= maxSize) {
|
/external/srec/portable/include/ |
H A D | pendian.h | 100 * @param itemSize Size of each items. 104 size_t itemSize);
|
H A D | pmemory.h | 186 * @param itemSize The size of each item. 198 PORTABLE_API void *pcalloc(size_t nbItems, size_t itemSize, const LCHAR* tag, const LCHAR* file, int line); 200 PORTABLE_API void *pcalloc(size_t nbItems, size_t itemSize);
|
/external/llvm/lib/Support/ |
H A D | StringMap.cpp | 20 StringMapImpl::StringMapImpl(unsigned InitSize, unsigned itemSize) { argument 21 ItemSize = itemSize;
|
/external/skia/src/gpu/ |
H A D | GrAllocator.h | 25 * @param itemSize the size of each item to allocate 28 * Must be at least itemSize*itemsPerBlock sized. 31 GrAllocator(size_t itemSize, int itemsPerBlock, void* initialBlock) : argument 32 fItemSize(itemSize), 47 * Must be at least itemSize*itemsPerBlock sized.
|
H A D | GrBufferAllocPool.h | 137 * should be itemSize-aligned from the start of a buffer. 141 int currentBufferItems(size_t itemSize) const;
|
H A D | GrBufferAllocPool.cpp | 200 int GrBufferAllocPool::currentBufferItems(size_t itemSize) const { 205 size_t pad = GrSizeAlignUpPad(usedBytes, itemSize); 206 return static_cast<int>((back.fBytesFree - pad) / itemSize); 208 return static_cast<int>(fMinBlockSize / itemSize);
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrBufferAllocPool.h | 137 * should be itemSize-aligned from the start of a buffer. 141 int currentBufferItems(size_t itemSize) const;
|
H A D | GrBufferAllocPool.cpp | 212 int GrBufferAllocPool::currentBufferItems(size_t itemSize) const { 217 size_t pad = GrSizeAlignUpPad(usedBytes, itemSize); 218 return static_cast<int>((back.fBytesFree - pad) / itemSize); 220 return static_cast<int>(fMinBlockSize / itemSize);
|
H A D | GrAllocator.h | 23 * @param itemSize the size of each item to allocate 26 * Must be at least itemSize*itemsPerBlock sized. 29 GrAllocator(size_t itemSize, int itemsPerBlock, void* initialBlock) argument 30 : fItemSize(itemSize) 198 * Must be at least itemSize*itemsPerBlock sized.
|
/external/lzma/CPP/Common/ |
H A D | MyVector.h | 22 CBaseRecordVector(size_t itemSize): _capacity(0), _size(0), _items(0), _itemSize(itemSize) {}
argument
|
/external/lzma/CPP/7zip/Archive/7z/ |
H A D | 7zOut.h | 98 void WriteAlignedBoolHeader(const CBoolVector &v, int numDefined, Byte type, unsigned itemSize);
|