summaryrefslogtreecommitdiff
path: root/gcc/lists.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/lists.c')
-rw-r--r--gcc/lists.c84
1 files changed, 4 insertions, 80 deletions
diff --git a/gcc/lists.c b/gcc/lists.c
index 23529a362e2..ff4ad8fa652 100644
--- a/gcc/lists.c
+++ b/gcc/lists.c
@@ -28,7 +28,6 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
#include "ggc.h"
static void free_list (rtx *, rtx *);
-static void free_DEPS_LIST_node (rtx);
/* Functions for maintaining cache-able lists of EXPR_LIST and INSN_LISTs. */
@@ -38,10 +37,6 @@ static GTY ((deletable)) rtx unused_insn_list;
/* An EXPR_LIST containing all EXPR_LISTs allocated but currently unused. */
static GTY ((deletable)) rtx unused_expr_list;
-/* An DEPS_LIST containing all DEPS_LISTs allocated but currently unused. */
-static GTY ((deletable)) rtx unused_deps_list;
-
-
/* This function will free an entire list of either EXPR_LIST, INSN_LIST
or DEPS_LIST nodes. This is to be used only on lists that consist
exclusively of nodes of one type only. This is only called by
@@ -54,17 +49,13 @@ free_list (rtx *listp, rtx *unused_listp)
prev_link = *listp;
link = XEXP (prev_link, 1);
- gcc_assert ((unused_listp != &unused_insn_list
- || GET_CODE (prev_link) == INSN_LIST)
- && (unused_listp != &unused_deps_list
- || GET_CODE (prev_link) == DEPS_LIST));
+ gcc_assert (unused_listp != &unused_insn_list
+ || GET_CODE (prev_link) == INSN_LIST);
while (link)
{
- gcc_assert ((unused_listp != &unused_insn_list
- || GET_CODE (prev_link) == INSN_LIST)
- && (unused_listp != &unused_deps_list
- || GET_CODE (prev_link) == DEPS_LIST));
+ gcc_assert (unused_listp != &unused_insn_list
+ || GET_CODE (prev_link) == INSN_LIST);
prev_link = link;
link = XEXP (link, 1);
@@ -155,31 +146,6 @@ alloc_EXPR_LIST (int kind, rtx val, rtx next)
return r;
}
-/* This call is used in place of a gen_rtx_DEPS_LIST. If there is a cached
- node available, we'll use it, otherwise a call to gen_rtx_DEPS_LIST
- is made. */
-rtx
-alloc_DEPS_LIST (rtx val, rtx next, int ds)
-{
- rtx r;
-
- if (unused_deps_list)
- {
- r = unused_deps_list;
- unused_deps_list = XEXP (r, 1);
- XEXP (r, 0) = val;
- XEXP (r, 1) = next;
- XINT (r, 2) = ds;
- PUT_REG_NOTE_KIND (r, VOIDmode);
-
- gcc_assert (GET_CODE (r) == DEPS_LIST);
- }
- else
- r = gen_rtx_DEPS_LIST (VOIDmode, val, next, ds);
-
- return r;
-}
-
/* This function will free up an entire list of EXPR_LIST nodes. */
void
free_EXPR_LIST_list (rtx *listp)
@@ -198,15 +164,6 @@ free_INSN_LIST_list (rtx *listp)
free_list (listp, &unused_insn_list);
}
-/* This function will free up an entire list of DEPS_LIST nodes. */
-void
-free_DEPS_LIST_list (rtx *listp)
-{
- if (*listp == 0)
- return;
- free_list (listp, &unused_deps_list);
-}
-
/* This function will free up an individual EXPR_LIST node. */
void
free_EXPR_LIST_node (rtx ptr)
@@ -224,23 +181,6 @@ free_INSN_LIST_node (rtx ptr)
unused_insn_list = ptr;
}
-/* This function will free up an individual DEPS_LIST node. */
-static void
-free_DEPS_LIST_node (rtx ptr)
-{
- gcc_assert (GET_CODE (ptr) == DEPS_LIST);
- XEXP (ptr, 1) = unused_deps_list;
- unused_deps_list = ptr;
-}
-
-/* Remove and free corresponding to ELEM node in the DEPS_LIST pointed to
- by LISTP. */
-void
-remove_free_DEPS_LIST_elem (rtx elem, rtx *listp)
-{
- free_DEPS_LIST_node (remove_list_elem (elem, listp));
-}
-
/* Remove and free corresponding to ELEM node in the INSN_LIST pointed to
by LISTP. */
void
@@ -249,20 +189,4 @@ remove_free_INSN_LIST_elem (rtx elem, rtx *listp)
free_INSN_LIST_node (remove_list_elem (elem, listp));
}
-/* Create and return a copy of the DEPS_LIST LIST. */
-rtx
-copy_DEPS_LIST_list (rtx list)
-{
- rtx res = NULL_RTX, *resp = &res;
-
- while (list)
- {
- *resp = alloc_DEPS_LIST (XEXP (list, 0), 0, XINT (list, 2));
- PUT_REG_NOTE_KIND (*resp, REG_NOTE_KIND (list));
- resp = &XEXP (*resp, 1);
- list = XEXP (list, 1);
- }
- return res;
-}
-
#include "gt-lists.h"