Cleaning up the code a bit.

1 files changed, 0 insertions, 89 deletions

diff --git a/Main.C b/Main.C
deleted file mode 100644
index ebd276a..0000000
--- a/Main.C
+++ /dev/null
@@ -1,89 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2006 International Business Machines Corporation.             *
- * All rights reserved. This program and the accompanying materials            *
- * are made available under the terms of the Common Public License v1.0        *
- * which accompanies this distribution, and is available at                    *
- * http://www.opensource.org/licenses/cpl1.0.php                               *
- *                                                                             *
- * Contributors:                                                               *
- *    Douglas M. Pase - initial API and implementation                         *
- *******************************************************************************/
-
-
-#include <stdio.h>
-
-#include "Main.h"
-
-#include "Run.h"
-#include "Timer.h"
-#include "Types.h"
-#include "Output.h"
-#include "Experiment.h"
-
-				// This program allocates and accesses
-				// a number of blocks of memory, one or more
-				// for each thread that executes.  Blocks
-				// are divided into sub-blocks called
-				// pages, and pages are divided into
-				// sub-blocks called cache lines.
-				// 
-				// All pages are collected into a list.
-				// Pages are selected for the list in
-				// a particular order.   Each cache line
-				// within the page is similarly gathered
-				// into a list in a particular order.
-				// In both cases the order may be random
-				// or linear.
-				//
-				// A root pointer points to the first
-				// cache line.  A pointer in the cache
-				// line points to the next cache line,
-				// which contains a pointer to the cache
-				// line after that, and so on.  This
-				// forms a pointer chain that touches all
-				// cache lines within the first page,
-				// then all cache lines within the second
-				// page, and so on until all pages are
-				// covered.  The last pointer contains
-				// NULL, terminating the chain.
-				//
-				// Depending on compile-time options,
-				// pointers may be 32-bit or 64-bit
-				// pointers.
-
-int verbose = 0;
-
-int
-main( int argc, char* argv[] )
-{
-    Timer::calibrate(10000);
-    double clk_res = Timer::resolution();
-
-    Experiment e;
-    if (e.parse_args(argc, argv)) {
-	return 0;
-    }
-
-#if defined(UNDEFINED)
-    e.print();
-    if (argv != NULL) return 0;
-#endif
-
-    SpinBarrier sb( e.num_threads );
-    Run r[ e.num_threads ];
-    for (int i=0; i < e.num_threads; i++) {
-	r[i].set( e, &sb );
-	r[i].start();
-    }
-
-    for (int i=0; i < e.num_threads; i++) {
-	r[i].wait();
-    }
-
-    int64  ops  = Run::ops_per_chain();
-    double secs = Run::seconds();
-
-    Output::print(e, ops, secs, clk_res);
-
-    return 0;
-}