gcc/gimple-streamer-out.c

   1 /* Routines for emitting GIMPLE to a file stream.
   2
   3    Copyright (C) 2011-2014 Free Software Foundation, Inc.
   4    Contributed by Diego Novillo <dnovillo@google.com>
   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 3, 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 COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tree.h"
  26 #include "predict.h"
  27 #include "vec.h"
  28 #include "hashtab.h"
  29 #include "hash-set.h"
  30 #include "machmode.h"
  31 #include "tm.h"
  32 #include "hard-reg-set.h"
  33 #include "input.h"
  34 #include "function.h"
  35 #include "basic-block.h"
  36 #include "tree-ssa-alias.h"
  37 #include "internal-fn.h"
  38 #include "tree-eh.h"
  39 #include "gimple-expr.h"
  40 #include "is-a.h"
  41 #include "gimple.h"
  42 #include "gimple-iterator.h"
  43 #include "gimple-ssa.h"
  44 #include "hash-map.h"
  45 #include "plugin-api.h"
  46 #include "ipa-ref.h"
  47 #include "cgraph.h"
  48 #include "data-streamer.h"
  49 #include "gimple-streamer.h"
  50 #include "lto-streamer.h"
  51 #include "tree-streamer.h"
  52 #include "value-prof.h"
  53
  54 /* Output PHI function PHI to the main stream in OB.  */
  55
  56 static void
  57 output_phi (struct output_block *ob, gphi *phi)
  58 {
  59   unsigned i, len = gimple_phi_num_args (phi);
  60
  61   streamer_write_record_start (ob, lto_gimple_code_to_tag (GIMPLE_PHI));
  62   streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
  63
  64   for (i = 0; i < len; i++)
  65     {
  66       stream_write_tree (ob, gimple_phi_arg_def (phi, i), true);
  67       streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index);
  68       bitpack_d bp = bitpack_create (ob->main_stream);
  69       stream_output_location (ob, &bp, gimple_phi_arg_location (phi, i));
  70       streamer_write_bitpack (&bp);
  71     }
  72 }
  73
  74
  75 /* Emit statement STMT on the main stream of output block OB.  */
  76
  77 static void
  78 output_gimple_stmt (struct output_block *ob, gimple stmt)
  79 {
  80   unsigned i;
  81   enum gimple_code code;
  82   enum LTO_tags tag;
  83   struct bitpack_d bp;
  84   histogram_value hist;
  85
  86   /* Emit identifying tag.  */
  87   code = gimple_code (stmt);
  88   tag = lto_gimple_code_to_tag (code);
  89   streamer_write_record_start (ob, tag);
  90
  91   /* Emit the tuple header.  */
  92   bp = bitpack_create (ob->main_stream);
  93   bp_pack_var_len_unsigned (&bp, gimple_num_ops (stmt));
  94   bp_pack_value (&bp, gimple_no_warning_p (stmt), 1);
  95   if (is_gimple_assign (stmt))
  96     bp_pack_value (&bp,
  97                    gimple_assign_nontemporal_move_p (
  98                      as_a <gassign *> (stmt)),
  99                    1);
 100   bp_pack_value (&bp, gimple_has_volatile_ops (stmt), 1);
 101   hist = gimple_histogram_value (cfun, stmt);
 102   bp_pack_value (&bp, hist != NULL, 1);
 103   bp_pack_var_len_unsigned (&bp, stmt->subcode);
 104
 105   /* Emit location information for the statement.  */
 106   stream_output_location (ob, &bp, LOCATION_LOCUS (gimple_location (stmt)));
 107   streamer_write_bitpack (&bp);
 108
 109   /* Emit the lexical block holding STMT.  */
 110   stream_write_tree (ob, gimple_block (stmt), true);
 111
 112   /* Emit the operands.  */
 113   switch (gimple_code (stmt))
 114     {
 115     case GIMPLE_RESX:
 116       streamer_write_hwi (ob, gimple_resx_region (as_a <gresx *> (stmt)));
 117       break;
 118
 119     case GIMPLE_EH_MUST_NOT_THROW:
 120       stream_write_tree (ob,
 121                          gimple_eh_must_not_throw_fndecl (
 122                            as_a <geh_mnt *> (stmt)),
 123                          true);
 124       break;
 125
 126     case GIMPLE_EH_DISPATCH:
 127       streamer_write_hwi (ob,
 128                           gimple_eh_dispatch_region (
 129                             as_a <geh_dispatch *> (stmt)));
 130       break;
 131
 132     case GIMPLE_ASM:
 133       {
 134         gasm *asm_stmt = as_a <gasm *> (stmt);
 135         streamer_write_uhwi (ob, gimple_asm_ninputs (asm_stmt));
 136         streamer_write_uhwi (ob, gimple_asm_noutputs (asm_stmt));
 137         streamer_write_uhwi (ob, gimple_asm_nclobbers (asm_stmt));
 138         streamer_write_uhwi (ob, gimple_asm_nlabels (asm_stmt));
 139         streamer_write_string (ob, ob->main_stream,
 140                                gimple_asm_string (asm_stmt), true);
 141       }
 142       /* Fallthru  */
 143
 144     case GIMPLE_ASSIGN:
 145     case GIMPLE_CALL:
 146     case GIMPLE_RETURN:
 147     case GIMPLE_SWITCH:
 148     case GIMPLE_LABEL:
 149     case GIMPLE_COND:
 150     case GIMPLE_GOTO:
 151     case GIMPLE_DEBUG:
 152       for (i = 0; i < gimple_num_ops (stmt); i++)
 153         {
 154           tree op = gimple_op (stmt, i);
 155           tree *basep = NULL;
 156           /* Wrap all uses of non-automatic variables inside MEM_REFs
 157              so that we do not have to deal with type mismatches on
 158              merged symbols during IL read in.  The first operand
 159              of GIMPLE_DEBUG must be a decl, not MEM_REF, though.  */
 160           if (op && (i || !is_gimple_debug (stmt)))
 161             {
 162               basep = &op;
 163               if (TREE_CODE (*basep) == ADDR_EXPR)
 164                 basep = &TREE_OPERAND (*basep, 0);
 165               while (handled_component_p (*basep))
 166                 basep = &TREE_OPERAND (*basep, 0);
 167               if (TREE_CODE (*basep) == VAR_DECL
 168                   && !auto_var_in_fn_p (*basep, current_function_decl)
 169                   && !DECL_REGISTER (*basep))
 170                 {
 171                   bool volatilep = TREE_THIS_VOLATILE (*basep);
 172                   tree ptrtype = build_pointer_type (TREE_TYPE (*basep));
 173                   *basep = build2 (MEM_REF, TREE_TYPE (*basep),
 174                                    build1 (ADDR_EXPR, ptrtype, *basep),
 175                                    build_int_cst (ptrtype, 0));
 176                   TREE_THIS_VOLATILE (*basep) = volatilep;
 177                 }
 178               else
 179                 basep = NULL;
 180             }
 181           stream_write_tree (ob, op, true);
 182           /* Restore the original base if we wrapped it inside a MEM_REF.  */
 183           if (basep)
 184             *basep = TREE_OPERAND (TREE_OPERAND (*basep, 0), 0);
 185         }
 186       if (is_gimple_call (stmt))
 187         {
 188           if (gimple_call_internal_p (stmt))
 189             streamer_write_enum (ob->main_stream, internal_fn,
 190                                  IFN_LAST, gimple_call_internal_fn (stmt));
 191           else
 192             stream_write_tree (ob, gimple_call_fntype (stmt), true);
 193         }
 194       break;
 195
 196     case GIMPLE_NOP:
 197     case GIMPLE_PREDICT:
 198       break;
 199
 200     case GIMPLE_TRANSACTION:
 201       {
 202         gtransaction *trans_stmt = as_a <gtransaction *> (stmt);
 203         gcc_assert (gimple_transaction_body (trans_stmt) == NULL);
 204         stream_write_tree (ob, gimple_transaction_label (trans_stmt), true);
 205       }
 206       break;
 207
 208     default:
 209       gcc_unreachable ();
 210     }
 211   if (hist)
 212     stream_out_histogram_value (ob, hist);
 213 }
 214
 215
 216 /* Output a basic block BB to the main stream in OB for this FN.  */
 217
 218 void
 219 output_bb (struct output_block *ob, basic_block bb, struct function *fn)
 220 {
 221   gimple_stmt_iterator bsi = gsi_start_bb (bb);
 222
 223   streamer_write_record_start (ob,
 224                                (!gsi_end_p (bsi)) || phi_nodes (bb)
 225                                 ? LTO_bb1
 226                                 : LTO_bb0);
 227
 228   streamer_write_uhwi (ob, bb->index);
 229   streamer_write_gcov_count (ob, bb->count);
 230   streamer_write_hwi (ob, bb->frequency);
 231   streamer_write_hwi (ob, bb->flags);
 232
 233   if (!gsi_end_p (bsi) || phi_nodes (bb))
 234     {
 235       /* Output the statements.  The list of statements is terminated
 236          with a zero.  */
 237       for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
 238         {
 239           int region;
 240           gimple stmt = gsi_stmt (bsi);
 241
 242           output_gimple_stmt (ob, stmt);
 243
 244           /* Emit the EH region holding STMT.  */
 245           region = lookup_stmt_eh_lp_fn (fn, stmt);
 246           if (region != 0)
 247             {
 248               streamer_write_record_start (ob, LTO_eh_region);
 249               streamer_write_hwi (ob, region);
 250             }
 251           else
 252             streamer_write_record_start (ob, LTO_null);
 253         }
 254
 255       streamer_write_record_start (ob, LTO_null);
 256
 257       for (gphi_iterator psi = gsi_start_phis (bb);
 258            !gsi_end_p (psi);
 259            gsi_next (&psi))
 260         {
 261           gphi *phi = psi.phi ();
 262
 263           /* Only emit PHIs for gimple registers.  PHI nodes for .MEM
 264              will be filled in on reading when the SSA form is
 265              updated.  */
 266           if (!virtual_operand_p (gimple_phi_result (phi)))
 267             output_phi (ob, phi);
 268         }
 269
 270       streamer_write_record_start (ob, LTO_null);
 271     }
 272 }