/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 64 int order; local 110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 111 if (order != 1) { 112 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order); 119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 120 if (order == 1) { 121 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order); 122 order [all...] |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 86 int order = reducer.reduce(quad); local 87 if (order < 3) {
|
/external/chromium_org/third_party/speex/libspeex/ |
H A D | quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) argument 75 for (i=0;i<order;i++) 81 if (i==order-1) 159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 165 for (i=0;i<order;i++) 168 compute_quant_weights(qlsp, quant_weight, order); 170 for (i=0;i<order;i++) 174 for (i=0;i<order;i++) 177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); 180 for (i=0;i<order; 213 lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 242 lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 283 lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 306 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 310 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 319 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 366 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument [all...] |
/external/chromium_org/third_party/zlib/ |
H A D | infback.c | 260 static const unsigned short order[19] = /* permutation of code lengths */ local 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 375 state->lens[order[state->have++]] = 0;
|
/external/chromium_org/ui/views/widget/ |
H A D | window_reorderer.cc | 33 // Sets |order| to the list of views whose layer / associated window's layer 34 // is a child of |parent_layer|. |order| is sorted in ascending z-order of 42 std::vector<views::View*>* order) { 45 DCHECK(order); 47 order->push_back(view); 50 order->push_back(view); 54 GetOrderOfViewsWithLayers(view->child_at(i), parent_layer, hosts, order); 155 // Compute the desired z-order of the layers based on the order o 38 GetOrderOfViewsWithLayers( views::View* view, ui::Layer* parent_layer, const std::map<views::View*, aura::Window*>& hosts, std::vector<views::View*>* order) argument [all...] |
/external/emma/core/java12/com/vladium/emma/report/ |
H A D | IItem.java | 31 * @param order [null is equivalent to no sort] 34 Iterator /* IItem */ getChildren (ItemComparator /* IItem */ order); argument
|
H A D | Item.java | 44 public final Iterator getChildren (final ItemComparator /* IItem */ order) argument 46 // TODO: soft caching keyed off 'order' 48 if (order == null) 55 Arrays.sort (items, order);
|
/external/flac/libFLAC/ |
H A D | fixed.c | 235 unsigned i, order; local 246 order = 0; 248 order = 1; 250 order = 2; 252 order = 3; 254 order = 4; 278 return order; 297 unsigned i, order; local 308 order = 0; 310 order 352 FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]) argument 395 FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]) argument [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | MapTestSuiteBuilder.java | 206 public Iterable<Map.Entry<K, V>> order( method in class:MapTestSuiteBuilder.MapEntrySetGenerator 208 return mapGenerator.order(insertionOrder); 270 public Iterable<K> order(List<K> insertionOrder) { method in class:MapTestSuiteBuilder.MapKeySetGenerator 329 public Iterable<V> order(List<V> insertionOrder) { method in class:MapTestSuiteBuilder.MapValueCollectionGenerator
|
H A D | NavigableMapTestSuiteBuilder.java | 106 * the relative order of these extreme values rather than relying on their 238 public Iterable<Entry<K, V>> order(List<Entry<K, V>> insertionOrder) { method in class:NavigableMapTestSuiteBuilder.ForwardingTestMapGenerator 239 return delegate.order(insertionOrder);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | SetGenerators.java | 135 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetExplicitComparator 153 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetExplicitSuperclassComparatorGenerator 168 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetReversedOrderGenerator
|
H A D | SortedMultisetTestSuiteBuilder.java | 240 public Iterable<E> order(List<E> insertionOrder) { 241 return ImmutableList.copyOf(super.order(insertionOrder)).reverse(); 269 public Iterable<E> order(List<E> insertionOrder) { method in class:SortedMultisetTestSuiteBuilder.ForwardingTestMultisetGenerator 270 return delegate.order(insertionOrder);
|
/external/libexif/libexif/ |
H A D | exif-utils.c | 87 exif_get_sshort (const unsigned char *buf, ExifByteOrder order) argument 90 switch (order) { 102 exif_get_short (const unsigned char *buf, ExifByteOrder order) argument 104 return (exif_get_sshort (buf, order) & 0xffff); 108 exif_set_sshort (unsigned char *b, ExifByteOrder order, ExifSShort value) argument 111 switch (order) { 124 exif_set_short (unsigned char *b, ExifByteOrder order, ExifShort value) argument 126 exif_set_sshort (b, order, value); 130 exif_get_slong (const unsigned char *b, ExifByteOrder order) argument 133 switch (order) { 145 exif_set_slong(unsigned char *b, ExifByteOrder order, ExifSLong value) argument 165 exif_get_long(const unsigned char *buf, ExifByteOrder order) argument 171 exif_set_long(unsigned char *b, ExifByteOrder order, ExifLong value) argument 177 exif_get_srational(const unsigned char *buf, ExifByteOrder order) argument 188 exif_get_rational(const unsigned char *buf, ExifByteOrder order) argument 199 exif_set_rational(unsigned char *buf, ExifByteOrder order, ExifRational value) argument 208 exif_set_srational(unsigned char *buf, ExifByteOrder order, ExifSRational value) argument [all...] |
/external/libexif/libexif/fuji/ |
H A D | exif-mnote-data-fuji.c | 26 #include <libexif/exif-byte-order.h> 32 ExifByteOrder order; member in struct:_MNoteFujiDataPrivate 105 exif_set_long (*buf + 8, n->order, 12); 108 exif_set_short (*buf + 8 + 4, n->order, (ExifShort) n->count); 113 exif_set_short (*buf + o + 0, n->order, (ExifShort) n->entries[i].tag); 114 exif_set_short (*buf + o + 2, n->order, (ExifShort) n->entries[i].format); 115 exif_set_long (*buf + o + 4, n->order, n->entries[i].components); 138 exif_set_long (*buf + o, n->order, doff); 171 n->order = EXIF_BYTE_ORDER_INTEL; 204 n->entries[tcount].tag = exif_get_short (buf + o, n->order); [all...] |
/external/libvorbis/doc/ |
H A D | 04-codec.tex | 20 packets are, in order, the identification header, the comments header, 39 is an audio packet). The packets must occur in the order of 63 \varname{[vorbis_version]} is to read '0' in order to be compatible 101 needed for decode. The setup header contains, in order, the lists of 106 proceeds in the following order: 112 \item Decode \varname{[vorbis_codebook_count]} codebooks in order as defined 114 order, in an array of 384 Floor curves are decoded one-by-one in channel order. 438 Unlike floors, which are decoded in channel order, the residue vectors 439 are decoded in submap order [all...] |
/external/mesa3d/src/mesa/math/ |
H A D | m_eval.c | 75 GLuint dim, GLuint order) 80 if (order >= 2) { 81 bincoeff = (GLfloat) (order - 1); 87 for (i = 2, cp += 2 * dim, powert = t * t; i < order; 89 bincoeff *= (GLfloat) (order - i); 96 else { /* order=1 -> constant curve */ 74 _math_horner_bezier_curve(const GLfloat * cp, GLfloat * out, GLfloat t, GLuint dim, GLuint order) argument
|
/external/openssl/crypto/ec/ |
H A D | eck_prn.c | 155 *order=NULL, *cofactor=NULL; local 204 (b = BN_new()) == NULL || (order = BN_new()) == NULL || 234 if (!EC_GROUP_get_order(x, order, NULL) || 257 if (buf_len < (i = (size_t)BN_num_bytes(order))) 326 if ((order != NULL) && !ASN1_bn_print(bp, "Order: ", order, 345 if (order) 346 BN_free(order);
|
/external/openssl/crypto/ecdsa/ |
H A D | 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);
|
H A D | ecs_ossl.c | 96 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local 120 order = BN_new(); 122 if (!k || !r || !order || !X) 132 if (!EC_GROUP_get_order(group, order, ctx)) 146 k, order, 158 if (!BN_rand_range(k, order)) 171 if (!BN_add(k, k, order)) goto err; 172 if (BN_num_bits(k) <= BN_num_bits(order)) 173 if (!BN_add(k, k, order)) goto err; 201 if (!BN_nnmod(r, X, order, ct 246 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL; local 378 BIGNUM *order, *u1, *u2, *m, *X; local [all...] |
/external/qemu/distrib/zlib-1.2.8/ |
H A D | infback.c | 269 static const unsigned short order[19] = /* permutation of code lengths */ local 380 state->lens[order[state->have++]] = (unsigned short)BITS(3); 384 state->lens[order[state->have++]] = 0;
|
/external/skia/experimental/Intersection/ |
H A D | CubicIntersection.cpp | 37 int order = reduceOrder(quad, simple, kReduceOrder_TreatAsFill); local 47 if (order > 1) { 50 if (order > 2) { 54 SkASSERT(order < 4 && order > 0); 56 return order;
|
H A D | CubicReduceOrder_Test.cpp | 16 int order; local 49 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 51 if (order != 1) { 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 57 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 59 if (order == 1) { 60 SkDebugf("[%d] notPointDegenerates order=%d\n", (int) index, order); 65 order [all...] |
/external/skia/include/core/ |
H A D | SkDeviceProperties.h | 62 static Layout fromOldLayout(SkFontLCDConfig::LCDOrder order) { argument 63 switch (order) {
|
/external/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 33 int order = reducer->reduce(quad); local 46 if (order > 1) { 49 if (order > 2) { 53 SkASSERT(order < 4 && order > 0); 56 return order;
|
H A D | SkDCubicToQuads.cpp | 117 // it would still take the prechopped cubic for reduce order and find cubic inflections 120 int order = reducer.reduce(*this, SkReduceOrder::kAllow_Quadratics); local 121 if (order < 3) {
|