Home
last modified time | relevance | path

Searched refs:pair (Results 1676 - 1700 of 4586) sorted by relevance

1...<<61626364656667686970>>...184

/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ray_query/
H A DvktRayQueryDirectionTests.cpp129 std::pair<float, float> calcTminTmax (RayOriginType rayOriginType, RayEndType rayEndType, float distanceToEdge) in calcTminTmax()
131 std::pair<float, float> result; in calcTminTmax()
516 std::vector<std::pair<float, float>> generateRotationAngles (de::Random& rnd) in generateRotationAngles()
522 std::vector<std::pair<float, float>> rotationAngles; in generateRotationAngles()
/third_party/vk-gl-cts/external/openglcts/modules/common/subgroups/
H A DglcSubgroupsVoteTests.cpp436 bufferNameMapping.insert(pair<string, string>("SSBO1", "0")); in initPrograms()
464 bufferNameMapping.insert(pair<string, string>("SSBO1", "1")); in initPrograms()
496 bufferNameMapping.insert(pair<string, string>("SSBO1", "2")); in initPrograms()
524 bufferNameMapping.insert(pair<string, string>("SSBO1", "3")); in initPrograms()
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp396 // The bound on the number of indices of the composite pair to note as being in ComputeCompositeDataSynonymFacts()
457 std::pair<protobufs::DataDescriptor, protobufs::DataDescriptor>; in ComputeClosureOfFacts()
460 std::size_t operator()(const DataDescriptorPair& pair) const { in ComputeClosureOfFacts()
461 return DataDescriptorHash()(&pair.first) ^ in ComputeClosureOfFacts()
462 DataDescriptorHash()(&pair.second); in ComputeClosureOfFacts()
476 // This map records, for a given pair of composite data descriptors of the in ComputeClosureOfFacts()
478 // synonymous. A pair is a key to this map only if we have observed that in ComputeClosureOfFacts()
479 // the pair are synonymous at *some* index, but not at *all* indices. in ComputeClosureOfFacts()
480 // Once we find that a pair of data descriptors are equivalent at all indices in ComputeClosureOfFacts()
483 // Using the m and v example from above, initially the pair ( in ComputeClosureOfFacts()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dtransformation_merge_function_returns.cpp219 // returning predecessors to the corresponding pair (return value, in Apply()
224 std::map<uint32_t, std::map<uint32_t, std::pair<uint32_t, uint32_t>>> in Apply()
235 merge_block_id, std::map<uint32_t, std::pair<uint32_t, uint32_t>>()); in Apply()
280 std::pair<uint32_t, uint32_t>(ret_val_id, constant_true)); in Apply()
366 // Add a pair of operands (placeholder id, new predecessor) for each in Apply()
472 std::pair<uint32_t, uint32_t>(maybe_return_val_id, is_returning_id)); in Apply()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp396 // The bound on the number of indices of the composite pair to note as being in ComputeCompositeDataSynonymFacts()
457 std::pair<protobufs::DataDescriptor, protobufs::DataDescriptor>; in ComputeClosureOfFacts()
460 std::size_t operator()(const DataDescriptorPair& pair) const { in ComputeClosureOfFacts()
461 return DataDescriptorHash()(&pair.first) ^ in ComputeClosureOfFacts()
462 DataDescriptorHash()(&pair.second); in ComputeClosureOfFacts()
476 // This map records, for a given pair of composite data descriptors of the in ComputeClosureOfFacts()
478 // synonymous. A pair is a key to this map only if we have observed that in ComputeClosureOfFacts()
479 // the pair are synonymous at *some* index, but not at *all* indices. in ComputeClosureOfFacts()
480 // Once we find that a pair of data descriptors are equivalent at all indices in ComputeClosureOfFacts()
483 // Using the m and v example from above, initially the pair ( in ComputeClosureOfFacts()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dtransformation_merge_function_returns.cpp219 // returning predecessors to the corresponding pair (return value, in Apply()
224 std::map<uint32_t, std::map<uint32_t, std::pair<uint32_t, uint32_t>>> in Apply()
235 merge_block_id, std::map<uint32_t, std::pair<uint32_t, uint32_t>>()); in Apply()
280 std::pair<uint32_t, uint32_t>(ret_val_id, constant_true)); in Apply()
366 // Add a pair of operands (placeholder id, new predecessor) for each in Apply()
472 std::pair<uint32_t, uint32_t>(maybe_return_val_id, is_returning_id)); in Apply()
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dnumber_patternstring.cpp951 for (auto& pair : table) { in convertLocalized()
953 UnicodeString temp = input.tempSubString(offset, pair[0].length()); in convertLocalized()
954 if (temp == pair[0]) { in convertLocalized()
956 offset += pair[0].length() - 1; in convertLocalized()
961 result.append(pair[1]); in convertLocalized()
966 for (auto& pair : table) { in convertLocalized()
967 UnicodeString temp = input.tempSubString(offset, pair[1].length()); in convertLocalized()
968 if (temp == pair[1]) { in convertLocalized()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DHashing.h113 /// \brief Compute a hash_code for a pair of objects.
115 hash_code hash_value(const std::pair<T, U> &arg);
352 // Special case std::pair to detect when both types are viable and when there
353 // is no alignment-derived padding in the pair. This is a bit of a lie because
354 // std::pair isn't truly POD, but it's close enough in all reasonable
356 template <typename T, typename U> struct is_hashable_data<std::pair<T, U> >
360 sizeof(std::pair<T, U>))> {};
648 hash_code hash_value(const std::pair<T, U> &arg) { in hash_value()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
H A DARMBaseInstrInfo.h55 /// with the pair \p MI, \p DefIdx. False otherwise.
69 /// with the pair \p MI, \p DefIdx. False otherwise.
84 /// with the pair \p MI, \p DefIdx. False otherwise.
96 /// non-commutable pair of operand indices OpIdx1 and OpIdx2.
326 std::pair<uint16_t, uint16_t>
339 std::pair<unsigned, unsigned>
341 ArrayRef<std::pair<unsigned, const char *>>
343 ArrayRef<std::pair<unsigned, const char *>>
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Lanai/
H A DLanaiInstrInfo.cpp162 std::pair<unsigned, unsigned>
167 ArrayRef<std::pair<unsigned, const char *>>
170 static const std::pair<unsigned, const char *> TargetFlags[] = { in getSerializableDirectMachineOperandTargetFlags()
351 SmallVector<std::pair<MachineOperand *, LPCC::CondCode>, 4> in optimizeCompareInstr()
/third_party/spirv-tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp397 // The bound on the number of indices of the composite pair to note as being in ComputeCompositeDataSynonymFacts()
458 std::pair<protobufs::DataDescriptor, protobufs::DataDescriptor>; in ComputeClosureOfFacts()
461 std::size_t operator()(const DataDescriptorPair& pair) const { in ComputeClosureOfFacts()
462 return DataDescriptorHash()(&pair.first) ^ in ComputeClosureOfFacts()
463 DataDescriptorHash()(&pair.second); in ComputeClosureOfFacts()
477 // This map records, for a given pair of composite data descriptors of the in ComputeClosureOfFacts()
479 // synonymous. A pair is a key to this map only if we have observed that in ComputeClosureOfFacts()
480 // the pair are synonymous at *some* index, but not at *all* indices. in ComputeClosureOfFacts()
481 // Once we find that a pair of data descriptors are equivalent at all indices in ComputeClosureOfFacts()
484 // Using the m and v example from above, initially the pair ( in ComputeClosureOfFacts()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DHashing.h112 /// Compute a hash_code for a pair of objects.
114 hash_code hash_value(const std::pair<T, U> &arg);
350 // Special case std::pair to detect when both types are viable and when there
351 // is no alignment-derived padding in the pair. This is a bit of a lie because
352 // std::pair isn't truly POD, but it's close enough in all reasonable
354 template <typename T, typename U> struct is_hashable_data<std::pair<T, U> >
358 sizeof(std::pair<T, U>))> {};
646 hash_code hash_value(const std::pair<T, U> &arg) { in hash_value()
H A DStringRef.h710 /// If \p Separator is in the string, then the result is a pair (LHS, RHS)
713 /// pair (LHS, RHS) where (*this == LHS) and (RHS == "").
718 std::pair<StringRef, StringRef> split(char Separator) const {
725 /// If \p Separator is in the string, then the result is a pair (LHS, RHS)
728 /// pair (LHS, RHS) where (*this == LHS) and (RHS == "").
733 std::pair<StringRef, StringRef> split(StringRef Separator) const {
743 /// If \p Separator is in the string, then the result is a pair (LHS, RHS)
746 /// pair (LHS, RHS) where (*this == LHS) and (RHS == "").
751 std::pair<StringRef, StringRef> rsplit(StringRef Separator) const {
796 /// If \p Separator is in the string, then the result is a pair (LH
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmessage_lite.cc543 for (auto pair : functions) pair.first(pair.second); in ~ShutdownData()
551 std::vector<std::pair<void (*)(const void*), const void*>> functions;
/third_party/spirv-tools/source/fuzz/
H A Dtransformation_merge_function_returns.cpp219 // returning predecessors to the corresponding pair (return value, in Apply()
224 std::map<uint32_t, std::map<uint32_t, std::pair<uint32_t, uint32_t>>> in Apply()
235 merge_block_id, std::map<uint32_t, std::pair<uint32_t, uint32_t>>()); in Apply()
280 std::pair<uint32_t, uint32_t>(ret_val_id, constant_true)); in Apply()
366 // Add a pair of operands (placeholder id, new predecessor) for each in Apply()
472 std::pair<uint32_t, uint32_t>(maybe_return_val_id, is_returning_id)); in Apply()
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ray_query/
H A DvktRayQueryDirectionTests.cpp129 std::pair<float, float> calcTminTmax (RayOriginType rayOriginType, RayEndType rayEndType, float distanceToEdge) in calcTminTmax()
131 std::pair<float, float> result; in calcTminTmax()
516 std::vector<std::pair<float, float>> generateRotationAngles (de::Random& rnd) in generateRotationAngles()
522 std::vector<std::pair<float, float>> rotationAngles; in generateRotationAngles()
/foundation/multimedia/audio_framework/services/audio_service/server/src/
H A Daudio_service.cpp370 for (auto pair : endpointList_) { in FilterAllFastProcess()
371 if (pair.second->GetDeviceRole() == OUTPUT_DEVICE && !pair.second->ShouldInnerCap()) { in FilterAllFastProcess()
372 pair.second->DisableFastInnerCap(); in FilterAllFastProcess()
493 for (auto pair : endpointList_) { in OnCapturerFilterRemove()
494 if (pair.second->GetDeviceRole() == OUTPUT_DEVICE) { in OnCapturerFilterRemove()
495 pair.second->DisableFastInnerCap(); in OnCapturerFilterRemove()
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/syncer/src/device/
H A Dmeta_data.cpp370 deviceIdToHashDeviceIdMap_.insert(std::pair<DeviceID, DeviceID>(deviceId, hashDeviceId)); in GetHashDeviceId()
839 std::pair<int, uint64_t> Metadata::GetLocalSchemaVersion() in GetLocalSchemaVersion()
874 std::pair<int, LocalMetaData> Metadata::GetLocalMetaData() in GetLocalMetaData()
886 std::pair<int, Value> Metadata::SerializeLocalMetaData(const LocalMetaData &localMetaData) in SerializeLocalMetaData()
888 std::pair<int, Value> res = {E_OK, {}}; in SerializeLocalMetaData()
904 std::pair<int, LocalMetaData> Metadata::DeSerializeLocalMetaData(const Value &value) in DeSerializeLocalMetaData()
906 std::pair<int, LocalMetaData> res; in DeSerializeLocalMetaData()
/foundation/graphic/graphic_2d/rosen/modules/2d_graphics/src/drawing/recording/
H A Dcmd_list_helper.cpp333 std::vector<std::pair<size_t, size_t>> handleVector1; in AddSymbolLayersToCmdList()
337 std::pair<size_t, size_t> layersHandle = AddVectorToCmdList(cmdList, handleVector1); in AddSymbolLayersToCmdList()
344 std::pair<size_t, size_t> groupsHandle = AddVectorToCmdList(cmdList, handleVector2); in AddSymbolLayersToCmdList()
355 auto handleVector1 = GetVectorFromCmdList<std::pair<size_t, size_t>>(cmdList, symbolLayersHandle.layers); in GetSymbolLayersFromCmdList()
379 std::pair<size_t, size_t> groupInfosHandle = AddVectorToCmdList(cmdList, handleVector); in AddRenderGroupToCmdList()
401 std::pair<size_t, size_t> layerIndexes = AddVectorToCmdList(cmdList, groupInfo.layerIndexes); in AddGroupInfoToCmdList()
402 std::pair<size_t, size_t> maskIndexes = AddVectorToCmdList(cmdList, groupInfo.maskIndexes); in AddGroupInfoToCmdList()
/third_party/node/deps/v8/src/debug/
H A Dliveedit.cc34 // Holds 2 arrays of some elements allowing to compare any pair of
135 std::map<std::pair<int, int>, int> buffer_;
612 std::stack<std::pair<FunctionLiteral*, FunctionLiteralChange>> literal_stack; in CalculateFunctionLiteralChanges()
687 const std::pair<int, int> kTopLevelMarker = std::make_pair(-1, -1); in MapLiterals()
688 std::map<std::pair<int, int>, FunctionLiteral*> position_to_new_literal; in MapLiterals()
692 std::pair<int, int> key = in MapLiterals()
706 std::pair<int, int> key = in MapLiterals()
863 using FuncId = std::pair<int, int>;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCStreamer.cpp94 SectionStack.push_back(std::pair<MCSectionSubPair, MCSectionSubPair>()); in MCStreamer()
105 SectionStack.push_back(std::pair<MCSectionSubPair, MCSectionSubPair>()); in reset()
346 ArrayRef<std::pair<const MCSymbol *, const MCSymbol *>> Ranges, in EmitCVDefRangeDirective()
350 ArrayRef<std::pair<const MCSymbol *, const MCSymbol *>> Ranges, in EmitCVDefRangeDirective()
358 ArrayRef<std::pair<const MCSymbol *, const MCSymbol *>> Ranges, in EmitCVDefRangeDirective()
367 ArrayRef<std::pair<const MCSymbol *, const MCSymbol *>> Ranges, in EmitCVDefRangeDirective()
375 ArrayRef<std::pair<const MCSymbol *, const MCSymbol *>> Ranges, in EmitCVDefRangeDirective()
/third_party/skia/third_party/externals/spirv-tools/source/val/
H A Dvalidate_cfg.cpp383 const std::vector<std::pair<uint32_t, uint32_t>>& back_edges) { in UpdateContinueConstructExitBlocks()
618 for (const auto& pair : num_fall_through_targeted) { in StructuredSwitchChecks()
619 if (pair.second > 1) { in StructuredSwitchChecks()
620 return _.diag(SPV_ERROR_INVALID_CFG, _.FindDef(pair.first)) in StructuredSwitchChecks()
623 << _.getIdName(pair.first); in StructuredSwitchChecks()
687 const std::vector<std::pair<uint32_t, uint32_t>>& back_edges, in StructuredControlFlowChecks()
859 std::vector<std::pair<uint32_t, uint32_t>> back_edges; in PerformCfgChecks()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
H A Dvalidate_cfg.cpp383 const std::vector<std::pair<uint32_t, uint32_t>>& back_edges) { in UpdateContinueConstructExitBlocks()
618 for (const auto& pair : num_fall_through_targeted) { in StructuredSwitchChecks()
619 if (pair.second > 1) { in StructuredSwitchChecks()
620 return _.diag(SPV_ERROR_INVALID_CFG, _.FindDef(pair.first)) in StructuredSwitchChecks()
623 << _.getIdName(pair.first); in StructuredSwitchChecks()
687 const std::vector<std::pair<uint32_t, uint32_t>>& back_edges, in StructuredControlFlowChecks()
859 std::vector<std::pair<uint32_t, uint32_t>> back_edges; in PerformCfgChecks()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h493 /// <CalleeValueInfo, CalleeInfo> call edge pair.
494 using EdgeTy = std::pair<ValueInfo, CalleeInfo>;
616 std::pair<unsigned, unsigned> specialRefCounts() const;
869 /// (typeid, byte offset) pair.
883 using ModulePathStringTableTy = StringMap<std::pair<uint64_t, ModuleHash>>;
892 std::multimap<GlobalValue::GUID, std::pair<std::string, TypeIdSummary>>;
1048 // Functions that have a parent will be marked in FunctionHasParent pair. in calculateCallGraphRoot()
1239 const StringMap<std::pair<uint64_t, ModuleHash>> &modulePaths() const { in modulePaths()
1244 StringMap<std::pair<uint64_t, ModuleHash>> &modulePaths() { in modulePaths()
1275 std::pair<StringRe in getOriginalNameBeforePromote()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp163 std::pair<BasicBlock::iterator, BasicBlock::iterator>
173 std::pair<ArrayRef<Instruction *>, ArrayRef<Instruction *>>
185 std::pair<InstrListMap, InstrListMap> collectInstructions(BasicBlock *BB);
543 std::pair<BasicBlock::iterator, BasicBlock::iterator>
585 std::pair<ArrayRef<Instruction *>, ArrayRef<Instruction *>>
666 // We can ignore the alias if the we have a load store pair and the load in getVectorizablePrefix()
741 std::pair<InstrListMap, InstrListMap>
852 for (const std::pair<ChainID, InstrList> &Chain : Map) { in vectorizeChains()

Completed in 38 milliseconds

1...<<61626364656667686970>>...184