HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 376 - 400 of 1639) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/armv7/
omxSP_FFTFwd_RToCCS_F32_Sfs_s.S 72 #define order r14 define
151 CLZ order,N @// N = 2^order
152 RSB order,order,#31
157 CMP order,#1
158 BGT orderGreaterthan1 @// order > 1
174 TST order, #2 @// Set input args to fft stages
180 @//check for even or odd order
188 TST order,#0x0000000
    [all...]
  /external/skia/src/ports/
SkFontConfigParser_android.cpp 111 familyData->currentFamily->order = -1;
112 // The Family tag has an optional "order" attribute with an integer value >= 0
119 familyData->currentFamily->order = value;
231 // This loop inserts the vendor fallback fonts in the correct order in the
236 int order = family->order; local
237 if (order < 0) {
242 // no order specified on this font, but we're incrementing the order
243 // based on an earlier order insertion reques
    [all...]
  /hardware/intel/common/utils/ituxd/src/com/intel/thermal/
VirtualThermalZone.java 29 * zone state by computing the equation, which can be linear / higher order implementation
213 Integer weights[], order[]; local
222 order = sa.getOrder();
223 if (weights == null && order == null) return rawSensorTemp;
225 if (order == null) {
228 } else if (order != null && weights.length == order.length) {
229 // if order array is provided in xml,
234 sensorTemp += (weights[i] * (int) Math.pow(rawSensorTemp, order[i])) / 1000;
  /external/chromium_org/third_party/skia/src/pathops/
SkReduceOrder.cpp 265 int order = reducer.reduce(quad); local
266 if (order == 2) { // quad became line
267 for (int index = 0; index < order; ++index) {
271 return SkPathOpsPointsToVerb(order - 1);
278 int order = reducer.reduce(cubic, kAllow_Quadratics); local
279 if (order == 2 || order == 3) { // cubic became line or quad
280 for (int index = 0; index < order; ++index) {
284 return SkPathOpsPointsToVerb(order - 1);
  /external/skia/src/pathops/
SkReduceOrder.cpp 265 int order = reducer.reduce(quad); local
266 if (order == 2) { // quad became line
267 for (int index = 0; index < order; ++index) {
271 return SkPathOpsPointsToVerb(order - 1);
278 int order = reducer.reduce(cubic, kAllow_Quadratics); local
279 if (order == 2 || order == 3) { // cubic became line or quad
280 for (int index = 0; index < order; ++index) {
284 return SkPathOpsPointsToVerb(order - 1);
  /external/wpa_supplicant_8/src/eap_common/
eap_pwd_common.c 123 grp->order = NULL;
134 ((grp->order = BN_new()) == NULL) ||
147 if (!EC_GROUP_get_order(grp->group, grp->order, NULL)) {
148 wpa_printf(MSG_INFO, "EAP-pwd: unable to get order for curve");
250 "multiply generator by order");
270 BN_clear_free(grp->order);
271 grp->order = NULL;
276 /* cleanliness and order.... */
310 offset = BN_num_bytes(grp->order) - BN_num_bytes(peer_scalar);
313 eap_pwd_h_update(hash, cruft, BN_num_bytes(grp->order));
    [all...]
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/
GLWorld.java 37 bb.order(ByteOrder.nativeOrder());
41 bb.order(ByteOrder.nativeOrder());
45 bb.order(ByteOrder.nativeOrder());
  /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/
filters.c 20 int16_t order,
48 for (i = 1; i < order + 1; i++) {
59 return(order + 1);
  /external/openssl/crypto/ec/
ec_key.c 243 BIGNUM *priv_key = NULL, *order = NULL; local
257 if ((order = BN_new()) == NULL) goto err;
269 if (!EC_GROUP_get_order(eckey->group, order, ctx))
273 if (!BN_rand_range(priv_key, order))
295 if (order)
296 BN_free(order);
310 const BIGNUM *order = NULL; local
336 /* testing whether pub_key * order is the point at infinity */
337 order = &eckey->group->order;
    [all...]
  /external/openssl/crypto/
mem_dbg.c 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
filters.c 30 WebRtc_Word16 order,
54 for (i = 1; i < order + 1; i++) {
65 return(order + 1);
  /frameworks/native/opengl/tests/gldual/src/com/android/gldual/
TriangleRenderer.java 119 // must have their byte order set to native order
122 vbb.order(ByteOrder.nativeOrder());
126 tbb.order(ByteOrder.nativeOrder());
129 ibb.order(ByteOrder.nativeOrder());
  /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/
GLUtils.java 47 FloatBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asFloatBuffer();
61 IntBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asIntBuffer();
75 ShortBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asShortBuffer();
  /external/chromium_org/mojo/public/java/bindings/src/org/chromium/mojo/bindings/
ServiceMessage.java 60 truncatedBuffer.order(ByteOrder.nativeOrder());
  /external/chromium_org/third_party/WebKit/Source/core/paint/
GridPainter.cpp 33 if (firstChild.first->style()->order() != secondChild.first->style()->order())
34 return firstChild.first->style()->order() < secondChild.first->style()->order();
65 // Sort grid items following order-modified document order.
66 // See http://www.w3.org/TR/css-flexbox/#order-modified-document-order
  /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
double.h 186 // Returns the significand size for a given order of magnitude.
187 // If v = f*2^e with 2^p-1 <= f <= 2^p then p+e is v's order of magnitude.
192 static int SignificandSizeForOrderOfMagnitude(int order) {
193 if (order >= (kDenormalExponent + kSignificandSize)) {
196 if (order <= kDenormalExponent) return 0;
197 return order - kDenormalExponent;
  /external/chromium_org/third_party/skia/src/core/
SkTileGrid.h 54 size_t order; // Insertion order. Used to preserve order when merging multiple tiles. member in struct:SkTileGrid::Entry
62 // (fXTiles * fYTiles) SkTDArrays, each listing data overlapping that tile in insertion order.
  /external/chromium_org/v8/src/
double.h 157 // Returns the significand size for a given order of magnitude.
158 // If v = f*2^e with 2^p-1 <= f <= 2^p then p+e is v's order of magnitude.
163 static int SignificandSizeForOrderOfMagnitude(int order) {
164 if (order >= (kDenormalExponent + kSignificandSize)) {
167 if (order <= kDenormalExponent) return 0;
168 return order - kDenormalExponent;
  /external/eigen/unsupported/Eigen/src/Splines/
Spline.h 109 * \brief Evaluation of spline derivatives of up-to given order.
115 * for i ranging between 0 and order.
118 * \param order The order up to which the derivatives are computed.
121 derivatives(Scalar u, DenseIndex order) const;
130 derivatives(Scalar u, DenseIndex order = DerivativeOrder) const;
152 * \brief Computes the non-zero spline basis function derivatives up to given order.
158 * with i ranging from 0 up to the specified order.
162 * \param order The order up to which the basis function derivatives are computes
    [all...]
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
TestEnumSetGenerator.java 59 public List<AnEnum> order(List<AnEnum> insertionOrder) { method in class:TestEnumSetGenerator
TestStringCollectionGenerator.java 57 public List<String> order(List<String> insertionOrder) { method in class:TestStringCollectionGenerator
TestStringListGenerator.java 60 public List<String> order(List<String> insertionOrder) { method in class:TestStringListGenerator
TestStringQueueGenerator.java 58 public List<String> order(List<String> insertionOrder) { method in class:TestStringQueueGenerator
TestStringSetGenerator.java 58 * <p>By default, returns the supplied elements in their given order; however,
59 * generators for containers with a known order other than insertion order
68 public List<String> order(List<String> insertionOrder) { method in class:TestStringSetGenerator
TestUnhashableCollectionGenerator.java 61 public Iterable<UnhashableObject> order( method in class:TestUnhashableCollectionGenerator

Completed in 1073 milliseconds

<<11121314151617181920>>