Searched refs:compare (Results 1 - 25 of 241) sorted by relevance

12345678910

/freebsd-11-stable/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) argument
161 "r" (compare)
165 return (compare == set);
169 ck_pr_cas_64(uint64_t *target, uint64_t compare, uint64_t set) argument
175 "r" (compare)
178 return (compare == set);
182 ck_pr_cas_ptr(void *target, void *compare, void *set) argument
185 return ck_pr_cas_64(target, (uint64_t)compare, (uint64_t)set);
189 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *previous) argument
192 return ck_pr_cas_64_value(target, (uint64_t)compare, (uint64_
[all...]
/freebsd-11-stable/contrib/apr-util/include/
H A Dapr_strmatch.h44 /** Function called to compare */
45 const char *(*compare)(const apr_strmatch_pattern *this_pattern, member in struct:apr_strmatch_pattern
64 #define apr_strmatch(pattern, s, slen) (*((pattern)->compare))((pattern), (s), (slen))
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dstore-test.c48 compare(const char *name, krb5_storage *sp, void *expected, size_t len) function
80 nerr += compare("Integer", sp, "\x1\x2\x3\x4", 4);
85 nerr += compare("Integer (LE)", sp, "\x4\x3\x2\x1", 4);
90 nerr += compare("Integer (BE)", sp, "\x1\x2\x3\x4", 4);
102 nerr += compare("Integer (host)", sp, data, 4);
109 nerr += compare("Principal", sp, "\x0\x0\x0\x1"
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
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-11-stable/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr_lse.h37 ck_pr_cas_64_2_value(uint64_t target[2], uint64_t compare[2], uint64_t set[2], uint64_t value[2]) argument
41 register uint64_t x0 __asm__ ("x0") = compare[0];
42 register uint64_t x1 __asm__ ("x1") = compare[1];
51 : "r" (x2), "r" (x3), "r" (target), "r" (compare[0]), "r" (compare[1])
61 ck_pr_cas_ptr_2_value(void *target, void *compare, void *set, void *value) argument
64 CK_CPP_CAST(uint64_t *, compare),
70 ck_pr_cas_64_2(uint64_t target[2], uint64_t compare[2], uint64_t set[2]) argument
72 register uint64_t x0 __asm__ ("x0") = compare[0];
73 register uint64_t x1 __asm__ ("x1") = compare[
88 ck_pr_cas_ptr_2(void *target, void *compare, void *set) argument
[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]) argument
54 : "r" (target), "r" (compare[0]), "r" (compare[1]), "r" (set[0]), "r" (set[1])
61 ck_pr_cas_ptr_2_value(void *target, void *compare, void *set, void *value) argument
64 CK_CPP_CAST(uint64_t *, compare),
70 ck_pr_cas_64_2(uint64_t target[2], uint64_t compare[2], uint64_t set[2]) argument
86 : "r" (target), "r" (compare[0]), "r" (compare[1]), "r" (set[0]), "r" (set[1])
92 ck_pr_cas_ptr_2(void *target, void *compare, void *set) argument
95 CK_CPP_CAST(uint64_t *, compare),
[all...]
/freebsd-11-stable/contrib/groff/src/roff/troff/
H A Dmtsm.cpp42 void int_value::diff(FILE *fp, const char *s, int_value compare) argument
44 if (differs(compare)) {
48 fputs(i_to_a(compare.value), fp);
50 value = compare.value;
74 int int_value::differs(int_value compare) argument
76 return compare.is_known
77 && (!is_known || value != compare.value);
88 void bool_value::diff(FILE *fp, const char *s, bool_value compare) argument
90 if (differs(compare)) {
94 value = compare
109 diff(FILE *fp, const char *s, units_value compare) argument
130 differs(units_value compare) argument
145 diff(FILE *fp, const char *s, string_value compare) argument
169 differs(string_value compare) argument
199 flush(FILE *fp, statem *compare) argument
[all...]
/freebsd-11-stable/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) argument
167 "r" (compare)
171 return (previous == compare);
175 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *value) argument
189 "r" (compare)
193 return (previous == compare);
197 ck_pr_cas_64(uint64_t *target, uint64_t compare, uint64_t set) argument
211 "r" (compare)
214 return (previous == compare);
218 ck_pr_cas_ptr(void *target, void *compare, voi argument
[all...]
/freebsd-11-stable/libexec/bootpd/
H A Dhash.c196 hash_Exists(hashtable, hashcode, compare, key)
199 hash_cmpfp compare;
206 if ((*compare) (key, memberptr->data)) {
219 * to determine the bucket number, and "compare" and "key" to determine
228 hash_Insert(hashtable, hashcode, compare, key, element)
231 hash_cmpfp compare;
237 if (hash_Exists(hashtable, hashcode, compare, key)) {
260 hash_Delete(hashtable, hashcode, compare, key, free_data)
263 hash_cmpfp compare;
280 while (memberptr && (*compare) (ke
[all...]
/freebsd-11-stable/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) argument
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) argument
287 uint32_t *_compare = CK_CPP_CAST(uint32_t *, compare);
299 ck_pr_cas_ptr_value(void *target, void *compare, voi argument
320 ck_pr_cas_ptr(void *target, void *compare, void *set) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DFixedPoint.h172 int compare(const APFixedPoint &Other) const;
174 return compare(Other) == 0;
177 return compare(Other) != 0;
179 bool operator>(const APFixedPoint &Other) const { return compare(Other) > 0; }
180 bool operator<(const APFixedPoint &Other) const { return compare(Other) < 0; }
182 return compare(Other) >= 0;
185 return compare(Other) <= 0;
/freebsd-11-stable/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)(struc
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/
H A Dheap.c60 ! heap->compare(heap->array[(i)], \
71 isc_heapcompare_t compare; member in struct:isc_heap
76 isc_heap_create(isc_mem_t *mctx, isc_heapcompare_t compare, argument
83 REQUIRE(compare != NULL);
98 heap->compare = compare;
150 i > 1 && heap->compare(elt, heap->array[p]) ;
171 if (j < size && heap->compare(heap->array[j+1],
174 if (heap->compare(elt, heap->array[j]))
221 less = heap->compare(el
[all...]
/freebsd-11-stable/contrib/mtree/
H A DMakefile10 SRCS= compare.c crc.c create.c excludes.c misc.c mtree.c spec.c specspec.c \
/freebsd-11-stable/usr.sbin/fmtree/
H A DMakefile10 SRCS= compare.c crc.c create.c excludes.c misc.c mtree.c spec.c verify.c
H A Dextern.h35 int compare(char *, NODE *, FTSENT *);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineModuleInfoImpls.cpp31 return LHS->first->getName().compare(RHS->first->getName());
/freebsd-11-stable/sys/contrib/ck/include/gcc/
H A Dck_pr.h154 * Atomic compare and swap.
158 ck_pr_cas_##S(M *target, T compare, T set) \
161 z = __sync_bool_compare_and_swap((T *)target, compare, set); \
184 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *v) argument
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-11-stable/contrib/apr-util/strmatch/
H A Dapr_strmatch.c94 pattern->compare = match_no_op;
104 pattern->compare = match_boyer_moore_horspool;
110 pattern->compare = match_boyer_moore_horspool_nocase;
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/
H A Dheap.h55 isc_heap_create(isc_mem_t *mctx, isc_heapcompare_t compare,
65 *\li "compare" is a function which takes two void * arguments and
/freebsd-11-stable/lib/libc/mips/string/
H A Dbcmp.S59 xor v0, a0, a1 # compare low two bits of addresses
78 lw v0, 0(a0) # compare words
92 lbu v0, 0(a0) # compare bytes until a1 word aligned
104 LWHI v0, 0(a0) # compare words a0 unaligned, a1 aligned
H A Dstrcmp.S52 lbu t0, 0(a0) # get two bytes and compare them
/freebsd-11-stable/tools/tools/zfsboottest/
H A DMakefile18 -W -Wextra -Wno-sign-compare -Wno-unused-parameter
/freebsd-11-stable/usr.sbin/nmtree/
H A DMakefile9 SRCS= compare.c crc.c create.c excludes.c getid.c misc.c mtree.c \
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DAtomic.cpp57 # error No compare-and-swap implementation for your platform!

Completed in 136 milliseconds

12345678910