Changeset 7b1f6d4 for tests

Timestamp:

Dec 21, 2020, 1:55:24 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

3d19ae6, d411769c

Parents:

5d369c7 (diff), 276a94d7 (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

Location:

tests

Files:

• .expect/locks.txt (added)
• .expect/queue.txt (modified) (1 diff)
• .expect/sequence.txt (modified) (1 diff)
• .expect/stack.txt (modified) (1 diff)
• .expect/timeout_lock.txt (added)
• collections/multi_list.cfa (moved) (moved from tests/multi_list.cfa )
• collections/queue.cfa (moved) (moved from tests/queue.cfa ) (3 diffs)
• collections/sequence.cfa (moved) (moved from tests/sequence.cfa ) (1 diff)
• collections/stack.cfa (moved) (moved from tests/stack.cfa ) (1 diff)
• unified_locking/locks.cfa (moved) (moved from tests/locks.cfa ) (2 diffs)
• unified_locking/timeout_lock.cfa (added)

tests/.expect/queue.txt

@@ -1 +1 @@
 empty
+0
+18
 0 2 4 6 8 10 12 14 16 18 
 18 
-18 1 3 5 7 9 11 13 15 17 19 
+18
+18 1 3 5 7 9 11 13 15 17 
+0 1 2 3 4 5 6 7 8 9 
+6 7 8 9 
+0 1 2 3 4 5 
+6 7 8 9 0 1 2 3 4 5 
 empty
 0 0 2 2 4 4 6 6 8 8 10 10 12 12 14 14 16 16 18 18 

tests/.expect/sequence.txt

@@ -4 +4 @@
 18 1 3 5 7 9 11 13 15 17 19 
 18 1 
+0 1 2 3 4 5 6 7 8 9 
+9
+9 8 7 6 5 4 3 1 -2 0 
+4 3 1 -2 0 
+9 8 7 6 5 
+4 3 1 -2 0 9 8 7 6 5 
 empty
 0 0 2 2 4 4 6 6 8 8 10 10 12 12 14 14 16 16 18 18 

tests/.expect/stack.txt

@@ -1 +1 @@
 empty
 18 16 14 12 10 8 6 4 2 0 
+18
 0 
 19 17 15 13 11 9 7 5 3 1 0 

tests/collections/queue.cfa

@@ -33 +33 @@
         }
 
+        sout | head(fred).i | nl;
+        sout | tail(fred).i | nl;
+
         for ( QueueIter(Fred) iter = { fred }; iter >> f; ) {
                 sout | f.i | ' ';
@@ -50 +53 @@
                 add( fred, *new( 2 * i + 1 ) );
         }
+
+        Fred * front = new( -1 );
+        addHead( fred, *front );
+        sout | succ( fred, front )->i | nl;
+        remove( fred, *front );
+        delete( front );
+
+        Fred & end = dropTail( fred );
+        delete( &end );
+
         for ( over( fredIter, fred ); fredIter >> f; ) {
                 sout | f.i | ' ';
@@ -56 +69 @@
 
         for ( over( fredIter, fred ); fredIter >> f; ) {
+                delete( &f );
+        }
+
+        Queue(Fred) fred0;
+        Fred * middle;
+        for ( i; 10 ) {
+                if( i == 5) {
+                        middle = new( i );
+                        add( fred0, *middle );
+                        continue;
+                }
+                add( fred0, *new( i ) );
+        }
+
+        for ( QueueIter(Fred) iter = { fred0 }; iter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        Queue(Fred) fred2;
+
+        split( fred2, fred0, *middle);
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        for ( over( fredIter, fred2 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        transfer( fred0, fred2);
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
                 delete( &f );
         }

tests/collections/sequence.cfa

@@ -69 +69 @@
 
         for ( over( fredIter, fred ); fredIter >> f; ) {
+                delete( &f );
+        }
+
+        Sequence(Fred) fred0;
+        Fred * middle;
+        for ( i; 10 ) {
+                if( i == 5) {
+                        middle = new( i );
+                        addHead( fred0, *middle );
+                        continue;
+                }
+                addHead( fred0, *new( i ) );
+        }
+
+        for ( SeqIterRev(Fred) iter = { fred0 }; iter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        Fred * front = new( -1 );
+        insertBef( fred0, *front, tail(fred0));
+        insertAft( fred0, *front, *new( -2 ) );
+        remove( fred0, *front );
+        delete( front );
+
+        sout | head(fred0).i | nl;
+        Fred & end = dropTail( fred );
+        delete( &end );
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        Sequence(Fred) fred2;
+
+        split( fred2, fred0, *middle);
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        for ( over( fredIter, fred2 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        transfer( fred0, fred2);
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
+                sout | f.i | ' ';
+        }
+        sout | nl;
+
+        for ( over( fredIter, fred0 ); fredIter >> f; ) {
                 delete( &f );
         }

tests/collections/stack.cfa

@@ -37 +37 @@
         }
         sout | nl;
+
+        sout | head(fred).i | nl;
         
         for ( i; 9 ) {

tests/unified_locking/locks.cfa

@@ -1 +1 @@
 #include <stdio.h>
 #include "locks.hfa"
-
-#include "kernel_private.hfa"
-#include <stdlib.h>
-
-#include <kernel.hfa>
 #include <stdlib.hfa>
 #include <thread.hfa>
@@ -224 +219 @@
 int main() {
         processor p[2];
+        wait( c_s, 1`ns );
         printf("Start Test 1: multi acquisition lock and condition variable single wait/notify\n");
         {