Fix typos: datastructure -> data structure.

include/libfirm/adt/pdeq.h

@@ -18,7 +18,7 @@
 /**
  * @ingroup adt
  * @defgroup pdeq Double Ended Queue
- * Implementation if a double ended queue datastructure for generic pointers
+ * Implementation if a double ended queue data structure for generic pointers
  * @{
  */
 

include/libfirm/adt/pqueue.h

@@ -21,7 +21,7 @@
  * @ingroup adt
  * @defgroup pqueue  Priority Queue
  * A priority queue.
- * Implementation based on a heap datastructure
+ * Implementation based on a heap data structure
  * @{
  */
 

include/libfirm/adt/set.h

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief       hashset: datastructure containing objects accessible by their key
+ * @brief       hashset: data structure containing objects accessible by their key
  * @author      Markus Armbruster
  */
 #ifndef FIRM_ADT_SET_H

include/libfirm/cgana.h

@@ -36,7 +36,7 @@
  *  variable, the array contains the unknown_entity. (See
  *  set_Call_callee()). cgana() returns the set of 'free' methods, i.e.,
  *  the methods that can be called from external or via function
- *  pointers.  This datastructure must be freed with 'xfree()' by the
+ *  pointers.  This data structure must be freed with 'xfree()' by the
  *  caller of cgana().
  *
  *  cgana() sets the callee_info_state of each graph and the program to

include/libfirm/firm.h

@@ -61,7 +61,7 @@
 
 /** @defgroup printing Printing and Visualisation
  * This module contains functions for printing and visualizing libfirm
- * datastructures like programs, graphs and nodes for humans.
+ * data structures like programs, graphs and nodes for humans.
  */
 #ifndef FIRM_COMMON_FIRM_H
 #define FIRM_COMMON_FIRM_H

include/libfirm/firm_common.h

@@ -42,7 +42,7 @@ FIRM_API const char *ir_get_version_build(void);
 
 /**
  * A list of firm kinds.
- * Most important datastructures in firm contain a firm_kind field at the
+ * Most important data structures in firm contain a firm_kind field at the
  * beginning so given void* pointer you can usually still guess the kind
  * of thing the pointer points to.
  * This is used in debug helper functions and printers.

include/libfirm/firm_types.h

@@ -16,9 +16,9 @@
 /**
  * @page visited_counters Visited Counters
  * A visited counter is an alternative to a visited flag for elements of a
- * graph datastructure.
+ * graph data structure.
  * A visited counter is an integer number added to the elements of a graph.
- * There is also a global reference number for the whole datastructure. It is
+ * There is also a global reference number for the whole data structure. It is
  * now possible to mark nodes by setting their visited counter to the global
  * reference counter. Testing is done by comparing with the global reference
  * counter.

include/libfirm/irloop.h

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief    Loop datastructure and access functions.
+ * @brief    Loop data structure and access functions.
  * @author   Goetz Lindenmaier
  * @date     7.2002
  * @brief

include/libfirm/irnode.h

@@ -474,8 +474,8 @@ FIRM_API const char *gdb_node_helper(const void *firm_object);
  */
 
 /**
- * Creates a new switch_table datastructure with @p n_entries entries.
- * The datastructure is allocated on the obstack of @p irg.
+ * Creates a new switch_table data structure with @p n_entries entries.
+ * The data structure is allocated on the obstack of @p irg.
  */
 FIRM_API ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries);
 

include/libfirm/iroptimize.h

@@ -462,7 +462,7 @@ FIRM_API void garbage_collect_entities(void);
  *
  *  Dead_node_elimination is only performed if options `optimize' and
  *  `opt_dead_node_elimination' are set.  The graph may
- *  not be in state phase_building.  The outs datastructure is freed,
+ *  not be in state phase_building.  The outs data structure is freed,
  *  the outs state set to outs_none.  Backedge information is conserved.
  *  Removes old attributes of nodes.  Sets link field to NULL.
  *  Callee information must be freed (irg_callee_info_none).

include/libfirm/irouts.h

@@ -77,7 +77,7 @@ FIRM_API void compute_irg_outs(ir_graph *irg);
 /** Recomputes out edges if necessary */
 FIRM_API void assure_irg_outs(ir_graph *irg);
 
