CbC/CbC_gcc: gcc/sel-sched-ir.c comparison

comparison gcc/sel-sched-ir.c @ 145:1830386684a0

gcc-9.2.0

author	anatofuz
date	Thu, 13 Feb 2020 11:34:05 +0900
parents	84e7813d76e9
children

comparison

equal deleted inserted replaced

-:84e7813d76e9
+:1830386684a0
 /* Instruction scheduling pass.  Selective scheduler and pipeliner.
-Copyright (C) 2006-2018 Free Software Foundation, Inc.
+Copyright (C) 2006-2020 Free Software Foundation, Inc.
 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
 #include "cfganal.h"
 #include "cfgbuild.h"
 #include "insn-config.h"
 #include "insn-attr.h"
 #include "recog.h"
-#include "params.h"
 #include "target.h"
 #include "sched-int.h"
 #include "emit-rtl.h"  /* FIXME: Can go away once crtl is moved to rtl.h.  */
 #ifdef INSN_SCHEDULING
 /* Data structure to describe interaction with the generic scheduler utils.  */
 static struct common_sched_info_def sel_common_sched_info;
 /* The loop nest being pipelined.  */
-struct loop *current_loop_nest;
+class loop *current_loop_nest;
 /* LOOP_NESTS is a vector containing the corresponding loop nest for
 each region.  */
 static vec<loop_p> loop_nests;
 {
 while (*lp)
 flist_remove (lp);
 }
-/* Add ORIGINAL_INSN the def list DL honoring CROSSES_CALL.  */
+/* Add ORIGINAL_INSN the def list DL honoring CROSSED_CALL_ABIS.  */
 void
-def_list_add (def_list_t *dl, insn_t original_insn, bool crosses_call)
+def_list_add (def_list_t *dl, insn_t original_insn,
+	      unsigned int crossed_call_abis)
 {
 def_t d;
 _list_add (dl);
 d = DEF_LIST_DEF (*dl);
 d->orig_insn = original_insn;
-d->crosses_call = crosses_call;
+d->crossed_call_abis = crossed_call_abis;
 }
 /* Functions to work with target contexts.  */
 clear_target_context (tc);
 init_target_context (tc, clean_p);
 }
 /* Functions to work with dependence contexts.
-Dc (aka deps context, aka deps_t, aka struct deps_desc *) is short for dependence
+Dc (aka deps context, aka deps_t, aka class deps_desc *) is short for dependence
 context.  It accumulates information about processed insns to decide if
 current insn is dependent on the processed ones.  */
 /* Make a copy of FROM in TO.  */
 static void
 /* Allocate store for dep context.  */
 static deps_t
 alloc_deps_context (void)
 {
-return XNEW (struct deps_desc);
+return XNEW (class deps_desc);
 }
 /* Allocate and initialize dep context.  */
 static deps_t
 create_deps_context (void)
 	  FENCE_ISSUE_MORE (f) = issue_rate;
 }
 else
 if (candidate->src == BLOCK_FOR_INSN (last_scheduled_insn))
 {
-/* Would be weird if same insn is successor of several fallthrough
-edges.  */
-gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb
-!= BLOCK_FOR_INSN (last_scheduled_insn_old));
 state_free (FENCE_STATE (f));
 FENCE_STATE (f) = state;
 delete_target_context (FENCE_TC (f));
 FENCE_TC (f) = tc;
 {
 if (reload_completed)
 return;
 HARD_REG_SET temp;
-unsigned regno;
-hard_reg_set_iterator hrsi;
 get_implicit_reg_pending_clobbers (&temp, insn);
-EXECUTE_IF_SET_IN_HARD_REG_SET (temp, 0, regno, hrsi)
+IOR_REG_SET_HRS (IDATA_REG_SETS (id), temp);
-SET_REGNO_REG_SET (IDATA_REG_SETS (id), regno);
 }
 /* Setup register sets describing INSN in ID.  */
 static void
 setup_id_reg_sets (idata_t id, insn_t insn)
 /* Initialize instruction data for INSN in ID.  */
 static void
 deps_init_id (idata_t id, insn_t insn, bool force_unique_p)
 {
-struct deps_desc _dc, *dc = &_dc;
+class deps_desc _dc, *dc = &_dc;
 deps_init_id_data.where = DEPS_IN_NOWHERE;
 deps_init_id_data.id = id;
 deps_init_id_data.force_unique_p = force_unique_p;
 deps_init_id_data.force_use_p = false;
 ds_t
 has_dependence_p (expr_t expr, insn_t pred, ds_t **has_dep_pp)
 {
 int i;
 ds_t ds;
-struct deps_desc *dc;
+class deps_desc *dc;
 if (INSN_SIMPLEJUMP_P (pred))
 /* Unconditional jump is just a transfer of control flow.
 Ignore it.  */
 return false;
 {
 pred_bb = e->src;
 if (!(e->flags & EDGE_FALLTHRU))
 {
-	      /* We can not invalidate computed topological order by moving
+	      /* We cannot invalidate computed topological order by moving
 	         the edge destination block (E->SUCC) along a fallthru edge.
 		 We will update dominators here only when we'll get
 		 an unreachable block when redirecting, otherwise
 		 sel_redirect_edge_and_branch will take care of it.  */
 {
 gcc_assert (from != to);
 if (current_loop_nest)
 {
-struct loop *loop;
+class loop *loop;
 for (loop = current_loop_nest; loop; loop = loop_outer (loop))
 if (considered_for_pipelining_p (loop) && loop->latch == from)
 {
 gcc_assert (loop == current_loop_nest);
 		       old_seqno);
 set_immediate_dominator (CDI_DOMINATORS, to,
 			   recompute_dominator (CDI_DOMINATORS, to));
 set_immediate_dominator (CDI_DOMINATORS, orig_dest,
 			   recompute_dominator (CDI_DOMINATORS, orig_dest));
+if (jump && sel_bb_head_p (jump))
+compute_live (jump);
 }
 /* A wrapper for redirect_edge_and_branch.  Return TRUE if blocks connected by
 redirected edge are in reverse topological order.  */
 bool
 set_immediate_dominator (CDI_DOMINATORS, to,
 recompute_dominator (CDI_DOMINATORS, to));
 set_immediate_dominator (CDI_DOMINATORS, orig_dest,
 recompute_dominator (CDI_DOMINATORS, orig_dest));
 }
+if (jump && sel_bb_head_p (jump))
+compute_live (jump);
 return recompute_toporder_p;
 }
 /* This variable holds the cfg hooks used by the selective scheduler.  */
 static struct cfg_hooks sel_cfg_hooks;
 }
 /* Create a region for LOOP and return its number.  If we don't want
 to pipeline LOOP, return -1.  */
 static int
-make_region_from_loop (struct loop *loop)
+make_region_from_loop (class loop *loop)
 {
 unsigned int i;
 int new_rgn_number = -1;
-struct loop *inner;
+class loop *inner;
 /* Basic block index, to be assigned to BLOCK_TO_BB.  */
 int bb_ord_index = 0;
 basic_block *loop_blocks;
 basic_block preheader_block;
 if (loop->num_nodes
-> (unsigned) PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_BLOCKS))
+> (unsigned) param_max_pipeline_region_blocks)
 return -1;
 /* Don't pipeline loops whose latch belongs to some of its inner loops.  */
 for (inner = loop->inner; inner; inner = inner->inner)
 if (flow_bb_inside_loop_p (inner, loop->latch))
 return -1;
 loop->ninsns = num_loop_insns (loop);
-if ((int) loop->ninsns > PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_INSNS))
+if ((int) loop->ninsns > param_max_pipeline_region_insns)
 return -1;
 loop_blocks = get_loop_body_in_custom_order (loop, bb_top_order_comparator);
 for (i = 0; i < loop->num_nodes; i++)
 /* Create region(s) from loop nest LOOP, such that inner loops will be
 pipelined before outer loops.  Returns true when a region for LOOP
 is created.  */
 static bool
