/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 | 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/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/syzkaller/prog/ |
D | size.go | 121 elemSize := typ.BitSize / 8 122 if elemSize == 0 { 123 elemSize = 1 136 elemSize = targetType.Type.Size() 166 n := max / elemSize 168 if elemSize == 1 || r.oneOf(10) {
|
/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 | 33 explicit SkDeque(size_t elemSize, int allocCount = 1); 34 SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount = 1); 39 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 | 33 explicit SkDeque(size_t elemSize, int allocCount = 1); 34 SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount = 1); 39 size_t elemSize() const { return fElemSize; } in elemSize() function
|
/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/flatbuffers/net/FlatBuffers/ |
D | FlatBufferBuilder.cs | 360 public void StartVector(int elemSize, int count, int alignment) in StartVector() argument 364 Prep(sizeof(int), elemSize * count); in StartVector() 365 Prep(alignment, elemSize * count); // Just in case alignment > int. in StartVector()
|
/external/flatbuffers/lua/flatbuffers/ |
D | builder.lua | 228 function mt:StartVector(elemSize, numElements, alignment) 231 self:Prep(Uint32.bytewidth, elemSize * numElements) 232 self:Prep(alignment, elemSize * numElements)
|
/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/flatbuffers/go/ |
D | builder.go | 291 func (b *Builder) StartVector(elemSize, numElems, alignment int) UOffsetT { 294 b.Prep(SizeUint32, elemSize*numElems) 295 b.Prep(alignment, elemSize*numElems) // Just in case alignment > int.
|
/external/deqp/framework/delibs/decpp/ |
D | dePoolArray.hpp | 379 deUintptr elemSize = (deUintptr)deAlignPtr((void*)(deUintptr)sizeof(T), Alignment); in getPtr() local 380 T* ptr = (T*)((deUint8*)m_pageTable[pageNdx] + (subNdx*elemSize)); in getPtr()
|
/external/tensorflow/tensorflow/stream_executor/cuda/ |
D | cublas_9_0.inc | 89 cublasStatus_t CUBLASWINAPI cublasSetVector (int n, int elemSize, const void *x, 94 return func_ptr(n, elemSize, x, incx, devicePtr, incy); 97 cublasStatus_t CUBLASWINAPI cublasGetVector (int n, int elemSize, const void *x, 102 return func_ptr(n, elemSize, x, incx, y, incy); 105 cublasStatus_t CUBLASWINAPI cublasSetMatrix (int rows, int cols, int elemSize, 111 return func_ptr(rows, cols, elemSize, A, lda, B, ldb); 114 cublasStatus_t CUBLASWINAPI cublasGetMatrix (int rows, int cols, int elemSize, 120 return func_ptr(rows, cols, elemSize, A, lda, B, ldb); 123 cublasStatus_t CUBLASWINAPI cublasSetVectorAsync (int n, int elemSize, 130 return func_ptr(n, elemSize, hostPtr, incx, devicePtr, incy, stream); [all …]
|