/external/skia/include/core/ |
H A D | SkDeviceProperties.h | 62 static Layout fromOldLayout(SkFontLCDConfig::LCDOrder order) { argument 63 switch (order) {
|
/external/valgrind/main/helgrind/tests/ |
H A D | tc14_laog_dinphils.stderr.exp | 11 Thread #x: lock order "0x........ before 0x........" violated 13 Observed (incorrect) order is: acquisition of lock at 0x........
|
/external/chromium_org/components/keyed_service/core/ |
H A D | dependency_graph.cc | 44 std::vector<DependencyNode*>* order) { 48 *order = construction_order_; 52 bool DependencyGraph::GetDestructionOrder(std::vector<DependencyNode*>* order) { argument 56 *order = construction_order_; 58 // Destroy nodes in reverse order. 59 std::reverse(order->begin(), order->end()); 43 GetConstructionOrder( std::vector<DependencyNode*>* order) argument
|
/external/chromium_org/third_party/opus/src/silk/fixed/ |
H A D | 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) */ 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 ] );
|
H A D | noise_shape_analysis_FIX.c | 43 opus_int order 49 gain_Q24 = coefs_Q24[ order - 1 ]; 50 for( i = order - 2; i >= 0; i-- ) { 64 opus_int order 72 for( i = order - 1; i > 0; i-- ) { 82 for( i = 0; i < order; i++ ) { 90 for( i = 0; i < order; i++ ) { 103 for( i = 1; i < order; i++ ) { 109 for( i = 0; i < order; i++ ) { 118 silk_bwexpander_32( coefs_syn_Q24, order, chirp_Q1 [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | 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/ |
H A D | 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/ |
H A D | 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) */ 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 ] );
|
H A D | noise_shape_analysis_FIX.c | 43 opus_int order 49 gain_Q24 = coefs_Q24[ order - 1 ]; 50 for( i = order - 2; i >= 0; i-- ) { 64 opus_int order 72 for( i = order - 1; i > 0; i-- ) { 82 for( i = 0; i < order; i++ ) { 90 for( i = 0; i < order; i++ ) { 103 for( i = 1; i < order; i++ ) { 109 for( i = 0; i < order; i++ ) { 118 silk_bwexpander_32( coefs_syn_Q24, order, chirp_Q1 [all...] |
/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);
|
/external/skia/experimental/Intersection/ |
H A D | 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/aac/libAACenc/src/ |
H A D | 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[subBlockNumbe [all...] |
/external/libexif/libexif/canon/ |
H A D | 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) / [all...] |
/external/pdfium/core/src/fpdftext/ |
H A D | 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 [all...] |
/external/bison/src/ |
H A D | tables.c | 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]; 615 order[ [all...] |
/external/deqp/modules/gles31/functional/ |
H A D | 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/ |
H A D | gluTextureUtil.cpp | 70 switch (texFormat.order) 112 case TextureFormat::UNSIGNED_INT_24_8: type = texFormat.order == TextureFormat::D 140 switch (PACK_FMT(texFormat.order, texFormat.type)) 711 if (format.order == TextureFormat::D || format.order == TextureFormat::DS) 714 if (format.order == TextureFormat::S) 747 if (format.order == TextureFormat::D || format.order == TextureFormat::DS) 750 if (format.order == TextureFormat::S) 783 if (format.order [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | RopTranslator.java | 77 /** {@code null-ok;} block output order; becomes non-null in {@link #pickOrder} */ 78 private int[] order; field in class:RopTranslator 84 * true if the parameters to this method happen to be in proper order 128 this.order = null; 153 * If params are not in order, we will need register space 171 * method happen to slot the params in an order at the top of the 216 new StdCatchBuilder(method, order, addresses); 227 int[] order = this.order; 228 int len = order [all...] |
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | tscoll.cpp | 433 if (o != orders[index].order) { 437 while (index > 0 && orders[--index].order == 0) { 441 if (o != orders[index].order) { 442 errln("Mismatched order at index %d: 0x%0:8X vs. 0x%0:8X", index, 443 orders[index].order, o); 461 while (index != 0 && orders[index - 1].order == 0) 509 int32_t order; local 510 while ((order = iter.next(status)) != CollationElementIterator::NULLORDER) 521 orders[size].order = order; [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | tscoll.cpp | 415 if (o != orders[index].order) { 419 while (index > 0 && orders[--index].order == 0) { 423 if (o != orders[index].order) { 424 errln("Mismatched order at index %d: 0x%0:8X vs. 0x%0:8X", index, 425 orders[index].order, o); 443 while (index != 0 && orders[index - 1].order == 0) 491 int32_t order; local 492 while ((order = iter.next(status)) != CollationElementIterator::NULLORDER) 503 orders[size].order = order; [all...] |
/external/chromium_org/third_party/opus/src/silk/float/ |
H A D | prefilter_FLP.c | 51 silk_float state[], /* I/O State [order + 1] */ 53 const silk_float coef[], /* I Coefficients [order] */ 57 const opus_int order /* I Filter order (even) */ 64 silk_assert( ( order & 1 ) == 0 ); 75 for( i = 2; i < order; i += 2 ) { 85 state[ order ] = tmp1; 86 acc += coef[ order - 1 ] * tmp1;
|
/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/chromium_org/v8/src/ |
H A D | cpu-profiler.h | 45 mutable unsigned order; member in class:v8::internal::CodeEventRecord 101 explicit TickSampleEventRecord(unsigned order) : order(order) { } argument 103 unsigned order; member in class:v8::internal::TickSampleEventRecord
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstTesting.java | 135 static void assertInOrderTraversalIs(@Nullable SimpleNode root, String order) { argument 137 assertEquals("", order); 143 assertEquals(order.charAt(0), path 150 assertEquals(order.charAt(i), path 155 assertEquals(i, order.length());
|
/external/libopus/silk/float/ |
H A D | prefilter_FLP.c | 51 silk_float state[], /* I/O State [order + 1] */ 53 const silk_float coef[], /* I Coefficients [order] */ 57 const opus_int order /* I Filter order (even) */ 64 silk_assert( ( order & 1 ) == 0 ); 75 for( i = 2; i < order; i += 2 ) { 85 state[ order ] = tmp1; 86 acc += coef[ order - 1 ] * tmp1;
|