-make_regions_from_loop_nest (struct loop *loop)
+make_regions_from_loop_nest (class loop *loop)
 {
-struct loop *cur_loop;
+class loop *cur_loop;
 int rgn_number;
 /* Traverse all inner nodes of the loop.  */
 for (cur_loop = loop->inner; cur_loop; cur_loop = cur_loop->next)
 if (! bitmap_bit_p (bbs_in_loop_rgns, cur_loop->header->index))
 bitmap_clear (bbs_in_loop_rgns);
 recompute_rev_top_order ();
 }
-/* Returns a struct loop for region RGN.  */
+/* Returns a class loop for region RGN.  */
 loop_p
 get_loop_nest_for_rgn (unsigned int rgn)
 {
 /* Regions created with extend_rgns don't have corresponding loop nests,
 because they don't represent loops.  */
 return NULL;
 }
 /* True when LOOP was included into pipelining regions.   */
 bool
-considered_for_pipelining_p (struct loop *loop)
+considered_for_pipelining_p (class loop *loop)
 {
 if (loop_depth (loop) == 0)
 return false;
 /* Now, the loop could be too large or irreducible.  Check whether its
 }
 /* Free data structures used in pipelining of loops.  */
 void sel_finish_pipelining (void)
 {
-struct loop *loop;
+class loop *loop;
 /* Release aux fields so we don't free them later by mistake.  */
 FOR_EACH_LOOP (loop, 0)
 loop->aux = NULL;
 bool
 sel_is_loop_preheader_p (basic_block bb)
 {
 if (current_loop_nest)
 {
-struct loop *outer;
+class loop *outer;
 if (preheader_removed)
 return false;
 /* Preheader is the first block in the region.  */

Mercurial > hg > CbC > CbC_gcc

comparison gcc/sel-sched-ir.c @ 145:1830386684a0