-/** Frees memory occupied by out edges datastructures */
+/** Frees memory occupied by out edges data structures */
 FIRM_API void free_irg_outs(ir_graph *irg);
 
 /** @} */

include/libfirm/typerep.h

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief Declarations for functions and datastructures to represent types
+ * @brief Declarations for functions and data structures to represent types
  */
 #ifndef FIRM_TYPEREP_H
 #define FIRM_TYPEREP_H
@@ -719,7 +719,7 @@ ENUM_BITSET(ptr_access_kind)
  *
  *  Datastructure to hold type information.
  *
- *  This module supplies a datastructure to represent all types
+ *  This module supplies a data structure to represent all types
  *  known in the compiled program.  This includes types specified
  *  in the program as well as types defined by the language.  In the
  *  view of the intermediate representation there is no difference

ir/adt/pqueue.c

@@ -20,7 +20,7 @@
  * changes and don't think that the left child of 0 is 0 :-/)
  *
  * @author  Christian Wuerdig, Matthias Braun
- * @brief   Priority Queue implementation based on the heap datastructure
+ * @brief   Priority Queue implementation based on the heap data structure
  */
 #include "pqueue.h"
 

ir/ana/cgana.c

@@ -83,7 +83,7 @@ void cg_remove_call_callee_arr(ir_node *node)
 
 
 /*--------------------------------------------------------------------------*/
-/* Initialize datastructures, remove unwanted constructs, optimize          */
+/* Initialize data structures, remove unwanted constructs, optimize         */
 /* call target computations.                                                */
 /*--------------------------------------------------------------------------*/
 
@@ -441,7 +441,7 @@ static void add_method_address(ir_entity *ent, pset *set)
  * returns a list of 'free' methods, i.e., the methods that can be called
  * from external or via function pointers.
  *
- * the datastructures for sel_methods must be constructed before calling
+ * the data structures for sel_methods must be constructed before calling
  * get_free_methods().
  */
 static size_t get_free_methods(ir_entity ***free_methods)

ir/ana/ircfscc.c

@@ -6,7 +6,7 @@
 /**
  * @file
  * @brief     Compute the strongly connected regions and build backedge/cfloop
- *            datastructures. A variation on the Tarjan algorithm. See also
+ *            data structures. A variation on the Tarjan algorithm. See also
  *            [Trapp:99], Chapter 5.2.1.2.
  * @author    Goetz Lindenmaier
  * @date      7.2002
@@ -220,7 +220,7 @@ static inline void pop_scc_unmark_visit(ir_node *n)
 }
 
 /**********************************************************************/
-/* The loop datastructure.                                           **/
+/* The loop data structure.                                          **/
 /**********************************************************************/
 
 /**

ir/ana/irdom_t.h

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief    Construct and access dominator tree -- private datastructures.
+ * @brief    Construct and access dominator tree -- private data structures.
  * @author   Goetz Lindenmaier
  * @date     2.2002
  */

ir/ana/irloop.c

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief    Loop datastructure and access functions -- private stuff.
+ * @brief    Loop data structure and access functions -- private stuff.
  * @author   Goetz Lindenmaier
  * @date     7.2002
  */

ir/ana/irloop_t.h

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief    Loop datastructure and access functions -- private stuff.
+ * @brief    Loop data structure and access functions -- private stuff.
  * @author   Goetz Lindenmaier
  * @date     7.2002
  */

ir/ana/irouts.c

@@ -208,7 +208,7 @@ void irg_out_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
 }
 
 /*--------------------------------------------------------------------*/
-/** Building and Removing the out datastructure                      **/
+/** Building and Removing the out data structure                     **/
 /**                                                                  **/
 /** The outs of a graph are allocated in a single, large array.      **/
 /** This allows to allocate and deallocate the memory for the outs   **/

ir/be/bedump.c

@@ -5,7 +5,7 @@
 
 /**
  * @file
- * @brief       Code for dumping backend datastructures (i.e. interference graphs)
+ * @brief       Code for dumping backend data structures (i.e. interference graphs)
  * @author      Matthias Braun
  */
 #include "bedump.h"