/sdk/emulator/opengl/shared/emugl/common/ |
pod_vector.cpp | 67 void PodVectorBase::resize(size_t newSize, size_t itemSize) { 68 const size_t kMaxSize = maxItemCapacity(itemSize); 69 size_t oldCapacity = itemCapacity(itemSize); 70 const size_t kMinCapacity = 256 / itemSize; 75 reserve(newSize, itemSize); 87 reserve(newCapacity, itemSize); 89 mEnd = mBegin + newSize * itemSize; 92 void PodVectorBase::reserve(size_t newSize, size_t itemSize) { 102 size_t newByteCapacity = newSize * itemSize; 109 newByteCapacity = usableSize - (usableSize % itemSize); [all...] |
pod_vector.h | 75 void* itemAt(size_t pos, size_t itemSize) { 76 return mBegin + pos * itemSize; 79 const void* itemAt(size_t pos, size_t itemSize) const { 80 return mBegin + pos * itemSize; 85 inline size_t itemCount(size_t itemSize) const { 86 return byteSize() / itemSize; 89 inline size_t itemCapacity(size_t itemSize) const { 90 return byteCapacity() / itemSize; 93 inline size_t maxItemCapacity(size_t itemSize) const { 94 return SIZE_MAX / itemSize; [all...] |
/external/chromium_org/third_party/icu/source/common/ |
uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, 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, 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); [all...] |
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/ |
uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, 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, 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); [all...] |
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/qemu/android/utils/ |
vector.c | 5 _avector_ensure( void** items, size_t itemSize, unsigned* pMaxItems, unsigned newCount ) 11 unsigned bigMax = UINT_MAX / itemSize; 13 if (itemSize == 0) { 19 itemSize, newCount, bigMax); 29 *items = _android_array_realloc( *items, itemSize, newMax );
|
system.c | 84 _android_array_alloc( size_t itemSize, size_t count ) 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 ) 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 ) 113 if (itemSize == 0) 116 maxSize = (~(size_t)0) / itemSize; [all...] |
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 );
|
/external/qemu/android/base/containers/ |
PodVector.cpp | 68 void PodVectorBase::resize(size_t newSize, size_t itemSize) { 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) { 99 const size_t kMaxSize = maxItemCapacity(itemSize); 114 size_t newByteCapacity = newSize * itemSize; [all...] |
PodVector.h | 61 void* itemAt(size_t pos, size_t itemSize) { 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) const [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
bc-reserve.c | 42 unsigned int itemsize; /* size of each item (in bytes) */ member in struct:bytecode_reserve 84 fprintf(f, "\n%*sItem Size=%u\n", indent_level, "", reserve->itemsize); 104 return reserve->itemsize; 112 bc->len += reserve->itemsize; 128 yasm_bc_create_reserve(yasm_expr *numitems, unsigned int itemsize, 136 reserve->itemsize = itemsize; 142 yasm_bc_reserve_numitems(yasm_bytecode *bc, unsigned int *itemsize) 150 *itemsize = reserve->itemsize; [all...] |
/external/chromium_org/third_party/cython/src/Cython/Includes/cpython/ |
array.pxd | 63 int itemsize 102 info.itemsize = self.ob_descr.itemsize # e.g. sizeof(float) 103 info.len = info.itemsize * item_count 109 info.strides = &info.itemsize 134 memset(op.data.as_chars, 0, length * op.ob_descr.itemsize) 140 memcpy(op.data.as_chars, self.data.as_chars, Py_SIZE(op) * op.ob_descr.itemsize) 147 cdef Py_ssize_t itemsize = self.ob_descr.itemsize 150 memcpy(self.data.as_chars + origsize * itemsize, stuff, n * itemsize [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
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/ |
pendian.c | 27 void swap_byte_order(void *buffer, size_t count, size_t itemSize) 36 q = data + itemSize - 1; 46 data += itemSize;
|
/external/chromium_org/third_party/cython/src/Cython/Utility/ |
arrayarray.h | 27 int itemsize; member in struct:arraydescr 75 nbytes = size * descr->itemsize; 77 if (nbytes / descr->itemsize != (size_t)size) { 109 PyMem_Resize(items, char, (size_t)(n * self->ob_descr->itemsize)); 132 PyMem_Resize(items, char, (size_t)(newsize * self->ob_descr->itemsize));
|
MemoryView.pyx | 83 int ndim, size_t itemsize) nogil 108 Py_ssize_t itemsize 116 def __cinit__(array self, tuple shape, Py_ssize_t itemsize, format not None, 124 self.itemsize = itemsize 129 if itemsize <= 0: 130 raise ValueError("itemsize <= 0 for cython.array") 161 itemsize, self.ndim, order) 174 for i in range(self.len / itemsize): 193 info.itemsize = self.itemsiz [all...] |
MemoryView_C.c | 182 } else if (buf->strides[dim] != buf->itemsize) { 194 if (stride < buf->itemsize) { 260 if (stride * buf->itemsize != buf->strides[i] && 272 if (stride * buf->itemsize != buf->strides[i] && 332 if ((unsigned) buf->itemsize != dtype->size) { 336 buf->itemsize, 337 (buf->itemsize > 1) ? "s" : "", 404 Py_ssize_t stride = buf->itemsize; 640 int ndim, size_t itemsize); 651 int ndim, size_t itemsize) 718 Py_ssize_t itemsize = mvs->memview->view.itemsize; variable 916 size_t itemsize, void *itemp); variable 925 size_t itemsize, void *itemp) variable [all...] |
/frameworks/base/libs/hwui/utils/ |
SortedListImpl.cpp | 26 SortedListImpl::SortedListImpl(size_t itemSize, uint32_t flags): VectorImpl(itemSize, flags) { 57 const size_t s = itemSize(); 88 const size_t is = itemSize();
|
/external/glide/library/src/main/java/com/bumptech/glide/util/ |
LruCache.java | 51 final int itemSize = getSize(item); 52 if (itemSize >= maxSize) {
|
/external/skia/src/gpu/ |
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) : 32 fItemSize(itemSize), 47 * Must be at least itemSize*itemsPerBlock sized.
|
/frameworks/wilhelm/src/itf/ |
IAndroidBufferQueue.c | 85 SLuint32 itemDataSizeWithAlignmentPadding = (pItems->itemSize + 3) & ~3; 101 if (pItems->itemSize != 0) { 102 SL_LOGE("Invalid item parameter size %u for EOS", pItems->itemSize); 108 if (pItems->itemSize == 0) { 111 } else if (pItems->itemSize == sizeof(SLAuint64)) { 116 SL_LOGE("Invalid item parameter size %u for MPEG-2 PTS", pItems->itemSize); 123 if (pItems->itemSize == 0) { 126 } else if (pItems->itemSize == sizeof(SLuint32)) { 150 SL_LOGE("Unknown item key %u with size %u", pItems->itemKey, pItems->itemSize); 161 if (pItems->itemSize != 0) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_memoryview.py | 176 self.assertEqual(m.itemsize, self.itemsize) 180 self.assertEqual(m.strides, (self.itemsize,)) 246 # with itemsize > 1. 253 itemsize = 1 variable in class:BaseBytesMemoryTests 262 #itemsize = array.array('i').itemsize 332 ## Issue #4569: segfault when mutating a memoryview with itemsize != 1
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_memoryview.py | 176 self.assertEqual(m.itemsize, self.itemsize) 180 self.assertEqual(m.strides, (self.itemsize,)) 246 # with itemsize > 1. 253 itemsize = 1 variable in class:BaseBytesMemoryTests 262 #itemsize = array.array('i').itemsize 332 ## Issue #4569: segfault when mutating a memoryview with itemsize != 1
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_pep3118.py | 32 self.assertEqual(v.itemsize, sizeof(itemtp)) 43 self.assertEqual(n * v.itemsize, len(v.tobytes())) 59 self.assertEqual(v.itemsize, sizeof(itemtp)) 109 # type format shape calc itemsize
|