Changeset bf5a70da for src/examples

Timestamp:

May 18, 2016, 12:36:20 PM (9 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

85951a6

Parents:

f1e42c1

Message:

implemented simple link list test

File:

• src/examples/gc_no_raii/test/badlll.c (modified) (2 diffs)

src/examples/gc_no_raii/test/badlll.c

@@ -15 +15 @@
         int i;
         LLL ll0, lll, llc;
-        ctor(&ll0);
-        ctor(&lll);
-        ctor(&llc);
 
         ll0 = gcmalloc();
@@ -23 +20 @@
         lll = ll0;
 
+        for (i = 1; i < sz; i++)
+        {
+                llc = gcnew<List_t>();
+                llc->val = i;
+                lll->next = llc;
+                lll = llc;
+        }
+
         return ll0;
 }
+
+void testLLL(LLL lll)
+{
+        unsigned char *counted;
+
+        counted = (unsigned char *) calloc(MAX, sizeof(unsigned char));
+        while (lll)
+        {
+                counted[lll->val]++;
+                if (counted[lll->val] > 1)
+                {
+                        fprintf(stderr, "ERROR! Encountered %d twice!\n", lll->val);
+                        exit(1);
+                }
+                lll = lll->next;
+        }
+
+        return;
+}
+
+int main(void)
+{
+        LLL mylll;
+
+        mylll = buildLLL(MAX);
+
+        testLLL(mylll);
+
+        return 0;
+}