/* Interprocedural reference lists.
- Copyright (C) 2010, 2011, 2012
- Free Software Foundation, Inc.
+ Copyright (C) 2010-2021 Free Software Foundation, Inc.
Contributed by Jan Hubicka
This file is part of GCC.
#include "config.h"
#include "system.h"
#include "coretypes.h"
-#include "tree.h"
-#include "ggc.h"
#include "target.h"
+#include "tree.h"
#include "cgraph.h"
-static const char *ipa_ref_use_name[] = {"read","write","addr","alias"};
-
-/* Return ipa reference from REFERING_NODE or REFERING_VARPOOL_NODE
- to REFERED_NODE or REFERED_VARPOOL_NODE. USE_TYPE specify type
- of the use and STMT the statement (if it exists). */
-
-struct ipa_ref *
-ipa_record_reference (symtab_node referring_node,
- symtab_node referred_node,
- enum ipa_ref_use use_type, gimple stmt)
-{
- struct ipa_ref *ref;
- struct ipa_ref_list *list, *list2;
- VEC(ipa_ref_t,gc) *old_references;
-
- gcc_checking_assert (!stmt || symtab_function_p (referring_node));
- gcc_checking_assert (use_type != IPA_REF_ALIAS || !stmt);
-
- list = &referring_node->symbol.ref_list;
- old_references = list->references;
- VEC_safe_grow (ipa_ref_t, gc, list->references,
- VEC_length (ipa_ref_t, list->references) + 1);
- ref = VEC_last (ipa_ref_t, list->references);
-
- list2 = &referred_node->symbol.ref_list;
- VEC_safe_push (ipa_ref_ptr, heap, list2->referring, ref);
- ref->referred_index = VEC_length (ipa_ref_ptr, list2->referring) - 1;
- ref->referring = referring_node;
- ref->referred = referred_node;
- ref->stmt = stmt;
- ref->use = use_type;
-
- /* If vector was moved in memory, update pointers. */
- if (old_references != list->references)
- {
- int i;
- for (i = 0; ipa_ref_list_reference_iterate (list, i, ref); i++)
- VEC_replace (ipa_ref_ptr,
- ipa_ref_referred_ref_list (ref)->referring,
- ref->referred_index, ref);
- }
- return ref;
-}
-
-/* Remove reference REF. */
+/* Remove reference. */
void
-ipa_remove_reference (struct ipa_ref *ref)
+ipa_ref::remove_reference ()
{
- struct ipa_ref_list *list = ipa_ref_referred_ref_list (ref);
- struct ipa_ref_list *list2 = ipa_ref_referring_ref_list (ref);
- VEC(ipa_ref_t,gc) *old_references = list2->references;
+ struct ipa_ref_list *list = referred_ref_list ();
+ struct ipa_ref_list *list2 = referring_ref_list ();
struct ipa_ref *last;
- gcc_assert (VEC_index (ipa_ref_ptr, list->referring, ref->referred_index) == ref);
- last = VEC_last (ipa_ref_ptr, list->referring);
- if (ref != last)
- {
- VEC_replace (ipa_ref_ptr, list->referring,
- ref->referred_index,
- VEC_last (ipa_ref_ptr, list->referring));
- VEC_index (ipa_ref_ptr, list->referring,
- ref->referred_index)->referred_index = ref->referred_index;
- }
- VEC_pop (ipa_ref_ptr, list->referring);
+ gcc_assert (list->referring[referred_index] == this);
- last = VEC_last (ipa_ref_t, list2->references);
- if (ref != last)
+ last = list->referring.last ();
+ if (this != last)
{
- *ref = *last;
- VEC_replace (ipa_ref_ptr,
- ipa_ref_referred_ref_list (ref)->referring,
- ref->referred_index, ref);
+ if (use == IPA_REF_ALIAS)
+ {
+ /* If deleted item is IPA_REF_ALIAS, we have to move last
+ item of IPA_REF_LIST type to the deleted position. After that
+ we replace last node with deletion slot. */
+ struct ipa_ref *last_alias = list->last_alias ();
+
+ if (last_alias && referred_index < last_alias->referred_index
+ && last_alias != last)
+ {
+ unsigned last_alias_index = last_alias->referred_index;
+
+ list->referring[referred_index] = last_alias;
+ list->referring[referred_index]->referred_index = referred_index;
+
+ /* New position for replacement is previous index
+ of the last_alias. */
+ referred_index = last_alias_index;
+ }
+ }
+
+ list->referring[referred_index] = list->referring.last ();
+ list->referring[referred_index]->referred_index= referred_index;
}
- VEC_pop (ipa_ref_t, list2->references);
- gcc_assert (list2->references == old_references);
-}
-
-/* Remove all references in ref list LIST. */
-
-void
-ipa_remove_all_references (struct ipa_ref_list *list)
-{
- while (VEC_length (ipa_ref_t, list->references))
- ipa_remove_reference (VEC_last (ipa_ref_t, list->references));
- VEC_free (ipa_ref_t, gc, list->references);
- list->references = NULL;
-}
-
-/* Remove all references in ref list LIST. */
+ list->referring.pop ();
-void
-ipa_remove_all_referring (struct ipa_ref_list *list)
-{
- while (VEC_length (ipa_ref_ptr, list->referring))
- ipa_remove_reference (VEC_last (ipa_ref_ptr, list->referring));
- VEC_free (ipa_ref_ptr, heap, list->referring);
- list->referring = NULL;
-}
+ last = &list2->references.last ();
-/* Dump references in LIST to FILE. */
+ struct ipa_ref *ref = this;
-void
-ipa_dump_references (FILE * file, struct ipa_ref_list *list)
-{
- struct ipa_ref *ref;
- int i;
- for (i = 0; ipa_ref_list_reference_iterate (list, i, ref); i++)
- {
- fprintf (file, "%s/%i (%s)",
- symtab_node_asm_name (ref->referred),
- ref->referred->symbol.order,
- ipa_ref_use_name [ref->use]);
- }
- fprintf (file, "\n");
-}
-
-/* Dump referring in LIST to FILE. */
-
-void
-ipa_dump_referring (FILE * file, struct ipa_ref_list *list)
-{
- struct ipa_ref *ref;
- int i;
- for (i = 0; ipa_ref_list_referring_iterate (list, i, ref); i++)
+ if (ref != last)
{
- fprintf (file, "%s/%i (%s)",
- symtab_node_asm_name (ref->referring),
- ref->referring->symbol.order,
- ipa_ref_use_name [ref->use]);
+ *ref = *last;
+ ref->referred_ref_list ()->referring[referred_index] = ref;
}
- fprintf (file, "\n");
+ list2->references.pop ();
}
-/* Clone all references from SRC to DEST_NODE or DEST_VARPOOL_NODE. */
+/* Return true when execution of reference can lead to return from
+ function. */
-void
-ipa_clone_references (symtab_node dest_node,
- struct ipa_ref_list *src)
+bool
+ipa_ref::cannot_lead_to_return ()
{
- struct ipa_ref *ref;
- int i;
- for (i = 0; ipa_ref_list_reference_iterate (src, i, ref); i++)
- ipa_record_reference (dest_node,
- ref->referred,
- ref->use, ref->stmt);
+ return dyn_cast <cgraph_node *> (referring)->cannot_return_p ();
}
-/* Clone all referring from SRC to DEST_NODE or DEST_VARPOOL_NODE. */
+/* Return reference list this reference is in. */
-void
-ipa_clone_referring (symtab_node dest_node,
- struct ipa_ref_list *src)
+struct ipa_ref_list *
+ipa_ref::referring_ref_list (void)
{
- struct ipa_ref *ref;
- int i;
- for (i = 0; ipa_ref_list_referring_iterate (src, i, ref); i++)
- ipa_record_reference (ref->referring,
- dest_node,
- ref->use, ref->stmt);
+ return &referring->ref_list;
}
-/* Return true when execution of REF can lead to return from
- function. */
-bool
-ipa_ref_cannot_lead_to_return (struct ipa_ref *ref)
-{
- return cgraph_node_cannot_return (ipa_ref_referring_node (ref));
-}
+/* Return reference list this reference is in. */
-/* Return true if list contains an alias. */
-bool
-ipa_ref_has_aliases_p (struct ipa_ref_list *ref_list)
+struct ipa_ref_list *
+ipa_ref::referred_ref_list (void)
{
- struct ipa_ref *ref;
- int i;
- for (i = 0; ipa_ref_list_referring_iterate (ref_list, i, ref); i++)
- if (ref->use == IPA_REF_ALIAS)
- return true;
- return false;
+ return &referred->ref_list;
}