Changeset f4abc58 for doc/papers/general/evaluation/cfa-bench.c

Timestamp:

Mar 7, 2018, 5:09:18 PM (6 years ago)

Author:

Rob Schluntz <rschlunt@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

fb11446e

Parents:

b2e8841 (diff), 7b0dfa4 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:/u/cforall/software/cfa/cfa-cc

File:

• doc/papers/general/evaluation/cfa-bench.c (modified) (1 diff)

doc/papers/general/evaluation/cfa-bench.c

@@ -1 @@
-#include <fstream>
-#include <stdlib>
 #include "bench.h"
 #include "cfa-stack.h"
 #include "cfa-pair.h"
-#include "cfa-print.h"
 
 int main( int argc, char * argv[] ) {
-        ofstream out = { "/dev/null" };
         int max = 0, val = 42;
-        stack( int ) si, t;
+        stack( int ) si, ti;
 
         REPEAT_TIMED( "push_int", N, push( si, val ); )
-        TIMED( "copy_int", t = si; )
+        TIMED( "copy_int", ti = si; )
         TIMED( "clear_int", clear( si ); )
-        REPEAT_TIMED( "pop_int", N, int x = pop( t ); max = max( x, max ); )
-        REPEAT_TIMED( "print_int", N/2, out | val | ':' | val | endl; )
+        REPEAT_TIMED( "pop_int", N, 
+                int x = pop( ti ); if ( x > max ) max = x; )
 
-        pair( _Bool, char ) max = { (_Bool)0, '\0' }, val = { (_Bool)1, 'a' };
-        stack( pair( _Bool, char ) ) s, t;
+        pair( _Bool, char ) max = { (_Bool)0 /***/, '\0' }, val = { (_Bool)1 /***/, 'a' };
+        stack( pair( _Bool, char ) ) sp, tp;
 
-        REPEAT_TIMED( "push_pair", N, push( s, val ); )
-        TIMED( "copy_pair", t = s; )
-        TIMED( "clear_pair", clear( s ); )
-        REPEAT_TIMED( "pop_pair", N, pair(_Bool, char) x = pop( t ); max = max( x, max ); )
-        REPEAT_TIMED( "print_pair", N/2, out | val | ':' | val | endl; )
+        REPEAT_TIMED( "push_pair", N, push( sp, val ); )
+        TIMED( "copy_pair", tp = sp; )
+        TIMED( "clear_pair", clear( sp ); )
+        REPEAT_TIMED( "pop_pair", N,
+                pair(_Bool, char) x = pop( tp ); if ( x > max ) max = x; )
 }