/external/skia/include/private/ |
D | SkTSearch.h | 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) in SkTSearch() argument 53 const T* elem = (const T*)((const char*)base + mid * elemSize); in SkTSearch() 61 const T* elem = (const T*)((const char*)base + hi * elemSize); in SkTSearch() 78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { in SkTSearch() argument 80 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { in SkTSearch() argument 92 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { in SkTSearch() argument 105 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 109 size_t target_len, size_t elemSize); [all …]
|
D | SkMalloc.h | 78 SK_API extern void* sk_calloc_throw(size_t count, size_t elemSize); 79 SK_API extern void* sk_malloc_throw(size_t count, size_t elemSize); 80 SK_API extern void* sk_realloc_throw(void* buffer, size_t count, size_t elemSize); 95 SK_API extern void* sk_malloc_canfail(size_t count, size_t elemSize);
|
/external/skqp/include/private/ |
D | SkTSearch.h | 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) in SkTSearch() argument 53 const T* elem = (const T*)((const char*)base + mid * elemSize); in SkTSearch() 61 const T* elem = (const T*)((const char*)base + hi * elemSize); in SkTSearch() 78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { in SkTSearch() argument 80 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { in SkTSearch() argument 92 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { in SkTSearch() argument 105 return SkTSearch(base, count, target, elemSize, functor); in SkTSearch() 109 size_t target_len, size_t elemSize); [all …]
|
D | SkMalloc.h | 71 SK_API extern void* sk_calloc_throw(size_t count, size_t elemSize); 72 SK_API extern void* sk_malloc_throw(size_t count, size_t elemSize); 73 SK_API extern void* sk_realloc_throw(void* buffer, size_t count, size_t elemSize); 81 SK_API extern void* sk_malloc_canfail(size_t count, size_t elemSize);
|
/external/skqp/src/core/ |
D | SkTSearch.cpp | 16 size_t elemSize) in index_into_base() argument 18 return *(const char*const*)((const char*)base + index * elemSize); in index_into_base() 22 size_t target_len, size_t elemSize) in SkStrSearch() argument 35 const char* elem = index_into_base(base, mid, elemSize); in SkStrSearch() 46 const char* elem = index_into_base(base, hi, elemSize); in SkStrSearch() 58 size_t elemSize) in SkStrSearch() argument 60 return SkStrSearch(base, count, target, strlen(target), elemSize); in SkStrSearch() 64 size_t len, size_t elemSize) in SkStrLCSearch() argument 70 return SkStrSearch(base, count, tolc.lc(), len, elemSize); in SkStrLCSearch() 74 size_t elemSize) in SkStrLCSearch() argument [all …]
|
D | SkMallocPixelRef.cpp | 14 void* sk_calloc_throw(size_t count, size_t elemSize) { in sk_calloc_throw() argument 15 return sk_calloc_throw(SkSafeMath::Mul(count, elemSize)); in sk_calloc_throw() 18 void* sk_malloc_throw(size_t count, size_t elemSize) { in sk_malloc_throw() argument 19 return sk_malloc_throw(SkSafeMath::Mul(count, elemSize)); in sk_malloc_throw() 22 void* sk_realloc_throw(void* buffer, size_t count, size_t elemSize) { in sk_realloc_throw() argument 23 return sk_realloc_throw(buffer, SkSafeMath::Mul(count, elemSize)); in sk_realloc_throw() 26 void* sk_malloc_canfail(size_t count, size_t elemSize) { in sk_malloc_canfail() argument 27 return sk_malloc_canfail(SkSafeMath::Mul(count, elemSize)); in sk_malloc_canfail()
|
D | SkDataTable.cpp | 25 SkDataTable::SkDataTable(const void* array, size_t elemSize, int count, in SkDataTable() argument 30 fElemSize = elemSize; // non-zero signals we use fElems instead of fDir in SkDataTable() 113 sk_sp<SkDataTable> SkDataTable::MakeCopyArray(const void* array, size_t elemSize, int count) { in MakeCopyArray() argument 118 size_t bufferSize = elemSize * count; in MakeCopyArray() 122 return sk_sp<SkDataTable>(new SkDataTable(buffer, elemSize, count, malloc_freeproc, buffer)); in MakeCopyArray() 125 sk_sp<SkDataTable> SkDataTable::MakeArrayProc(const void* array, size_t elemSize, int count, in MakeArrayProc() argument 130 return sk_sp<SkDataTable>(new SkDataTable(array, elemSize, count, proc, ctx)); in MakeArrayProc()
|
D | SkDeque.cpp | 28 SkDeque::SkDeque(size_t elemSize, int allocCount) in SkDeque() argument 29 : fElemSize(elemSize) in SkDeque() 38 SkDeque::SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount) in SkDeque() argument 39 : fElemSize(elemSize) in SkDeque() 46 if (storageSize >= sizeof(Block) + elemSize) { in SkDeque()
|
/external/skia/src/core/ |
D | SkTSearch.cpp | 16 size_t elemSize) in index_into_base() argument 18 return *(const char*const*)((const char*)base + index * elemSize); in index_into_base() 22 size_t target_len, size_t elemSize) in SkStrSearch() argument 35 const char* elem = index_into_base(base, mid, elemSize); in SkStrSearch() 46 const char* elem = index_into_base(base, hi, elemSize); in SkStrSearch() 58 size_t elemSize) in SkStrSearch() argument 60 return SkStrSearch(base, count, target, strlen(target), elemSize); in SkStrSearch() 64 size_t len, size_t elemSize) in SkStrLCSearch() argument 70 return SkStrSearch(base, count, tolc.lc(), len, elemSize); in SkStrLCSearch() 74 size_t elemSize) in SkStrLCSearch() argument [all …]
|
D | SkMallocPixelRef.cpp | 14 void* sk_calloc_throw(size_t count, size_t elemSize) { in sk_calloc_throw() argument 15 return sk_calloc_throw(SkSafeMath::Mul(count, elemSize)); in sk_calloc_throw() 18 void* sk_malloc_throw(size_t count, size_t elemSize) { in sk_malloc_throw() argument 19 return sk_malloc_throw(SkSafeMath::Mul(count, elemSize)); in sk_malloc_throw() 22 void* sk_realloc_throw(void* buffer, size_t count, size_t elemSize) { in sk_realloc_throw() argument 23 return sk_realloc_throw(buffer, SkSafeMath::Mul(count, elemSize)); in sk_realloc_throw() 26 void* sk_malloc_canfail(size_t count, size_t elemSize) { in sk_malloc_canfail() argument 27 return sk_malloc_canfail(SkSafeMath::Mul(count, elemSize)); in sk_malloc_canfail()
|
D | SkDataTable.cpp | 25 SkDataTable::SkDataTable(const void* array, size_t elemSize, int count, in SkDataTable() argument 30 fElemSize = elemSize; // non-zero signals we use fElems instead of fDir in SkDataTable() 113 sk_sp<SkDataTable> SkDataTable::MakeCopyArray(const void* array, size_t elemSize, int count) { in MakeCopyArray() argument 118 size_t bufferSize = elemSize * count; in MakeCopyArray() 122 return sk_sp<SkDataTable>(new SkDataTable(buffer, elemSize, count, malloc_freeproc, buffer)); in MakeCopyArray() 125 sk_sp<SkDataTable> SkDataTable::MakeArrayProc(const void* array, size_t elemSize, int count, in MakeArrayProc() argument 130 return sk_sp<SkDataTable>(new SkDataTable(array, elemSize, count, proc, ctx)); in MakeArrayProc()
|
D | SkDeque.cpp | 28 SkDeque::SkDeque(size_t elemSize, int allocCount) in SkDeque() argument 29 : fElemSize(elemSize) in SkDeque() 38 SkDeque::SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount) in SkDeque() argument 39 : fElemSize(elemSize) in SkDeque() 46 if (storageSize >= sizeof(Block) + elemSize) { in SkDeque()
|
/external/opencv/cxcore/src/ |
D | cxutils.cpp | 996 icvCopy1D( const void* src, int s, void* dst, int d, int n, int elemSize ) in icvCopy1D() argument 999 switch( elemSize ) in icvCopy1D() 1023 icvShuffle1D( const uchar* src, const int* idx, uchar* dst, int d, int n, int elemSize ) in icvShuffle1D() argument 1026 switch( elemSize ) in icvShuffle1D() 1063 int type = CV_MAT_TYPE(src->type), elemSize = CV_ELEM_SIZE(type); in cvSort() local 1120 tsrc = (uchar*)cvAlloc(len*elemSize); in cvSort() 1136 sstep /= elemSize; in cvSort() 1137 dstep /= elemSize; in cvSort() 1141 icvCopy1D( src->data.ptr + i*elemSize, sstep, tsrc, 1, len, elemSize ); in cvSort() 1146 icvShuffle1D( tsrc, tidx, dptr + i*elemSize, dstep, len, elemSize ); in cvSort() [all …]
|
/external/skqp/include/core/ |
D | SkDataTable.h | 87 static sk_sp<SkDataTable> MakeCopyArray(const void* array, size_t elemSize, int count); 89 static sk_sp<SkDataTable> MakeArrayProc(const void* array, size_t elemSize, int count, 109 SkDataTable(const void* array, size_t elemSize, int count,
|
D | SkDeque.h | 32 explicit SkDeque(size_t elemSize, int allocCount = 1); 33 SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount = 1); 38 size_t elemSize() const { return fElemSize; } in elemSize() function
|
/external/skia/include/core/ |
D | SkDataTable.h | 87 static sk_sp<SkDataTable> MakeCopyArray(const void* array, size_t elemSize, int count); 89 static sk_sp<SkDataTable> MakeArrayProc(const void* array, size_t elemSize, int count, 109 SkDataTable(const void* array, size_t elemSize, int count,
|
D | SkDeque.h | 32 explicit SkDeque(size_t elemSize, int allocCount = 1); 33 SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount = 1); 38 size_t elemSize() const { return fElemSize; } in elemSize() function
|
/external/flatbuffers/net/FlatBuffers/ |
D | FlatBufferBuilder.cs | 281 public void StartVector(int elemSize, int count, int alignment) in StartVector() argument 285 Prep(sizeof(int), elemSize * count); in StartVector() 286 Prep(alignment, elemSize * count); // Just in case alignment > int. in StartVector()
|
/external/skia/tests/ |
D | DequeTest.cpp | 15 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize()); in assert_count() 21 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize()); in assert_count()
|
/external/skqp/tests/ |
D | DequeTest.cpp | 15 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize()); in assert_count() 21 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize()); in assert_count()
|
/external/valgrind/coregrind/ |
D | m_oset.c | 426 void* VG_(OSetGen_AllocNode)(const AvlTree* t, SizeT elemSize) in VG_() 429 Int nodeSize = sizeof(AvlNode) + elemSize; in VG_() 430 vg_assert(elemSize > 0); in VG_() 432 vg_assert(elemSize <= t->maxEltSize); in VG_()
|
/external/flatbuffers/python/flatbuffers/ |
D | builder.py | 371 def StartVector(self, elemSize, numElems, alignment): argument 382 self.Prep(N.Uint32Flags.bytewidth, elemSize*numElems) 383 self.Prep(alignment, elemSize*numElems) # In case alignment > int.
|
/external/opencv/cv/src/ |
D | cvfundam.cpp | 358 int type = CV_MAT_TYPE(m1->type), elemSize = CV_ELEM_SIZE(type); in getSubset() local 363 assert( CV_IS_MAT_CONT(m1->type & m2->type) && (elemSize % sizeof(int) == 0) ); in getSubset() 364 elemSize /= sizeof(int); in getSubset() 376 for( k = 0; k < elemSize; k++ ) in getSubset() 378 ms1ptr[i*elemSize + k] = m1ptr[idx_i*elemSize + k]; in getSubset() 379 ms2ptr[i*elemSize + k] = m2ptr[idx_i*elemSize + k]; in getSubset()
|
D | cvhough.cpp | 755 int lineType, elemSize; in cvHoughLines2() local 773 elemSize = sizeof(float)*2; in cvHoughLines2() 778 elemSize = sizeof(int)*4; in cvHoughLines2() 783 … CV_CALL( lines = cvCreateSeq( lineType, sizeof(CvSeq), elemSize, (CvMemStorage*)lineStorage )); in cvHoughLines2() 797 CV_CALL( lines = cvMakeSeqHeaderForArray( lineType, sizeof(CvSeq), elemSize, mat->data.ptr, in cvHoughLines2()
|
/external/flatbuffers/go/ |
D | builder.go | 289 func (b *Builder) StartVector(elemSize, numElems, alignment int) UOffsetT { 292 b.Prep(SizeUint32, elemSize*numElems) 293 b.Prep(alignment, elemSize*numElems) // Just in case alignment > int.
|