From 973a9ca4e334b5270caebc099c053eec69983476 Mon Sep 17 00:00:00 2001 From: Michael Beck Date: Mon, 20 Oct 2008 19:58:45 +0000 Subject: [PATCH] - put freed edges into a free-list, reducing memory count used for edges [r23051] --- ir/ir/irtypes.h | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/ir/ir/irtypes.h b/ir/ir/irtypes.h index e253edad8..79a27197d 100644 --- a/ir/ir/irtypes.h +++ b/ir/ir/irtypes.h @@ -382,10 +382,11 @@ struct ir_node { * Edge info to put into an irg. */ typedef struct _irg_edge_info_t { - ir_edgeset_t edges; - struct obstack edges_obst; - unsigned allocated : 1; - unsigned activated : 1; /**< set if edges are activated for the graph. */ + ir_edgeset_t edges; /**< A set containing all edges of the current graph. */ + struct list_head free_edges; /**< list of all free edges. */ + struct obstack edges_obst; /**< Obstack, where edges are allocated on. */ + unsigned allocated : 1; /**< Set if edges are allocated on the obstack. */ + unsigned activated : 1; /**< Set if edges are activated for the graph. */ } irg_edge_info_t; typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST]; @@ -507,7 +508,7 @@ struct ir_graph { #endif #ifndef NDEBUG - ir_resources_t reserved_resources; + ir_resources_t reserved_resources;/**< Bitset for tracking used resources. */ #endif }; -- 2.20.1