Commit 96339268 by Richard Earnshaw Committed by Richard Earnshaw

arm.h (DATA_ALIGNMENT): Align structures, unions and arrays to a word boundary.

	* arm.h (DATA_ALIGNMENT): Align structures, unions and arrays to
	a word boundary.
	(LOCAL_ALIGNMENT): Similarly.

From-SVN: r143566
parent 442dc742
2009-01-22 Richard Earnshaw <rearnsha@arm.com>
* arm.h (DATA_ALIGNMENT): Align structures, unions and arrays to
a word boundary.
(LOCAL_ALIGNMENT): Similarly.
2009-01-22 Mark Shinwell <shinwell@codesourcery.com> 2009-01-22 Mark Shinwell <shinwell@codesourcery.com>
Joseph Myers <joseph@codesourcery.com> Joseph Myers <joseph@codesourcery.com>
......
...@@ -564,6 +564,19 @@ extern int arm_arch_hwdiv; ...@@ -564,6 +564,19 @@ extern int arm_arch_hwdiv;
&& (ALIGN) < BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR) \ && (ALIGN) < BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR) \
? BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR : (ALIGN)) ? BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR : (ALIGN))
/* Align definitions of arrays, unions and structures so that
initializations and copies can be made more efficient. This is not
ABI-changing, so it only affects places where we can see the
definition. */
#define DATA_ALIGNMENT(EXP, ALIGN) \
((((ALIGN) < BITS_PER_WORD) \
&& (TREE_CODE (EXP) == ARRAY_TYPE \
|| TREE_CODE (EXP) == UNION_TYPE \
|| TREE_CODE (EXP) == RECORD_TYPE)) ? BITS_PER_WORD : (ALIGN))
/* Similarly, make sure that objects on the stack are sensibly aligned. */
#define LOCAL_ALIGNMENT(EXP, ALIGN) DATA_ALIGNMENT(EXP, ALIGN)
/* Setting STRUCTURE_SIZE_BOUNDARY to 32 produces more efficient code, but the /* Setting STRUCTURE_SIZE_BOUNDARY to 32 produces more efficient code, but the
value set in previous versions of this toolchain was 8, which produces more value set in previous versions of this toolchain was 8, which produces more
compact structures. The command line option -mstructure_size_boundary=<n> compact structures. The command line option -mstructure_size_boundary=<n>
......
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