Searched refs:cmp (Results 1 - 25 of 176) sorted by relevance

12345678

/haiku-fatelf/src/system/libroot/posix/string/
H A Dstrncmp.c14 int cmp = (unsigned char)*a - (unsigned char)*b++; local
15 if (cmp != 0 || *a++ == '\0')
16 return cmp;
H A Dmemcmp.c17 int cmp = *a++ - *b++; local
18 if (cmp != 0)
19 return cmp;
H A Dstrcmp.c25 int32 cmp = *a32++ - *b32++; local
26 if (cmp != 0)
27 return cmp;
32 int cmp = (unsigned char)*a - (unsigned char)*b++; local
33 if (cmp != 0 || *a++ == '\0')
34 return cmp;
/haiku-fatelf/src/system/libroot/posix/wchar/
H A Dwcscmp.c12 int cmp; local
15 cmp = *wcs1 - *wcs2++;
19 if (cmp != 0 || *wcs1++ == L'\0')
23 return cmp;
H A Dwcscasecmp.c14 int cmp; local
17 cmp = towlower(*wcs1) - towlower(*wcs2++);
21 if (cmp != 0 || *wcs1++ == L'\0')
25 return cmp;
H A Dwcsncasecmp.c14 int cmp = 0; local
17 cmp = towlower(*wcs1) - towlower(*wcs2++);
21 if (cmp != 0 || *wcs1++ == L'\0')
25 return cmp;
H A Dwcsncmp.c12 int cmp = 0; local
15 cmp = *wcs1 - *wcs2++;
19 if (cmp != 0 || *wcs1++ == L'\0')
23 return cmp;
H A Dwcsftime.cpp15 return cmp;
/haiku-fatelf/src/bin/coreutils/lib/
H A Dmemcmp2.c30 int cmp = memcmp (s1, s2, n1 <= n2 ? n1 : n2); local
31 if (cmp == 0)
34 cmp = -1;
36 cmp = 1;
38 return cmp;
H A Dmpsort.c39 comparison_function cmp)
50 mpsort_with_tmp (base + n1, n2, tmp, cmp);
51 mpsort_with_tmp (base, n1, tmp, cmp);
57 if (cmp (ba, bb) <= 0)
88 comparison_function cmp)
96 if (! (cmp (p0, p1) <= 0))
115 mpsort_with_tmp (base + n1, n2, tmp, cmp);
120 mpsort_into_tmp (base, n1, tmp, cmp);
126 if (cmp (tt, bb) <= 0)
153 mpsort (void const **base, size_t n, comparison_function cmp) argument
37 mpsort_into_tmp(void const **restrict base, size_t n, void const **restrict tmp, comparison_function cmp) argument
86 mpsort_with_tmp(void const **restrict base, size_t n, void const **restrict tmp, comparison_function cmp) argument
[all...]
H A Dmbscasecmp.c55 int cmp = mb_casecmp (mbui_cur (iter1), mbui_cur (iter2)); local
57 if (cmp != 0)
58 return cmp;
/haiku-fatelf/src/system/libroot/posix/stdlib/
H A Dbsearch.c68 int cmp; local
73 cmp = (*compar)(key, p);
74 if (cmp == 0) {
77 if (cmp > 0) { /* key > p: move right */
H A Dqsort.c84 med3(char *a, char *b, char *c, cmp_t *cmp) argument
86 return cmp(a, b) < 0 ?
87 (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
88 :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
92 qsort(void *a, size_t n, size_t es, cmp_t *cmp) argument
110 for (pl = pm; pl > (char *)a && cmp(pl - es, pl) > 0;
121 pl = med3(pl, pl + d, pl + 2 * d, cmp);
122 pm = med3(pm - d, pm, pm + d, cmp);
[all...]
H A Dmerge.c100 mergesort(void *base, size_t nmemb, size_t size, int (*cmp)(void const *, void const *))
141 setup(list1, list2, nmemb, size, cmp);
155 if ((*cmp)(f1, f2) <= 0) {
165 while ((b += size) < t && cmp(q, b) >sense)
174 (*cmp)(q, p) <= sense)
179 } else if ((*cmp)(q, p) <= sense) {
188 if ((*cmp)(q, p = b + i) <= sense)
195 if ((*cmp)(q,
274 setup(u_char *list1, u_char *list2, size_t n, size_t size, int (*cmp)(void const *, void const *))
281 insertionsort(list1, n, size, cmp);
[all...]
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dbsearch.c78 register int lim, cmp; local
83 cmp = (*compar)(key, p);
84 if (cmp == 0)
86 if (cmp > 0) { /* key > p: move right */
/haiku-fatelf/src/bin/gdb/
H A Dmove-if-change23 cmp $1 $2 > /dev/null
/haiku-fatelf/src/libs/ncurses/misc/
H A Dchkdef.cmd24 * `cmp' is zero when the file is valid
28 cmp = 0
56 cmp = 1
62 cmp = 2
69 cmp = 3
80 exit cmp
H A Dcmpdef.cmd27 * `cmp' is zero when the last file is valid and upward compatible
30 cmp = 0
81 cmp = 1
89 cmp = 1
94 exit cmp
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/
H A DVersion.cpp112 int cmp = compare_version_part(fMajor, other.fMajor); local
113 if (cmp != 0)
114 return cmp;
116 cmp = compare_version_part(fMinor, other.fMinor);
117 if (cmp != 0)
118 return cmp;
120 cmp = compare_version_part(fMicro, other.fMicro);
121 if (cmp != 0)
122 return cmp;
134 cmp
147 int cmp = Compare(other); local
[all...]
/haiku-fatelf/src/bin/diffutils/src/
H A Ddiff.c1055 struct comparison cmp;
1056 #define DIR_P(f) (S_ISDIR (cmp.file[f].stat.st_mode) != 0)
1081 memset (cmp.file, 0, sizeof cmp.file);
1082 cmp.parent = parent;
1084 /* cmp.file[f].desc markers */
1091 cmp.file[0].desc = name0 == 0 ? NONEXISTENT : UNOPENED;
1092 cmp.file[1].desc = name1 == 0 ? NONEXISTENT : UNOPENED;
1105 cmp.file[0].name = name0;
1106 cmp
1051 struct comparison cmp; local
[all...]
H A Ddir.c202 diff_dirs (struct comparison const *cmp,
210 if ((cmp->file[0].desc == -1 || dir_loop (cmp, 0))
211 && (cmp->file[1].desc == -1 || dir_loop (cmp, 1)))
214 cmp->file[cmp->file[0].desc == -1].name);
220 if (! dir_read (&cmp->file[i], &dirdata[i]))
222 perror_with_name (cmp->file[i].name);
245 if (starting_file && ! cmp
201 diff_dirs(struct comparison const *cmp, int (*handle_file) (struct comparison const *, char const *, char const *)) argument
282 dir_loop(struct comparison const *cmp, int i) argument
[all...]
H A Danalyze.c827 diff_2_files (struct comparison *cmp)
842 if (read_files (cmp->file, files_can_be_treated_as_binary))
845 if (cmp->file[0].stat.st_size != cmp->file[1].stat.st_size
846 && (cmp->file[0].desc < 0 || S_ISREG (cmp->file[0].stat.st_mode))
847 && (cmp->file[1].desc < 0 || S_ISREG (cmp->file[1].stat.st_mode)))
851 else if (cmp->file[0].desc == cmp
822 diff_2_files(struct comparison *cmp) argument
[all...]
/haiku-fatelf/src/bin/gawk/
H A Dfixvers31 if [ -f version.c ] && cmp version.c version.new
43 if [ -f patchlev.h ] && cmp patchlev.h patchlev.new
/haiku-fatelf/headers/posix/sys/
H A Dtime.h74 #define timercmp(a, b, cmp) ((a)->tv_sec == (b)->tv_sec \
75 ? (a)->tv_usec cmp (b)->tv_usec : (a)->tv_sec cmp (b)->tv_sec)
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dadd_tries.c61 unsigned char cmp = *txt; local
63 while (!CMP_TRY(ptr->ch, cmp)
67 if (CMP_TRY(ptr->ch, cmp)) {

Completed in 447 milliseconds

12345678