* config.gcc (m68020-*-elf*, m68k-*-elf*, m68010-*-netbsdelf*,

[pf3gnuchains/gcc-fork.git] / gcc / et-forest.h

diff --git a/gcc/et-forest.h b/gcc/et-forest.h
index 8ef8e30..f646d59 100644 (file)
--- a/gcc/et-forest.h
+++ b/gcc/et-forest.h
@@ -1,5 +1,5 @@
-/* Et-forest data structure implementation.  
-   Copyright (C) 2002 Free Software Foundation, Inc.
+/* Et-forest data structure implementation.
+   Copyright (C) 2002, 2003 Free Software Foundation, Inc.
 
 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
@@ -15,33 +15,33 @@ You should have received a copy of the GNU General Public License
 along with this program; if not, write to the Free Software
 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
 
-/* This package implements ET forest data structure. Each tree in 
+/* This package implements ET forest data structure. Each tree in
    the structure maintains a tree structure and offers logarithmic time
    for tree operations (insertion and removal of nodes and edges) and
    poly-logarithmic time for nearest common ancestor.
- 
-   ET tree strores its structue as a sequence of symbols obtained 
+
+   ET tree stores its structure as a sequence of symbols obtained
    by dfs(root)
 
-   dfs (node) 
+   dfs (node)
    {
      s = node;
      for each child c of node do
        s = concat (s, c, node);
      return s;
    }
-   
+
    For example for tree
- 
+
             1
           / | \
          2  3  4
        / |
       4  5
- 
+
    the sequence is 1 2 4 2 5 3 1 3 1 4 1.
- 
-   The sequence is stored in a sligtly modified splay tree.
+
+   The sequence is stored in a slightly modified splay tree.
    In order to support various types of node values, a hashtable
    is used to convert node values to the internal representation.  */
 
@@ -58,23 +58,23 @@ extern "C" {
 typedef struct et_forest *et_forest_t;
 typedef struct et_forest_node *et_forest_node_t;
 
-extern et_forest_t et_forest_create PARAMS ((void));
-
-extern void et_forest_delete PARAMS ((et_forest_t));
-
-extern et_forest_node_t et_forest_add_node PARAMS ((et_forest_t, void *));
-extern int et_forest_add_edge PARAMS ((et_forest_t, et_forest_node_t, 
-                                       et_forest_node_t));
-extern void et_forest_remove_node PARAMS ((et_forest_t, et_forest_node_t));
-extern int et_forest_remove_edge PARAMS ((et_forest_t, et_forest_node_t,
-                                          et_forest_node_t));
-extern et_forest_node_t et_forest_parent PARAMS ((et_forest_t, et_forest_node_t));
-extern et_forest_node_t et_forest_common_ancestor PARAMS ((et_forest_t,
-                                                         et_forest_node_t,
-                                                         et_forest_node_t));
-extern void * et_forest_node_value PARAMS ((et_forest_t, et_forest_node_t));
-extern int et_forest_enumerate_sons PARAMS ((et_forest_t, et_forest_node_t,
-                                            et_forest_node_t *));
+extern et_forest_t et_forest_create (void);
+
+extern void et_forest_delete (et_forest_t);
+
+extern et_forest_node_t et_forest_add_node (et_forest_t, void *);
+extern int et_forest_add_edge (et_forest_t, et_forest_node_t,
+                              et_forest_node_t);
+extern void et_forest_remove_node (et_forest_t, et_forest_node_t);
+extern int et_forest_remove_edge (et_forest_t, et_forest_node_t,
+                                 et_forest_node_t);
+extern et_forest_node_t et_forest_parent (et_forest_t, et_forest_node_t);
+extern et_forest_node_t et_forest_common_ancestor (et_forest_t,
+                                                  et_forest_node_t,
+                                                  et_forest_node_t);
+extern void * et_forest_node_value (et_forest_t, et_forest_node_t);
+extern int et_forest_enumerate_sons (et_forest_t, et_forest_node_t,
+                                    et_forest_node_t *);
 
 #ifdef __cplusplus
 }