Commit 7be7d292 by Eric Botcazou Committed by Eric Botcazou

* alias.c (get_alias_set): Fix formatting issues.

From-SVN: r162426
parent 980a0501
2010-07-22 Eric Botcazou <ebotcazou@adacore.com>
* alias.c (get_alias_set): Fix formatting issues.
2010-07-22 Steve Ellcey <sje@cup.hp.com> 2010-07-22 Steve Ellcey <sje@cup.hp.com>
PR middle-end/44878 PR middle-end/44878
......
...@@ -688,9 +688,9 @@ get_alias_set (tree t) ...@@ -688,9 +688,9 @@ get_alias_set (tree t)
conversion embedded treat it like a VIEW_CONVERT_EXPR above, conversion embedded treat it like a VIEW_CONVERT_EXPR above,
using the memory access type for determining the alias-set. */ using the memory access type for determining the alias-set. */
if (TREE_CODE (inner) == MEM_REF if (TREE_CODE (inner) == MEM_REF
&& (TYPE_MAIN_VARIANT (TREE_TYPE (inner)) && TYPE_MAIN_VARIANT (TREE_TYPE (inner))
!= TYPE_MAIN_VARIANT != TYPE_MAIN_VARIANT
(TREE_TYPE (TREE_TYPE (TREE_OPERAND (inner, 1)))))) (TREE_TYPE (TREE_TYPE (TREE_OPERAND (inner, 1)))))
return get_deref_alias_set (TREE_OPERAND (inner, 1)); return get_deref_alias_set (TREE_OPERAND (inner, 1));
/* Otherwise, pick up the outermost object that we could have a pointer /* Otherwise, pick up the outermost object that we could have a pointer
...@@ -728,10 +728,13 @@ get_alias_set (tree t) ...@@ -728,10 +728,13 @@ get_alias_set (tree t)
return set; return set;
return 0; return 0;
} }
t = TYPE_CANONICAL (t); t = TYPE_CANONICAL (t);
/* Canonical types shouldn't form a tree nor should the canonical /* Canonical types shouldn't form a tree nor should the canonical
type require structural equality checks. */ type require structural equality checks. */
gcc_checking_assert (!TYPE_STRUCTURAL_EQUALITY_P (t) && TYPE_CANONICAL (t) == t); gcc_checking_assert (TYPE_CANONICAL (t) == t
&& !TYPE_STRUCTURAL_EQUALITY_P (t));
/* If this is a type with a known alias set, return it. */ /* If this is a type with a known alias set, return it. */
if (TYPE_ALIAS_SET_KNOWN_P (t)) if (TYPE_ALIAS_SET_KNOWN_P (t))
...@@ -757,8 +760,7 @@ get_alias_set (tree t) ...@@ -757,8 +760,7 @@ get_alias_set (tree t)
/* There are no objects of FUNCTION_TYPE, so there's no point in /* There are no objects of FUNCTION_TYPE, so there's no point in
using up an alias set for them. (There are, of course, pointers using up an alias set for them. (There are, of course, pointers
and references to functions, but that's different.) */ and references to functions, but that's different.) */
else if (TREE_CODE (t) == FUNCTION_TYPE else if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
|| TREE_CODE (t) == METHOD_TYPE)
set = 0; set = 0;
/* Unless the language specifies otherwise, let vector types alias /* Unless the language specifies otherwise, let vector types alias
...@@ -776,18 +778,17 @@ get_alias_set (tree t) ...@@ -776,18 +778,17 @@ get_alias_set (tree t)
integer(kind=4)[4] the same alias set or not. integer(kind=4)[4] the same alias set or not.
Just be pragmatic here and make sure the array and its element Just be pragmatic here and make sure the array and its element
type get the same alias set assigned. */ type get the same alias set assigned. */
else if (TREE_CODE (t) == ARRAY_TYPE else if (TREE_CODE (t) == ARRAY_TYPE && !TYPE_NONALIASED_COMPONENT (t))
&& !TYPE_NONALIASED_COMPONENT (t))
set = get_alias_set (TREE_TYPE (t)); set = get_alias_set (TREE_TYPE (t));
else
/* Otherwise make a new alias set for this type. */ /* Otherwise make a new alias set for this type. */
else
set = new_alias_set (); set = new_alias_set ();
TYPE_ALIAS_SET (t) = set; TYPE_ALIAS_SET (t) = set;
/* If this is an aggregate type, we must record any component aliasing /* If this is an aggregate type or a complex type, we must record any
information. */ component aliasing information. */
if (AGGREGATE_TYPE_P (t) || TREE_CODE (t) == COMPLEX_TYPE) if (AGGREGATE_TYPE_P (t) || TREE_CODE (t) == COMPLEX_TYPE)
record_component_aliases (t); record_component_aliases (t);
......
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