Home
last modified time | relevance | path

Searched refs:Compare (Results 1 – 25 of 346) sorted by relevance

12345678910>>...14

/openbsd-src/gnu/llvm/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp82 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
84 bool convertToLoadAndTrap(MachineInstr &MI, MachineInstr &Compare,
86 bool convertToLoadAndTest(MachineInstr &MI, MachineInstr &Compare,
88 bool convertToLogical(MachineInstr &MI, MachineInstr &Compare,
90 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
93 bool optimizeCompareZero(MachineInstr &Compare,
95 bool fuseCompareOperations(MachineInstr &Compare,
175 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
177 if (Compare.isCompare()) in getCompareSourceReg()
178 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DPriorityQueue.h27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
H A Dsimple_ilist.h256 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
262 template <class Compare> void sort(Compare comp);
267 template <class Compare>
268 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
289 template <class Compare>
290 void simple_ilist<T, Options...>::sort(Compare comp) { in sort()
H A DEquivalenceClasses.h59 template <class ElemTy, class Compare = std::less<ElemTy>>
118 ECValueComparator() : compare(Compare()) {} in ECValueComparator()
134 const Compare compare;
/openbsd-src/gnu/llvm/libcxx/include/
H A Dset20 template <class Key, class Compare = less<Key>,
28 typedef Compare key_compare;
72 : set(first, last, Compare(), a) {} // C++14
74 : set(il, Compare(), a) {} // C++14
187 class Compare = less<typename iterator_traits<InputIterator>::value_type>,
190 Compare = Compare(), Allocator = Allocator())
191 -> set<typename iterator_traits<InputIterator>::value_type, Compare, Allocator>; // C++17
193 template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
194 set(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
195 -> set<Key, Compare, Allocator>; // C++17
[all …]
H A Dqueue112 class Compare = less<typename Container::value_type>>
124 Compare comp;
127 priority_queue() : priority_queue(Compare()) {} // C++20
128 explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
129 priority_queue(const Compare& x, const Container&);
130 … explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
131 priority_queue(const Compare& x, Container&&); // C++20
134 const Compare& comp = Compare());
137 const Compare& comp, const Container& c);
140 const Compare& comp, Container&& c);
[all …]
H A Dmap20 template <class Key, class T, class Compare = less<Key>,
29 typedef Compare key_compare;
85 : map(first, last, Compare(), a) {} // C++14
87 : map(il, Compare(), a) {} // C++14
227 class Compare = less<iter_key_t<InputIterator>>,
229 map(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
230 -> map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Compare, Allocator>; // C++17
232 template<class Key, class T, class Compare = less<Key>,
234 map(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
235 -> map<Key, T, Compare, Allocator>; // C++17
[all …]
H A Dalgorithm1400 template <class ForwardIterator, class Compare>
1402 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1408 template <class ForwardIterator, class Compare>
1410 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1416 template <class RandomAccessIterator, class Compare>
1418 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1424 template <class RandomAccessIterator, class Compare>
1426 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1432 template <class RandomAccessIterator, class Compare>
1434 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
[all …]
/openbsd-src/lib/libform/
H A Dfty_enum.c237 Compare(const unsigned char *s, const unsigned char *buf, in Compare() function
302 if ((res = Compare((unsigned char *)s, bp, ccase)) != NOMATCH) in Check_Enum_Field()
309 if ((res = Compare((unsigned char *)p, bp, ccase)) != NOMATCH) in Check_Enum_Field()
359 if (Compare((unsigned char *)(*kwds++), bp, ccase) == EXACT) in Next_Enum()
364 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Next_Enum()
397 if (Compare((unsigned char *)(*kwds--), bp, ccase) == EXACT) in Previous_Enum()
404 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Previous_Enum()
/openbsd-src/gnu/gcc/libstdc++-v3/docs/html/17_intro/
H A DCHECKLIST2337 class Compare = less<typename Container::value_type> >
2585 T template <class Compare> void merge(list<T,Allocator>& x, Compare comp);
2587 T template <class Compare> void sort(Compare comp);
2652 class Compare = less<typename Container::value_type> >
2660 T Compare comp;
2662 T explicit priority_queue(const Compare& x = Compare(),
2666 const Compare& x = Compare(),
2921 template <class Key, class T, class Compare = less<Key>,
2925 T template <class Key, class T, class Compare, class Allocator>
2926 bool operator==(const map<Key,T,Compare,Allocator>& x,
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/docs/html/17_intro/
H A DCHECKLIST2337 class Compare = less<typename Container::value_type> >
2585 T template <class Compare> void merge(list<T,Allocator>& x, Compare comp);
2587 T template <class Compare> void sort(Compare comp);
2652 class Compare = less<typename Container::value_type> >
2660 T Compare comp;
2662 T explicit priority_queue(const Compare& x = Compare(),
2666 const Compare& x = Compare(),
2921 template <class Key, class T, class Compare = less<Key>,
2925 T template <class Key, class T, class Compare, class Allocator>
2926 bool operator==(const map<Key,T,Compare,Allocator>& x,
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.jason/
H A Dtemplate34.C4 typedef int (*Compare)(const T&, const T&); typedef
5 static Compare cmp1;
17 typename Set<T>::Compare Set<T>::cmp1 = &gen_cmp;
/openbsd-src/gnu/llvm/libcxx/include/experimental/
H A Dset22 template <class Key, class T, class Compare = less<Key>>
23 using set = std::set<Key, T, Compare,
26 template <class Key, class T, class Compare = less<Key>>
27 using multiset = std::multiset<Key, T, Compare,
H A Dmap22 template <class Key, class T, class Compare = less<Key>>
23 using map = std::map<Key, T, Compare,
26 template <class Key, class T, class Compare = less<Key>>
27 using multimap = std::multimap<Key, T, Compare,
/openbsd-src/gnu/llvm/lldb/include/lldb/Core/
H A DUniqueCStringMap.h87 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in Find()
99 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in FindFirstValueForName()
128 m_map.begin(), m_map.end(), unique_cstr, Compare()))) in GetValues()
175 Compare c; in Sort()
205 std::equal_range(m_map.begin(), m_map.end(), unique_cstr, Compare())); in equal_range()
209 struct Compare { struct
/openbsd-src/gnu/llvm/clang/include/clang/Serialization/
H A DContinuousRangeMap.h50 struct Compare { struct
76 iterator I = llvm::lower_bound(Rep, Val, Compare()); in insertOrReplace() argument
94 iterator I = llvm::upper_bound(Rep, K, Compare()); in find()
120 llvm::sort(Self.Rep, Compare()); in ~Builder()
/openbsd-src/gnu/usr.bin/binutils-2.17/gas/doc/
H A Dc-i960.texi120 Normally, Compare-and-Branch instructions with targets that require
127 This option does not affect the Compare-and-Jump instructions; the code
205 instruction: @samp{callj}, and Compare-and-Branch or Compare-and-Jump
210 * Compare-and-branch-i960:: Compare-and-Branch
226 @node Compare-and-branch-i960
227 @subsection Compare-and-Branch
231 The 960 architectures provide combined Compare-and-Branch instructions
235 either issue an error, or convert your Compare-and-Branch instruction
242 and whether you use a ``Compare and Branch'' instruction or a ``Compare
248 These are the Compare-and-Branch instructions, their ``Jump'' variants,
[all …]
/openbsd-src/gnu/usr.bin/binutils/gas/doc/
H A Dc-i960.texi120 Normally, Compare-and-Branch instructions with targets that require
127 This option does not affect the Compare-and-Jump instructions; the code
205 instruction: @samp{callj}, and Compare-and-Branch or Compare-and-Jump
210 * Compare-and-branch-i960:: Compare-and-Branch
226 @node Compare-and-branch-i960
227 @subsection Compare-and-Branch
231 The 960 architectures provide combined Compare-and-Branch instructions
235 either issue an error, or convert your Compare-and-Branch instruction
242 and whether you use a ``Compare and Branch'' instruction or a ``Compare
248 These are the Compare-and-Branch instructions, their ``Jump'' variants,
[all …]
/openbsd-src/gnu/llvm/lldb/source/Core/
H A DDeclaration.cpp58 int Declaration::Compare(const Declaration &a, const Declaration &b) { in Compare() function in Declaration
59 int result = FileSpec::Compare(a.m_file, b.m_file, true); in Compare()
74 int file_compare = FileSpec::Compare(this->m_file, declaration.m_file, true); in FileAndLineEqual()
H A DSourceLocationSpec.cpp38 return SourceLocationSpec::Compare(*this, rhs) < 0; in operator <()
46 int SourceLocationSpec::Compare(const SourceLocationSpec &lhs, in Compare() function in SourceLocationSpec
48 return Declaration::Compare(lhs.m_declaration, rhs.m_declaration); in Compare()
/openbsd-src/gnu/llvm/lldb/source/Symbol/
H A DLineEntry.cpp154 return LineEntry::Compare(a, b) < 0; in operator <()
157 int LineEntry::Compare(const LineEntry &a, const LineEntry &b) { in Compare() function in LineEntry
189 return FileSpec::Compare(a.file, b.file, true); in Compare()
/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DValue.h806 template <class Compare> void sortUseList(Compare Cmp);
820 template <class Compare>
821 static Use *mergeUseLists(Use *L, Use *R, Compare Cmp) { in mergeUseLists()
881 template <class Compare> void Value::sortUseList(Compare Cmp) { in sortUseList()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopFlatten.cpp424 ICmpInst *Compare = L->getLatchCmpInst(); in findLoopComponents() local
425 if (!Compare || !IsValidPredicate(Compare->getUnsignedPredicate()) || in findLoopComponents()
426 Compare->hasNUsesOrMore(2)) { in findLoopComponents()
433 IterationInstructions.insert(Compare); in findLoopComponents()
434 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump()); in findLoopComponents()
442 if ((Compare->getOperand(0) != Increment || !Increment->hasNUses(2)) && in findLoopComponents()
452 Value *RHS = Compare->getOperand(1); in findLoopComponents()
/openbsd-src/gnu/llvm/lldb/source/API/
H A DSBDeclaration.cpp116 return lldb_private::Declaration::Compare(*lhs_ptr, *rhs_ptr) == 0; in operator ==()
128 return lldb_private::Declaration::Compare(*lhs_ptr, *rhs_ptr) != 0; in operator !=()
H A DSBLineEntry.cpp135 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) == 0; in operator ==()
147 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) != 0; in operator !=()

12345678910>>...14