Home
last modified time | relevance | path

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

123456789

/freebsd/contrib/llvm-project/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,
169 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
171 if (Compare.isCompare()) in getCompareSourceReg()
172 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
[all …]
/freebsd/contrib/llvm-project/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.h264 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
270 template <class Compare> void sort(Compare comp); in merge()
275 template <class Compare> in merge()
276 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
297 template <class Compare> in sort()
298 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;
/freebsd/contrib/llvm-project/libcxx/include/
H A Dset20 template <class Key, class Compare = less<Key>,
28 typedef Compare key_compare;
60 …set(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
74 : set(first, last, Compare(), a) {} // C++14
77 : set(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
79 : set(il, Compare(), a) {} // C++14
194 class Compare = less<typename iterator_traits<InputIterator>::value_type>,
197 Compare = Compare(), Allocator = Allocator())
198 -> set<typename iterator_traits<InputIterator>::value_type, Compare, Allocator>; // C++17
200 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>,
[all …]
H A Dqueue128 class Compare = less<typename Container::value_type>>
140 Compare comp;
143 priority_queue() : priority_queue(Compare()) {} // C++20
144 explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
145 priority_queue(const Compare& x, const Container&);
146 … explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
147 priority_queue(const Compare& x, Container&&); // C++20
150 const Compare& comp = Compare());
153 const Compare& comp, const Container& c);
156 const Compare& comp, Container&& c);
[all …]
H A Dmap20 template <class Key, class T, class Compare = less<Key>,
29 typedef Compare key_compare;
74 …map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
87 : map(first, last, Compare(), a) {} // C++14
90 : map(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
92 : map(il, Compare(), a) {} // C++14
234 class Compare = less<iter_key_t<InputIterator>>,
236 map(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
237 -> map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Compare, Allocator>; // C++17
239 template<ranges::input_range R, class Compare = less<range-key-type<R>,
[all …]
H A Dalgorithm1503 template <class ForwardIterator, class Compare>
1505 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1511 template <class ForwardIterator, class Compare>
1513 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1519 template <class RandomAccessIterator, class Compare>
1521 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1527 template <class RandomAccessIterator, class Compare>
1529 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1535 template <class RandomAccessIterator, class Compare>
1537 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
[all …]
/freebsd/contrib/one-true-awk/testdir/
H A DREGRESS11 oldawk=$oldawk awk=$awk Compare.t t.*
14 oldawk=$oldawk awk=$awk Compare.p p.? p.??*
17 oldawk=$oldawk awk=$awk Compare.T1
20 oldawk=$oldawk awk=$awk Compare.tt tt.*
H A DREADME.TESTS5 - Several shell files called Compare* that control sub-parts
37 ways, against a large input file constructed by Compare.tt.
/freebsd/sys/contrib/dev/acpica/components/executer/
H A Dexmisc.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/contrib/ncurses/form/
H A Dfty_enum.c236 Compare(const unsigned char *s, const unsigned char *buf, in Compare() function
301 if ((res = Compare((unsigned char *)s, bp, ccase)) != NOMATCH) in Check_Enum_Field()
308 if ((res = Compare((unsigned char *)p, bp, ccase)) != NOMATCH) in Check_Enum_Field()
358 if (Compare((unsigned char *)(*kwds++), bp, ccase) == EXACT) in Next_Enum()
363 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Next_Enum()
396 if (Compare((unsigned char *)(*kwds--), bp, ccase) == EXACT) in Previous_Enum()
403 if ((cnt >= 0) || (Compare((const unsigned char *)dummy, bp, ccase) == EXACT)) in Previous_Enum()
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dset
H A Dmap
/freebsd/contrib/llvm-project/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
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/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.cpp39 return SourceLocationSpec::Compare(*this, rhs) < 0; in operator <()
47 int SourceLocationSpec::Compare(const SourceLocationSpec &lhs, in Compare() function in SourceLocationSpec
49 return Declaration::Compare(lhs.m_declaration, rhs.m_declaration); in Compare()
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DLineEntry.cpp144 return LineEntry::Compare(a, b) < 0; in operator <()
147 int LineEntry::Compare(const LineEntry &a, const LineEntry &b) { in Compare() function in LineEntry
179 return FileSpec::Compare(a.GetFile(), b.GetFile(), true); in Compare()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopFlatten.cpp434 ICmpInst *Compare = L->getLatchCmpInst(); in findLoopComponents() local
435 if (!Compare || !IsValidPredicate(Compare->getUnsignedPredicate()) || in findLoopComponents()
436 Compare->hasNUsesOrMore(2)) { in findLoopComponents()
443 IterationInstructions.insert(Compare); in findLoopComponents()
444 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump()); in findLoopComponents()
452 if ((Compare->getOperand(0) != Increment || !Increment->hasNUses(2)) && in findLoopComponents()
462 Value *RHS = Compare->getOperand(1); in findLoopComponents()
H A DIndVarSimplify.cpp241 FCmpInst *Compare = dyn_cast<FCmpInst>(U1); in handleFloatingPointIV() local
242 if (!Compare) in handleFloatingPointIV()
243 Compare = dyn_cast<FCmpInst>(U2); in handleFloatingPointIV()
244 if (!Compare || !Compare->hasOneUse() || in handleFloatingPointIV()
245 !isa<BranchInst>(Compare->user_back())) in handleFloatingPointIV()
248 BranchInst *TheBr = cast<BranchInst>(Compare->user_back()); in handleFloatingPointIV()
262 ConstantFP *ExitValueVal = dyn_cast<ConstantFP>(Compare->getOperand(1)); in handleFloatingPointIV()
270 switch (Compare->getPredicate()) { in handleFloatingPointIV()
372 ConstantInt::get(Int32Ty, ExitValue), Compare->getName()); in handleFloatingPointIV()
373 NewCompare->setDebugLoc(Compare->getDebugLoc()); in handleFloatingPointIV()
[all …]
/freebsd/contrib/llvm-project/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.cpp150 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) == 0; in operator ==()
162 return lldb_private::LineEntry::Compare(*lhs_ptr, *rhs_ptr) != 0; in operator !=()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DValue.h823 template <class Compare> void sortUseList(Compare Cmp);
837 template <class Compare> in mergeUseLists()
838 static Use *mergeUseLists(Use *L, Use *R, Compare Cmp) { in mergeUseLists()
898 template <class Compare> void Value::sortUseList(Compare Cmp) { in sortUseList()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/LogicalView/Core/
H A DLVOptions.h82 STDSET_FUNCTION_4(Compare, FIELD, LVCompareKind, Elements)
315 LVCompare Compare; variable
371 BOOL_FUNCTION(Compare, Context);
372 BOOL_FUNCTION(Compare, Execute);
373 BOOL_FUNCTION(Compare, Print);

123456789