tests: update test programs

Author: nickwanninger

test/thread_stress.c

@@ -6,25 +6,25 @@
 
 
 #define MAX_SIZE 512
-#define ARRAY_LENGTH (4096 * 1024 * 2)
+#define ARRAY_LENGTH (4096 * 1024)
 void *objects[ARRAY_LENGTH];
 
 extern void alaska_dump(void);
 
 
 int main() {
-  for (int run = 0; run < 25; run++) {
+  for (int run = 0; run < 5000; run++) {
     printf("Allocate...\n");
     unsigned int seed = 0;
 
 
 #pragma omp parallel for shared(objects) private(seed)
     for (int i = 0; i < ARRAY_LENGTH; i++) {
-      objects[i] = malloc(rand_r(&seed) % MAX_SIZE);
-      // objects[i] = malloc(256);
+      // objects[i] = malloc(rand_r(&seed) % MAX_SIZE);
+      objects[i] = malloc(32);
     }
 
-    // alaska_dump();
+    alaska_dump();
 
     printf("Free...\n");
 #pragma omp parallel for shared(objects)
@@ -35,6 +35,8 @@ int main() {
 
 
     memset(objects, 0, sizeof(objects));
+
+    alaska_dump();
   }
 
   return 0;

test/tree.c

@@ -20,20 +20,31 @@ node_t *make_tree(int depth) {
 }
 
 
+void free_tree(node_t *n) {
+  if (n == NULL) return;
+
+  free_tree(n->left);
+  free_tree(n->right);
+  free(n);
+}
+
+
 int tree_count_nodes(node_t *n) {
   if (n == NULL) return 0;
   return 1 + tree_count_nodes(n->left) + tree_count_nodes(n->right);
 }
 
 int main() {
-  node_t *n = make_tree(23);
 
 
   while (1) {
+    node_t *n = make_tree(23);
+    int c = 0;
     for (int i = 0; i < 512; i++) {
-      int c = tree_count_nodes(n);
+      c += tree_count_nodes(n);
     }
-    // printf("Node count: %d\n", c);
+    printf("Node count: %d\n", c);
+    free_tree(n);
   }
 
   return EXIT_SUCCESS;