Home
last modified time | relevance | path

Searched refs:first (Results 201 - 225 of 6328) sorted by relevance

12345678910>>...254

/kernel/liteos_a/kernel/extended/container/
H A Dlos_user_container.c112 UINT32 first; in MapIdUpBase() local
116 first = map->extent[idx].lowerFirst; in MapIdUpBase()
117 last = first + map->extent[idx].count - 1; in MapIdUpBase()
118 if ((id >= first) && (id <= last)) { in MapIdUpBase()
134 return ((id - extent->lowerFirst) + extent->first); in MapIdUp()
171 UINT32 first; in MapIdRangeDownBase() local
177 first = map->extent[idx].first; in MapIdRangeDownBase()
178 last = first + map->extent[idx].count - 1; in MapIdRangeDownBase()
179 if ((id >= first in MapIdRangeDownBase()
[all...]
/third_party/libphonenumber/cpp/src/phonenumbers/utf/
H A Dunicodetext.cc51 distance(const UnicodeText::const_iterator& first, in distance() argument
53 return CodepointDistance(first.it_, last.it_); in distance()
205 UnicodeText::UnicodeText(const UnicodeText::const_iterator& first, in UnicodeText() argument
207 assert(first <= last && "Incompatible iterators"); in UnicodeText()
208 repr_.append(first.it_, static_cast<int>(last.it_ - first.it_)); in UnicodeText()
211 string UnicodeText::UTF8Substring(const const_iterator& first, in UTF8Substring() argument
213 assert(first <= last && "Incompatible iterators"); in UTF8Substring()
214 return string(first.it_, last.it_ - first in UTF8Substring()
294 PointTo(const const_iterator &first, const const_iterator &last) PointTo() argument
308 append(const const_iterator& first, const const_iterator& last) append() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/HardwareUnits/
H A DResourceManager.cpp196 unsigned RSID = getResourceStateIndex(RR.first); in use()
204 // If there are still available units in RR.first, in use()
209 AvailableProcResUnits ^= RR.first; in use()
211 // Notify groups that RR.first is no longer available. in use()
217 CurrentUser.markSubResourceAsUsed(RR.first); in use()
218 Strategies[GroupIndex]->used(RR.first); in use()
225 unsigned RSID = getResourceStateIndex(RR.first); in release()
232 AvailableProcResUnits ^= RR.first; in release()
234 // Notify groups that RR.first is now available again. in release()
239 CurrentUser.releaseSubResource(RR.first); in release()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dilist.h73 void transferNodesFromList(ilist_callback_traits &OldList, Iterator /*first*/, in transferNodesFromList()
175 /// ilist_sentinel, which holds pointers to the first and last nodes in the
297 // [first, last) into position.
299 void transfer(iterator position, iplist_impl &L2, iterator first, iterator last) { in transfer() argument
304 this->transferNodesFromList(L2, first, last); in transfer()
306 base_list_type::splice(position, L2, first, last); in transfer()
316 iterator erase(iterator first, iterator last) { in erase() argument
317 while (first != last) in erase()
318 first = erase(first); in erase()
337 insert(iterator where, InIt first, InIt last) insert() argument
346 splice(iterator where, iplist_impl &L2, iterator first) splice() argument
351 splice(iterator where, iplist_impl &L2, iterator first, iterator last) splice() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A Dilist.h71 void transferNodesFromList(ilist_callback_traits &OldList, Iterator /*first*/, in transferNodesFromList()
163 /// ilist_sentinel, which holds pointers to the first and last nodes in the
282 // [first, last) into position.
284 void transfer(iterator position, iplist_impl &L2, iterator first, iterator last) { in transfer() argument
289 this->transferNodesFromList(L2, first, last); in transfer()
291 base_list_type::splice(position, L2, first, last); in transfer()
301 iterator erase(iterator first, iterator last) { in erase() argument
302 while (first != last) in erase()
303 first = erase(first); in erase()
322 insert(iterator where, InIt first, InIt last) insert() argument
331 splice(iterator where, iplist_impl &L2, iterator first) splice() argument
336 splice(iterator where, iplist_impl &L2, iterator first, iterator last) splice() argument
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnft_set_pipapo_avx2.c142 * @last: Return index of first set bit, if this is the last field
150 * Return: first set bit index if @last, index of first filled word otherwise.
192 * @first: If this is the first field, don't source previous result
193 * @last: Last field: stop at the first match and return bit index
197 * this is the first field in the set, simply AND the buckets together
211 * Return: -1 on no match, rule index of match if @last, otherwise first long
212 * word index to be checked next (i.e. first filled word).
216 const u8 *pkt, bool first, boo in nft_pipapo_avx2_lookup_4b_2()
214 nft_pipapo_avx2_lookup_4b_2(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_4b_2() argument
276 nft_pipapo_avx2_lookup_4b_4(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_4b_4() argument
352 nft_pipapo_avx2_lookup_4b_8(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_4b_8() argument
447 nft_pipapo_avx2_lookup_4b_12(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_4b_12() argument
536 nft_pipapo_avx2_lookup_4b_32(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_4b_32() argument
671 nft_pipapo_avx2_lookup_8b_1(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_8b_1() argument
728 nft_pipapo_avx2_lookup_8b_2(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_8b_2() argument
792 nft_pipapo_avx2_lookup_8b_4(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_8b_4() argument
867 nft_pipapo_avx2_lookup_8b_6(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_8b_6() argument
952 nft_pipapo_avx2_lookup_8b_16(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_8b_16() argument
1044 nft_pipapo_avx2_lookup_slow(unsigned long *map, unsigned long *fill, struct nft_pipapo_field *f, int offset, const u8 *pkt, bool first, bool last) nft_pipapo_avx2_lookup_slow() argument
1159 bool last = i == m->field_count - 1, first = !i; nft_pipapo_avx2_lookup() local
[all...]
/third_party/jerryscript/jerry-core/ecma/builtin-objects/
H A Decma-builtin-string-iterator-prototype.c102 ecma_char_t first = ecma_string_get_char_at_pos (string_p, position); in ecma_builtin_string_iterator_prototype_object_next() local
108 if (first < LIT_UTF16_HIGH_SURROGATE_MIN || first > LIT_UTF16_HIGH_SURROGATE_MAX || (position + 1 == len)) in ecma_builtin_string_iterator_prototype_object_next()
110 result_str_p = ecma_new_ecma_string_from_code_unit (first); in ecma_builtin_string_iterator_prototype_object_next()
121 result_str_p = ecma_new_ecma_string_from_code_unit (first); in ecma_builtin_string_iterator_prototype_object_next()
126 result_str_p = ecma_new_ecma_string_from_code_units (first, second); in ecma_builtin_string_iterator_prototype_object_next()
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DvalidationGL44_autogen.h22 GLuint first,
27 GLuint first,
33 GLuint first,
37 GLuint first,
41 GLuint first,
45 GLuint first,
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Duniform_buffer_element_descriptor.cpp35 const protobufs::UniformBufferElementDescriptor* first, in operator ()()
37 return first->descriptor_set() == second->descriptor_set() && in operator ()()
38 first->binding() == second->binding() && in operator ()()
39 first->index().size() == second->index().size() && in operator ()()
40 std::equal(first->index().begin(), first->index().end(), in operator ()()
34 operator ()( const protobufs::UniformBufferElementDescriptor* first, const protobufs::UniformBufferElementDescriptor* second) const operator ()() argument
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Duniform_buffer_element_descriptor.cpp35 const protobufs::UniformBufferElementDescriptor* first, in operator ()()
37 return first->descriptor_set() == second->descriptor_set() && in operator ()()
38 first->binding() == second->binding() && in operator ()()
39 first->index().size() == second->index().size() && in operator ()()
40 std::equal(first->index().begin(), first->index().end(), in operator ()()
34 operator ()( const protobufs::UniformBufferElementDescriptor* first, const protobufs::UniformBufferElementDescriptor* second) const operator ()() argument
/third_party/skia/third_party/externals/sfntly/cpp/src/sample/subtly/
H A Dstats.cc47 char *name = TagToString(it->first); in PrintComparison()
50 TableSizePercent(font, it->first)); in PrintComparison()
53 Ptr<FontDataTable> new_table = new_font->GetTable(it->first); in PrintComparison()
58 size_percent = subtly::TableSizePercent(new_font, it->first); in PrintComparison()
75 char *name = TagToString(it->first); in PrintStats()
78 TableSizePercent(font, it->first)); in PrintStats()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Remarks/
H A DRemarkStringTable.cpp36 SerializedSize += KV.first->first().size() + 1; // +1 for the '\0' in add()
38 return {KV.first->second, KV.first->first()}; in add()
68 Strings[KV.second] = KV.first(); in serialize()
/third_party/spirv-tools/source/fuzz/
H A Duniform_buffer_element_descriptor.cpp35 const protobufs::UniformBufferElementDescriptor* first, in operator ()()
37 return first->descriptor_set() == second->descriptor_set() && in operator ()()
38 first->binding() == second->binding() && in operator ()()
39 first->index().size() == second->index().size() && in operator ()()
40 std::equal(first->index().begin(), first->index().end(), in operator ()()
34 operator ()( const protobufs::UniformBufferElementDescriptor* first, const protobufs::UniformBufferElementDescriptor* second) const operator ()() argument
/kernel/linux/linux-6.6/arch/loongarch/kernel/
H A Dunwind_prologue.c81 * As we meet ftrace_regs_entry, reset first flag like first doing
124 state->first = true; in unwind_by_prologue()
133 * When first is not set, the PC is a return address in the previous frame. in unwind_by_prologue()
136 pc = state->pc - (state->first ? 0 : LOONGARCH_INSN_SIZE); in unwind_by_prologue()
154 * first being true is reasonable, otherwise indicate analysis is broken. in unwind_by_prologue()
157 if (state->first) in unwind_by_prologue()
158 goto first; in unwind_by_prologue()
175 if (state->first) { in unwind_by_prologue()
177 goto first; in unwind_by_prologue()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DPluralRanges.java95 StandardPlural first = null; in endSame()
101 if (first == null) { in endSame()
102 first = item; in endSame()
105 if (first != item) { in endSame()
109 return first; in endSame()
119 StandardPlural first = null; in startSame()
125 if (first == null) { in startSame()
126 first = item; in startSame()
129 if (first != item) { in startSame()
137 return first; in startSame()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128_test.cc829 << "pair = {" << pair.first << ", " << pair.second << '}'); in TEST()
831 EXPECT_EQ(absl::int128(pair.first + pair.second), in TEST()
832 absl::int128(pair.first) + absl::int128(pair.second)); in TEST()
833 EXPECT_EQ(absl::int128(pair.second + pair.first), in TEST()
834 absl::int128(pair.second) += absl::int128(pair.first)); in TEST()
836 EXPECT_EQ(absl::int128(pair.first - pair.second), in TEST()
837 absl::int128(pair.first) - absl::int128(pair.second)); in TEST()
838 EXPECT_EQ(absl::int128(pair.second - pair.first), in TEST()
839 absl::int128(pair.second) -= absl::int128(pair.first)); in TEST()
842 absl::MakeInt128(pair.second + pair.first, in TEST()
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsTSect.cpp637 SkTSpan* first = fHead; in coincidentCheck() local
638 if (!first) { in coincidentCheck()
643 int consecutive = this->countConsecutiveSpans(first, &last); in coincidentCheck()
650 this->computePerpendiculars(sect2, first, last); in coincidentCheck()
654 SkTSpan* coinStart = first; in coincidentCheck()
667 } while ((first = next)); in coincidentCheck()
673 SkTSpan* first = fHead; in coincidentForce() local
680 bool deleteEmptySpans = this->updateBounded(first, last, oppFirst); in coincidentForce()
681 deleteEmptySpans |= sect2->updateBounded(oppFirst, oppLast, first); in coincidentForce()
682 this->removeSpanRange(first, las in coincidentForce()
730 computePerpendiculars(SkTSect* sect2, SkTSpan* first, SkTSpan* last) computePerpendiculars() argument
773 countConsecutiveSpans(SkTSpan* first, SkTSpan** lastPtr) const countConsecutiveSpans() argument
823 extractCoincident( SkTSect* sect2, SkTSpan* first, SkTSpan* last, SkTSpan** result) extractCoincident() argument
942 findCoincidentRun( SkTSpan* first, SkTSpan** lastPtr) findCoincidentRun() argument
1417 removeSpanRange(SkTSpan* first, SkTSpan* last) removeSpanRange() argument
1541 updateBounded(SkTSpan* first, SkTSpan* last, SkTSpan* oppFirst) updateBounded() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/
H A DLegalizerInfo.cpp111 return Q.Types[Mutation.first] != Mutation.second; in hasNoSimpleLoops()
125 const unsigned TypeIdx = Mutation.first; in mutationIsSane()
194 << Mutation.first << ", " << Mutation.second << "\n"); in apply()
198 return {Rule.getAction(), Mutation.first, Mutation.second}; in apply()
221 LLVM_DEBUG(dbgs() << ".. the first uncovered type index: " << FirstUncovered in verifyTypeIdxsCoverage()
243 LLVM_DEBUG(dbgs() << ".. the first uncovered imm index: " << FirstUncovered in verifyImmIdxsCoverage()
302 const LLT Type = LLT2Action.first; in computeTables()
336 Opcode, TypeIdx, PointerSpecifiedActions.first, in computeTables()
344 const uint16_t ElementSize = VectorSpecifiedActions.first; in computeTables()
353 assert(BitsizeAndAction.first in computeTables()
[all...]
/kernel/linux/linux-5.10/drivers/video/fbdev/
H A Dc2p_iplan2.c92 u32 dst_idx, first, last, w; in c2p_iplan2() local
98 first = 0xffffU >> dst_idx; in c2p_iplan2()
99 first |= first << 16; in c2p_iplan2()
108 first &= last; in c2p_iplan2()
113 store_iplan2_masked(p, bpp, d.words, first); in c2p_iplan2()
125 store_iplan2_masked(p, bpp, d.words, first); in c2p_iplan2()
/kernel/linux/linux-5.10/io_uring/
H A Dio-wq.h28 struct io_wq_work_node *first; member
48 if (!list->first) { in wq_list_add_tail()
50 WRITE_ONCE(list->first, node); in wq_list_add_tail()
61 /* first in the list, if prev==NULL */ in wq_list_cut()
63 WRITE_ONCE(list->first, last->next); in wq_list_cut()
80 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
82 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
84 (list)->first = NULL; \
/kernel/linux/linux-6.6/drivers/video/fbdev/
H A Dc2p_iplan2.c92 u32 dst_idx, first, last, w; in c2p_iplan2() local
98 first = 0xffffU >> dst_idx; in c2p_iplan2()
99 first |= first << 16; in c2p_iplan2()
108 first &= last; in c2p_iplan2()
113 store_iplan2_masked(p, bpp, d.words, first); in c2p_iplan2()
125 store_iplan2_masked(p, bpp, d.words, first); in c2p_iplan2()
/third_party/benchmark/src/
H A Dcsv_reporter.cc69 if (cnt.first == "bytes_per_second" || cnt.first == "items_per_second") in ReportRuns()
71 user_counter_names_.insert(cnt.first); in ReportRuns()
91 if (cnt.first == "bytes_per_second" || cnt.first == "items_per_second") in ReportRuns()
93 BM_CHECK(user_counter_names_.find(cnt.first) != in ReportRuns()
96 << "Counter named \"" << cnt.first in ReportRuns()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DSymbolTableListTraitsImpl.h83 SymbolTableListTraits &L2, iterator first, iterator last) { in transferNodesFromList()
94 for (; first != last; ++first) { in transferNodesFromList()
95 ValueSubClass &V = *first; in transferNodesFromList()
106 for (; first != last; ++first) in transferNodesFromList()
107 first->setParent(NewIP); in transferNodesFromList()
82 transferNodesFromList( SymbolTableListTraits &L2, iterator first, iterator last) transferNodesFromList() argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DDebugCounter.cpp37 size_t NumSpaces = GlobalWidth - Info.first.size() - 8;
38 outs() << " =" << Info.first;
86 if (CounterPair.first.endswith("-skip")) { in push_back()
87 auto CounterName = CounterPair.first.drop_back(5); in push_back()
99 } else if (CounterPair.first.endswith("-count")) { in push_back()
100 auto CounterName = CounterPair.first.drop_back(6); in push_back()
113 errs() << "DebugCounter Error: " << CounterPair.first in push_back()
/kernel/linux/linux-5.10/arch/arm/include/asm/
H A Dopcodes.h146 #define __opcode_thumb32_compose(first, second) ( \
147 (___opcode_identity32(___opcode_identity16(first)) << 16) \
152 #define ___asm_opcode_thumb32_compose(first, second) ( \
153 (___asm_opcode_identity32(___asm_opcode_identity16(first)) << 16) \
220 #define ___inst_thumb32(first, second) .short first, second
224 #define ___inst_thumb32(first, second) \
225 ".short " __stringify(first) ", " __stringify(second) "\n\t"

Completed in 15 milliseconds

12345678910>>...254