static inline bool type_can_have_subvars (const_tree);
/* Pool of variable info structures. */
-static alloc_pool variable_info_pool;
+static pool_allocator<variable_info> variable_info_pool
+ ("Variable info pool", 30);
/* Map varinfo to final pt_solution. */
static hash_map<varinfo_t, pt_solution *> *final_solutions;
new_var_info (tree t, const char *name)
{
unsigned index = varmap.length ();
- varinfo_t ret = (varinfo_t) pool_alloc (variable_info_pool);
+ varinfo_t ret = variable_info_pool.allocate ();
ret->id = index;
ret->name = name;
/* List of constraints that we use to build the constraint graph from. */
static vec<constraint_t> constraints;
-static alloc_pool constraint_pool;
+static pool_allocator<constraint> constraint_pool ("Constraint pool", 30);
/* The constraint graph is represented as an array of bitmaps
containing successor nodes. */
new_constraint (const struct constraint_expr lhs,
const struct constraint_expr rhs)
{
- constraint_t ret = (constraint_t) pool_alloc (constraint_pool);
+ constraint_t ret = constraint_pool.allocate ();
ret->lhs = lhs;
ret->rhs = rhs;
return ret;
bitmap_obstack_initialize (&oldpta_obstack);
bitmap_obstack_initialize (&predbitmap_obstack);
- constraint_pool = create_alloc_pool ("Constraint pool",
- sizeof (struct constraint), 30);
- variable_info_pool = create_alloc_pool ("Variable info pool",
- sizeof (struct variable_info), 30);
constraints.create (8);
varmap.create (8);
vi_for_tree = new hash_map<tree, varinfo_t>;
free (graph);
varmap.release ();
- free_alloc_pool (variable_info_pool);
- free_alloc_pool (constraint_pool);
+ variable_info_pool.release ();
+ constraint_pool.release ();
obstack_free (&fake_var_decl_obstack, NULL);