Home
last modified time | relevance | path

Searched refs:compare (Results 1 – 25 of 495) sorted by relevance

12345678910>>...20

/freebsd-13.1/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
H A Dcurs_set3 compare curs_set1.chk
5 compare curs_set2.chk
7 compare curs_set3.chk
H A Dchgat6 compare chgat1.chk
9 compare chgat2.chk
14 compare chgat3.chk
/freebsd-13.1/sys/contrib/ck/include/gcc/sparcv9/
H A Dck_pr.h161 "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
202 "r" (compare) \
205 return (compare == set); \
208 ck_pr_cas_##N(T *target, T compare, T set) \
213 "r" (compare) \
[all …]
/freebsd-13.1/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr_lse.h41 register uint64_t x0 __asm__ ("x0") = compare[0]; in ck_pr_cas_64_2_value()
42 register uint64_t x1 __asm__ ("x1") = compare[1]; in ck_pr_cas_64_2_value()
51 : "r" (x2), "r" (x3), "r" (target), "r" (compare[0]), "r" (compare[1]) in ck_pr_cas_64_2_value()
72 register uint64_t x0 __asm__ ("x0") = compare[0]; in ck_pr_cas_64_2()
73 register uint64_t x1 __asm__ ("x1") = compare[1]; in ck_pr_cas_64_2()
82 : "r" (x2), "r" (x3), "r" (target), "r" (compare[0]), "r" (compare[1]) in ck_pr_cas_64_2()
88 ck_pr_cas_ptr_2(void *target, void *compare, void *set) in ck_pr_cas_ptr_2() argument
100 *(T *)value = compare; \
110 ck_pr_cas_##N(M *target, T compare, T set) \
112 T previous = compare; \
[all …]
H A Dck_pr_llsc.h54 … : "r" (target), "r" (compare[0]), "r" (compare[1]), "r" (set[0]), "r" (set[1]) in ck_pr_cas_64_2_value()
64 CK_CPP_CAST(uint64_t *, compare), in ck_pr_cas_ptr_2_value()
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) \
120 return (previous == compare); \
123 ck_pr_cas_##N(M *target, T compare, T set) \
139 "r" (compare) \
[all …]
/freebsd-13.1/sys/contrib/ck/include/gcc/ppc64/
H A Dck_pr.h167 "r" (compare) in ck_pr_cas_64_value()
171 return (previous == compare); in ck_pr_cas_64_value()
189 "r" (compare) in ck_pr_cas_ptr_value()
193 return (previous == compare); in ck_pr_cas_ptr_value()
214 return (previous == compare); in ck_pr_cas_64()
235 return (previous == compare); in ck_pr_cas_ptr()
253 "r" (compare) \
256 return (previous == compare); \
259 ck_pr_cas_##N(T *target, T compare, T set) \
272 "r" (compare) \
[all …]
/freebsd-13.1/libexec/bootpd/
H A Dhash.c185 hash_Exists(hashtable, hashcode, compare, key) in hash_Exists() argument
188 hash_cmpfp compare;
195 if ((*compare) (key, memberptr->data)) {
216 hash_Insert(hashtable, hashcode, compare, key, element) in hash_Insert() argument
219 hash_cmpfp compare;
225 if (hash_Exists(hashtable, hashcode, compare, key)) {
250 hash_cmpfp compare;
286 if ((*compare) (key, memberptr->data)) {
313 hash_Lookup(hashtable, hashcode, compare, key) in hash_Lookup() argument
316 hash_cmpfp compare;
[all …]
/freebsd-13.1/sys/contrib/ck/include/gcc/arm/
H A Dck_pr.h226 : "r" (compare), "r" (set) , \
230 return (*value == compare); \
272 : "r" (compare), "r" (set) , \
313 "r" (compare) in ck_pr_cas_ptr_value()
316 return (previous == compare); in ck_pr_cas_ptr_value()
334 "r" (compare) in ck_pr_cas_ptr()
336 return (previous == compare); in ck_pr_cas_ptr()
359 "r" (compare) \
362 return (previous == compare); \
379 "r" (compare) \
[all …]
/freebsd-13.1/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); \
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)) \
159 if (compare(elm, self) == 0) \
[all …]
/freebsd-13.1/crypto/heimdal/lib/krb5/
H A Dstore-test.c48 compare(const char *name, krb5_storage *sp, void *expected, size_t len) in compare() function
80 nerr += compare("Integer", sp, "\x1\x2\x3\x4", 4); in main()
85 nerr += compare("Integer (LE)", sp, "\x4\x3\x2\x1", 4); in main()
90 nerr += compare("Integer (BE)", sp, "\x1\x2\x3\x4", 4); in main()
102 nerr += compare("Integer (host)", sp, data, 4); in main()
109 nerr += compare("Principal", sp, "\x0\x0\x0\x1" in main()
/freebsd-13.1/contrib/ntp/lib/isc/
H A Dheap.c60 ! heap->compare(heap->array[(i)], \
71 isc_heapcompare_t compare; member
76 isc_heap_create(isc_mem_t *mctx, isc_heapcompare_t compare, in isc_heap_create() argument
83 REQUIRE(compare != NULL); in isc_heap_create()
98 heap->compare = compare; in isc_heap_create()
150 i > 1 && heap->compare(elt, heap->array[p]) ; in float_up()
171 if (j < size && heap->compare(heap->array[j+1], in sink_down()
174 if (heap->compare(elt, heap->array[j])) in sink_down()
221 less = heap->compare(elt, heap->array[index]); in isc_heap_delete()
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h476 return Cmp.compare(Result, E->Result); in compare()
702 Ct = Cmp.compare(body(), E->body()); in compare()
791 return Cmp.compare(body(), E->body()); in compare()
826 return Cmp.compare(body(), E->body()); in compare()
865 return Cmp.compare(arg(), E->arg()); in compare()
903 return Cmp.compare(arg(), E->arg()); in compare()
1195 return Cmp.compare(expr(), E->expr()); in compare()
1241 Ct = Cmp.compare(expr0(), E->expr0()); in compare()
1281 return Cmp.compare(expr(), E->expr()); in compare()
1479 return Cmp.compare(Retval, E->Retval); in compare()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPFixedPoint.h183 int compare(const APFixedPoint &Other) const;
185 return compare(Other) == 0;
188 return compare(Other) != 0;
190 bool operator>(const APFixedPoint &Other) const { return compare(Other) > 0; }
191 bool operator<(const APFixedPoint &Other) const { return compare(Other) < 0; }
193 return compare(Other) >= 0;
196 return compare(Other) <= 0;
H A DPriorityQueue.h29 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)
/freebsd-13.1/sys/contrib/ck/include/gcc/
H A Dck_pr.h158 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()
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-13.1/contrib/llvm-project/libcxx/include/
H A Dstring_view194 #include <compare>
681 return __lhs.compare(__rhs) == 0;
690 return __lhs.compare(__rhs) == 0;
699 return __lhs.compare(__rhs) == 0;
710 return __lhs.compare(__rhs) != 0;
739 return __lhs.compare(__rhs) < 0;
747 return __lhs.compare(__rhs) < 0;
755 return __lhs.compare(__rhs) < 0;
764 return __lhs.compare(__rhs) > 0;
772 return __lhs.compare(__rhs) > 0;
[all …]
/freebsd-13.1/stand/ficl/softwords/
H A Difbrack.fr10 2dup s" [if]" compare-insensitive 0=
14 2dup s" [else]" compare-insensitive 0=
18 2dup s" [then]" compare-insensitive 0= >r
19 2dup s" [endif]" compare-insensitive 0= r>
/freebsd-13.1/usr.bin/look/
H A Dlook.c86 static int compare(wchar_t *, unsigned char *, unsigned char *);
266 if (compare(string, p, back) == GREATER) in binary_search()
291 switch (compare(string, front, back)) { in linear_search()
310 for (; front < back && compare(string, front, back) == EQUAL; ++front) { in print_from()
333 compare(wchar_t *s1, unsigned char *s2, unsigned char *back) in compare() function
/freebsd-13.1/crypto/openssl/include/openssl/
H A Dsafestack.h35 static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_new(sk_##t1##_compfunc compare) \
37 return (STACK_OF(t1) *)OPENSSL_sk_new((OPENSSL_sk_compfunc)compare); \
43 …static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_new_reserve(sk_##t1##_compfunc compare, int…
45 return (STACK_OF(t1) *)OPENSSL_sk_new_reserve((OPENSSL_sk_compfunc)compare, n); \
124 …sl_inline sk_##t1##_compfunc sk_##t1##_set_cmp_func(STACK_OF(t1) *sk, sk_##t1##_compfunc compare) \
126 …n (sk_##t1##_compfunc)OPENSSL_sk_set_cmp_func((OPENSSL_STACK *)sk, (OPENSSL_sk_compfunc)compare); \
/freebsd-13.1/sys/contrib/ck/include/gcc/ppc/
H A Dck_pr.h151 ck_pr_cas_##N##_value(M *target, T compare, T set, M *value) \
164 "r" (compare) \
167 return (previous == compare); \
170 ck_pr_cas_##N(M *target, T compare, T set) \
183 "r" (compare) \
185 return (previous == compare); \

12345678910>>...20