mirror of git://gcc.gnu.org/git/gcc.git
re PR rtl-optimization/46571 (bootstrap comparison failure in fortran/trans-openmp.c)
PR rtl-optimization/46571 * gcse.c (hash_scan_set): Use next_nonnote_nondebug_insn. (compute_hash_table_work): Use NONDEBUG_INSN_P. From-SVN: r167007
This commit is contained in:
parent
2dc211c5ff
commit
a344c9f188
|
|
@ -1,3 +1,9 @@
|
||||||
|
2010-11-21 Richard Henderson <rth@redhat.com>
|
||||||
|
|
||||||
|
PR rtl-optimization/46571
|
||||||
|
* gcse.c (hash_scan_set): Use next_nonnote_nondebug_insn.
|
||||||
|
(compute_hash_table_work): Use NONDEBUG_INSN_P.
|
||||||
|
|
||||||
2010-11-21 Paul Koning <ni1d@arrl.net>
|
2010-11-21 Paul Koning <ni1d@arrl.net>
|
||||||
|
|
||||||
* config/mips/pdp11.md (negsi2): Fix wrong code.
|
* config/mips/pdp11.md (negsi2): Fix wrong code.
|
||||||
|
|
|
||||||
|
|
@ -1460,7 +1460,7 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table_d *table)
|
||||||
modified. Here we want to search from INSN+1 on, but
|
modified. Here we want to search from INSN+1 on, but
|
||||||
oprs_available_p searches from INSN on. */
|
oprs_available_p searches from INSN on. */
|
||||||
&& (insn == BB_END (BLOCK_FOR_INSN (insn))
|
&& (insn == BB_END (BLOCK_FOR_INSN (insn))
|
||||||
|| (tmp = next_nonnote_insn (insn)) == NULL_RTX
|
|| (tmp = next_nonnote_nondebug_insn (insn)) == NULL_RTX
|
||||||
|| BLOCK_FOR_INSN (tmp) != BLOCK_FOR_INSN (insn)
|
|| BLOCK_FOR_INSN (tmp) != BLOCK_FOR_INSN (insn)
|
||||||
|| oprs_available_p (pat, tmp)))
|
|| oprs_available_p (pat, tmp)))
|
||||||
insert_set_in_table (pat, insn, table);
|
insert_set_in_table (pat, insn, table);
|
||||||
|
|
@ -1748,7 +1748,7 @@ compute_hash_table_work (struct hash_table_d *table)
|
||||||
determine when registers and memory are first and last set. */
|
determine when registers and memory are first and last set. */
|
||||||
FOR_BB_INSNS (current_bb, insn)
|
FOR_BB_INSNS (current_bb, insn)
|
||||||
{
|
{
|
||||||
if (! INSN_P (insn))
|
if (!NONDEBUG_INSN_P (insn))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (CALL_P (insn))
|
if (CALL_P (insn))
|
||||||
|
|
@ -1771,7 +1771,7 @@ compute_hash_table_work (struct hash_table_d *table)
|
||||||
|
|
||||||
/* The next pass builds the hash table. */
|
/* The next pass builds the hash table. */
|
||||||
FOR_BB_INSNS (current_bb, insn)
|
FOR_BB_INSNS (current_bb, insn)
|
||||||
if (INSN_P (insn))
|
if (NONDEBUG_INSN_P (insn))
|
||||||
hash_scan_insn (insn, table);
|
hash_scan_insn (insn, table);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,122 @@
|
||||||
|
/* { dg-do compile } */
|
||||||
|
/* { dg-options "-O2 -fcompare-debug" } */
|
||||||
|
|
||||||
|
typedef union tree_node *tree;
|
||||||
|
typedef unsigned int source_location;
|
||||||
|
enum tree_code
|
||||||
|
{
|
||||||
|
MINUS_EXPR,
|
||||||
|
MULT_EXPR,
|
||||||
|
};
|
||||||
|
struct tree_omp_clause
|
||||||
|
{
|
||||||
|
union omp_clause_subcode
|
||||||
|
{
|
||||||
|
enum tree_code reduction_code;
|
||||||
|
} subcode;
|
||||||
|
};
|
||||||
|
union tree_node
|
||||||
|
{
|
||||||
|
struct tree_omp_clause omp_clause;
|
||||||
|
};
|
||||||
|
enum tree_index
|
||||||
|
{
|
||||||
|
TI_ERROR_MARK,
|
||||||
|
};
|
||||||
|
typedef struct
|
||||||
|
{
|
||||||
|
unsigned allocatable:1;
|
||||||
|
unsigned dimension:1;
|
||||||
|
unsigned codimension:1;
|
||||||
|
unsigned external:1;
|
||||||
|
unsigned optional:1;
|
||||||
|
unsigned pointer:1;
|
||||||
|
unsigned contiguous:1;
|
||||||
|
unsigned referenced:1;
|
||||||
|
} symbol_attribute;
|
||||||
|
typedef unsigned int gfc_char_t;
|
||||||
|
typedef struct gfc_linebuf
|
||||||
|
{
|
||||||
|
source_location location;
|
||||||
|
} gfc_linebuf;
|
||||||
|
typedef struct
|
||||||
|
{
|
||||||
|
gfc_char_t *nextc;
|
||||||
|
gfc_linebuf *lb;
|
||||||
|
} locus;
|
||||||
|
typedef struct
|
||||||
|
{
|
||||||
|
struct gfc_symbol *sym;
|
||||||
|
struct gfc_namelist *next;
|
||||||
|
} gfc_namelist;
|
||||||
|
enum
|
||||||
|
{
|
||||||
|
OMP_LIST_PLUS,
|
||||||
|
OMP_LIST_REDUCTION_FIRST = OMP_LIST_PLUS,
|
||||||
|
OMP_LIST_MULT,
|
||||||
|
OMP_LIST_SUB,
|
||||||
|
OMP_LIST_NUM
|
||||||
|
};
|
||||||
|
typedef struct gfc_omp_clauses
|
||||||
|
{
|
||||||
|
gfc_namelist *lists[OMP_LIST_NUM];
|
||||||
|
} gfc_omp_clauses;
|
||||||
|
typedef struct gfc_symbol
|
||||||
|
{
|
||||||
|
symbol_attribute attr;
|
||||||
|
} gfc_symbol;
|
||||||
|
typedef struct gfc_code
|
||||||
|
{
|
||||||
|
locus loc;
|
||||||
|
union
|
||||||
|
{
|
||||||
|
gfc_omp_clauses *omp_clauses;
|
||||||
|
} ext;
|
||||||
|
} gfc_code;
|
||||||
|
typedef struct
|
||||||
|
{
|
||||||
|
} stmtblock_t;
|
||||||
|
|
||||||
|
static tree
|
||||||
|
gfc_trans_omp_reduction_list (gfc_namelist * namelist, tree list,
|
||||||
|
enum tree_code reduction_code, locus where)
|
||||||
|
{
|
||||||
|
for (; namelist != ((void *) 0); namelist = namelist->next)
|
||||||
|
if (namelist->sym->attr.referenced)
|
||||||
|
{
|
||||||
|
tree node = build_omp_clause (where.lb->location);
|
||||||
|
node->omp_clause.subcode.reduction_code = reduction_code;
|
||||||
|
gfc_trans_omp_array_reduction (namelist->sym, where);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static tree
|
||||||
|
gfc_trans_omp_clauses (stmtblock_t * block, gfc_omp_clauses * clauses,
|
||||||
|
locus where)
|
||||||
|
{
|
||||||
|
tree omp_clauses = (tree) ((void *) 0);
|
||||||
|
int list;
|
||||||
|
for (list = 0; list < OMP_LIST_NUM; list++)
|
||||||
|
{
|
||||||
|
gfc_namelist *n = clauses->lists[list];
|
||||||
|
enum tree_code reduction_code;
|
||||||
|
if (n == ((void *) 0))
|
||||||
|
continue;
|
||||||
|
switch (list)
|
||||||
|
{
|
||||||
|
case OMP_LIST_MULT:
|
||||||
|
reduction_code = MULT_EXPR;
|
||||||
|
break;
|
||||||
|
case OMP_LIST_SUB:
|
||||||
|
reduction_code = MINUS_EXPR;
|
||||||
|
}
|
||||||
|
gfc_trans_omp_reduction_list (n, omp_clauses, reduction_code, where);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
gfc_trans_omp_parallel_workshare (gfc_code * code)
|
||||||
|
{
|
||||||
|
stmtblock_t block;
|
||||||
|
gfc_trans_omp_clauses (&block, code->ext.omp_clauses, code->loc);
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue