Line data Source code
1 : /* List management for the GCC expander.
2 : Copyright (C) 1987-2026 Free Software Foundation, Inc.
3 :
4 : This file is part of GCC.
5 :
6 : GCC is free software; you can redistribute it and/or modify it under
7 : the terms of the GNU General Public License as published by the Free
8 : Software Foundation; either version 3, or (at your option) any later
9 : version.
10 :
11 : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 : WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 : for more details.
15 :
16 : You should have received a copy of the GNU General Public License
17 : along with GCC; see the file COPYING3. If not see
18 : <http://www.gnu.org/licenses/>. */
19 :
20 : #include "config.h"
21 : #include "system.h"
22 : #include "coretypes.h"
23 : #include "tm.h"
24 : #include "rtl.h"
25 :
26 : static void free_list (rtx *, rtx *);
27 :
28 : /* Functions for maintaining cache-able lists of EXPR_LIST and INSN_LISTs. */
29 :
30 : /* An INSN_LIST containing all INSN_LISTs allocated but currently unused. */
31 : static GTY ((deletable)) rtx unused_insn_list;
32 :
33 : /* An EXPR_LIST containing all EXPR_LISTs allocated but currently unused. */
34 : static GTY ((deletable)) rtx unused_expr_list;
35 :
36 : /* This function will free an entire list of either EXPR_LIST, INSN_LIST
37 : or DEPS_LIST nodes. This is to be used only on lists that consist
38 : exclusively of nodes of one type only. This is only called by
39 : free_EXPR_LIST_list, free_INSN_LIST_list and free_DEPS_LIST_list. */
40 : static void
41 887445594 : free_list (rtx *listp, rtx *unused_listp)
42 : {
43 887445594 : rtx link, prev_link;
44 :
45 887445594 : prev_link = *listp;
46 887445594 : link = XEXP (prev_link, 1);
47 :
48 887445594 : gcc_assert (unused_listp != &unused_insn_list
49 : || GET_CODE (prev_link) == INSN_LIST);
50 :
51 1090182891 : while (link)
52 : {
53 202737297 : gcc_assert (unused_listp != &unused_insn_list
54 : || GET_CODE (prev_link) == INSN_LIST);
55 :
56 202737297 : prev_link = link;
57 202737297 : link = XEXP (link, 1);
58 : }
59 :
60 887445594 : XEXP (prev_link, 1) = *unused_listp;
61 887445594 : *unused_listp = *listp;
62 887445594 : *listp = 0;
63 887445594 : }
64 :
65 : /* Find corresponding to ELEM node in the list pointed to by LISTP.
66 : This node must exist in the list. Returns pointer to that node. */
67 : static rtx *
68 137697 : find_list_elem (rtx elem, rtx *listp)
69 : {
70 203977 : while (XEXP (*listp, 0) != elem)
71 66280 : listp = &XEXP (*listp, 1);
72 137697 : return listp;
73 : }
74 :
75 : /* Remove the node pointed to by LISTP from the list. */
76 : static void
77 152308 : remove_list_node (rtx *listp)
78 : {
79 152308 : rtx node;
80 :
81 152308 : node = *listp;
82 152308 : *listp = XEXP (node, 1);
83 152308 : XEXP (node, 1) = 0;
84 0 : }
85 :
86 : /* Removes corresponding to ELEM node from the list pointed to by LISTP.
87 : Returns that node. */
88 : rtx
89 137697 : remove_list_elem (rtx elem, rtx *listp)
90 : {
91 137697 : rtx node;
92 :
93 137697 : listp = find_list_elem (elem, listp);
94 137697 : node = *listp;
95 137697 : remove_list_node (listp);
96 137697 : return node;
97 : }
98 :
99 : /* This call is used in place of a gen_rtx_INSN_LIST. If there is a cached
100 : node available, we'll use it, otherwise a call to gen_rtx_INSN_LIST
101 : is made. */
102 : rtx_insn_list *
103 1069140255 : alloc_INSN_LIST (rtx val, rtx next)
104 : {
105 1069140255 : rtx_insn_list *r;
106 :
107 1069140255 : if (unused_insn_list)
108 : {
109 1016252528 : r = as_a <rtx_insn_list *> (unused_insn_list);
110 1016252528 : unused_insn_list = r->next ();
111 1016252528 : XEXP (r, 0) = val;
112 1016252528 : XEXP (r, 1) = next;
113 1016252528 : PUT_REG_NOTE_KIND (r, VOIDmode);
114 :
115 1016252528 : gcc_assert (GET_CODE (r) == INSN_LIST);
116 : }
117 : else
118 52887727 : r = gen_rtx_INSN_LIST (VOIDmode, val, next);
119 :
120 1069140255 : return r;
121 : }
122 :
123 : /* This call is used in place of a gen_rtx_EXPR_LIST. If there is a cached
124 : node available, we'll use it, otherwise a call to gen_rtx_EXPR_LIST
125 : is made. */
126 : rtx_expr_list *
127 831676982 : alloc_EXPR_LIST (int kind, rtx val, rtx next)
128 : {
129 831676982 : rtx_expr_list *r;
130 :
131 831676982 : if (unused_expr_list)
132 : {
133 640931513 : r = as_a <rtx_expr_list *> (unused_expr_list);
134 640931513 : unused_expr_list = XEXP (r, 1);
135 640931513 : XEXP (r, 0) = val;
136 640931513 : XEXP (r, 1) = next;
137 640931513 : PUT_REG_NOTE_KIND (r, kind);
138 : }
139 : else
140 190745469 : r = gen_rtx_EXPR_LIST ((machine_mode) kind, val, next);
141 :
142 831676982 : return r;
143 : }
144 :
145 : /* This function will free up an entire list of EXPR_LIST nodes. */
146 : void
147 62892247 : free_EXPR_LIST_list (rtx_expr_list **listp)
148 : {
149 62892247 : if (*listp == 0)
150 : return;
151 15105485 : free_list ((rtx *)listp, &unused_expr_list);
152 : }
153 :
154 : /* This function will free up an entire list of INSN_LIST nodes. */
155 : void
156 1942995926 : free_INSN_LIST_list (rtx_insn_list **listp)
157 : {
158 1942995926 : if (*listp == 0)
159 : return;
160 872340109 : free_list ((rtx *)listp, &unused_insn_list);
161 : }
162 :
163 : /* Make a copy of the INSN_LIST list LINK and return it. */
164 : rtx_insn_list *
165 2312 : copy_INSN_LIST (rtx_insn_list *link)
166 : {
167 2312 : rtx_insn_list *new_queue;
168 2312 : rtx_insn_list **pqueue = &new_queue;
169 :
170 4631 : for (; link; link = link->next ())
171 : {
172 2319 : rtx_insn *x = link->insn ();
173 2319 : rtx_insn_list *newlink = alloc_INSN_LIST (x, NULL);
174 2319 : *pqueue = newlink;
175 2319 : pqueue = (rtx_insn_list **)&XEXP (newlink, 1);
176 : }
177 2312 : *pqueue = NULL;
178 2312 : return new_queue;
179 : }
180 :
181 : /* Duplicate the INSN_LIST elements of COPY and prepend them to OLD. */
182 : rtx_insn_list *
183 84066 : concat_INSN_LIST (rtx_insn_list *copy, rtx_insn_list *old)
184 : {
185 84066 : rtx_insn_list *new_rtx = old;
186 126129 : for (; copy ; copy = copy->next ())
187 : {
188 42063 : new_rtx = alloc_INSN_LIST (copy->insn (), new_rtx);
189 42063 : PUT_REG_NOTE_KIND (new_rtx, REG_NOTE_KIND (copy));
190 : }
191 84066 : return new_rtx;
192 : }
193 :
194 : /* This function will free up an individual EXPR_LIST node. */
195 : void
196 601792920 : free_EXPR_LIST_node (rtx ptr)
197 : {
198 601792920 : XEXP (ptr, 1) = unused_expr_list;
199 601792920 : unused_expr_list = ptr;
200 601792920 : }
201 :
202 : /* This function will free up an individual INSN_LIST node. */
203 : void
204 151649 : free_INSN_LIST_node (rtx ptr)
205 : {
206 151649 : gcc_assert (GET_CODE (ptr) == INSN_LIST);
207 151649 : XEXP (ptr, 1) = unused_insn_list;
208 151649 : unused_insn_list = ptr;
209 151649 : }
210 :
211 : /* Remove and free corresponding to ELEM node in the INSN_LIST pointed to
212 : by LISTP. */
213 : void
214 137697 : remove_free_INSN_LIST_elem (rtx_insn *elem, rtx_insn_list **listp)
215 : {
216 137697 : free_INSN_LIST_node (remove_list_elem (elem, (rtx *)listp));
217 137697 : }
218 :
219 : /* Remove and free the first node in the INSN_LIST pointed to by LISTP. */
220 : rtx_insn *
221 13947 : remove_free_INSN_LIST_node (rtx_insn_list **listp)
222 : {
223 13947 : rtx_insn_list *node = *listp;
224 13947 : rtx_insn *elem = node->insn ();
225 :
226 13947 : remove_list_node ((rtx *)listp);
227 13947 : free_INSN_LIST_node (node);
228 :
229 13947 : return elem;
230 : }
231 :
232 : /* Remove and free the first node in the EXPR_LIST pointed to by LISTP. */
233 : rtx
234 664 : remove_free_EXPR_LIST_node (rtx_expr_list **listp)
235 : {
236 664 : rtx_expr_list *node = *listp;
237 664 : rtx elem = XEXP (node, 0);
238 :
239 664 : remove_list_node ((rtx *)listp);
240 664 : free_EXPR_LIST_node (node);
241 :
242 664 : return elem;
243 : }
244 :
245 : #include "gt-lists.h"
|
