diff options
| author | spop <spop@138bc75d-0d04-0410-961f-82ee72b054a4> | 2010-07-09 23:08:55 +0000 |
|---|---|---|
| committer | spop <spop@138bc75d-0d04-0410-961f-82ee72b054a4> | 2010-07-09 23:08:55 +0000 |
| commit | 76595608131ec929f1e9cd5e5935d99fb4dac342 (patch) | |
| tree | 08a6ff064dc82642939db19bcd80abf31bc265a6 /libjava/gnu/java/net/protocol/https/Handler.h | |
| parent | d0f6c30df1dd01342e9abd8d4876cc06b21d7c80 (diff) | |
| download | ppe42-gcc-76595608131ec929f1e9cd5e5935d99fb4dac342.tar.gz ppe42-gcc-76595608131ec929f1e9cd5e5935d99fb4dac342.zip | |
pr44576 Avoid un-necessary prefetch analysis by distributing the cost models
2010-07-09 Changpeng Fang <changpeng.fang@amd.com>
PR tree-optimization/44576
* tree-ssa-loop-prefetch.c (trip_count_to_ahead_ratio_too_small_p):
New. Pull out from is_loop_prefetching_profitable to implement
the trip count to ahead ratio heuristic.
(mem_ref_count_reasonable_p): New. Pull out from
is_loop_prefetching_profitable to implement the instruction to
memory reference ratio heuristic. Also consider not reasonable if
the memory reference count is above a threshold (to avoid
explosive compilation time.
(insn_to_prefetch_ratio_too_small_p): New. Pull out from
is_loop_prefetching_profitable to implement the instruction to
prefetch ratio heuristic.
(is_loop_prefetching_profitable): Removed.
(loop_prefetch_arrays): Distribute the cost analysis across the
function to allow early exit of the prefetch analysis.
is_loop_prefetching_profitable is splitted into three functions,
with each one called as early as possible.
(PREFETCH_MAX_MEM_REFS_PER_LOOP): New. Threshold above which the
number of memory references in a loop is considered too many.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@162023 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libjava/gnu/java/net/protocol/https/Handler.h')
0 files changed, 0 insertions, 0 deletions

