| /external/brotli/js/ |
| D | decode.min.js | 1 …odeClosure(){"use strict";function e(e){this.a=e,this.b=0}function t(e){for(var t=-1,i=16;i>0;)e>>… argument
|
| /external/sdv/vsomeip/third_party/boost/spirit/workbench/karma/ |
| D | double_performance.cpp | 30 util::high_resolution_timer t; in format_performance_karma() local
32 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_karma() local
53 util::high_resolution_timer t; in format_performance_rule() local
55 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_rule() local
75 util::high_resolution_timer t; in format_performance_direct() local
77 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_direct() local
96 util::high_resolution_timer t; in format_performance_string() local
98 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_string() local
115 util::high_resolution_timer t; in format_performance_boost_format() local
117 for (int i = 0; i < NUMITERATIONS; ++i) in format_performance_boost_format() local
[all …]
|
| D | format_performance.cpp | 41 util::high_resolution_timer t; in format_performance_karma() local
43 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_karma() local
68 util::high_resolution_timer t; in format_performance_rule() local
70 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_rule() local
90 util::high_resolution_timer t; in format_performance_string() local
92 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_string() local
111 util::high_resolution_timer t; in format_performance_boost_format() local
113 for (int i = 0; i < NUMITERATIONS; ++i) in format_performance_boost_format() local
123 util::high_resolution_timer t; in format_performance_sprintf() local
127 for (int i = 0; i < NUMITERATIONS; ++i) { in format_performance_sprintf() local
[all …]
|
| D | real_generator.cpp | 49 util::high_resolution_timer t; in main() local
51 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
63 util::high_resolution_timer t; in main() local
65 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
78 util::high_resolution_timer t; in main() local
80 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
91 util::high_resolution_timer t; in main() local
93 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
|
| D | int_generator.cpp | 58 util::high_resolution_timer t; in main() local
60 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
77 util::high_resolution_timer t; in main() local
79 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
95 util::high_resolution_timer t; in main() local
97 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
109 util::high_resolution_timer t; in main() local
113 for (int i = 0; i < MAX_ITERATION; ++i) in main() local
|
| /external/lua/src/ |
| D | ltable.c | 71 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) argument
73 #define hashstr(t,str) hashpow2(t, (str)->hash) argument
74 #define hashboolean(t,p) hashpow2(t, p) argument
75 #define hashint(t,i) hashpow2(t, i) argument
82 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) argument
85 #define hashpointer(t,p) hashmod(t, point2uint(p)) argument
115 int i; in l_hashfloat() local
136 static Node *mainposition (const Table *t, int ktt, const Value *kvl) { in mainposition()
163 static Node *mainpositionTV (const Table *t, const TValue *key) { in mainpositionTV()
203 #define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) argument
[all …]
|
| /external/mesa3d/src/compiler/ |
| D | glsl_types.c | 74 glsl_type *t = linear_zalloc(lin_ctx, glsl_type); in make_vector_matrix_type() local
89 fill_struct_type(glsl_type *t, const glsl_struct_field *fields, unsigned num_fields, in fill_struct_type()
110 glsl_type *t = linear_zalloc(lin_ctx, glsl_type); in make_struct_type() local
116 for (unsigned i = 0; i < num_fields; i++) { in make_struct_type() local
127 fill_interface_type(glsl_type *t, const glsl_struct_field *fields, unsigned num_fields, in fill_interface_type()
148 glsl_type *t = linear_zalloc(lin_ctx, glsl_type); in make_interface_type() local
154 for (unsigned i = 0; i < num_fields; i++) { in make_interface_type() local
170 glsl_type *t = linear_zalloc(lin_ctx, glsl_type); in make_subroutine_type() local
181 glsl_contains_sampler(const glsl_type *t) in glsl_contains_sampler()
186 for (unsigned int i = 0; i < t->length; i++) { in glsl_contains_sampler() local
[all …]
|
| /external/exoplayer/tree_15dc86382f17a24a3e881e52e31a810c1ea44b49/docs/doc/reference/jquery/ |
| D | jquery-ui.min.js | 6 (function(t){"function"==typeof define&&define.amd?define(["jquery"],t):t(jQuery)})(function(t){t.u… function
|
| /external/exoplayer/tree_8e57d3715f9092d5ec54ebe2e538f34bfcc34479/docs/doc/reference/jquery/ |
| D | jquery-ui.min.js | 6 (function(t){"function"==typeof define&&define.amd?define(["jquery"],t):t(jQuery)})(function(t){t.u… function
|
| /external/ltp/testcases/kernel/syscalls/setns/ |
| D | setns01.c | 34 static void setup0(struct testcase_t *t, int i) in setup0()
39 static void setup1(struct testcase_t *t, int i) in setup1()
45 static void setup2(struct testcase_t *t, int i) in setup2()
50 static void setup3(struct testcase_t *t, int i) in setup3()
61 static void setup4(struct testcase_t *t, int i) in setup4()
69 static void cleanup4(LTP_ATTRIBUTE_UNUSED struct testcase_t *t) in cleanup4()
112 int ret, i; in test_setns() local
113 struct testcase_t *t = &tcases[testno]; in test_setns() local
|
| /external/sdv/vsomeip/third_party/boost/serialization/include/boost/archive/ |
| D | basic_text_iprimitive.hpp | 87 void load(T & t) in load()
96 void load(char & t) in load()
98 short int i; in load() local
102 void load(signed char & t) in load()
104 short int i; in load() local
108 void load(unsigned char & t) in load()
110 unsigned short int i; in load() local
116 void load(wchar_t & t) in load()
119 int i; in load() local
|
| /external/arm-optimized-routines/string/bench/ |
| D | memcpy.c | 123 int i, j, freq, size, n; in init_copy_distribution() local
147 for (int i = 0; i < NUM_TESTS; i++) in init_copies() local
183 uint64_t t = clock_get_ns (); in main() local
184 for (int i = 0; i < ITERS; i++) in main() local
208 uint64_t t = clock_get_ns (); in main() local
209 for (int i = 0; i < ITERS; i++) in main() local
227 uint64_t t = clock_get_ns (); in main() local
228 for (int i = 0; i < ITERS2; i++) in main() local
239 uint64_t t = clock_get_ns (); in main() local
240 for (int i = 0; i < ITERS2; i++) in main() local
[all …]
|
| /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
| D | const_Types.pass.cpp | 66 ImplicitCopy i(42); in testImplicitCopy1() local
71 const ImplicitCopy i(42); in testImplicitCopy2() local
76 const ImplicitCopy i(42); in testImplicitCopy3() local
84 std::tuple<int*> t = 0; in main() local
88 std::tuple<int> t(2); in main() local
93 constexpr std::tuple<int> t(2); in main() local
97 constexpr std::tuple<int> t; in main() local
102 std::tuple<int, char*> t(2, 0); in main() local
108 constexpr std::tuple<int, char*> t(2, nullptr); in main() local
114 std::tuple<int, char*> t(2, nullptr); in main() local
[all …]
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3commontreeadaptor.inl | 21 …tor<ImplTraits>::TreeType* CommonTreeAdaptor<ImplTraits>::dupTreeTT( TreeType* t, TreeType* pare…
27 ANTLR_UINT32 i; local
50 void CommonTreeAdaptor<ImplTraits>::addChild( TreeType* t, TreeType* child)
59 void CommonTreeAdaptor<ImplTraits>::addChildToken( TreeType* t, CommonTokenType* child)
92 bool CommonTreeAdaptor<ImplTraits>::isNilNode( TreeType* t)
239 ANTLR_UINT32 CommonTreeAdaptor<ImplTraits>::getType( TreeType* t)
245 …name CommonTreeAdaptor<ImplTraits>::StringType CommonTreeAdaptor<ImplTraits>::getText( TreeType* t)
251 …or<ImplTraits>::TreeType* CommonTreeAdaptor<ImplTraits>::getChild( TreeType* t, ANTLR_UINT32 i)
257 void CommonTreeAdaptor<ImplTraits>::setChild( TreeType* t, ANTLR_UINT32 i, TreeType* child)
263 void CommonTreeAdaptor<ImplTraits>::deleteChild( TreeType* t, ANTLR_UINT32 i)
[all …]
|
| /external/jemalloc_new/test/unit/ |
| D | qr.c | 19 unsigned i; in init_entries() local
29 ring_t *t; in test_independent_entries() local
30 unsigned i, j; in test_independent_entries() local
74 ring_t *t; in test_entries_ring() local
75 unsigned i, j; in test_entries_ring() local
107 unsigned i; in TEST_BEGIN() local
119 ring_t *t; in TEST_BEGIN() local
120 unsigned i, j; in TEST_BEGIN() local
148 ring_t *t; in TEST_BEGIN() local
149 unsigned i, j; in TEST_BEGIN() local
[all …]
|
| /external/libchrome/base/strings/ |
| D | utf_offset_string_conversions_unittest.cc | 40 for (size_t i = 0; i < arraysize(utf8_to_utf16_cases); ++i) { in TEST() local
70 for (size_t i = 0; i < arraysize(utf16_to_utf8_cases); ++i) { in TEST() local
84 for (size_t t = 0; t < kItems; ++t) { in TEST() local
98 for (size_t t = kItems; t > 0; --t) { in TEST() local
117 for (size_t t = 0; t <= 9; ++t) in TEST() local
124 for (size_t i = 0; i < arraysize(expected_1); ++i) in TEST() local
131 for (size_t t = 0; t <= 23; ++t) in TEST() local
144 for (size_t i = 0; i < arraysize(expected_2); ++i) in TEST() local
151 for (size_t t = 0; t <= 17; ++t) in TEST() local
164 for (size_t i = 0; i < arraysize(expected_3); ++i) in TEST() local
[all …]
|
| /external/cronet/base/strings/ |
| D | utf_offset_string_conversions_unittest.cc | 39 for (const auto& i : utf8_to_utf16_cases) { in TEST() local
69 for (size_t i = 0; i < std::size(utf16_to_utf8_cases); ++i) { in TEST() local
83 for (size_t t = 0; t < kItems; ++t) { in TEST() local
96 for (size_t t = kItems; t > 0; --t) { in TEST() local
114 for (size_t t = 0; t <= 9; ++t) in TEST() local
121 for (size_t i = 0; i < std::size(expected_1); ++i) in TEST() local
128 for (size_t t = 0; t <= 23; ++t) in TEST() local
141 for (size_t i = 0; i < std::size(expected_2); ++i) in TEST() local
148 for (size_t t = 0; t <= 17; ++t) in TEST() local
161 for (size_t i = 0; i < std::size(expected_3); ++i) in TEST() local
[all …]
|
| /external/cronet/third_party/libc++/src/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
| D | const_Types.pass.cpp | 65 ImplicitCopy i(42); in testImplicitCopy1() local
70 const ImplicitCopy i(42); in testImplicitCopy2() local
75 const ImplicitCopy i(42); in testImplicitCopy3() local
83 std::tuple<int*> t = 0; in main() local
87 std::tuple<int> t(2); in main() local
92 constexpr std::tuple<int> t(2); in main() local
96 constexpr std::tuple<int> t; in main() local
101 std::tuple<int, char*> t(2, 0); in main() local
107 constexpr std::tuple<int, char*> t(2, nullptr); in main() local
113 std::tuple<int, char*> t(2, nullptr); in main() local
[all …]
|
| /external/libaom/aom_dsp/ |
| D | grain_table.c | 73 for (int i = 0; i < pars->num_y_points; ++i) { in grain_table_entry_read() local
86 for (int i = 0; i < pars->num_cb_points; ++i) { in grain_table_entry_read() local
99 for (int i = 0; i < pars->num_cr_points; ++i) { in grain_table_entry_read() local
114 for (int i = 0; i < n; ++i) { in grain_table_entry_read() local
126 for (int i = 0; i <= n; ++i) { in grain_table_entry_read() local
138 for (int i = 0; i <= n; ++i) { in grain_table_entry_read() local
163 for (int i = 0; i < pars->num_y_points; ++i) { in grain_table_entry_write() local
168 for (int i = 0; i < pars->num_cb_points; ++i) { in grain_table_entry_write() local
173 for (int i = 0; i < pars->num_cr_points; ++i) { in grain_table_entry_write() local
179 for (int i = 0; i < n; ++i) { in grain_table_entry_write() local
[all …]
|
| /external/tensorflow/tensorflow/lite/kernels/shim/ |
| D | tf_tensor_view_test.cc | 51 auto t = std::move(t_premove_or.value()); in TEST() local
54 for (int i = 0; i < 3 * 2; ++i) tensor_data_as_vector[i] = i % 5 == 0; in TEST() local
79 auto t = std::move(t_premove_or.value()); in TEST() local
82 for (int i = 0; i < 3 * 2; ++i) tensor_data_as_vector[i] = i; in TEST() local
105 auto& t = t_or.value(); in TEST() local
108 for (int i = 0; i < 3 * 2; ++i) tensor_data_as_vector[i] = i; in TEST() local
131 auto& t = t_or.value(); in TEST() local
134 for (int i = 0; i < 3 * 2; ++i) in TEST() local
158 auto& t = t_or.value(); in TEST() local
161 for (int i = 0; i < 3 * 2; ++i) in TEST() local
[all …]
|
| /external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| D | BaseTreeAdaptor.js | 35 dupTree: function(t, parent) { argument
63 addChild: function(t, child) { argument
163 getType: function(t) { argument
168 setType: function(t, type) { argument
172 getText: function(t) { argument
176 setText: function(t, text) { argument
180 getChild: function(t, i) { argument
184 setChild: function(t, i, child) { argument
188 deleteChild: function(t, i) { argument
192 getChildCount: function(t) { argument
|
| /external/libwebsockets/plugins/ssh-base/crypto/ |
| D | fe25519.c | 45 uint32_t t; in fe_reduce_add_sub() local
46 int i,rep; in fe_reduce_add_sub() local
65 uint32_t t; in reduce_mul() local
66 int i,rep; in reduce_mul() local
86 int i; in fe25519_freeze() local
103 int i; in fe25519_unpack() local
111 int i; in fe25519_pack() local
120 int i; in fe25519_iszero() local
122 fe25519 t = *x; in fe25519_iszero() local
132 int i; in fe25519_iseq_vartime() local
[all …]
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.iter/ |
| D | before_begin.pass.cpp | 28 C::iterator i = c.before_begin(); in main() local
35 C::const_iterator i = c.before_begin(); in main() local
42 C::const_iterator i = c.cbefore_begin(); in main() local
49 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; in main() local
51 C::iterator i = c.before_begin(); in main() local
58 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; in main() local
60 C::const_iterator i = c.before_begin(); in main() local
68 C::iterator i = c.before_begin(); in main() local
75 C::const_iterator i = c.before_begin(); in main() local
82 C::const_iterator i = c.cbefore_begin(); in main() local
[all …]
|
| /external/sdv/vsomeip/third_party/boost/format/benchmark/ |
| D | bench_format.cpp | 124 for(int i=0; i<NTests; ++i) { in test_sprintf() local
138 for(int i=0; i<NTests; ++i) { in test_try1() local
141 double t = chrono.elapsed(); in test_try1() local
160 for(int i=0; i<NTests; ++i) { in test_try2() local
163 double t = chrono.elapsed(); in test_try2() local
196 for(int i=0; i<NTests; ++i) { in test_nullstream() local
210 double t = chrono.elapsed(); in test_nullstream() local
243 for(int i=0; i<NTests; ++i) { in test_opti_nullstream() local
254 double t = chrono.elapsed(); in test_opti_nullstream() local
275 for(int i=0; i<NTests; ++i) { in test_parsed_once_format() local
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/time/ |
| D | time_benchmark.cc | 40 absl::Time t = absl::UnixEpoch(); in BM_Time_Arithmetic() local
75 absl::Time t = absl::FromUnixSeconds(1384569027); in BM_Time_ToDateTime_Absl() local
87 time_t t = 1384569027; in BM_Time_ToDateTime_Libc() local
104 absl::Time t = absl::FromUnixSeconds(1384569027); in BM_Time_ToDateTimeUTC_Absl() local
113 time_t t = 1384569027; in BM_Time_ToDateTimeUTC_Libc() local
131 int i = 0; in BM_Time_FromUnixMicros() local
140 const absl::Time t = absl::UnixEpoch() + absl::Seconds(123); in BM_Time_ToUnixNanos() local
148 const absl::Time t = absl::UnixEpoch() + absl::Seconds(123); in BM_Time_ToUnixMicros() local
156 const absl::Time t = absl::UnixEpoch() + absl::Seconds(123); in BM_Time_ToUnixMillis() local
164 const absl::Time t = absl::UnixEpoch() + absl::Seconds(123); in BM_Time_ToUnixSeconds() local
[all …]
|