| /ndk/tests/device/b8708181-Vector4/jni/ |
| Android.mk | 10 # x86 ABI was recently changed to gen SSSE3 by default. Disable it in order
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/ |
| tree_policy.hpp | 90 // entry with the __order order, or a const_iterator to the
91 // container object's end if order is at least the size of the
94 find_by_order(size_type order) const;
97 // with the __order order, or an iterator to the container
98 // object's end if order is at least the size of the container
101 find_by_order(size_type order);
103 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdipluspen.h | 205 MatrixOrder order = MatrixOrderPrepend)
209 matrix ? matrix->nativeMatrix : NULL, order));
217 MatrixOrder order = MatrixOrderPrepend)
220 nativePen, angle, order));
223 MatrixOrder order = MatrixOrderPrepend)
226 nativePen, sx, sy, order));
317 MatrixOrder order = MatrixOrderPrepend)
320 nativePen, dx, dy, order));
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 89 // entry with the __order order, or a const_iterator to the
90 // container object's end if order is at least the size of the
93 find_by_order(size_type order) const;
96 // with the __order order, or an iterator to the container
97 // object's end if order is at least the size of the container
100 find_by_order(size_type order);
102 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 89 // entry with the __order order, or a const_iterator to the
90 // container object's end if order is at least the size of the
93 find_by_order(size_type order) const;
96 // with the __order order, or an iterator to the container
97 // object's end if order is at least the size of the container
100 find_by_order(size_type order);
102 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 89 // entry with the __order order, or a const_iterator to the
90 // container object's end if order is at least the size of the
93 find_by_order(size_type order) const;
96 // with the __order order, or an iterator to the container
97 // object's end if order is at least the size of the container
100 find_by_order(size_type order);
102 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/ |
| tree_policy.hpp | 89 // entry with the __order order, or a const_iterator to the
90 // container object's end if order is at least the size of the
93 find_by_order(size_type order) const;
96 // with the __order order, or an iterator to the container
97 // object's end if order is at least the size of the container
100 find_by_order(size_type order);
102 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| tree_policy.hpp | 90 // entry with the __order order, or a const_iterator to the
91 // container object's end if order is at least the size of the
94 find_by_order(size_type order) const;
97 // with the __order order, or an iterator to the container
98 // object's end if order is at least the size of the container
101 find_by_order(size_type order);
103 // Returns the order of a key within a sequence. For exapmle, if
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| tree_policy.hpp | 90 // entry with the __order order, or a const_iterator to the
91 // container object's end if order is at least the size of the
94 find_by_order(size_type order) const;
97 // with the __order order, or an iterator to the container
98 // object's end if order is at least the size of the container
101 find_by_order(size_type order);
103 // Returns the order of a key within a sequence. For exapmle, if
|
| /cts/tests/tests/opengl/src/android/opengl/cts/ |
| RendererOneColorBufferTest.java | 59 // The order we like to connect them.
67 .order(ByteOrder.nativeOrder()).asFloatBuffer();
71 ibb.order(ByteOrder.nativeOrder());
77 order(ByteOrder.nativeOrder()).asFloatBuffer();
85 .order(ByteOrder.nativeOrder()).asFloatBuffer();
89 ibb.order(ByteOrder.nativeOrder());
95 order(ByteOrder.nativeOrder()).asFloatBuffer();
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph.cc | 44 std::vector<DependencyNode*>* order) {
48 *order = construction_order_;
52 bool DependencyGraph::GetDestructionOrder(std::vector<DependencyNode*>* order) {
56 *order = construction_order_;
58 // Destroy nodes in reverse order.
59 std::reverse(order->begin(), order->end());
|
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| prefilter_FIX.c | 49 opus_int32 state[], /* I/O State [order + 1] */
51 const opus_int16 coef_Q13[], /* I Coefficients [order] */
55 const opus_int order /* I Filter order (even) */
61 /* Order must be even */
62 silk_assert( ( order & 1 ) == 0 );
71 acc_Q11 = silk_RSHIFT( order, 1 );
74 for( i = 2; i < order; i += 2 ) {
84 state[ order ] = tmp1;
85 acc_Q11 = silk_SMLAWB( acc_Q11, tmp1, coef_Q13[ order - 1 ] )
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicToQuadratics.cpp | 98 int order = 0; local
107 if (order < o1) {
108 order = o1;
113 return order;
143 // it would still take the prechopped cubic for reduce order and find cubic inflections
146 int order = reduceOrder(cubic, reduced, kReduceOrder_QuadraticsAllowed,
148 if (order < 3) {
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| SortedMapGenerators.java | 66 @Override public List<String> order(List<String> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapKeySetGenerator
95 public List<String> order(List<String> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapValuesGenerator
119 @Override public List<Entry<String, String>> order( method in class:SortedMapGenerators.ImmutableSortedMapSubMapEntryGenerator
137 @Override public List<String> order(List<String> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapHeadMapKeySetGenerator
167 public List<String> order(List<String> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapTailMapValuesGenerator
189 @Override public List<Entry<String, String>> order( method in class:SortedMapGenerators.ImmutableSortedMapEntrySetGenerator
|
| /external/libopus/silk/fixed/ |
| prefilter_FIX.c | 49 opus_int32 state[], /* I/O State [order + 1] */
51 const opus_int16 coef_Q13[], /* I Coefficients [order] */
55 const opus_int order /* I Filter order (even) */
61 /* Order must be even */
62 silk_assert( ( order & 1 ) == 0 );
71 acc_Q11 = silk_RSHIFT( order, 1 );
74 for( i = 2; i < order; i += 2 ) {
84 state[ order ] = tmp1;
85 acc_Q11 = silk_SMLAWB( acc_Q11, tmp1, coef_Q13[ order - 1 ] )
[all...] |
| /external/openssl/crypto/ecdsa/ |
| ecs_lib.c | 231 BIGNUM *order=NULL; local
241 if ((order = BN_new()) == NULL) return 0;
242 if (!EC_GROUP_get_order(group,order,NULL))
244 BN_clear_free(order);
247 i=BN_num_bits(order);
257 BN_clear_free(order);
|
| /external/skia/experimental/Intersection/ |
| CubicToQuadratics.cpp | 98 int order = 0; local
107 if (order < o1) {
108 order = o1;
113 return order;
143 // it would still take the prechopped cubic for reduce order and find cubic inflections
146 int order = reduceOrder(cubic, reduced, kReduceOrder_QuadraticsAllowed,
148 if (order < 3) {
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/ |
| Utils.java | 87 converter.order(ByteOrder.nativeOrder());
93 converter.order(ByteOrder.nativeOrder());
99 converter.order(ByteOrder.nativeOrder());
107 converter.order(ByteOrder.BIG_ENDIAN);
120 converter.order(ByteOrder.BIG_ENDIAN);
140 converter.order(ByteOrder.BIG_ENDIAN);
|
| /external/aac/libAACenc/src/ |
| aacenc_tns.cpp | 120 INT tnsLimitOrder[MAX_NUM_OF_FILTERS]; /* Limit for TNS order TABUL*/
216 const INT order,
223 const INT order,
238 const INT order,
388 /* initialize TNS filter flag, order, and coefficient resolution (in bits per coeff) */
432 /* compute autocorrelation window based on maximum filter order for given block type */
774 tnsInfo->order [subBlockNumber][HIFILT] = tnsInfo->order [subBlockNumber][LOFILT] = 0;
800 /* reduce filter order by truncating trailing zeros, compute sum(abs(coefs)) */
807 tnsInfo->order[subBlockNumber][HIFILT] = i + 1
[all...] |
| /external/libexif/libexif/canon/ |
| mnote-canon-entry.c | 520 val = exif_get_short (entry->data, entry->order);
570 n = exif_get_short (data, entry->order) / 2;
573 vs = exif_get_short (data + 2 + t * 2, entry->order);
617 vs = exif_get_short (data + t * 2, entry->order);
633 n = exif_get_short (data, entry->order) / 2;
636 vs = exif_get_short (data + 2 + t * 2, entry->order);
686 vs = exif_get_short (data + t * 2, entry->order);
707 vl = exif_get_long (data, entry->order);
716 vl = exif_get_long (data, entry->order);
722 n = exif_get_short (data, entry->order) / 2
[all...] |
| /external/pdfium/core/src/fpdftext/ |
| fpdf_text.cpp | 317 CFX_WordArray order;
local
324 order.Add(start);
325 order.Add(count);
326 order.Add(ret);
338 order.Add(start);
339 order.Add(count);
340 order.Add(ret);
353 int count = order.GetSize();
355 int ret = order.GetAt(j);
356 int start = order.GetAt(j - 2);
[all...] |
| /external/bison/src/ |
| tables.c | 102 /* FROMS and TOS are reordered to be compressed. ORDER[VECTOR] is the
105 static vector_number *order; variable
129 but in order to keep small tables, renumbered as TABLE_ERROR, which
258 lookahead (in reverse order to give precedence to the first
587 | Compute ORDER, a reordering of vectors, in order to decide how to |
606 while (j >= 0 && (width[order[j]] < w))
609 while (j >= 0 && (width[order[j]] == w) && (tally[order[j]] < t))
613 order[k + 1] = order[k]
[all...] |
| /external/deqp/modules/gles31/functional/ |
| es31fFboColorbufferTests.cpp | 193 log << TestLog::Message << "Rendering test images to layer-faces in randomized order" << TestLog::EndMessage;
196 std::vector<int> order(fbos.size());
198 for (size_t n = 0; n < order.size(); n++)
199 order[n] = (int)n;
200 rnd.shuffle(order.begin(), order.end());
202 for (size_t ndx = 0; ndx < order.size(); ndx++)
204 const int layerFace = order[ndx];
|
| /external/deqp/framework/opengl/ |
| gluTextureUtil.cpp | 70 switch (texFormat.order)
112 case TextureFormat::UNSIGNED_INT_24_8: type = texFormat.order == TextureFormat::D
137 #define PACK_FMT(ORDER, TYPE) ((int(ORDER) << 16) | int(TYPE))
138 #define FMT_CASE(ORDER, TYPE) PACK_FMT(tcu::TextureFormat::ORDER, tcu::TextureFormat::TYPE)
140 switch (PACK_FMT(texFormat.order, texFormat.type))
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 73 /** {@code null-ok;} block output order; becomes non-null in {@link #pickOrder} */
74 private int[] order; field in class:RopTranslator
80 * true if the parameters to this method happen to be in proper order
122 this.order = null;
147 * If params are not in order, we will need register space
165 * method happen to slot the params in an order at the top of the
209 new StdCatchBuilder(method, order, addresses);
220 int[] order = this.order; local
221 int len = order.length
316 int[] order = new int[sz]; local
[all...] |
