Home
last modified time | relevance | path

Searched refs:first (Results 526 - 550 of 6785) sorted by relevance

1...<<21222324252627282930>>...272

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Option/
H A DArgList.cpp40 OptRanges.insert(std::make_pair(O.getID(), emptyRange())).first->second; in append()
41 R.first = std::min<unsigned>(R.first, Args.size() - 1); in append()
63 R.first = std::min(R.first, I->second.first); in getRange()
68 if (R.first == -1u) in getRange()
69 R.first = 0; in getRange()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DItaniumManglingCanonicalizer.cpp131 return getOrCreateNode<T>(true, std::forward<Args>(As)...).first; in makeNode()
151 MostRecentlyCreated = Result.first; in makeNodeSimple()
152 } else if (Result.first) { in makeNodeSimple()
154 if (auto *N = Remappings.lookup(Result.first)) { in makeNodeSimple()
155 Result.first = N; in makeNodeSimple()
156 assert(Remappings.find(Result.first) == Remappings.end() && in makeNodeSimple()
159 if (Result.first == TrackedNode) in makeNodeSimple()
162 return Result.first; in makeNodeSimple()
/third_party/spirv-tools/source/opt/
H A Ddominator_tree.cpp27 // 2 - Using the CFA::DepthFirstTraversal get a depth first postordered list of
36 // 5 - Using the tree from 4, perform a depth first traversal to calculate the
45 // depth first search on generic BasicBlock types. Will call post and pre order
66 // depth first search on generic BasicBlock types. This overload is for only
271 .first->second; in GetOrInsertNode()
282 // Each time the depth first traversal calls the postorder callback in GetDominatorEdges()
331 DominatorTreeNode* first = GetOrInsertNode(edge.first); in InitializeTree() local
333 if (edge.first == edge.second) { in InitializeTree()
334 if (std::find(roots_.begin(), roots_.end(), first) in InitializeTree()
[all...]
/foundation/ability/ability_runtime/frameworks/native/ability/native/form_runtime/
H A Dform_extension_provider_client.cpp125 if (errorCode.first != ERR_OK) { in NotifyFormDelete()
126 TAG_LOGE(AAFwkTag::FORM_EXT, "CheckParam failed: %{public}d", errorCode.first); in NotifyFormDelete()
167 if (errorCode.first != ERR_OK) { in NotifyFormsDelete()
168 TAG_LOGE(AAFwkTag::FORM_EXT, "CheckParam failed: %{public}d", errorCode.first); in NotifyFormsDelete()
204 if (errorCode.first != ERR_OK) { in NotifyFormUpdate()
205 TAG_LOGE(AAFwkTag::FORM_EXT, "CheckParam failed: %{public}d", errorCode.first); in NotifyFormUpdate()
241 if (errorCode.first != ERR_OK) { in EventNotify()
242 TAG_LOGE(AAFwkTag::FORM_EXT, "CheckParam failed: %{public}d", errorCode.first); in EventNotify()
280 if (errorCode.first != ERR_OK) { in NotifyFormCastTempForm()
281 TAG_LOGE(AAFwkTag::FORM_EXT, "CheckParam failed: %{public}d", errorCode.first); in NotifyFormCastTempForm()
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/src/relational/
H A Dtable_info.cpp404 attrStr += "\"" + (*itIndexDefine).first + "\": [\""; in AddIndexDefineString()
497 if (DBCommon::CaseInsensitiveCompare(itLocal->first, itInTable->first)) { // Same field in CompareWithTableFields()
571 if (!DBCommon::CaseInsensitiveCompare(itLocal->first, itInTable->first) || in CompareWithTableIndex()
583 void Difference(const FieldInfoMap &first, const FieldInfoMap &second, FieldInfoMap &orphanFst, FieldInfoMap &orphanSnd, in Difference() argument
586 auto itFirst = first.begin(); in Difference()
588 while (itFirst != first.end()) { // LCOV_EXCL_BR_LINE in Difference()
592 if (itFirst->first == itSecond->first) { // LCOV_EXCL_BR_LIN in Difference()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DHashing.h264 /// seed and the first 64-byte chunk.
326 // However, if there is a fixed seed override set the first time this is in get_execution_seed()
339 /// first be passed to hash_value, and the resulting hash_codes combined.
370 /// This variant is enabled when we must first call hash_value and use the
382 /// This routine first checks whether there is enough space in the provided
404 hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) { in hash_combine_range_impl() argument
408 while (first != last && store_and_advance(buffer_ptr, buffer_end, in hash_combine_range_impl()
409 get_hashable_data(*first))) in hash_combine_range_impl()
410 ++first; in hash_combine_range_impl()
411 if (first in hash_combine_range_impl()
448 hash_combine_range_impl(ValueT *first, ValueT *last) hash_combine_range_impl() argument
480 hash_combine_range(InputIteratorT first, InputIteratorT last) hash_combine_range() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/
H A DSampleProfWriter.cpp54 return A.first > B.first; in writeFuncProfiles()
163 writeNameIdx(entry.first); in writeFuncOffsetTable()
181 addName(I.first()); in writeSections()
240 LineLocation Loc = I->first; in writeSample()
251 OS << " " << J.first << ":" << J.second; in writeSample()
260 LineLocation Loc = I->first; in writeSample()
292 addName(J.first()); in addNames()
307 V.insert(I.first); in stablizeNameTable()
345 writeNameIdx(entry.first); in writeFuncOffsetTable()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DHashing.h263 /// seed and the first 64-byte chunk.
325 // However, if there is a fixed seed override set the first time this is in get_execution_seed()
337 /// first be passed to hash_value, and the resulting hash_codes combined.
368 /// This variant is enabled when we must first call hash_value and use the
380 /// This routine first checks whether there is enough space in the provided
402 hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) { in hash_combine_range_impl() argument
406 while (first != last && store_and_advance(buffer_ptr, buffer_end, in hash_combine_range_impl()
407 get_hashable_data(*first))) in hash_combine_range_impl()
408 ++first; in hash_combine_range_impl()
409 if (first in hash_combine_range_impl()
446 hash_combine_range_impl(ValueT *first, ValueT *last) hash_combine_range_impl() argument
478 hash_combine_range(InputIteratorT first, InputIteratorT last) hash_combine_range() argument
[all...]
/third_party/libexif/libexif/
H A Dexif-tag.c204 "for location finding. The first byte indicates the character "
210 "first byte indicates the character code used, "
775 "there are multiple audio files, the first recorded file is "
833 "processing as per the <Rotation> tag. The first value "
1047 * Finds the first entry in the EXIF tag table with the given tag number
1065 * backwards to find the first in exif_tag_table_first()
1083 int first; in exif_tag_get_name_in_ifd() local
1087 first = exif_tag_table_first(tag); in exif_tag_get_name_in_ifd()
1088 if (first < 0) in exif_tag_get_name_in_ifd()
1091 for (i = first; ExifTagTabl in exif_tag_get_name_in_ifd()
1105 int first; exif_tag_get_title_in_ifd() local
1128 int first; exif_tag_get_description_in_ifd() local
1264 int first = exif_tag_table_first(tag); get_support_level_in_ifd() local
1294 int first = exif_tag_table_first(tag); get_support_level_any_type() local
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/api/
H A DvktApiVersionCheck.cpp161 if (it->first <= m_context.getUsedApiVersion()) in iterate()
460 if (deStringEqual(testsArr[ndx].first, "vkGetInstanceProcAddr") || deStringEqual(testsArr[ndx].first, "vkEnumerateInstanceVersion")) in mixupAddressProcCheck()
463 const char* functionName = testsArr[ndx].first; in mixupAddressProcCheck()
483 checkPlatformFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
485 checkInstanceFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
487 checkDeviceFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
498 const auto& funcName = testsArr[ndx].first; in regularCheck()
578 if (testedApiVersion.first > supportedApiVersion) in iterate()
582 if (testedApiVersion.first in iterate()
[all...]
/base/powermgr/battery_statistics/services/native/src/entities/
H A Duid_entity.cpp59 return item.first; in GetUids()
129 power += CalculateForConnectivity(iter.first); in Calculate()
130 power += CalculateForCommon(iter.first); in Calculate()
133 AddtoStatsList(iter.first, power); in Calculate()
134 int32_t uid = iter.first; in Calculate()
352 ErrCode res = bmgr->GetNameForUid(iter.first, bundleName); in DumpInfo()
356 iter.first, static_cast<int32_t>(res)); in DumpInfo()
362 .append(ToString(iter.first)) in DumpInfo()
368 DumpForBluetooth(iter.first, result); in DumpInfo()
369 DumpForCommon(iter.first, resul in DumpInfo()
[all...]
/base/useriam/pin_auth/test/unittest/src/
H A Dpin_auth_verifier_hdi_unit_test.cpp111 return static_cast<int32_t>(pair.first); in HWTEST_F()
137 .authType = pair.first, in HWTEST_F()
147 EXPECT_TRUE(info.authType == pair.second.first); in HWTEST_F()
170 .executorRole = pair.first, in HWTEST_F()
181 EXPECT_TRUE(info.executorRole == pair.second.first); in HWTEST_F()
208 .esl = pair.first, in HWTEST_F()
217 EXPECT_TRUE(info.esl == pair.second.first); in HWTEST_F()
239 const std::vector<uint8_t> &extraInfo) { return pair.first; }); in HWTEST_F()
261 const sptr<IExecutorCallback> &callbackObj) { return pair.first; }); in HWTEST_F()
307 return pair.first; in HWTEST_F()
[all...]
H A Dpin_auth_collector_hdi_unit_test.cpp111 return static_cast<int32_t>(pair.first); in HWTEST_F()
137 .authType = pair.first, in HWTEST_F()
147 EXPECT_TRUE(info.authType == pair.second.first); in HWTEST_F()
170 .executorRole = pair.first, in HWTEST_F()
181 EXPECT_TRUE(info.executorRole == pair.second.first); in HWTEST_F()
208 .esl = pair.first, in HWTEST_F()
217 EXPECT_TRUE(info.esl == pair.second.first); in HWTEST_F()
239 const std::vector<uint8_t> &extraInfo) { return pair.first; }); in HWTEST_F()
263 { return pair.first; }); in HWTEST_F()
283 return pair.first; in HWTEST_F()
[all...]
/foundation/ability/ability_runtime/frameworks/native/ability/ability_runtime/
H A Dlocal_call_container.cpp214 tempstr += " uri[" + item.first + "]" + "\n"; in DumpCalls()
235 if (!callElement.ParseURI(pair.first)) { in GetCallLocalRecord()
237 "failed elementName uri: %{private}s", pair.first.c_str()); in GetCallLocalRecord()
243 if ((pair.first != elementName.GetURI() && callElement.GetURI() != elementName.GetURI())) { in GetCallLocalRecord()
272 "singleton key[%{public}s]. notify died event", item.first.c_str()); in OnCallStubDied()
277 "singleton key[%{public}s] empty", item.first.c_str()); in OnCallStubDied()
278 callProxyRecords_.erase(item.first); in OnCallStubDied()
287 AAFwkTag::LOCAL_CALL, "multiple key[%{public}s].", item.first.c_str()); in OnCallStubDied()
293 item.first.c_str()); in OnCallStubDied()
298 "multiple key[%{public}s] empty.", item.first in OnCallStubDied()
[all...]
/foundation/multimedia/media_foundation/engine/pipeline/core/
H A Dfilter_base.cpp203 auto ret = meta.GetData(static_cast<Plugin::Tag>(keyPair.first), outValPtr); in ConfigPluginWithMeta()
204 if (ret && keyPair.second.first(keyPair.first, outValPtr)) { in ConfigPluginWithMeta()
205 if (plugin.SetParameter(keyPair.first, outValPtr) != Plugin::Status::OK) { in ConfigPluginWithMeta()
207 Plugin::GetTagStrName(keyPair.first), keyPair.first, plugin.GetName().c_str()); in ConfigPluginWithMeta()
210 if (!Plugin::HasTagInfo(keyPair.first)) { in ConfigPluginWithMeta()
211 MEDIA_LOG_W("tag " PUBLIC_LOG_D32 " is not in map, may be update it?", keyPair.first); in ConfigPluginWithMeta()
214 Plugin::GetTagStrName(keyPair.first)); in ConfigPluginWithMeta()
240 return GetInPort(ite->first); in GetRouteInPort()
[all...]
/third_party/nghttp2/src/
H A Dshrpx_api_downstream_connection.cc378 for (auto first = reinterpret_cast<const uint8_t *>(rp), in handle_backendconfig()
379 last = first + req.recv_body_length; in handle_backendconfig()
380 first != last;) { in handle_backendconfig()
381 auto eol = std::find(first, last, '\n'); in handle_backendconfig()
386 if (first == eol || *first == '#') { in handle_backendconfig()
387 first = ++eol; in handle_backendconfig()
391 auto eq = std::find(first, eol, '='); in handle_backendconfig()
397 auto opt = StringRef{first, eq}; in handle_backendconfig()
406 first in handle_backendconfig()
[all...]
/third_party/node/deps/v8/src/ast/
H A Dmodules.cc36 AstRawString::Compare(lhsIt->first, rhsIt->first)) { in operator ()()
41 AstRawString::Compare(lhsIt->second.first, rhsIt->second.first)) { in operator ()()
143 import_assertions_array->set(i, *iter->first->string()); in Serialize()
144 import_assertions_array->set(i + 1, *iter->second.first->string()); in Serialize()
193 } while (next != regular_exports_.end() && next->first == it->first); in SerializeRegularExports()
274 auto current_key = it->first; in AssignCellIndices()
285 } while (it != regular_exports_.end() && it->first in AssignCellIndices()
[all...]
/third_party/rust/crates/clap/src/builder/
H A Ddebug_asserts.rs88 if let Some((first, second)) = cmd.two_args_of(|x| x.get_id() == arg.get_id()) {
93 duplicate_tip(cmd, first, second),
99 if let Some((first, second)) = cmd.two_args_of(|x| x.get_long() == Some(l)) {
105 first.get_id(),
107 duplicate_tip(cmd, first, second)
114 if let Some((first, second)) = cmd.two_args_of(|x| x.get_short() == Some(s)) {
120 first.get_id(),
122 duplicate_tip(cmd, first, second),
129 if let Some((first, second)) =
138 first
[all...]
/third_party/skia/tests/
H A DPathOpsAngleTest.cpp262 SkOpSegment* first = contour.first();
263 first->debugAddAngle(0, 1);
264 SkOpSegment* next = first->next();
266 PathOpsAngleTester::Orderable(*first->debugLastAngle(), *next->debugLastAngle());
459 SkOpSegment* seg1 = contour.first(); in DEF_TEST()
470 // match the expected result. The tests above return 1 when first added, but in DEF_TEST()
517 SkOpSegment* first = contour.first(); in DEF_TEST() local
518 first in DEF_TEST()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
H A DGraph.h390 Vertices.FindAndConstruct(I.first); in operator []()
392 InNeighbors[I.second].insert(I.first); in operator []()
393 OutNeighbors[I.first].insert(I.second); in operator []()
445 /// Inserts a vertex into the graph with Identifier Val.first, and
457 /// Inserts an edge into the graph with Identifier Val.first, and
464 const auto &EI = Val.first; in insert()
465 Vertices.FindAndConstruct(EI.first); in insert()
467 InNeighbors[EI.second].insert(EI.first); in insert()
468 OutNeighbors[EI.first].insert(EI.second); in insert()
474 /// Inserts an edge into the graph with Identifier Val.first, an
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DRDFRegisters.cpp61 UnitInfo &UI = UnitInfos[P.first]; in PhysicalRegisterInfo()
152 if (PA.first == PB.first) in aliasRR()
154 if (PA.first < PB.first) in aliasRR()
156 else if (PB.first < PA.first) in aliasRR()
247 if (Units.test(P.first)) in hasAliasOf()
262 if (!Units.test(P.first)) in hasCoverOf()
277 Units.set(P.first); in insert()
[all...]
/third_party/python/Lib/lib2to3/pgen2/
H A Dpgen.py24 self.first = {} # map from symbol name to set of tokens
53 rawfirst = self.first[name]
54 first = {}
57 ##assert ilabel not in first # XXX failed on <> ... !=
58 first[ilabel] = 1
59 return first
111 if name not in self.first:
113 #print name, self.first[name].keys()
117 self.first[name] = None # dummy to detect left recursion
123 if label in self.first
[all...]
/base/notification/distributed_notification_service/services/ans/src/clone/
H A Dnotification_clone_manager.cpp56 ANS_LOGW("Notification OnBackup %{public}s funtion is null.", iter->first.c_str()); in OnBackup()
60 ANS_LOGW("Notification OnBackup %{public}s failed.", iter->first.c_str()); in OnBackup()
63 jsonObject[iter->first] = jsonItem; in OnBackup()
108 if (jsonObject.contains(iter->first) && iter->second != nullptr) { in OnRestore()
109 iter->second->OnRestore(jsonObject.at(iter->first)); in OnRestore()
/foundation/ai/intelligent_voice_framework/utils/
H A Dstring_util.cpp117 bool StringUtil::SplitLineToPair(const std::string &line, std::string &first, std::string &second) in SplitLineToPair() argument
130 first = line.substr(0, pos); in SplitLineToPair()
133 Trim(first); in SplitLineToPair()
136 if (first.empty() || second.empty()) { in SplitLineToPair()
137 INTELL_VOICE_LOG_ERROR("line is invalid, first:%{public}s, second:%{public}s", first.c_str(), second.c_str()); in SplitLineToPair()
/foundation/arkui/ace_engine/frameworks/core/components/tab_bar/
H A Drender_tab_content.h70 if (iter->first != index) { in AddChildContent()
112 idx = item.first; in RemoveChildContentUpdateMap()
123 if (item.first < idx) { in RemoveChildContentUpdateMap()
125 } else if (item.first > idx) { in RemoveChildContentUpdateMap()
126 newContentMap.emplace(std::pair<int32_t, RefPtr<RenderNode>>(item.first - 1, item.second)); in RemoveChildContentUpdateMap()

Completed in 20 milliseconds

1...<<21222324252627282930>>...272