Home
last modified time | relevance | path

Searched refs:itemSize (Results 1 – 6 of 6) sorted by relevance

/external/icu4c/common/
Duarrsort.c57 doInsertionSort(char *array, int32_t start, int32_t limit, int32_t itemSize, in doInsertionSort() argument
63 uprv_memcpy(pv, array+j*itemSize, itemSize); in doInsertionSort()
66 if(/* v>=array[i-1] */ cmp(context, pv, array+(i-1)*itemSize)>=0) { in doInsertionSort()
71 uprv_memcpy(array+i*itemSize, array+(i-1)*itemSize, itemSize); in doInsertionSort()
76 uprv_memcpy(array+i*itemSize, pv, itemSize); in doInsertionSort()
82 insertionSort(char *array, int32_t length, int32_t itemSize, in insertionSort() argument
88 if(itemSize<=STACK_ITEM_SIZE) { in insertionSort()
91 pv=uprv_malloc(itemSize); in insertionSort()
98 doInsertionSort(array, 0, length, itemSize, cmp, context, pv); in insertionSort()
120 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, in subQuickSort() argument
[all …]
Duarrsort.h59 uprv_sortArray(void *array, int32_t length, int32_t itemSize,
/external/srec/portable/src/
Dpendian.c27 void swap_byte_order(void *buffer, size_t count, size_t itemSize) in swap_byte_order() argument
36 q = data + itemSize - 1; in swap_byte_order()
46 data += itemSize; in swap_byte_order()
Dpmemory.c701 void *pcalloc(size_t nbItems, size_t itemSize, const LCHAR* tag, const LCHAR* file, int line) in pcalloc() argument
703 void *pcalloc(size_t nbItems, size_t itemSize) in pcalloc()
711 result = (MemoryData *)pmalloc(nbItems * itemSize, tag, file, line); in pcalloc()
713 result = (MemoryData *)pmalloc(nbItems * itemSize); in pcalloc()
716 memset(result, 0, nbItems * itemSize); in pcalloc()
/external/srec/portable/include/
Dpmemory.h198 PORTABLE_API void *pcalloc(size_t nbItems, size_t itemSize, const LCHAR* tag, const LCHAR* file, in…
200 PORTABLE_API void *pcalloc(size_t nbItems, size_t itemSize);
Dpendian.h104 size_t itemSize);