/kernel/linux/linux-6.6/block/ |
H A D | early-lookup.c | 24 const struct uuidcmp *cmp = data; in match_dev_by_uuid() local 48 struct uuidcmp cmp; in devt_from_partuuid() local
|
/kernel/linux/linux-6.6/drivers/infiniband/sw/rxe/ |
H A D | rxe_mcast.c | 69 int cmp; in __rxe_insert_mcg() local 111 int cmp; in __rxe_lookup_mcg() local
|
/kernel/linux/linux-6.6/drivers/md/ |
H A D | dm-cache-background-tracker.c | 91 int cmp; in __insert_pending() local 120 int cmp; in __find_pending() local
|
/kernel/linux/linux-6.6/net/ipv4/ |
H A D | inetpeer.c | 105 int cmp; in lookup() local
|
/third_party/eudev/src/libudev/ |
H A D | libudev-list.c | 128 int cmp; in list_search() local
|
/third_party/alsa-utils/alsamixer/ |
H A D | curskey.c | 52 int cmp; in curskey_find() local
|
/third_party/icu/icu4c/source/common/ |
H A D | uarrsort.cpp | 75 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, UComparator *cmp, const void *context) uprv_stableBinarySearch() argument 119 doInsertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, void *pv) doInsertionSort() argument 141 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) insertionSort() argument 169 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) subQuickSort() argument 235 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) quickSort() argument 256 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) uprv_sortArray() argument [all...] |
/third_party/FreeBSD/lib/libc/stdlib/ |
H A D | qsort.c | 134 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk in med3() argument 155 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk) in local_qsort() argument 260 qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) qsort_r() argument 266 qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk) qsort_s() argument 292 qsort(void *a, size_t n, size_t es, cmp_t *cmp) qsort() argument [all...] |
/third_party/mesa3d/src/compiler/nir/ |
H A D | nir_lower_multiview.c | 300 nir_ssa_def *cmp = nir_ige(&b, loop_index, nir_imm_int(&b, view_count)); in nir_lower_multiview() local
|
H A D | nir_lower_tex_shadow.c | 104 nir_ssa_def *cmp = tex->src[comp_index].src.ssa; in nir_lower_tex_shadow_impl() local
|
H A D | nir_opt_comparison_pre.c | 164 nir_ssa_def *const cmp = zero_on_left in rewrite_compare_instruction() local 251 nir_alu_instr *const cmp = *a; in comparison_pre_block() local [all...] |
/third_party/node/deps/v8/src/zone/ |
H A D | zone-list-inl.h | 136 void ZoneList<T>::Sort(CompareFunction cmp) { in Sort() argument 148 void ZoneList<T>::StableSort(CompareFunction cmp, size_t s, size_t l) { in StableSort() argument
|
/third_party/node/deps/icu-small/source/common/ |
H A D | uarrsort.cpp | 75 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, UComparator *cmp, const void *context) uprv_stableBinarySearch() argument 119 doInsertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, void *pv) doInsertionSort() argument 141 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) insertionSort() argument 169 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) subQuickSort() argument 235 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) quickSort() argument 256 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) uprv_sortArray() argument [all...] |
/third_party/mesa3d/src/gallium/drivers/nouveau/nv30/ |
H A D | nv30_texture.c | 208 swizzle(const struct nv30_texfmt *fmt, unsigned cmp, unsigned swz) in swizzle() argument
|
/third_party/ltp/tools/sparse/sparse-src/ |
H A D | cse.c | 141 int cmp; in phi_list_compare() local
|
/third_party/lz4/examples/ |
H A D | fileCompress.c | 219 int const cmp = compareFiles(inpFp, decFp); in main() local
|
/third_party/rust/crates/bindgen/bindgen-tests/tests/expectations/tests/ |
H A D | layout_array_too_long.rs | |
H A D | derive-bitfield-method-same-name.rs | |
/third_party/rust/crates/cxx/gen/build/src/syntax/ |
H A D | discriminant.rs | 246 fn cmp(&self, other: &Self) -> Ordering { in cmp() functions
|
/third_party/rust/crates/cxx/gen/lib/src/syntax/ |
H A D | discriminant.rs | 246 fn cmp(&self, other: &Self) -> Ordering { in cmp() functions
|
/third_party/rust/crates/cxx/macro/src/syntax/ |
H A D | discriminant.rs | 246 fn cmp(&self, other: &Self) -> Ordering { in cmp() functions
|
/third_party/rust/crates/cxx/syntax/ |
H A D | discriminant.rs | 246 fn cmp(&self, other: &Self) -> Ordering { in cmp() functions
|
/third_party/rust/crates/cxx/gen/cmd/src/syntax/ |
H A D | discriminant.rs | 246 fn cmp(&self, other: &Self) -> Ordering { in cmp() functions
|
/third_party/python/Lib/ |
H A D | filecmp.py | 30 def cmp(f1, f2, shallow=True): function
|
/third_party/optimized-routines/math/test/ |
H A D | ulp.h | 244 static int T(cmp) (const struct fun *f, struct gen *gen, in cmp() function
|