/* SSA operands management for trees.
- Copyright (C) 2003 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
This file is part of GCC.
#include "tree-pass.h"
#include "ggc.h"
#include "timevar.h"
+#include "toplev.h"
-/* Flags to describe operand properties in get_stmt_operands and helpers. */
+#include "langhooks.h"
+
+/* This file contains the code required to manage the operands cache of the
+ SSA optimizer. For every stmt, we maintain an operand cache in the stmt
+ annotation. This cache contains operands that will be of interest to
+ optimizers and other passes wishing to manipulate the IL.
+
+ The operand type are broken up into REAL and VIRTUAL operands. The real
+ operands are represented as pointers into the stmt's operand tree. Thus
+ any manipulation of the real operands will be reflected in the actual tree.
+ Virtual operands are represented solely in the cache, although the base
+ variable for the SSA_NAME may, or may not occur in the stmt's tree.
+ Manipulation of the virtual operands will not be reflected in the stmt tree.
+
+ The routines in this file are concerned with creating this operand cache
+ from a stmt tree.
+
+ The operand tree is the parsed by the various get_* routines which look
+ through the stmt tree for the occurrence of operands which may be of
+ interest, and calls are made to the append_* routines whenever one is
+ found. There are 5 of these routines, each representing one of the
+ 5 types of operands. Defs, Uses, Virtual Uses, Virtual May Defs, and
+ Virtual Must Defs.
+
+ The append_* routines check for duplication, and simply keep a list of
+ unique objects for each operand type in the build_* extendable vectors.
+
+ Once the stmt tree is completely parsed, the finalize_ssa_operands()
+ routine is called, which proceeds to perform the finalization routine
+ on each of the 5 operand vectors which have been built up.
+
+ If the stmt had a previous operand cache, the finalization routines
+ attempt to match up the new operands with the old ones. If it's a perfect
+ match, the old vector is simply reused. If it isn't a perfect match, then
+ a new vector is created and the new operands are placed there. For
+ virtual operands, if the previous cache had SSA_NAME version of a
+ variable, and that same variable occurs in the same operands cache, then
+ the new cache vector will also get the same SSA_NAME.
+
+ i.e., if a stmt had a VUSE of 'a_5', and 'a' occurs in the new operand
+ vector for VUSE, then the new vector will also be modified such that
+ it contains 'a_5' rather than 'a'.
+
+*/
+
+
+/* Flags to describe operand properties in helpers. */
/* By default, operands are loaded. */
#define opf_none 0
-/* Operand is the target of an assignment expression. */
+/* Operand is the target of an assignment expression or a
+ call-clobbered variable */
#define opf_is_def (1 << 0)
+/* Operand is the target of an assignment expression. */
+#define opf_kill_def (1 << 1)
+
/* No virtual operands should be created in the expression. This is used
when traversing ADDR_EXPR nodes which have different semantics than
other expressions. Inside an ADDR_EXPR node, the only operands that we
need to consider are indices into arrays. For instance, &a.b[i] should
generate a USE of 'i' but it should not generate a VUSE for 'a' nor a
VUSE for 'b'. */
-#define opf_no_vops (1 << 1)
+#define opf_no_vops (1 << 2)
+
+/* Operand is a "non-specific" kill for call-clobbers and such. This is used
+ to distinguish "reset the world" events from explicit MODIFY_EXPRs. */
+#define opf_non_specific (1 << 3)
+
+/* This structure maintain a sorted list of operands which is created by
+ parse_ssa_operand. */
+struct opbuild_list_d GTY (())
+{
+ varray_type vars; /* The VAR_DECLS tree. */
+ varray_type uid; /* The sort value for virtual symbols. */
+ varray_type next; /* The next index in the sorted list. */
+ int first; /* First element in list. */
+ unsigned num; /* Number of elements. */
+};
+
+#define OPBUILD_LAST -1
+
/* Array for building all the def operands. */
-static GTY (()) varray_type build_defs;
+static GTY (()) struct opbuild_list_d build_defs;
/* Array for building all the use operands. */
-static GTY (()) varray_type build_uses;
+static GTY (()) struct opbuild_list_d build_uses;
-/* Array for building all the vdef operands. */
-static GTY (()) varray_type build_vdefs;
+/* Array for building all the v_may_def operands. */
+static GTY (()) struct opbuild_list_d build_v_may_defs;
/* Array for building all the vuse operands. */
-static GTY (()) varray_type build_vuses;
+static GTY (()) struct opbuild_list_d build_vuses;
-#ifdef ENABLE_CHECKING
-tree check_build_stmt;
-#endif
+/* Array for building all the v_must_def operands. */
+static GTY (()) struct opbuild_list_d build_v_must_defs;
-typedef struct voperands_d
-{
- vdef_optype vdef_ops;
- vuse_optype vuse_ops;
-} *voperands_t;
+/* True if the operands for call clobbered vars are cached and valid. */
+bool ssa_call_clobbered_cache_valid;
+bool ssa_ro_call_cache_valid;
+
+/* These arrays are the cached operand vectors for call clobbered calls. */
+static VEC(tree,heap) *clobbered_v_may_defs;
+static VEC(tree,heap) *clobbered_vuses;
+static VEC(tree,heap) *ro_call_vuses;
+static bool clobbered_aliased_loads;
+static bool clobbered_aliased_stores;
+static bool ro_call_aliased_loads;
+static bool ops_active = false;
+
+static GTY (()) struct ssa_operand_memory_d *operand_memory = NULL;
+static unsigned operand_memory_index;
static void note_addressable (tree, stmt_ann_t);
-static void get_expr_operands (tree, tree *, int, voperands_t);
-static inline void append_def (tree *, tree);
-static inline void append_use (tree *, tree);
-static void append_vdef (tree, tree, voperands_t);
-static void add_call_clobber_ops (tree, voperands_t);
-static void add_call_read_ops (tree, voperands_t);
-static void add_stmt_operand (tree *, tree, int, voperands_t);
+static void get_expr_operands (tree, tree *, int);
+static void get_asm_expr_operands (tree);
+static void get_indirect_ref_operands (tree, tree, int);
+static void get_tmr_operands (tree, tree, int);
+static void get_call_expr_operands (tree, tree);
+static inline void append_def (tree *);
+static inline void append_use (tree *);
+static void append_v_may_def (tree);
+static void append_v_must_def (tree);
+static void add_call_clobber_ops (tree);
+static void add_call_read_ops (tree);
+static void add_stmt_operand (tree *, stmt_ann_t, int);
+static void build_ssa_operands (tree stmt);
+
+static def_optype_p free_defs = NULL;
+static use_optype_p free_uses = NULL;
+static vuse_optype_p free_vuses = NULL;
+static maydef_optype_p free_maydefs = NULL;
+static mustdef_optype_p free_mustdefs = NULL;
+
+/* Initialize a virtual operand build LIST called NAME with NUM elements. */
+static inline void
+opbuild_initialize_virtual (struct opbuild_list_d *list, int num,
+ const char *name)
+{
+ list->first = OPBUILD_LAST;
+ list->num = 0;
+ VARRAY_TREE_INIT (list->vars, num, name);
+ VARRAY_UINT_INIT (list->uid, num, "List UID");
+ VARRAY_INT_INIT (list->next, num, "List NEXT");
+}
-struct freelist_d GTY((chain_next ("%h.next")))
+
+/* Initialize a real operand build LIST called NAME with NUM elements. */
+
+static inline void
+opbuild_initialize_real (struct opbuild_list_d *list, int num, const char *name)
{
- struct freelist_d *next;
-};
+ list->first = OPBUILD_LAST;
+ list->num = 0;
+ VARRAY_TREE_PTR_INIT (list->vars, num, name);
+ VARRAY_INT_INIT (list->next, num, "List NEXT");
+ /* The UID field is not needed since we sort based on the pointer value. */
+ list->uid = NULL;
+}
-#define NUM_FREE 4
-static GTY ((length ("NUM_FREE"))) struct freelist_d optype_freelist[NUM_FREE] = { {0}, {0}, {0}, {0} };
+/* Free memory used in virtual operand build object LIST. */
-static inline void *
-check_optype_freelist (size_t num ATTRIBUTE_UNUSED)
+static inline void
+opbuild_free (struct opbuild_list_d *list)
{
- return NULL;
-#if 0
- void *vec = NULL;
+ list->vars = NULL;
+ list->uid = NULL;
+ list->next = NULL;
+}
- if (num <= NUM_FREE && optype_freelist[num - 1].next)
- {
- vec = (void *)optype_freelist[num - 1].next;
- optype_freelist[num - 1].next = optype_freelist[num - 1].next->next;
- }
- return vec;
-#endif
+
+/* Number of elements in an opbuild list. */
+
+static inline unsigned
+opbuild_num_elems (struct opbuild_list_d *list)
+{
+ return list->num;
}
-/* Return a vector of contiguous memory of a specified size. */
+/* Add VAR to the real operand list LIST, keeping it sorted and avoiding
+ duplicates. The actual sort value is the tree pointer value. */
+
static inline void
-add_optype_freelist (void *vec ATTRIBUTE_UNUSED, size_t size ATTRIBUTE_UNUSED)
+opbuild_append_real (struct opbuild_list_d *list, tree *var)
{
-#if 0
- struct freelist_d *ptr;
+ int index;
+
#ifdef ENABLE_CHECKING
- if (size == 0)
- abort ();
+ /* Ensure the real operand doesn't exist already. */
+ for (index = list->first;
+ index != OPBUILD_LAST;
+ index = VARRAY_INT (list->next, index))
+ gcc_assert (VARRAY_TREE_PTR (list->vars, index) != var);
#endif
- /* if its bigger than one of our lists, simply let it go and let GC
- collect it. */
- if (size > NUM_FREE)
- return;
+ /* First item in the list. */
+ index = VARRAY_ACTIVE_SIZE (list->vars);
+ if (index == 0)
+ list->first = index;
+ else
+ VARRAY_INT (list->next, index - 1) = index;
+ VARRAY_PUSH_INT (list->next, OPBUILD_LAST);
+ VARRAY_PUSH_TREE_PTR (list->vars, var);
+ list->num++;
+}
- ptr = vec;
- ptr->next = optype_freelist[size - 1].next;;
- optype_freelist[size - 1].next = ptr;
-#endif
+
+/* Add VAR to the virtual operand list LIST, keeping it sorted and avoiding
+ duplicates. The actual sort value is the DECL UID of the base variable. */
+
+static inline void
+opbuild_append_virtual (struct opbuild_list_d *list, tree var)
+{
+ int index, curr, last;
+ unsigned int var_uid;
+
+ if (TREE_CODE (var) != SSA_NAME)
+ var_uid = DECL_UID (var);
+ else
+ var_uid = DECL_UID (SSA_NAME_VAR (var));
+
+ index = VARRAY_ACTIVE_SIZE (list->vars);
+
+ if (index == 0)
+ {
+ VARRAY_PUSH_TREE (list->vars, var);
+ VARRAY_PUSH_UINT (list->uid, var_uid);
+ VARRAY_PUSH_INT (list->next, OPBUILD_LAST);
+ list->first = 0;
+ list->num = 1;
+ return;
+ }
+
+ last = OPBUILD_LAST;
+ /* Find the correct spot in the sorted list. */
+ for (curr = list->first;
+ curr != OPBUILD_LAST;
+ last = curr, curr = VARRAY_INT (list->next, curr))
+ {
+ if (VARRAY_UINT (list->uid, curr) > var_uid)
+ break;
+ }
+
+ if (last == OPBUILD_LAST)
+ {
+ /* First item in the list. */
+ VARRAY_PUSH_INT (list->next, list->first);
+ list->first = index;
+ }
+ else
+ {
+ /* Don't enter duplicates at all. */
+ if (VARRAY_UINT (list->uid, last) == var_uid)
+ return;
+
+ VARRAY_PUSH_INT (list->next, VARRAY_INT (list->next, last));
+ VARRAY_INT (list->next, last) = index;
+ }
+ VARRAY_PUSH_TREE (list->vars, var);
+ VARRAY_PUSH_UINT (list->uid, var_uid);
+ list->num++;
}
-static inline def_optype
-allocate_def_optype (unsigned num)
+/* Return the first element index in LIST. OPBUILD_LAST means there are no
+ more elements. */
+
+static inline int
+opbuild_first (struct opbuild_list_d *list)
{
- def_optype def_ops;
- unsigned size;
- size = sizeof (struct def_optype_d) + sizeof (tree *) * (num - 1);
- def_ops = check_optype_freelist (num);
- if (!def_ops)
- def_ops = ggc_alloc (size);
- def_ops->num_defs = num;
- return def_ops;
+ if (list->num > 0)
+ return list->first;
+ else
+ return OPBUILD_LAST;
}
-static inline use_optype
-allocate_use_optype (unsigned num)
+
+/* Return the next element after PREV in LIST. */
+
+static inline int
+opbuild_next (struct opbuild_list_d *list, int prev)
{
- use_optype use_ops;
- unsigned size;
- size = sizeof (struct use_optype_d) + sizeof (tree *) * (num - 1);
- use_ops = check_optype_freelist (num);
- if (!use_ops)
- use_ops = ggc_alloc (size);
- use_ops->num_uses = num;
- return use_ops;
+ return VARRAY_INT (list->next, prev);
}
-static inline vdef_optype
-allocate_vdef_optype (unsigned num)
+
+/* Return the real element at index ELEM in LIST. */
+
+static inline tree *
+opbuild_elem_real (struct opbuild_list_d *list, int elem)
{
- vdef_optype vdef_ops;
- unsigned size;
- size = sizeof (struct vdef_optype_d) + sizeof (tree) * ((num * 2) - 1);
- vdef_ops = check_optype_freelist (num * 2);
- if (!vdef_ops)
- vdef_ops = ggc_alloc (size);
- vdef_ops->num_vdefs = num;
- return vdef_ops;
+ return VARRAY_TREE_PTR (list->vars, elem);
}
-static inline vuse_optype
-allocate_vuse_optype (unsigned num)
+
+/* Return the virtual element at index ELEM in LIST. */
+
+static inline tree
+opbuild_elem_virtual (struct opbuild_list_d *list, int elem)
{
- vuse_optype vuse_ops;
- unsigned size;
- size = sizeof (struct vuse_optype_d) + sizeof (tree) * (num - 1);
- vuse_ops = check_optype_freelist (num);
- if (!vuse_ops)
- vuse_ops = ggc_alloc (size);
- vuse_ops->num_vuses = num;
- return vuse_ops;
+ return VARRAY_TREE (list->vars, elem);
}
-static inline void
-free_uses (use_optype *uses, bool dealloc)
+
+/* Return the virtual element uid at index ELEM in LIST. */
+static inline unsigned int
+opbuild_elem_uid (struct opbuild_list_d *list, int elem)
{
- if (*uses)
- {
- if (dealloc)
- add_optype_freelist (*uses, (*uses)->num_uses);
- *uses = NULL;
- }
+ return VARRAY_UINT (list->uid, elem);
}
+
+/* Reset an operand build list. */
+
static inline void
-free_defs (def_optype *defs, bool dealloc)
+opbuild_clear (struct opbuild_list_d *list)
{
- if (*defs)
- {
- if (dealloc)
- add_optype_freelist (*defs, (*defs)->num_defs);
- *defs = NULL;
- }
+ list->first = OPBUILD_LAST;
+ VARRAY_POP_ALL (list->vars);
+ VARRAY_POP_ALL (list->next);
+ if (list->uid)
+ VARRAY_POP_ALL (list->uid);
+ list->num = 0;
}
-static inline void
-free_vuses (vuse_optype *vuses, bool dealloc)
+
+/* Remove ELEM from LIST where PREV is the previous element. Return the next
+ element. */
+
+static inline int
+opbuild_remove_elem (struct opbuild_list_d *list, int elem, int prev)
{
- if (*vuses)
+ int ret;
+ if (prev != OPBUILD_LAST)
{
- if (dealloc)
- add_optype_freelist (*vuses, (*vuses)->num_vuses);
- *vuses = NULL;
+ gcc_assert (VARRAY_INT (list->next, prev) == elem);
+ ret = VARRAY_INT (list->next, prev) = VARRAY_INT (list->next, elem);
}
+ else
+ {
+ gcc_assert (list->first == elem);
+ ret = list->first = VARRAY_INT (list->next, elem);
+ }
+ list->num--;
+ return ret;
}
-static inline void
-free_vdefs (vdef_optype *vdefs, bool dealloc)
+
+/* Return true if the ssa operands cache is active. */
+
+bool
+ssa_operands_active (void)
{
- if (*vdefs)
- {
- if (dealloc)
- add_optype_freelist (*vdefs, (*vdefs)->num_vdefs);
- *vdefs = NULL;
- }
+ return ops_active;
}
+
+/* Initialize the operand cache routines. */
+
void
-remove_vuses (tree stmt)
+init_ssa_operands (void)
{
- stmt_ann_t ann;
-
- ann = stmt_ann (stmt);
- if (ann)
- free_vuses (&(ann->vuse_ops), true);
+ opbuild_initialize_real (&build_defs, 5, "build defs");
+ opbuild_initialize_real (&build_uses, 10, "build uses");
+ opbuild_initialize_virtual (&build_vuses, 25, "build_vuses");
+ opbuild_initialize_virtual (&build_v_may_defs, 25, "build_v_may_defs");
+ opbuild_initialize_virtual (&build_v_must_defs, 25, "build_v_must_defs");
+ gcc_assert (operand_memory == NULL);
+ operand_memory_index = SSA_OPERAND_MEMORY_SIZE;
+ ops_active = true;
}
+
+/* Dispose of anything required by the operand routines. */
+
void
-remove_vdefs (tree stmt)
+fini_ssa_operands (void)
{
- stmt_ann_t ann;
+ struct ssa_operand_memory_d *ptr;
+ opbuild_free (&build_defs);
+ opbuild_free (&build_uses);
+ opbuild_free (&build_v_must_defs);
+ opbuild_free (&build_v_may_defs);
+ opbuild_free (&build_vuses);
+ free_defs = NULL;
+ free_uses = NULL;
+ free_vuses = NULL;
+ free_maydefs = NULL;
+ free_mustdefs = NULL;
+ while ((ptr = operand_memory) != NULL)
+ {
+ operand_memory = operand_memory->next;
+ ggc_free (ptr);
+ }
- ann = stmt_ann (stmt);
- if (ann)
- free_vdefs (&(ann->vdef_ops), true);
+ VEC_free (tree, heap, clobbered_v_may_defs);
+ VEC_free (tree, heap, clobbered_vuses);
+ VEC_free (tree, heap, ro_call_vuses);
+ ops_active = false;
}
-void
-init_ssa_operands (void)
+/* Return memory for operands of SIZE chunks. */
+
+static inline void *
+ssa_operand_alloc (unsigned size)
{
- int x;
+ char *ptr;
+ if (operand_memory_index + size >= SSA_OPERAND_MEMORY_SIZE)
+ {
+ struct ssa_operand_memory_d *ptr;
+ ptr = ggc_alloc (sizeof (struct ssa_operand_memory_d));
+ ptr->next = operand_memory;
+ operand_memory = ptr;
+ operand_memory_index = 0;
+ }
+ ptr = &(operand_memory->mem[operand_memory_index]);
+ operand_memory_index += size;
+ return ptr;
+}
- VARRAY_TREE_PTR_INIT (build_defs, 5, "build defs");
- VARRAY_TREE_PTR_INIT (build_uses, 10, "build uses");
- VARRAY_TREE_INIT (build_vdefs, 10, "build vdefs");
- VARRAY_TREE_INIT (build_vuses, 10, "build vuses");
- for (x = 0; x < NUM_FREE; x++)
- optype_freelist[x].next = NULL;
-}
+/* Make sure PTR is inn the correct immediate use list. Since uses are simply
+ pointers into the stmt TREE, there is no way of telling if anyone has
+ changed what this pointer points to via TREE_OPERANDS (exp, 0) = <...>.
+ THe contents are different, but the the pointer is still the same. This
+ routine will check to make sure PTR is in the correct list, and if it isn't
+ put it in the correct list. We cannot simply check the previous node
+ because all nodes in the same stmt might have be changed. */
-void
-fini_ssa_operands (void)
+static inline void
+correct_use_link (use_operand_p ptr, tree stmt)
{
- int x;
- for (x = 0; x < NUM_FREE; x++)
- optype_freelist[x].next = NULL;
+ use_operand_p prev;
+ tree root;
+
+ /* Fold_stmt () may have changed the stmt pointers. */
+ if (ptr->stmt != stmt)
+ ptr->stmt = stmt;
+
+ prev = ptr->prev;
+ if (prev)
+ {
+ bool stmt_mod = true;
+ /* Find the first element which isn't a SAFE iterator, is in a different
+ stmt, and is not a a modified stmt, That node is in the correct list,
+ see if we are too. */
+
+ while (stmt_mod)
+ {
+ while (prev->stmt == stmt || prev->stmt == NULL)
+ prev = prev->prev;
+ if (prev->use == NULL)
+ stmt_mod = false;
+ else
+ if ((stmt_mod = stmt_modified_p (prev->stmt)))
+ prev = prev->prev;
+ }
+
+ /* Get the ssa_name of the list the node is in. */
+ if (prev->use == NULL)
+ root = prev->stmt;
+ else
+ root = *(prev->use);
+ /* If it's the right list, simply return. */
+ if (root == *(ptr->use))
+ return;
+ }
+ /* Its in the wrong list if we reach here. */
+ delink_imm_use (ptr);
+ link_imm_use (ptr, *(ptr->use));
}
+
+#define FINALIZE_OPBUILD build_defs
+#define FINALIZE_OPBUILD_BASE(I) opbuild_elem_real (&build_defs, (I))
+#define FINALIZE_OPBUILD_ELEM(I) opbuild_elem_real (&build_defs, (I))
+#define FINALIZE_FUNC finalize_ssa_def_ops
+#define FINALIZE_ALLOC alloc_def
+#define FINALIZE_FREE free_defs
+#define FINALIZE_TYPE struct def_optype_d
+#define FINALIZE_ELEM(PTR) ((PTR)->def_ptr)
+#define FINALIZE_OPS DEF_OPS
+#define FINALIZE_BASE(VAR) VAR
+#define FINALIZE_BASE_TYPE tree *
+#define FINALIZE_BASE_ZERO NULL
+#define FINALIZE_INITIALIZE(PTR, VAL, STMT) FINALIZE_ELEM (PTR) = (VAL)
+#include "tree-ssa-opfinalize.h"
+
+
+/* This routine will create stmt operands for STMT from the def build list. */
+
static void
finalize_ssa_defs (tree stmt)
{
- unsigned num, x;
- stmt_ann_t ann;
- def_optype def_ops;
-
- num = VARRAY_ACTIVE_SIZE (build_defs);
- if (num == 0)
- return;
-
-#ifdef ENABLE_CHECKING
+ unsigned int num = opbuild_num_elems (&build_defs);
/* There should only be a single real definition per assignment. */
- if (TREE_CODE (stmt) == MODIFY_EXPR && num > 1)
- abort ();
-#endif
+ gcc_assert ((stmt && TREE_CODE (stmt) != MODIFY_EXPR) || num <= 1);
- def_ops = allocate_def_optype (num);
- for (x = 0; x < num ; x++)
- def_ops->defs[x] = VARRAY_TREE_PTR (build_defs, x);
- VARRAY_POP_ALL (build_defs);
+ /* If there is an old list, often the new list is identical, or close, so
+ find the elements at the beginning that are the same as the vector. */
- ann = stmt_ann (stmt);
- ann->def_ops = def_ops;
+ finalize_ssa_def_ops (stmt);
+ opbuild_clear (&build_defs);
}
+#define FINALIZE_OPBUILD build_uses
+#define FINALIZE_OPBUILD_BASE(I) opbuild_elem_real (&build_uses, (I))
+#define FINALIZE_OPBUILD_ELEM(I) opbuild_elem_real (&build_uses, (I))
+#define FINALIZE_FUNC finalize_ssa_use_ops
+#define FINALIZE_ALLOC alloc_use
+#define FINALIZE_FREE free_uses
+#define FINALIZE_TYPE struct use_optype_d
+#define FINALIZE_ELEM(PTR) ((PTR)->use_ptr.use)
+#define FINALIZE_OPS USE_OPS
+#define FINALIZE_USE_PTR(PTR) USE_OP_PTR (PTR)
+#define FINALIZE_BASE(VAR) VAR
+#define FINALIZE_BASE_TYPE tree *
+#define FINALIZE_BASE_ZERO NULL
+#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
+ (PTR)->use_ptr.use = (VAL); \
+ link_imm_use_stmt (&((PTR)->use_ptr), \
+ *(VAL), (STMT))
+#include "tree-ssa-opfinalize.h"
+
+/* Return a new use operand vector for STMT, comparing to OLD_OPS_P. */
+
static void
finalize_ssa_uses (tree stmt)
{
- unsigned num, x;
- use_optype use_ops;
- stmt_ann_t ann;
-
- num = VARRAY_ACTIVE_SIZE (build_uses);
- if (num == 0)
- return;
-
#ifdef ENABLE_CHECKING
{
unsigned x;
+ unsigned num = opbuild_num_elems (&build_uses);
+
/* If the pointer to the operand is the statement itself, something is
wrong. It means that we are pointing to a local variable (the
initial call to get_stmt_operands does not pass a pointer to a
statement). */
for (x = 0; x < num; x++)
- if (*(VARRAY_TREE_PTR (build_uses, x)) == stmt)
- abort ();
+ gcc_assert (*(opbuild_elem_real (&build_uses, x)) != stmt);
}
#endif
-
- use_ops = allocate_use_optype (num);
- for (x = 0; x < num ; x++)
- use_ops->uses[x] = VARRAY_TREE_PTR (build_uses, x);
- VARRAY_POP_ALL (build_uses);
-
- ann = stmt_ann (stmt);
- ann->use_ops = use_ops;
+ finalize_ssa_use_ops (stmt);
+ opbuild_clear (&build_uses);
}
-
+
+
+/* Return a new v_may_def operand vector for STMT, comparing to OLD_OPS_P. */
+#define FINALIZE_OPBUILD build_v_may_defs
+#define FINALIZE_OPBUILD_ELEM(I) opbuild_elem_virtual (&build_v_may_defs, (I))
+#define FINALIZE_OPBUILD_BASE(I) opbuild_elem_uid (&build_v_may_defs, (I))
+#define FINALIZE_FUNC finalize_ssa_v_may_def_ops
+#define FINALIZE_ALLOC alloc_maydef
+#define FINALIZE_FREE free_maydefs
+#define FINALIZE_TYPE struct maydef_optype_d
+#define FINALIZE_ELEM(PTR) MAYDEF_RESULT (PTR)
+#define FINALIZE_OPS MAYDEF_OPS
+#define FINALIZE_USE_PTR(PTR) MAYDEF_OP_PTR (PTR)
+#define FINALIZE_BASE_ZERO 0
+#define FINALIZE_BASE(VAR) ((TREE_CODE (VAR) == SSA_NAME) \
+ ? DECL_UID (SSA_NAME_VAR (VAR)) : DECL_UID ((VAR)))
+#define FINALIZE_BASE_TYPE unsigned
+#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
+ (PTR)->def_var = (VAL); \
+ (PTR)->use_var = (VAL); \
+ (PTR)->use_ptr.use = &((PTR)->use_var); \
+ link_imm_use_stmt (&((PTR)->use_ptr), \
+ (VAL), (STMT))
+#include "tree-ssa-opfinalize.h"
+
+
static void
-finalize_ssa_vdefs (tree stmt)
+finalize_ssa_v_may_defs (tree stmt)
{
- unsigned num, x;
- vdef_optype vdef_ops;
- stmt_ann_t ann;
-
- num = VARRAY_ACTIVE_SIZE (build_vdefs);
- if (num == 0)
- return;
-
-#ifdef ENABLE_CHECKING
- /* VDEFs must be entered in pairs of result/uses. */
- if (num % 2 != 0)
- abort();
-#endif
-
- vdef_ops = allocate_vdef_optype (num / 2);
- for (x = 0; x < num; x++)
- vdef_ops->vdefs[x] = VARRAY_TREE (build_vdefs, x);
- VARRAY_CLEAR (build_vdefs);
-
- ann = stmt_ann (stmt);
- ann->vdef_ops = vdef_ops;
+ finalize_ssa_v_may_def_ops (stmt);
}
+
+
+/* Clear the in_list bits and empty the build array for v_may_defs. */
static inline void
-finalize_ssa_vuses (tree stmt)
+cleanup_v_may_defs (void)
{
- unsigned num, x;
- stmt_ann_t ann;
- vuse_optype vuse_ops;
- vdef_optype vdefs;
+ unsigned x, num;
+ num = opbuild_num_elems (&build_v_may_defs);
-#ifdef ENABLE_CHECKING
- if (VARRAY_ACTIVE_SIZE (build_vdefs) > 0)
+ for (x = 0; x < num; x++)
{
- fprintf (stderr, "Please finalize VDEFs before finalize VUSES.\n");
- abort ();
+ tree t = opbuild_elem_virtual (&build_v_may_defs, x);
+ if (TREE_CODE (t) != SSA_NAME)
+ {
+ var_ann_t ann = var_ann (t);
+ ann->in_v_may_def_list = 0;
+ }
}
-#endif
-
- num = VARRAY_ACTIVE_SIZE (build_vuses);
- if (num == 0)
- return;
+ opbuild_clear (&build_v_may_defs);
+}
+
+
+#define FINALIZE_OPBUILD build_vuses
+#define FINALIZE_OPBUILD_ELEM(I) opbuild_elem_virtual (&build_vuses, (I))
+#define FINALIZE_OPBUILD_BASE(I) opbuild_elem_uid (&build_vuses, (I))
+#define FINALIZE_FUNC finalize_ssa_vuse_ops
+#define FINALIZE_ALLOC alloc_vuse
+#define FINALIZE_FREE free_vuses
+#define FINALIZE_TYPE struct vuse_optype_d
+#define FINALIZE_ELEM(PTR) VUSE_OP (PTR)
+#define FINALIZE_OPS VUSE_OPS
+#define FINALIZE_USE_PTR(PTR) VUSE_OP_PTR (PTR)
+#define FINALIZE_BASE_ZERO 0
+#define FINALIZE_BASE(VAR) ((TREE_CODE (VAR) == SSA_NAME) \
+ ? DECL_UID (SSA_NAME_VAR (VAR)) : DECL_UID ((VAR)))
+#define FINALIZE_BASE_TYPE unsigned
+#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
+ (PTR)->use_var = (VAL); \
+ (PTR)->use_ptr.use = &((PTR)->use_var); \
+ link_imm_use_stmt (&((PTR)->use_ptr), \
+ (VAL), (STMT))
+#include "tree-ssa-opfinalize.h"
+
+
+/* Return a new vuse operand vector, comparing to OLD_OPS_P. */
+
+static void
+finalize_ssa_vuses (tree stmt)
+{
+ unsigned num, num_v_may_defs;
+ int vuse_index;
/* Remove superfluous VUSE operands. If the statement already has a
- VDEF operation for a variable 'a', then a VUSE for 'a' is not
- needed because VDEFs imply a VUSE of the variable. For instance,
+ V_MAY_DEF operation for a variable 'a', then a VUSE for 'a' is not
+ needed because V_MAY_DEFs imply a VUSE of the variable. For instance,
suppose that variable 'a' is aliased:
# VUSE <a_2>
- # a_3 = VDEF <a_2>
+ # a_3 = V
_MAY_DEF <a_2>
a = a + 1;
- The VUSE <a_2> is superfluous because it is implied by the VDEF
+ The VUSE <a_2> is superfluous because it is implied by the V_MAY_DEF
operation. */
- ann = stmt_ann (stmt);
- vdefs = VDEF_OPS (ann);
- if (NUM_VDEFS (vdefs) > 0)
- {
- size_t i, j;
- for (i = 0; i < VARRAY_ACTIVE_SIZE (build_vuses); i++)
- {
- bool found = false;
- for (j = 0; j < NUM_VDEFS (vdefs); j++)
- {
- tree vuse_var, vdef_var;
- tree vuse = VARRAY_TREE (build_vuses, i);
- tree vdef = VDEF_OP (vdefs, j);
-
- if (TREE_CODE (vuse) == SSA_NAME)
- vuse_var = SSA_NAME_VAR (vuse);
- else
- vuse_var = vuse;
-
- if (TREE_CODE (vdef) == SSA_NAME)
- vdef_var = SSA_NAME_VAR (vdef);
- else
- vdef_var = vdef;
-
- if (vuse_var == vdef_var)
- {
- found = true;
- break;
- }
- }
+ num = opbuild_num_elems (&build_vuses);
+ num_v_may_defs = opbuild_num_elems (&build_v_may_defs);
- /* If we found a useless VUSE operand, remove it from the
- operand array by replacing it with the last active element
- in the operand array (unless the useless VUSE was the
- last operand, in which case we simply remove it. */
- if (found)
+ if (num > 0 && num_v_may_defs > 0)
+ {
+ int last = OPBUILD_LAST;
+ vuse_index = opbuild_first (&build_vuses);
+ for ( ; vuse_index != OPBUILD_LAST; )
+ {
+ tree vuse;
+ vuse = opbuild_elem_virtual (&build_vuses, vuse_index);
+ if (TREE_CODE (vuse) != SSA_NAME)
{
- if (i != VARRAY_ACTIVE_SIZE (build_vuses) - 1)
- {
- VARRAY_TREE (build_vuses, i)
- = VARRAY_TREE (build_vuses,
- VARRAY_ACTIVE_SIZE (build_vuses) - 1);
+ var_ann_t ann = var_ann (vuse);
+ ann->in_vuse_list = 0;
+ if (ann->in_v_may_def_list)
+ {
+ vuse_index = opbuild_remove_elem (&build_vuses, vuse_index,
+ last);
+ continue;
}
- VARRAY_POP (build_vuses);
-
- /* We want to rescan the element at this index, unless
- this was the last element, in which case the loop
- terminates. */
- i--;
}
+ last = vuse_index;
+ vuse_index = opbuild_next (&build_vuses, vuse_index);
}
}
+ else
+ /* Clear out the in_list bits. */
+ for (vuse_index = opbuild_first (&build_vuses);
+ vuse_index != OPBUILD_LAST;
+ vuse_index = opbuild_next (&build_vuses, vuse_index))
+ {
+ tree t = opbuild_elem_virtual (&build_vuses, vuse_index);
+ if (TREE_CODE (t) != SSA_NAME)
+ {
+ var_ann_t ann = var_ann (t);
+ ann->in_vuse_list = 0;
+ }
+ }
- num = VARRAY_ACTIVE_SIZE (build_vuses);
- /* We could have reduced the size to zero now, however. */
- if (num == 0)
- return;
+ finalize_ssa_vuse_ops (stmt);
+ /* The v_may_def build vector wasn't cleaned up because we needed it. */
+ cleanup_v_may_defs ();
+
+ /* Free the vuses build vector. */
+ opbuild_clear (&build_vuses);
- vuse_ops = allocate_vuse_optype (num);
- for (x = 0; x < num; x++)
- vuse_ops->vuses[x] = VARRAY_TREE (build_vuses, x);
- VARRAY_CLEAR (build_vuses);
- ann->vuse_ops = vuse_ops;
}
+
+/* Return a new v_must_def operand vector for STMT, comparing to OLD_OPS_P. */
+
+#define FINALIZE_OPBUILD build_v_must_defs
+#define FINALIZE_OPBUILD_ELEM(I) opbuild_elem_virtual (&build_v_must_defs, (I))
+#define FINALIZE_OPBUILD_BASE(I) opbuild_elem_uid (&build_v_must_defs, (I))
+#define FINALIZE_FUNC finalize_ssa_v_must_def_ops
+#define FINALIZE_ALLOC alloc_mustdef
+#define FINALIZE_FREE free_mustdefs
+#define FINALIZE_TYPE struct mustdef_optype_d
+#define FINALIZE_ELEM(PTR) MUSTDEF_RESULT (PTR)
+#define FINALIZE_OPS MUSTDEF_OPS
+#define FINALIZE_USE_PTR(PTR) MUSTDEF_KILL_PTR (PTR)
+#define FINALIZE_BASE_ZERO 0
+#define FINALIZE_BASE(VAR) ((TREE_CODE (VAR) == SSA_NAME) \
+ ? DECL_UID (SSA_NAME_VAR (VAR)) : DECL_UID ((VAR)))
+#define FINALIZE_BASE_TYPE unsigned
+#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
+ (PTR)->def_var = (VAL); \
+ (PTR)->kill_var = (VAL); \
+ (PTR)->use_ptr.use = &((PTR)->kill_var);\
+ link_imm_use_stmt (&((PTR)->use_ptr), \
+ (VAL), (STMT))
+#include "tree-ssa-opfinalize.h"
-extern void
-finalize_ssa_stmt_operands (tree stmt)
+
+static void
+finalize_ssa_v_must_defs (tree stmt)
{
-#ifdef ENABLE_CHECKING
- if (check_build_stmt == NULL)
- abort();
-#endif
+ /* In the presence of subvars, there may be more than one V_MUST_DEF per
+ statement (one for each subvar). It is a bit expensive to verify that
+ all must-defs in a statement belong to subvars if there is more than one
+ MUST-def, so we don't do it. Suffice to say, if you reach here without
+ having subvars, and have num >1, you have hit a bug. */
+
+ finalize_ssa_v_must_def_ops (stmt);
+ opbuild_clear (&build_v_must_defs);
+}
+
+/* Finalize all the build vectors, fill the new ones into INFO. */
+
+static inline void
+finalize_ssa_stmt_operands (tree stmt)
+{
finalize_ssa_defs (stmt);
finalize_ssa_uses (stmt);
- finalize_ssa_vdefs (stmt);
+ finalize_ssa_v_must_defs (stmt);
+ finalize_ssa_v_may_defs (stmt);
finalize_ssa_vuses (stmt);
+}
-#ifdef ENABLE_CHECKING
- check_build_stmt = NULL;
-#endif
+
+/* Start the process of building up operands vectors in INFO. */
+
+static inline void
+start_ssa_stmt_operands (void)
+{
+ gcc_assert (opbuild_num_elems (&build_defs) == 0);
+ gcc_assert (opbuild_num_elems (&build_uses) == 0);
+ gcc_assert (opbuild_num_elems (&build_vuses) == 0);
+ gcc_assert (opbuild_num_elems (&build_v_may_defs) == 0);
+ gcc_assert (opbuild_num_elems (&build_v_must_defs) == 0);
}
-extern void
-verify_start_operands (tree stmt ATTRIBUTE_UNUSED)
+/* Add DEF_P to the list of pointers to operands. */
+
+static inline void
+append_def (tree *def_p)
{
-#ifdef ENABLE_CHECKING
- if (VARRAY_ACTIVE_SIZE (build_defs) > 0
- || VARRAY_ACTIVE_SIZE (build_uses) > 0
- || VARRAY_ACTIVE_SIZE (build_vuses) > 0
- || VARRAY_ACTIVE_SIZE (build_vdefs) > 0)
- abort ();
- if (check_build_stmt != NULL)
- abort();
- check_build_stmt = stmt;
-#endif
+ opbuild_append_real (&build_defs, def_p);
}
-/* Add DEF_P to the list of pointers to operands defined by STMT. */
+/* Add USE_P to the list of pointers to operands. */
static inline void
-append_def (tree *def_p, tree stmt ATTRIBUTE_UNUSED)
+append_use (tree *use_p)
{
-#ifdef ENABLE_CHECKING
- if (check_build_stmt != stmt)
- abort();
-#endif
- VARRAY_PUSH_TREE_PTR (build_defs, def_p);
+ opbuild_append_real (&build_uses, use_p);
}
-/* Add USE_P to the list of pointers to operands used by STMT. */
+/* Add a new virtual may def for variable VAR to the build array. */
static inline void
-append_use (tree *use_p, tree stmt ATTRIBUTE_UNUSED)
+append_v_may_def (tree var)
{
-#ifdef ENABLE_CHECKING
- if (check_build_stmt != stmt)
- abort();
-#endif
- VARRAY_PUSH_TREE_PTR (build_uses, use_p);
+ if (TREE_CODE (var) != SSA_NAME)
+ {
+ var_ann_t ann = get_var_ann (var);
+
+ /* Don't allow duplicate entries. */
+ if (ann->in_v_may_def_list)
+ return;
+ ann->in_v_may_def_list = 1;
+ }
+
+ opbuild_append_virtual (&build_v_may_defs, var);
}
-/* Add a new virtual def for variable VAR to statement STMT. If PREV_VOPS
- is not NULL, the existing entries are preserved and no new entries are
- added here. This is done to preserve the SSA numbering of virtual
- operands. */
+/* Add VAR to the list of virtual uses. */
-static void
-append_vdef (tree var, tree stmt, voperands_t prev_vops)
+static inline void
+append_vuse (tree var)
{
- stmt_ann_t ann;
- size_t i;
- tree result, source;
-#ifdef ENABLE_CHECKING
- if (check_build_stmt != stmt)
- abort();
-#endif
+ /* Don't allow duplicate entries. */
+ if (TREE_CODE (var) != SSA_NAME)
+ {
+ var_ann_t ann = get_var_ann (var);
+
+ if (ann->in_vuse_list || ann->in_v_may_def_list)
+ return;
+ ann->in_vuse_list = 1;
+ }
+
+ opbuild_append_virtual (&build_vuses, var);
+}
- ann = stmt_ann (stmt);
+
+/* Add VAR to the list of virtual must definitions for INFO. */
+
+static inline void
+append_v_must_def (tree var)
+{
+ unsigned i;
/* Don't allow duplicate entries. */
+ for (i = 0; i < opbuild_num_elems (&build_v_must_defs); i++)
+ if (var == opbuild_elem_virtual (&build_v_must_defs, i))
+ return;
+
+ opbuild_append_virtual (&build_v_must_defs, var);
+}
+
- for (i = 0; i < VARRAY_ACTIVE_SIZE (build_vdefs); i += 2)
+/* Parse STMT looking for operands. OLD_OPS is the original stmt operand
+ cache for STMT, if it existed before. When finished, the various build_*
+ operand vectors will have potential operands. in them. */
+
+static void
+parse_ssa_operands (tree stmt)
+{
+ enum tree_code code;
+
+ code = TREE_CODE (stmt);
+ switch (code)
{
- tree result = VARRAY_TREE (build_vdefs, i);
- if (var == result
- || (TREE_CODE (result) == SSA_NAME
- && var == SSA_NAME_VAR (result)))
- return;
- }
+ case MODIFY_EXPR:
+ /* First get operands from the RHS. For the LHS, we use a V_MAY_DEF if
+ either only part of LHS is modified or if the RHS might throw,
+ otherwise, use V_MUST_DEF.
- /* If the statement already had virtual definitions, see if any of the
- existing VDEFs matches VAR. If so, re-use it, otherwise add a new
- VDEF for VAR. */
- result = NULL_TREE;
- source = NULL_TREE;
- if (prev_vops)
- for (i = 0; i < NUM_VDEFS (prev_vops->vdef_ops); i++)
+ ??? If it might throw, we should represent somehow that it is killed
+ on the fallthrough path. */
{
- result = VDEF_RESULT (prev_vops->vdef_ops, i);
- if (result == var
- || (TREE_CODE (result) == SSA_NAME
- && SSA_NAME_VAR (result) == var))
- {
- source = VDEF_OP (prev_vops->vdef_ops, i);
- break;
- }
+ tree lhs = TREE_OPERAND (stmt, 0);
+ int lhs_flags = opf_is_def;
+
+ get_expr_operands (stmt, &TREE_OPERAND (stmt, 1), opf_none);
+
+ /* If the LHS is a VIEW_CONVERT_EXPR, it isn't changing whether
+ or not the entire LHS is modified; that depends on what's
+ inside the VIEW_CONVERT_EXPR. */
+ if (TREE_CODE (lhs) == VIEW_CONVERT_EXPR)
+ lhs = TREE_OPERAND (lhs, 0);
+
+ if (TREE_CODE (lhs) != ARRAY_REF && TREE_CODE (lhs) != ARRAY_RANGE_REF
+ && TREE_CODE (lhs) != BIT_FIELD_REF
+ && TREE_CODE (lhs) != REALPART_EXPR
+ && TREE_CODE (lhs) != IMAGPART_EXPR)
+ lhs_flags |= opf_kill_def;
+
+ get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), lhs_flags);
}
+ break;
- /* If no previous VDEF operand was found for VAR, create one now. */
- if (source == NULL_TREE)
- {
- result = var;
- source = var;
- }
+ case COND_EXPR:
+ get_expr_operands (stmt, &COND_EXPR_COND (stmt), opf_none);
+ break;
- VARRAY_PUSH_TREE (build_vdefs, result);
- VARRAY_PUSH_TREE (build_vdefs, source);
+ case SWITCH_EXPR:
+ get_expr_operands (stmt, &SWITCH_COND (stmt), opf_none);
+ break;
+
+ case ASM_EXPR:
+ get_asm_expr_operands (stmt);
+ break;
+
+ case RETURN_EXPR:
+ get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), opf_none);
+ break;
+
+ case GOTO_EXPR:
+ get_expr_operands (stmt, &GOTO_DESTINATION (stmt), opf_none);
+ break;
+
+ case LABEL_EXPR:
+ get_expr_operands (stmt, &LABEL_EXPR_LABEL (stmt), opf_none);
+ break;
+
+ /* These nodes contain no variable references. */
+ case BIND_EXPR:
+ case CASE_LABEL_EXPR:
+ case TRY_CATCH_EXPR:
+ case TRY_FINALLY_EXPR:
+ case EH_FILTER_EXPR:
+ case CATCH_EXPR:
+ case RESX_EXPR:
+ break;
+
+ default:
+ /* Notice that if get_expr_operands tries to use &STMT as the operand
+ pointer (which may only happen for USE operands), we will fail in
+ append_use. This default will handle statements like empty
+ statements, or CALL_EXPRs that may appear on the RHS of a statement
+ or as statements themselves. */
+ get_expr_operands (stmt, &stmt, opf_none);
+ break;
+ }
}
+/* Create an operands cache for STMT, returning it in NEW_OPS. OLD_OPS are the
+ original operands, and if ANN is non-null, appropriate stmt flags are set
+ in the stmt's annotation. If ANN is NULL, this is not considered a "real"
+ stmt, and none of the operands will be entered into their respective
+ immediate uses tables. This is to allow stmts to be processed when they
+ are not actually in the CFG.
-/* Add VAR to the list of virtual uses for STMT. If PREV_VOPS
- is not NULL, the existing entries are preserved and no new entries are
- added here. This is done to preserve the SSA numbering of virtual
- operands. */
+ Note that some fields in old_ops may change to NULL, although none of the
+ memory they originally pointed to will be destroyed. It is appropriate
+ to call free_stmt_operands() on the value returned in old_ops.
+
+ The rationale for this: Certain optimizations wish to examine the difference
+ between new_ops and old_ops after processing. If a set of operands don't
+ change, new_ops will simply assume the pointer in old_ops, and the old_ops
+ pointer will be set to NULL, indicating no memory needs to be cleared.
+ Usage might appear something like:
+
+ old_ops_copy = old_ops = stmt_ann(stmt)->operands;
+ build_ssa_operands (stmt, NULL, &old_ops, &new_ops);
+ <* compare old_ops_copy and new_ops *>
+ free_ssa_operands (old_ops); */
static void
-append_vuse (tree var, tree stmt, voperands_t prev_vops)
+build_ssa_operands (tree stmt)
{
- stmt_ann_t ann;
- size_t i;
- bool found;
- tree vuse;
+ stmt_ann_t ann = get_stmt_ann (stmt);
+
+ /* Initially assume that the statement has no volatile operands, nor
+ makes aliased loads or stores. */
+ if (ann)
+ {
+ ann->has_volatile_ops = false;
+ ann->makes_aliased_stores = false;
+ ann->makes_aliased_loads = false;
+ }
-#ifdef ENABLE_CHECKING
- if (check_build_stmt != stmt)
- abort();
-#endif
+ start_ssa_stmt_operands ();
- ann = stmt_ann (stmt);
+ parse_ssa_operands (stmt);
- /* Don't allow duplicate entries. */
- for (i = 0; i < VARRAY_ACTIVE_SIZE (build_vuses); i++)
+ finalize_ssa_stmt_operands (stmt);
+}
+
+
+/* Free any operands vectors in OPS. */
+#if 0
+static void
+free_ssa_operands (stmt_operands_p ops)
+{
+ ops->def_ops = NULL;
+ ops->use_ops = NULL;
+ ops->maydef_ops = NULL;
+ ops->mustdef_ops = NULL;
+ ops->vuse_ops = NULL;
+ while (ops->memory.next != NULL)
{
- tree vuse_var = VARRAY_TREE (build_vuses, i);
- if (var == vuse_var
- || (TREE_CODE (vuse_var) == SSA_NAME
- && var == SSA_NAME_VAR (vuse_var)))
- return;
+ operand_memory_p tmp = ops->memory.next;
+ ops->memory.next = tmp->next;
+ ggc_free (tmp);
}
+}
+#endif
- /* If the statement already had virtual uses, see if any of the
- existing VUSEs matches VAR. If so, re-use it, otherwise add a new
- VUSE for VAR. */
- found = false;
- vuse = NULL_TREE;
- if (prev_vops)
- for (i = 0; i < NUM_VUSES (prev_vops->vuse_ops); i++)
- {
- vuse = VUSE_OP (prev_vops->vuse_ops, i);
- if (vuse == var
- || (TREE_CODE (vuse) == SSA_NAME
- && SSA_NAME_VAR (vuse) == var))
- {
- found = true;
- break;
- }
- }
- /* If VAR existed already in PREV_VOPS, re-use it. */
- if (found)
- var = vuse;
+/* Get the operands of statement STMT. Note that repeated calls to
+ get_stmt_operands for the same statement will do nothing until the
+ statement is marked modified by a call to mark_stmt_modified(). */
+
+void
+update_stmt_operands (tree stmt)
+{
+ stmt_ann_t ann = get_stmt_ann (stmt);
+ /* If get_stmt_operands is called before SSA is initialized, dont
+ do anything. */
+ if (!ssa_operands_active ())
+ return;
+ /* The optimizers cannot handle statements that are nothing but a
+ _DECL. This indicates a bug in the gimplifier. */
+ gcc_assert (!SSA_VAR_P (stmt));
+
+ gcc_assert (ann->modified);
+
+ timevar_push (TV_TREE_OPS);
+
+ build_ssa_operands (stmt);
- VARRAY_PUSH_TREE (build_vuses, var);
+ /* Clear the modified bit for STMT. Subsequent calls to
+ get_stmt_operands for this statement will do nothing until the
+ statement is marked modified by a call to mark_stmt_modified(). */
+ ann->modified = 0;
+
+ timevar_pop (TV_TREE_OPS);
}
+
+/* Copies virtual operands from SRC to DST. */
-/* External entry point which by-passes the previous vops mechanism. */
void
-add_vuse (tree var, tree stmt)
+copy_virtual_operands (tree dest, tree src)
{
- append_vuse (var, stmt, NULL);
+ tree t;
+ ssa_op_iter iter, old_iter;
+ use_operand_p use_p, u2;
+ def_operand_p def_p, d2;
+
+ build_ssa_operands (dest);
+
+ /* Copy all the virtual fields. */
+ FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VUSE)
+ append_vuse (t);
+ FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMAYDEF)
+ append_v_may_def (t);
+ FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMUSTDEF)
+ append_v_must_def (t);
+
+ if (opbuild_num_elems (&build_vuses) == 0
+ && opbuild_num_elems (&build_v_may_defs) == 0
+ && opbuild_num_elems (&build_v_must_defs) == 0)
+ return;
+
+ /* Now commit the virtual operands to this stmt. */
+ finalize_ssa_v_must_defs (dest);
+ finalize_ssa_v_may_defs (dest);
+ finalize_ssa_vuses (dest);
+
+ /* Finally, set the field to the same values as then originals. */
+
+
+ t = op_iter_init_tree (&old_iter, src, SSA_OP_VUSE);
+ FOR_EACH_SSA_USE_OPERAND (use_p, dest, iter, SSA_OP_VUSE)
+ {
+ gcc_assert (!op_iter_done (&old_iter));
+ SET_USE (use_p, t);
+ t = op_iter_next_tree (&old_iter);
+ }
+ gcc_assert (op_iter_done (&old_iter));
+
+ op_iter_init_maydef (&old_iter, src, &u2, &d2);
+ FOR_EACH_SSA_MAYDEF_OPERAND (def_p, use_p, dest, iter)
+ {
+ gcc_assert (!op_iter_done (&old_iter));
+ SET_USE (use_p, USE_FROM_PTR (u2));
+ SET_DEF (def_p, DEF_FROM_PTR (d2));
+ op_iter_next_maymustdef (&u2, &d2, &old_iter);
+ }
+ gcc_assert (op_iter_done (&old_iter));
+
+ op_iter_init_mustdef (&old_iter, src, &u2, &d2);
+ FOR_EACH_SSA_MUSTDEF_OPERAND (def_p, use_p, dest, iter)
+ {
+ gcc_assert (!op_iter_done (&old_iter));
+ SET_USE (use_p, USE_FROM_PTR (u2));
+ SET_DEF (def_p, DEF_FROM_PTR (d2));
+ op_iter_next_maymustdef (&u2, &d2, &old_iter);
+ }
+ gcc_assert (op_iter_done (&old_iter));
+
}
-/* Get the operands of statement STMT. Note that repeated calls to
- get_stmt_operands for the same statement will do nothing until the
- statement is marked modified by a call to modify_stmt(). */
+/* Specifically for use in DOM's expression analysis. Given a store, we
+ create an artificial stmt which looks like a load from the store, this can
+ be used to eliminate redundant loads. OLD_OPS are the operands from the
+ store stmt, and NEW_STMT is the new load which represents a load of the
+ values stored. */
void
-get_stmt_operands (tree stmt)
+create_ssa_artficial_load_stmt (tree new_stmt, tree old_stmt)
{
- enum tree_code code;
stmt_ann_t ann;
- struct voperands_d prev_vops;
+ tree op;
+ ssa_op_iter iter;
+ use_operand_p use_p;
+ unsigned x;
-#if defined ENABLE_CHECKING
- /* The optimizers cannot handle statements that are nothing but a
- _DECL. This indicates a bug in the gimplifier. */
- if (SSA_VAR_P (stmt))
- abort ();
-#endif
+ ann = get_stmt_ann (new_stmt);
- /* Ignore error statements. */
- if (TREE_CODE (stmt) == ERROR_MARK)
- return;
+ /* process the stmt looking for operands. */
+ start_ssa_stmt_operands ();
+ parse_ssa_operands (new_stmt);
- ann = get_stmt_ann (stmt);
+ for (x = 0; x < opbuild_num_elems (&build_vuses); x++)
+ {
+ tree t = opbuild_elem_virtual (&build_vuses, x);
+ if (TREE_CODE (t) != SSA_NAME)
+ {
+ var_ann_t ann = var_ann (t);
+ ann->in_vuse_list = 0;
+ }
+ }
+
+ for (x = 0; x < opbuild_num_elems (&build_v_may_defs); x++)
+ {
+ tree t = opbuild_elem_virtual (&build_v_may_defs, x);
+ if (TREE_CODE (t) != SSA_NAME)
+ {
+ var_ann_t ann = var_ann (t);
+ ann->in_v_may_def_list = 0;
+ }
+ }
+ /* Remove any virtual operands that were found. */
+ opbuild_clear (&build_v_may_defs);
+ opbuild_clear (&build_v_must_defs);
+ opbuild_clear (&build_vuses);
+
+ /* For each VDEF on the original statement, we want to create a
+ VUSE of the V_MAY_DEF result or V_MUST_DEF op on the new
+ statement. */
+ FOR_EACH_SSA_TREE_OPERAND (op, old_stmt, iter,
+ (SSA_OP_VMAYDEF | SSA_OP_VMUSTDEF))
+ append_vuse (op);
+
+ /* Now build the operands for this new stmt. */
+ finalize_ssa_stmt_operands (new_stmt);
+
+ /* All uses in this fake stmt must not be in the immediate use lists. */
+ FOR_EACH_SSA_USE_OPERAND (use_p, new_stmt, iter, SSA_OP_ALL_USES)
+ delink_imm_use (use_p);
+}
- /* If the statement has not been modified, the operands are still valid. */
- if (!ann->modified)
- return;
+static void
+swap_tree_operands (tree stmt, tree *exp0, tree *exp1)
+{
+ tree op0, op1;
+ op0 = *exp0;
+ op1 = *exp1;
- timevar_push (TV_TREE_OPS);
+ /* If the operand cache is active, attempt to preserve the relative positions
+ of these two operands in their respective immediate use lists. */
+ if (ssa_operands_active () && op0 != op1)
+ {
+ use_optype_p use0, use1, ptr;
+ use0 = use1 = NULL;
+ /* Find the 2 operands in the cache, if they are there. */
+ for (ptr = USE_OPS (stmt); ptr; ptr = ptr->next)
+ if (USE_OP_PTR (ptr)->use == exp0)
+ {
+ use0 = ptr;
+ break;
+ }
+ for (ptr = USE_OPS (stmt); ptr; ptr = ptr->next)
+ if (USE_OP_PTR (ptr)->use == exp1)
+ {
+ use1 = ptr;
+ break;
+ }
+ /* If both uses don't have operand entries, there isn't much we can do
+ at this point. Presumably we dont need to worry about it. */
+ if (use0 && use1)
+ {
+ tree *tmp = USE_OP_PTR (use1)->use;
+ USE_OP_PTR (use1)->use = USE_OP_PTR (use0)->use;
+ USE_OP_PTR (use0)->use = tmp;
+ }
+ }
+
+ /* Now swap the data. */
+ *exp0 = op1;
+ *exp1 = op0;
+}
- /* Initially assume that the statement has no volatile operands.
- Statements marked with 'has_volatile_ops' are not processed by the
- optimizers. */
- ann->has_volatile_ops = false;
- /* Remove any existing operands as they will be scanned again. */
- free_defs (&(ann->def_ops), true);
- free_uses (&(ann->use_ops), true);
+/* Recursively scan the expression pointed by EXPR_P in statement referred to
+ by INFO. FLAGS is one of the OPF_* constants modifying how to interpret the
+ operands found. */
- /* Before removing existing virtual operands, save them in PREV_VOPS so
- that we can re-use their SSA versions. */
- prev_vops.vdef_ops = VDEF_OPS (ann);
- prev_vops.vuse_ops = VUSE_OPS (ann);
+static void
+get_expr_operands (tree stmt, tree *expr_p, int flags)
+{
+ enum tree_code code;
+ enum tree_code_class class;
+ tree expr = *expr_p;
+ stmt_ann_t s_ann = stmt_ann (stmt);
- /* Dont free the previous values to memory since we're still using them. */
- free_vdefs (&(ann->vdef_ops), false);
- free_vuses (&(ann->vuse_ops), false);
+ if (expr == NULL)
+ return;
- start_ssa_stmt_operands (stmt);
+ code = TREE_CODE (expr);
+ class = TREE_CODE_CLASS (code);
- code = TREE_CODE (stmt);
switch (code)
{
- case MODIFY_EXPR:
- get_expr_operands (stmt, &TREE_OPERAND (stmt, 1), opf_none, &prev_vops);
- get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), opf_is_def, &prev_vops);
- break;
+ case ADDR_EXPR:
+ /* We could have the address of a component, array member,
+ etc which has interesting variable references. */
+ /* Taking the address of a variable does not represent a
+ reference to it, but the fact that the stmt takes its address will be
+ of interest to some passes (e.g. alias resolution). */
+ add_stmt_operand (expr_p, s_ann, 0);
- case COND_EXPR:
- get_expr_operands (stmt, &COND_EXPR_COND (stmt), opf_none, &prev_vops);
- break;
+ /* If the address is invariant, there may be no interesting variable
+ references inside. */
+ if (is_gimple_min_invariant (expr))
+ return;
- case SWITCH_EXPR:
- get_expr_operands (stmt, &SWITCH_COND (stmt), opf_none, &prev_vops);
- break;
+ /* There should be no VUSEs created, since the referenced objects are
+ not really accessed. The only operands that we should find here
+ are ARRAY_REF indices which will always be real operands (GIMPLE
+ does not allow non-registers as array indices). */
+ flags |= opf_no_vops;
- case ASM_EXPR:
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+ return;
+
+ case SSA_NAME:
+ case VAR_DECL:
+ case PARM_DECL:
+ case RESULT_DECL:
+ case CONST_DECL:
{
- int noutputs = list_length (ASM_OUTPUTS (stmt));
- const char **oconstraints
- = (const char **) alloca ((noutputs) * sizeof (const char *));
- int i;
- tree link;
- const char *constraint;
- bool allows_mem, allows_reg, is_inout;
-
- for (i=0, link = ASM_OUTPUTS (stmt); link;
- ++i, link = TREE_CHAIN (link))
+ subvar_t svars;
+
+ /* Add the subvars for a variable if it has subvars, to DEFS or USES.
+ Otherwise, add the variable itself.
+ Whether it goes to USES or DEFS depends on the operand flags. */
+ if (var_can_have_subvars (expr)
+ && (svars = get_subvars_for_var (expr)))
{
- oconstraints[i] = constraint
- = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
- parse_output_constraint (&constraint, i, 0, 0,
- &allows_mem, &allows_reg, &is_inout);
- if (allows_reg && is_inout)
- /* This should have been split in gimplify_asm_expr. */
- abort ();
-
- if (!allows_reg && allows_mem)
- {
- tree t = get_base_address (TREE_VALUE (link));
- if (t && DECL_P (t))
- mark_call_clobbered (t);
- }
-
- get_expr_operands (stmt, &TREE_VALUE (link), opf_is_def,
- &prev_vops);
+ subvar_t sv;
+ for (sv = svars; sv; sv = sv->next)
+ add_stmt_operand (&sv->var, s_ann, flags);
}
-
- for (link = ASM_INPUTS (stmt); link; link = TREE_CHAIN (link))
+ else
{
- constraint
- = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
- parse_input_constraint (&constraint, 0, 0, noutputs, 0,
- oconstraints, &allows_mem, &allows_reg);
+ add_stmt_operand (expr_p, s_ann, flags);
+ }
+ return;
+ }
+ case MISALIGNED_INDIRECT_REF:
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
+ /* fall through */
+
+ case ALIGN_INDIRECT_REF:
+ case INDIRECT_REF:
+ get_indirect_ref_operands (stmt, expr, flags);
+ return;
- if (!allows_reg && allows_mem)
+ case TARGET_MEM_REF:
+ get_tmr_operands (stmt, expr, flags);
+ return;
+
+ case ARRAY_REF:
+ case ARRAY_RANGE_REF:
+ /* Treat array references as references to the virtual variable
+ representing the array. The virtual variable for an ARRAY_REF
+ is the VAR_DECL for the array. */
+
+ /* Add the virtual variable for the ARRAY_REF to VDEFS or VUSES
+ according to the value of IS_DEF. Recurse if the LHS of the
+ ARRAY_REF node is not a regular variable. */
+ if (SSA_VAR_P (TREE_OPERAND (expr, 0)))
+ add_stmt_operand (expr_p, s_ann, flags);
+ else
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 3), opf_none);
+ return;
+
+ case COMPONENT_REF:
+ case REALPART_EXPR:
+ case IMAGPART_EXPR:
+ {
+ tree ref;
+ HOST_WIDE_INT offset, size;
+ /* This component ref becomes an access to all of the subvariables
+ it can touch, if we can determine that, but *NOT* the real one.
+ If we can't determine which fields we could touch, the recursion
+ will eventually get to a variable and add *all* of its subvars, or
+ whatever is the minimum correct subset. */
+
+ ref = okay_component_ref_for_subvars (expr, &offset, &size);
+ if (ref)
+ {
+ subvar_t svars = get_subvars_for_var (ref);
+ subvar_t sv;
+ for (sv = svars; sv; sv = sv->next)
{
- tree t = get_base_address (TREE_VALUE (link));
- if (t && DECL_P (t))
- mark_call_clobbered (t);
+ bool exact;
+ if (overlap_subvar (offset, size, sv, &exact))
+ {
+ if (!exact)
+ flags &= ~opf_kill_def;
+ add_stmt_operand (&sv->var, s_ann, flags);
+ }
}
-
- get_expr_operands (stmt, &TREE_VALUE (link), 0, &prev_vops);
}
+ else
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0),
+ flags & ~opf_kill_def);
+
+ if (code == COMPONENT_REF)
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
+ return;
+ }
+ case WITH_SIZE_EXPR:
+ /* WITH_SIZE_EXPR is a pass-through reference to its first argument,
+ and an rvalue reference to its second argument. */
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+ return;
+
+ case CALL_EXPR:
+ get_call_expr_operands (stmt, expr);
+ return;
+
+ case COND_EXPR:
+ case VEC_COND_EXPR:
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_none);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
+ return;
+
+ case MODIFY_EXPR:
+ {
+ int subflags;
+ tree op;
+
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
+
+ op = TREE_OPERAND (expr, 0);
+ if (TREE_CODE (op) == WITH_SIZE_EXPR)
+ op = TREE_OPERAND (expr, 0);
+ if (TREE_CODE (op) == ARRAY_REF
+ || TREE_CODE (op) == ARRAY_RANGE_REF
+ || TREE_CODE (op) == REALPART_EXPR
+ || TREE_CODE (op) == IMAGPART_EXPR)
+ subflags = opf_is_def;
+ else
+ subflags = opf_is_def | opf_kill_def;
+
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), subflags);
+ return;
+ }
- /* Clobber memory for asm ("" : : : "memory"); */
- for (link = ASM_CLOBBERS (stmt); link; link = TREE_CHAIN (link))
- if (!strcmp (TREE_STRING_POINTER (TREE_VALUE (link)), "memory"))
- add_call_clobber_ops (stmt, &prev_vops);
+ case CONSTRUCTOR:
+ {
+ /* General aggregate CONSTRUCTORs have been decomposed, but they
+ are still in use as the COMPLEX_EXPR equivalent for vectors. */
+
+ tree t;
+ for (t = TREE_OPERAND (expr, 0); t ; t = TREE_CHAIN (t))
+ get_expr_operands (stmt, &TREE_VALUE (t), opf_none);
+
+ return;
}
- break;
- case RETURN_EXPR:
- get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), opf_none, &prev_vops);
- break;
+ case TRUTH_NOT_EXPR:
+ case BIT_FIELD_REF:
+ case VIEW_CONVERT_EXPR:
+ do_unary:
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+ return;
- case GOTO_EXPR:
- get_expr_operands (stmt, &GOTO_DESTINATION (stmt), opf_none, &prev_vops);
- break;
+ case TRUTH_AND_EXPR:
+ case TRUTH_OR_EXPR:
+ case TRUTH_XOR_EXPR:
+ case COMPOUND_EXPR:
+ case OBJ_TYPE_REF:
+ case ASSERT_EXPR:
+ do_binary:
+ {
+ tree op0 = TREE_OPERAND (expr, 0);
+ tree op1 = TREE_OPERAND (expr, 1);
- case LABEL_EXPR:
- get_expr_operands (stmt, &LABEL_EXPR_LABEL (stmt), opf_none, &prev_vops);
- break;
+ /* If it would be profitable to swap the operands, then do so to
+ canonicalize the statement, enabling better optimization.
- /* These nodes contain no variable references. */
- case BIND_EXPR:
- case CASE_LABEL_EXPR:
- case TRY_CATCH_EXPR:
- case TRY_FINALLY_EXPR:
- case EH_FILTER_EXPR:
- case CATCH_EXPR:
- case RESX_EXPR:
- break;
+ By placing canonicalization of such expressions here we
+ transparently keep statements in canonical form, even
+ when the statement is modified. */
+ if (tree_swap_operands_p (op0, op1, false))
+ {
+ /* For relationals we need to swap the operands
+ and change the code. */
+ if (code == LT_EXPR
+ || code == GT_EXPR
+ || code == LE_EXPR
+ || code == GE_EXPR)
+ {
+ TREE_SET_CODE (expr, swap_tree_comparison (code));
+ swap_tree_operands (stmt,
+ &TREE_OPERAND (expr, 0),
+ &TREE_OPERAND (expr, 1));
+ }
+
+ /* For a commutative operator we can just swap the operands. */
+ else if (commutative_tree_code (code))
+ {
+ swap_tree_operands (stmt,
+ &TREE_OPERAND (expr, 0),
+ &TREE_OPERAND (expr, 1));
+ }
+ }
- default:
- /* Notice that if get_expr_operands tries to use &STMT as the operand
- pointer (which may only happen for USE operands), we will abort in
- append_use. This default will handle statements like empty statements,
- CALL_EXPRs or VA_ARG_EXPRs that may appear on the RHS of a statement
- or as statements themselves. */
- get_expr_operands (stmt, &stmt, opf_none, &prev_vops);
- break;
- }
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
+ return;
+ }
- finalize_ssa_stmt_operands (stmt);
+ case REALIGN_LOAD_EXPR:
+ {
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 2), flags);
+ return;
+ }
- /* Now free the previous virtual ops to memory. */
- free_vdefs (&(prev_vops.vdef_ops), true);
- free_vuses (&(prev_vops.vuse_ops), true);
+ case BLOCK:
+ case FUNCTION_DECL:
+ case EXC_PTR_EXPR:
+ case FILTER_EXPR:
+ case LABEL_DECL:
+ /* Expressions that make no memory references. */
+ return;
- /* Clear the modified bit for STMT. Subsequent calls to
- get_stmt_operands for this statement will do nothing until the
- statement is marked modified by a call to modify_stmt(). */
- ann->modified = 0;
+ default:
+ if (class == tcc_unary)
+ goto do_unary;
+ if (class == tcc_binary || class == tcc_comparison)
+ goto do_binary;
+ if (class == tcc_constant || class == tcc_type)
+ return;
+ }
- timevar_pop (TV_TREE_OPS);
+ /* If we get here, something has gone wrong. */
+#ifdef ENABLE_CHECKING
+ fprintf (stderr, "unhandled expression in get_expr_operands():\n");
+ debug_tree (expr);
+ fputs ("\n", stderr);
+ internal_error ("internal error");
+#endif
+ gcc_unreachable ();
}
-/* Recursively scan the expression pointed by EXPR_P in statement STMT.
- FLAGS is one of the OPF_* constants modifying how to interpret the
- operands found. PREV_VOPS is as in append_vdef and append_vuse. */
+/* Scan operands in the ASM_EXPR stmt referred to in INFO. */
static void
-get_expr_operands (tree stmt, tree *expr_p, int flags, voperands_t prev_vops)
+get_asm_expr_operands (tree stmt)
{
- enum tree_code code;
- char class;
- tree expr = *expr_p;
-
- if (expr == NULL || expr == error_mark_node)
- return;
-
- code = TREE_CODE (expr);
- class = TREE_CODE_CLASS (code);
-
- /* Expressions that make no memory references. */
- if (class == 'c'
- || class == 't'
- || code == BLOCK
- || code == FUNCTION_DECL
- || code == EXC_PTR_EXPR
- || code == FILTER_EXPR
- || code == LABEL_DECL)
- return;
-
- /* We could have the address of a component, array member, etc which
- has interesting variable references. */
- if (code == ADDR_EXPR)
+ stmt_ann_t s_ann = stmt_ann (stmt);
+ int noutputs = list_length (ASM_OUTPUTS (stmt));
+ const char **oconstraints
+ = (const char **) alloca ((noutputs) * sizeof (const char *));
+ int i;
+ tree link;
+ const char *constraint;
+ bool allows_mem, allows_reg, is_inout;
+
+ for (i=0, link = ASM_OUTPUTS (stmt); link; ++i, link = TREE_CHAIN (link))
{
- enum tree_code subcode = TREE_CODE (TREE_OPERAND (expr, 0));
-
- /* Taking the address of a variable does not represent a
- reference to it, but the fact that STMT takes its address will be
- of interest to some passes (e.g. alias resolution). */
- add_stmt_operand (expr_p, stmt, 0, NULL);
+ oconstraints[i] = constraint
+ = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
+ parse_output_constraint (&constraint, i, 0, 0,
+ &allows_mem, &allows_reg, &is_inout);
- /* If the address is invariant, there may be no interesting variable
- references inside. */
- if (is_gimple_min_invariant (expr))
- return;
+ /* This should have been split in gimplify_asm_expr. */
+ gcc_assert (!allows_reg || !is_inout);
- /* There should be no VUSEs created, since the referenced objects are
- not really accessed. The only operands that we should find here
- are ARRAY_REF indices which will always be real operands (GIMPLE
- does not allow non-registers as array indices). */
- flags |= opf_no_vops;
+ /* Memory operands are addressable. Note that STMT needs the
+ address of this operand. */
+ if (!allows_reg && allows_mem)
+ {
+ tree t = get_base_address (TREE_VALUE (link));
+ if (t && DECL_P (t))
+ note_addressable (t, s_ann);
+ }
- /* Avoid recursion. */
- code = subcode;
- class = TREE_CODE_CLASS (code);
- expr_p = &TREE_OPERAND (expr, 0);
- expr = *expr_p;
+ get_expr_operands (stmt, &TREE_VALUE (link), opf_is_def);
}
- /* If we found a variable, add it to DEFS or USES depending on the
- operand flags. */
- if (SSA_VAR_P (expr))
+ for (link = ASM_INPUTS (stmt); link; link = TREE_CHAIN (link))
{
- add_stmt_operand (expr_p, stmt, flags, prev_vops);
- return;
+ constraint
+ = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
+ parse_input_constraint (&constraint, 0, 0, noutputs, 0,
+ oconstraints, &allows_mem, &allows_reg);
+
+ /* Memory operands are addressable. Note that STMT needs the
+ address of this operand. */
+ if (!allows_reg && allows_mem)
+ {
+ tree t = get_base_address (TREE_VALUE (link));
+ if (t && DECL_P (t))
+ note_addressable (t, s_ann);
+ }
+
+ get_expr_operands (stmt, &TREE_VALUE (link), 0);
}
- /* Pointer dereferences always represent a use of the base pointer. */
- if (code == INDIRECT_REF)
- {
- tree *pptr = &TREE_OPERAND (expr, 0);
- tree ptr = *pptr;
- if (SSA_VAR_P (ptr))
- {
- if (!aliases_computed_p)
+ /* Clobber memory for asm ("" : : : "memory"); */
+ for (link = ASM_CLOBBERS (stmt); link; link = TREE_CHAIN (link))
+ if (strcmp (TREE_STRING_POINTER (TREE_VALUE (link)), "memory") == 0)
+ {
+ unsigned i;
+ bitmap_iterator bi;
+
+ /* Clobber all call-clobbered variables (or .GLOBAL_VAR if we
+ decided to group them). */
+ if (global_var)
+ add_stmt_operand (&global_var, s_ann, opf_is_def);
+ else
+ EXECUTE_IF_SET_IN_BITMAP (call_clobbered_vars, 0, i, bi)
+ {
+ tree var = referenced_var (i);
+ add_stmt_operand (&var, s_ann, opf_is_def | opf_non_specific);
+ }
+
+ /* Now clobber all addressables. */
+ EXECUTE_IF_SET_IN_BITMAP (addressable_vars, 0, i, bi)
{
- /* If the pointer does not have a memory tag and aliases have not
- been computed yet, mark the statement as having volatile
- operands to prevent DOM from entering it in equivalence tables
- and DCE from killing it. */
- stmt_ann (stmt)->has_volatile_ops = true;
+ tree var = referenced_var (i);
+
+ /* Subvars are explicitly represented in this list, so
+ we don't need the original to be added to the clobber
+ ops, but the original *will* be in this list because
+ we keep the addressability of the original
+ variable up-to-date so we don't screw up the rest of
+ the backend. */
+ if (var_can_have_subvars (var)
+ && get_subvars_for_var (var) != NULL)
+ continue;
+
+ add_stmt_operand (&var, s_ann, opf_is_def | opf_non_specific);
}
- else
- {
- ssa_name_ann_t ptr_ann = NULL;
- /* If we have computed aliasing already, check if PTR has
- flow-sensitive points-to information. */
- if (TREE_CODE (ptr) == SSA_NAME
- && (ptr_ann = ssa_name_ann (ptr)) != NULL
- && ptr_ann->name_mem_tag)
- {
- /* PTR has its own memory tag. Use it. */
- add_stmt_operand (&ptr_ann->name_mem_tag, stmt, flags,
- prev_vops);
- }
- else
- {
- /* If PTR is not an SSA_NAME or it doesn't have a name
- tag, use its type memory tag. */
- var_ann_t ann;
-
- /* If we are emitting debugging dumps, display a warning if
- PTR is an SSA_NAME with no flow-sensitive alias
- information. That means that we may need to compute
- aliasing again. */
- if (dump_file
- && TREE_CODE (ptr) == SSA_NAME
- && ptr_ann == NULL)
- {
- fprintf (dump_file,
- "NOTE: no flow-sensitive alias info for ");
- print_generic_expr (dump_file, ptr, dump_flags);
- fprintf (dump_file, " in ");
- print_generic_stmt (dump_file, stmt, dump_flags);
- }
+ break;
+ }
+}
- if (TREE_CODE (ptr) == SSA_NAME)
- ptr = SSA_NAME_VAR (ptr);
- ann = var_ann (ptr);
- add_stmt_operand (&ann->type_mem_tag, stmt, flags, prev_vops);
- }
- }
- }
+/* A subroutine of get_expr_operands to handle INDIRECT_REF,
+ ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF. */
- /* If a constant is used as a pointer, we can't generate a real
- operand for it but we mark the statement volatile to prevent
- optimizations from messing things up. */
- else if (TREE_CODE (ptr) == INTEGER_CST)
- {
- stmt_ann (stmt)->has_volatile_ops = true;
- return;
- }
+static void
+get_indirect_ref_operands (tree stmt, tree expr, int flags)
+{
+ tree *pptr = &TREE_OPERAND (expr, 0);
+ tree ptr = *pptr;
+ stmt_ann_t s_ann = stmt_ann (stmt);
+
+ /* Stores into INDIRECT_REF operands are never killing definitions. */
+ flags &= ~opf_kill_def;
+
+ if (SSA_VAR_P (ptr))
+ {
+ struct ptr_info_def *pi = NULL;
- /* Everything else *should* have been folded elsewhere, but users
- are smarter than we in finding ways to write invalid code. We
- cannot just abort here. If we were absolutely certain that we
- do handle all valid cases, then we could just do nothing here.
- That seems optimistic, so attempt to do something logical... */
- else if ((TREE_CODE (ptr) == PLUS_EXPR || TREE_CODE (ptr) == MINUS_EXPR)
- && TREE_CODE (TREE_OPERAND (ptr, 0)) == ADDR_EXPR
- && TREE_CODE (TREE_OPERAND (ptr, 1)) == INTEGER_CST)
+ /* If PTR has flow-sensitive points-to information, use it. */
+ if (TREE_CODE (ptr) == SSA_NAME
+ && (pi = SSA_NAME_PTR_INFO (ptr)) != NULL
+ && pi->name_mem_tag)
{
- /* Make sure we know the object is addressable. */
- pptr = &TREE_OPERAND (ptr, 0);
- add_stmt_operand (pptr, stmt, 0, NULL);
-
- /* Mark the object itself with a VUSE. */
- pptr = &TREE_OPERAND (*pptr, 0);
- get_expr_operands (stmt, pptr, flags, prev_vops);
- return;
+ /* PTR has its own memory tag. Use it. */
+ add_stmt_operand (&pi->name_mem_tag, s_ann, flags);
}
-
- /* Ok, this isn't even is_gimple_min_invariant. Something's broke. */
else
- abort ();
+ {
+ /* If PTR is not an SSA_NAME or it doesn't have a name
+ tag, use its type memory tag. */
+ var_ann_t v_ann;
+
+ /* If we are emitting debugging dumps, display a warning if
+ PTR is an SSA_NAME with no flow-sensitive alias
+ information. That means that we may need to compute
+ aliasing again. */
+ if (dump_file
+ && TREE_CODE (ptr) == SSA_NAME
+ && pi == NULL)
+ {
+ fprintf (dump_file,
+ "NOTE: no flow-sensitive alias info for ");
+ print_generic_expr (dump_file, ptr, dump_flags);
+ fprintf (dump_file, " in ");
+ print_generic_stmt (dump_file, stmt, dump_flags);
+ }
- /* Add a USE operand for the base pointer. */
- get_expr_operands (stmt, pptr, opf_none, prev_vops);
- return;
+ if (TREE_CODE (ptr) == SSA_NAME)
+ ptr = SSA_NAME_VAR (ptr);
+ v_ann = var_ann (ptr);
+ if (v_ann->type_mem_tag)
+ add_stmt_operand (&v_ann->type_mem_tag, s_ann, flags);
+ }
}
- /* Treat array references as references to the virtual variable
- representing the array. The virtual variable for an ARRAY_REF
- is the VAR_DECL for the array. */
- if (code == ARRAY_REF)
+ /* If a constant is used as a pointer, we can't generate a real
+ operand for it but we mark the statement volatile to prevent
+ optimizations from messing things up. */
+ else if (TREE_CODE (ptr) == INTEGER_CST)
{
- /* Add the virtual variable for the ARRAY_REF to VDEFS or VUSES
- according to the value of IS_DEF. Recurse if the LHS of the
- ARRAY_REF node is not a regular variable. */
- if (SSA_VAR_P (TREE_OPERAND (expr, 0)))
- add_stmt_operand (expr_p, stmt, flags, prev_vops);
- else
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags, prev_vops);
-
- get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none, prev_vops);
+ if (s_ann)
+ s_ann->has_volatile_ops = true;
return;
}
- /* Similarly to arrays, references to compound variables (complex types
- and structures/unions) are globbed.
-
- FIXME: This means that
-
- a.x = 6;
- a.y = 7;
- foo (a.x, a.y);
-
- will not be constant propagated because the two partial
- definitions to 'a' will kill each other. Note that SRA may be
- able to fix this problem if 'a' can be scalarized. */
- if (code == IMAGPART_EXPR || code == REALPART_EXPR || code == COMPONENT_REF)
+ /* Everything else *should* have been folded elsewhere, but users
+ are smarter than we in finding ways to write invalid code. We
+ cannot just assert here. If we were absolutely certain that we
+ do handle all valid cases, then we could just do nothing here.
+ That seems optimistic, so attempt to do something logical... */
+ else if ((TREE_CODE (ptr) == PLUS_EXPR || TREE_CODE (ptr) == MINUS_EXPR)
+ && TREE_CODE (TREE_OPERAND (ptr, 0)) == ADDR_EXPR
+ && TREE_CODE (TREE_OPERAND (ptr, 1)) == INTEGER_CST)
{
- /* If the LHS of the compound reference is not a regular variable,
- recurse to keep looking for more operands in the subexpression. */
- if (SSA_VAR_P (TREE_OPERAND (expr, 0)))
- add_stmt_operand (expr_p, stmt, flags, prev_vops);
- else
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags, prev_vops);
+ /* Make sure we know the object is addressable. */
+ pptr = &TREE_OPERAND (ptr, 0);
+ add_stmt_operand (pptr, s_ann, 0);
+ /* Mark the object itself with a VUSE. */
+ pptr = &TREE_OPERAND (*pptr, 0);
+ get_expr_operands (stmt, pptr, flags);
return;
}
- /* Function calls. Add every argument to USES. If the callee is
- neither pure nor const, create a VDEF reference for GLOBAL_VAR
- (See find_vars_r). */
- if (code == CALL_EXPR)
- {
- tree op;
- int call_flags = call_expr_flags (expr);
+ /* Ok, this isn't even is_gimple_min_invariant. Something's broke. */
+ else
+ gcc_unreachable ();
- /* Find uses in the called function. */
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_none, prev_vops);
+ /* Add a USE operand for the base pointer. */
+ get_expr_operands (stmt, pptr, opf_none);
+}
- for (op = TREE_OPERAND (expr, 1); op; op = TREE_CHAIN (op))
- get_expr_operands (stmt, &TREE_VALUE (op), opf_none, prev_vops);
+/* A subroutine of get_expr_operands to handle TARGET_MEM_REF. */
- get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none, prev_vops);
+static void
+get_tmr_operands (tree stmt, tree expr, int flags)
+{
+ tree tag = TMR_TAG (expr);
- if (bitmap_first_set_bit (call_clobbered_vars) >= 0)
- {
- if (!(call_flags
- & (ECF_PURE
- | ECF_CONST
- | ECF_NORETURN
- | ECF_MALLOC
- | ECF_MAY_BE_ALLOCA)))
- add_call_clobber_ops (stmt, prev_vops);
- else if (!(call_flags & (ECF_CONST | ECF_NORETURN)))
- add_call_read_ops (stmt, prev_vops);
- }
- else if (!aliases_computed_p)
- stmt_ann (stmt)->has_volatile_ops = true;
+ /* First record the real operands. */
+ get_expr_operands (stmt, &TMR_BASE (expr), opf_none);
+ get_expr_operands (stmt, &TMR_INDEX (expr), opf_none);
- return;
- }
+ /* MEM_REFs should never be killing. */
+ flags &= ~opf_kill_def;
- /* Lists. */
- if (code == TREE_LIST)
- {
- tree op;
+ if (TMR_SYMBOL (expr))
+ note_addressable (TMR_SYMBOL (expr), stmt_ann (stmt));
- for (op = expr; op; op = TREE_CHAIN (op))
- get_expr_operands (stmt, &TREE_VALUE (op), flags, prev_vops);
+ if (tag)
+ add_stmt_operand (&tag, stmt_ann (stmt), flags);
+ else
+ /* Something weird, so ensure that we will be careful. */
+ stmt_ann (stmt)->has_volatile_ops = true;
+}
- return;
- }
+/* A subroutine of get_expr_operands to handle CALL_EXPR. */
- /* Assignments. */
- if (code == MODIFY_EXPR)
+static void
+get_call_expr_operands (tree stmt, tree expr)
+{
+ tree op;
+ int call_flags = call_expr_flags (expr);
+
+ /* If aliases have been computed already, add V_MAY_DEF or V_USE
+ operands for all the symbols that have been found to be
+ call-clobbered.
+
+ Note that if aliases have not been computed, the global effects
+ of calls will not be included in the SSA web. This is fine
+ because no optimizer should run before aliases have been
+ computed. By not bothering with virtual operands for CALL_EXPRs
+ we avoid adding superfluous virtual operands, which can be a
+ significant compile time sink (See PR 15855). */
+ if (aliases_computed_p
+ && !bitmap_empty_p (call_clobbered_vars)
+ && !(call_flags & ECF_NOVOPS))
{
- get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none, prev_vops);
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_is_def, prev_vops);
- return;
+ /* A 'pure' or a 'const' function never call-clobbers anything.
+ A 'noreturn' function might, but since we don't return anyway
+ there is no point in recording that. */
+ if (TREE_SIDE_EFFECTS (expr)
+ && !(call_flags & (ECF_PURE | ECF_CONST | ECF_NORETURN)))
+ add_call_clobber_ops (stmt);
+ else if (!(call_flags & ECF_CONST))
+ add_call_read_ops (stmt);
}
+ /* Find uses in the called function. */
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_none);
- /* Mark VA_ARG_EXPR nodes as making volatile references. FIXME,
- this is needed because we currently do not gimplify VA_ARG_EXPR
- properly. */
- if (code == VA_ARG_EXPR)
- {
- stmt_ann (stmt)->has_volatile_ops = true;
- return;
- }
-
- /* Unary expressions. */
- if (class == '1'
- || code == TRUTH_NOT_EXPR
- || code == BIT_FIELD_REF
- || code == CONSTRUCTOR)
- {
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags, prev_vops);
- return;
- }
+ for (op = TREE_OPERAND (expr, 1); op; op = TREE_CHAIN (op))
+ get_expr_operands (stmt, &TREE_VALUE (op), opf_none);
- /* Binary expressions. */
- if (class == '2'
- || class == '<'
- || code == TRUTH_AND_EXPR
- || code == TRUTH_OR_EXPR
- || code == TRUTH_XOR_EXPR
- || code == COMPOUND_EXPR)
- {
- get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags, prev_vops);
- get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags, prev_vops);
- return;
- }
+ get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
- /* If we get here, something has gone wrong. */
- fprintf (stderr, "unhandled expression in get_expr_operands():\n");
- debug_tree (expr);
- fputs ("\n", stderr);
- abort ();
}
-/* Add *VAR_P to the appropriate operand array of STMT. FLAGS is as in
+/* Add *VAR_P to the appropriate operand array for INFO. FLAGS is as in
get_expr_operands. If *VAR_P is a GIMPLE register, it will be added to
the statement's real operands, otherwise it is added to virtual
- operands.
-
- PREV_VOPS is used when adding virtual operands to statements that
- already had them (See append_vdef and append_vuse). */
+ operands. */
static void
-add_stmt_operand (tree *var_p, tree stmt, int flags, voperands_t prev_vops)
+add_stmt_operand (tree *var_p, stmt_ann_t s_ann, int flags)
{
bool is_real_op;
tree var, sym;
- stmt_ann_t s_ann;
var_ann_t v_ann;
var = *var_p;
STRIP_NOPS (var);
- s_ann = stmt_ann (stmt);
-
/* If the operand is an ADDR_EXPR, add its operand to the list of
variables that have had their address taken in this statement. */
if (TREE_CODE (var) == ADDR_EXPR)
sym = (TREE_CODE (var) == SSA_NAME ? SSA_NAME_VAR (var) : var);
v_ann = var_ann (sym);
- /* FIXME: We currently refuse to optimize variables that have hidden uses
- (variables used in VLA declarations, MD builtin calls and variables
- from the parent function in nested functions). This is because not
- all uses of these variables are exposed in the IL or the statements
- that reference them are not in GIMPLE form. If that's the case, mark
- the statement as having volatile operands and return. */
- if (v_ann->has_hidden_use)
- {
- s_ann->has_volatile_ops = true;
- return;
- }
-
- /* Don't expose volatile variables to the optimizers. */
- if (TREE_THIS_VOLATILE (sym))
+ /* Mark statements with volatile operands. Optimizers should back
+ off from statements having volatile operands. */
+ if (TREE_THIS_VOLATILE (sym) && s_ann)
+ s_ann->has_volatile_ops = true;
+
+ /* If the variable cannot be modified and this is a V_MAY_DEF change
+ it into a VUSE. This happens when read-only variables are marked
+ call-clobbered and/or aliased to writable variables. So we only
+ check that this only happens on non-specific stores.
+
+ Note that if this is a specific store, i.e. associated with a
+ modify_expr, then we can't suppress the V_DEF, lest we run into
+ validation problems.
+
+ This can happen when programs cast away const, leaving us with a
+ store to read-only memory. If the statement is actually executed
+ at runtime, then the program is ill formed. If the statement is
+ not executed then all is well. At the very least, we cannot ICE. */
+ if ((flags & opf_non_specific) && unmodifiable_var_p (var))
{
- s_ann->has_volatile_ops = true;
- return;
+ gcc_assert (!is_real_op);
+ flags &= ~(opf_is_def | opf_kill_def);
}
if (is_real_op)
{
/* The variable is a GIMPLE register. Add it to real operands. */
if (flags & opf_is_def)
- append_def (var_p, stmt);
+ append_def (var_p);
else
- append_use (var_p, stmt);
+ append_use (var_p);
}
else
{
aliases = v_ann->may_aliases;
- /* If alias information hasn't been computed yet, then
- addressable variables will not be an alias tag nor will they
- have aliases. In this case, mark the statement as having
- volatile operands. */
- if (!aliases_computed_p && may_be_aliased (var))
- s_ann->has_volatile_ops = true;
-
if (aliases == NULL)
{
/* The variable is not aliased or it is an alias tag. */
if (flags & opf_is_def)
{
- append_vdef (var, stmt, prev_vops);
- if (v_ann->is_alias_tag)
- s_ann->makes_aliased_stores = 1;
+ if (flags & opf_kill_def)
+ {
+ /* Only regular variables or struct fields may get a
+ V_MUST_DEF operand. */
+ gcc_assert (v_ann->mem_tag_kind == NOT_A_TAG
+ || v_ann->mem_tag_kind == STRUCT_FIELD);
+ /* V_MUST_DEF for non-aliased, non-GIMPLE register
+ variable definitions. */
+ append_v_must_def (var);
+ }
+ else
+ {
+ /* Add a V_MAY_DEF for call-clobbered variables and
+ memory tags. */
+ append_v_may_def (var);
+ }
}
else
{
- append_vuse (var, stmt, prev_vops);
- if (v_ann->is_alias_tag)
+ append_vuse (var);
+ if (s_ann && v_ann->is_alias_tag)
s_ann->makes_aliased_loads = 1;
}
}
/* The variable is aliased. Add its aliases to the virtual
operands. */
- if (VARRAY_ACTIVE_SIZE (aliases) == 0)
- abort ();
+ gcc_assert (VARRAY_ACTIVE_SIZE (aliases) != 0);
if (flags & opf_is_def)
{
+ bool added_may_defs_p = false;
+
/* If the variable is also an alias tag, add a virtual
operand for it, otherwise we will miss representing
references to the members of the variable's alias set.
This fixes the bug in gcc.c-torture/execute/20020503-1.c. */
if (v_ann->is_alias_tag)
- append_vdef (var, stmt, prev_vops);
+ {
+ added_may_defs_p = true;
+ append_v_may_def (var);
+ }
for (i = 0; i < VARRAY_ACTIVE_SIZE (aliases); i++)
- append_vdef (VARRAY_TREE (aliases, i), stmt, prev_vops);
+ {
+ /* While VAR may be modifiable, some of its aliases
+ may not be. If that's the case, we don't really
+ need to add them a V_MAY_DEF for them. */
+ tree alias = VARRAY_TREE (aliases, i);
+
+ if (unmodifiable_var_p (alias))
+ append_vuse (alias);
+ else
+ {
+ append_v_may_def (alias);
+ added_may_defs_p = true;
+ }
+ }
- s_ann->makes_aliased_stores = 1;
+ if (s_ann && added_may_defs_p)
+ s_ann->makes_aliased_stores = 1;
}
else
{
+ /* Similarly, append a virtual uses for VAR itself, when
+ it is an alias tag. */
if (v_ann->is_alias_tag)
- append_vuse (var, stmt, prev_vops);
+ append_vuse (var);
for (i = 0; i < VARRAY_ACTIVE_SIZE (aliases); i++)
- append_vuse (VARRAY_TREE (aliases, i), stmt, prev_vops);
+ append_vuse (VARRAY_TREE (aliases, i));
- s_ann->makes_aliased_loads = 1;
+ if (s_ann)
+ s_ann->makes_aliased_loads = 1;
}
}
}
}
+
/* Record that VAR had its address taken in the statement with annotations
S_ANN. */
static void
note_addressable (tree var, stmt_ann_t s_ann)
{
+ subvar_t svars;
+
+ if (!s_ann)
+ return;
+
+ /* Note that it is *NOT OKAY* to use the target of a COMPONENT_REF
+ as the only thing we take the address of.
+ See PR 21407 and the ensuing mailing list discussion. */
+
var = get_base_address (var);
if (var && SSA_VAR_P (var))
{
if (s_ann->addresses_taken == NULL)
- s_ann->addresses_taken = BITMAP_GGC_ALLOC ();
- bitmap_set_bit (s_ann->addresses_taken, var_ann (var)->uid);
+ s_ann->addresses_taken = BITMAP_GGC_ALLOC ();
+
+
+ if (var_can_have_subvars (var)
+ && (svars = get_subvars_for_var (var)))
+ {
+ subvar_t sv;
+ for (sv = svars; sv; sv = sv->next)
+ bitmap_set_bit (s_ann->addresses_taken, var_ann (sv->var)->uid);
+ }
+ else
+ bitmap_set_bit (s_ann->addresses_taken, var_ann (var)->uid);
}
}
-
/* Add clobbering definitions for .GLOBAL_VAR or for each of the call
clobbered variables in the function. */
static void
-add_call_clobber_ops (tree stmt, voperands_t prev_vops)
+add_call_clobber_ops (tree stmt)
{
+ int i;
+ unsigned u;
+ tree t;
+ bitmap_iterator bi;
+ stmt_ann_t s_ann = stmt_ann (stmt);
+ struct stmt_ann_d empty_ann;
+
/* Functions that are not const, pure or never return may clobber
call-clobbered variables. */
- stmt_ann (stmt)->makes_clobbering_call = true;
+ if (s_ann)
+ s_ann->makes_clobbering_call = true;
- /* If we had created .GLOBAL_VAR earlier, use it. Otherwise, add a VDEF
- operand for every call clobbered variable. See compute_may_aliases for
- the heuristic used to decide whether to create .GLOBAL_VAR or not. */
+ /* If we created .GLOBAL_VAR earlier, just use it. See compute_may_aliases
+ for the heuristic used to decide whether to create .GLOBAL_VAR or not. */
if (global_var)
- add_stmt_operand (&global_var, stmt, opf_is_def, prev_vops);
- else
{
- size_t i;
+ add_stmt_operand (&global_var, s_ann, opf_is_def);
+ return;
+ }
- EXECUTE_IF_SET_IN_BITMAP (call_clobbered_vars, 0, i,
+ /* If cache is valid, copy the elements into the build vectors. */
+ if (ssa_call_clobbered_cache_valid)
+ {
+ /* Process the caches in reverse order so we are always inserting at
+ the head of the list. */
+ for (i = VEC_length (tree, clobbered_vuses) - 1; i >=0; i--)
+ {
+ t = VEC_index (tree, clobbered_vuses, i);
+ gcc_assert (TREE_CODE (t) != SSA_NAME);
+ var_ann (t)->in_vuse_list = 1;
+ opbuild_append_virtual (&build_vuses, t);
+ }
+ for (i = VEC_length (tree, clobbered_v_may_defs) - 1; i >= 0; i--)
+ {
+ t = VEC_index (tree, clobbered_v_may_defs, i);
+ gcc_assert (TREE_CODE (t) != SSA_NAME);
+ var_ann (t)->in_v_may_def_list = 1;
+ opbuild_append_virtual (&build_v_may_defs, t);
+ }
+ if (s_ann)
{
- tree var = referenced_var (i);
+ s_ann->makes_aliased_loads = clobbered_aliased_loads;
+ s_ann->makes_aliased_stores = clobbered_aliased_stores;
+ }
+ return;
+ }
- /* If VAR is read-only, don't add a VDEF, just a VUSE operand. */
- if (!TREE_READONLY (var))
- add_stmt_operand (&var, stmt, opf_is_def, prev_vops);
- else
- add_stmt_operand (&var, stmt, opf_none, prev_vops);
- });
+ memset (&empty_ann, 0, sizeof (struct stmt_ann_d));
+
+ /* Add a V_MAY_DEF operand for every call clobbered variable. */
+ EXECUTE_IF_SET_IN_BITMAP (call_clobbered_vars, 0, u, bi)
+ {
+ tree var = referenced_var (u);
+ if (unmodifiable_var_p (var))
+ add_stmt_operand (&var, &empty_ann, opf_none);
+ else
+ add_stmt_operand (&var, &empty_ann, opf_is_def | opf_non_specific);
+ }
+
+ clobbered_aliased_loads = empty_ann.makes_aliased_loads;
+ clobbered_aliased_stores = empty_ann.makes_aliased_stores;
+
+ /* Set the flags for a stmt's annotation. */
+ if (s_ann)
+ {
+ s_ann->makes_aliased_loads = empty_ann.makes_aliased_loads;
+ s_ann->makes_aliased_stores = empty_ann.makes_aliased_stores;
}
+
+ /* Prepare empty cache vectors. */
+ VEC_truncate (tree, clobbered_vuses, 0);
+ VEC_truncate (tree, clobbered_v_may_defs, 0);
+
+ /* Now fill the clobbered cache with the values that have been found. */
+ for (i = opbuild_first (&build_vuses);
+ i != OPBUILD_LAST;
+ i = opbuild_next (&build_vuses, i))
+ VEC_safe_push (tree, heap, clobbered_vuses,
+ opbuild_elem_virtual (&build_vuses, i));
+
+ gcc_assert (opbuild_num_elems (&build_vuses)
+ == VEC_length (tree, clobbered_vuses));
+
+ for (i = opbuild_first (&build_v_may_defs);
+ i != OPBUILD_LAST;
+ i = opbuild_next (&build_v_may_defs, i))
+ VEC_safe_push (tree, heap, clobbered_v_may_defs,
+ opbuild_elem_virtual (&build_v_may_defs, i));
+
+ gcc_assert (opbuild_num_elems (&build_v_may_defs)
+ == VEC_length (tree, clobbered_v_may_defs));
+
+ ssa_call_clobbered_cache_valid = true;
}
function. */
static void
-add_call_read_ops (tree stmt, voperands_t prev_vops)
+add_call_read_ops (tree stmt)
{
- /* Otherwise, if the function is not pure, it may reference memory. Add
- a VUSE for .GLOBAL_VAR if it has been created. Otherwise, add a VUSE
- for each call-clobbered variable. See add_referenced_var for the
- heuristic used to decide whether to create .GLOBAL_VAR. */
+ int i;
+ unsigned u;
+ tree t;
+ bitmap_iterator bi;
+ stmt_ann_t s_ann = stmt_ann (stmt);
+ struct stmt_ann_d empty_ann;
+
+ /* if the function is not pure, it may reference memory. Add
+ a VUSE for .GLOBAL_VAR if it has been created. See add_referenced_var
+ for the heuristic used to decide whether to create .GLOBAL_VAR. */
if (global_var)
- add_stmt_operand (&global_var, stmt, opf_none, prev_vops);
+ {
+ add_stmt_operand (&global_var, s_ann, opf_none);
+ return;
+ }
+
+ /* If cache is valid, copy the elements into the build vector. */
+ if (ssa_ro_call_cache_valid)
+ {
+ for (i = VEC_length (tree, ro_call_vuses) - 1; i >=0 ; i--)
+ {
+ /* Process the caches in reverse order so we are always inserting at
+ the head of the list. */
+ t = VEC_index (tree, ro_call_vuses, i);
+ gcc_assert (TREE_CODE (t) != SSA_NAME);
+ var_ann (t)->in_vuse_list = 1;
+ opbuild_append_virtual (&build_vuses, t);
+ }
+ if (s_ann)
+ s_ann->makes_aliased_loads = ro_call_aliased_loads;
+ return;
+ }
+
+ memset (&empty_ann, 0, sizeof (struct stmt_ann_d));
+
+ /* Add a VUSE for each call-clobbered variable. */
+ EXECUTE_IF_SET_IN_BITMAP (call_clobbered_vars, 0, u, bi)
+ {
+ tree var = referenced_var (u);
+ add_stmt_operand (&var, &empty_ann, opf_none | opf_non_specific);
+ }
+
+ ro_call_aliased_loads = empty_ann.makes_aliased_loads;
+ if (s_ann)
+ s_ann->makes_aliased_loads = empty_ann.makes_aliased_loads;
+
+ /* Prepare empty cache vectors. */
+ VEC_truncate (tree, ro_call_vuses, 0);
+
+ /* Now fill the clobbered cache with the values that have been found. */
+ for (i = opbuild_first (&build_vuses);
+ i != OPBUILD_LAST;
+ i = opbuild_next (&build_vuses, i))
+ VEC_safe_push (tree, heap, ro_call_vuses,
+ opbuild_elem_virtual (&build_vuses, i));
+
+ gcc_assert (opbuild_num_elems (&build_vuses)
+ == VEC_length (tree, ro_call_vuses));
+
+ ssa_ro_call_cache_valid = true;
+}
+
+
+/* Scan the immediate_use list for VAR making sure its linked properly.
+ return RTUE iof there is a problem. */
+
+bool
+verify_imm_links (FILE *f, tree var)
+{
+ use_operand_p ptr, prev, list;
+ int count;
+
+ gcc_assert (TREE_CODE (var) == SSA_NAME);
+
+ list = &(SSA_NAME_IMM_USE_NODE (var));
+ gcc_assert (list->use == NULL);
+
+ if (list->prev == NULL)
+ {
+ gcc_assert (list->next == NULL);
+ return false;
+ }
+
+ prev = list;
+ count = 0;
+ for (ptr = list->next; ptr != list; )
+ {
+ if (prev != ptr->prev)
+ goto error;
+
+ if (ptr->use == NULL)
+ goto error; /* 2 roots, or SAFE guard node. */
+ else if (*(ptr->use) != var)
+ goto error;
+
+ prev = ptr;
+ ptr = ptr->next;
+ /* Avoid infinite loops. */
+ if (count++ > 30000)
+ goto error;
+ }
+
+ /* Verify list in the other direction. */
+ prev = list;
+ for (ptr = list->prev; ptr != list; )
+ {
+ if (prev != ptr->next)
+ goto error;
+ prev = ptr;
+ ptr = ptr->prev;
+ if (count-- < 0)
+ goto error;
+ }
+
+ if (count != 0)
+ goto error;
+
+ return false;
+
+ error:
+ if (ptr->stmt && stmt_modified_p (ptr->stmt))
+ {
+ fprintf (f, " STMT MODIFIED. - <%p> ", (void *)ptr->stmt);
+ print_generic_stmt (f, ptr->stmt, TDF_SLIM);
+ }
+ fprintf (f, " IMM ERROR : (use_p : tree - %p:%p)", (void *)ptr,
+ (void *)ptr->use);
+ print_generic_expr (f, USE_FROM_PTR (ptr), TDF_SLIM);
+ fprintf(f, "\n");
+ return true;
+}
+
+
+/* Dump all the immediate uses to FILE. */
+
+void
+dump_immediate_uses_for (FILE *file, tree var)
+{
+ imm_use_iterator iter;
+ use_operand_p use_p;
+
+ gcc_assert (var && TREE_CODE (var) == SSA_NAME);
+
+ print_generic_expr (file, var, TDF_SLIM);
+ fprintf (file, " : -->");
+ if (has_zero_uses (var))
+ fprintf (file, " no uses.\n");
else
+ if (has_single_use (var))
+ fprintf (file, " single use.\n");
+ else
+ fprintf (file, "%d uses.\n", num_imm_uses (var));
+
+ FOR_EACH_IMM_USE_FAST (use_p, iter, var)
{
- size_t i;
+ if (!is_gimple_reg (USE_FROM_PTR (use_p)))
+ print_generic_stmt (file, USE_STMT (use_p), TDF_VOPS);
+ else
+ print_generic_stmt (file, USE_STMT (use_p), TDF_SLIM);
+ }
+ fprintf(file, "\n");
+}
- EXECUTE_IF_SET_IN_BITMAP (call_clobbered_vars, 0, i,
- {
- tree var = referenced_var (i);
- add_stmt_operand (&var, stmt, opf_none, prev_vops);
- });
+/* Dump all the immediate uses to FILE. */
+
+void
+dump_immediate_uses (FILE *file)
+{
+ tree var;
+ unsigned int x;
+
+ fprintf (file, "Immediate_uses: \n\n");
+ for (x = 1; x < num_ssa_names; x++)
+ {
+ var = ssa_name(x);
+ if (!var)
+ continue;
+ dump_immediate_uses_for (file, var);
}
}
+
+/* Dump def-use edges on stderr. */
+
+void
+debug_immediate_uses (void)
+{
+ dump_immediate_uses (stderr);
+}
+
+/* Dump def-use edges on stderr. */
+
+void
+debug_immediate_uses_for (tree var)
+{
+ dump_immediate_uses_for (stderr, var);
+}
#include "gt-tree-ssa-operands.h"
OSDN Git Service
