Changeset 29db723 for doc/papers/general/evaluation/cfa-stack.c

Timestamp:

Mar 8, 2018, 11:04:14 PM (6 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:

81e8ab0, e59f0bf

Parents:

deb52a0

Message:

additional changes

File:

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

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

@@ -2 +2 @@
 #include "cfa-stack.h"
 
-forall(otype T) struct stack_node {
+forall( otype T ) struct stack_node {
         T value;
         stack_node(T) * next;
 };
 
-forall(otype T) void ?{}( stack(T) & s ) { (s.head){ 0 }; }
+forall( otype T ) void ?{}( stack(T) & s ) { (s.head){ 0 }; }
 
-forall(otype T) void ?{}( stack(T) & s, stack(T) t ) {
+forall( otype T ) void ?{}( stack(T) & s, stack(T) t ) {
         stack_node(T) ** crnt = &s.head;
         for ( stack_node(T) * next = t.head; next; next = next->next ) {
@@ -19 +19 @@
 }
 
-forall(otype T) stack(T) ?=?( stack(T) & s, stack(T) t ) {
+forall( otype T ) stack(T) ?=?( stack(T) & s, stack(T) t ) {
         if ( s.head == t.head ) return s;
         clear( s );
@@ -26 +26 @@
 }
 
-forall(otype T) void ^?{}( stack(T) & s) { clear( s ); }
+forall( otype T ) void ^?{}( stack(T) & s) { clear( s ); }
 
-forall(otype T) _Bool empty( const stack(T) & s ) { return s.head == 0; }
+forall( otype T ) _Bool empty( const stack(T) & s ) { return s.head == 0; }
 
-forall(otype T) void push( stack(T) & s, T value ) with( s ) {
-        stack_node(T)* n = alloc();
+forall( otype T ) void push( stack(T) & s, T value ) with( s ) {
+        stack_node(T) * n = alloc();
         (*n){ value, head };
         head = n;
 }
 
-forall(otype T) T pop( stack(T) & s ) with( s ) {
+forall( otype T ) T pop( stack(T) & s ) with( s ) {
         stack_node(T) * n = head;
         head = n->next;
-        T x = n->value;
+        T v = n->value;
         ^(*n){};
         free( n );
-        return x;
+        return v;
 }
 
-forall(otype T) void clear( stack(T) & s ) with( s ) {
+forall( otype T ) void clear( stack(T) & s ) with( s ) {
         for ( stack_node(T) * next = head; next; ) {
                 stack_node(T) * crnt = next;