Home
last modified time | relevance | path

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

123456789

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp171 if (Compare.isCompare()) in getCompareSourceReg()
173 else if (isLoadAndTestAsCmp(Compare)) in getCompareSourceReg()
295 if (!Compare.mayRaiseFPException()) in convertToLoadAndTest()
478 if (MBBI == Compare) { in adjustCCMasksForInstr()
495 if (isLoadAndTestAsCmp(Compare)) in isCompareZero()
498 Compare.getOperand(1).isImm() && Compare.getOperand(1).getImm() == 0; in isCompareZero()
507 if (!isCompareZero(Compare)) in optimizeCompareZero()
606 TII->getFusedCompare(Compare.getOpcode(), Type, &Compare); in fuseCompareOperations()
616 Compare.getOperand(1).isReg() ? Compare.getOperand(1).getReg() : Register(); in fuseCompareOperations()
658 MIB.add(Compare.getOperand(I)); in fuseCompareOperations()
[all …]
/freebsd-14.2/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);
275 template <class Compare>
276 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
297 template <class Compare>
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-14.2/contrib/llvm-project/libcxx/include/
H A Dset20 template <class Key, class Compare = less<Key>,
60 …set(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
197 Compare = Compare(), Allocator = Allocator())
202 set(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
206 set(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
258 swap(set<Key, Compare, Allocator>& x, set<Key, Compare, Allocator>& y)
305 const Compare& comp = Compare(), const Allocator& = Allocator()); // C++23
443 Compare = Compare(), Allocator = Allocator())
448 multiset(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
452 multiset(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
[all …]
H A Dqueue140 Compare comp;
146 … explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
150 const Compare& comp = Compare());
158 priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); // since C++23
206 template <class Compare, class Container>
207 priority_queue(Compare, Container)
213 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
217 priority_queue(from_range_t, R&&, Compare = Compare())
221 priority_queue(Compare, Container, Allocator)
242 Compare>; // C++23
[all …]
H A Dmap74 …map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
92 : map(il, Compare(), a) {} // C++14
236 map(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
241 map(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
246 map(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
247 -> map<Key, T, Compare, Allocator>; // C++17
299 swap(map<Key, T, Compare, Allocator>& x, map<Key, T, Compare, Allocator>& y)
359 const Compare& comp = Compare(), const Allocator& = Allocator()); // C++23
498 multimap(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
503 multimap(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
[all …]
H A Dalgorithm1677 template <class T, class Compare>
1679 min(const T& a, const T& b, Compare comp);
1685 template<class T, class Compare>
1687 min(initializer_list<T> t, Compare comp);
1692 template<class T, class Compare>
1707 template <class T, class Compare>
1709 max(const T& a, const T& b, Compare comp);
1715 template<class T, class Compare>
1717 max(initializer_list<T> t, Compare comp);
1731 template<class T, class Compare>
[all …]
/freebsd-14.2/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-14.2/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-14.2/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-14.2/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-14.2/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-14.2/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-14.2/sys/contrib/device-tree/Bindings/soc/qcom/
H A Dqcom,dcc.yaml7 title: Data Capture and Compare
13 DCC (Data Capture and Compare) is a DMA engine which is used to save
/freebsd-14.2/contrib/llvm-project/lldb/source/Symbol/
H A DLineEntry.cpp141 return LineEntry::Compare(a, b) < 0; in operator <()
144 int LineEntry::Compare(const LineEntry &a, const LineEntry &b) { in Compare() function in LineEntry
176 return FileSpec::Compare(a.file, b.file, true); in Compare()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopFlatten.cpp427 ICmpInst *Compare = L->getLatchCmpInst(); in findLoopComponents() local
428 if (!Compare || !IsValidPredicate(Compare->getUnsignedPredicate()) || in findLoopComponents()
429 Compare->hasNUsesOrMore(2)) { in findLoopComponents()
436 IterationInstructions.insert(Compare); in findLoopComponents()
437 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump()); in findLoopComponents()
445 if ((Compare->getOperand(0) != Increment || !Increment->hasNUses(2)) && in findLoopComponents()
455 Value *RHS = Compare->getOperand(1); in findLoopComponents()
H A DIndVarSimplify.cpp236 FCmpInst *Compare = dyn_cast<FCmpInst>(U1); in handleFloatingPointIV() local
237 if (!Compare) in handleFloatingPointIV()
238 Compare = dyn_cast<FCmpInst>(U2); in handleFloatingPointIV()
239 if (!Compare || !Compare->hasOneUse() || in handleFloatingPointIV()
240 !isa<BranchInst>(Compare->user_back())) in handleFloatingPointIV()
243 BranchInst *TheBr = cast<BranchInst>(Compare->user_back()); in handleFloatingPointIV()
265 switch (Compare->getPredicate()) { in handleFloatingPointIV()
364 Compare->getName()); in handleFloatingPointIV()
372 NewCompare->takeName(Compare); in handleFloatingPointIV()
373 Compare->replaceAllUsesWith(NewCompare); in handleFloatingPointIV()
[all …]
/freebsd-14.2/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.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 !=()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DValue.h823 template <class Compare> void sortUseList(Compare Cmp);
837 template <class Compare>
838 static Use *mergeUseLists(Use *L, Use *R, Compare Cmp) { in mergeUseLists()
898 template <class Compare> void Value::sortUseList(Compare Cmp) { in sortUseList()
/freebsd-14.2/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);
/freebsd-14.2/contrib/llvm-project/clang/lib/AST/Interp/
H A DPrimitives.h25 template <typename T> ComparisonCategoryResult Compare(const T &X, const T &Y) { in Compare() function

123456789