[Bug target/40697] inefficient code to extract least bits from an integer value

[bernds at gcc dot gnu dot org]

------- Comment #5 from bernds at gcc dot gnu dot org  2010-03-19 18:41 -------
Subject: Bug 40697

Author: bernds
Date: Fri Mar 19 18:41:22 2010
New Revision: 157582

URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=157582
Log:
gcc/
        PR target/40697
        * optabs.c (avoid_expensive_constant): Use rtx_cost to find out
        the cost of loading the constant rather than assuming
        COSTS_N_INSNS (1).
        * config/arm/arm.c (thumb1_rtx_costs) <case CONST_INT>: If the
        outer code is AND, do the same tests as the andsi3 expander and
        return COSTS_N_INSNS (1) if and is cheap.

testsuite/
        PR target/40697
        * gcc.target/arm/thumb-andsi.c: New test.


Added:
    trunk/gcc/testsuite/gcc.target/arm/thumb-andsi.c
Modified:
    trunk/gcc/ChangeLog
    trunk/gcc/config/arm/arm.c
    trunk/gcc/optabs.c
    trunk/gcc/testsuite/ChangeLog


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=40697