Home
last modified time | relevance | path

Searched refs:at (Results 1 - 25 of 1533) sorted by relevance

12345678910>>...62

/third_party/skia/third_party/externals/angle2/src/common/
H A Dmatrix_utils.h66 const T &at(const unsigned int rowIndex, const unsigned int columnIndex) const
86 tmp += at(i, k) * m(k, j);
146 T lhs = at(i, j);
161 result(i, j) = at(i, 0) * mat1(0, j);
171 result(i, j) = at(j, i);
183 return at(0, 0) * at(1, 1) - at(0, 1) * at(1, 0);
186 return at(
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmap_test_util_impl.h98 // // Get pointers of map entries at given index.
277 EXPECT_EQ(0, message.map_int32_int32().at(0)); in ExpectMapFieldsSet()
278 EXPECT_EQ(0, message.map_int64_int64().at(0)); in ExpectMapFieldsSet()
279 EXPECT_EQ(0, message.map_uint32_uint32().at(0)); in ExpectMapFieldsSet()
280 EXPECT_EQ(0, message.map_uint64_uint64().at(0)); in ExpectMapFieldsSet()
281 EXPECT_EQ(0, message.map_sint32_sint32().at(0)); in ExpectMapFieldsSet()
282 EXPECT_EQ(0, message.map_sint64_sint64().at(0)); in ExpectMapFieldsSet()
283 EXPECT_EQ(0, message.map_fixed32_fixed32().at(0)); in ExpectMapFieldsSet()
284 EXPECT_EQ(0, message.map_fixed64_fixed64().at(0)); in ExpectMapFieldsSet()
285 EXPECT_EQ(0, message.map_sfixed32_sfixed32().at( in ExpectMapFieldsSet()
[all...]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
H A Druntime.rs13 // while at <= len(haystack) - CHUNK_SIZE:
14 // let candidate = find_candidate_in_chunk(haystack, at)
16 // if match = verify(haystack, at, candidate):
25 // jth lane if and only if the byte occurring at position `j` is in the
96 /// starting at `at`.
107 at: usize, in find_at()
123 // SAFETY: The haystack must have at least a minimum number of bytes in find_at()
127 assert!(haystack[at..].len() >= self.minimum_len()); in find_at()
138 e.find_at(pats, self, haystack, at) in find_at()
[all...]
/third_party/rust/crates/regex/src/
H A Dinput.rs21 /// Returns true iff this position is at the beginning of the input.
31 /// Returns the character at this position.
39 /// Returns the byte at this position.
44 /// Returns the UTF-8 width of the character at this position.
49 /// Returns whether the UTF-8 width of the character at this position
68 /// Return an encoding of the position at byte offset `i`.
69 fn at(&self, i: usize) -> InputAt; in at() functions
71 /// Return the Unicode character occurring next to `at`.
74 fn next_char(&self, at: InputAt) -> Char; in next_char()
76 /// Return the Unicode character occurring previous to `at`
105 fn at(&self, i: usize) -> InputAt { at() functions
158 fn at(&self, i: usize) -> InputAt { at() functions
247 fn at(&self, i: usize) -> InputAt { at() functions
[all...]
H A Dbacktrack.rs75 Inst { ip: InstPtr, at: InputAt },
95 let start = input.at(start); in exec()
132 /// Start backtracking at the given position in the input, but also look
134 fn exec_(&mut self, mut at: InputAt, end: usize) -> bool { in exec_()
136 // If this is an anchored regex at the beginning of the input, then in exec_()
139 return if !at.is_start() { false } else { self.backtrack(at) }; in exec_()
144 at = match self.input.prefix_at(&self.prog.prefixes, at) { in exec_()
146 Some(at) in exec_()
[all...]
H A Ddfa.rs4 A DFA provides faster matching because the engine is in exactly one state at
104 /// and the set of empty-width flags set at the byte in the input when the
116 /// given state `s` and byte `b`, the next state can be found at index
180 at: usize,
239 fn set_non_match(self, at: usize) -> Result<T> { in set_non_match()
241 Result::NoMatch(_) => Result::NoMatch(at), in set_non_match()
257 /// at data[1], and each following pointer is stored as an offset
452 at: usize, in forward()
459 at, in forward()
462 last_cache_flush: at, in forward()
601 let mut at = self.at; exec_at() variables
763 let mut at = self.at; exec_at_reverse() variables
[all...]
H A Dpikevm.rs6 // backtracking engine is typically faster on small regexes/texts at the
10 // and execute Unicode word boundary assertions), but at a slower speed.
13 // at once where as the DFA is only ever in one state at a time.
69 /// Follow transitions at the given instruction pointer.
102 let at = input.at(start); in exec()
109 at, in exec()
121 mut at: InputAt, in exec_()
142 || (!at in exec_()
[all...]
/third_party/skia/tests/
H A DGrRenderTaskClusterTest.cpp20 proxies->at(i) = sk_make_sp<GrMockSurfaceProxy>(std::move(name)); in make_proxies()
27 tasks->at(i) = sk_make_sp<GrMockRenderTask>(); in make_tasks()
41 graph->at(0)->addTarget(proxies[0]); in create_graph0()
42 graph->at(1)->addTarget(proxies[1]); in create_graph0()
43 graph->at(2)->addTarget(proxies[0]); in create_graph0()
44 graph->at(2)->addDependency(graph->at(1).get()); in create_graph0()
46 expected->push_back(graph->at(1)); in create_graph0()
47 expected->push_back(graph->at(0)); in create_graph0()
48 expected->push_back(graph->at( in create_graph0()
[all...]
/third_party/rust/crates/aho-corasick/src/
H A Dautomaton.rs35 // to be at its worse on random text.
75 /// when at least one match has been observed.
93 /// A prefilter must report at least every match, although it may report
189 at: usize, in standard_find_at()
197 at, in standard_find_at()
201 self.standard_find_at_imp(prestate, None, haystack, at, state_id) in standard_find_at()
214 mut at: usize, in standard_find_at_imp()
217 while at < haystack.len() { in standard_find_at_imp()
219 if prestate.is_effective(at) && *state_id == self.start_state() in standard_find_at_imp()
221 let c = prefilter::next(prestate, pre, haystack, at) in standard_find_at_imp()
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/asm/
H A Dmips.pl6 # in the file LICENSE in the source distribution or at
99 ($zero,$at,$v0,$v1)=map("\$$_",(0..3));
182 mflo ($at,$t0,$a3)
184 $ADDU $t1,$at
187 sltu $at,$t1,$at
189 $ADDU $v0,$at
195 mflo ($at,$t2,$a3)
197 $ADDU $t3,$at
200 sltu $at,
[all...]
H A Dmips-mont.pl6 # in the file LICENSE in the source distribution or at
18 # doesn't provide better performance for longer keys, at least not on
35 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25));
50 # ($zero,$at,$v0,$v1)=map("\$$_",(0..3));
144 slt $at,$num,4
145 bnez $at,1f
147 slt $at,$num,17 # on in-order CPU
148 bnez $at,bn_mul_mont_internal
187 li $at,-4096
189 and $sp,$at
[all...]
/third_party/openssl/crypto/bn/asm/
H A Dmips.pl6 # in the file LICENSE in the source distribution or at
99 ($zero,$at,$v0,$v1)=map("\$$_",(0..3));
182 mflo ($at,$t0,$a3)
184 $ADDU $t1,$at
187 sltu $at,$t1,$at
189 $ADDU $v0,$at
195 mflo ($at,$t2,$a3)
197 $ADDU $t3,$at
200 sltu $at,
[all...]
H A Dmips-mont.pl6 # in the file LICENSE in the source distribution or at
18 # doesn't provide better performance for longer keys, at least not on
35 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25));
50 # ($zero,$at,$v0,$v1)=map("\$$_",(0..3));
144 slt $at,$num,4
145 bnez $at,1f
147 slt $at,$num,17 # on in-order CPU
148 bnez $at,bn_mul_mont_internal
187 li $at,-4096
189 and $sp,$at
[all...]
/third_party/ffmpeg/libavcodec/
H A Daudiotoolboxdec.c11 * version 2.1 of the License, or (at your option) any later version.
163 ATDecodeContext *at = avctx->priv_data; in ffat_update_ctx() local
166 if (!AudioConverterGetProperty(at->converter, in ffat_update_ctx()
176 if (!AudioConverterGetProperty(at->converter, in ffat_update_ctx()
181 AudioConverterSetProperty(at->converter, in ffat_update_ctx()
186 if (!AudioConverterGetPropertyInfo(at->converter, kAudioConverterOutputChannelLayout, in ffat_update_ctx()
193 AudioConverterGetProperty(at->converter, kAudioConverterOutputChannelLayout, in ffat_update_ctx()
211 at->channel_map[i] = layout->mChannelDescriptions[i].mChannelFlags; in ffat_update_ctx()
233 ATDecodeContext *at = avctx->priv_data; in ffat_get_magic_cookie() local
237 *cookie_size = 5 + 3 + 5+13 + 5+at in ffat_get_magic_cookie()
273 ATDecodeContext *at = avctx->priv_data; ffat_usable_extradata() local
283 ATDecodeContext *at = avctx->priv_data; ffat_set_extradata() local
306 ATDecodeContext *at = avctx->priv_data; ffat_create_decoder() local
412 ATDecodeContext *at = avctx->priv_data; ffat_init_decoder() local
433 ATDecodeContext *at = avctx->priv_data; ffat_decode_callback() local
478 ATDecodeContext *at = avctx->priv_data; ffat_copy_samples() local
489 ATDecodeContext *at = avctx->priv_data; ffat_decode() local
566 ATDecodeContext *at = avctx->priv_data; ffat_decode_flush() local
574 ATDecodeContext *at = avctx->priv_data; ffat_close_decoder() local
[all...]
H A Daudiotoolboxenc.c11 * version 2.1 of the License, or (at your option) any later version.
93 ATDecodeContext *at = avctx->priv_data; in ffat_update_ctx() local
98 AudioConverterGetProperty(at->converter, in ffat_update_ctx()
100 &size, &at->pkt_size); in ffat_update_ctx()
102 if (at->pkt_size <= 0) in ffat_update_ctx()
103 at->pkt_size = 1024 * 50; in ffat_update_ctx()
107 if (!AudioConverterGetProperty(at->converter, in ffat_update_ctx()
114 if (!AudioConverterGetProperty(at->converter, in ffat_update_ctx()
123 at->frame_size = avctx->frame_size; in ffat_update_ctx()
126 at in ffat_update_ctx()
233 ATDecodeContext *at = avctx->priv_data; ffat_init_encoder() local
457 ATDecodeContext *at = avctx->priv_data; ffat_encode_callback() local
497 ATDecodeContext *at = avctx->priv_data; ffat_encode() local
567 ATDecodeContext *at = avctx->priv_data; ffat_encode_flush() local
575 ATDecodeContext *at = avctx->priv_data; ffat_close_encoder() local
[all...]
/third_party/mesa3d/src/gallium/drivers/freedreno/
H A Dfreedreno_autotune.c49 get_history(struct fd_autotune *at, struct fd_batch *batch) in get_history() argument
53 /* draw batches should still have their key at this point. */ in get_history()
59 _mesa_hash_table_search_pre_hashed(at->ht, batch->hash, batch->key); in get_history()
66 history = rzalloc_size(at->ht, sizeof(*history)); in get_history()
72 /* Note: We cap # of cached GMEM states at 20.. so assuming double- in get_history()
75 if (at->ht->entries >= 40) { in get_history()
77 list_last_entry(&at->lru, struct fd_batch_history, node); in get_history()
78 _mesa_hash_table_remove_key(at->ht, last->key); in get_history()
83 _mesa_hash_table_insert_pre_hashed(at->ht, batch->hash, history->key, in get_history()
89 list_add(&history->node, &at in get_history()
104 get_result(struct fd_autotune *at, struct fd_batch_history *history) get_result() argument
124 process_results(struct fd_autotune *at) process_results() argument
174 fd_autotune_use_bypass(struct fd_autotune *at, struct fd_batch *batch) fd_autotune_use_bypass() argument
249 fd_autotune_init(struct fd_autotune *at, struct fd_device *dev) fd_autotune_init() argument
263 fd_autotune_fini(struct fd_autotune *at) fd_autotune_fini() argument
[all...]
/third_party/mesa3d/src/freedreno/vulkan/
H A Dtu_autotune.c40 * however we change the table only in a single thread at the submission
87 get_autotune_fence(struct tu_autotune *at) in get_autotune_fence() argument
89 const struct tu6_global *global = at->device->global_bo->map; in get_autotune_fence()
94 create_submission_data(struct tu_device *dev, struct tu_autotune *at) in create_submission_data() argument
98 submission_data->fence = at->fence_counter; in create_submission_data()
107 tu_cs_emit(fence_cs, at->fence_counter); in create_submission_data()
111 list_addtail(&submission_data->node, &at->pending_submission_data); in create_submission_data()
177 get_history(struct tu_autotune *at, uint64_t rp_key, uint32_t *avg_samples) in get_history() argument
184 u_rwlock_rdlock(&at->ht_lock); in get_history()
186 _mesa_hash_table_search(at in get_history()
200 create_history_result(struct tu_autotune *at, uint64_t rp_key) create_history_result() argument
240 process_results(struct tu_autotune *at, uint32_t current_fence) process_results() argument
266 queue_pending_results(struct tu_autotune *at, struct tu_cmd_buffer *cmdbuf) queue_pending_results() argument
289 tu_autotune_on_submit(struct tu_device *dev, struct tu_autotune *at, struct tu_cmd_buffer **cmd_buffers, uint32_t cmd_buffer_count) tu_autotune_on_submit() argument
391 tu_autotune_init(struct tu_autotune *at, struct tu_device *dev) tu_autotune_init() argument
407 tu_autotune_fini(struct tu_autotune *at, struct tu_device *dev) tu_autotune_fini() argument
509 tu_autotune_use_bypass(struct tu_autotune *at, struct tu_cmd_buffer *cmd_buffer, struct tu_renderpass_result **autotune_result) tu_autotune_use_bypass() argument
[all...]
/third_party/skia/modules/skottie/src/effects/
H A DCCTonerEffect.cpp65 case 1: fColorNodes.at(0)->setColor(fShadows);
66 fColorNodes.at(1)->setColor(lerpColor(fShadows, fHighlights, 0.25));
67 fColorNodes.at(2)->setColor(lerpColor(fShadows, fHighlights, 0.5));
68 fColorNodes.at(3)->setColor(lerpColor(fShadows, fHighlights, 0.75));
69 fColorNodes.at(4)->setColor(fHighlights);
72 case 2: fColorNodes.at(0)->setColor(fShadows);
73 fColorNodes.at(1)->setColor(lerpColor(fShadows, fMidtones, 0.5));
74 fColorNodes.at(2)->setColor(fMidtones);
75 fColorNodes.at(3)->setColor(lerpColor(fMidtones, fHighlights, 0.5));
76 fColorNodes.at(
[all...]
/third_party/vulkan-loader/tests/
H A Dloader_unknown_ext_tests.cpp72 return layer->custom_dispatch_functions.at(name); in find_custom_func()
131 // Add function_count strings to the func_names vector, starting at function_start place. Essentially a utility for filling
149 function_list.push_back(VulkanFunction{func_names.at(i++), to_vkVoidFunction(funcs.func_zero)}); in fill_implementation_functions()
150 function_list.push_back(VulkanFunction{func_names.at(i++), to_vkVoidFunction(funcs.func_one)}); in fill_implementation_functions()
151 function_list.push_back(VulkanFunction{func_names.at(i++), to_vkVoidFunction(funcs.func_two)}); in fill_implementation_functions()
152 function_list.push_back(VulkanFunction{func_names.at(i++), to_vkVoidFunction(funcs.func_three)}); in fill_implementation_functions()
153 function_list.push_back(VulkanFunction{func_names.at(i++), to_vkVoidFunction(funcs.func_four)}); in fill_implementation_functions()
163 layer.add_custom_device_interception_function(func_names.at(i++), to_vkVoidFunction(funcs.func_zero)); in fill_device_intercept_functions()
164 layer.add_custom_device_interception_function(func_names.at(i++), to_vkVoidFunction(funcs.func_one)); in fill_device_intercept_functions()
165 layer.add_custom_device_interception_function(func_names.at( in fill_device_intercept_functions()
[all...]
H A Dloader_settings_tests.cpp61 EXPECT_TRUE(string_eq(layer_props.at(0).layerName, regular_layer_name)); in TEST()
69 EXPECT_TRUE(string_eq(active_layer_props.at(0).layerName, regular_layer_name)); in TEST()
91 EXPECT_TRUE(string_eq(layer_props.at(0).layerName, regular_layer_name)); in TEST()
100 ASSERT_TRUE(string_eq(layers.at(0).layerName, regular_layer_name)); in TEST()
133 EXPECT_TRUE(string_eq(layer_props.at(0).layerName, regular_layer_name)); in TEST()
142 ASSERT_TRUE(string_eq(layers.at(0).layerName, regular_layer_name)); in TEST()
147 EXPECT_TRUE(string_eq(layer_props.at(0).layerName, regular_layer_name)); in TEST()
156 ASSERT_TRUE(string_eq(layers.at(0).layerName, regular_layer_name)); in TEST()
206 EXPECT_TRUE(string_eq(layer_props.at(0).layerName, global_layer_name)); in TEST()
214 ASSERT_TRUE(string_eq(layers.at( in TEST()
[all...]
/third_party/json/tests/src/
H A Dunit-user_defined_input.cpp24 CHECK(as_json.at(0) == 1);
25 CHECK(as_json.at(1) == 2);
26 CHECK(as_json.at(2) == 3);
27 CHECK(as_json.at(3) == 4);
50 CHECK(as_json.at(0) == 1);
51 CHECK(as_json.at(1) == 2);
52 CHECK(as_json.at(2) == 3);
53 CHECK(as_json.at(3) == 4);
76 CHECK(as_json.at(0) == 1);
77 CHECK(as_json.at(
[all...]
/third_party/node/deps/v8/src/runtime/
H A Druntime-promise.cc23 Handle<JSPromise> promise = args.at<JSPromise>(0); in RUNTIME_FUNCTION()
24 Handle<Object> value = args.at(1); in RUNTIME_FUNCTION()
47 Handle<JSPromise> promise = args.at<JSPromise>(0); in RUNTIME_FUNCTION()
48 Handle<Object> reason = args.at(1); in RUNTIME_FUNCTION()
57 Handle<JSPromise> promise = args.at<JSPromise>(0); in RUNTIME_FUNCTION()
58 Handle<Object> resolution = args.at(1); in RUNTIME_FUNCTION()
67 Handle<JSPromise> promise = args.at<JSPromise>(0); in RUNTIME_FUNCTION()
78 Handle<JSFunction> function = args.at<JSFunction>(0); in RUNTIME_FUNCTION()
110 Handle<JSPromise> promise = args.at<JSPromise>(0); in RUNTIME_FUNCTION()
118 Handle<JSPromise> promise = args.at<JSPromis in RUNTIME_FUNCTION()
[all...]
/third_party/musl/src/mq/
H A Dmq_timedreceive.c8 ssize_t mq_timedreceive(mqd_t mqd, char *restrict msg, size_t len, unsigned *restrict prio, const struct timespec *restrict at) in mq_timedreceive() argument
11 time_t s = at ? at->tv_sec : 0; in mq_timedreceive()
12 long ns = at ? at->tv_nsec : 0; in mq_timedreceive()
16 at ? ((long long []){at->tv_sec, at->tv_nsec}) : 0); in mq_timedreceive()
20 at ? ((long[]){CLAMP(s), ns}) : 0); in mq_timedreceive()
22 return syscall_cp(SYS_mq_timedreceive, mqd, msg, len, prio, at); in mq_timedreceive()
[all...]
H A Dmq_timedsend.c8 int mq_timedsend(mqd_t mqd, const char *msg, size_t len, unsigned prio, const struct timespec *at) in mq_timedsend() argument
11 time_t s = at ? at->tv_sec : 0; in mq_timedsend()
12 long ns = at ? at->tv_nsec : 0; in mq_timedsend()
16 at ? ((long long []){at->tv_sec, at->tv_nsec}) : 0); in mq_timedsend()
20 at ? ((long[]){CLAMP(s), ns}) : 0); in mq_timedsend()
22 return syscall_cp(SYS_mq_timedsend, mqd, msg, len, prio, at); in mq_timedsend()
[all...]
/third_party/json/docs/examples/
H A Dat__json_pointer.cpp18 std::cout << j.at("/number"_json_pointer) << '\n'; in main()
20 std::cout << j.at("/string"_json_pointer) << '\n'; in main()
22 std::cout << j.at("/array"_json_pointer) << '\n'; in main()
24 std::cout << j.at("/array/1"_json_pointer) << '\n'; in main()
29 j.at("/string"_json_pointer) = "bar"; in main()
34 j.at("/array/1"_json_pointer) = 21; in main()
43 json::reference ref = j.at("/array/01"_json_pointer); in main()
54 json::reference ref = j.at("/array/one"_json_pointer); in main()
65 json::reference ref = j.at("/array/4"_json_pointer); in main()
76 json::reference ref = j.at("/arra in main()
[all...]

Completed in 12 milliseconds

12345678910>>...62