Changeset c9b3a41
 Timestamp:
 Mar 2, 2018, 6:52:37 AM (5 years ago)
 Branches:
 aaronthesis, armeh, cleanupdtors, deferred_resn, demangler, enum, forallpointerdecay, jacob/cs343translation, jenkinssandbox, master, newast, newastuniqueexpr, newenv, no_list, persistentindexer, pthreademulation, qualifiedEnum, resolvnew, with_gc
 Children:
 000ff2c
 Parents:
 ab3251e
 Location:
 doc/papers/general/evaluation
 Files:

 5 edited
Legend:
 Unmodified
 Added
 Removed

doc/papers/general/evaluation/cfabench.c
rab3251e rc9b3a41 1 #include <stdio.h> 1 #include <fstream> 2 #include <stdlib> 2 3 #include "bench.h" 3 4 #include "cfastack.h" … … 5 6 #include "cfaprint.h" 6 7 7 int main( int argc, char * argv[] ) {8 FILE * out = fopen( "/dev/null", "w" );9 int max i = 0, vali= 42;10 stack( int) si, ti;8 int main( int argc, char * argv[] ) { 9 ofstream out = { "/dev/null" }; 10 int max = 0, val = 42; 11 stack( int ) si, t; 11 12 12 REPEAT_TIMED( "push_int", N, push( &si, vali ); ) 13 TIMED( "copy_int", ti = si; ) 14 TIMED( "clear_int", clear( &si ); ) 15 REPEAT_TIMED( "pop_int", N, 16 int xi = pop( &ti ); 17 if ( xi > maxi ) { maxi = xi; } ) 18 REPEAT_TIMED( "print_int", N/2, print( out, vali, ":", vali, "\n" ); ) 13 REPEAT_TIMED( "push_int", N, push( si, val ); ) 14 TIMED( "copy_int", t = si; ) 15 TIMED( "clear_int", clear( si ); ) 16 REPEAT_TIMED( "pop_int", N, int x = pop( t ); max = max( x, max ); ) 17 REPEAT_TIMED( "print_int", N/2, out  val  ':'  val  endl; ) 19 18 20 pair( _Bool, char) maxp = { (_Bool)0, '\0' }, valp= { (_Bool)1, 'a' };21 stack( pair(_Bool, char)) sp, tp;19 pair( _Bool, char ) max = { (_Bool)0, '\0' }, val = { (_Bool)1, 'a' }; 20 stack( pair( _Bool, char ) ) s, t; 22 21 23 REPEAT_TIMED( "push_pair", N, push( &sp, valp ); ) 24 TIMED( "copy_pair", tp = sp; ) 25 TIMED( "clear_pair", clear( &sp ); ) 26 REPEAT_TIMED( "pop_pair", N, 27 pair(_Bool, char) xp = pop( &tp ); 28 if ( xp > maxp ) { maxp = xp; } ) 29 REPEAT_TIMED( "print_pair", N/2, print( out, valp, ":", valp, "\n" ); ) 30 fclose(out); 22 REPEAT_TIMED( "push_pair", N, push( s, val ); ) 23 TIMED( "copy_pair", t = s; ) 24 TIMED( "clear_pair", clear( s ); ) 25 REPEAT_TIMED( "pop_pair", N, pair(_Bool, char) x = pop( t ); max = max( x, max ); ) 26 REPEAT_TIMED( "print_pair", N/2, out  val  ':'  val  endl; ) 31 27 } 
doc/papers/general/evaluation/cfapair.c
rab3251e rc9b3a41 1 1 #include "cfapair.h" 2 #include "fstream" 2 3 3 4 forall(otype R, otype S … … 34 35 return p.first > q.first  ( p.first == q.first && p.second >= q.second ); 35 36 } 37 38 forall(otype R, otype S) 39 forall(dtype ostype  ostream( ostype )  { ostype & ??( ostype &, pair(R, S) ); }) 40 ostype & ??( ostype & os, pair(R, S) p ) { 41 return os  '['  p.first  ','  p.second  ']'; 42 } // ?? 
doc/papers/general/evaluation/cfapair.h
rab3251e rc9b3a41 1 1 #pragma once 2 3 #include "iostream" 2 4 3 5 forall(otype R, otype S) struct pair { … … 27 29  { int ?==?(R, R); int ?>?(R, R); int ?>=?(S, S); }) 28 30 int ?>=?(pair(R, S) p, pair(R, S) q); 31 32 forall(otype R, otype S) 33 forall(dtype ostype  ostream( ostype )  { ostype & ??( ostype &, pair(R, S) ); }) 34 ostype & ??( ostype & os, pair(R, S) ); 
doc/papers/general/evaluation/cfastack.c
rab3251e rc9b3a41 4 4 forall(otype T) struct stack_node { 5 5 T value; 6 stack_node(T) * next;6 stack_node(T) * next; 7 7 }; 8 forall(otype T) void ?{}( stack_node(T) & node, T value, stack_node(T) * next ) { 9 node.value = value; 10 node.next = next; 11 } 8 12 9 forall(otype T) void ?{}( stack(T)* s) { (&s>head){ 0 }; }13 forall(otype T) void ?{}( stack(T) & s ) { (s.head){ 0 }; } 10 14 11 forall(otype T) void ?{}( stack(T)* s, stack(T) t) {12 stack_node(T) ** crnt = &s>head;13 for ( stack_node(T) * next = t.head; next; next = next>next ) {14 *crnt = ((stack_node(T)*)malloc()){ next>value }; /***/15 stack_node(T) * acrnt = *crnt;15 forall(otype T) void ?{}( stack(T) & s, stack(T) t ) { 16 stack_node(T) ** crnt = &s.head; 17 for ( stack_node(T) * next = t.head; next; next = next>next ) { 18 *crnt = new( next>value, 0 ); 19 stack_node(T) * acrnt = *crnt; 16 20 crnt = &acrnt>next; 17 21 } … … 19 23 } 20 24 21 forall(otype T) stack(T) ?=?( stack(T)* s, stack(T) t) {22 if ( s >head == t.head ) return *s;23 clear( s);25 forall(otype T) stack(T) ?=?( stack(T) & s, stack(T) t ) { 26 if ( s.head == t.head ) return s; 27 clear( s ); 24 28 s{ t }; 25 return *s;29 return s; 26 30 } 27 31 28 forall(otype T) void ^?{}( stack(T)* s) { clear(s); }32 forall(otype T) void ^?{}( stack(T) & s) { clear( s ); } 29 33 30 forall(otype T) _Bool empty( const stack(T)* s) { return s>head == 0; }34 forall(otype T) _Bool empty( const stack(T) & s ) { return s.head == 0; } 31 35 32 forall(otype T) void push( stack(T)* s, T value) {33 s>head = ((stack_node(T)*)malloc()){ value, s>head }; /***/ 36 forall(otype T) void push( stack(T) & s, T value ) { 37 s.head = new( value, s.head ); 34 38 } 35 39 36 forall(otype T) T pop( stack(T)* s) {37 stack_node(T) * n = s>head;38 s >head = n>next;39 T x= n>value;40 ^n{};41 free( n);42 return x;40 forall(otype T) T pop( stack(T) & s ) { 41 stack_node(T) * n = s.head; 42 s.head = n>next; 43 T v = n>value; 44 // ^n{}; 45 free( n ); 46 return v; 43 47 } 44 48 45 forall(otype T) void clear( stack(T)* s) {46 for ( stack_node(T)* next = s>head; next; ) {47 stack_node(T) * crnt = next;49 forall(otype T) void clear( stack(T) & s ) { 50 for ( stack_node(T) * next = s.head; next; ) { 51 stack_node(T) * crnt = next; 48 52 next = crnt>next; 49 delete( crnt);53 delete( crnt ); 50 54 } 51 s >head = 0;55 s.head = 0; 52 56 } 
doc/papers/general/evaluation/cfastack.h
rab3251e rc9b3a41 3 3 forall(otype T) struct stack_node; 4 4 forall(otype T) struct stack { 5 stack_node(T) * head;5 stack_node(T) * head; 6 6 }; 7 7 8 forall(otype T) void ?{}( stack(T)* s);9 forall(otype T) void ?{}( stack(T)* s, stack(T) t);10 forall(otype T) stack(T) ?=?( stack(T)* s, stack(T) t);11 forall(otype T) void ^?{}( stack(T)*s);8 forall(otype T) void ?{}( stack(T) & s ); 9 forall(otype T) void ?{}( stack(T) & s, stack(T) t ); 10 forall(otype T) stack(T) ?=?( stack(T) & s, stack(T) t ); 11 forall(otype T) void ^?{}( stack(T) & s); 12 12 13 forall(otype T) _Bool empty( const stack(T)* s);14 forall(otype T) void push( stack(T)* s, T value);15 forall(otype T) T pop( stack(T)* s);16 forall(otype T) void clear( stack(T)* s);13 forall(otype T) _Bool empty( const stack(T) & s ); 14 forall(otype T) void push( stack(T) & s, T value ); 15 forall(otype T) T pop( stack(T) & s ); 16 forall(otype T) void clear( stack(T) & s );
Note: See TracChangeset
for help on using the changeset viewer.