Index: doc/theses/mike_brooks_MMath/benchmarks/list/_classic.c
===================================================================
--- doc/theses/mike_brooks_MMath/benchmarks/list/_classic.c	(revision fdc042d752e4d0d4e27f8bb544c73f0b9a8296cc)
+++ doc/theses/mike_brooks_MMath/benchmarks/list/_classic.c	(revision ff710572842ce13bd9317182ab348bb093af5256)
@@ -171,6 +171,8 @@
 #endif
 
-
-#define Repeat( op ) for ( volatile unsigned int i = 0; i < NoOfNodes; i += 1 ) { op; }
+volatile unsigned int t = 0;
+volatile unsigned int i_official = 0;
+
+#define Repeat( op ) for ( unsigned int i = 0; (i_official = i, i < NoOfNodes); i += 1 ) { op; }
 
 int main() {
@@ -192,5 +194,5 @@
         TAILQ_INIT(&lst);
         start = clock();
-        for ( volatile unsigned int t = 0; t < Times; t += 1 ) {
+        for ( t = 0; t < Times; t += 1 ) {
                 Repeat( TAILQ_INSERT_TAIL( &lst, &s[i], x ) );
                 Repeat( TAILQ_REMOVE( &lst, TAILQ_FIRST( &lst ), x ) );
@@ -204,5 +206,5 @@
         std::list<S *> lst;
         start = clock();
-        for ( volatile unsigned int t = 0; t < Times; t += 1 ) {
+        for ( t = 0; t < Times; t += 1 ) {
                 Repeat( lst.push_back( &s[i] ) );
                 Repeat( lst.pop_front() );
@@ -216,5 +218,5 @@
         uSequence<S> lst;
         start = clock();
-        for ( volatile unsigned int t = 0; t < Times; t += 1 ) {
+        for ( t = 0; t < Times; t += 1 ) {
                 Repeat( lst.addTail( &s[i] ) );
                 Repeat( lst.dropHead() );
@@ -228,5 +230,5 @@
         dlist(S) lst;
         start = clock();
-        for ( volatile unsigned int t = 0; t < Times; t += 1 ) {
+        for ( t = 0; t < Times; t += 1 ) {
                 Repeat( insert_last( lst, s[i] ) );
                 Repeat( remove( lst`first ) );
@@ -240,5 +242,5 @@
     	Sequence(S) lst;
         start = clock();
-        for ( volatile unsigned int t = 0; t < Times; t += 1 ) {
+        for ( t = 0; t < Times; t += 1 ) {
                 Repeat( addHead( lst, s[i] ) );
                 Repeat( dropTail( lst ) );
