Changeset da1c772 for doc/generic_types/evaluation/c-bench.c

Timestamp:

Apr 11, 2017, 6:35:59 PM (7 years ago)

Author:

Peter A. Buhr <pabuhr@…>

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:

3720bf8f

Parents:

f674479 (diff), 4f57930 (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 plg2:software/cfa/cfa-cc

File:

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

doc/generic_types/evaluation/c-bench.c

@@ -1 +1 @@
 #include <stdlib.h>
 #include "bench.h"
+#include "c-pair.h"
 #include "c-stack.h"
 
-void* copy_int( void* p ) {
+_Bool* new_bool( _Bool b ) {
+        _Bool* q = malloc(sizeof(_Bool));
+        *q = b;
+        return q;
+}
+
+char* new_char( char c ) {
+        char* q = malloc(sizeof(char));
+        *q = c;
+        return q;
+}
+
+int* new_int( int i ) {
         int* q = malloc(sizeof(int));
-        *q = *(int*)p;
+        *q = i;
         return q;
+}
+
+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_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;
+}
+
+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;
 }
 
@@ -14 +45 @@
         struct stack s = new_stack();
         REPEAT_TIMED( "push_int",
-                int* x = malloc(sizeof(int));
-                *x = rand();
-                push_stack(&s, x);
+                push_stack(&s, new_int( rand() ));
         )
 
@@ -25 +54 @@
 
         TIMED( "clear_int",
-                clear_stack(&s);
+                clear_stack(&s, free);
         )
 
-        int sum;
+        int max = 0;
         REPEAT_TIMED( "pop_int", 
                 int* x = pop_stack(&t);
-                sum += *x;
+                if ( *x > max ) { max = *x; }
                 free(x);
         )
+
+        struct stack s2 = new_stack();
+        REPEAT_TIMED( "push_bool_char", 
+                push_stack(&s2, new_pair( new_bool( rand() & 0x1 ), new_char( rand() & 0x7F ) ));
+        )
+
+        struct stack t2;
+        TIMED( "copy_bool_char", 
+                copy_stack(&t2, &s2, copy_pair_bool_char);
+        )
+
+        TIMED( "clear_bool_char", 
+                clear_stack(&s2, free_pair_bool_char);
+        )
+
+        struct pair* max2 = new_pair( new_bool(0), new_char('\0') );
+        REPEAT_TIMED( "pop_bool_char", 
+                struct pair* x = pop_stack(&t2);
+                if ( cmp_pair( x, max2, cmp_bool, cmp_char ) > 0 ) {
+                        free_pair_bool_char( max2 );
+                        max2 = x;
+                } else {
+                        free_pair_bool_char( x );
+                }
+        )
+        free_pair_bool_char( max2 );
 }