- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/papers/general/evaluation/cfa-bench.c
r79d4186 r28bc8c8 3 3 #include "cfa-pair.h" 4 4 5 int main( int argc, char * argv[]) {5 int main() { 6 6 int max = 0, val = 42; 7 7 stack( int ) si, ti; 8 8 9 9 REPEAT_TIMED( "push_int", N, push( si, val ); ) 10 TIMED( "copy_int", ti = si; )10 TIMED( "copy_int", ti{ si }; ) 11 11 TIMED( "clear_int", clear( si ); ) 12 12 REPEAT_TIMED( "pop_int", N, 13 13 int x = pop( ti ); if ( x > max ) max = x; ) 14 14 15 pair( _Bool, char ) max = { (_Bool)0 /***/, '\0' }, val = { (_Bool)1 /***/, 'a' };16 stack( pair( _Bool, char ) ) sp, tp;15 pair( short, char ) max = { 0h, '\0' }, val = { 42h, 'a' }; 16 stack( pair( short, char ) ) sp, tp; 17 17 18 18 REPEAT_TIMED( "push_pair", N, push( sp, val ); ) 19 TIMED( "copy_pair", tp = sp; )19 TIMED( "copy_pair", tp{ sp }; ) 20 20 TIMED( "clear_pair", clear( sp ); ) 21 21 REPEAT_TIMED( "pop_pair", N, 22 pair( _Bool, char) x = pop( tp ); if ( x > max ) max = x; )22 pair(short, char) x = pop( tp ); if ( x > max ) max = x; ) 23 23 }
Note: See TracChangeset
for help on using the changeset viewer.