aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-loop-linear.c
diff options
context:
space:
mode:
authorBernd Schmidt <bernds@codesourcery.com>2010-08-19 17:31:57 +0000
committerBernd Schmidt <bernds@gcc.gnu.org>2010-08-19 17:31:57 +0000
commit0524d2d6623eb2ab287f464e05c206ceeb3839bf (patch)
tree9de8d43f5bf7c9cbeb9e5e6bbf8c0c6dfbb0c5d0 /gcc/tree-loop-linear.c
parentf0d9b83660897011cb4325beb1239b5c76d9d685 (diff)
downloadgcc-0524d2d6623eb2ab287f464e05c206ceeb3839bf.zip
gcc-0524d2d6623eb2ab287f464e05c206ceeb3839bf.tar.gz
gcc-0524d2d6623eb2ab287f464e05c206ceeb3839bf.tar.bz2
re PR tree-optimization/42172 (inefficient bit fields assignments)
PR target/42172 * combine.c (combine_validate_cost): New arg I0. All callers changed. Take its cost into account if nonnull. (insn_a_feeds_b): New static function. (combine_instructions): Look for four-insn combinations. (can_combine_p): New args PRED2, SUCC2. All callers changed. Take them into account when computing all_adjacent and looking for other uses. (combinable_i3pat): New args I0DEST, I0_NOT_IN_SRC. All callers changed. Treat them like I1DEST and I1_NOT_IN_SRC. (try_combine): New arg I0. Handle four-insn combinations. (distribute_notes): New arg ELIM_I0. All callers changed. Treat it like ELIM_I1. From-SVN: r163383
Diffstat (limited to 'gcc/tree-loop-linear.c')
0 files changed, 0 insertions, 0 deletions