Changeset 7a054e82 for doc/generic_types/evaluation/cfa-stack.c

Timestamp:

Apr 10, 2017, 3:17:29 PM (8 years ago)

Author:

Thierry Delisle <tdelisle@…>

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:

b715c9a

Parents:

b0fedd4 (diff), b276be5 (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 plg.uwaterloo.ca:software/cfa/cfa-cc

File:

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

doc/generic_types/evaluation/cfa-stack.c

@@ +1 @@
+#include <assert>
 #include <stdlib>
 #include "cfa-stack.h"
@@ -8 +9 @@
 
 forall(otype T) void ?{}(stack(T)* s) {
-        ?{}( &s->head, 0 );
+        (&s->head){ 0 };
+}
+
+forall(otype T) void copy(stack(T)* s, stack(T)* t) {
+        stack_node(T)** crnt = &s->head;
+        stack_node(T)* next = t->head;
+        while ( next ) {
+                *crnt = ((stack_node(T)*)malloc()){ next->value };
+                stack_node(T)* acrnt = *crnt;
+                crnt = &acrnt->next;
+                next = next->next;
+        }
+        *crnt = 0;
+}
+
+forall(otype T) void ?{}(stack(T)* s, stack(T) t) {
+        stack_node(T)** crnt = &s->head;
+        stack_node(T)* next = t.head;
+        while ( next ) {
+                *crnt = ((stack_node(T)*)malloc()){ next->value };
+                stack_node(T)* acrnt = *crnt;
+                crnt = &acrnt->next;
+                next = next->next;
+        }
+        *crnt = 0;
+}
+
+forall(otype T) stack(T) ?=?(stack(T)* s, stack(T) t) {
+        if ( s->head == t.head ) return *s;
+        clear(s);
+        s{ t };
+        return *s;
 }
 
 forall(otype T) void ^?{}(stack(T)* s) {
-        stack_node(T)* next = s->head;
-        while ( next ) {
-                stack_node(T)* crnt = next;
-                next = crnt->next;
-                delete(crnt);
-        }
+        clear(s);
 }
 
@@ -35 +62 @@
         return x;
 }
+
+forall(otype T) void clear(stack(T)* s) {
+        stack_node(T)* next = s->head;
+        while ( next ) {
+                stack_node(T)* crnt = next;
+                next = crnt->next;
+                delete(crnt);
+        }
+        s->head = 0;
+}