PR rtl-optimization/43520
[official-gcc.git] / gcc / fortran / st.c
blobffef22d11409ef2519d96b9fa430ba148e7def3b
1 /* Build executable statement trees.
2 Copyright (C) 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Andy Vaught
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Executable statements are strung together into a singly linked list
23 of code structures. These structures are later translated into GCC
24 GENERIC tree structures and from there to executable code for a
25 target. */
27 #include "config.h"
28 #include "system.h"
29 #include "gfortran.h"
31 gfc_code new_st;
34 /* Zeroes out the new_st structure. */
36 void
37 gfc_clear_new_st (void)
39 memset (&new_st, '\0', sizeof (new_st));
40 new_st.op = EXEC_NOP;
44 /* Get a gfc_code structure. */
46 gfc_code *
47 gfc_get_code (void)
49 gfc_code *c;
51 c = XCNEW (gfc_code);
52 c->loc = gfc_current_locus;
53 return c;
57 /* Given some part of a gfc_code structure, append a set of code to
58 its tail, returning a pointer to the new tail. */
60 gfc_code *
61 gfc_append_code (gfc_code *tail, gfc_code *new_code)
63 if (tail != NULL)
65 while (tail->next != NULL)
66 tail = tail->next;
68 tail->next = new_code;
71 while (new_code->next != NULL)
72 new_code = new_code->next;
74 return new_code;
78 /* Free a single code structure, but not the actual structure itself. */
80 void
81 gfc_free_statement (gfc_code *p)
83 if (p->expr1)
84 gfc_free_expr (p->expr1);
85 if (p->expr2)
86 gfc_free_expr (p->expr2);
88 switch (p->op)
90 case EXEC_NOP:
91 case EXEC_END_BLOCK:
92 case EXEC_ASSIGN:
93 case EXEC_INIT_ASSIGN:
94 case EXEC_GOTO:
95 case EXEC_CYCLE:
96 case EXEC_RETURN:
97 case EXEC_END_PROCEDURE:
98 case EXEC_IF:
99 case EXEC_PAUSE:
100 case EXEC_STOP:
101 case EXEC_ERROR_STOP:
102 case EXEC_EXIT:
103 case EXEC_WHERE:
104 case EXEC_IOLENGTH:
105 case EXEC_POINTER_ASSIGN:
106 case EXEC_DO_WHILE:
107 case EXEC_CONTINUE:
108 case EXEC_TRANSFER:
109 case EXEC_LABEL_ASSIGN:
110 case EXEC_ENTRY:
111 case EXEC_ARITHMETIC_IF:
112 case EXEC_CRITICAL:
113 case EXEC_SYNC_ALL:
114 case EXEC_SYNC_IMAGES:
115 case EXEC_SYNC_MEMORY:
116 break;
118 case EXEC_BLOCK:
119 gfc_free_namespace (p->ext.ns);
120 break;
122 case EXEC_COMPCALL:
123 case EXEC_CALL_PPC:
124 case EXEC_CALL:
125 case EXEC_ASSIGN_CALL:
126 gfc_free_actual_arglist (p->ext.actual);
127 break;
129 case EXEC_SELECT:
130 case EXEC_SELECT_TYPE:
131 if (p->ext.case_list)
132 gfc_free_case_list (p->ext.case_list);
133 break;
135 case EXEC_DO:
136 gfc_free_iterator (p->ext.iterator, 1);
137 break;
139 case EXEC_ALLOCATE:
140 case EXEC_DEALLOCATE:
141 gfc_free_alloc_list (p->ext.alloc.list);
142 break;
144 case EXEC_OPEN:
145 gfc_free_open (p->ext.open);
146 break;
148 case EXEC_CLOSE:
149 gfc_free_close (p->ext.close);
150 break;
152 case EXEC_BACKSPACE:
153 case EXEC_ENDFILE:
154 case EXEC_REWIND:
155 case EXEC_FLUSH:
156 gfc_free_filepos (p->ext.filepos);
157 break;
159 case EXEC_INQUIRE:
160 gfc_free_inquire (p->ext.inquire);
161 break;
163 case EXEC_WAIT:
164 gfc_free_wait (p->ext.wait);
165 break;
167 case EXEC_READ:
168 case EXEC_WRITE:
169 gfc_free_dt (p->ext.dt);
170 break;
172 case EXEC_DT_END:
173 /* The ext.dt member is a duplicate pointer and doesn't need to
174 be freed. */
175 break;
177 case EXEC_FORALL:
178 gfc_free_forall_iterator (p->ext.forall_iterator);
179 break;
181 case EXEC_OMP_DO:
182 case EXEC_OMP_END_SINGLE:
183 case EXEC_OMP_PARALLEL:
184 case EXEC_OMP_PARALLEL_DO:
185 case EXEC_OMP_PARALLEL_SECTIONS:
186 case EXEC_OMP_SECTIONS:
187 case EXEC_OMP_SINGLE:
188 case EXEC_OMP_TASK:
189 case EXEC_OMP_WORKSHARE:
190 case EXEC_OMP_PARALLEL_WORKSHARE:
191 gfc_free_omp_clauses (p->ext.omp_clauses);
192 break;
194 case EXEC_OMP_CRITICAL:
195 gfc_free (CONST_CAST (char *, p->ext.omp_name));
196 break;
198 case EXEC_OMP_FLUSH:
199 gfc_free_namelist (p->ext.omp_namelist);
200 break;
202 case EXEC_OMP_ATOMIC:
203 case EXEC_OMP_BARRIER:
204 case EXEC_OMP_MASTER:
205 case EXEC_OMP_ORDERED:
206 case EXEC_OMP_END_NOWAIT:
207 case EXEC_OMP_TASKWAIT:
208 break;
210 default:
211 gfc_internal_error ("gfc_free_statement(): Bad statement");
216 /* Free a code statement and all other code structures linked to it. */
218 void
219 gfc_free_statements (gfc_code *p)
221 gfc_code *q;
223 for (; p; p = q)
225 q = p->next;
227 if (p->block)
228 gfc_free_statements (p->block);
229 gfc_free_statement (p);
230 gfc_free (p);