remove more useless typedefs

gcc/c-family/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* c-ada-spec.h, c-common.c, c-common.h, c-format.c, c-format.h,
	c-objc.h, c-ppoutput.c, c-pragma.c, c-pragma.h: Remove useless
 typedefs.

gcc/c/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* c-aux-info.c, c-parser.c, c-tree.h: Remove useless typedefs.

gcc/cp/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* call.c, class.c, cp-tree.h, decl.c, except.c, mangle.c,
	method.c, name-lookup.h, parser.c, parser.h, rtti.c,
	semantics.c, typeck2.c: Remove useless typedefs.

gcc/fortran/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* dependency.c, dependency.h, gfortran.h, io.c, module.c,
	parse.h, resolve.c, trans-types.h, trans.h: remove useless
typedefs.

gcc/lto/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* lto.h: Remove useless typedefs.

gcc/objc/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* objc-act.h, objc-next-runtime-abi-02.c, objc-runtime-hooks.h:
	Remove useless typedefs.

gcc/ChangeLog:

2015-08-18  Trevor Saunders  <tbsaunde@tbsaunde.org>

	* bb-reorder.c, cfgloop.h, collect2.c, combine.c, dse.c,
	dwarf2cfi.c, gcse-common.h, genopinit.c, ggc-page.c, machmode.h,
	mcf.c, modulo-sched.c, omp-low.c, read-rtl.c, sched-rgn.c,
	signop.h, tree-call-cdce.c, tree-dfa.c, tree-diagnostic.c,
	tree-inline.h, tree-scalar-evolution.c, tree-ssa-address.c,
	tree-ssa-loop-niter.c, tree-ssa-loop.h, tree-ssa-pre.c,
	tree-ssa-reassoc.c, tree-ssa-sccvn.h, tree-ssa-structalias.c,
	tree-ssa-uninit.c, tree-ssa.h, tree-vect-loop-manip.c,
	tree-vectorizer.h, tree-vrp.c, var-tracking.c: Remove useless
typedefs.

From-SVN: r227001

1 files changed, 12 insertions, 12 deletions

diff --git a/gcc/mcf.c b/gcc/mcf.c
index 6c2b87b4e68..121a334b026 100644
--- a/gcc/mcf.c
+++ b/gcc/mcf.c
@@ -61,7 +61,7 @@ along with GCC; see the file COPYING3.  If not see
 /* Limit the number of iterations for cancel_negative_cycles() to ensure
    reasonable compile time.  */
 #define MAX_ITER(n, e)  10 + (1000000 / ((n) * (e)))
-typedef enum
+enum edge_type
 {
   INVALID_EDGE,
   VERTEX_SPLIT_EDGE,	    /* Edge to represent vertex with w(e) = w(v).  */
@@ -72,10 +72,10 @@ typedef enum
   BALANCE_EDGE,		    /* Edge connecting with source/sink: cp(e) = 0.  */
   REDIRECT_NORMALIZED_EDGE, /* Normalized edge for a redirect edge.  */
   REVERSE_NORMALIZED_EDGE   /* Normalized edge for a reverse edge.  */
-} edge_type;
+};
 
 /* Structure to represent an edge in the fixup graph.  */
-typedef struct fixup_edge_d
+struct fixup_edge_type
 {
   int src;
   int dest;
@@ -91,21 +91,21 @@ typedef struct fixup_edge_d
   gcov_type weight;
   gcov_type cost;
   gcov_type max_capacity;
-} fixup_edge_type;
+};
 
 typedef fixup_edge_type *fixup_edge_p;
 
 
 /* Structure to represent a vertex in the fixup graph.  */
-typedef struct fixup_vertex_d
+struct fixup_vertex_type
 {
   vec<fixup_edge_p> succ_edges;
-} fixup_vertex_type;
+};
 
 typedef fixup_vertex_type *fixup_vertex_p;
 
 /* Fixup graph used in the MCF algorithm.  */
-typedef struct fixup_graph_d
+struct fixup_graph_type
 {
   /* Current number of vertices for the graph.  */
   int num_vertices;
@@ -119,18 +119,18 @@ typedef struct fixup_graph_d
   fixup_vertex_p vertex_list;
   /* Fixup edge list.  */
   fixup_edge_p edge_list;
-} fixup_graph_type;
+};
 
-typedef struct queue_d
+struct queue_type
 {
   int *queue;
   int head;
   int tail;
   int size;
-} queue_type;
+};
 
 /* Structure used in the maximal flow routines to find augmenting path.  */
-typedef struct augmenting_path_d
+struct augmenting_path_type
 {
   /* Queue used to hold vertex indices.  */
   queue_type queue_list;
@@ -138,7 +138,7 @@ typedef struct augmenting_path_d
   int *bb_pred;
   /* Vector that indicates if basic block i has been visited.  */
   int *is_visited;
-} augmenting_path_type;
+};
 
 
 /* Function definitions.  */