OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Change use to type-based pool allocator in

Browse Source 
* df-problems.c (df_chain_create):Use new type-based pool allocator.
	(df_chain_unlink_1) Likewise.
	(df_chain_unlink) Likewise.
	(df_chain_remove_problem) Likewise.
	(df_chain_alloc) Likewise.
	(df_chain_free) Likewise.
	* df.h (struct dataflow) Likewise.

From-SVN: r223953
This commit is contained in:
Martin Liska 2015-06-01 14:40:47 +02:00 committed by Martin Liska
parent a78a26f11e
commit 295e704728
3 changed files with 18 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
gcc/ChangeLog
View File

@ -1,3 +1,13 @@
2015-06-01 Martin Liska <mliska@suse.cz>
* df-problems.c (df_chain_create):Use new type-based pool allocator.
(df_chain_unlink_1) Likewise.
(df_chain_unlink) Likewise.
(df_chain_remove_problem) Likewise.
(df_chain_alloc) Likewise.
(df_chain_free) Likewise.
* df.h (struct dataflow) Likewise.
2015-06-01 Martin Liska <mliska@suse.cz> 2015-06-01 Martin Liska <mliska@suse.cz>
* cselib.c (new_elt_list):Use new type-based pool allocator. * cselib.c (new_elt_list):Use new type-based pool allocator.

14
gcc/df-problems.c
View File

@ -1879,7 +1879,7 @@ struct df_link *
df_chain_create (df_ref src, df_ref dst) df_chain_create (df_ref src, df_ref dst)
{ {
struct df_link *head = DF_REF_CHAIN (src); struct df_link *head = DF_REF_CHAIN (src);
struct df_link *link = (struct df_link *) pool_alloc (df_chain->block_pool); struct df_link *link = df_chain->block_pool->allocate ();
DF_REF_CHAIN (src) = link; DF_REF_CHAIN (src) = link;
link->next = head; link->next = head;
@ -1904,7 +1904,7 @@ df_chain_unlink_1 (df_ref ref, df_ref target)
prev->next = chain->next; prev->next = chain->next;
else else
DF_REF_CHAIN (ref) = chain->next; DF_REF_CHAIN (ref) = chain->next;
pool_free (df_chain->block_pool, chain); df_chain->block_pool->remove (chain);
return; return;
} }
prev = chain; prev = chain;
@ -1924,7 +1924,7 @@ df_chain_unlink (df_ref ref)
struct df_link *next = chain->next; struct df_link *next = chain->next;
/* Delete the other side if it exists. */ /* Delete the other side if it exists. */
df_chain_unlink_1 (chain->ref, ref); df_chain_unlink_1 (chain->ref, ref);
pool_free (df_chain->block_pool, chain); df_chain->block_pool->remove (chain);
chain = next; chain = next;
} }
DF_REF_CHAIN (ref) = NULL; DF_REF_CHAIN (ref) = NULL;
@ -1956,7 +1956,7 @@ df_chain_remove_problem (void)
/* Wholesale destruction of the old chains. */ /* Wholesale destruction of the old chains. */
if (df_chain->block_pool) if (df_chain->block_pool)
free_alloc_pool (df_chain->block_pool); delete df_chain->block_pool;
EXECUTE_IF_SET_IN_BITMAP (df_chain->out_of_date_transfer_functions, 0, bb_index, bi) EXECUTE_IF_SET_IN_BITMAP (df_chain->out_of_date_transfer_functions, 0, bb_index, bi)
{ {
@ -2010,8 +2010,8 @@ static void
df_chain_alloc (bitmap all_blocks ATTRIBUTE_UNUSED) df_chain_alloc (bitmap all_blocks ATTRIBUTE_UNUSED)
{ {
df_chain_remove_problem (); df_chain_remove_problem ();
df_chain->block_pool = create_alloc_pool ("df_chain_block pool", df_chain->block_pool = new pool_allocator<df_link> ("df_chain_block pool",
sizeof (struct df_link), 50); 50);
df_chain->optional_p = true; df_chain->optional_p = true;
} }
@ -2146,7 +2146,7 @@ df_chain_finalize (bitmap all_blocks)
static void static void
df_chain_free (void) df_chain_free (void)
{ {
free_alloc_pool (df_chain->block_pool); delete df_chain->block_pool;
BITMAP_FREE (df_chain->out_of_date_transfer_functions); BITMAP_FREE (df_chain->out_of_date_transfer_functions);
free (df_chain); free (df_chain);
} }

2
gcc/df.h
View File

@ -305,7 +305,7 @@ struct dataflow
unsigned int block_info_size; unsigned int block_info_size;
/* The pool to allocate the block_info from. */ /* The pool to allocate the block_info from. */
alloc_pool block_pool; pool_allocator<df_link> *block_pool;
/* The lr and live problems have their transfer functions recomputed /* The lr and live problems have their transfer functions recomputed
only if necessary. This is possible for them because, the only if necessary. This is possible for them because, the