/external/aac/libAACdec/src/ |
H A D | aacdec_tns.cpp | 133 UCHAR n_filt,order; local 176 filter->Order = order = (UCHAR) FDKreadBits(bs, isLongFlag ? 5 : 3); 180 filter->Order = order = TNS_MAXIMUM_ORDER; 183 if (order) 200 for (i=0; i < order; i++) 216 static void CTns_Filter (FIXP_DBL *spec, int size, int inc, FIXP_TCC coeff [], int order) argument 218 // - Simple all-pole filter of order "order" defined by 219 // y(n) = x(n) - a(2)*y(n-1) - ... - a(order+1)*y(n-order) [all...] |
/external/aac/libAACenc/src/ |
H A D | aacenc_tns.h | 114 /* TNS max filter order for Low Complexity MPEG4 profile */ 124 INT tnsLimitOrder[MAX_NUM_OF_FILTERS]; /* Limit for TNS order TABUL*/ 136 INT maxOrder; /* max. order of tns filter */ 182 INT order[TRANS_FAC][MAX_NUM_OF_FILTERS]; member in struct:__anon85
|
/external/apache-xml/src/main/java/org/apache/xalan/processor/ |
H A D | XSLTElementDef.java | 139 * @param order the order this element should appear according to the XSLT specification. 145 boolean has_required, boolean required, int order, 151 this.m_order = order; 168 * @param order the order this element should appear according to the XSLT specification. 174 boolean has_required, boolean required, boolean has_order, int order, 180 this.m_order = order; 196 * @param order the order thi 142 XSLTElementDef(XSLTSchema schema, String namespace, String name, String nameAlias, XSLTElementDef[] elements, XSLTAttributeDef[] attributes, XSLTElementProcessor contentHandler, Class classObject, boolean has_required, boolean required, int order, boolean multiAllowed) argument 171 XSLTElementDef(XSLTSchema schema, String namespace, String name, String nameAlias, XSLTElementDef[] elements, XSLTAttributeDef[] attributes, XSLTElementProcessor contentHandler, Class classObject, boolean has_required, boolean required, boolean has_order, int order, boolean multiAllowed) argument 199 XSLTElementDef(XSLTSchema schema, String namespace, String name, String nameAlias, XSLTElementDef[] elements, XSLTAttributeDef[] attributes, XSLTElementProcessor contentHandler, Class classObject, boolean has_order, int order, boolean multiAllowed) argument 224 XSLTElementDef(XSLTSchema schema, String namespace, String name, String nameAlias, XSLTElementDef[] elements, XSLTAttributeDef[] attributes, XSLTElementProcessor contentHandler, Class classObject, int order, boolean multiAllowed) argument 814 setLastOrder(int order) argument [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/blktrace/ |
H A D | blkparse.c | 857 struct rb_root *root, int order) 886 if (order && prev) { 856 trace_rb_find(dev_t device, unsigned long sequence, struct rb_root *root, int order) argument
|
/external/checkpolicy/ |
H A D | policy_define.c | 830 int order; local 844 order = 0; 861 datum->level->sens = ++order; 867 if (order != policydbp->p_levels.nprim) { 4172 /* Preserve the matching order specified in the configuration. */ 4331 /* Create order of most specific to least retaining 4332 the order specified in the configuration. */ 4424 /* Create order of most specific to least retaining 4425 the order specified in the configuration. */
|
/external/chromium_org/base/message_loop/ |
H A D | message_loop_test.cc | 144 // Test that two tasks with different delays run in the right order. 169 // Test that two tasks with the same delay run in the order in which they 454 void RecursiveFunc(TaskList* order, int cookie, int depth, argument 456 order->RecordStart(RECURSIVE, cookie); 462 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant)); 464 order->RecordEnd(RECURSIVE, cookie); 467 void QuitFunc(TaskList* order, int cookie) { argument 468 order->RecordStart(QUITMESSAGELOOP, cookie); 470 order->RecordEnd(QUITMESSAGELOOP, cookie); 477 TaskList order; local 508 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument 514 OrderedFunc(TaskList* order, int cookie) argument 524 TaskList order; local 564 TaskList order; local 597 TaskList order; local 618 FuncThatPumps(TaskList* order, int cookie) argument 627 SleepFunc(TaskList* order, int cookie, TimeDelta delay) argument 639 TaskList order; local 690 FuncThatRuns(TaskList* order, int cookie, RunLoop* run_loop) argument 707 TaskList order; local 742 TaskList order; local 772 TaskList order; local 802 TaskList order; local 835 TaskList order; local 904 TaskList order; local 925 TaskList order; local 952 TaskList order; local [all...] |
H A D | message_loop_unittest.cc | 160 // Saves the order in which the tasks executed. 231 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { argument 232 order->RecordStart(MESSAGEBOX, cookie); 236 order->RecordEnd(MESSAGEBOX, cookie); 240 void EndDialogFunc(TaskList* order, int cookie) { argument 241 order->RecordStart(ENDDIALOG, cookie); 247 order->RecordEnd(ENDDIALOG, cookie); 251 void RecursiveFunc(TaskList* order, int cookie, int depth, argument 253 order->RecordStart(RECURSIVE, cookie); 259 Bind(&RecursiveFunc, order, cooki 264 QuitFunc(TaskList* order, int cookie) argument 270 RecursiveFuncWin(MessageLoop* target, HANDLE event, bool expect_window, TaskList* order, bool is_reentrant) argument 326 TaskList order; local 370 TaskList order; local [all...] |
/external/chromium_org/chrome/browser/history/ |
H A D | visit_filter.h | 20 // It also stores sorting order of the returned resilts. 27 // functions produce vectors that are sorted in order from most recent to 54 // How the filter width is used depends on the sorting order. For 72 // Sorting order that results after applying this filter are sorted by. 90 void set_sorting_order(SortingOrder order) { argument 91 sorting_order_ = order;
|
/external/chromium_org/chromeos/network/ |
H A D | network_event_log.cc | 254 std::string GetAsString(StringOrder order, 300 std::string NetworkEventLog::GetAsString(StringOrder order, argument 318 if (order == OLDEST_FIRST) { 427 std::string GetAsString(StringOrder order, argument 433 return g_network_event_log->GetAsString(order, format, max_level, max_events);
|
H A D | network_event_log_unittest.cc | 57 std::string GetLogString(StringOrder order, size_t max_events) { argument 59 order, "file,desc", kDefaultLevel, max_events);
|
/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/media/formats/webm/ |
H A D | webm_content_encodings.h | 55 int64 order() const { return order_; } function in class:media::ContentEncoding 56 void set_order(int64 order) { order_ = order; } argument
|
/external/chromium_org/net/android/ |
H A D | keystore_openssl.cc | 81 // modulus (in bytes) for RSA, or the group order size for (EC)DSA. This 516 std::vector<uint8> order; local 517 if (!GetECKeyOrder(private_key, &order)) { 518 LOG(ERROR) << "Can't extract order parameter from EC private key"; 525 ex_data->cached_size = VectorBignumSize(order);
|
/external/chromium_org/net/dns/ |
H A D | address_sorter_posix_unittest.cc | 160 // Verify that NULL-terminated |addresses| matches (-1)-terminated |order| 162 void Verify(const char* addresses[], const int order[]) { argument 166 for (size_t i = 0; order[i] >= 0; ++i) 167 CHECK_LT(order[i], static_cast<int>(list.size())); 175 for (size_t i = 0; (i < result.size()) || (order[i] >= 0); ++i) { 176 IPEndPoint expected = order[i] >= 0 ? list[order[i]] : IPEndPoint(); 179 "Address out of order at position " << i << "\n" << 193 const int order[] = { 1, -1 }; 194 Verify(addresses, order); [all...] |
/external/chromium_org/skia/ext/ |
H A D | image_operations.cc | 322 // Users of RESIZE_BETTER are willing to trade some quality in order 366 const SkFontHost::LCDOrder order = SkFontHost::GetSubpixelOrder(); local 413 switch (order) {
|
H A D | recursive_gaussian_convolution.cc | 32 template<RecursiveFilter::Order order> 39 switch (order) { 54 template<RecursiveFilter::Order order> 60 switch (order) { 73 template<RecursiveFilter::Order order, bool absolute_values> 93 if (order == RecursiveFilter::FUNCTION) 98 w[3] = ForwardFilter<order>( 104 w[n] = ForwardFilter<order>(in[byte_index - source_pixel_stride], 112 w[n] = ForwardFilter<order>(in[byte_index - source_pixel_stride], 125 float w_n = BackwardFilter<order>( 135 SingleChannelRecursiveFilter( const unsigned char* const source_data, int source_pixel_stride, int source_row_stride, int row_width, int row_count, unsigned char* const output, int output_pixel_stride, int output_row_stride, const float* b, RecursiveFilter::Order order, bool absolute_values) argument 217 RecursiveFilter(float sigma, Order order) argument [all...] |
H A D | recursive_gaussian_convolution.h | 29 SK_API RecursiveFilter(float sigma, Order order); 31 Order order() const { return order_; } function in class:skia::RecursiveFilter
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | RenderStyle.h | 757 int order() const { return rareNonInheritedData->m_order; } function in class:blink::RenderStyle
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/WebKit/Source/web/linux/ |
H A D | WebFontRendering.cpp | 79 void WebFontRendering::setLCDOrder(SkFontHost::LCDOrder order) argument 81 SkFontHost::SetSubpixelOrder(order);
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | PartitionAlloc.cpp | 166 size_t order; local 167 for (order = 0; order <= kBitsPerSizet; ++order) { 169 if (order < kGenericNumBucketsPerOrderBits + 1) 172 orderIndexShift = order - (kGenericNumBucketsPerOrderBits + 1); 173 root->orderIndexShifts[order] = orderIndexShift; 175 if (order == kBitsPerSizet) { 179 subOrderIndexMask = ((1 << order) - 1) >> (kGenericNumBucketsPerOrderBits + 1); 181 root->orderSubIndexMasks[order] [all...] |
H A D | TreeNodeTest.cpp | 207 TestTree* order[] = { local 214 EXPECT_EQ(node, order[orderIndex]); 215 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); 224 TestTree* order[] = { local 231 EXPECT_EQ(node, order[orderIndex]); 232 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*));
|
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
H A D | 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) { argument 193 if (order >= (kDenormalExponent + kSignificandSize)) { 196 if (order <= kDenormalExponent) return 0; 197 return order - kDenormalExponent;
|
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |