Home
last modified time | relevance | path

Searched refs:order (Results 1 – 25 of 5714) sorted by relevance

12345678910>>...229

/external/libchrome/base/message_loop/
Dmessage_loop_unittest.cc236 void RecursiveFunc(TaskList* order, int cookie, int depth, in RecursiveFunc() argument
238 order->RecordStart(RECURSIVE, cookie); in RecursiveFunc()
244 BindOnce(&RecursiveFunc, order, cookie, depth - 1, is_reentrant)); in RecursiveFunc()
246 order->RecordEnd(RECURSIVE, cookie); in RecursiveFunc()
249 void QuitFunc(TaskList* order, int cookie) { in QuitFunc() argument
250 order->RecordStart(QUITMESSAGELOOP, cookie); in QuitFunc()
252 order->RecordEnd(QUITMESSAGELOOP, cookie); in QuitFunc()
459 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { in MessageBoxFunc() argument
460 order->RecordStart(MESSAGEBOX, cookie); in MessageBoxFunc()
464 order->RecordEnd(MESSAGEBOX, cookie); in MessageBoxFunc()
[all …]
/external/cronet/third_party/boringssl/src/crypto/fipsmodule/ec/
Dscalar.c26 if (!bn_copy_words(out->words, group->order.width, in) || in ec_bignum_to_scalar()
27 !bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_bignum_to_scalar()
37 group->order.width * sizeof(BN_ULONG)) == 0; in ec_scalar_equal_vartime()
42 for (int i = 0; i < group->order.width; i++) { in ec_scalar_is_zero()
50 return bn_rand_range_words(out->words, 1, group->order.d, group->order.width, in ec_random_nonzero_scalar()
56 size_t len = BN_num_bytes(&group->order); in ec_scalar_to_bytes()
57 bn_words_to_big_endian(out, len, in->words, group->order.width); in ec_scalar_to_bytes()
63 if (len != BN_num_bytes(&group->order)) { in ec_scalar_from_bytes()
68 bn_big_endian_to_words(out->words, group->order.width, in, len); in ec_scalar_from_bytes()
70 if (!bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_scalar_from_bytes()
[all …]
/external/boringssl/src/crypto/fipsmodule/ec/
Dscalar.c26 if (!bn_copy_words(out->words, group->order.width, in) || in ec_bignum_to_scalar()
27 !bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_bignum_to_scalar()
37 group->order.width * sizeof(BN_ULONG)) == 0; in ec_scalar_equal_vartime()
42 for (int i = 0; i < group->order.width; i++) { in ec_scalar_is_zero()
50 return bn_rand_range_words(out->words, 1, group->order.d, group->order.width, in ec_random_nonzero_scalar()
56 size_t len = BN_num_bytes(&group->order); in ec_scalar_to_bytes()
57 bn_words_to_big_endian(out, len, in->words, group->order.width); in ec_scalar_to_bytes()
63 if (len != BN_num_bytes(&group->order)) { in ec_scalar_from_bytes()
68 bn_big_endian_to_words(out->words, group->order.width, in, len); in ec_scalar_from_bytes()
70 if (!bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_scalar_from_bytes()
[all …]
/external/cronet/base/task/
Dsingle_thread_task_executor_unittest.cc258 void RecursiveFunc(TaskList* order, int cookie, int depth) { in RecursiveFunc() argument
259 order->RecordStart(RECURSIVE, cookie); in RecursiveFunc()
262 FROM_HERE, BindOnce(&RecursiveFunc, order, cookie, depth - 1)); in RecursiveFunc()
264 order->RecordEnd(RECURSIVE, cookie); in RecursiveFunc()
267 void QuitFunc(TaskList* order, int cookie) { in QuitFunc() argument
268 order->RecordStart(QUITMESSAGELOOP, cookie); in QuitFunc()
270 order->RecordEnd(QUITMESSAGELOOP, cookie); in QuitFunc()
291 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { in MessageBoxFunc() argument
292 order->RecordStart(MESSAGEBOX, cookie); in MessageBoxFunc()
298 order->RecordEnd(MESSAGEBOX, cookie); in MessageBoxFunc()
[all …]
/external/dagger2/javatests/dagger/producers/monitoring/internal/
DMonitorsTest.java131 InOrder order = inOrder(mockProducerMonitor); in singleMonitor_normalProducerMonitorSuccess() local
132 order.verify(mockProducerMonitor).requested(); in singleMonitor_normalProducerMonitorSuccess()
133 order.verify(mockProducerMonitor).methodStarting(); in singleMonitor_normalProducerMonitorSuccess()
134 order.verify(mockProducerMonitor).methodFinished(); in singleMonitor_normalProducerMonitorSuccess()
135 order.verify(mockProducerMonitor).succeeded(o); in singleMonitor_normalProducerMonitorSuccess()
154 InOrder order = inOrder(mockProducerMonitor); in singleMonitor_normalProducerMonitorFailure() local
155 order.verify(mockProducerMonitor).requested(); in singleMonitor_normalProducerMonitorFailure()
156 order.verify(mockProducerMonitor).methodStarting(); in singleMonitor_normalProducerMonitorFailure()
157 order.verify(mockProducerMonitor).methodFinished(); in singleMonitor_normalProducerMonitorFailure()
158 order.verify(mockProducerMonitor).failed(t); in singleMonitor_normalProducerMonitorFailure()
[all …]
/external/rust/crates/quiche/deps/boringssl/src/crypto/fipsmodule/ec/
Dscalar.c26 if (!bn_copy_words(out->words, group->order.width, in) || in ec_bignum_to_scalar()
27 !bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_bignum_to_scalar()
37 group->order.width * sizeof(BN_ULONG)) == 0; in ec_scalar_equal_vartime()
42 for (int i = 0; i < group->order.width; i++) { in ec_scalar_is_zero()
50 return bn_rand_range_words(out->words, 1, group->order.d, group->order.width, in ec_random_nonzero_scalar()
56 size_t len = BN_num_bytes(&group->order); in ec_scalar_to_bytes()
65 if (len != BN_num_bytes(&group->order)) { in ec_scalar_from_bytes()
76 if (!bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_scalar_from_bytes()
87 bn_from_montgomery_small(out->words, group->order.width, words, num, in ec_scalar_reduce()
95 const BIGNUM *order = &group->order; in ec_scalar_add() local
[all …]
/external/elfutils/lib/
Dstdatomic-fbsd.h273 #define atomic_exchange_explicit(object, desired, order) \ argument
274 __c11_atomic_exchange(object, desired, order)
275 #define atomic_fetch_add_explicit(object, operand, order) \ argument
276 __c11_atomic_fetch_add(object, operand, order)
277 #define atomic_fetch_and_explicit(object, operand, order) \ argument
278 __c11_atomic_fetch_and(object, operand, order)
279 #define atomic_fetch_or_explicit(object, operand, order) \ argument
280 __c11_atomic_fetch_or(object, operand, order)
281 #define atomic_fetch_sub_explicit(object, operand, order) \ argument
282 __c11_atomic_fetch_sub(object, operand, order)
[all …]
/external/tensorflow/tensorflow/tools/graph_transforms/
Dsort_by_execution_order_test.cc33 void GetOrder(const GraphDef& graph_def, std::map<string, int>* order) { in GetOrder() argument
36 (*order)[node.name()] = i; in GetOrder()
59 std::map<string, int> order; in TestSimpleAdd() local
60 GetOrder(result, &order); in TestSimpleAdd()
61 EXPECT_EQ(2, order["add_node"]); in TestSimpleAdd()
62 EXPECT_GT(2, order["a_node"]); in TestSimpleAdd()
63 EXPECT_GT(2, order["b_node"]); in TestSimpleAdd()
91 std::map<string, int> order; in TestSimpleLinear() local
92 GetOrder(result, &order); in TestSimpleLinear()
93 EXPECT_EQ(3, order["negative_node"]); in TestSimpleLinear()
[all …]
/external/OpenCL-CTS/test_conformance/c11_atomics/
Dhost_atomics.h88 void host_atomic_thread_fence(TExplicitMemoryOrderType order);
92 TExplicitMemoryOrderType order) in host_atomic_fetch_add() argument
106 TExplicitMemoryOrderType order) in host_atomic_fetch_sub() argument
120 TExplicitMemoryOrderType order) in host_atomic_exchange() argument
132 TExplicitMemoryOrderType order);
134 TExplicitMemoryOrderType order);
158 TExplicitMemoryOrderType order) in host_atomic_load() argument
170 TExplicitMemoryOrderType order);
172 TExplicitMemoryOrderType order);
176 TExplicitMemoryOrderType order) in host_atomic_store() argument
[all …]
Dhost_atomics.cpp18 void host_atomic_thread_fence(TExplicitMemoryOrderType order) in host_atomic_thread_fence() argument
20 if(order != MEMORY_ORDER_RELAXED) { in host_atomic_thread_fence()
32 …T host_atomic_exchange(volatile HOST_ATOMIC_FLOAT* a, HOST_FLOAT c, TExplicitMemoryOrderType order) in host_atomic_exchange() argument
34 HOST_UINT tmp = host_atomic_exchange((volatile HOST_ATOMIC_UINT*)a, *(HOST_UINT*)&c, order); in host_atomic_exchange()
38 …host_atomic_exchange(volatile HOST_ATOMIC_DOUBLE* a, HOST_DOUBLE c, TExplicitMemoryOrderType order) in host_atomic_exchange() argument
40 HOST_ULONG tmp = host_atomic_exchange((volatile HOST_ATOMIC_ULONG*)a, *(HOST_ULONG*)&c, order); in host_atomic_exchange()
45 HOST_FLOAT host_atomic_load(volatile HOST_ATOMIC_FLOAT* a, TExplicitMemoryOrderType order) in host_atomic_load() argument
47 …OST_UINT tmp = host_atomic_load<HOST_ATOMIC_UINT, HOST_UINT>((volatile HOST_ATOMIC_UINT*)a, order); in host_atomic_load()
51 HOST_DOUBLE host_atomic_load(volatile HOST_ATOMIC_DOUBLE* a, TExplicitMemoryOrderType order) in host_atomic_load() argument
53 …ULONG tmp = host_atomic_load<HOST_ATOMIC_ULONG, HOST_ULONG>((volatile HOST_ATOMIC_ULONG*)a, order); in host_atomic_load()
[all …]
/external/libxaac/decoder/
Dixheaacd_aac_tns.c88 for (i = 0; i < filter->order; i++) { in ixheaacd_tns_decode_coefficients()
94 WORD32 order) in ixheaacd_tns_parcor_to_lpc() argument
116 for (i = 0; i <= order; i++) { in ixheaacd_tns_parcor_to_lpc()
119 for (j = 0; j < order; j++) { in ixheaacd_tns_parcor_to_lpc()
126 for (j = (order - 1); j >= 0; j--) { in ixheaacd_tns_parcor_to_lpc()
148 WORD16 *scale, WORD order) in ixheaacd_tns_parcor_lpc_convert_dec() argument
170 for (i = 0; i <= order; i++) { in ixheaacd_tns_parcor_lpc_convert_dec()
173 for (j = 0; j < order; j++) { in ixheaacd_tns_parcor_lpc_convert_dec()
182 for (j = (order - 1); j >= 0; j--) { in ixheaacd_tns_parcor_lpc_convert_dec()
205 WORD32 *lpc, WORD32 order, in ixheaacd_tns_ar_filter_fixed_dec() argument
[all …]
Dixheaacd_tns.c61 WORD32 order; in ixheaacd_tns_dec_coef_usac() local
69 order = filter->order; in ixheaacd_tns_dec_coef_usac()
74 order--; in ixheaacd_tns_dec_coef_usac()
75 } while (order != 0); in ixheaacd_tns_dec_coef_usac()
80 WORD32 *scale, WORD order) in ixheaacd_tns_parcor_lpc_convert_usac() argument
102 for (i = 0; i <= order; i++) { in ixheaacd_tns_parcor_lpc_convert_usac()
105 for (j = 0; j < order; j++) { in ixheaacd_tns_parcor_lpc_convert_usac()
113 for (j = (order - 1); j >= 0; j--) { in ixheaacd_tns_parcor_lpc_convert_usac()
137 WORD32 order, WORD32 shift_value, in ixheaacd_tns_ar_filter_usac() argument
143 if ((order & 3) != 0) { in ixheaacd_tns_ar_filter_usac()
[all …]
/external/libexif/libexif/
Dexif-utils.c87 exif_get_sshort (const unsigned char *buf, ExifByteOrder order) in exif_get_sshort() argument
90 switch (order) { in exif_get_sshort()
102 exif_get_short (const unsigned char *buf, ExifByteOrder order) in exif_get_short() argument
104 return (exif_get_sshort (buf, order) & 0xffff); in exif_get_short()
108 exif_set_sshort (unsigned char *b, ExifByteOrder order, ExifSShort value) in exif_set_sshort() argument
111 switch (order) { in exif_set_sshort()
124 exif_set_short (unsigned char *b, ExifByteOrder order, ExifShort value) in exif_set_short() argument
126 exif_set_sshort (b, order, value); in exif_set_short()
130 exif_get_slong (const unsigned char *b, ExifByteOrder order) in exif_get_slong() argument
133 switch (order) { in exif_get_slong()
[all …]
/external/libopus/silk/fixed/
DcorrMatrix_FIX.c43 …const opus_int order, /* I Max lag for correl… in silk_corrVector_FIX() argument
53 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */ in silk_corrVector_FIX()
58 for( lag = 0; lag < order; lag++ ) { in silk_corrVector_FIX()
68 for( lag = 0; lag < order; lag++ ) { in silk_corrVector_FIX()
79 …const opus_int order, /* I Max lag for correl… in silk_corrMatrix_FIX() argument
91 silk_sum_sqr_shift( nrg, rshifts, x, L + order - 1 ); in silk_corrMatrix_FIX()
96 for( i = 0; i < order - 1; i++ ) { in silk_corrMatrix_FIX()
102 matrix_ptr( XX, 0, 0, order ) = energy; in silk_corrMatrix_FIX()
104 ptr1 = &x[ order - 1 ]; /* First sample of column 0 of X */ in silk_corrMatrix_FIX()
105 for( j = 1; j < order; j++ ) { in silk_corrMatrix_FIX()
[all …]
/external/libopus/silk/arm/
DNSQ_neon.h35 … silk_short_prediction_create_arch_coef_neon(opus_int32 *out, const opus_int16 *in, opus_int order) in silk_short_prediction_create_arch_coef_neon() argument
48 if (order == 16) in silk_short_prediction_create_arch_coef_neon()
70 #define silk_short_prediction_create_arch_coef(out, in, order) \ argument
71 (silk_short_prediction_create_arch_coef_neon(out, in, order))
75 #define silk_short_prediction_create_arch_coef(out, in, order) \ argument
76 …== OPUS_ARCH_ARM_NEON) { silk_short_prediction_create_arch_coef_neon(out, in, order); } } while (0)
80 …quantizer_short_prediction_neon(const opus_int32 *buf32, const opus_int32 *coef32, opus_int order);
82 …back_loop_neon(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order);
86 #define silk_noise_shape_quantizer_short_prediction(in, coef, coefRev, order, arch) \ argument
87 ((void)arch,silk_noise_shape_quantizer_short_prediction_neon(in, coefRev, order))
[all …]
/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp71 int order; in DEF_TEST() local
119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
120 if (order != 1) { in DEF_TEST()
121 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order); in DEF_TEST()
130 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
131 if (order == 1) { in DEF_TEST()
132 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order); in DEF_TEST()
133 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
142 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
143 if (order != 2) { in DEF_TEST()
[all …]
/external/aac/libFDK/src/
DFDK_lpc.cpp119 const int order, FIXP_DBL *state) { in CLpc_SynthesisLattice() argument
124 FDK_ASSERT(order <= LPC_MAX_ORDER); in CLpc_SynthesisLattice()
125 FDK_ASSERT(order > 0); in CLpc_SynthesisLattice()
143 shift = -order_ld[order - 1]; in CLpc_SynthesisLattice()
146 FIXP_DBL *pState = state + order - 1; in CLpc_SynthesisLattice()
147 const FIXP_SGL *pCoeff = coeff + order - 1; in CLpc_SynthesisLattice()
152 for (j = order - 1; j != 0; j--) { in CLpc_SynthesisLattice()
171 const int order, FIXP_DBL *state) { in CLpc_SynthesisLattice() argument
175 FDK_ASSERT(order <= LPC_MAX_ORDER); in CLpc_SynthesisLattice()
176 FDK_ASSERT(order > 0); in CLpc_SynthesisLattice()
[all …]
/external/pigweed/pw_bytes/public/pw_bytes/
Dbyte_builder.h130 int16_t PeekInt16(endian order = endian::little) const {
131 return static_cast<int16_t>(PeekUint16(order));
134 uint16_t PeekUint16(endian order = endian::little) const {
135 return bytes::ReadInOrder<uint16_t>(order, byte_);
138 int32_t PeekInt32(endian order = endian::little) const {
139 return static_cast<int32_t>(PeekUint32(order));
142 uint32_t PeekUint32(endian order = endian::little) const {
143 return bytes::ReadInOrder<uint32_t>(order, byte_);
146 int64_t PeekInt64(endian order = endian::little) const {
147 return static_cast<int64_t>(PeekUint64(order));
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/gpu/
Dgpu_hlo_schedule_test.cc72 SequentialHloOrdering order = BuildHloOrdering(module.get()); in TEST_F() local
73 EXPECT_TRUE(order.ExecutesBefore(y, x)); in TEST_F()
74 EXPECT_TRUE(order.ExecutesBefore(y, dot1)); in TEST_F()
75 EXPECT_TRUE(order.ExecutesBefore(z, dot1)); in TEST_F()
76 EXPECT_TRUE(order.ExecutesBefore(z, dot2)); in TEST_F()
77 EXPECT_TRUE(order.ExecutesBefore(dot1, dot2)); in TEST_F()
100 SequentialHloOrdering order = BuildHloOrdering(module.get()); in TEST_F() local
101 EXPECT_TRUE(order.ExecutesBefore(y, x)); in TEST_F()
102 EXPECT_TRUE(order.ExecutesBefore(y, add1)); in TEST_F()
103 EXPECT_TRUE(order.ExecutesBefore(z, add1)); in TEST_F()
[all …]
/external/icu/libicu/cts_headers/unicode/
Dcoleitr.h200 static inline int32_t primaryOrder(int32_t order);
208 static inline int32_t secondaryOrder(int32_t order);
216 static inline int32_t tertiaryOrder(int32_t order);
227 int32_t getMaxExpansion(int32_t order) const;
235 int32_t strengthOrder(int32_t order) const;
259 static inline UBool isIgnorable(int32_t order);
324 const RuleBasedCollator* order, UErrorCode& status);
344 const RuleBasedCollator* order, UErrorCode& status);
361 static int32_t getMaxExpansion(const UHashtable *maxExpansions, int32_t order);
385 inline int32_t CollationElementIterator::primaryOrder(int32_t order) in primaryOrder() argument
[all …]
/external/cronet/third_party/icu/source/i18n/unicode/
Dcoleitr.h200 static inline int32_t primaryOrder(int32_t order);
208 static inline int32_t secondaryOrder(int32_t order);
216 static inline int32_t tertiaryOrder(int32_t order);
227 int32_t getMaxExpansion(int32_t order) const;
235 int32_t strengthOrder(int32_t order) const;
259 static inline UBool isIgnorable(int32_t order);
324 const RuleBasedCollator* order, UErrorCode& status);
344 const RuleBasedCollator* order, UErrorCode& status);
361 static int32_t getMaxExpansion(const UHashtable *maxExpansions, int32_t order);
385 inline int32_t CollationElementIterator::primaryOrder(int32_t order) in primaryOrder() argument
[all …]
/external/icu/icu4c/source/i18n/unicode/
Dcoleitr.h200 static inline int32_t primaryOrder(int32_t order);
208 static inline int32_t secondaryOrder(int32_t order);
216 static inline int32_t tertiaryOrder(int32_t order);
227 int32_t getMaxExpansion(int32_t order) const;
235 int32_t strengthOrder(int32_t order) const;
259 static inline UBool isIgnorable(int32_t order);
324 const RuleBasedCollator* order, UErrorCode& status);
344 const RuleBasedCollator* order, UErrorCode& status);
361 static int32_t getMaxExpansion(const UHashtable *maxExpansions, int32_t order);
385 inline int32_t CollationElementIterator::primaryOrder(int32_t order) in primaryOrder() argument
[all …]
/external/cblas/include/
Dcblas.h147 void cblas_sgemv(const enum CBLAS_ORDER order,
152 void cblas_sgbmv(const enum CBLAS_ORDER order,
157 void cblas_strmv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
161 void cblas_stbmv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
165 void cblas_stpmv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
168 void cblas_strsv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
172 void cblas_stbsv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
176 void cblas_stpsv(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo,
180 void cblas_dgemv(const enum CBLAS_ORDER order,
185 void cblas_dgbmv(const enum CBLAS_ORDER order,
[all …]
/external/dagger2/javatests/dagger/functional/producers/
DProducerFactoryTest.java81 InOrder order = inOrder(componentMonitor, monitor); in noArgMethod() local
82 order.verify(componentMonitor).producerMonitorFor(token); in noArgMethod()
83 order.verify(monitor).methodStarting(); in noArgMethod()
84 order.verify(monitor).methodFinished(); in noArgMethod()
85 order.verify(monitor).succeeded("str"); in noArgMethod()
86 order.verifyNoMoreInteractions(); in noArgMethod()
115 InOrder order = inOrder(componentMonitor, monitor); in successMonitor() local
116 order.verify(componentMonitor).producerMonitorFor(token); in successMonitor()
119 order.verify(monitor).methodStarting(); in successMonitor()
120 order.verify(monitor).methodFinished(); in successMonitor()
[all …]
/external/libbrillo/brillo/message_loops/
Dfake_message_loop_test.cc47 vector<int> order; in TEST_F() local
49 BindOnce([](vector<int>* order) { order->push_back(1); }, &order), in TEST_F() argument
52 BindOnce([](vector<int>* order) { order->push_back(4); }, &order), in TEST_F() argument
55 BindOnce([](vector<int>* order) { order->push_back(3); }, &order), in TEST_F() argument
58 BindOnce([](vector<int>* order) { order->push_back(2); }, &order), in TEST_F() argument
62 EXPECT_EQ((vector<int>{1, 2, 3, 4}), order); in TEST_F()

12345678910>>...229