# HG changeset patch
# User Joseph Arceneaux <jla@gnu.org>
# Date 719104329 0
# Node ID 6097878fbd4664dacec851908f0972db278f2fdf
# Parent  0b98dbec073803b7d99a205e421c13b0a84ff6e8
	* intervals.c (traverse_intervals): New parameter `depth'.
	Increment this when passing recursively.

diff -r 0b98dbec0738 -r 6097878fbd46 src/intervals.c
--- a/src/intervals.c	Wed Oct 14 23:10:56 1992 +0000
+++ b/src/intervals.c	Wed Oct 14 23:12:09 1992 +0000
@@ -173,29 +173,25 @@
 static int idepth;
 static int zero_length;
 
-static int depth;
-
 /* Traverse an interval tree TREE, performing FUNCTION on each node.
 
    Perhaps we should pass the depth as an argument. */
 
 void
-traverse_intervals (tree, position, function)
+traverse_intervals (tree, position, depth, function)
      INTERVAL tree;
-     int position;
+     int position, depth;
      void (* function) ();
 {
   if (NULL_INTERVAL_P (tree))
     return;
 
-  depth++;
-  traverse_intervals (tree->left, position, function);
+  traverse_intervals (tree->left, position, depth + 1, function);
   position += LEFT_TOTAL_LENGTH (tree);
   tree->position = position;
   (*function) (tree);
   position += LENGTH (tree);
-  traverse_intervals (tree->right, position, function);
-  depth--;
+  traverse_intervals (tree->right, position, depth + 1,  function);
 }
 
 #if 0
@@ -221,7 +217,7 @@
   icount = 0;
   search_interval = i;
   found_interval = NULL_INTERVAL;
-  traverse_intervals (tree, 1, &check_for_interval);
+  traverse_intervals (tree, 1, 0, &check_for_interval);
   return found_interval;
 }
 
@@ -243,7 +239,7 @@
   icount = 0;
   idepth = 0;
   zero_length = 0;
-  traverse_intervals (i, 1, &inc_interval_count);
+  traverse_intervals (i, 1, 0, &inc_interval_count);
 
   return icount;
 }