| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p9.cpp | 10 const unsigned NumElements = 17;
14 int array[NumElements];
|
| /external/clang/patches/ |
| 0002-Revert-to-old-vector-passing-ABI-for-backwards-compa.patch | 17 unsigned NumElements = VT->getNumElements();
19 // NumElements should be power of 2.
20 - if ((NumElements & (NumElements - 1)) != 0)
21 + if (((NumElements & (NumElements - 1)) != 0) && NumElements != 3)
|
| /external/deqp/framework/delibs/decpp/ |
| deBlockBuffer.hpp | 57 void write (int numElements, const T* elements);
58 int tryWrite (int numElements, const T* elements);
62 void read (int numElements, T* elements);
63 int tryRead (int numElements, T* elements);
72 int writeToCurrentBlock (int numElements, const T* elements, bool blocking);
73 int readFromCurrentBlock(int numElements, T* elements, bool blocking);
175 int BlockBuffer<T>::writeToCurrentBlock (int numElements, const T* elements, bool blocking)
177 DE_ASSERT(numElements > 0 && elements != DE_NULL);
202 int numToWrite = de::min(numElements, m_blockSize-m_writePos);
218 int BlockBuffer<T>::readFromCurrentBlock (int numElements, T* elements, bool blocking
[all...] |
| deArrayBuffer.hpp | 52 ArrayBuffer (size_t numElements);
58 void setStorage (size_t numElements); // !< \note after a succesful call buffer contents are undefined
81 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (size_t numElements)
85 if (numElements)
88 const size_t storageSize = (numElements - 1) * Stride + sizeof(T);
95 m_cap = numElements;
140 void ArrayBuffer<T,Alignment,Stride>::setStorage (size_t numElements)
143 ArrayBuffer<T,Alignment,Stride> newBuffer(numElements);
|
| /external/deqp/framework/opengl/ |
| gluDrawUtil.hpp | 117 int numElements; //!< Number of elements in total.
126 , numElements (numElements_)
136 , numElements (0)
162 int numElements; //!< Number of elements to be drawn.
168 , numElements (numElements_)
176 , numElements (numElements_)
184 , numElements (0)
209 inline PrimitiveList NAME (int numElements) \
211 return PrimitiveList(TYPE, numElements); \
213 inline PrimitiveList NAME (int numElements, const deUint8* indices)
[all...] |
| gluDrawUtil.cpp | 47 int numElements;
62 , numElements (numElements_)
73 , numElements (0)
279 const int size = elementSize*va.pointer.numElements;
288 va.pointer.numElements,
305 dstVA.numElements == srcPtr.numElements);
316 for (int ndx = 0; ndx < dstVA.numElements; ndx++)
320 deMemcpy((deUint8*)dstBasePtr + (deUintptr)dstVA.pointer, srcPtr.data, elementSize*dstVA.numElements);
397 vertexArray.pointer.numElements,
[all...] |
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
| FixedTableModel.java | 58 private int numElements;
60 protected FixedTableModelIterator(FixedTableModel model, RectF tableRect, int numElements) {
63 this.numElements = numElements;
74 return !(lastElement >= numElements || (isColumnFinished() && isRowFinished()));
92 if (lastElement >= numElements) {
|
| TableSizingMethod.java | 21 * AUTO: The table is divided evenly int tableSize/numElements sections.
|
| /external/llvm/lib/Support/ |
| SmallPtrSet.cpp | 28 CurArraySize = NumElements > 16 ? 1 << (Log2_32_Ceil(NumElements) + 1) : 32;
29 NumElements = NumTombstones = 0;
41 for (const void **APtr = SmallArray, **E = SmallArray+NumElements;
47 if (NumElements < CurArraySize) {
48 SmallArray[NumElements++] = Ptr;
49 return std::make_pair(SmallArray + (NumElements - 1), true);
54 if (LLVM_UNLIKELY(NumElements * 4 >= CurArraySize * 3)) {
57 } else if (LLVM_UNLIKELY(CurArraySize - (NumElements + NumTombstones) <
73 ++NumElements; // Track density
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| CollectionSize.java | 70 private final Integer numElements;
72 CollectionSize(int numElements) {
74 this.numElements = numElements;
81 this.numElements = null;
90 if (numElements == null) {
94 return numElements;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineValueType.h | 522 static MVT getVectorVT(MVT VT, unsigned NumElements) {
527 if (NumElements == 2) return MVT::v2i1;
528 if (NumElements == 4) return MVT::v4i1;
529 if (NumElements == 8) return MVT::v8i1;
530 if (NumElements == 16) return MVT::v16i1;
531 if (NumElements == 32) return MVT::v32i1;
532 if (NumElements == 64) return MVT::v64i1;
535 if (NumElements == 1) return MVT::v1i8;
536 if (NumElements == 2) return MVT::v2i8;
537 if (NumElements == 4) return MVT::v4i8
[all...] |
| /external/deqp/framework/delibs/depool/ |
| dePoolHeap.h | 104 int numElements = TYPENAME##Array_getNumElements(array); \
108 if (childNdx0 < numElements) \
110 int childNdx1 = deMin32(childNdx0 + 1, numElements - 1); \
147 int numElements = TYPENAME##Array_getNumElements(array); \
148 if (!TYPENAME##Array_setSize(array, numElements + 1)) \
150 TYPENAME##Array_set(array, numElements, elem); \
151 TYPENAME##_moveUp(heap, numElements); \
159 int numElements = TYPENAME##Array_getNumElements(array); \
160 TYPENAME##Array_set(array, 0, TYPENAME##Array_get(array, numElements-1)); \
161 TYPENAME##Array_setSize(array, numElements-1);
[all...] |
| dePoolHashArray.h | 91 DE_ASSERT(ndx >= 0 && ndx < hashArray->array->numElements); \
140 int numElements = TYPENAME##Array_getNumElements(hashArray->array); \
141 DE_ASSERT(TYPENAME##Hash_getNumElements(hashArray->hash) == numElements); \
143 if (!TYPENAME##Array_setSize(hashArray->array, numElements+1) || \
144 !TYPENAME##Hash_insert(hashArray->hash, key, numElements)) \
146 TYPENAME##Array_set(hashArray->array, numElements, value); \
152 int numElements = TYPENAME##Array_getNumElements(hashArray->array); \
155 DE_ASSERT(TYPENAME##Hash_getNumElements(hashArray->hash) == numElements); \
156 if ((keys && !KEYARRAYTYPE##_setSize(keys, numElements)) || \
157 (values && !VALUEARRAYTYPE##_setSize(values, numElements))) \
[all...] |
| dePoolArray.h | 43 int numElements; /*!< Number of elements in the array. */
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...] |
| dePoolHash.c | 117 int numElements = deTestHash_getNumElements(hash);
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++)
|
| dePoolHashSet.c | 127 int numElements = deTestHash_getNumElements(hash);
131 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements);
134 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements);
139 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements);
140 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements);
142 for (ndx = 0; ndx < numElements; ndx++)
|
| /external/freetype/src/cff/ |
| cf2arrst.c | 96 size_t numElements )
104 size_t newSize = numElements * arrstack->sizeItem;
107 if ( numElements > LONG_MAX / arrstack->sizeItem )
115 arrstack->allocated = numElements;
118 if ( arrstack->count > numElements )
122 arrstack->count = numElements;
141 size_t numElements )
145 if ( numElements > arrstack->allocated )
148 if ( !cf2_arrstack_setNumElements( arrstack, numElements ) )
152 arrstack->count = numElements;
[all...] |
| /external/pdfium/third_party/freetype/src/cff/ |
| cf2arrst.c | 96 size_t numElements )
104 FT_Long newSize = (FT_Long)( numElements * arrstack->sizeItem );
107 if ( numElements > LONG_MAX / arrstack->sizeItem )
115 arrstack->allocated = numElements;
118 if ( arrstack->count > numElements )
122 arrstack->count = numElements;
141 size_t numElements )
145 if ( numElements > arrstack->allocated )
148 if ( !cf2_arrstack_setNumElements( arrstack, numElements ) )
152 arrstack->count = numElements;
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| ResizableDoubleArray.java | 55 * 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;
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 - 1)] = value
[all...] |
| /external/ceres-solver/internal/ceres/ |
| ordered_groups_test.cc | 44 EXPECT_EQ(ordering.NumElements(), 0);
60 EXPECT_EQ(ordering.NumElements(), 3);
69 EXPECT_EQ(ordering.NumElements(), 2);
87 EXPECT_EQ(ordering.NumElements(), 3);
96 EXPECT_EQ(ordering.NumElements(), 3);
115 EXPECT_EQ(ordering.NumElements(), 3);
126 EXPECT_EQ(ordering.NumElements(), 3);
144 EXPECT_EQ(ordering.NumElements(), 3);
154 EXPECT_EQ(ordering.NumElements(), 3);
174 EXPECT_EQ(ordering.NumElements(), 1)
[all...] |
| /external/deqp/framework/randomshaders/ |
| rsgVariableValue.cpp | 48 int numElements = (int)a.getType().getNumElements();
49 for (int ndx = 0; ndx < numElements; ndx++)
57 int numElements = (int)a.getType().getNumElements();
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();
214 for (int ndx = 0; ndx < numElements; ndx++)
219 int numElements = (int)a.getType().getNumElements();
223 for (int ndx = 0; ndx < numElements; ndx++
[all...] |
| rsgVariableType.hpp | 132 VariableType (Type baseType, int numElements = 0);
133 VariableType (Type baseType, const VariableType& elementType, int numElements);
186 inline VariableType::VariableType (Type baseType, int numElements)
190 , m_numElements (numElements)
196 inline VariableType::VariableType (Type baseType, const VariableType& elementType, int numElements)
200 , m_numElements (numElements)
|
| /frameworks/base/tests/RenderScriptTests/ModelViewer/src/com/android/modelviewer/ |
| SgTransform.java | 71 int numElements = mTransformData.transforms.length;
72 mTransformData.transformTypes = new int[numElements];
73 for (int i = 0; i < numElements; i ++) {
|
| /external/guava/guava/src/com/google/common/collect/ |
| Queues.java | 182 * {@code numElements} elements are not available, it will wait for them up to the specified
187 * @param numElements the number of elements to be waited for
194 public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements,
204 while (added < numElements) {
207 added += q.drainTo(buffer, numElements - added);
208 if (added < numElements) { // not enough elements immediately available; will have to poll
228 * @param numElements the number of elements to be waited for
235 int numElements, long timeout, TimeUnit unit) {
241 while (added < numElements) {
244 added += q.drainTo(buffer, numElements - added)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| dhcpsapi.h | 62 DWORD NumElements;
116 DWORD NumElements;
121 DWORD NumElements;
158 DWORD NumElements;
261 DWORD NumElements;
297 DWORD NumElements;
316 DWORD NumElements;
347 DWORD NumElements;
|
