Searched defs:numElements (Results 1 - 25 of 101) sorted by relevance

12345

/external/skia/src/gpu/vk/
H A DGrVkVaryingHandler.cpp86 int numElements = 1; local
88 numElements = var.getArrayCount();
90 SkASSERT(numElements > 0);
91 locationIndex += elementSize * numElements;
/external/skqp/src/gpu/vk/
H A DGrVkVaryingHandler.cpp88 int numElements = 1; local
90 numElements = var.getArrayCount();
92 SkASSERT(numElements > 0);
93 locationIndex += elementSize * numElements;
/external/swiftshader/src/D3D9/
H A DDirect3DVertexDeclaration9.hpp41 long __stdcall GetDeclaration(D3DVERTEXELEMENT9 *declaration, unsigned int *numElements) override;
54 int numElements; member in class:D3D9::Direct3DVertexDeclaration9
H A DDirect3DVertexDeclaration9.cpp43 numElements = size / sizeof(D3DVERTEXELEMENT9);
44 this->vertexElement = new D3DVERTEXELEMENT9[numElements];
56 numElements = 0;
66 vertexElement[numElements].Stream = 0;
67 vertexElement[numElements].Offset = offset;
68 vertexElement[numElements].Type = D3DDECLTYPE_FLOAT3;
69 vertexElement[numElements].Method = D3DDECLMETHOD_DEFAULT;
70 vertexElement[numElements].Usage = D3DDECLUSAGE_POSITION;
71 vertexElement[numElements].UsageIndex = 0;
72 numElements
342 GetDeclaration(D3DVERTEXELEMENT9 *declaration, unsigned int *numElements) argument
[all...]
/external/swiftshader/third_party/LLVM/runtime/libprofile/
H A DEdgeProfiling.c39 unsigned *arrayStart, unsigned numElements) {
42 NumElements = numElements;
38 llvm_start_edge_profiling(int argc, const char **argv, unsigned *arrayStart, unsigned numElements) argument
H A DOptimalEdgeProfiling.c39 unsigned *arrayStart, unsigned numElements) {
42 NumElements = numElements;
38 llvm_start_opt_edge_profiling(int argc, const char **argv, unsigned *arrayStart, unsigned numElements) argument
H A DBasicBlockTracing.c50 unsigned *arrayStart, unsigned numElements) {
49 llvm_start_basic_block_tracing(int argc, const char **argv, unsigned *arrayStart, unsigned numElements) argument
/external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/
H A DvktSpvAsmUboMatrixPaddingTests.cpp49 const int numElements = 128; local
131 inputData.reserve(numElements);
132 for (deUint32 numIdx = 0; numIdx < numElements; ++numIdx)
136 spec.numWorkGroups = IVec3(numElements, 1, 1);
H A DvktSpvAsmLoopDepInfTests.cpp149 const int numElements = 100; local
150 vector<float> inputFloats (numElements, 0);
151 vector<float> outputFloats (numElements, 0);
154 for (size_t ndx = 0; ndx < numElements; ++ndx)
157 for (size_t ndx = 0; ndx < numElements; ++ndx)
177 spec.numWorkGroups = tcu::IVec3(numElements, 1, 1);
H A DvktSpvAsmLoopDepLenTests.cpp165 const int numElements = 100; local
166 vector<float> inputFloats (numElements, 0);
167 vector<float> outputFloats (numElements, 0);
170 for (size_t ndx = 0; ndx < numElements; ++ndx)
173 for (size_t ndx = 0; ndx < numElements; ++ndx)
192 spec.numWorkGroups = tcu::IVec3(numElements, 1, 1);
/external/deqp/external/vulkancts/modules/vulkan/subgroups/
H A DvktSubgroupsTestsUtils.hpp62 numElements(0),
73 vk::VkDeviceSize numElements; member in struct:vkt::subgroups::SSBOData
/external/deqp/framework/delibs/depool/
H A DdePoolArray.h43 int numElements; /*!< Number of elements in the array. */ member in struct:dePoolArray_s
99 int numElements; \
125 return arr->numElements; \
140 arr->numElements = size; \
146 arr->numElements = 0; \
151 DE_ASSERT(ndx >= 0 && ndx < arr->numElements); \
161 DE_ASSERT(ndx >= 0 && ndx < arr->numElements); \
171 if ((arr->numElements + 1 >= arr->capacity) && !TYPENAME##_reserve(arr, arr->numElements + 1)) \
173 arr->numElements
[all...]
H A DdePoolHash.c117 int numElements = deTestHash_getNumElements(hash); local
121 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements);
124 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements);
129 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements);
130 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements);
132 for (ndx = 0; ndx < numElements; ndx++)
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DCollectionSize.java70 private final Integer numElements; field in class:CollectionSize
72 CollectionSize(int numElements) { argument
74 this.numElements = numElements;
81 this.numElements = null;
90 if (numElements == null) {
94 return numElements;
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DFixedTableModel.java58 private int numElements; field in class:FixedTableModel.FixedTableModelIterator
60 protected FixedTableModelIterator(FixedTableModel model, RectF tableRect, int numElements) { argument
63 this.numElements = numElements;
74 return !(lastElement >= numElements || (isColumnFinished() && isRowFinished()));
92 if (lastElement >= numElements) {
H A DDynamicTableModel.java102 public RectF getCellRect(RectF tableRect, int numElements) { argument
107 cellRect.bottom = tableRect.top + calculateCellSize(tableRect, TableModel.Axis.ROW, numElements);
109 cellRect.right = tableRect.left + calculateCellSize(tableRect, TableModel.Axis.COLUMN, numElements);
/external/deqp/framework/delibs/decpp/
H A DdeArrayBuffer.hpp54 ArrayBuffer (size_t numElements);
55 ArrayBuffer (const T* ptr, size_t numElements);
61 void setStorage (size_t numElements); // !< \note after a succesful call buffer contents are undefined
84 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (size_t numElements) argument
88 if (numElements)
91 const size_t storageSize = (numElements - 1) * Stride + sizeof(T);
98 m_cap = numElements;
103 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (const T* ptr, size_t numElements) argument
107 if (numElements)
110 ArrayBuffer<T,Alignment,Stride> tmp(numElements);
170 setStorage(size_t numElements) argument
[all...]
H A DdeAppendList.cpp58 deUint32 numElements; member in struct:de::__anon4746::SharedState
63 : numElements (numElements_)
81 for (deUint32 elemNdx = 0; elemNdx < m_shared->numElements; elemNdx++)
97 void runAppendListTest (deUint32 numThreads, deUint32 numElements, deUint32 numElementsHint) argument
99 SharedState sharedState (numThreads, numElements, numElementsHint);
111 DE_TEST_ASSERT(sharedState.testList.size() == (size_t)numElements*(size_t)numThreads);
131 DE_TEST_ASSERT(countByThread[threadNdx] == numElements);
/external/guava/guava/src/com/google/common/collect/
H A DQueues.java248 * {@code numElements} elements are not available, it will wait for them up to the specified
253 * @param numElements the number of elements to be waited for
260 public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, argument
270 while (added < numElements) {
273 added += q.drainTo(buffer, numElements - added);
274 if (added < numElements) { // not enough elements immediately available; will have to poll
294 * @param numElements the number of elements to be waited for
301 int numElements, long timeout, TimeUnit unit) {
307 while (added < numElements) {
310 added += q.drainTo(buffer, numElements
300 drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit) argument
[all...]
/external/deqp/framework/randomshaders/
H A DrsgVariableValue.cpp48 int numElements = (int)a.getType().getNumElements(); local
49 for (int ndx = 0; ndx < numElements; ndx++)
57 int numElements = (int)a.getType().getNumElements(); local
61 for (int ndx = 0; ndx < numElements; ndx++)
76 for (int ndx = 0; ndx < numElements; ndx++)
89 for (int ndx = 0; ndx < numElements; ndx++)
213 int numElements = (int)a.getType().getNumElements(); local
214 for (int ndx = 0; ndx < numElements; ndx++)
219 int numElements = (int)a.getType().getNumElements(); local
223 for (int ndx = 0; ndx < numElements; nd
[all...]
/external/protobuf/java/core/src/test/java/com/google/protobuf/
H A DSmallSortedMapTest.java103 private void runPutAndGetTest(int numElements) { argument
115 for (int i = 0; i < numElements; i++) {
120 for (int i = numElements - 1; i >= 0; i--) {
125 assertEquals(Math.min(3, numElements), map1.getNumArrayEntries());
126 assertEquals(Math.min(4, numElements), map2.getNumArrayEntries());
127 assertEquals(Math.min(3, numElements), map3.getNumArrayEntries());
128 assertEquals(Math.min(4, numElements), map4.getNumArrayEntries());
138 assertEquals(numElements, map.size());
139 for (int i = 0; i < numElements; i++) {
/external/skia/tests/
H A DLListTest.cpp29 int numElements,
36 REPORTER_ASSERT(reporter, numElements == list.countEntries());
26 check_list(const SkTInternalLList<ListElement>& list, skiatest::Reporter* reporter, bool empty, int numElements, bool in0, bool in1, bool in2, bool in3, ListElement elements[4]) argument
/external/skqp/tests/
H A DLListTest.cpp29 int numElements,
36 REPORTER_ASSERT(reporter, numElements == list.countEntries());
26 check_list(const SkTInternalLList<ListElement>& list, skiatest::Reporter* reporter, bool empty, int numElements, bool in0, bool in1, bool in2, bool in3, ListElement elements[4]) argument
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3bitset.c144 int numElements; local
155 numElements = blist->length;
159 if (numElements < 8)
161 numElements = 8;
166 bitset->blist.length = numElements;
168 bitset->blist.bits = (pANTLR3_BITWORD)ANTLR3_MALLOC((size_t)(numElements * sizeof(ANTLR3_BITWORD)));
176 ANTLR3_MEMCPY(bitset->blist.bits, blist->bits, (ANTLR3_UINT64)(numElements * sizeof(ANTLR3_BITWORD)));
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DResizableDoubleArray.java55 * elements (the <code>numElements</code> property) and if the difference
57 * <code>numElements + 1.</code> The determination of when the internal
61 * ratio between storage array length and <code>numElements</code> exceeds
124 protected int numElements = 0; field in class:ResizableDoubleArray
129 * internalArray[startIndex],...,internalArray[startIndex + numElements -1]
165 * initial capacity and numElements corresponding to the size of
187 numElements = initialArray.length;
296 numElements++;
297 if ((startIndex + numElements) > internalArray.length) {
300 internalArray[startIndex + (numElements
[all...]

Completed in 929 milliseconds

12345