Home
last modified time | relevance | path

Searched refs:pair (Results 826 - 850 of 2501) sorted by relevance

1...<<31323334353637383940>>...101

/kernel/linux/linux-6.6/drivers/ata/
H A Dpata_it821x.c190 struct ata_device *pair = ata_dev_pair(adev); in it821x_clock_strategy() local
229 * Reprogram the UDMA/PIO of the pair drive for the switch in it821x_clock_strategy()
232 if (pair && itdev->udma[1-unit] != UDMA_OFF) { in it821x_clock_strategy()
233 it821x_program_udma(ap, pair, itdev->udma[1-unit]); in it821x_clock_strategy()
234 it821x_program(ap, pair, itdev->pio[1-unit]); in it821x_clock_strategy()
308 /* UDMA on. Again revision 0x10 must do the pair */ in it821x_passthru_set_dmamode()
H A Dpata_pdc2027x.c257 struct ata_device *pair = ata_dev_pair(adev); in pdc2027x_mode_filter() local
259 if (adev->class != ATA_DEV_ATA || adev->devno == 0 || pair == NULL) in pdc2027x_mode_filter()
263 ata_id_c_string(pair->id, model_num, ATA_ID_PROD, in pdc2027x_mode_filter()
266 if (strstr(model_num, "Maxtor") == NULL && pair->dma_mode == XFER_UDMA_6) in pdc2027x_mode_filter()
/kernel/linux/linux-6.6/scripts/kconfig/
H A Dnconf.gui.c96 int pair = 0; in set_colors() local
110 pair++; in set_colors()
111 init_pair(pair, p->color_fg, p->color_bg); in set_colors()
112 attr |= COLOR_PAIR(pair); in set_colors()
/third_party/gn/src/gn/
H A Dheader_checker_unittest.cc200 std::set<std::pair<const Target*, const Target*>> no_dependency_cache; in TEST_F()
301 std::set<std::pair<const Target*, const Target*>> no_dependency_cache; in TEST_F()
348 std::set<std::pair<const Target*, const Target*>> no_dependency_cache; in TEST_F()
464 std::set<std::pair<const Target*, const Target*>> no_dependency_cache; in TEST_F()
/third_party/json/include/nlohmann/detail/conversions/
H A Dfrom_json.hpp20 #include <utility> // pair, declval
383 std::pair<A1, A2> from_json_tuple_impl(BasicJsonType&& j, identity_tag<std::pair<A1, A2>> /*unused*/, priority_tag<0> /*unused*/) in from_json_tuple_impl()
390 inline void from_json_tuple_impl(BasicJsonType&& j, std::pair<A1, A2>& p, priority_tag<1> /*unused*/) in from_json_tuple_impl()
392 p = from_json_tuple_impl(std::forward<BasicJsonType>(j), identity_tag<std::pair<A1, A2>> {}, priority_tag<0> {}); in from_json_tuple_impl()
/third_party/node/deps/v8/src/compiler/
H A Dcommon-operator.h166 struct ObjectStateInfo final : std::pair<uint32_t, int> {
168 : std::pair<uint32_t, int>(object_id, size) {} in ObjectStateInfo()
176 : std::pair<uint32_t, const ZoneVector<MachineType>*> {
179 : std::pair<uint32_t, const ZoneVector<MachineType>*>(object_id, in TypedObjectStateInfo()
H A Djs-heap-broker.h71 size_t operator()(const PropertyAccessTarget& pair) const { in operator ()()
73 base::hash_combine(pair.map.object().address(), in operator ()()
74 pair.name.object().address()), in operator ()()
75 static_cast<int>(pair.mode)); in operator ()()
/third_party/node/deps/v8/src/heap/
H A Dconcurrent-marking.cc81 std::pair<ObjectSlot, Object> snapshot_[kMaxSnapshotSize];
656 for (auto& pair : memory_chunk_data) { in FlushMemoryChunkData()
659 MemoryChunk* memory_chunk = pair.first; in FlushMemoryChunkData()
660 MemoryChunkData& data = pair.second; in FlushMemoryChunkData()
/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()
/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>;

Completed in 54 milliseconds

1...<<31323334353637383940>>...101