Home
last modified time | relevance | path

Searched refs:first (Results 426 - 450 of 6148) sorted by relevance

1...<<11121314151617181920>>...246

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DRegisterUsageInfo.cpp85 return A->first->getName() < B->first->getName(); in print()
89 OS << FPRMPair->first->getName() << " " in print()
92 = TM->getSubtarget<TargetSubtargetInfo>(*(FPRMPair->first)) in print()
/third_party/skia/third_party/externals/tint/fuzzers/tint_spirv_tools_fuzzer/
H A Dmutator_cache.cc43 Remove(*entries_.back().first); in Put()
49 entries_.front().first = &pair.first->first; in Put()
/third_party/toybox/toys/lsb/
H A Dseq.c1 /* seq.c - Count from first to last, by increment.
14 usage: seq [-w|-f fmt_str] [-s sep_str] [first] [increment] last
16 Count from first to last, by increment. Omitted arguments default
17 to 1. Two arguments are used as first and last. Arguments can be
59 double first = 1, increment = 1, last, dd; in seq_main() local
65 case 2: first = parsef(*toys.optargs); in seq_main()
78 dd = (double []){first, increment, last}[i]; in seq_main()
84 // Other implementations output nothing if increment is 0 and first > last, in seq_main()
85 // but loop forever if first < last or even first in seq_main()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/hash/
H A Dhash.h312 const unsigned char* first, size_t size) { in combine_contiguous()
313 hash_state.combine_contiguous_(hash_state.state_, first, size); in combine_contiguous()
322 static void CombineContiguousImpl(void* p, const unsigned char* first, in CombineContiguousImpl() argument
325 state = T::combine_contiguous(std::move(state), first, size); in CombineContiguousImpl()
311 combine_contiguous(HashState hash_state, const unsigned char* first, size_t size) combine_contiguous() argument
/third_party/spirv-tools/test/opt/
H A Dfreeze_spec_const_test.cpp117 EXPECT_TRUE(FindAndReplace(&expected_disassembly, p.first, p.second)) in TEST_F()
121 << p.first << "\n" in TEST_F()
162 EXPECT_TRUE(FindAndReplace(&expected_disassembly, p.first, p.second)) in TEST_F()
166 << p.first << "\n" in TEST_F()
/third_party/zlib/
H A Dzlib2ansi69 my $first = shift @bits;
70 $first =~ s/^\s*//;
71 push @outParams, $first;
72 $first =~ /^(\w+\s*)/;
/third_party/selinux/libsepol/cil/src/
H A Dcil_policy.c199 struct cil_cat *first = NULL, *last = NULL, *cat; in cil_cats_to_policy() local
204 if (first == NULL) { in cil_cats_to_policy()
205 first = cat; in cil_cats_to_policy()
207 if (cat->value == first->value + 1) { in cil_cats_to_policy()
210 fprintf(out, "%s%s", lead, DATUM(first)->fqn); in cil_cats_to_policy()
212 first = cat; in cil_cats_to_policy()
217 fprintf(out, "%s%s", lead, DATUM(first)->fqn); in cil_cats_to_policy()
219 if (last->value >= first->value + 1) { in cil_cats_to_policy()
225 first = cat; in cil_cats_to_policy()
229 if (first) { in cil_cats_to_policy()
283 cil_cond_expr_to_policy(FILE *out, struct cil_list *expr, int first) cil_cond_expr_to_policy() argument
1082 int first = CIL_TRUE; cil_typeattributes_to_policy() local
1109 unsigned int i, first = 0, last = 0; cil_xperms_to_policy() local
1498 int first = CIL_TRUE; cil_role_types_to_policy() local
1530 int first = CIL_TRUE; cil_roleattributes_to_policy() local
[all...]
/foundation/arkui/ace_engine/frameworks/core/components_ng/syntax/
H A Dlazy_for_each_builder.h140 if (static_cast<size_t>(child.first) == index) { in InvalidIndexOfChangedData()
141 child.first = -1; in InvalidIndexOfChangedData()
167 auto pair = expiringItem_.try_emplace(node.first, LazyForEachCacheChild(index, std::move(node.second))); in RemoveAllChild()
192 auto keyIter = expiringItem_.find(node.first); in SetActiveChildRange()
211 auto pair = expiringItem_.try_emplace(node.first, LazyForEachCacheChild(index, std::move(node.second))); in SetActiveChildRange()
236 return node.first; in GetChildIndex()
262 cache.try_emplace(itemInfo.first, LazyForEachCacheChild(index, itemInfo.second)); in CacheItem()
276 cachedItems_[index] = LazyForEachChild(itemInfo.first, nullptr); in CacheItem()
369 const auto& key = expiringIter->first; in ProcessCachedIndex()
371 auto iter = idleIndexes.find(node.first); in ProcessCachedIndex()
[all...]
/foundation/multimedia/av_codec/services/media_engine/plugins/ffmpeg_adapter/common/
H A Dffmpeg_converter.cpp234 [&ffHEVCLevel](const auto &item) -> bool { return item.first == ffHEVCLevel; }); in ConvertFFMpegToOHHEVCLevel()
245 [&ffHEVCProfile](const auto &item) -> bool { return item.first == ffHEVCProfile; }); in ConvertFFMpegToOHHEVCProfile()
256 [&ffColorPrimaries](const auto &item) -> bool { return item.first == ffColorPrimaries; }); in ConvertFFMpegToOHColorPrimaries()
267 [&ffColorTrans](const auto &item) -> bool { return item.first == ffColorTrans; }); in ConvertFFMpegToOHColorTrans()
278 [&ffColorSpace](const auto &item) -> bool { return item.first == ffColorSpace; }); in ConvertFFMpegToOHColorMatrix()
289 [&ffColorRange](const auto &item) -> bool { return item.first == ffColorRange; }); in ConvertFFMpegToOHColorRange()
300 [&ffChromaLocation](const auto &item) -> bool { return item.first == ffChromaLocation; }); in ConvertFFMpegToOHChromaLocation()
311 [&codecId](const auto &item) -> bool { return item.first == codecId; }); in ConvertFFMpegAVCodecIdToOHAudioFormat()
322 [&ffSampleFormat](const auto &item) -> bool { return item.first == ffSampleFormat; }); in ConvertFFMpegToOHAudioFormat()
338 return ite->first; in ConvertOHAudioFormatToFFMpeg()
[all...]
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/swiper_indicator/dot_indicator/
H A Doverlength_dot_indicator_modifier.cpp118 // first point color in PaintBlackPoint()
170 longPointLeftCenterX_->Set(longPointCenterX.first); in UpdateShrinkPaintProperty()
258 longPointLeftCenterX_->Set(longPointEndCenterX.first); in PlayBlackPointsAnimation()
364 auto dragTargetCenterX = (overlongSelectedEndCenterX_.second + overlongSelectedEndCenterX_.first) * HALF_FLOAT; in UpdateSelectedCenterXOnDrag()
365 overlongSelectedEndCenterX_.first = overlongSelectedStartCenterX_.first + in UpdateSelectedCenterXOnDrag()
366 (dragTargetCenterX - overlongSelectedStartCenterX_.first) * leftMoveRate; in UpdateSelectedCenterXOnDrag()
371 auto leftDistance = overlongSelectedEndCenterX_.first - overlongSelectedStartCenterX_.first; in UpdateSelectedCenterXOnDrag()
374 leftDistance = longPointEndCenterX.first in UpdateSelectedCenterXOnDrag()
[all...]
/third_party/skia/third_party/externals/harfbuzz/test/api/
H A Dtest-set.c406 hb_codepoint_t next, first, last; in test_set_iter() local
460 first = last = HB_SET_VALUE_INVALID; in test_set_iter()
461 g_assert (hb_set_next_range (s, &first, &last)); in test_set_iter()
462 g_assert_cmpint (first, ==, 6); in test_set_iter()
464 g_assert (hb_set_next_range (s, &first, &last)); in test_set_iter()
465 g_assert_cmpint (first, ==, 10); in test_set_iter()
467 g_assert (hb_set_next_range (s, &first, &last)); in test_set_iter()
468 g_assert_cmpint (first, ==, 1100); in test_set_iter()
470 g_assert (hb_set_next_range (s, &first, &last)); in test_set_iter()
471 g_assert_cmpint (first, in test_set_iter()
[all...]
/foundation/multimedia/media_library/frameworks/utils/src/
H A Dmedia_privacy_manager.cpp190 // first: offset, second: end in SendRangesToIoctl()
191 ranges->range[i].begin = static_cast<uint64_t>(rans[i].first); in SendRangesToIoctl()
262 MEDIA_DEBUG_LOG("Range: [%{public}u, %{public}u)", range.first, range.second); in ShowRanges()
268 return pairA.first < pairB.first; in CmpMode()
286 if (ranges[0].first >= ranges[0].second) { in SortRangesAndCheck()
288 ranges[0].first, ranges[0].second); in SortRangesAndCheck()
293 if ((ranges[i].first >= ranges[i].second) || (ranges[i].first < ranges[i - 1].second)) { in SortRangesAndCheck()
295 ranges[i].first, range in SortRangesAndCheck()
[all...]
/third_party/libinput/src/
H A Devdev-mt-touchpad-thumb.c273 struct tp_touch *first = NULL, in tp_thumb_update_multifinger() local
282 /* Get the first and second bottom-most touches, the max speed exceeded in tp_thumb_update_multifinger()
300 if (!first) { in tp_thumb_update_multifinger()
301 first = t; in tp_thumb_update_multifinger()
305 if (t->point.y > first->point.y) { in tp_thumb_update_multifinger()
306 second = first; in tp_thumb_update_multifinger()
307 first = t; in tp_thumb_update_multifinger()
316 if (!first || !second) in tp_thumb_update_multifinger()
319 distance.x = abs(first->point.x - second->point.x); in tp_thumb_update_multifinger()
320 distance.y = abs(first in tp_thumb_update_multifinger()
[all...]
/third_party/musl/Benchmark/musl/
H A Dbenchmark_framework.cpp271 BenchmarkFunc func = g_applyBenchmarks.at(funcName).first; in RegisterSingleBenchmark()
278 BenchmarkFunc func = g_allBenchmarks.at(funcName).first; in RegisterSingleBenchmark()
295 RegisterSingleBenchmark(bench_opts_t(), opts, entry.first, runArgs); in RegisterAllBenchmarks()
300 RegisterSingleBenchmark(bench_opts_t(), opts, entry.first, runArgs); in RegisterAllBenchmarks()
306 size_t first = str.find_first_not_of(' '); in Trim() local
307 if (std::string::npos == first) { in Trim()
311 return str.substr(first, (last - first + 1)); in Trim()
377 if (MatchFuncNameInJson(muslbenchmark.first, fnName)) { in RegisterJsonBenchmarks()
378 matchedFuncNames.push_back(muslbenchmark.first); in RegisterJsonBenchmarks()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/util/
H A Dsmall_vector.h260 iterator erase(const_iterator first, const_iterator last) { in erase() argument
262 size_t start_index = first - large_data_->data(); in erase()
272 iterator f = const_cast<iterator>(first); in erase()
276 size_t num_of_del_elements = last - first; in erase()
278 if (first == last) { in erase()
329 iterator insert(iterator pos, InputIt first, InputIt last) { in insert() argument
331 size_t num_of_new_elements = std::distance(first, last); in insert()
340 large_data_->insert(new_pos, first, last); in insert()
358 for (; first != last; ++p, ++first) { in insert()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/
H A Dsmall_vector.h260 iterator erase(const_iterator first, const_iterator last) { in erase() argument
262 size_t start_index = first - large_data_->data(); in erase()
272 iterator f = const_cast<iterator>(first); in erase()
276 size_t num_of_del_elements = last - first; in erase()
278 if (first == last) { in erase()
329 iterator insert(iterator pos, InputIt first, InputIt last) { in insert() argument
331 size_t num_of_new_elements = std::distance(first, last); in insert()
340 large_data_->insert(new_pos, first, last); in insert()
358 for (; first != last; ++p, ++first) { in insert()
[all...]
/third_party/skia/third_party/externals/angle2/src/tests/test_utils/
H A Dangle_test_instantiate.h113 #define ANGLE_INSTANTIATE_TEST(testName, first, ...) \
114 const decltype(first) testName##params[] = {first, ##__VA_ARGS__}; \
236 #define ANGLE_INSTANTIATE_TEST_COMBINE_1(testName, print, combine1, first, ...) \
237 const decltype(first) testName##params[] = {first, ##__VA_ARGS__}; \
241 first, ...) \
242 const decltype(first) testName##params[] = {first, ##__VA_ARGS__}; \
248 combine5, first,
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ProfileData/
H A DSampleProf.h67 // Prefer first error encountered as later errors may be secondary effects of in MergeResult()
124 // marker for the first type of profile.
214 return LHS.first < RHS.first; in operator ()()
262 SortedTargets.emplace(I.first(), I.second); in SortCallTargets()
272 MergeResult(Result, addCalledTarget(I.first(), I.second, Weight)); in merge()
410 /// branch target. This should be equivalent to the sample of the first
416 /// Return the sample count of the first instruction of the function.
423 BodySamples.begin()->first < CallsiteSamples.begin()->first)) in getEntrySamples()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DOnDiskHashTable.h191 InfoObj.EmitKey(Out, I->Key, Len.first); in Emit()
197 InfoObj.EmitKey(Out, I->Key, Len.first); in Emit()
201 assert(offset_type(DataStart - KeyStart) == Len.first && in Emit()
378 offset_type ItemLen = L.first + L.second; in find_hashed()
388 InfoPtr->ReadKey((const unsigned char *const)Items, L.first); in find_hashed()
397 return iterator(X, Items + L.first, L.second, InfoPtr); in find_hashed()
421 return new OnDiskChainedHashTable<Info>(NumBucketsAndEntries.first, in Create()
477 Ptr += L.first + L.second; in advance()
529 return InfoObj->ReadKey(LocalPtr, L.first); in getInternalKey()
575 const internal_key_type &Key = InfoObj->ReadKey(LocalPtr, L.first); in operator *()
[all...]
/third_party/python/Lib/lib2to3/pgen2/
H A Dtokenize.py88 # longest operators first (e.g., if = came before ==, == would get
153 The first parameter, readline, must be a callable object which provides
232 # Only care about the first 12 characters.
290 first = read_or_stop()
291 if first.startswith(BOM_UTF8):
293 first = first[3:]
295 if not first:
298 encoding = find_cookie(first)
300 return encoding, [first]
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128_benchmark.cc56 benchmark::DoNotOptimize(pair.first / pair.second); in BM_DivideClass128UniformDivisor()
68 benchmark::DoNotOptimize(pair.first % pair.second); in BM_RemainderClass128UniformDivisor()
96 benchmark::DoNotOptimize(pair.first / pair.second); in BM_DivideClass128SmallDivisor()
108 benchmark::DoNotOptimize(pair.first % pair.second); in BM_RemainderClass128SmallDivisor()
132 benchmark::DoNotOptimize(pair.first * pair.second); in BM_MultiplyClass128()
142 benchmark::DoNotOptimize(pair.first + pair.second); in BM_AddClass128()
188 benchmark::DoNotOptimize(pair.first / pair.second); in BM_DivideIntrinsic128UniformDivisor()
200 benchmark::DoNotOptimize(pair.first % pair.second); in BM_RemainderIntrinsic128UniformDivisor()
229 benchmark::DoNotOptimize(pair.first / pair.second); in BM_DivideIntrinsic128SmallDivisor()
241 benchmark::DoNotOptimize(pair.first in BM_RemainderIntrinsic128SmallDivisor()
[all...]
/third_party/zlib/contrib/puff/
H A Dpuff.c226 * - The first code for the shortest length is all zeros. Subsequent codes of
239 int first; /* first code of length len */ in decode() local
241 int index; /* index of first code of length len in symbol table */ in decode()
243 code = first = index = 0; in decode()
247 if (code - count < first) /* if length len, return symbol */ in decode()
248 return h->symbol[index + (code - first)]; in decode()
250 first += count; in decode()
251 first <<= 1; in decode()
267 int first; /* firs in decode() local
[all...]
/third_party/node/deps/npm/node_modules/jsonparse/
H A Dbench.js13 var first = Date.now() - start;
23 console.log("JSON.parse took %s", first);
25 console.log("streaming is %s times slower", second / first);
/third_party/python/Tools/c-analyzer/c_common/
H A Diterutil.py30 first = next(items)
42 yield first, False
45 yield first, True
/third_party/python/Tools/scripts/
H A Dlll.py18 first = 1
21 if not first: print()
22 first = 0

Completed in 26 milliseconds

1...<<11121314151617181920>>...246