From 1df846b3f94aa7ca9a6622577c367c864131bd04 Mon Sep 17 00:00:00 2001 From: Matt Turner Date: Sun, 16 Nov 2008 03:13:38 +0000 Subject: Fix ansi/pedantic warnings git-svn-id: svn://mattst88.com/svn/cleanbench/trunk@65 0d43b9a7-5ab2-4d7b-af9d-f64450cef757 --- numsort.c | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'numsort.c') diff --git a/numsort.c b/numsort.c index 8f94c00..36dbff6 100644 --- a/numsort.c +++ b/numsort.c @@ -26,8 +26,8 @@ static clock_t DoNumSortIteration(long *array, unsigned int num_arrays); static void LoadNumArrayWithRand(long *array, unsigned int num_arrays); -static inline void NumHeapSort(long *array, unsigned long bottom, unsigned long top); -static inline void NumSift(long *array, unsigned long min, unsigned long max); +static void NumHeapSort(long *array, unsigned long bottom, unsigned long top); +static void NumSift(long *array, unsigned long min, unsigned long max); /************** ** DoNumSort ** @@ -162,7 +162,7 @@ LoadNumArrayWithRand(long *array, unsigned int num_arrays) ** integers. Also pass in minimum and maximum offsets. ** This routine performs a heap sort on that array. */ -static inline void +static void NumHeapSort(long *array, unsigned long bottom, unsigned long top) { unsigned long temp; /* Used to exchange elements */ @@ -195,7 +195,7 @@ NumHeapSort(long *array, unsigned long bottom, unsigned long top) ** Peforms the sift operation on a numeric array, ** constructing a heap in the array. */ -static inline void +static void NumSift(long *array, unsigned long min, unsigned long max) { unsigned long k; -- cgit v1.2.3