Loading...
--- Libc/Libc-1725.40.4/stdlib/FreeBSD/merge.c
+++ Libc/Libc-583/stdlib/FreeBSD/merge.c
@@ -30,9 +30,6 @@
* SUCH DAMAGE.
*/
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wcomma"
-
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)merge.c 8.2 (Berkeley) 2/14/94";
#endif /* LIBC_SCCS and not lint */
@@ -98,8 +95,11 @@
* Arguments are as for qsort.
*/
int
-mergesort(void *base, size_t nmemb, size_t size,
- int (*cmp)(const void *, const void *))
+mergesort(base, nmemb, size, cmp)
+ void *base;
+ size_t nmemb;
+ size_t size;
+ int (*cmp)(const void *, const void *);
{
size_t i;
int sense;
@@ -259,11 +259,12 @@
* is defined. Otherwise simple pairwise merging is used.)
*/
void
-setup(u_char *list1, u_char *list2, size_t n, size_t size,
- int (*cmp)(const void *, const void *))
+setup(list1, list2, n, size, cmp)
+ size_t n, size;
+ int (*cmp)(const void *, const void *);
+ u_char *list1, *list2;
{
- size_t i, size2;
- int length, tmp, sense;
+ int i, length, size2, tmp, sense;
u_char *f1, *f2, *s, *l2, *last, *p2;
size2 = size*2;
@@ -332,8 +333,10 @@
* last 4 elements.
*/
static void
-insertionsort(u_char *a, size_t n, size_t size,
- int (*cmp)(const void *, const void *))
+insertionsort(a, n, size, cmp)
+ u_char *a;
+ size_t n, size;
+ int (*cmp)(const void *, const void *);
{
u_char *ai, *s, *t, *u, tmp;
int i;
@@ -346,4 +349,3 @@
swap(u, t);
}
}
-#pragma clang diagnostic pop