Searched refs:elemSize (Results 1 - 25 of 25) sorted by relevance

/external/chromium_org/third_party/skia/src/core/
H A DSkTSearch.cpp14 size_t elemSize)
16 return *(const char*const*)((const char*)base + index * elemSize);
20 size_t target_len, size_t elemSize)
33 const char* elem = index_into_base(base, mid, elemSize);
44 const char* elem = index_into_base(base, hi, elemSize);
56 size_t elemSize)
58 return SkStrSearch(base, count, target, strlen(target), elemSize);
62 size_t len, size_t elemSize)
68 return SkStrSearch(base, count, tolc.lc(), len, elemSize);
72 size_t elemSize)
13 index_into_base(const char*const* base, int index, size_t elemSize) argument
19 SkStrSearch(const char*const* base, int count, const char target[], size_t target_len, size_t elemSize) argument
55 SkStrSearch(const char*const* base, int count, const char target[], size_t elemSize) argument
61 SkStrLCSearch(const char*const* base, int count, const char target[], size_t len, size_t elemSize) argument
71 SkStrLCSearch(const char*const* base, int count, const char target[], size_t elemSize) argument
[all...]
H A DSkDataTable.cpp24 SkDataTable::SkDataTable(const void* array, size_t elemSize, int count, argument
29 fElemSize = elemSize; // non-zero signals we use fElems instead of fDir
114 SkDataTable* SkDataTable::NewCopyArray(const void* array, size_t elemSize, argument
120 size_t bufferSize = elemSize * count;
125 (buffer, elemSize, count, malloc_freeproc, buffer));
128 SkDataTable* SkDataTable::NewArrayProc(const void* array, size_t elemSize, argument
133 return SkNEW_ARGS(SkDataTable, (array, elemSize, count, proc, ctx));
H A DSkDeque.cpp29 SkDeque::SkDeque(size_t elemSize, int allocCount) argument
30 : fElemSize(elemSize)
39 SkDeque::SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount) argument
40 : fElemSize(elemSize)
47 if (storageSize >= sizeof(Block) + elemSize) {
/external/skia/src/core/
H A DSkTSearch.cpp14 size_t elemSize)
16 return *(const char*const*)((const char*)base + index * elemSize);
20 size_t target_len, size_t elemSize)
33 const char* elem = index_into_base(base, mid, elemSize);
44 const char* elem = index_into_base(base, hi, elemSize);
56 size_t elemSize)
58 return SkStrSearch(base, count, target, strlen(target), elemSize);
62 size_t len, size_t elemSize)
68 return SkStrSearch(base, count, tolc.lc(), len, elemSize);
72 size_t elemSize)
13 index_into_base(const char*const* base, int index, size_t elemSize) argument
19 SkStrSearch(const char*const* base, int count, const char target[], size_t target_len, size_t elemSize) argument
55 SkStrSearch(const char*const* base, int count, const char target[], size_t elemSize) argument
61 SkStrLCSearch(const char*const* base, int count, const char target[], size_t len, size_t elemSize) argument
71 SkStrLCSearch(const char*const* base, int count, const char target[], size_t elemSize) argument
[all...]
H A DSkDataTable.cpp24 SkDataTable::SkDataTable(const void* array, size_t elemSize, int count, argument
29 fElemSize = elemSize; // non-zero signals we use fElems instead of fDir
114 SkDataTable* SkDataTable::NewCopyArray(const void* array, size_t elemSize, argument
120 size_t bufferSize = elemSize * count;
125 (buffer, elemSize, count, malloc_freeproc, buffer));
128 SkDataTable* SkDataTable::NewArrayProc(const void* array, size_t elemSize, argument
133 return SkNEW_ARGS(SkDataTable, (array, elemSize, count, proc, ctx));
H A DSkDeque.cpp29 SkDeque::SkDeque(size_t elemSize, int allocCount) argument
30 : fElemSize(elemSize)
39 SkDeque::SkDeque(size_t elemSize, void* storage, size_t storageSize, int allocCount) argument
40 : fElemSize(elemSize)
47 if (storageSize >= sizeof(Block) + elemSize) {
/external/chromium_org/third_party/skia/include/core/
H A DSkTSearch.h39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
53 const T* elem = (const T*)((const char*)base + mid * elemSize);
61 const T* elem = (const T*)((const char*)base + hi * elemSize);
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { argument
105 return SkTSearch(base, count, target, elemSize, functor);
109 size_t target_len, size_t elemSize);
[all...]
H A DSkDeque.h29 * elemSize specifies the size of each individual element in the deque
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; } function in class:SkDeque
H A DSkDataTable.h86 * @param elemSize byte-length for a given element.
88 * of bytes that will be copied is count * elemSize.
90 static SkDataTable* NewCopyArray(const void* array, size_t elemSize,
93 static SkDataTable* NewArrayProc(const void* array, size_t elemSize,
113 SkDataTable(const void* array, size_t elemSize, int count,
/external/skia/include/core/
H A DSkTSearch.h39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
53 const T* elem = (const T*)((const char*)base + mid * elemSize);
61 const T* elem = (const T*)((const char*)base + hi * elemSize);
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { argument
105 return SkTSearch(base, count, target, elemSize, functor);
109 size_t target_len, size_t elemSize);
[all...]
H A DSkDeque.h29 * elemSize specifies the size of each individual element in the deque
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; } function in class:SkDeque
H A DSkDataTable.h86 * @param elemSize byte-length for a given element.
88 * of bytes that will be copied is count * elemSize.
90 static SkDataTable* NewCopyArray(const void* array, size_t elemSize,
93 static SkDataTable* NewArrayProc(const void* array, size_t elemSize,
113 SkDataTable(const void* array, size_t elemSize, int count,
/external/srec/portable/include/
H A Dpmemory.h113 #define CALLOC(nbElem, elemSize, tag) (pcalloc(nbElem, elemSize , tag, L(__FILE__), __LINE__))
114 #define CALLOC_CLR(nbElem, elemSize, tag) (pcalloc(nbElem, elemSize , tag, L(__FILE__), __LINE__))
119 #define CALLOC(nbElem, elemSize, tag) (pcalloc(nbElem, elemSize))
120 #define CALLOC_CLR(nbElem, elemSize, tag) (pcalloc(nbElem, elemSize))
/external/chromium_org/third_party/skia/tests/
H A DLayerRasterizerTest.cpp117 REPORTER_ASSERT(reporter, layersFirstCopy.elemSize() == sizeof(SkLayerRasterizer_Rec));
118 REPORTER_ASSERT(reporter, layersOneLarger.elemSize() == sizeof(SkLayerRasterizer_Rec));
119 REPORTER_ASSERT(reporter, layersDetached.elemSize() == sizeof(SkLayerRasterizer_Rec));
H A DDequeTest.cpp15 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize());
21 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize());
/external/skia/tests/
H A DLayerRasterizerTest.cpp119 REPORTER_ASSERT(reporter, layersFirstCopy.elemSize() == sizeof(SkLayerRasterizer_Rec));
120 REPORTER_ASSERT(reporter, layersOneLarger.elemSize() == sizeof(SkLayerRasterizer_Rec));
121 REPORTER_ASSERT(reporter, layersDetached.elemSize() == sizeof(SkLayerRasterizer_Rec));
H A DDequeTest.cpp15 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize());
21 REPORTER_ASSERT(reporter, sizeof(int) == deq.elemSize());
/external/opencv/cxcore/src/
H A Dcxutils.cpp996 icvCopy1D( const void* src, int s, void* dst, int d, int n, int elemSize )
999 switch( elemSize )
1023 icvShuffle1D( const uchar* src, const int* idx, uchar* dst, int d, int n, int elemSize )
1026 switch( elemSize )
1063 int type = CV_MAT_TYPE(src->type), elemSize = CV_ELEM_SIZE(type); local
1120 tsrc = (uchar*)cvAlloc(len*elemSize);
1136 sstep /= elemSize;
1137 dstep /= elemSize;
1141 icvCopy1D( src->data.ptr + i*elemSize, sstep, tsrc, 1, len, elemSize );
[all...]
/external/valgrind/main/include/
H A Dpub_tool_oset.h238 extern void* VG_(OSetGen_AllocNode) ( OSet* os, SizeT elemSize );
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
H A Dsvga_pipe_draw.c90 unsigned elemSize = util_format_get_blocksize(ve[i].src_format); local
97 size = vb->stride * (count - 1) + elemSize;
100 size = vb->stride * (count - 1) + elemSize;
/external/mesa3d/src/gallium/drivers/svga/
H A Dsvga_pipe_draw.c90 unsigned elemSize = util_format_get_blocksize(ve[i].src_format); local
97 size = vb->stride * (count - 1) + elemSize;
100 size = vb->stride * (count - 1) + elemSize;
/external/opencv/cv/src/
H A Dcvfundam.cpp358 int type = CV_MAT_TYPE(m1->type), elemSize = CV_ELEM_SIZE(type); local
363 assert( CV_IS_MAT_CONT(m1->type & m2->type) && (elemSize % sizeof(int) == 0) );
364 elemSize /= sizeof(int);
376 for( k = 0; k < elemSize; k++ )
378 ms1ptr[i*elemSize + k] = m1ptr[idx_i*elemSize + k];
379 ms2ptr[i*elemSize + k] = m2ptr[idx_i*elemSize + k];
H A Dcvhough.cpp755 int lineType, elemSize; local
773 elemSize = sizeof(float)*2;
778 elemSize = sizeof(int)*4;
783 CV_CALL( lines = cvCreateSeq( lineType, sizeof(CvSeq), elemSize, (CvMemStorage*)lineStorage ));
797 CV_CALL( lines = cvMakeSeqHeaderForArray( lineType, sizeof(CvSeq), elemSize, mat->data.ptr,
/external/valgrind/main/coregrind/
H A Dm_oset.c56 // keyOff -> | key | elemSize
428 void* VG_(OSetGen_AllocNode)(AvlTree* t, SizeT elemSize) argument
431 Int nodeSize = sizeof(AvlNode) + elemSize;
432 vg_assert(elemSize > 0);
434 vg_assert(elemSize <= t->maxEltSize);
/external/deqp/framework/delibs/decpp/
H A DdePoolArray.hpp370 deUintptr elemSize = (deUintptr)deAlignPtr((void*)(deUintptr)sizeof(T), Alignment); local
371 T* ptr = (T*)((deUint8*)m_pageTable[pageNdx] + (subNdx*elemSize));

Completed in 2734 milliseconds