aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.9/gcc/gimple-streamer-in.c
diff options
context:
space:
mode:
authorBen Cheng <bccheng@google.com>2014-03-25 22:37:19 -0700
committerBen Cheng <bccheng@google.com>2014-03-25 22:37:19 -0700
commit1bc5aee63eb72b341f506ad058502cd0361f0d10 (patch)
treec607e8252f3405424ff15bc2d00aa38dadbb2518 /gcc-4.9/gcc/gimple-streamer-in.c
parent283a0bf58fcf333c58a2a92c3ebbc41fb9eb1fdb (diff)
downloadtoolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.gz
toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.bz2
toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.zip
Initial checkin of GCC 4.9.0 from trunk (r208799).
Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba
Diffstat (limited to 'gcc-4.9/gcc/gimple-streamer-in.c')
-rw-r--r--gcc-4.9/gcc/gimple-streamer-in.c300
1 files changed, 300 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/gimple-streamer-in.c b/gcc-4.9/gcc/gimple-streamer-in.c
new file mode 100644
index 000000000..fad04cdd2
--- /dev/null
+++ b/gcc-4.9/gcc/gimple-streamer-in.c
@@ -0,0 +1,300 @@
+/* Routines for reading GIMPLE from a file stream.
+
+ Copyright (C) 2011-2014 Free Software Foundation, Inc.
+ Contributed by Diego Novillo <dnovillo@google.com>
+
+This file is part of GCC.
+
+GCC is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free
+Software Foundation; either version 3, or (at your option) any later
+version.
+
+GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with GCC; see the file COPYING3. If not see
+<http://www.gnu.org/licenses/>. */
+
+#include "config.h"
+#include "system.h"
+#include "coretypes.h"
+#include "diagnostic.h"
+#include "tree.h"
+#include "basic-block.h"
+#include "tree-ssa-alias.h"
+#include "internal-fn.h"
+#include "tree-eh.h"
+#include "gimple-expr.h"
+#include "is-a.h"
+#include "gimple.h"
+#include "gimple-iterator.h"
+#include "gimple-ssa.h"
+#include "tree-phinodes.h"
+#include "stringpool.h"
+#include "tree-ssanames.h"
+#include "data-streamer.h"
+#include "tree-streamer.h"
+#include "gimple-streamer.h"
+#include "value-prof.h"
+
+/* Read a PHI function for basic block BB in function FN. DATA_IN is
+ the file being read. IB is the input block to use for reading. */
+
+static gimple
+input_phi (struct lto_input_block *ib, basic_block bb, struct data_in *data_in,
+ struct function *fn)
+{
+ unsigned HOST_WIDE_INT ix;
+ tree phi_result;
+ int i, len;
+ gimple result;
+
+ ix = streamer_read_uhwi (ib);
+ phi_result = (*SSANAMES (fn))[ix];
+ len = EDGE_COUNT (bb->preds);
+ result = create_phi_node (phi_result, bb);
+
+ /* We have to go through a lookup process here because the preds in the
+ reconstructed graph are generally in a different order than they
+ were in the original program. */
+ for (i = 0; i < len; i++)
+ {
+ tree def = stream_read_tree (ib, data_in);
+ int src_index = streamer_read_uhwi (ib);
+ bitpack_d bp = streamer_read_bitpack (ib);
+ location_t arg_loc = stream_input_location (&bp, data_in);
+ basic_block sbb = BASIC_BLOCK_FOR_FN (fn, src_index);
+
+ edge e = NULL;
+ int j;
+
+ for (j = 0; j < len; j++)
+ if (EDGE_PRED (bb, j)->src == sbb)
+ {
+ e = EDGE_PRED (bb, j);
+ break;
+ }
+
+ add_phi_arg (result, def, e, arg_loc);
+ }
+
+ return result;
+}
+
+
+/* Read a statement with tag TAG in function FN from block IB using
+ descriptors in DATA_IN. */
+
+static gimple
+input_gimple_stmt (struct lto_input_block *ib, struct data_in *data_in,
+ enum LTO_tags tag)
+{
+ gimple stmt;
+ enum gimple_code code;
+ unsigned HOST_WIDE_INT num_ops;
+ size_t i;
+ struct bitpack_d bp;
+ bool has_hist;
+
+ code = lto_tag_to_gimple_code (tag);
+
+ /* Read the tuple header. */
+ bp = streamer_read_bitpack (ib);
+ num_ops = bp_unpack_var_len_unsigned (&bp);
+ stmt = gimple_alloc (code, num_ops);
+ stmt->no_warning = bp_unpack_value (&bp, 1);
+ if (is_gimple_assign (stmt))
+ stmt->nontemporal_move = bp_unpack_value (&bp, 1);
+ stmt->has_volatile_ops = bp_unpack_value (&bp, 1);
+ has_hist = bp_unpack_value (&bp, 1);
+ stmt->subcode = bp_unpack_var_len_unsigned (&bp);
+
+ /* Read location information. */
+ gimple_set_location (stmt, stream_input_location (&bp, data_in));
+
+ /* Read lexical block reference. */
+ gimple_set_block (stmt, stream_read_tree (ib, data_in));
+
+ /* Read in all the operands. */
+ switch (code)
+ {
+ case GIMPLE_RESX:
+ gimple_resx_set_region (stmt, streamer_read_hwi (ib));
+ break;
+
+ case GIMPLE_EH_MUST_NOT_THROW:
+ gimple_eh_must_not_throw_set_fndecl (stmt, stream_read_tree (ib, data_in));
+ break;
+
+ case GIMPLE_EH_DISPATCH:
+ gimple_eh_dispatch_set_region (stmt, streamer_read_hwi (ib));
+ break;
+
+ case GIMPLE_ASM:
+ {
+ /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
+ gimple_statement_asm *asm_stmt = as_a <gimple_statement_asm> (stmt);
+ tree str;
+ asm_stmt->ni = streamer_read_uhwi (ib);
+ asm_stmt->no = streamer_read_uhwi (ib);
+ asm_stmt->nc = streamer_read_uhwi (ib);
+ asm_stmt->nl = streamer_read_uhwi (ib);
+ str = streamer_read_string_cst (data_in, ib);
+ asm_stmt->string = TREE_STRING_POINTER (str);
+ }
+ /* Fallthru */
+
+ case GIMPLE_ASSIGN:
+ case GIMPLE_CALL:
+ case GIMPLE_RETURN:
+ case GIMPLE_SWITCH:
+ case GIMPLE_LABEL:
+ case GIMPLE_COND:
+ case GIMPLE_GOTO:
+ case GIMPLE_DEBUG:
+ for (i = 0; i < num_ops; i++)
+ {
+ tree *opp, op = stream_read_tree (ib, data_in);
+ gimple_set_op (stmt, i, op);
+ if (!op)
+ continue;
+
+ opp = gimple_op_ptr (stmt, i);
+ if (TREE_CODE (*opp) == ADDR_EXPR)
+ opp = &TREE_OPERAND (*opp, 0);
+ while (handled_component_p (*opp))
+ opp = &TREE_OPERAND (*opp, 0);
+ /* At LTO output time we wrap all global decls in MEM_REFs to
+ allow seamless replacement with prevailing decls. Undo this
+ here if the prevailing decl allows for this.
+ ??? Maybe we should simply fold all stmts. */
+ if (TREE_CODE (*opp) == MEM_REF
+ && TREE_CODE (TREE_OPERAND (*opp, 0)) == ADDR_EXPR
+ && integer_zerop (TREE_OPERAND (*opp, 1))
+ && (TREE_THIS_VOLATILE (*opp)
+ == TREE_THIS_VOLATILE
+ (TREE_OPERAND (TREE_OPERAND (*opp, 0), 0)))
+ && !TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (*opp, 1)))
+ && (TREE_TYPE (*opp)
+ == TREE_TYPE (TREE_TYPE (TREE_OPERAND (*opp, 1))))
+ && (TREE_TYPE (*opp)
+ == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*opp, 0), 0))))
+ *opp = TREE_OPERAND (TREE_OPERAND (*opp, 0), 0);
+ }
+ if (is_gimple_call (stmt))
+ {
+ if (gimple_call_internal_p (stmt))
+ gimple_call_set_internal_fn
+ (stmt, streamer_read_enum (ib, internal_fn, IFN_LAST));
+ else
+ gimple_call_set_fntype (stmt, stream_read_tree (ib, data_in));
+ }
+ break;
+
+ case GIMPLE_NOP:
+ case GIMPLE_PREDICT:
+ break;
+
+ case GIMPLE_TRANSACTION:
+ gimple_transaction_set_label (stmt, stream_read_tree (ib, data_in));
+ break;
+
+ default:
+ internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
+ lto_tag_name (tag));
+ }
+
+ /* Update the properties of symbols, SSA names and labels associated
+ with STMT. */
+ if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL)
+ {
+ tree lhs = gimple_get_lhs (stmt);
+ if (lhs && TREE_CODE (lhs) == SSA_NAME)
+ SSA_NAME_DEF_STMT (lhs) = stmt;
+ }
+ else if (code == GIMPLE_ASM)
+ {
+ unsigned i;
+
+ for (i = 0; i < gimple_asm_noutputs (stmt); i++)
+ {
+ tree op = TREE_VALUE (gimple_asm_output_op (stmt, i));
+ if (TREE_CODE (op) == SSA_NAME)
+ SSA_NAME_DEF_STMT (op) = stmt;
+ }
+ }
+
+ /* Reset alias information. */
+ if (code == GIMPLE_CALL)
+ gimple_call_reset_alias_info (stmt);
+
+ /* Mark the statement modified so its operand vectors can be filled in. */
+ gimple_set_modified (stmt, true);
+ if (has_hist)
+ stream_in_histogram_value (ib, stmt);
+
+ return stmt;
+}
+
+
+/* Read a basic block with tag TAG from DATA_IN using input block IB.
+ FN is the function being processed. */
+
+void
+input_bb (struct lto_input_block *ib, enum LTO_tags tag,
+ struct data_in *data_in, struct function *fn,
+ int count_materialization_scale)
+{
+ unsigned int index;
+ basic_block bb;
+ gimple_stmt_iterator bsi;
+
+ /* This routine assumes that CFUN is set to FN, as it needs to call
+ basic GIMPLE routines that use CFUN. */
+ gcc_assert (cfun == fn);
+
+ index = streamer_read_uhwi (ib);
+ bb = BASIC_BLOCK_FOR_FN (fn, index);
+
+ bb->count = apply_scale (streamer_read_gcov_count (ib),
+ count_materialization_scale);
+ bb->frequency = streamer_read_hwi (ib);
+ bb->flags = streamer_read_hwi (ib);
+
+ /* LTO_bb1 has statements. LTO_bb0 does not. */
+ if (tag == LTO_bb0)
+ return;
+
+ bsi = gsi_start_bb (bb);
+ tag = streamer_read_record_start (ib);
+ while (tag)
+ {
+ gimple stmt = input_gimple_stmt (ib, data_in, tag);
+ gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
+
+ /* After the statement, expect a 0 delimiter or the EH region
+ that the previous statement belongs to. */
+ tag = streamer_read_record_start (ib);
+ lto_tag_check_set (tag, 2, LTO_eh_region, LTO_null);
+
+ if (tag == LTO_eh_region)
+ {
+ HOST_WIDE_INT region = streamer_read_hwi (ib);
+ gcc_assert (region == (int) region);
+ add_stmt_to_eh_lp (stmt, region);
+ }
+
+ tag = streamer_read_record_start (ib);
+ }
+
+ tag = streamer_read_record_start (ib);
+ while (tag)
+ {
+ input_phi (ib, bb, data_in, fn);
+ tag = streamer_read_record_start (ib);
+ }
+}