Commit a0ef884f by Nathan Sidwell Committed by Nathan Sidwell

vec.h: Implement integral type vector specialization.

	* vec.h: Implement integral type vector specialization.
	(VEC_T): Define a non-GTY structure.
	(VEC_T_GTY): Define a GTY structure.
	(VEC_TA): Rename to ...
	(VEC_TA_GTY): ... here.
	(DEF_VEC_I, DEF_VEC_ALLOC_I): New.
	(DEF_VEC_P, DEF_VEC_ALLOC_P): Adjust.
	(DEF_VEC_FUNC_P, DEF_VEC_ALLOC_FUNC_P): New, broken out of
	DEF_VEC_P and DEF_VEC_ALLOC_P.
	(DEF_VEC_O, DEF_VEC_ALLOC_O): Adjust.
	(DEF_VEC_FUNC_O, DEF_VEC_ALLOC_FUNC_O): New, broken out of
	DEF_VEC_O and DEF_VEC_ALLOC_O.
	* global.c: Use DEF_VEC_I, DEF_VEC_ALLOC_I.
	* lambda-code.c: Likewise.
	* tree-into-ssa.c: Likewise.
	* tree-ssa-live.c: Likewise.

From-SVN: r100251
parent 6e3b9e27
2005-05-27 Nathan Sidwell <nathan@codesourcery.com>
* vec.h: Implement integral type vector specialization.
(VEC_T): Define a non-GTY structure.
(VEC_T_GTY): Define a GTY structure.
(VEC_TA): Rename to ...
(VEC_TA_GTY): ... here.
(DEF_VEC_I, DEF_VEC_ALLOC_I): New.
(DEF_VEC_P, DEF_VEC_ALLOC_P): Adjust.
(DEF_VEC_FUNC_P, DEF_VEC_ALLOC_FUNC_P): New, broken out of
DEF_VEC_P and DEF_VEC_ALLOC_P.
(DEF_VEC_O, DEF_VEC_ALLOC_O): Adjust.
(DEF_VEC_FUNC_O, DEF_VEC_ALLOC_FUNC_O): New, broken out of
DEF_VEC_O and DEF_VEC_ALLOC_O.
* global.c: Use DEF_VEC_I, DEF_VEC_ALLOC_I.
* lambda-code.c: Likewise.
* tree-into-ssa.c: Likewise.
* tree-ssa-live.c: Likewise.
2005-05-27 Kazu Hirata <kazu@cs.umass.edu> 2005-05-27 Kazu Hirata <kazu@cs.umass.edu>
* tree-into-ssa.c (update_ssa): Ensure that the operand cache * tree-into-ssa.c (update_ssa): Ensure that the operand cache
......
...@@ -2098,8 +2098,8 @@ mark_reg_change (rtx reg, rtx setter, void *data) ...@@ -2098,8 +2098,8 @@ mark_reg_change (rtx reg, rtx setter, void *data)
/* Classes of registers which could be early clobbered in the current /* Classes of registers which could be early clobbered in the current
insn. */ insn. */
DEF_VEC_P(int); DEF_VEC_I(int);
DEF_VEC_ALLOC_P(int,heap); DEF_VEC_ALLOC_I(int,heap);
static VEC(int,heap) *earlyclobber_regclass; static VEC(int,heap) *earlyclobber_regclass;
......
...@@ -115,8 +115,8 @@ ...@@ -115,8 +115,8 @@
Fourier-Motzkin elimination is used to compute the bounds of the base space Fourier-Motzkin elimination is used to compute the bounds of the base space
of the lattice. */ of the lattice. */
DEF_VEC_P(int); DEF_VEC_I(int);
DEF_VEC_ALLOC_P(int,heap); DEF_VEC_ALLOC_I(int,heap);
static bool perfect_nestify (struct loops *, static bool perfect_nestify (struct loops *,
struct loop *, VEC(tree,heap) *, struct loop *, VEC(tree,heap) *,
......
...@@ -107,8 +107,8 @@ static VEC(tree,heap) *block_defs_stack; ...@@ -107,8 +107,8 @@ static VEC(tree,heap) *block_defs_stack;
/* Basic block vectors used in this file ought to be allocated in the /* Basic block vectors used in this file ought to be allocated in the
heap. We use pointer vector, because ints can be easily passed by heap. We use pointer vector, because ints can be easily passed by
value. */ value. */
DEF_VEC_P(int); DEF_VEC_I(int);
DEF_VEC_ALLOC_P(int,heap); DEF_VEC_ALLOC_I(int,heap);
/* Set of existing SSA names being replaced by update_ssa. */ /* Set of existing SSA names being replaced by update_ssa. */
static sbitmap old_ssa_names; static sbitmap old_ssa_names;
......
...@@ -1281,8 +1281,8 @@ add_conflicts_if_valid (tpa_p tpa, conflict_graph graph, ...@@ -1281,8 +1281,8 @@ add_conflicts_if_valid (tpa_p tpa, conflict_graph graph,
} }
} }
DEF_VEC_P(int); DEF_VEC_I(int);
DEF_VEC_ALLOC_P(int,heap); DEF_VEC_ALLOC_I(int,heap);
/* Return a conflict graph for the information contained in LIVE_INFO. Only /* Return a conflict graph for the information contained in LIVE_INFO. Only
conflicts between items in the same TPA list are added. If optional conflicts between items in the same TPA list are added. If optional
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment