diff options
author | Matt Turner <mattst88@gmail.com> | 2008-11-16 03:13:38 +0000 |
---|---|---|
committer | Matt Turner <mattst88@gmail.com> | 2008-11-16 03:13:38 +0000 |
commit | 1df846b3f94aa7ca9a6622577c367c864131bd04 (patch) | |
tree | 4ada2450229a22d5d3d0a2a67d780ffcc7bd0e27 /numsort.c | |
parent | 761470f9b51f2df8d25baf6060a7acfd333ba698 (diff) |
Fix ansi/pedantic warnings
git-svn-id: svn://mattst88.com/svn/cleanbench/trunk@65 0d43b9a7-5ab2-4d7b-af9d-f64450cef757
Diffstat (limited to 'numsort.c')
-rw-r--r-- | numsort.c | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -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; |