Remove explicit debug prints

diff --git a/planet.c b/planet.c
index e0b8938fcc8d361d57f02c2e45069fdfc0774a12..1880dc6baa40b4be1d1320042654c4a7ac77c797 100644 (file)
--- a/planet.c
+++ b/planet.c
@@ -434,8 +434,6 @@ struct planet *move_planet(struct planet *p, const double time)
                        continue;
                }
 
-               printf("\nMove node %p\n", &p->tree);
-
                tree_parent = quadtree_del(&p->tree, &planet_ops);
                p->tree.pos = new_pos;
                quadtree_add(tree_parent, &p->tree, &planet_ops);
@@ -500,7 +498,6 @@ struct planet *prune_planet_tree(struct planet *p)
 
        if (p->to_be_deleted) {
                list_del(&p->list);
-               printf("Permanently removing node %p\n", &p->tree);
                tree_parent = quadtree_del(&p->tree, &planet_ops);
                free(p);
                return tree_to_planet(tree_parent);

diff --git a/quadtree.c b/quadtree.c
index 2c8df4cf3d7a2bf7a590bbe01d1d2e30bc2cb276..38233c9812189e0768fa1915a4931c1b3aa40e23 100644 (file)
--- a/quadtree.c
+++ b/quadtree.c
@@ -386,9 +386,6 @@ static struct quadtree *quadtree_find_nearest(struct quadtree *tree,
 
        directions = quadrants_to_search(tree, corner);
 
-       printf("Starting from parent %p (%f %f), target (%f %f), %x\n", tree,
-               tree->pos.x, tree->pos.y, pos->x, pos->y, directions);
-
        for (i = 0; i < 4; i++) {
                if (!tree->child[i])
                        continue;
@@ -405,14 +402,10 @@ static struct quadtree *quadtree_find_nearest(struct quadtree *tree,
                vector_sub(pos, &node->pos, &tmp);
                dist = vector_abs(&tmp);
 
-               printf("%p: (%f %f)dist: %f, distance: %f\n",
-                       node, node->pos.x, node->pos.y,
-                       dist, distance);
                if (!nearest || dist < distance) {
                        nearest = node;
                        distance = dist;
 
-                       printf("Choosing nearest\n");
                }
        }
 
@@ -425,7 +418,6 @@ static struct quadtree *quadtree_find_nearest(struct quadtree *tree,
                                corner[1].x, corner[1].y);
                return NULL;
        }
-       printf("%d: Returning %p\n",__LINE__, nearest);
 
        return nearest;
 }
@@ -466,7 +458,6 @@ static struct quadtree *quadtree_find_nearest_noparent(struct quadtree *tree,
 
                        vector_sub(pos, &nearest->pos, &sub);
                        dist = vector_abs(&sub);
-                       printf("Setting nearest from %d\n", i);
                        continue;
                }
                node = quadtree_find_nearest(tree->child[i],
@@ -482,11 +473,9 @@ static struct quadtree *quadtree_find_nearest_noparent(struct quadtree *tree,
                        nearest = node;
                        dist = dist2;
                }
-               printf("Re-setting nearest from %d\n", i);
        }
 
 out:
-       printf("%d: Returning %p\n", __LINE__, nearest);
        return nearest;
 }