gcc/fortran/st.c

   1 /* Build executable statement trees.
   2    Copyright (C) 2000, 2001, 2002, 2004, 2005, 2006, 2007
   3    Free Software Foundation, Inc.
   4    Contributed by Andy Vaught
   5
   6 This file is part of GCC.
   7
   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 2, or (at your option) any later
  11 version.
  12
  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.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING.  If not, write to the Free
  20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  21 02110-1301, USA.  */
  22
  23 /* Executable statements are strung together into a singly linked list
  24    of code structures.  These structures are later translated into GCC
  25    GENERIC tree structures and from there to executable code for a
  26    target.  */
  27
  28 #include "config.h"
  29 #include "system.h"
  30 #include "gfortran.h"
  31
  32 gfc_code new_st;
  33
  34
  35 /* Zeroes out the new_st structure.  */
  36
  37 void
  38 gfc_clear_new_st (void)
  39 {
  40   memset (&new_st, '\0', sizeof (new_st));
  41   new_st.op = EXEC_NOP;
  42 }
  43
  44
  45 /* Get a gfc_code structure.  */
  46
  47 gfc_code *
  48 gfc_get_code (void)
  49 {
  50   gfc_code *c;
  51
  52   c = gfc_getmem (sizeof (gfc_code));
  53   c->loc = gfc_current_locus;
  54   return c;
  55 }
  56
  57
  58 /* Given some part of a gfc_code structure, append a set of code to
  59    its tail, returning a pointer to the new tail.  */
  60
  61 gfc_code *
  62 gfc_append_code (gfc_code *tail, gfc_code *new)
  63 {
  64   if (tail != NULL)
  65     {
  66       while (tail->next != NULL)
  67         tail = tail->next;
  68
  69       tail->next = new;
  70     }
  71
  72   while (new->next != NULL)
  73     new = new->next;
  74
  75   return new;
  76 }
  77
  78
  79 /* Free a single code structure, but not the actual structure itself.  */
  80
  81 void
  82 gfc_free_statement (gfc_code *p)
  83 {
  84   if (p->expr)
  85     gfc_free_expr (p->expr);
  86   if (p->expr2)
  87     gfc_free_expr (p->expr2);
  88
  89   switch (p->op)
  90     {
  91     case EXEC_NOP:
  92     case EXEC_ASSIGN:
  93     case EXEC_INIT_ASSIGN:
  94     case EXEC_GOTO:
  95     case EXEC_CYCLE:
  96     case EXEC_RETURN:
  97     case EXEC_IF:
  98     case EXEC_PAUSE:
  99     case EXEC_STOP:
 100     case EXEC_EXIT:
 101     case EXEC_WHERE:
 102     case EXEC_IOLENGTH:
 103     case EXEC_POINTER_ASSIGN:
 104     case EXEC_DO_WHILE:
 105     case EXEC_CONTINUE:
 106     case EXEC_TRANSFER:
 107     case EXEC_LABEL_ASSIGN:
 108     case EXEC_ENTRY:
 109     case EXEC_ARITHMETIC_IF:
 110       break;
 111
 112     case EXEC_CALL:
 113     case EXEC_ASSIGN_CALL:
 114       gfc_free_actual_arglist (p->ext.actual);
 115       break;
 116
 117     case EXEC_SELECT:
 118       if (p->ext.case_list)
 119         gfc_free_case_list (p->ext.case_list);
 120       break;
 121
 122     case EXEC_DO:
 123       gfc_free_iterator (p->ext.iterator, 1);
 124       break;
 125
 126     case EXEC_ALLOCATE:
 127     case EXEC_DEALLOCATE:
 128       gfc_free_alloc_list (p->ext.alloc_list);
 129       break;
 130
 131     case EXEC_OPEN:
 132       gfc_free_open (p->ext.open);
 133       break;
 134
 135     case EXEC_CLOSE:
 136       gfc_free_close (p->ext.close);
 137       break;
 138
 139     case EXEC_BACKSPACE:
 140     case EXEC_ENDFILE:
 141     case EXEC_REWIND:
 142     case EXEC_FLUSH:
 143       gfc_free_filepos (p->ext.filepos);
 144       break;
 145
 146     case EXEC_INQUIRE:
 147       gfc_free_inquire (p->ext.inquire);
 148       break;
 149
 150     case EXEC_READ:
 151     case EXEC_WRITE:
 152       gfc_free_dt (p->ext.dt);
 153       break;
 154
 155     case EXEC_DT_END:
 156       /* The ext.dt member is a duplicate pointer and doesn't need to
 157          be freed.  */
 158       break;
 159
 160     case EXEC_FORALL:
 161       gfc_free_forall_iterator (p->ext.forall_iterator);
 162       break;
 163
 164     case EXEC_OMP_DO:
 165     case EXEC_OMP_END_SINGLE:
 166     case EXEC_OMP_PARALLEL:
 167     case EXEC_OMP_PARALLEL_DO:
 168     case EXEC_OMP_PARALLEL_SECTIONS:
 169     case EXEC_OMP_SECTIONS:
 170     case EXEC_OMP_SINGLE:
 171     case EXEC_OMP_WORKSHARE:
 172     case EXEC_OMP_PARALLEL_WORKSHARE:
 173       gfc_free_omp_clauses (p->ext.omp_clauses);
 174       break;
 175
 176     case EXEC_OMP_CRITICAL:
 177       gfc_free ((char *) p->ext.omp_name);
 178       break;
 179
 180     case EXEC_OMP_FLUSH:
 181       gfc_free_namelist (p->ext.omp_namelist);
 182       break;
 183
 184     case EXEC_OMP_ATOMIC:
 185     case EXEC_OMP_BARRIER:
 186     case EXEC_OMP_MASTER:
 187     case EXEC_OMP_ORDERED:
 188     case EXEC_OMP_END_NOWAIT:
 189       break;
 190
 191     default:
 192       gfc_internal_error ("gfc_free_statement(): Bad statement");
 193     }
 194 }
 195
 196
 197 /* Free a code statement and all other code structures linked to it.  */
 198
 199 void
 200 gfc_free_statements (gfc_code *p)
 201 {
 202   gfc_code *q;
 203
 204   for (; p; p = q)
 205     {
 206       q = p->next;
 207
 208       if (p->block)
 209         gfc_free_statements (p->block);
 210       gfc_free_statement (p);
 211       gfc_free (p);
 212     }
 213 }
 214