summaryrefslogtreecommitdiff
path: root/numsort.c
diff options
context:
space:
mode:
authorMatt Turner <mattst88@gmail.com>2008-11-14 23:03:36 +0000
committerMatt Turner <mattst88@gmail.com>2008-11-14 23:03:36 +0000
commit34edabbf495e0222c59937973ab2bfecc8e32dd6 (patch)
treecb3f1660f1fdac73e1f7281d25cb35b68a7db1aa /numsort.c
parent7225b0865e8c7697fce69224640142374b22364d (diff)
Remove adjust struct member in favor of a local static variable
git-svn-id: svn://mattst88.com/svn/cleanbench/trunk@44 0d43b9a7-5ab2-4d7b-af9d-f64450cef757
Diffstat (limited to 'numsort.c')
-rw-r--r--numsort.c13
1 files changed, 5 insertions, 8 deletions
diff --git a/numsort.c b/numsort.c
index 1186d54..70bdd2a 100644
--- a/numsort.c
+++ b/numsort.c
@@ -32,19 +32,16 @@ DoNumSort (void)
{
const char* context = "CPU:Numeric Sort";
SortStruct* numsortstruct = &global_numsortstruct;
+ long* arraybase = NULL;
clock_t total_time = 0;
int iterations = 0;
- long* arraybase = NULL;
-
int num_arrays = 1;
+ static int is_adjusted = FALSE;
- /*
- ** See if we need to do self adjustment code.
- */
- if (numsortstruct->adjust == FALSE) {
- numsortstruct->adjust = TRUE;
+ if (is_adjusted == FALSE) {
+ is_adjusted = TRUE;
/*
- ** Self-adjustment code. The system begins by sorting 1
+ ** Self-is_adjustedment code. The system begins by sorting 1
** array. If it does that in no time, then two arrays
** are built and sorted. This process continues until
** enough arrays are built to handle the tolerance.