Home
last modified time | relevance | path

Searched full:compare (Results 1 – 25 of 2057) sorted by relevance

12345678910>>...83

/freebsd/contrib/netbsd-tests/lib/libcurses/tests/
H A Dclear4 compare clear1.chk
11 compare clear2.chk
14 compare clear3.chk
17 compare clear4.chk
19 compare fill.chk
22 compare clear5.chk
29 compare clear6.chk
32 compare clear7.chk
35 compare fill.chk
39 compare clear8.chk
[all …]
H A Dcopywin6 compare copywin1.chk
14 compare copywin2.chk
17 compare copywin3.chk
22 compare copywin4.chk
30 compare copywin5.chk
33 compare copywin6.chk
38 compare copywin7.chk
46 compare copywin8.chk
54 compare copywin9.chk
57 compare copywin10.chk
[all …]
H A Dassume_default_colors5 compare color_start.chk
7 compare color_default.chk
11 compare color_blue_back.chk
15 compare color_red_fore.chk
19 compare color_default.chk
H A Dbackground5 compare background1.chk
8 compare background2.chk
14 compare background3.chk
18 compare background4.chk
22 compare background5.chk
H A Dmvwin5 compare /dev/zero
7 compare /dev/zero
10 compare /dev/zero
12 compare /dev/zero
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp11 // (2) fuses compares and branches into COMPARE AND BRANCH instructions
36 #define DEBUG_TYPE "systemz-elim-compare"
41 STATISTIC(FusedComparisons, "Number of fused compare-and-branch instructions");
82 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,
[all …]
/freebsd/sys/contrib/device-tree/Bindings/timer/
H A Drenesas,rz-mtu3.yaml22 - Waveform output on compare match
27 - Simultaneous clearing on compare match or input capture
122 - description: MTU0.TGRA input capture/compare match
123 - description: MTU0.TGRB input capture/compare match
124 - description: MTU0.TGRC input capture/compare match
125 - description: MTU0.TGRD input capture/compare match
127 - description: MTU0.TGRE compare match
128 - description: MTU0.TGRF compare match
129 - description: MTU1.TGRA input capture/compare match
130 - description: MTU1.TGRB input capture/compare matc
[all...]
/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 Dstring_view19 #include <compare>
133 constexpr int compare(basic_string_view s) const noexcept;
134 constexpr int compare(size_type pos1, size_type n1, basic_string_view s) const;
135 constexpr int compare(size_type pos1, size_type n1,
137 constexpr int compare(const charT* s) const;
138 constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
139 constexpr int compare(size_type pos1, size_type n1,
251 #include <compare>
455 _LIBCPP_CONSTEXPR_SINCE_CXX14 int compare(basic_string_view __sv) const _NOEXCEPT {
457 int __retval = _Traits::compare(data(), __sv.data(), __rlen);
[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/sys/contrib/ck/include/gcc/sparcv9/
H A Dck_pr.h155 ck_pr_cas_64_value(uint64_t *target, uint64_t compare, uint64_t set, uint64_t *value) in ck_pr_cas_64_value() argument
161 "r" (compare) in ck_pr_cas_64_value()
165 return (compare == set); in ck_pr_cas_64_value()
169 ck_pr_cas_64(uint64_t *target, uint64_t compare, uint64_t set) in ck_pr_cas_64() argument
175 "r" (compare) in ck_pr_cas_64()
178 return (compare == set); in ck_pr_cas_64()
182 ck_pr_cas_ptr(void *target, void *compare, void *set) in ck_pr_cas_ptr() argument
185 return ck_pr_cas_64(target, (uint64_t)compare, (uint64_t)set); in ck_pr_cas_ptr()
189 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *previous) in ck_pr_cas_ptr_value() argument
192 return ck_pr_cas_64_value(target, (uint64_t)compare, (uint64_t)set, previous); in ck_pr_cas_ptr_value()
[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)
/freebsd/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr_lse.h38 ck_pr_cas_64_2_value(uint64_t target[2], uint64_t compare[2], uint64_t set[2], uint64_t value[2]) in ck_pr_cas_64_2_value()
42 register uint64_t x0 __asm__ ("x0") = compare[0]; in ck_pr_cas_64_2_value()
43 register uint64_t x1 __asm__ ("x1") = compare[1]; in ck_pr_cas_64_2_value()
52 : "r" (x2), "r" (x3), "r" (target), "r" (compare[0]), "r" (compare[1]) in ck_pr_cas_64_2_value()
62 ck_pr_cas_ptr_2_value(void *target, void *compare, void *set, void *value) in ck_pr_cas_ptr_2_value() argument
65 CK_CPP_CAST(uint64_t *, compare), in ck_pr_cas_ptr_2_value()
71 ck_pr_cas_64_2(uint64_t target[2], uint64_t compare[2], uint64_t set[2]) in ck_pr_cas_64_2()
73 register uint64_t x0 __asm__ ("x0") = compare[0]; in ck_pr_cas_64_2()
74 register uint64_t x1 __asm__ ("x1") = compare[1]; in ck_pr_cas_64_2()
83 : "r" (x2), "r" (x3), "r" (target), "r" (compare[0]), "r" (compare[1]) in ck_pr_cas_64_2()
[all …]
H A Dck_pr_llsc.h36 ck_pr_cas_64_2_value(uint64_t target[2], uint64_t compare[2], uint64_t set[2], uint64_t value[2]) in ck_pr_cas_64_2_value()
54 … : "r" (target), "r" (compare[0]), "r" (compare[1]), "r" (set[0]), "r" (set[1]) in ck_pr_cas_64_2_value()
61 ck_pr_cas_ptr_2_value(void *target, void *compare, void *set, void *value) in ck_pr_cas_ptr_2_value() argument
64 CK_CPP_CAST(uint64_t *, compare), in ck_pr_cas_ptr_2_value()
70 ck_pr_cas_64_2(uint64_t target[2], uint64_t compare[2], uint64_t set[2]) in ck_pr_cas_64_2()
86 … : "r" (target), "r" (compare[0]), "r" (compare[1]), "r" (set[0]), "r" (set[1]) in ck_pr_cas_64_2()
92 ck_pr_cas_ptr_2(void *target, void *compare, void *set) in ck_pr_cas_ptr_2() argument
95 CK_CPP_CAST(uint64_t *, compare), in ck_pr_cas_ptr_2()
102 ck_pr_cas_##N##_value(M *target, T compare, T set, M *value) \
117 "r" (compare) \
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_win_defs.h95 // WIN_WEAK_EXPORT_DEF(bool, compare, int a, int b) { return a > b; }
104 // WIN_WEAK_IMPORT_DEF(compare)
115 // WIN_WEAK_EXPORT_DEF(bool, compare, int a, int b) { return a > b; }
119 // compare(1, 2);
121 // extern "C" bool compare (int a, int b) { return a >= b; }
132 // WIN_WEAK_EXPORT_DEF(bool, compare, int a, int b) { return a > b; }
135 // WIN_WEAK_IMPORT_DEF(compare)
137 // compare(1, 2);
139 // extern "C" bool compare (int a, int b) { return a >= b; }
146 // WIN_WEAK_EXPORT_DEF(bool, compare, int a, int b) { return a > b; }
[all …]
/freebsd/sys/contrib/ck/include/gcc/ppc64/
H A Dck_pr.h153 ck_pr_cas_64_value(uint64_t *target, uint64_t compare, uint64_t set, uint64_t *value) in ck_pr_cas_64_value() argument
167 "r" (compare) in ck_pr_cas_64_value()
171 return (previous == compare); in ck_pr_cas_64_value()
175 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *value) in ck_pr_cas_ptr_value() argument
189 "r" (compare) in ck_pr_cas_ptr_value()
193 return (previous == compare); in ck_pr_cas_ptr_value()
197 ck_pr_cas_64(uint64_t *target, uint64_t compare, uint64_t set) in ck_pr_cas_64() argument
211 "r" (compare) in ck_pr_cas_64()
214 return (previous == compare); in ck_pr_cas_64()
218 ck_pr_cas_ptr(void *target, void *compare, void *set) in ck_pr_cas_ptr() argument
[all …]
/freebsd/sys/contrib/ck/include/gcc/arm/
H A Dck_pr.h212 ck_pr_cas_##N##_value(T *target, T compare, T set, T *value) \
226 : "r" (compare), "r" (set) , \
230 return (*value == compare); \
241 ck_pr_cas_ptr_2_value(void *target, void *compare, void *set, void *value)
243 uint32_t *_compare = CK_CPP_CAST(uint32_t *, compare);
256 ck_pr_cas_##N(T *target, T compare, T set) \
272 : "r" (compare), "r" (set) , \
285 ck_pr_cas_ptr_2(void *target, void *compare, void *set) in CK_PR_DOUBLE_CAS()
287 uint32_t *_compare = CK_CPP_CAST(uint32_t *, compare); in CK_PR_DOUBLE_CAS()
299 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *value) in ck_pr_cas_ptr_value() argument
[all …]
/freebsd/contrib/libucl/src/
H A Dtree.h122 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
126 if (compare(elm, self) < 0) \
127 self->field.avl_left= TREE_INSERT_##node##_##field(self->field.avl_left, elm, compare); \
129 self->field.avl_right= TREE_INSERT_##node##_##field(self->field.avl_right, elm, compare); \
134 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
138 if (compare(elm, self) == 0) \
140 if (compare(elm, self) < 0) \
141 return TREE_FIND_##node##_##field(self->field.avl_left, elm, compare); \
143 return TREE_FIND_##node##_##field(self->field.avl_right, elm, compare); \
155 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h28 // represent mutex expressions directly, since there is no easy way to compare
293 // template <class C> typename C::CType compare(CType* E, C& Cmp) {
294 // compare all subexpressions, following the comparator interface
413 typename C::CType compare(const Variable* E, C& Cmp) const { in compare() function
473 typename C::CType compare(const Future* E, C& Cmp) const { in compare() function
476 return Cmp.compare(Result, E->Result); in compare()
504 typename C::CType compare(const Undefined* E, C& Cmp) const { in compare() function
525 typename C::CType compare(const Wildcard* E, C& Cmp) const { in compare() function
557 typename C::CType compare(const Literal* E, C& Cmp) const { in compare() function
660 typename C::CType compare(const LiteralPtr* E, C& Cmp) const { in compare() function
[all …]
/freebsd/sys/contrib/ck/include/gcc/
H A Dck_pr.h154 * Atomic compare and swap. in CK_PR_FENCE()
158 ck_pr_cas_##S(M *target, T compare, T set) \ in CK_PR_FENCE()
161 z = __sync_bool_compare_and_swap((T *)target, compare, set); \ in CK_PR_FENCE()
181 * Compare and swap, set *v to old value of target.
184 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *v)
186 set = __sync_val_compare_and_swap((void **)target, compare, set);
188 return (set == compare);
193 ck_pr_cas_##S##_value(T *target, T compare, T set, T *v) \
195 set = __sync_val_compare_and_swap(target, compare, set);\
197 return (set == compare); \
/freebsd/sys/contrib/ck/include/gcc/x86_64/
H A Dck_pr.h411 * Atomic compare and swap, with a variant that sets *v to the old value of target.
416 ck_pr_cas_##S(M *target, T compare, T set) \
423 "+a" (compare) \
430 ck_pr_cas_##S##_value(M *target, T compare, T set, M *v) \
436 "+a" (compare) \
439 *(T *)v = compare; \
445 ck_pr_cas_##S(M *target, T compare, T set) \
452 "a" (compare) \
458 ck_pr_cas_##S##_value(M *target, T compare, T set, M *v) \
465 "+a" (compare) \
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonNewValueJump.cpp16 // The basic approach looks for sequence of predicated jump, compare instruciton
18 // all, it collapses compare and jump instruction into a new value jump
163 // skipping compare, cmpInst. in INITIALIZE_PASS_DEPENDENCY()
197 // 1. compare instruction can be moved before jump.
198 // 2. feeder to the compare instruction can be moved before jump.
219 // COPY can remateriaze things in between feeder, compare and nvj. in commonChecksToProhibitNewValueJump()
247 // If the second operand of the compare is an imm, make sure it's in the in canCompareBeNewValueJump()
285 // value compare. Only one operand may use the .new suffix. in canCompareBeNewValueJump()
300 // Walk the instructions after the compare (predicate def) to the jump, in canCompareBeNewValueJump()
313 // If there is a def or use of predicate (result of compare), bail out. in canCompareBeNewValueJump()
[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.*

12345678910>>...83