Home
last modified time | relevance | path

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

12345678

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
HDSystemZElimCompare.cpp85 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
87 bool convertToLoadAndTrap(MachineInstr &MI, MachineInstr &Compare,
89 bool convertToLoadAndTest(MachineInstr &MI, MachineInstr &Compare,
91 bool convertToLogical(MachineInstr &MI, MachineInstr &Compare,
93 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
96 bool optimizeCompareZero(MachineInstr &Compare,
98 bool fuseCompareOperations(MachineInstr &Compare,
176 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
178 if (Compare.isCompare()) in getCompareSourceReg()
179 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
[all …]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
HDPriorityQueue.h26 class Compare = std::less<typename Sequence::value_type> >
27 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
29 explicit PriorityQueue(const Compare &compare = Compare(),
31 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
36 const Compare &compare = Compare(),
38 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
HDsimple_ilist.h258 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
264 template <class Compare> void sort(Compare comp);
269 template <class Compare>
270 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
291 template <class Compare>
292 void simple_ilist<T, Options...>::sort(Compare comp) { in sort()
HDSTLExtras.h1097 int (*Compare)(
1108 reinterpret_cast<int (*)(const void *, const void *)>(Compare));
1125 template <typename IteratorTy, typename Compare>
1126 inline void sort(IteratorTy Start, IteratorTy End, Compare Comp) {
1133 template <typename Container, typename Compare>
1134 inline void sort(Container &&C, Compare Comp) {
1283 template <typename R, typename T, typename Compare>
1284 auto lower_bound(R &&Range, T &&Value, Compare C)
1298 template <typename R, typename T, typename Compare>
1299 auto upper_bound(R &&Range, T &&Value, Compare C)
[all …]
/freebsd-11-stable/sys/contrib/dev/acpica/components/executer/
HDexmisc.c457 int Compare; in AcpiExDoLogicalOp() local
562 Compare = memcmp (Operand0->Buffer.Pointer, in AcpiExDoLogicalOp()
573 (Compare == 0)) in AcpiExDoLogicalOp()
583 if (Compare > 0) in AcpiExDoLogicalOp()
588 if (Compare < 0) in AcpiExDoLogicalOp()
603 if (Compare > 0) in AcpiExDoLogicalOp()
607 if (Compare < 0) in AcpiExDoLogicalOp()
/freebsd-11-stable/contrib/llvm-project/libcxx/include/
HDset20 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
182 template <class Key, class Compare, class Allocator>
184 operator==(const set<Key, Compare, Allocator>& x,
185 const set<Key, Compare, Allocator>& y);
187 template <class Key, class Compare, class Allocator>
189 operator< (const set<Key, Compare, Allocator>& x,
190 const set<Key, Compare, Allocator>& y);
[all …]
HDqueue100 class Compare = less<typename Container::value_type>>
112 Compare comp;
124 explicit priority_queue(const Compare& comp);
125 priority_queue(const Compare& comp, const container_type& c);
126 explicit priority_queue(const Compare& comp, container_type&& c);
129 const Compare& comp = Compare());
132 const Compare& comp, const container_type& c);
135 const Compare& comp, container_type&& c);
139 priority_queue(const Compare& comp, const Alloc& a);
141 priority_queue(const Compare& comp, const container_type& c,
[all …]
HDmap20 template <class Key, class T, class Compare = less<Key>,
29 typedef Compare key_compare;
83 : map(first, last, Compare(), a) {} // C++14
85 : map(il, Compare(), a) {} // C++14
220 template <class Key, class T, class Compare, class Allocator>
222 operator==(const map<Key, T, Compare, Allocator>& x,
223 const map<Key, T, Compare, Allocator>& y);
225 template <class Key, class T, class Compare, class Allocator>
227 operator< (const map<Key, T, Compare, Allocator>& x,
228 const map<Key, T, Compare, Allocator>& y);
[all …]
HDalgorithm331 template <class ForwardIterator, class Compare>
333 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
339 template <class ForwardIterator, class Compare>
341 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
347 template <class RandomAccessIterator, class Compare>
349 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
355 template <class RandomAccessIterator, class Compare>
357 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
363 template <class RandomAccessIterator, class Compare>
365 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
[all …]
/freebsd-11-stable/contrib/ncurses/form/
HDfty_enum.c234 Compare(const unsigned char *s, const unsigned char *buf, in Compare() function
298 if ((res = Compare((unsigned char *)s, bp, ccase)) != NOMATCH) in Check_Enum_Field()
305 if ((res = Compare((unsigned char *)p, bp, ccase)) != NOMATCH) in Check_Enum_Field()
355 if (Compare((unsigned char *)(*kwds++), bp, ccase) == EXACT) in Next_Enum()
360 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Next_Enum()
393 if (Compare((unsigned char *)(*kwds--), bp, ccase) == EXACT) in Previous_Enum()
400 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Previous_Enum()
/freebsd-11-stable/contrib/llvm-project/libcxx/include/experimental/
HDset21 template <class Key, class T, class Compare = less<Key>>
22 using set = std::set<Key, T, Compare,
25 template <class Key, class T, class Compare = less<Key>>
26 using multiset = std::multiset<Key, T, Compare,
HDmap21 template <class Key, class T, class Compare = less<Key>>
22 using map = std::map<Key, T, Compare,
25 template <class Key, class T, class Compare = less<Key>>
26 using multimap = std::multimap<Key, T, Compare,
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Core/
HDUniqueCStringMap.h83 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in Find()
95 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in FindFirstValueForName()
124 m_map.begin(), m_map.end(), unique_cstr, Compare()))) in GetValues()
164 void Sort() { llvm::sort(m_map.begin(), m_map.end(), Compare()); } in Sort()
179 struct Compare { struct
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Serialization/
HDContinuousRangeMap.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()
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/
HDDeclaration.cpp69 int Declaration::Compare(const Declaration &a, const Declaration &b) { in Compare() function in Declaration
70 int result = FileSpec::Compare(a.m_file, b.m_file, true); in Compare()
87 int file_compare = FileSpec::Compare(this->m_file, declaration.m_file, true); in FileAndLineEqual()
HDLineEntry.cpp155 return LineEntry::Compare(a, b) < 0; in operator <()
158 int LineEntry::Compare(const LineEntry &a, const LineEntry &b) { in Compare() function in LineEntry
190 return FileSpec::Compare(a.file, b.file, true); in Compare()
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
HDValue.h671 template <class Compare> void sortUseList(Compare Cmp);
685 template <class Compare>
686 static Use *mergeUseLists(Use *L, Use *R, Compare Cmp) { in mergeUseLists()
746 template <class Compare> void Value::sortUseList(Compare Cmp) { in sortUseList()
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/
HDFileSpec.cpp250 return FileSpec::Compare(*this, rhs, true) < 0; in operator <()
274 int FileSpec::Compare(const FileSpec &a, const FileSpec &b, bool full) { in Compare() function in FileSpec
288 result = ConstString::Compare(a.m_directory, b.m_directory, case_sensitive); in Compare()
292 return ConstString::Compare(a.m_filename, b.m_filename, case_sensitive); in Compare()
/freebsd-11-stable/contrib/llvm-project/lldb/source/API/
HDSBDeclaration.cpp127 return lldb_private::Declaration::Compare(*lhs_ptr, *rhs_ptr) == 0; in operator ==()
140 return lldb_private::Declaration::Compare(*lhs_ptr, *rhs_ptr) != 0; in operator !=()
HDSBLineEntry.cpp142 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) == 0; in operator ==()
155 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) != 0; in operator !=()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
HDCalledValuePropagation.cpp65 struct Compare { struct in __anon7bface820111::CVPLatticeVal
76 Compare())); in CVPLatticeVal()
161 std::back_inserter(Union), CVPLatticeVal::Compare{}); in MergeValues()
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/
HDFunction.h76 static int Compare(const FunctionInfo &lhs, const FunctionInfo &rhs);
191 int Compare(const InlineFunctionInfo &lhs, const InlineFunctionInfo &rhs);
HDLineEntry.h98 static int Compare(const LineEntry &lhs, const LineEntry &rhs);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MC/
HDMCInstrDesc.h151 Compare, enumerator
339 bool isCompare() const { return Flags & (1ULL << MCID::Compare); } in isCompare()
/freebsd-11-stable/usr.bin/lastcomm/tests/
HDREADME9 4. Compare the reported values in VERSION-ARCH.out against the

12345678