Changeset fb2ce27 for doc/papers/general/evaluation/c-bench.c

Timestamp:

Mar 8, 2018, 1:37:46 PM (7 years ago)

Author:

Aaron Moss <a3moss@…>

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:

28bc8c8

Parents:

f1f8e55

Message:

Update all benchmarks to match new CFA

File:

• doc/papers/general/evaluation/c-bench.c (modified) (3 diffs)

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

@@ -5 +5 @@
 #include "c-stack.h"
 
-_Bool* new_bool( _Bool b ) {
-        _Bool* q = malloc(sizeof(_Bool)); /***/
-        *q = b;
+char* new_char( char c ) {
+        char* q = malloc(sizeof(char)); /***/
+        *q = c;
         return q;
 }
 
-char* new_char( char c ) {
-        char* q = malloc(sizeof(char)); /***/
-        *q = c;
+short* new_short( short s ) {
+        short* q = malloc(sizeof(short)); /***/
+        *q = s;
         return q;
 }
@@ -23 +23 @@
 }
 
-void* copy_bool( const void* p ) { return new_bool( *(const _Bool*)p ); } /***/
 void* copy_char( const void* p ) { return new_char( *(const char*)p ); } /***/
+void* copy_short( const void* p ) { return new_short( *(const short*)p ); } /***/
 void* copy_int( const void* p ) { return new_int( *(const int*)p ); } /***/
-void* copy_pair_bool_char( const void* p ) { return copy_pair( p, copy_bool, copy_char ); } /***/
-void free_pair_bool_char( void* p ) { free_pair( p, free, free ); } /***/
-
-int cmp_bool( const void* a, const void* b ) { /***/
-        return *(const _Bool*)a == *(const _Bool*)b ? 0 : *(const _Bool*)a < *(const _Bool*)b ? -1 : 1; 
-}
+void* copy_pair_short_char( const void* p ) { return copy_pair( p, copy_short, copy_char ); } /***/
+void free_pair_short_char( void* p ) { free_pair( p, free, free ); } /***/
 
 int cmp_char( const void* a, const void* b ) { /***/
         return *(const char*)a == *(const char*)b ? 0 : *(const char*)a < *(const char*)b ? -1 : 1;
+}
+
+int cmp_short( const void* a, const void* b ) { /***/
+        return *(const short*)a == *(const short*)b ? 0 : *(const short*)a < *(const short*)b ? -1 : 1; 
 }
 
@@ -49 +49 @@
                 free(xi); )
 
-        struct pair * maxp = new_pair( new_bool(0), new_char('\0') ),
-                * valp = new_pair( new_bool(1), new_char('a') );
+        struct pair * maxp = new_pair( new_short(0), new_char('\0') ),
+                * valp = new_pair( new_short(42), new_char('a') );
         struct stack sp = new_stack(), tp;
 
-        REPEAT_TIMED( "push_pair", N, push_stack( &sp, copy_pair_bool_char( valp ) ); )
-        TIMED( "copy_pair", copy_stack( &tp, &sp, copy_pair_bool_char ); /***/ )
-        TIMED( "clear_pair", clear_stack( &sp, free_pair_bool_char ); /***/ )
+        REPEAT_TIMED( "push_pair", N, push_stack( &sp, copy_pair_short_char( valp ) ); )
+        TIMED( "copy_pair", copy_stack( &tp, &sp, copy_pair_short_char ); /***/ )
+        TIMED( "clear_pair", clear_stack( &sp, free_pair_short_char ); /***/ )
         REPEAT_TIMED( "pop_pair", N, 
                 struct pair * xp = pop_stack( &tp );
-                if ( cmp_pair( xp, maxp, cmp_bool, cmp_char /***/ ) > 0 ) {
-                        free_pair_bool_char( maxp ); /***/
+                if ( cmp_pair( xp, maxp, cmp_short, cmp_char /***/ ) > 0 ) {
+                        free_pair_short_char( maxp ); /***/
                         maxp = xp;
                 } else {
-                        free_pair_bool_char( xp ); /***/
+                        free_pair_short_char( xp ); /***/
                 } )
-        free_pair_bool_char( maxp ); /***/
-        free_pair_bool_char( valp ); /***/
+        free_pair_short_char( maxp ); /***/
+        free_pair_short_char( valp ); /***/
 }