* [PATCH 0/7] Param conversion to option machinery
@ 2019-11-07 12:33 Martin Liska
2019-11-07 12:33 ` [PATCH 5/7] Remove last leftover usage of params* files Martin Liska
` (8 more replies)
0 siblings, 9 replies; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches; +Cc: richard.guenther
The email thread is follow up of a demo that I made here:
https://gcc.gnu.org/ml/gcc-patches/2019-10/msg02220.html
The patchset converts current param infrastructure to
the option machinery. The parts 3 and 4 are quite
mechanical.
I would appreciate a feedback about what parameters
should be per function (Optimization keyword) and global.
The patch survives bootstrap and regtests on x86_64-linux-gnu
and ppc64-linux-gnu and I made cross build of all target compilers.
Thoughts?
Martin
Martin Liska (7):
Param to options conversion.
Include new generated gcc/params.opt file.
Apply mechanical replacement (generated patch).
Remove gcc/params.* files.
Remove last leftover usage of params* files.
Remove set_default_param_value from documentation.
Fix test-suite fallout.
gcc/Makefile.in | 20 +-
gcc/asan.c | 19 +-
gcc/auto-profile.c | 3 +-
gcc/bb-reorder.c | 5 +-
gcc/builtins.c | 3 +-
gcc/c/gimple-parser.c | 3 +-
gcc/cfgcleanup.c | 5 +-
gcc/cfgexpand.c | 9 +-
gcc/cfgloopanal.c | 9 +-
gcc/cgraph.c | 3 +-
gcc/combine.c | 5 +-
gcc/common.opt | 10 -
gcc/common/common-target.def | 6 +-
gcc/common/config/aarch64/aarch64-common.c | 16 +-
gcc/common/config/gcn/gcn-common.c | 1 -
gcc/common/config/ia64/ia64-common.c | 9 +-
.../config/powerpcspe/powerpcspe-common.c | 3 +-
gcc/common/config/rs6000/rs6000-common.c | 3 +-
gcc/common/config/sh/sh-common.c | 3 +-
gcc/config/aarch64/aarch64.c | 80 +-
gcc/config/alpha/alpha.c | 17 +-
gcc/config/arm/arm.c | 44 +-
gcc/config/avr/avr.c | 1 -
gcc/config/csky/csky.c | 1 -
gcc/config/i386/i386-builtins.c | 1 -
gcc/config/i386/i386-expand.c | 1 -
gcc/config/i386/i386-features.c | 1 -
gcc/config/i386/i386-options.c | 35 +-
gcc/config/i386/i386.c | 27 +-
gcc/config/ia64/ia64.c | 3 +-
gcc/config/rs6000/rs6000-logue.c | 5 +-
gcc/config/rs6000/rs6000.c | 56 +-
gcc/config/s390/s390.c | 80 +-
gcc/config/sparc/sparc.c | 84 +-
gcc/config/visium/visium.c | 7 +-
gcc/coverage.c | 9 +-
gcc/cp/name-lookup.c | 3 +-
gcc/cp/typeck.c | 5 +-
gcc/cprop.c | 1 -
gcc/cse.c | 7 +-
gcc/cselib.c | 3 +-
gcc/doc/options.texi | 3 +
gcc/doc/tm.texi | 4 +-
gcc/dse.c | 3 +-
gcc/emit-rtl.c | 19 +-
gcc/explow.c | 3 +-
gcc/final.c | 5 +-
gcc/flag-types.h | 11 +
gcc/fold-const.c | 13 +-
gcc/gcc.c | 9 -
gcc/gcse.c | 17 +-
gcc/ggc-common.c | 5 +-
gcc/ggc-page.c | 5 +-
gcc/gimple-loop-interchange.cc | 7 +-
gcc/gimple-loop-jam.c | 9 +-
gcc/gimple-loop-versioning.cc | 5 +-
gcc/gimple-ssa-split-paths.c | 3 +-
gcc/gimple-ssa-sprintf.c | 1 -
gcc/gimple-ssa-store-merging.c | 9 +-
gcc/gimple-ssa-strength-reduction.c | 3 +-
gcc/gimple-ssa-warn-alloca.c | 1 -
gcc/gimple-ssa-warn-restrict.c | 1 -
gcc/graphite-isl-ast-to-gimple.c | 5 +-
gcc/graphite-optimize-isl.c | 5 +-
gcc/graphite-scop-detection.c | 5 +-
gcc/graphite-sese-to-poly.c | 1 -
gcc/graphite.c | 1 -
gcc/haifa-sched.c | 39 +-
gcc/hsa-gen.c | 3 +-
gcc/ifcvt.c | 5 +-
gcc/ipa-cp.c | 31 +-
gcc/ipa-fnsummary.c | 21 +-
gcc/ipa-inline-analysis.c | 3 +-
gcc/ipa-inline.c | 78 +-
gcc/ipa-polymorphic-call.c | 3 +-
gcc/ipa-profile.c | 3 +-
gcc/ipa-prop.c | 7 +-
gcc/ipa-split.c | 11 +-
gcc/ipa-sra.c | 10 +-
gcc/ira-build.c | 5 +-
gcc/ira-conflicts.c | 5 +-
gcc/loop-doloop.c | 3 +-
gcc/loop-invariant.c | 5 +-
gcc/loop-unroll.c | 27 +-
gcc/lra-assigns.c | 3 +-
gcc/lra-constraints.c | 3 +-
gcc/lto/lto-common.c | 1 -
gcc/lto/lto-partition.c | 11 +-
gcc/lto/lto.c | 11 +-
gcc/modulo-sched.c | 7 +-
gcc/opt-functions.awk | 3 +-
gcc/opt-suggestions.c | 59 +-
gcc/opt-suggestions.h | 5 -
gcc/opts-common.c | 20 +
gcc/opts.c | 158 +-
gcc/opts.h | 11 +-
gcc/params-enum.h | 39 -
gcc/params-list.h | 26 -
gcc/params-options.h | 27 -
gcc/params.c | 302 ----
gcc/params.def | 1495 -----------------
gcc/params.h | 254 ---
gcc/params.opt | 967 +++++++++++
gcc/postreload-gcse.c | 7 +-
gcc/predict.c | 21 +-
gcc/reload.c | 3 +-
gcc/reorg.c | 5 +-
gcc/resource.c | 5 +-
gcc/sanopt.c | 5 +-
gcc/sched-deps.c | 11 +-
gcc/sched-ebb.c | 5 +-
gcc/sched-rgn.c | 19 +-
gcc/sel-sched-ir.c | 5 +-
gcc/sel-sched-ir.h | 2 +-
gcc/sel-sched.c | 5 +-
gcc/shrink-wrap.c | 3 +-
gcc/stmt.c | 1 -
gcc/targhooks.c | 22 +-
gcc/testsuite/gcc.dg/completion-3.c | 16 +-
gcc/testsuite/gcc.dg/pr83620.c | 2 +-
gcc/testsuite/gcc.dg/spellcheck-params-2.c | 2 +-
gcc/testsuite/gcc.dg/spellcheck-params.c | 2 +-
gcc/testsuite/gcc.misc-tests/help.exp | 4 +-
gcc/toplev.c | 13 +-
gcc/tracer.c | 13 +-
gcc/trans-mem.c | 3 +-
gcc/tree-chrec.c | 5 +-
gcc/tree-data-ref.c | 5 +-
gcc/tree-if-conv.c | 3 +-
gcc/tree-inline.c | 3 +-
gcc/tree-loop-distribution.c | 3 +-
gcc/tree-parloops.c | 20 +-
gcc/tree-predcom.c | 3 +-
gcc/tree-profile.c | 1 -
gcc/tree-scalar-evolution.c | 5 +-
gcc/tree-sra.c | 20 +-
gcc/tree-ssa-ccp.c | 3 +-
gcc/tree-ssa-dom.c | 1 -
gcc/tree-ssa-dse.c | 9 +-
gcc/tree-ssa-ifcombine.c | 5 +-
gcc/tree-ssa-loop-ch.c | 3 +-
gcc/tree-ssa-loop-im.c | 3 +-
gcc/tree-ssa-loop-ivcanon.c | 19 +-
gcc/tree-ssa-loop-ivopts.c | 11 +-
gcc/tree-ssa-loop-manip.c | 3 +-
gcc/tree-ssa-loop-niter.c | 3 +-
gcc/tree-ssa-loop-prefetch.c | 47 +-
gcc/tree-ssa-loop-unswitch.c | 7 +-
gcc/tree-ssa-math-opts.c | 7 +-
gcc/tree-ssa-phiopt.c | 9 +-
gcc/tree-ssa-pre.c | 5 +-
gcc/tree-ssa-reassoc.c | 3 +-
gcc/tree-ssa-sccvn.c | 7 +-
gcc/tree-ssa-scopedtables.c | 3 +-
gcc/tree-ssa-sink.c | 3 +-
gcc/tree-ssa-strlen.c | 9 +-
gcc/tree-ssa-structalias.c | 9 +-
gcc/tree-ssa-tail-merge.c | 5 +-
gcc/tree-ssa-threadbackward.c | 17 +-
gcc/tree-ssa-threadedge.c | 5 +-
gcc/tree-ssa-uninit.c | 3 +-
gcc/tree-switch-conversion.c | 7 +-
gcc/tree-switch-conversion.h | 4 +-
gcc/tree-vect-data-refs.c | 12 +-
gcc/tree-vect-loop.c | 7 +-
gcc/tree-vect-slp.c | 3 +-
gcc/tree-vectorizer.h | 2 +-
gcc/tree-vrp.c | 5 +-
gcc/tree.c | 23 +-
gcc/value-prof.c | 1 -
gcc/var-tracking.c | 7 +-
171 files changed, 1689 insertions(+), 3243 deletions(-)
delete mode 100644 gcc/params-enum.h
delete mode 100644 gcc/params-list.h
delete mode 100644 gcc/params-options.h
delete mode 100644 gcc/params.c
delete mode 100644 gcc/params.def
delete mode 100644 gcc/params.h
create mode 100644 gcc/params.opt
--
2.23.0
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 4/7] Remove gcc/params.* files.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
2019-11-07 12:33 ` [PATCH 5/7] Remove last leftover usage of params* files Martin Liska
2019-11-07 12:33 ` [PATCH 2/7] Include new generated gcc/params.opt file Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-12 21:17 ` Rainer Orth
2019-11-07 12:33 ` [PATCH 6/7] Remove set_default_param_value from documentation Martin Liska
` (5 subsequent siblings)
8 siblings, 1 reply; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 13946 bytes --]
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* Makefile.in: Remove PARAMS_H and params.list
and params.options.
* params-enum.h: Remove.
* params-list.h: Remove.
* params-options.h: Remove.
* params.c: Remove.
* params.def: Remove.
* params.h: Remove.
* asan.c: Do not include params.h.
* auto-profile.c: Likewise.
* bb-reorder.c: Likewise.
* builtins.c: Likewise.
* cfgcleanup.c: Likewise.
* cfgexpand.c: Likewise.
* cfgloopanal.c: Likewise.
* cgraph.c: Likewise.
* combine.c: Likewise.
* common/config/aarch64/aarch64-common.c: Likewise.
* common/config/gcn/gcn-common.c: Likewise.
* common/config/ia64/ia64-common.c: Likewise.
* common/config/powerpcspe/powerpcspe-common.c: Likewise.
* common/config/rs6000/rs6000-common.c: Likewise.
* common/config/sh/sh-common.c: Likewise.
* config/aarch64/aarch64.c: Likewise.
* config/alpha/alpha.c: Likewise.
* config/arm/arm.c: Likewise.
* config/avr/avr.c: Likewise.
* config/csky/csky.c: Likewise.
* config/i386/i386-builtins.c: Likewise.
* config/i386/i386-expand.c: Likewise.
* config/i386/i386-features.c: Likewise.
* config/i386/i386-options.c: Likewise.
* config/i386/i386.c: Likewise.
* config/ia64/ia64.c: Likewise.
* config/rs6000/rs6000-logue.c: Likewise.
* config/rs6000/rs6000.c: Likewise.
* config/s390/s390.c: Likewise.
* config/sparc/sparc.c: Likewise.
* config/visium/visium.c: Likewise.
* coverage.c: Likewise.
* cprop.c: Likewise.
* cse.c: Likewise.
* cselib.c: Likewise.
* dse.c: Likewise.
* emit-rtl.c: Likewise.
* explow.c: Likewise.
* final.c: Likewise.
* fold-const.c: Likewise.
* gcc.c: Likewise.
* gcse.c: Likewise.
* ggc-common.c: Likewise.
* ggc-page.c: Likewise.
* gimple-loop-interchange.cc: Likewise.
* gimple-loop-jam.c: Likewise.
* gimple-loop-versioning.cc: Likewise.
* gimple-ssa-split-paths.c: Likewise.
* gimple-ssa-sprintf.c: Likewise.
* gimple-ssa-store-merging.c: Likewise.
* gimple-ssa-strength-reduction.c: Likewise.
* gimple-ssa-warn-alloca.c: Likewise.
* gimple-ssa-warn-restrict.c: Likewise.
* graphite-isl-ast-to-gimple.c: Likewise.
* graphite-optimize-isl.c: Likewise.
* graphite-scop-detection.c: Likewise.
* graphite-sese-to-poly.c: Likewise.
* graphite.c: Likewise.
* haifa-sched.c: Likewise.
* hsa-gen.c: Likewise.
* ifcvt.c: Likewise.
* ipa-cp.c: Likewise.
* ipa-fnsummary.c: Likewise.
* ipa-inline-analysis.c: Likewise.
* ipa-inline.c: Likewise.
* ipa-polymorphic-call.c: Likewise.
* ipa-profile.c: Likewise.
* ipa-prop.c: Likewise.
* ipa-split.c: Likewise.
* ipa-sra.c: Likewise.
* ira-build.c: Likewise.
* ira-conflicts.c: Likewise.
* loop-doloop.c: Likewise.
* loop-invariant.c: Likewise.
* loop-unroll.c: Likewise.
* lra-assigns.c: Likewise.
* lra-constraints.c: Likewise.
* modulo-sched.c: Likewise.
* opt-suggestions.c: Likewise.
* opts.c: Likewise.
* postreload-gcse.c: Likewise.
* predict.c: Likewise.
* reload.c: Likewise.
* reorg.c: Likewise.
* resource.c: Likewise.
* sanopt.c: Likewise.
* sched-deps.c: Likewise.
* sched-ebb.c: Likewise.
* sched-rgn.c: Likewise.
* sel-sched-ir.c: Likewise.
* sel-sched.c: Likewise.
* shrink-wrap.c: Likewise.
* stmt.c: Likewise.
* targhooks.c: Likewise.
* toplev.c: Likewise.
* tracer.c: Likewise.
* trans-mem.c: Likewise.
* tree-chrec.c: Likewise.
* tree-data-ref.c: Likewise.
* tree-if-conv.c: Likewise.
* tree-inline.c: Likewise.
* tree-loop-distribution.c: Likewise.
* tree-parloops.c: Likewise.
* tree-predcom.c: Likewise.
* tree-profile.c: Likewise.
* tree-scalar-evolution.c: Likewise.
* tree-sra.c: Likewise.
* tree-ssa-ccp.c: Likewise.
* tree-ssa-dom.c: Likewise.
* tree-ssa-dse.c: Likewise.
* tree-ssa-ifcombine.c: Likewise.
* tree-ssa-loop-ch.c: Likewise.
* tree-ssa-loop-im.c: Likewise.
* tree-ssa-loop-ivcanon.c: Likewise.
* tree-ssa-loop-ivopts.c: Likewise.
* tree-ssa-loop-manip.c: Likewise.
* tree-ssa-loop-niter.c: Likewise.
* tree-ssa-loop-prefetch.c: Likewise.
* tree-ssa-loop-unswitch.c: Likewise.
* tree-ssa-math-opts.c: Likewise.
* tree-ssa-phiopt.c: Likewise.
* tree-ssa-pre.c: Likewise.
* tree-ssa-reassoc.c: Likewise.
* tree-ssa-sccvn.c: Likewise.
* tree-ssa-scopedtables.c: Likewise.
* tree-ssa-sink.c: Likewise.
* tree-ssa-strlen.c: Likewise.
* tree-ssa-structalias.c: Likewise.
* tree-ssa-tail-merge.c: Likewise.
* tree-ssa-threadbackward.c: Likewise.
* tree-ssa-threadedge.c: Likewise.
* tree-ssa-uninit.c: Likewise.
* tree-switch-conversion.c: Likewise.
* tree-vect-data-refs.c: Likewise.
* tree-vect-loop.c: Likewise.
* tree-vect-slp.c: Likewise.
* tree-vrp.c: Likewise.
* tree.c: Likewise.
* value-prof.c: Likewise.
* var-tracking.c: Likewise.
gcc/c/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* gimple-parser.c: Do not include params.h.
gcc/cp/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* name-lookup.c: Do not include params.h.
* typeck.c: Likewise.
gcc/lto/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* lto-common.c: Do not include params.h.
* lto-partition.c: Likewise.
* lto.c: Likewise.
---
gcc/Makefile.in | 18 +-
gcc/asan.c | 1 -
gcc/auto-profile.c | 1 -
gcc/bb-reorder.c | 1 -
gcc/builtins.c | 1 -
gcc/c/gimple-parser.c | 1 -
gcc/cfgcleanup.c | 1 -
gcc/cfgexpand.c | 1 -
gcc/cfgloopanal.c | 1 -
gcc/cgraph.c | 1 -
gcc/combine.c | 1 -
gcc/common/config/aarch64/aarch64-common.c | 1 -
gcc/common/config/gcn/gcn-common.c | 1 -
gcc/common/config/ia64/ia64-common.c | 1 -
.../config/powerpcspe/powerpcspe-common.c | 1 -
gcc/common/config/rs6000/rs6000-common.c | 1 -
gcc/common/config/sh/sh-common.c | 1 -
gcc/config/aarch64/aarch64.c | 1 -
gcc/config/alpha/alpha.c | 1 -
gcc/config/arm/arm.c | 1 -
gcc/config/avr/avr.c | 1 -
gcc/config/csky/csky.c | 1 -
gcc/config/i386/i386-builtins.c | 1 -
gcc/config/i386/i386-expand.c | 1 -
gcc/config/i386/i386-features.c | 1 -
gcc/config/i386/i386-options.c | 1 -
gcc/config/i386/i386.c | 1 -
gcc/config/ia64/ia64.c | 1 -
gcc/config/rs6000/rs6000-logue.c | 1 -
gcc/config/rs6000/rs6000.c | 1 -
gcc/config/s390/s390.c | 1 -
gcc/config/sparc/sparc.c | 1 -
gcc/config/visium/visium.c | 1 -
gcc/coverage.c | 1 -
gcc/cp/name-lookup.c | 1 -
gcc/cp/typeck.c | 1 -
gcc/cprop.c | 1 -
gcc/cse.c | 1 -
gcc/cselib.c | 1 -
gcc/dse.c | 1 -
gcc/emit-rtl.c | 1 -
gcc/explow.c | 1 -
gcc/final.c | 1 -
gcc/fold-const.c | 1 -
gcc/gcc.c | 1 -
gcc/gcse.c | 1 -
gcc/ggc-common.c | 1 -
gcc/ggc-page.c | 1 -
gcc/gimple-loop-interchange.cc | 1 -
gcc/gimple-loop-jam.c | 1 -
gcc/gimple-loop-versioning.cc | 1 -
gcc/gimple-ssa-split-paths.c | 1 -
gcc/gimple-ssa-sprintf.c | 1 -
gcc/gimple-ssa-store-merging.c | 1 -
gcc/gimple-ssa-strength-reduction.c | 1 -
gcc/gimple-ssa-warn-alloca.c | 1 -
gcc/gimple-ssa-warn-restrict.c | 1 -
gcc/graphite-isl-ast-to-gimple.c | 1 -
gcc/graphite-optimize-isl.c | 1 -
gcc/graphite-scop-detection.c | 1 -
gcc/graphite-sese-to-poly.c | 1 -
gcc/graphite.c | 1 -
gcc/haifa-sched.c | 1 -
gcc/hsa-gen.c | 1 -
gcc/ifcvt.c | 1 -
gcc/ipa-cp.c | 1 -
gcc/ipa-fnsummary.c | 1 -
gcc/ipa-inline-analysis.c | 1 -
gcc/ipa-inline.c | 1 -
gcc/ipa-polymorphic-call.c | 1 -
gcc/ipa-profile.c | 1 -
gcc/ipa-prop.c | 1 -
gcc/ipa-split.c | 1 -
gcc/ipa-sra.c | 1 -
gcc/ira-build.c | 1 -
gcc/ira-conflicts.c | 1 -
gcc/loop-doloop.c | 1 -
gcc/loop-invariant.c | 1 -
gcc/loop-unroll.c | 1 -
gcc/lra-assigns.c | 1 -
gcc/lra-constraints.c | 1 -
gcc/lto/lto-common.c | 1 -
gcc/lto/lto-partition.c | 1 -
gcc/lto/lto.c | 1 -
gcc/modulo-sched.c | 1 -
gcc/opt-suggestions.c | 1 -
gcc/opts.c | 1 -
gcc/params-enum.h | 39 -
gcc/params-list.h | 26 -
gcc/params-options.h | 27 -
gcc/params.c | 302 ----
gcc/params.def | 1495 -----------------
gcc/params.h | 254 ---
gcc/postreload-gcse.c | 1 -
gcc/predict.c | 1 -
gcc/reload.c | 1 -
gcc/reorg.c | 1 -
gcc/resource.c | 1 -
gcc/sanopt.c | 1 -
gcc/sched-deps.c | 1 -
gcc/sched-ebb.c | 1 -
gcc/sched-rgn.c | 1 -
gcc/sel-sched-ir.c | 1 -
gcc/sel-sched.c | 1 -
gcc/shrink-wrap.c | 1 -
gcc/stmt.c | 1 -
gcc/targhooks.c | 1 -
gcc/toplev.c | 1 -
gcc/tracer.c | 1 -
gcc/trans-mem.c | 1 -
gcc/tree-chrec.c | 1 -
gcc/tree-data-ref.c | 1 -
gcc/tree-if-conv.c | 1 -
gcc/tree-inline.c | 1 -
gcc/tree-loop-distribution.c | 1 -
gcc/tree-parloops.c | 2 -
gcc/tree-predcom.c | 1 -
gcc/tree-profile.c | 1 -
gcc/tree-scalar-evolution.c | 1 -
gcc/tree-sra.c | 1 -
gcc/tree-ssa-ccp.c | 1 -
gcc/tree-ssa-dom.c | 1 -
gcc/tree-ssa-dse.c | 1 -
gcc/tree-ssa-ifcombine.c | 1 -
gcc/tree-ssa-loop-ch.c | 1 -
gcc/tree-ssa-loop-im.c | 1 -
gcc/tree-ssa-loop-ivcanon.c | 1 -
gcc/tree-ssa-loop-ivopts.c | 1 -
gcc/tree-ssa-loop-manip.c | 1 -
gcc/tree-ssa-loop-niter.c | 1 -
gcc/tree-ssa-loop-prefetch.c | 1 -
gcc/tree-ssa-loop-unswitch.c | 1 -
gcc/tree-ssa-math-opts.c | 1 -
gcc/tree-ssa-phiopt.c | 1 -
gcc/tree-ssa-pre.c | 1 -
gcc/tree-ssa-reassoc.c | 1 -
gcc/tree-ssa-sccvn.c | 1 -
gcc/tree-ssa-scopedtables.c | 1 -
gcc/tree-ssa-sink.c | 1 -
gcc/tree-ssa-strlen.c | 1 -
gcc/tree-ssa-structalias.c | 1 -
gcc/tree-ssa-tail-merge.c | 1 -
gcc/tree-ssa-threadbackward.c | 1 -
gcc/tree-ssa-threadedge.c | 1 -
gcc/tree-ssa-uninit.c | 1 -
gcc/tree-switch-conversion.c | 1 -
gcc/tree-vect-data-refs.c | 1 -
gcc/tree-vect-loop.c | 1 -
gcc/tree-vect-slp.c | 1 -
gcc/tree-vrp.c | 1 -
gcc/tree.c | 1 -
gcc/value-prof.c | 1 -
gcc/var-tracking.c | 1 -
153 files changed, 2 insertions(+), 2306 deletions(-)
delete mode 100644 gcc/params-enum.h
delete mode 100644 gcc/params-list.h
delete mode 100644 gcc/params-options.h
delete mode 100644 gcc/params.c
delete mode 100644 gcc/params.def
delete mode 100644 gcc/params.h
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0004-Remove-gcc-params.-files.patch --]
[-- Type: text/x-patch; name="0004-Remove-gcc-params.-files.patch", Size: 137533 bytes --]
diff --git a/gcc/Makefile.in b/gcc/Makefile.in
index ed47a346689..5abcfbce281 100644
--- a/gcc/Makefile.in
+++ b/gcc/Makefile.in
@@ -928,7 +928,6 @@ RTL_BASE_H = $(CORETYPES_H) rtl.h rtl.def reg-notes.def \
FIXED_VALUE_H = fixed-value.h
RTL_H = $(RTL_BASE_H) $(FLAGS_H) genrtl.h
READ_MD_H = $(OBSTACK_H) $(HASHTAB_H) read-md.h
-PARAMS_H = params.h params-enum.h params.def
BUILTINS_DEF = builtins.def sync-builtins.def omp-builtins.def \
gtm-builtins.def sanitizer.def \
hsa-builtins.def
@@ -1630,7 +1629,7 @@ OBJS-libcommon = diagnostic.o diagnostic-color.o diagnostic-show-locus.o \
# Objects in libcommon-target.a, used by drivers and by the core
# compiler and containing target-dependent code.
-OBJS-libcommon-target = $(common_out_object_file) prefix.o params.o \
+OBJS-libcommon-target = $(common_out_object_file) prefix.o \
opts.o opts-common.o options.o vec.o hooks.o common/common-targhooks.o \
hash-table.o file-find.o spellcheck.o selftest.o opt-suggestions.o
@@ -2652,7 +2651,7 @@ generated_files = config.h tm.h $(TM_P_H) $(TM_D_H) $(TM_H) multilib.h \
options.h target-hooks-def.h insn-opinit.h \
common/common-target-hooks-def.h pass-instances.def \
c-family/c-target-hooks-def.h d/d-target-hooks-def.h \
- params.list params.options case-cfn-macros.h \
+ case-cfn-macros.h \
cfn-operators.pd omp-device-properties.h
#\f
@@ -3513,19 +3512,6 @@ installdirs:
$(mkinstalldirs) $(DESTDIR)$(man1dir)
$(mkinstalldirs) $(DESTDIR)$(man7dir)
-params.list: s-params.list; @true
-s-params.list: $(srcdir)/params-list.h $(srcdir)/params.def
- $(CPP) $(srcdir)/params-list.h | sed 's/^#.*//;/^$$/d' > tmp-params.list
- $(SHELL) $(srcdir)/../move-if-change tmp-params.list params.list
- $(STAMP) s-params.list
-
-params.options: s-params.options; @true
-s-params.options: $(srcdir)/params-options.h $(srcdir)/params.def
- $(CPP) $(srcdir)/params-options.h | sed 's/^#.*//;/^$$/d' > tmp-params.options
- $(SHELL) $(srcdir)/../move-if-change tmp-params.options params.options
- $(STAMP) s-params.options
-
-
PLUGIN_HEADERS = $(TREE_H) $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TM_H) \
toplev.h $(DIAGNOSTIC_CORE_H) $(BASIC_BLOCK_H) $(HASH_TABLE_H) \
tree-ssa-alias.h $(INTERNAL_FN_H) gimple-fold.h tree-eh.h gimple-expr.h \
diff --git a/gcc/asan.c b/gcc/asan.c
index 406d829125d..40ac9e2f20f 100644
--- a/gcc/asan.c
+++ b/gcc/asan.c
@@ -59,7 +59,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-builder.h"
#include "gimple-fold.h"
#include "ubsan.h"
-#include "params.h"
#include "builtins.h"
#include "fnmatch.h"
#include "tree-inline.h"
diff --git a/gcc/auto-profile.c b/gcc/auto-profile.c
index 4fd1df6fa7f..38292950c12 100644
--- a/gcc/auto-profile.c
+++ b/gcc/auto-profile.c
@@ -41,7 +41,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-into-ssa.h"
#include "gimple-iterator.h"
#include "value-prof.h"
-#include "params.h"
#include "symbol-summary.h"
#include "ipa-prop.h"
#include "ipa-fnsummary.h"
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c
index 6a85c2a7fc0..f811569a7df 100644
--- a/gcc/bb-reorder.c
+++ b/gcc/bb-reorder.c
@@ -105,7 +105,6 @@
#include "emit-rtl.h"
#include "output.h"
#include "expr.h"
-#include "params.h"
#include "tree-pass.h"
#include "cfgrtl.h"
#include "cfganal.h"
diff --git a/gcc/builtins.c b/gcc/builtins.c
index 68baeb9bbe9..450cc7ad4c2 100644
--- a/gcc/builtins.c
+++ b/gcc/builtins.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "memmodel.h"
#include "gimple.h"
#include "predict.h"
-#include "params.h"
#include "tm_p.h"
#include "stringpool.h"
#include "tree-vrp.h"
diff --git a/gcc/c/gimple-parser.c b/gcc/c/gimple-parser.c
index e40cfa2ec01..e81e5235441 100644
--- a/gcc/c/gimple-parser.c
+++ b/gcc/c/gimple-parser.c
@@ -63,7 +63,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-phinodes.h"
#include "tree-into-ssa.h"
#include "bitmap.h"
-#include "params.h"
/* GIMPLE parser state. */
diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c
index 7b1dd245487..6539d9364c4 100644
--- a/gcc/cfgcleanup.c
+++ b/gcc/cfgcleanup.c
@@ -43,7 +43,6 @@ along with GCC; see the file COPYING3. If not see
#include "insn-config.h"
#include "emit-rtl.h"
#include "cselib.h"
-#include "params.h"
#include "tree-pass.h"
#include "cfgloop.h"
#include "cfgrtl.h"
diff --git a/gcc/cfgexpand.c b/gcc/cfgexpand.c
index 5fed0738211..e8bed2504bf 100644
--- a/gcc/cfgexpand.c
+++ b/gcc/cfgexpand.c
@@ -61,7 +61,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-pretty-print.h"
#include "toplev.h"
#include "debug.h"
-#include "params.h"
#include "tree-inline.h"
#include "value-prof.h"
#include "tree-ssa-live.h"
diff --git a/gcc/cfgloopanal.c b/gcc/cfgloopanal.c
index 84516efcfb6..199c20b1423 100644
--- a/gcc/cfgloopanal.c
+++ b/gcc/cfgloopanal.c
@@ -30,7 +30,6 @@ along with GCC; see the file COPYING3. If not see
#include "explow.h"
#include "expr.h"
#include "graphds.h"
-#include "params.h"
#include "sreal.h"
#include "regs.h"
#include "function-abi.h"
diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index 62a36c9f6c1..e89e44aaaf0 100644
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -57,7 +57,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-pretty-print.h"
#include "tree-dfa.h"
#include "profile.h"
-#include "params.h"
#include "context.h"
#include "gimplify.h"
#include "stringpool.h"
diff --git a/gcc/combine.c b/gcc/combine.c
index ae3bc468910..a9721ebdcc0 100644
--- a/gcc/combine.c
+++ b/gcc/combine.c
@@ -100,7 +100,6 @@ along with GCC; see the file COPYING3. If not see
#include "insn-attr.h"
#include "rtlhooks-def.h"
#include "expr.h"
-#include "params.h"
#include "tree-pass.h"
#include "valtrack.h"
#include "rtl-iter.h"
diff --git a/gcc/common/config/aarch64/aarch64-common.c b/gcc/common/config/aarch64/aarch64-common.c
index adb3ff71af8..b4ba6708af1 100644
--- a/gcc/common/config/aarch64/aarch64-common.c
+++ b/gcc/common/config/aarch64/aarch64-common.c
@@ -30,7 +30,6 @@
#include "opts.h"
#include "flags.h"
#include "diagnostic.h"
-#include "params.h"
#ifdef TARGET_BIG_ENDIAN_DEFAULT
#undef TARGET_DEFAULT_TARGET_FLAGS
diff --git a/gcc/common/config/gcn/gcn-common.c b/gcc/common/config/gcn/gcn-common.c
index f34953dc04b..6d82ead7b80 100644
--- a/gcc/common/config/gcn/gcn-common.c
+++ b/gcc/common/config/gcn/gcn-common.c
@@ -23,7 +23,6 @@
#include "common/common-target-def.h"
#include "opts.h"
#include "flags.h"
-#include "params.h"
/* Set default optimization options. */
static const struct default_options gcn_option_optimization_table[] =
diff --git a/gcc/common/config/ia64/ia64-common.c b/gcc/common/config/ia64/ia64-common.c
index 0a187160fd2..a9ff29563a3 100644
--- a/gcc/common/config/ia64/ia64-common.c
+++ b/gcc/common/config/ia64/ia64-common.c
@@ -28,7 +28,6 @@ along with GCC; see the file COPYING3. If not see
#include "common/common-target-def.h"
#include "opts.h"
#include "flags.h"
-#include "params.h"
/* Implement overriding of the optimization options. */
static const struct default_options ia64_option_optimization_table[] =
diff --git a/gcc/common/config/powerpcspe/powerpcspe-common.c b/gcc/common/config/powerpcspe/powerpcspe-common.c
index 7043a4bda31..8976425b434 100644
--- a/gcc/common/config/powerpcspe/powerpcspe-common.c
+++ b/gcc/common/config/powerpcspe/powerpcspe-common.c
@@ -26,7 +26,6 @@
#include "common/common-target-def.h"
#include "opts.h"
#include "flags.h"
-#include "params.h"
/* Implement TARGET_OPTION_OPTIMIZATION_TABLE. */
static const struct default_options rs6000_option_optimization_table[] =
diff --git a/gcc/common/config/rs6000/rs6000-common.c b/gcc/common/config/rs6000/rs6000-common.c
index afc1a0cfcbc..bf4913616e5 100644
--- a/gcc/common/config/rs6000/rs6000-common.c
+++ b/gcc/common/config/rs6000/rs6000-common.c
@@ -26,7 +26,6 @@
#include "common/common-target-def.h"
#include "opts.h"
#include "flags.h"
-#include "params.h"
/* Implement TARGET_OPTION_OPTIMIZATION_TABLE. */
static const struct default_options rs6000_option_optimization_table[] =
diff --git a/gcc/common/config/sh/sh-common.c b/gcc/common/config/sh/sh-common.c
index e6ecc3a632a..104b1b4a304 100644
--- a/gcc/common/config/sh/sh-common.c
+++ b/gcc/common/config/sh/sh-common.c
@@ -25,7 +25,6 @@ along with GCC; see the file COPYING3. If not see
#include "common/common-target-def.h"
#include "opts.h"
#include "flags.h"
-#include "params.h"
/* Set default optimization options. */
static const struct default_options sh_option_optimization_table[] =
diff --git a/gcc/config/aarch64/aarch64.c b/gcc/config/aarch64/aarch64.c
index c4783861c5d..78e6bc0475e 100644
--- a/gcc/config/aarch64/aarch64.c
+++ b/gcc/config/aarch64/aarch64.c
@@ -55,7 +55,6 @@
#include "reload.h"
#include "langhooks.h"
#include "opts.h"
-#include "params.h"
#include "gimplify.h"
#include "dwarf2.h"
#include "gimple-iterator.h"
diff --git a/gcc/config/alpha/alpha.c b/gcc/config/alpha/alpha.c
index 8f389ead32d..7e4298873bb 100644
--- a/gcc/config/alpha/alpha.c
+++ b/gcc/config/alpha/alpha.c
@@ -64,7 +64,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-stdarg.h"
#include "tm-constrs.h"
#include "libfuncs.h"
-#include "params.h"
#include "builtins.h"
#include "rtl-iter.h"
#include "flags.h"
diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
index 4437a5bc509..7946196f666 100644
--- a/gcc/config/arm/arm.c
+++ b/gcc/config/arm/arm.c
@@ -59,7 +59,6 @@
#include "langhooks.h"
#include "intl.h"
#include "libfuncs.h"
-#include "params.h"
#include "opts.h"
#include "dumpfile.h"
#include "target-globals.h"
diff --git a/gcc/config/avr/avr.c b/gcc/config/avr/avr.c
index fc213895091..1c5405c41e1 100644
--- a/gcc/config/avr/avr.c
+++ b/gcc/config/avr/avr.c
@@ -51,7 +51,6 @@
#include "expr.h"
#include "langhooks.h"
#include "cfgrtl.h"
-#include "params.h"
#include "builtins.h"
#include "context.h"
#include "tree-pass.h"
diff --git a/gcc/config/csky/csky.c b/gcc/config/csky/csky.c
index 0759ddc00e6..544165c0cc2 100644
--- a/gcc/config/csky/csky.c
+++ b/gcc/config/csky/csky.c
@@ -58,7 +58,6 @@
#include "langhooks.h"
#include "intl.h"
#include "libfuncs.h"
-#include "params.h"
#include "opts.h"
#include "dumpfile.h"
#include "target-globals.h"
diff --git a/gcc/config/i386/i386-builtins.c b/gcc/config/i386/i386-builtins.c
index 5b388ec7910..0764aa48ab1 100644
--- a/gcc/config/i386/i386-builtins.c
+++ b/gcc/config/i386/i386-builtins.c
@@ -58,7 +58,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "dwarf2.h"
#include "tm-constrs.h"
-#include "params.h"
#include "cselib.h"
#include "sched-int.h"
#include "opts.h"
diff --git a/gcc/config/i386/i386-expand.c b/gcc/config/i386/i386-expand.c
index 6d3d14c37dd..4c719644537 100644
--- a/gcc/config/i386/i386-expand.c
+++ b/gcc/config/i386/i386-expand.c
@@ -58,7 +58,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "dwarf2.h"
#include "tm-constrs.h"
-#include "params.h"
#include "cselib.h"
#include "sched-int.h"
#include "opts.h"
diff --git a/gcc/config/i386/i386-features.c b/gcc/config/i386/i386-features.c
index 4781a33a545..3a81fd3116b 100644
--- a/gcc/config/i386/i386-features.c
+++ b/gcc/config/i386/i386-features.c
@@ -58,7 +58,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "dwarf2.h"
#include "tm-constrs.h"
-#include "params.h"
#include "cselib.h"
#include "sched-int.h"
#include "opts.h"
diff --git a/gcc/config/i386/i386-options.c b/gcc/config/i386/i386-options.c
index 72cd6dcc98c..1e3280d1bb9 100644
--- a/gcc/config/i386/i386-options.c
+++ b/gcc/config/i386/i386-options.c
@@ -58,7 +58,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "dwarf2.h"
#include "tm-constrs.h"
-#include "params.h"
#include "cselib.h"
#include "sched-int.h"
#include "opts.h"
diff --git a/gcc/config/i386/i386.c b/gcc/config/i386/i386.c
index f775697f982..ce446b248a8 100644
--- a/gcc/config/i386/i386.c
+++ b/gcc/config/i386/i386.c
@@ -59,7 +59,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "dwarf2.h"
#include "tm-constrs.h"
-#include "params.h"
#include "cselib.h"
#include "sched-int.h"
#include "opts.h"
diff --git a/gcc/config/ia64/ia64.c b/gcc/config/ia64/ia64.c
index 44f7f2eea06..f1bd919bfc2 100644
--- a/gcc/config/ia64/ia64.c
+++ b/gcc/config/ia64/ia64.c
@@ -57,7 +57,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "intl.h"
#include "debug.h"
-#include "params.h"
#include "dbgcnt.h"
#include "tm-constrs.h"
#include "sel-sched.h"
diff --git a/gcc/config/rs6000/rs6000-logue.c b/gcc/config/rs6000/rs6000-logue.c
index f0fd2065c02..9b3afeaa45e 100644
--- a/gcc/config/rs6000/rs6000-logue.c
+++ b/gcc/config/rs6000/rs6000-logue.c
@@ -45,7 +45,6 @@
#include "langhooks.h"
#include "optabs.h"
#include "diagnostic-core.h"
-#include "params.h"
#include "alias.h"
#include "rs6000-internal.h"
#if TARGET_MACHO
diff --git a/gcc/config/rs6000/rs6000.c b/gcc/config/rs6000/rs6000.c
index 0e9e5a79c54..c0c810abb54 100644
--- a/gcc/config/rs6000/rs6000.c
+++ b/gcc/config/rs6000/rs6000.c
@@ -62,7 +62,6 @@
#include "gimple-ssa.h"
#include "gimple-walk.h"
#include "intl.h"
-#include "params.h"
#include "tm-constrs.h"
#include "tree-vectorizer.h"
#include "target-globals.h"
diff --git a/gcc/config/s390/s390.c b/gcc/config/s390/s390.c
index b3a75222ac2..c76115801fc 100644
--- a/gcc/config/s390/s390.c
+++ b/gcc/config/s390/s390.c
@@ -73,7 +73,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-fold.h"
#include "tree-eh.h"
#include "gimplify.h"
-#include "params.h"
#include "opts.h"
#include "tree-pass.h"
#include "context.h"
diff --git a/gcc/config/sparc/sparc.c b/gcc/config/sparc/sparc.c
index 473011aa1e6..8e2bd508b8b 100644
--- a/gcc/config/sparc/sparc.c
+++ b/gcc/config/sparc/sparc.c
@@ -56,7 +56,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify.h"
#include "langhooks.h"
#include "reload.h"
-#include "params.h"
#include "tree-pass.h"
#include "context.h"
#include "builtins.h"
diff --git a/gcc/config/visium/visium.c b/gcc/config/visium/visium.c
index b1ace70b5f7..89eaa64375f 100644
--- a/gcc/config/visium/visium.c
+++ b/gcc/config/visium/visium.c
@@ -53,7 +53,6 @@
#include "langhooks.h"
#include "reload.h"
#include "tm-constrs.h"
-#include "params.h"
#include "tree-pass.h"
#include "context.h"
#include "builtins.h"
diff --git a/gcc/coverage.c b/gcc/coverage.c
index ebe27a323b2..b8b20ddc8e3 100644
--- a/gcc/coverage.c
+++ b/gcc/coverage.c
@@ -47,7 +47,6 @@ along with GCC; see the file COPYING3. If not see
#include "context.h"
#include "pass_manager.h"
#include "intl.h"
-#include "params.h"
#include "auto-profile.h"
#include "profile.h"
diff --git a/gcc/cp/name-lookup.c b/gcc/cp/name-lookup.c
index be846a12141..d114c8873b2 100644
--- a/gcc/cp/name-lookup.c
+++ b/gcc/cp/name-lookup.c
@@ -29,7 +29,6 @@ along with GCC; see the file COPYING3. If not see
#include "attribs.h"
#include "debug.h"
#include "c-family/c-pragma.h"
-#include "params.h"
#include "gcc-rich-location.h"
#include "spellcheck-tree.h"
#include "parser.h"
diff --git a/gcc/cp/typeck.c b/gcc/cp/typeck.c
index ce294171261..5a1bcafa38f 100644
--- a/gcc/cp/typeck.c
+++ b/gcc/cp/typeck.c
@@ -35,7 +35,6 @@ along with GCC; see the file COPYING3. If not see
#include "convert.h"
#include "c-family/c-objc.h"
#include "c-family/c-ubsan.h"
-#include "params.h"
#include "gcc-rich-location.h"
#include "stringpool.h"
#include "attribs.h"
diff --git a/gcc/cprop.c b/gcc/cprop.c
index 65c0130cc07..05d3686c952 100644
--- a/gcc/cprop.c
+++ b/gcc/cprop.c
@@ -34,7 +34,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfganal.h"
#include "lcm.h"
#include "cfgcleanup.h"
-#include "params.h"
#include "cselib.h"
#include "intl.h"
#include "tree-pass.h"
diff --git a/gcc/cse.c b/gcc/cse.c
index b1c0276b0f7..ab9b8b43431 100644
--- a/gcc/cse.c
+++ b/gcc/cse.c
@@ -37,7 +37,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgcleanup.h"
#include "alias.h"
#include "toplev.h"
-#include "params.h"
#include "rtlhooks-def.h"
#include "tree-pass.h"
#include "dbgcnt.h"
diff --git a/gcc/cselib.c b/gcc/cselib.c
index 1745256944a..973ff7b0970 100644
--- a/gcc/cselib.c
+++ b/gcc/cselib.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "emit-rtl.h"
#include "dumpfile.h"
#include "cselib.h"
-#include "params.h"
#include "function-abi.h"
/* A list of cselib_val structures. */
diff --git a/gcc/dse.c b/gcc/dse.c
index 76abd873c78..f6e6c26446c 100644
--- a/gcc/dse.c
+++ b/gcc/dse.c
@@ -47,7 +47,6 @@ along with GCC; see the file COPYING3. If not see
#include "explow.h"
#include "expr.h"
#include "dbgcnt.h"
-#include "params.h"
#include "rtl-iter.h"
#include "cfgcleanup.h"
#include "calls.h"
diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c
index 5f3e549a7fe..33ecfa209b6 100644
--- a/gcc/emit-rtl.c
+++ b/gcc/emit-rtl.c
@@ -54,7 +54,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-eh.h"
#include "explow.h"
#include "expr.h"
-#include "params.h"
#include "builtins.h"
#include "rtl-iter.h"
#include "stor-layout.h"
diff --git a/gcc/explow.c b/gcc/explow.c
index 93e31cc3ba1..d174632c5fc 100644
--- a/gcc/explow.c
+++ b/gcc/explow.c
@@ -41,7 +41,6 @@ along with GCC; see the file COPYING3. If not see
#include "stringpool.h"
#include "common/common-target.h"
#include "output.h"
-#include "params.h"
static rtx break_out_memory_refs (rtx);
static void anti_adjust_stack_and_probe_stack_clash (rtx);
diff --git a/gcc/final.c b/gcc/final.c
index 3b9a88dc8a7..77a9e9a4a3f 100644
--- a/gcc/final.c
+++ b/gcc/final.c
@@ -75,7 +75,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-pass.h"
#include "tree-ssa.h"
#include "cfgloop.h"
-#include "params.h"
#include "stringpool.h"
#include "attribs.h"
#include "asan.h"
diff --git a/gcc/fold-const.c b/gcc/fold-const.c
index 931be36df84..a76d1321b9f 100644
--- a/gcc/fold-const.c
+++ b/gcc/fold-const.c
@@ -71,7 +71,6 @@ along with GCC; see the file COPYING3. If not see
#include "builtins.h"
#include "generic-match.h"
#include "gimple-fold.h"
-#include "params.h"
#include "tree-into-ssa.h"
#include "md5.h"
#include "case-cfn-macros.h"
diff --git a/gcc/gcc.c b/gcc/gcc.c
index c45a1df656b..159ffe7cb53 100644
--- a/gcc/gcc.c
+++ b/gcc/gcc.c
@@ -41,7 +41,6 @@ compilation is specified by a string called a "spec". */
#include "diagnostic.h"
#include "flags.h"
#include "opts.h"
-#include "params.h"
#include "filenames.h"
#include "spellcheck.h"
diff --git a/gcc/gcse.c b/gcc/gcse.c
index 4f63bff6672..f1e703fe6f5 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -154,7 +154,6 @@ along with GCC; see the file COPYING3. If not see
#include "lcm.h"
#include "cfgcleanup.h"
#include "expr.h"
-#include "params.h"
#include "intl.h"
#include "tree-pass.h"
#include "dbgcnt.h"
diff --git a/gcc/ggc-common.c b/gcc/ggc-common.c
index cf7a4f68405..f6e393d7bb6 100644
--- a/gcc/ggc-common.c
+++ b/gcc/ggc-common.c
@@ -27,7 +27,6 @@ along with GCC; see the file COPYING3. If not see
#include "timevar.h"
#include "diagnostic-core.h"
#include "ggc-internal.h"
-#include "params.h"
#include "hosthooks.h"
#include "plugin.h"
#include "options.h"
diff --git a/gcc/ggc-page.c b/gcc/ggc-page.c
index b0d26256072..dde39e680da 100644
--- a/gcc/ggc-page.c
+++ b/gcc/ggc-page.c
@@ -30,7 +30,6 @@ along with GCC; see the file COPYING3. If not see
#include "flags.h"
#include "ggc-internal.h"
#include "timevar.h"
-#include "params.h"
#include "cgraph.h"
#include "cfgloop.h"
#include "plugin.h"
diff --git a/gcc/gimple-loop-interchange.cc b/gcc/gimple-loop-interchange.cc
index 2a0cf6e41d8..1370201fdfe 100644
--- a/gcc/gimple-loop-interchange.cc
+++ b/gcc/gimple-loop-interchange.cc
@@ -33,7 +33,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "gimplify-me.h"
#include "cfgloop.h"
-#include "params.h"
#include "tree-ssa.h"
#include "tree-scalar-evolution.h"
#include "tree-ssa-loop-manip.h"
diff --git a/gcc/gimple-loop-jam.c b/gcc/gimple-loop-jam.c
index c1fc9ba9916..d07e987a48c 100644
--- a/gcc/gimple-loop-jam.c
+++ b/gcc/gimple-loop-jam.c
@@ -20,7 +20,6 @@ along with GCC; see the file COPYING3. If not see
#include "config.h"
#include "system.h"
#include "coretypes.h"
-#include "params.h"
#include "tree-pass.h"
#include "backend.h"
#include "tree.h"
diff --git a/gcc/gimple-loop-versioning.cc b/gcc/gimple-loop-versioning.cc
index 18456e87958..45de9025d11 100644
--- a/gcc/gimple-loop-versioning.cc
+++ b/gcc/gimple-loop-versioning.cc
@@ -43,7 +43,6 @@ along with GCC; see the file COPYING3. If not see
#include "omp-general.h"
#include "predict.h"
#include "tree-into-ssa.h"
-#include "params.h"
namespace {
diff --git a/gcc/gimple-ssa-split-paths.c b/gcc/gimple-ssa-split-paths.c
index 49a0834d647..f71fd199abf 100644
--- a/gcc/gimple-ssa-split-paths.c
+++ b/gcc/gimple-ssa-split-paths.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tracer.h"
#include "predict.h"
-#include "params.h"
#include "gimple-ssa.h"
#include "tree-phinodes.h"
#include "ssa-iterators.h"
diff --git a/gcc/gimple-ssa-sprintf.c b/gcc/gimple-ssa-sprintf.c
index ef04b2a5938..424d784bcba 100644
--- a/gcc/gimple-ssa-sprintf.c
+++ b/gcc/gimple-ssa-sprintf.c
@@ -60,7 +60,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tree-ssa.h"
#include "tree-object-size.h"
-#include "params.h"
#include "tree-cfg.h"
#include "tree-ssa-propagate.h"
#include "calls.h"
diff --git a/gcc/gimple-ssa-store-merging.c b/gcc/gimple-ssa-store-merging.c
index 19c0b875a90..d03f143e64c 100644
--- a/gcc/gimple-ssa-store-merging.c
+++ b/gcc/gimple-ssa-store-merging.c
@@ -151,7 +151,6 @@
#include "gimple-pretty-print.h"
#include "alias.h"
#include "fold-const.h"
-#include "params.h"
#include "print-tree.h"
#include "tree-hash-traits.h"
#include "gimple-iterator.h"
diff --git a/gcc/gimple-ssa-strength-reduction.c b/gcc/gimple-ssa-strength-reduction.c
index ab5011a7a1e..d01c5d25431 100644
--- a/gcc/gimple-ssa-strength-reduction.c
+++ b/gcc/gimple-ssa-strength-reduction.c
@@ -52,7 +52,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgloop.h"
#include "tree-cfg.h"
#include "domwalk.h"
-#include "params.h"
#include "tree-ssa-address.h"
#include "tree-affine.h"
#include "tree-eh.h"
diff --git a/gcc/gimple-ssa-warn-alloca.c b/gcc/gimple-ssa-warn-alloca.c
index af39ff415e1..8fce1d1dc0c 100644
--- a/gcc/gimple-ssa-warn-alloca.c
+++ b/gcc/gimple-ssa-warn-alloca.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "fold-const.h"
#include "gimple-iterator.h"
#include "tree-ssa.h"
-#include "params.h"
#include "tree-cfg.h"
#include "builtins.h"
#include "calls.h"
diff --git a/gcc/gimple-ssa-warn-restrict.c b/gcc/gimple-ssa-warn-restrict.c
index f452debf93b..2cf84b7aac2 100644
--- a/gcc/gimple-ssa-warn-restrict.c
+++ b/gcc/gimple-ssa-warn-restrict.c
@@ -36,7 +36,6 @@
#include "gimple-iterator.h"
#include "tree-dfa.h"
#include "tree-ssa.h"
-#include "params.h"
#include "tree-cfg.h"
#include "tree-object-size.h"
#include "calls.h"
diff --git a/gcc/graphite-isl-ast-to-gimple.c b/gcc/graphite-isl-ast-to-gimple.c
index 11a4da0a623..9fe82ecbdb8 100644
--- a/gcc/graphite-isl-ast-to-gimple.c
+++ b/gcc/graphite-isl-ast-to-gimple.c
@@ -32,7 +32,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree.h"
#include "gimple.h"
#include "ssa.h"
-#include "params.h"
#include "fold-const.h"
#include "gimple-fold.h"
#include "gimple-iterator.h"
diff --git a/gcc/graphite-optimize-isl.c b/gcc/graphite-optimize-isl.c
index 1dc9c3cb7be..897653e7aeb 100644
--- a/gcc/graphite-optimize-isl.c
+++ b/gcc/graphite-optimize-isl.c
@@ -35,7 +35,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa-loop.h"
#include "cfgloop.h"
#include "tree-data-ref.h"
-#include "params.h"
#include "dumpfile.h"
#include "tree-vectorizer.h"
#include "graphite.h"
diff --git a/gcc/graphite-scop-detection.c b/gcc/graphite-scop-detection.c
index 1505a13b860..7db2f9a50f8 100644
--- a/gcc/graphite-scop-detection.c
+++ b/gcc/graphite-scop-detection.c
@@ -30,7 +30,6 @@ along with GCC; see the file COPYING3. If not see
#include "backend.h"
#include "cfghooks.h"
#include "domwalk.h"
-#include "params.h"
#include "tree.h"
#include "gimple.h"
#include "ssa.h"
diff --git a/gcc/graphite-sese-to-poly.c b/gcc/graphite-sese-to-poly.c
index 08f17db2301..974b59f48f2 100644
--- a/gcc/graphite-sese-to-poly.c
+++ b/gcc/graphite-sese-to-poly.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree.h"
#include "gimple.h"
#include "ssa.h"
-#include "params.h"
#include "fold-const.h"
#include "gimple-iterator.h"
#include "gimplify.h"
diff --git a/gcc/graphite.c b/gcc/graphite.c
index 67202e276e2..1bc93f7362e 100644
--- a/gcc/graphite.c
+++ b/gcc/graphite.c
@@ -36,7 +36,6 @@ along with GCC; see the file COPYING3. If not see
#include "diagnostic-core.h"
#include "cfgloop.h"
#include "tree-pass.h"
-#include "params.h"
#include "pretty-print.h"
#include "cfganal.h"
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index c634e83441a..c1c989d195f 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -141,7 +141,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgbuild.h"
#include "sched-int.h"
#include "common/common-target.h"
-#include "params.h"
#include "dbgcnt.h"
#include "cfgloop.h"
#include "dumpfile.h"
diff --git a/gcc/hsa-gen.c b/gcc/hsa-gen.c
index c4a03f938cf..bdf488d8133 100644
--- a/gcc/hsa-gen.c
+++ b/gcc/hsa-gen.c
@@ -56,7 +56,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgloop.h"
#include "cfganal.h"
#include "builtins.h"
-#include "params.h"
#include "gomp-constants.h"
#include "internal-fn.h"
#include "builtins.h"
diff --git a/gcc/ifcvt.c b/gcc/ifcvt.c
index 5df8a43a5f7..b45152a4b42 100644
--- a/gcc/ifcvt.c
+++ b/gcc/ifcvt.c
@@ -45,7 +45,6 @@
#include "shrink-wrap.h"
#include "rtl-iter.h"
#include "ifcvt.h"
-#include "params.h"
#ifndef MAX_CONDITIONAL_EXECUTE
#define MAX_CONDITIONAL_EXECUTE \
diff --git a/gcc/ipa-cp.c b/gcc/ipa-cp.c
index 5f52a4b0ad7..8780a6d9aae 100644
--- a/gcc/ipa-cp.c
+++ b/gcc/ipa-cp.c
@@ -118,7 +118,6 @@ along with GCC; see the file COPYING3. If not see
#include "ipa-prop.h"
#include "tree-pretty-print.h"
#include "tree-inline.h"
-#include "params.h"
#include "ipa-fnsummary.h"
#include "ipa-utils.h"
#include "tree-ssa-ccp.h"
diff --git a/gcc/ipa-fnsummary.c b/gcc/ipa-fnsummary.c
index 4aac57446f2..5688ed5be2e 100644
--- a/gcc/ipa-fnsummary.c
+++ b/gcc/ipa-fnsummary.c
@@ -67,7 +67,6 @@ along with GCC; see the file COPYING3. If not see
#include "print-tree.h"
#include "tree-inline.h"
#include "gimple-pretty-print.h"
-#include "params.h"
#include "cfganal.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
diff --git a/gcc/ipa-inline-analysis.c b/gcc/ipa-inline-analysis.c
index 33822e11308..d73e1b7d284 100644
--- a/gcc/ipa-inline-analysis.c
+++ b/gcc/ipa-inline-analysis.c
@@ -34,7 +34,6 @@ along with GCC; see the file COPYING3. If not see
#include "print-tree.h"
#include "tree-inline.h"
#include "gimple-pretty-print.h"
-#include "params.h"
#include "cfganal.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c
index b765a509564..b0ecc300bc5 100644
--- a/gcc/ipa-inline.c
+++ b/gcc/ipa-inline.c
@@ -105,7 +105,6 @@ along with GCC; see the file COPYING3. If not see
#include "trans-mem.h"
#include "calls.h"
#include "tree-inline.h"
-#include "params.h"
#include "profile.h"
#include "symbol-summary.h"
#include "tree-vrp.h"
diff --git a/gcc/ipa-polymorphic-call.c b/gcc/ipa-polymorphic-call.c
index 7c2b4c795fa..78e102c3947 100644
--- a/gcc/ipa-polymorphic-call.c
+++ b/gcc/ipa-polymorphic-call.c
@@ -38,7 +38,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-dfa.h"
#include "gimple-pretty-print.h"
#include "tree-into-ssa.h"
-#include "params.h"
/* Return true when TYPE contains an polymorphic type and thus is interesting
for devirtualization machinery. */
diff --git a/gcc/ipa-profile.c b/gcc/ipa-profile.c
index 19cf8eae18f..b3db9522c18 100644
--- a/gcc/ipa-profile.c
+++ b/gcc/ipa-profile.c
@@ -51,7 +51,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "ipa-utils.h"
#include "profile.h"
-#include "params.h"
#include "value-prof.h"
#include "tree-inline.h"
#include "symbol-summary.h"
diff --git a/gcc/ipa-prop.c b/gcc/ipa-prop.c
index b763aefa478..6773b335824 100644
--- a/gcc/ipa-prop.c
+++ b/gcc/ipa-prop.c
@@ -47,7 +47,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-inline.h"
#include "ipa-fnsummary.h"
#include "gimple-pretty-print.h"
-#include "params.h"
#include "ipa-utils.h"
#include "dbgcnt.h"
#include "domwalk.h"
diff --git a/gcc/ipa-split.c b/gcc/ipa-split.c
index c73b257ca7f..6ffadc2a60f 100644
--- a/gcc/ipa-split.c
+++ b/gcc/ipa-split.c
@@ -100,7 +100,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-into-ssa.h"
#include "tree-dfa.h"
#include "tree-inline.h"
-#include "params.h"
#include "gimple-pretty-print.h"
#include "ipa-fnsummary.h"
#include "cfgloop.h"
diff --git a/gcc/ipa-sra.c b/gcc/ipa-sra.c
index 365c0eeedff..14975744760 100644
--- a/gcc/ipa-sra.c
+++ b/gcc/ipa-sra.c
@@ -77,7 +77,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-sra.h"
#include "alloc-pool.h"
#include "symbol-summary.h"
-#include "params.h"
#include "dbgcnt.h"
#include "tree-inline.h"
#include "ipa-utils.h"
diff --git a/gcc/ira-build.c b/gcc/ira-build.c
index e53bb813f37..e30633d10d4 100644
--- a/gcc/ira-build.c
+++ b/gcc/ira-build.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "memmodel.h"
#include "ira.h"
#include "ira-int.h"
-#include "params.h"
#include "sparseset.h"
#include "cfgloop.h"
diff --git a/gcc/ira-conflicts.c b/gcc/ira-conflicts.c
index 8e7c0c41f2f..a6b82bc1be0 100644
--- a/gcc/ira-conflicts.c
+++ b/gcc/ira-conflicts.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "regs.h"
#include "ira.h"
#include "ira-int.h"
-#include "params.h"
#include "sparseset.h"
#include "addresses.h"
diff --git a/gcc/loop-doloop.c b/gcc/loop-doloop.c
index 6a956a03b03..95b2c77507a 100644
--- a/gcc/loop-doloop.c
+++ b/gcc/loop-doloop.c
@@ -32,7 +32,6 @@ along with GCC; see the file COPYING3. If not see
#include "expr.h"
#include "cfgloop.h"
#include "cfgrtl.h"
-#include "params.h"
#include "dumpfile.h"
#include "loop-unroll.h"
#include "regs.h"
diff --git a/gcc/loop-invariant.c b/gcc/loop-invariant.c
index d40ad37cced..5dbf505edb2 100644
--- a/gcc/loop-invariant.c
+++ b/gcc/loop-invariant.c
@@ -52,7 +52,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgrtl.h"
#include "cfgloop.h"
#include "expr.h"
-#include "params.h"
#include "rtl-iter.h"
#include "dumpfile.h"
diff --git a/gcc/loop-unroll.c b/gcc/loop-unroll.c
index 551405ad0d1..6b24400b02b 100644
--- a/gcc/loop-unroll.c
+++ b/gcc/loop-unroll.c
@@ -32,7 +32,6 @@ along with GCC; see the file COPYING3. If not see
#include "profile.h"
#include "cfgrtl.h"
#include "cfgloop.h"
-#include "params.h"
#include "dojump.h"
#include "expr.h"
#include "dumpfile.h"
diff --git a/gcc/lra-assigns.c b/gcc/lra-assigns.c
index 56ab9631089..ca51be7a68e 100644
--- a/gcc/lra-assigns.c
+++ b/gcc/lra-assigns.c
@@ -91,7 +91,6 @@ along with GCC; see the file COPYING3. If not see
#include "recog.h"
#include "rtl-error.h"
#include "sparseset.h"
-#include "params.h"
#include "lra.h"
#include "lra-int.h"
#include "function-abi.h"
diff --git a/gcc/lra-constraints.c b/gcc/lra-constraints.c
index ced7be79017..54b5ae5cffe 100644
--- a/gcc/lra-constraints.c
+++ b/gcc/lra-constraints.c
@@ -127,7 +127,6 @@
#include "expr.h"
#include "cfgrtl.h"
#include "rtl-error.h"
-#include "params.h"
#include "lra.h"
#include "lra-int.h"
#include "print-rtl.h"
diff --git a/gcc/lto/lto-common.c b/gcc/lto/lto-common.c
index eb4ceeacf3e..76a9d9383d5 100644
--- a/gcc/lto/lto-common.c
+++ b/gcc/lto/lto-common.c
@@ -47,7 +47,6 @@ along with GCC; see the file COPYING3. If not see
#include "context.h"
#include "pass_manager.h"
#include "ipa-fnsummary.h"
-#include "params.h"
#include "ipa-utils.h"
#include "gomp-constants.h"
#include "lto-symtab.h"
diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c
index 5354350378b..75cfdaabf42 100644
--- a/gcc/lto/lto-partition.c
+++ b/gcc/lto/lto-partition.c
@@ -29,7 +29,6 @@ along with GCC; see the file COPYING3. If not see
#include "stringpool.h"
#include "cgraph.h"
#include "lto-streamer.h"
-#include "params.h"
#include "symbol-summary.h"
#include "tree-vrp.h"
#include "ipa-prop.h"
diff --git a/gcc/lto/lto.c b/gcc/lto/lto.c
index ef0923c7791..7b798d84df8 100644
--- a/gcc/lto/lto.c
+++ b/gcc/lto/lto.c
@@ -46,7 +46,6 @@ along with GCC; see the file COPYING3. If not see
#include "context.h"
#include "pass_manager.h"
#include "ipa-fnsummary.h"
-#include "params.h"
#include "ipa-utils.h"
#include "gomp-constants.h"
#include "lto-symtab.h"
diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c
index 3127fb1481e..98af5498a99 100644
--- a/gcc/modulo-sched.c
+++ b/gcc/modulo-sched.c
@@ -39,7 +39,6 @@ along with GCC; see the file COPYING3. If not see
#include "sched-int.h"
#include "cfgloop.h"
#include "expr.h"
-#include "params.h"
#include "ddg.h"
#include "tree-pass.h"
#include "dbgcnt.h"
diff --git a/gcc/opt-suggestions.c b/gcc/opt-suggestions.c
index 1ec94203c81..609e60bd20a 100644
--- a/gcc/opt-suggestions.c
+++ b/gcc/opt-suggestions.c
@@ -23,7 +23,6 @@ along with GCC; see the file COPYING3. If not see
#include "coretypes.h"
#include "tm.h"
#include "opts.h"
-#include "params.h"
#include "spellcheck.h"
#include "opt-suggestions.h"
#include "common/common-target.h"
diff --git a/gcc/opts.c b/gcc/opts.c
index a47517df80e..f9c6f20c025 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -25,7 +25,6 @@ along with GCC; see the file COPYING3. If not see
#include "opts.h"
#include "tm.h"
#include "flags.h"
-#include "params.h"
#include "diagnostic.h"
#include "opts-diagnostic.h"
#include "insn-attr-common.h"
diff --git a/gcc/params-enum.h b/gcc/params-enum.h
deleted file mode 100644
index 343355047be..00000000000
--- a/gcc/params-enum.h
+++ /dev/null
@@ -1,39 +0,0 @@
-/* params-enums.h - Run-time parameter enums.
- Copyright (C) 2015-2019 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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#define DEFPARAM(ENUM, OPTION, HELP, DEFAULT, MIN, MAX)
-#define DEFPARAMENUMNAME(ENUM) ENUM ## _KIND
-#define DEFPARAMENUMVAL(ENUM, V) ENUM ## _KIND_ ## V
-#define DEFPARAMENUMTERM(ENUM) ENUM ## _KIND_ ## LAST
-#define DEFPARAMENUM5(ENUM, OPTION, HELP, DEFAULT, V0, V1, V2, V3, V4) \
- enum DEFPARAMENUMNAME (ENUM) \
- { \
- DEFPARAMENUMVAL (ENUM, V0), \
- DEFPARAMENUMVAL (ENUM, V1), \
- DEFPARAMENUMVAL (ENUM, V2), \
- DEFPARAMENUMVAL (ENUM, V3), \
- DEFPARAMENUMVAL (ENUM, V4), \
- DEFPARAMENUMTERM (ENUM) \
- };
-#include "params.def"
-#undef DEFPARAMENUM5
-#undef DEFPARAMENUMTERM
-#undef DEFPARAMENUMVAL
-#undef DEFPARAMENUMNAME
-#undef DEFPARAM
diff --git a/gcc/params-list.h b/gcc/params-list.h
deleted file mode 100644
index 6c0fbc7b1b0..00000000000
--- a/gcc/params-list.h
+++ /dev/null
@@ -1,26 +0,0 @@
-/* File used to generate params.list
- Copyright (C) 2015-2019 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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#define DEFPARAM(enumerator, option, nocmsgid, default, min, max) \
- enumerator,
-#define DEFPARAMENUM5(enumerator, option, nocmsgid, default, \
- v0, v1, v2, v3, v4) enumerator,
-#include "params.def"
-#undef DEFPARAM
-#undef DEFPARAMENUM5
diff --git a/gcc/params-options.h b/gcc/params-options.h
deleted file mode 100644
index d2cb13dd0bb..00000000000
--- a/gcc/params-options.h
+++ /dev/null
@@ -1,27 +0,0 @@
-/* File used to generate params.list
- Copyright (C) 2015-2019 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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#define DEFPARAM(enumerator, option, nocmsgid, default, min, max) \
- option=default,min,max
-#define DEFPARAMENUM5(enumerator, option, nocmsgid, default, \
- v0, v1, v2, v3, v4) \
- option=v0,v1,v2,v3,v4
-#include "params.def"
-#undef DEFPARAM
-#undef DEFPARAMENUM5
diff --git a/gcc/params.c b/gcc/params.c
deleted file mode 100644
index 8d5e58f3145..00000000000
--- a/gcc/params.c
+++ /dev/null
@@ -1,302 +0,0 @@
-/* params.c - Run-time parameters.
- Copyright (C) 2001-2019 Free Software Foundation, Inc.
- Written by Mark Mitchell <mark@codesourcery.com>.
-
-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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "common/common-target.h"
-#include "params.h"
-#include "params-enum.h"
-#include "diagnostic-core.h"
-#include "diagnostic.h"
-#include "spellcheck.h"
-
-/* An array containing the compiler parameters and their current
- values. */
-
-param_info *compiler_params;
-
-/* The number of entries in the table. */
-static size_t num_compiler_params;
-
-/* Whether the parameters have all been initialized and had their
- default values determined. */
-static bool params_finished;
-
-#define DEFPARAM(ENUM, OPTION, HELP, DEFAULT, MIN, MAX)
-#define DEFPARAMENUM5(ENUM, OPTION, HELP, DEFAULT, V0, V1, V2, V3, V4) \
- static const char *values_ ## ENUM [] = { #V0, #V1, #V2, #V3, #V4, NULL };
-#include "params.def"
-#undef DEFPARAMENUM5
-#undef DEFPARAM
-
-static const param_info lang_independent_params[] = {
-#define DEFPARAM(ENUM, OPTION, HELP, DEFAULT, MIN, MAX) \
- { OPTION, DEFAULT, MIN, MAX, HELP, NULL },
-#define DEFPARAMENUM5(ENUM, OPTION, HELP, DEFAULT, \
- V0, V1, V2, V3, V4) \
- { OPTION, (int)ENUM ## _KIND_ ## DEFAULT, 0, 4, HELP, values_ ## ENUM },
-#include "params.def"
-#undef DEFPARAM
-#undef DEFPARAMENUM5
- { NULL, 0, 0, 0, NULL, NULL }
-};
-
-static bool
-validate_param (const int value, const param_info param, const int index);
-
-
-/* Add the N PARAMS to the current list of compiler parameters. */
-
-void
-add_params (const param_info params[], size_t n)
-{
- gcc_assert (!params_finished);
-
- /* Allocate enough space for the new parameters. */
- compiler_params = XRESIZEVEC (param_info, compiler_params,
- num_compiler_params + n);
- param_info *dst_params = compiler_params + num_compiler_params;
-
- /* Copy them into the table. */
- memcpy (dst_params, params, n * sizeof (param_info));
-
- /* Keep track of how many parameters we have. */
- num_compiler_params += n;
-
- /* Initialize the pretty printing machinery in case we need to print an error,
- but be sure not to initialize it if something else already has, e.g. a
- language front-end like cc1. */
- if (!diagnostic_ready_p ())
- diagnostic_initialize (global_dc, 0);
-
- /* Now perform some validation and validation failures trigger an error so
- initialization will stop. */
- for (size_t i = num_compiler_params - n; i < n; i++)
- validate_param (params[i].default_value, params[i], (int)i);
-}
-
-/* Add all parameters and default values that can be set in both the
- driver and the compiler proper. */
-
-void
-global_init_params (void)
-{
- gcc_assert (!params_finished);
-
- add_params (lang_independent_params, LAST_PARAM);
- targetm_common.option_default_params ();
-}
-
-/* Note that all parameters have been added and all default values
- set. */
-
-void
-finish_params (void)
-{
- params_finished = true;
-}
-
-/* Reset all state within params.c so that we can rerun the compiler
- within the same process. For use by toplev::finalize. */
-
-void
-params_c_finalize (void)
-{
- XDELETEVEC (compiler_params);
- compiler_params = NULL;
- num_compiler_params = 0;
- params_finished = false;
-}
-
-/* Set the value of the parameter given by NUM to VALUE in PARAMS and
- PARAMS_SET. If EXPLICIT_P, this is being set by the user;
- otherwise it is being set implicitly by the compiler. */
-
-static void
-set_param_value_internal (compiler_param num, int value,
- int *params, int *params_set,
- bool explicit_p)
-{
- size_t i = (size_t) num;
-
- gcc_assert (params_finished);
-
- params[i] = value;
- if (explicit_p)
- params_set[i] = true;
-}
-
-/* Validate PARAM and write an error if invalid. */
-
-static bool
-validate_param (const int value, const param_info param, const int index)
-{
- /* These paremeters interpret bounds of 0 to be unbounded, as such don't
- perform any range validation on 0 parameters. */
- if (value < param.min_value && param.min_value != 0)
- {
- error ("minimum value of parameter %qs is %u",
- param.option, param.min_value);
- return false;
- }
- else if (param.max_value > param.min_value && value > param.max_value)
- {
- error ("maximum value of parameter %qs is %u",
- param.option, param.max_value);
- return false;
- }
- else if (targetm_common.option_validate_param (value, index))
- return true;
-
- return false;
-}
-
-/* Return true if it can find the matching entry for NAME in the parameter
- table, and assign the entry index to INDEX. Return false otherwise. */
-
-bool
-find_param (const char *name, enum compiler_param *index)
-{
- for (size_t i = 0; i < num_compiler_params; ++i)
- if (strcmp (compiler_params[i].option, name) == 0)
- {
- *index = (enum compiler_param) i;
- return true;
- }
-
- return false;
-}
-
-/* Look for the closest match for NAME in the parameter table, returning it
- if it is a reasonable suggestion for a misspelling. Return NULL
- otherwise. */
-
-const char *
-find_param_fuzzy (const char *name)
-{
- best_match <const char *, const char *> bm (name);
- for (size_t i = 0; i < num_compiler_params; ++i)
- bm.consider (compiler_params[i].option);
- return bm.get_best_meaningful_candidate ();
-}
-
-/* Return true if param with entry index INDEX should be defined using strings.
- If so, return the value corresponding to VALUE_NAME in *VALUE_P. */
-
-bool
-param_string_value_p (enum compiler_param index, const char *value_name,
- int *value_p)
-{
- param_info *entry = &compiler_params[(int) index];
- if (entry->value_names == NULL)
- return false;
-
- *value_p = -1;
-
- for (int i = 0; entry->value_names[i] != NULL; ++i)
- if (strcmp (entry->value_names[i], value_name) == 0)
- {
- *value_p = i;
- return true;
- }
-
- return true;
-}
-
-/* Set the VALUE associated with the parameter given by NAME in PARAMS
- and PARAMS_SET. */
-
-void
-set_param_value (const char *name, int value,
- int *params, int *params_set)
-{
- size_t i;
-
- /* Make sure nobody tries to set a parameter to an invalid value. */
- gcc_assert (value != INVALID_PARAM_VAL);
-
- enum compiler_param index;
- if (!find_param (name, &index))
- {
- /* If we didn't find this parameter, issue an error message. */
- error ("invalid parameter %qs", name);
- return;
- }
- i = (size_t)index;
-
- if (validate_param (value, compiler_params[i], i))
- set_param_value_internal ((compiler_param) i, value,
- params, params_set, true);
-}
-
-/* Set the value of the parameter given by NUM to VALUE in PARAMS and
- PARAMS_SET, implicitly, if it has not been set explicitly by the
- user either via the commandline or configure. */
-
-void
-maybe_set_param_value (compiler_param num, int value,
- int *params, int *params_set)
-{
- if (!params_set[(int) num])
- set_param_value_internal (num, value, params, params_set, false);
-}
-
-/* Set the default value of a parameter given by NUM to VALUE, before
- option processing. */
-
-void
-set_default_param_value (compiler_param num, int value)
-{
- gcc_assert (!params_finished);
-
- compiler_params[(int) num].default_value = value;
-}
-
-/* Return the default value of parameter NUM. */
-
-int
-default_param_value (compiler_param num)
-{
- return compiler_params[(int) num].default_value;
-}
-
-/* Initialize an array PARAMS with default values of the
- parameters. */
-
-void
-init_param_values (int *params)
-{
- size_t i;
-
- gcc_assert (params_finished);
-
- for (i = 0; i < num_compiler_params; i++)
- params[i] = compiler_params[i].default_value;
-}
-
-/* Return the current value of num_compiler_params, for the benefit of
- plugins that use parameters as features. */
-
-size_t
-get_num_compiler_params (void)
-{
- return num_compiler_params;
-}
diff --git a/gcc/params.def b/gcc/params.def
deleted file mode 100644
index 942447d77e6..00000000000
--- a/gcc/params.def
+++ /dev/null
@@ -1,1495 +0,0 @@
-/* params.def - Run-time parameters.
- Copyright (C) 2001-2019 Free Software Foundation, Inc.
- Written by Mark Mitchell <mark@codesourcery.com>.
-
-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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-/* This file contains definitions for language-independent
- parameters. The DEFPARAM macro takes 6 arguments:
-
- - The enumeral corresponding to this parameter.
-
- - The name that can be used to set this parameter using the
- command-line option `--param <name>=<value>'.
-
- - A help string explaining how the parameter is used.
-
- - A default value for the parameter.
-
- - The minimum acceptable value for the parameter.
-
- - The maximum acceptable value for the parameter (if greater than
- the minimum).
-
- The DEFPARAMENUM<N> macro is similar, but instead of the minumum and maximum
- arguments, it contains a list of <N> allowed strings, corresponding to
- integer values 0..<N>-1. Note that the default argument needs to be
- specified as one of the allowed strings, rather than an integer value.
-
- Be sure to add an entry to invoke.texi summarizing the parameter. */
-
-/* When branch is predicted to be taken with probability lower than this
- threshold (in percent), then it is considered well predictable. */
-DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME,
- "predictable-branch-outcome",
- "Maximal estimated outcome of branch considered predictable.",
- 2, 0, 50)
-
-DEFPARAM (PARAM_INLINE_MIN_SPEEDUP,
- "inline-min-speedup",
- "The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto with -O3 and -Ofast.",
- 15, 0, 100)
-
-DEFPARAM (PARAM_INLINE_MIN_SPEEDUP_O2,
- "inline-min-speedup-O2",
- "The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto.",
- 30, 0, 100)
-
-/* The single function inlining limit. This is the maximum size
- of a function counted in internal gcc instructions (not in
- real machine instructions) that is eligible for inlining
- by the tree inliner.
- Only functions marked inline (or methods defined in the class
- definition for C++) are affected by this.
- There are more restrictions to inlining: If inlined functions
- call other functions, the already inlined instructions are
- counted and once the recursive inline limit (see
- "max-inline-insns" parameter) is exceeded, the acceptable size
- gets decreased. */
-DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE,
- "max-inline-insns-single",
- "The maximum number of instructions in a single function eligible for inlining with -O3 and -Ofast.",
- 200, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE_O2,
- "max-inline-insns-single-O2",
- "The maximum number of instructions in a single function eligible for inlining.",
- 30, 0, 0)
-
-/* The single function inlining limit for functions that are
- inlined by virtue of -finline-functions (-O3).
- This limit should be chosen to be below or equal to the limit
- that is applied to functions marked inlined (or defined in the
- class declaration in C++) given by the "max-inline-insns-single"
- parameter.
- The default value is 30. */
-DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO,
- "max-inline-insns-auto",
- "The maximum number of instructions when automatically inlining with -O3 and -Ofast.",
- 30, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO_O2,
- "max-inline-insns-auto-O2",
- "The maximum number of instructions when automatically inlining.",
- 15, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_SMALL,
- "max-inline-insns-small",
- "The maximum number of instructions when automatically inlining small functions.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_INLINE_HEURISTICS_HINT_PERCENT,
- "inline-heuristics-hint-percent",
- "The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable with -O3 and -Ofast.",
- 600, 100, 1000000)
-
-DEFPARAM (PARAM_INLINE_HEURISTICS_HINT_PERCENT_O2,
- "inline-heuristics-hint-percent-O2",
- "The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable.",
- 200, 100, 1000000)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_SIZE,
- "max-inline-insns-size",
- "The maximum number of instructions when inlining for size.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_UNINLINED_FUNCTION_INSNS,
- "uninlined-function-insns",
- "Instruction accounted for function prologue, epilogue and other"
- " overhead.",
- 2, 0, 1000000)
-
-DEFPARAM (PARAM_UNINLINED_FUNCTION_TIME,
- "uninlined-function-time",
- "Time accounted for function prologue, epilogue and other"
- " overhead.",
- 0, 0, 1000000)
-
-DEFPARAM (PARAM_UNINLINED_FUNCTION_THUNK_INSNS,
- "uninlined-thunk-insns",
- "Instruction accounted for function thunk overhead.",
- 2, 0, 1000000)
-
-DEFPARAM (PARAM_UNINLINED_FUNCTION_THUNK_TIME,
- "uninlined-thunk-time",
- "Time accounted for function thunk overhead.",
- 2, 0, 1000000)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE,
- "max-inline-insns-recursive",
- "The maximum number of instructions inline function can grow to via recursive inlining.",
- 450, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO,
- "max-inline-insns-recursive-auto",
- "The maximum number of instructions non-inline function can grow to via recursive inlining.",
- 450, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH,
- "max-inline-recursive-depth",
- "The maximum depth of recursive inlining for inline functions.",
- 8, 0, 0)
-
-DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO,
- "max-inline-recursive-depth-auto",
- "The maximum depth of recursive inlining for non-inline functions.",
- 8, 0, 0)
-
-DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY,
- "min-inline-recursive-probability",
- "Inline recursively only when the probability of call being executed exceeds the parameter.",
- 10, 0, 0)
-
-/* Limit of iterations of early inliner. This basically bounds number of
- nested indirect calls early inliner can resolve. Deeper chains are still
- handled by late inlining. */
-DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS,
- "max-early-inliner-iterations",
- "The maximum number of nested indirect inlining performed by early inliner.",
- 1, 0, 0)
-
-/* Limit on probability of entry BB. */
-DEFPARAM (PARAM_COMDAT_SHARING_PROBABILITY,
- "comdat-sharing-probability",
- "Probability that COMDAT function will be shared with different compilation unit.",
- 20, 0, 0)
-
-/* Limit on probability of entry BB. */
-DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY,
- "partial-inlining-entry-probability",
- "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen.",
- 70, 0, 100)
-
-/* Limit the number of expansions created by the variable expansion
- optimization to avoid register pressure. */
-DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS,
- "max-variable-expansions-in-unroller",
- "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling.",
- 1, 0, 0)
-
-/* Limit loop autovectorization to loops with large enough iteration count. */
-DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND,
- "min-vect-loop-bound",
- "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization.",
- 0, 0, 0)
-
-/* The maximum number of instructions to consider when looking for an
- instruction to fill a delay slot. If more than this arbitrary
- number of instructions is searched, the time savings from filling
- the delay slot will be minimal so stop searching. Increasing
- values mean more aggressive optimization, making the compile time
- increase with probably small improvement in executable run time. */
-DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH,
- "max-delay-slot-insn-search",
- "The maximum number of instructions to consider to fill a delay slot.",
- 100, 0, 0)
-
-/* When trying to fill delay slots, the maximum number of instructions
- to consider when searching for a block with valid live register
- information. Increasing this arbitrarily chosen value means more
- aggressive optimization, increasing the compile time. This
- parameter should be removed when the delay slot code is rewritten
- to maintain the control-flow graph. */
-DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
- "max-delay-slot-live-search",
- "The maximum number of instructions to consider to find accurate live register information.",
- 333, 0, 0)
-
-/* This parameter limits the number of branch elements that the
- scheduler will track anti-dependencies through without resetting
- the tracking mechanism. Large functions with few calls or barriers
- can generate lists containing many 1000's of dependencies. Generally
- the compiler either uses all available memory, or runs for far too long. */
-DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
- "max-pending-list-length",
- "The maximum length of scheduling's pending operations list.",
- 32, 0, 0)
-
-/* This parameter limits the number of backtracking attempts when using the
- haifa scheduler for modulo scheduling. */
-DEFPARAM(PARAM_MAX_MODULO_BACKTRACK_ATTEMPTS,
- "max-modulo-backtrack-attempts",
- "The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop.",
- 40, 0, 0)
-
-DEFPARAM(PARAM_LARGE_FUNCTION_INSNS,
- "large-function-insns",
- "The size of function body to be considered large.",
- 2700, 0, 0)
-DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH,
- "large-function-growth",
- "Maximal growth due to inlining of large function (in percent).",
- 100, 0, 0)
-DEFPARAM(PARAM_LARGE_UNIT_INSNS,
- "large-unit-insns",
- "The size of translation unit to be considered large.",
- 10000, 0, 0)
-DEFPARAM(PARAM_INLINE_UNIT_GROWTH,
- "inline-unit-growth",
- "How much can given compilation unit grow because of the inlining (in percent).",
- 40, 0, 0)
-DEFPARAM(PARAM_IPCP_UNIT_GROWTH,
- "ipcp-unit-growth",
- "How much can given compilation unit grow because of the interprocedural constant propagation (in percent).",
- 10, 0, 0)
-DEFPARAM(PARAM_EARLY_INLINING_INSNS,
- "early-inlining-insns",
- "Maximal estimated growth of function body caused by early inlining of single call with -O3 and -Ofast.",
- 14, 0, 0)
-DEFPARAM(PARAM_EARLY_INLINING_INSNS_O2,
- "early-inlining-insns-O2",
- "Maximal estimated growth of function body caused by early inlining of single call with -O1 and -O2.",
- 6, 0, 0)
-DEFPARAM(PARAM_LARGE_STACK_FRAME,
- "large-stack-frame",
- "The size of stack frame to be considered large.",
- 256, 0, 0)
-DEFPARAM(PARAM_STACK_FRAME_GROWTH,
- "large-stack-frame-growth",
- "Maximal stack frame growth due to inlining (in percent).",
- 1000, 0, 0)
-
-/* Keep these up to date with those in configure.ac. */
-DEFPARAM(PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE,
- "stack-clash-protection-guard-size",
- "Size of the stack guard expressed as a power of two in bytes.",
- 12, 12, 30)
-
-DEFPARAM(PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL,
- "stack-clash-protection-probe-interval",
- "Interval in which to probe the stack expressed as a power of two in bytes.",
- 12, 10, 16)
-
-/* The GCSE optimization will be disabled if it would require
- significantly more memory than this value. */
-DEFPARAM(PARAM_MAX_GCSE_MEMORY,
- "max-gcse-memory",
- "The maximum amount of memory to be allocated by GCSE.",
- 128 * 1024 * 1024, 0, 0)
-
-/* The GCSE optimization of an expression will avoided if the ratio of
- insertions to deletions is greater than this value. */
-DEFPARAM(PARAM_MAX_GCSE_INSERTION_RATIO,
- "max-gcse-insertion-ratio",
- "The maximum ratio of insertions to deletions of expressions in GCSE.",
- 20, 0, 0)
-
-/* This is the threshold ratio when to perform partial redundancy
- elimination after reload. We perform partial redundancy elimination
- when the following holds:
- (Redundant load execution count)
- ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION
- (Added loads execution count) */
-DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION,
- "gcse-after-reload-partial-fraction",
- "The threshold ratio for performing partial redundancy elimination after reload.",
- 3, 0, 0)
-/* This is the threshold ratio of the critical edges execution count compared to
- the redundant loads execution count that permits performing the load
- redundancy elimination in gcse after reload. */
-DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
- "gcse-after-reload-critical-fraction",
- "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload.",
- 10, 0, 0)
-
-/* GCSE will use GCSE_COST_DISTANCE_RATION as a scaling factor
- to calculate maximum distance for which an expression is allowed to move
- from its rtx_cost. */
-DEFPARAM(PARAM_GCSE_COST_DISTANCE_RATIO,
- "gcse-cost-distance-ratio",
- "Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations.",
- 10, 0, 0)
-/* GCSE won't restrict distance for which an expression with rtx_cost greater
- than COSTS_N_INSN(GCSE_UNRESTRICTED_COST) is allowed to move. */
-DEFPARAM(PARAM_GCSE_UNRESTRICTED_COST,
- "gcse-unrestricted-cost",
- "Cost at which GCSE optimizations will not constraint the distance an expression can travel.",
- 3, 0, 0)
-
-/* How deep from a given basic block the dominator tree should be searched
- for expressions to hoist to the block. The value of 0 will avoid limiting
- the search. */
-DEFPARAM(PARAM_MAX_HOIST_DEPTH,
- "max-hoist-depth",
- "Maximum depth of search in the dominator tree for expressions to hoist.",
- 30, 0, 0)
-
-
-/* When synthesizing expnonentiation by a real constant operations using square
- roots, this controls how deep sqrt chains we are willing to generate. */
-DEFPARAM(PARAM_MAX_POW_SQRT_DEPTH,
- "max-pow-sqrt-depth",
- "Maximum depth of sqrt chains to use when synthesizing exponentiation by a real constant.",
- 5, 1, 32)
-
-/* This parameter limits the number of insns in a loop that will be unrolled,
- and by how much the loop is unrolled.
-
- This limit should be at most half of the peeling limits: loop unroller
- decides to not unroll loops that iterate fewer than 2*number of allowed
- unrollings and thus we would have loops that are neither peeled or unrolled
- otherwise. */
-DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
- "max-unrolled-insns",
- "The maximum number of instructions to consider to unroll in a loop.",
- 200, 0, 0)
-/* This parameter limits how many times the loop is unrolled depending
- on number of insns really executed in each iteration. */
-DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS,
- "max-average-unrolled-insns",
- "The maximum number of instructions to consider to unroll in a loop on average.",
- 80, 0, 0)
-/* The maximum number of unrollings of a single loop. */
-DEFPARAM(PARAM_MAX_UNROLL_TIMES,
- "max-unroll-times",
- "The maximum number of unrollings of a single loop.",
- 8, 0, 0)
-/* The maximum number of insns of a peeled loop. */
-DEFPARAM(PARAM_MAX_PEELED_INSNS,
- "max-peeled-insns",
- "The maximum number of insns of a peeled loop.",
- 100, 0, 0)
-/* The maximum number of peelings of a single loop. */
-DEFPARAM(PARAM_MAX_PEEL_TIMES,
- "max-peel-times",
- "The maximum number of peelings of a single loop.",
- 16, 0, 0)
-/* The maximum number of peelings of a single loop that is peeled completely. */
-DEFPARAM(PARAM_MAX_PEEL_BRANCHES,
- "max-peel-branches",
- "The maximum number of branches on the path through the peeled sequence.",
- 32, 0, 0)
-/* The maximum number of insns of a peeled loop. */
-DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS,
- "max-completely-peeled-insns",
- "The maximum number of insns of a completely peeled loop.",
- 200, 0, 0)
-/* The maximum number of peelings of a single loop that is peeled completely. */
-DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES,
- "max-completely-peel-times",
- "The maximum number of peelings of a single loop that is peeled completely.",
- 16, 0, 0)
-/* The maximum number of insns of a peeled loop that rolls only once. */
-DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS,
- "max-once-peeled-insns",
- "The maximum number of insns of a peeled loop that rolls only once.",
- 400, 0, 0)
-/* The maximum depth of a loop nest we completely peel. */
-DEFPARAM(PARAM_MAX_UNROLL_ITERATIONS,
- "max-completely-peel-loop-nest-depth",
- "The maximum depth of a loop nest we completely peel.",
- 8, 0, 0)
-
-/* The maximum number of insns of an unswitched loop. */
-DEFPARAM(PARAM_MAX_UNSWITCH_INSNS,
- "max-unswitch-insns",
- "The maximum number of insns of an unswitched loop.",
- 50, 0, 0)
-/* The maximum level of recursion in unswitch_single_loop. */
-DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
- "max-unswitch-level",
- "The maximum number of unswitchings in a single loop.",
- 3, 0, 0)
-
-/* The maximum number of insns in loop header duplicated by the copy loop
- headers pass. */
-DEFPARAM(PARAM_MAX_LOOP_HEADER_INSNS,
- "max-loop-header-insns",
- "The maximum number of insns in loop header duplicated by the copy loop headers pass.",
- 20, 0, 0)
-
-/* The maximum number of iterations of a loop the brute force algorithm
- for analysis of # of iterations of the loop tries to evaluate. */
-DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
- "max-iterations-to-track",
- "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates.",
- 1000, 0, 0)
-/* A cutoff to avoid costly computations of the number of iterations in
- the doloop transformation. */
-DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST,
- "max-iterations-computation-cost",
- "Bound on the cost of an expression to compute the number of iterations.",
- 10, 0, 0)
-
-/* This parameter is used to tune SMS MAX II calculations. */
-DEFPARAM(PARAM_SMS_MAX_II_FACTOR,
- "sms-max-ii-factor",
- "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop.",
- 100, 0, 0)
-/* The minimum value of stage count that swing modulo scheduler will generate. */
-DEFPARAM(PARAM_SMS_MIN_SC,
- "sms-min-sc",
- "The minimum value of stage count that swing modulo scheduler will generate.",
- 2, 1, 1)
-DEFPARAM(PARAM_SMS_DFA_HISTORY,
- "sms-dfa-history",
- "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA.",
- 0, 0, 0)
-DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD,
- "sms-loop-average-count-threshold",
- "A threshold on the average loop count considered by the swing modulo scheduler.",
- 0, 0, 0)
-
-DEFPARAM(HOT_BB_COUNT_FRACTION,
- "hot-bb-count-fraction",
- "The denominator n of fraction 1/n of the maximal execution count of "
- "a basic block in the entire program that a basic block needs to at "
- "least have in order to be considered hot (used in non-LTO mode).",
- 10000, 0, 0)
-
-DEFPARAM(HOT_BB_COUNT_WS_PERMILLE,
- "hot-bb-count-ws-permille",
- "The number of most executed permilles of the profiled execution of "
- "the entire program to which the execution count of a basic block "
- "must be part of in order to be considered hot (used in LTO mode).",
- 990, 0, 1000)
-
-DEFPARAM(HOT_BB_FREQUENCY_FRACTION,
- "hot-bb-frequency-fraction",
- "The denominator n of fraction 1/n of the execution frequency of the "
- "entry block of a function that a basic block of this function needs "
- "to at least have in order to be considered hot.",
- 1000, 0, 0)
-
-DEFPARAM(UNLIKELY_BB_COUNT_FRACTION,
- "unlikely-bb-count-fraction",
- "The denominator n of fraction 1/n of the number of profiled runs of "
- "the entire program below which the execution count of a basic block "
- "must be in order for the basic block to be considered unlikely.",
- 20, 0, 0)
-
-DEFPARAM (PARAM_ALIGN_THRESHOLD,
- "align-threshold",
- "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment.",
- 100, 1, 0)
-
-DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS,
- "align-loop-iterations",
- "Loops iterating at least selected number of iterations will get "
- "loop alignment.", 4, 0, 0)
-
-/* For guessed profiles, the loops having unknown number of iterations
- are predicted to iterate relatively few (10) times at average.
- For functions containing one loop with large known number of iterations
- and other loops having unbounded loops we would end up predicting all
- the other loops cold that is not usually the case. So we need to artificially
- flatten the profile.
-
- We need to cut the maximal predicted iterations to large enough iterations
- so the loop appears important, but safely within maximum hotness
- range. */
-
-DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS,
- "max-predicted-iterations",
- "The maximum number of loop iterations we predict statically.",
- 100, 0, 0)
-
-/* This parameter controls the probability of builtin_expect. The default
- value is 90%. This empirical value is obtained through the weighted
- probability of FDO counters (with the FDO count value as the weight)
- in some real world programs:
- (1) Google performance test benchmarks: the probability is 0.9081.
- (2) Linux 3.3 kernel running Google search workload: the probability
- is 0.8717. */
-
-DEFPARAM(BUILTIN_EXPECT_PROBABILITY,
- "builtin-expect-probability",
- "Set the estimated probability in percentage for builtin expect. The default value is 90% probability.",
- 90, 0, 100)
-DEFPARAM(BUILTIN_STRING_CMP_INLINE_LENGTH,
- "builtin-string-cmp-inline-length",
- "The maximum length of a constant string for a builtin string cmp call eligible for inlining. The default value is 3.",
- 3, 0, 100)
-DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK,
- "tracer-dynamic-coverage-feedback",
- "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available.",
- 95, 0, 100)
-DEFPARAM(TRACER_DYNAMIC_COVERAGE,
- "tracer-dynamic-coverage",
- "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available.",
- 75, 0, 100)
-DEFPARAM(TRACER_MAX_CODE_GROWTH,
- "tracer-max-code-growth",
- "Maximal code growth caused by tail duplication (in percent).",
- 100, 0, 0)
-DEFPARAM(TRACER_MIN_BRANCH_RATIO,
- "tracer-min-branch-ratio",
- "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent).",
- 10, 0, 100)
-DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK,
- "tracer-min-branch-probability-feedback",
- "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available.",
- 80, 0, 100)
-DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY,
- "tracer-min-branch-probability",
- "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available.",
- 50, 0, 100)
-
-/* The maximum number of incoming edges to consider for crossjumping. */
-DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES,
- "max-crossjump-edges",
- "The maximum number of incoming edges to consider for crossjumping.",
- 100, 0, 0)
-
-/* The minimum number of matching instructions to consider for crossjumping. */
-DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS,
- "min-crossjump-insns",
- "The minimum number of matching instructions to consider for crossjumping.",
- 5, 1, 0)
-
-/* The maximum number expansion factor when copying basic blocks. */
-DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS,
- "max-grow-copy-bb-insns",
- "The maximum expansion factor when copying basic blocks.",
- 8, 0, 0)
-
-/* The maximum number of insns to duplicate when unfactoring computed gotos. */
-DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS,
- "max-goto-duplication-insns",
- "The maximum number of insns to duplicate when unfactoring computed gotos.",
- 8, 0, 0)
-
-/* The maximum length of path considered in cse. */
-DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH,
- "max-cse-path-length",
- "The maximum length of path considered in cse.",
- 10, 1, 0)
-DEFPARAM(PARAM_MAX_CSE_INSNS,
- "max-cse-insns",
- "The maximum instructions CSE process before flushing.",
- 1000, 0, 0)
-
-/* The cost of expression in loop invariant motion that is considered
- expensive. */
-DEFPARAM(PARAM_LIM_EXPENSIVE,
- "lim-expensive",
- "The minimum cost of an expensive expression in the loop invariant motion.",
- 20, 0, 0)
-
-/* Bound on number of candidates for induction variables below that
- all candidates are considered for each use in induction variable
- optimizations. */
-
-DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND,
- "iv-consider-all-candidates-bound",
- "Bound on number of candidates below that all candidates are considered in iv optimizations.",
- 40, 0, 0)
-
-/* The induction variable optimizations give up on loops that contain more
- induction variable uses. */
-
-DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES,
- "iv-max-considered-uses",
- "Bound on number of iv uses in loop optimized in iv optimizations.",
- 250, 0, 0)
-
-/* If there are at most this number of ivs in the set, try removing unnecessary
- ivs from the set always. */
-
-DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND,
- "iv-always-prune-cand-set-bound",
- "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization.",
- 10, 0, 0)
-
-DEFPARAM(PARAM_AVG_LOOP_NITER,
- "avg-loop-niter",
- "Average number of iterations of a loop.",
- 10, 1, 0)
-
-DEFPARAM(PARAM_DSE_MAX_OBJECT_SIZE,
- "dse-max-object-size",
- "Maximum size (in bytes) of objects tracked bytewise by dead store elimination.",
- 256, 0, 0)
-
-DEFPARAM(PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE,
- "dse-max-alias-queries-per-store",
- "Maximum number of queries into the alias oracle per store.",
- 256, 0, 0)
-
-DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE,
- "scev-max-expr-size",
- "Bound on size of expressions used in the scalar evolutions analyzer.",
- 100, 0, 0)
-
-DEFPARAM(PARAM_SCEV_MAX_EXPR_COMPLEXITY,
- "scev-max-expr-complexity",
- "Bound on the complexity of the expressions in the scalar evolutions analyzer.",
- 10, 0, 0)
-
-DEFPARAM (PARAM_MAX_TREE_IF_CONVERSION_PHI_ARGS,
- "max-tree-if-conversion-phi-args",
- "Maximum number of arguments in a PHI supported by TREE if-conversion "
- "unless the loop is marked with simd pragma.",
- 4, 2, 0)
-
-DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS,
- "vect-max-version-for-alignment-checks",
- "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check.",
- 6, 0, 0)
-
-DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS,
- "vect-max-version-for-alias-checks",
- "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check.",
- 10, 0, 0)
-
-DEFPARAM(PARAM_VECT_MAX_PEELING_FOR_ALIGNMENT,
- "vect-max-peeling-for-alignment",
- "Maximum number of loop peels to enhance alignment of data references in a loop.",
- -1, -1, 64)
-
-DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS,
- "max-cselib-memory-locations",
- "The maximum memory locations recorded by cselib.",
- 500, 0, 0)
-
-#ifdef ENABLE_GC_ALWAYS_COLLECT
-# define GGC_MIN_EXPAND_DEFAULT 0
-# define GGC_MIN_HEAPSIZE_DEFAULT 0
-#else
-# define GGC_MIN_EXPAND_DEFAULT 30
-# define GGC_MIN_HEAPSIZE_DEFAULT 4096
-#endif
-
-DEFPARAM(GGC_MIN_EXPAND,
- "ggc-min-expand",
- "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap.",
- GGC_MIN_EXPAND_DEFAULT, 0, 0)
-
-DEFPARAM(GGC_MIN_HEAPSIZE,
- "ggc-min-heapsize",
- "Minimum heap size before we start collecting garbage, in kilobytes.",
- GGC_MIN_HEAPSIZE_DEFAULT, 0, 0)
-
-#undef GGC_MIN_EXPAND_DEFAULT
-#undef GGC_MIN_HEAPSIZE_DEFAULT
-
-DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS,
- "max-reload-search-insns",
- "The maximum number of instructions to search backward when looking for equivalent reload.",
- 100, 0, 0)
-
-DEFPARAM(PARAM_SINK_FREQUENCY_THRESHOLD,
- "sink-frequency-threshold",
- "Target block's relative execution frequency (as a percentage) required to sink a statement.",
- 75, 0, 100)
-
-DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS,
- "max-sched-region-blocks",
- "The maximum number of blocks in a region to be considered for interblock scheduling.",
- 10, 0, 0)
-
-DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS,
- "max-sched-region-insns",
- "The maximum number of insns in a region to be considered for interblock scheduling.",
- 100, 0, 0)
-
-DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS,
- "max-pipeline-region-blocks",
- "The maximum number of blocks in a region to be considered for interblock scheduling.",
- 15, 0, 0)
-
-DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS,
- "max-pipeline-region-insns",
- "The maximum number of insns in a region to be considered for interblock scheduling.",
- 200, 0, 0)
-
-DEFPARAM(PARAM_MIN_SPEC_PROB,
- "min-spec-prob",
- "The minimum probability of reaching a source block for interblock speculative scheduling.",
- 40, 0, 0)
-
-DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS,
- "max-sched-extend-regions-iters",
- "The maximum number of iterations through CFG to extend regions.",
- 0, 0, 0)
-
-DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY,
- "max-sched-insn-conflict-delay",
- "The maximum conflict delay for an insn to be considered for speculative motion.",
- 3, 1, 10)
-
-DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF,
- "sched-spec-prob-cutoff",
- "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.",
- 40, 0, 100)
-
-DEFPARAM(PARAM_SCHED_STATE_EDGE_PROB_CUTOFF,
- "sched-state-edge-prob-cutoff",
- "The minimum probability an edge must have for the scheduler to save its state across it.",
- 10, 0, 100)
-
-DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD,
- "selsched-max-lookahead",
- "The maximum size of the lookahead window of selective scheduling.",
- 50, 0, 0)
-
-DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
- "selsched-max-sched-times",
- "Maximum number of times that an insn could be scheduled.",
- 2, 1, 0)
-
-DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
- "selsched-insns-to-rename",
- "Maximum number of instructions in the ready list that are considered eligible for renaming.",
- 2, 0, 0)
-
-DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST,
- "sched-mem-true-dep-cost",
- "Minimal distance between possibly conflicting store and load.",
- 1, 0, 0)
-
-DEFPARAM (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH,
- "sched-autopref-queue-depth",
- "Hardware autoprefetcher scheduler model control flag. Number of lookahead cycles the model looks into; at '0' only enable instruction sorting heuristic. Disabled by default.",
- -1, 0, 0)
-
-DEFPARAM(PARAM_MAX_LAST_VALUE_RTL,
- "max-last-value-rtl",
- "The maximum number of RTL nodes that can be recorded as combiner's last value.",
- 10000, 0, 0)
-
-DEFPARAM(PARAM_MAX_COMBINE_INSNS,
- "max-combine-insns",
- "The maximum number of insns combine tries to combine.",
- 4, 2, 4)
-
-/* INTEGER_CST nodes are shared for values [{-1,0} .. N) for
- {signed,unsigned} integral types. This determines N.
- Experimentation shows 251 to be a good value that generates the
- least amount of garbage for allocating the TREE_VEC storage. */
-DEFPARAM (PARAM_INTEGER_SHARE_LIMIT,
- "integer-share-limit",
- "The upper bound for sharing integer constants.",
- 251, 2, 2)
-
-DEFPARAM (PARAM_SSP_BUFFER_SIZE,
- "ssp-buffer-size",
- "The lower bound for a buffer to be considered for stack smashing protection.",
- 8, 1, 0)
-
-DEFPARAM (PARAM_MIN_SIZE_FOR_STACK_SHARING,
- "min-size-for-stack-sharing",
- "The minimum size of variables taking part in stack slot sharing "
- "when not optimizing.",
- 32, 0, 0)
-
-/* When we thread through a block we have to make copies of the
- statements within the block. Clearly for large blocks the code
- duplication is bad.
-
- PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number
- of statements and PHI nodes allowed in a block which is going to
- be duplicated for thread jumping purposes.
-
- Some simple analysis showed that more than 99% of the jump
- threading opportunities are for blocks with less than 15
- statements. So we can get the benefits of jump threading
- without excessive code bloat for pathological cases with the
- throttle set at 15 statements. */
-DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS,
- "max-jump-thread-duplication-stmts",
- "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps.",
- 15, 0, 0)
-
-/* This is the maximum number of fields a variable may have before the pointer analysis machinery
- will stop trying to treat it in a field-sensitive manner.
- There are programs out there with thousands of fields per structure, and handling them
- field-sensitively is not worth the cost. */
-DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
- "max-fields-for-field-sensitive",
- "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable.",
- 0, 0, 0)
-
-DEFPARAM(PARAM_MAX_SCHED_READY_INSNS,
- "max-sched-ready-insns",
- "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass.",
- 100, 1, 0)
-
-/* This is the maximum number of active local stores RTL DSE will consider. */
-DEFPARAM (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES,
- "max-dse-active-local-stores",
- "Maximum number of active local stores in RTL dead store elimination.",
- 5000, 0, 0)
-
-/* Prefetching and cache-optimizations related parameters. Default values are
- usually set by machine description. */
-
-/* The number of insns executed before prefetch is completed. */
-
-DEFPARAM (PARAM_PREFETCH_LATENCY,
- "prefetch-latency",
- "The number of insns executed before prefetch is completed.",
- 200, 0, 0)
-
-/* The number of prefetches that can run at the same time. */
-
-DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES,
- "simultaneous-prefetches",
- "The number of prefetches that can run at the same time.",
- 3, 0, 0)
-
-/* The size of L1 cache in kB. */
-
-DEFPARAM (PARAM_L1_CACHE_SIZE,
- "l1-cache-size",
- "The size of L1 cache.",
- 64, 0, 0)
-
-/* The size of L1 cache line in bytes. */
-
-DEFPARAM (PARAM_L1_CACHE_LINE_SIZE,
- "l1-cache-line-size",
- "The size of L1 cache line.",
- 32, 0, 0)
-
-/* The size of L2 cache in kB. */
-
-DEFPARAM (PARAM_L2_CACHE_SIZE,
- "l2-cache-size",
- "The size of L2 cache.",
- 512, 0, 0)
-
-/* Whether software prefetch hints should be issued for non-constant
- strides. */
-
-DEFPARAM (PARAM_PREFETCH_DYNAMIC_STRIDES,
- "prefetch-dynamic-strides",
- "Whether software prefetch hints should be issued for non-constant "
- "strides.",
- 1, 0, 1)
-
-/* The minimum constant stride beyond which we should use prefetch hints
- for. */
-
-DEFPARAM (PARAM_PREFETCH_MINIMUM_STRIDE,
- "prefetch-minimum-stride",
- "The minimum constant stride beyond which we should use prefetch "
- "hints for.",
- -1, 0, 0)
-
-/* Maximum number of statements in loop nest for loop interchange. */
-
-DEFPARAM (PARAM_LOOP_INTERCHANGE_MAX_NUM_STMTS,
- "loop-interchange-max-num-stmts",
- "The maximum number of stmts in loop nest for loop interchange.",
- 64, 0, 0)
-
-/* Minimum stride ratio for loop interchange to be profitiable. */
-
-DEFPARAM (PARAM_LOOP_INTERCHANGE_STRIDE_RATIO,
- "loop-interchange-stride-ratio",
- "The minimum stride ratio for loop interchange to be profitable.",
- 2, 0, 0)
-
-/* Whether we should use canonical types rather than deep "structural"
- type checking. Setting this value to 1 (the default) improves
- compilation performance in the C++ and Objective-C++ front end;
- this value should only be set to zero to work around bugs in the
- canonical type system by disabling it. */
-
-DEFPARAM (PARAM_USE_CANONICAL_TYPES,
- "use-canonical-types",
- "Whether to use canonical types.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH,
- "max-partial-antic-length",
- "Maximum length of partial antic set when performing tree pre optimization.",
- 100, 0, 0)
-
-/* The following is used as a stop-gap limit for cases where really deep
- loop nests cause compile-time to blow up. If we hit this limit,
- FRE and PRE will value-number outer loops (but the outermost) in a
- loop nest non-optimistically. */
-
-DEFPARAM (PARAM_RPO_VN_MAX_LOOP_DEPTH,
- "rpo-vn-max-loop-depth",
- "Maximum depth of a loop nest to fully value-number optimistically.",
- 7, 2, 0)
-
-/* The following is used as a stop-gap limit for cases where really huge
- functions blow up compile-time use too much. It limits the number of
- alias-queries we do for finding common subexpressions for memory loads and
- stores. The number of alias-queries is otherwise limited by the number of
- stores on paths to function entry. */
-
-DEFPARAM (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS,
- "sccvn-max-alias-queries-per-access",
- "Maximum number of disambiguations to perform per memory access.",
- 1000, 0, 0)
-
-DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM,
- "ira-max-loops-num",
- "Max loops number for regional RA.",
- 100, 0, 0)
-
-DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE,
- "ira-max-conflict-table-size",
- "Max size of conflict table in MB.",
- 1000, 0, 0)
-
-DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS,
- "ira-loop-reserved-regs",
- "The number of registers in each class kept unused by loop invariant motion.",
- 2, 0, 0)
-
-DEFPARAM (PARAM_LRA_MAX_CONSIDERED_RELOAD_PSEUDOS,
- "lra-max-considered-reload-pseudos",
- "The max number of reload pseudos which are considered during spilling a non-reload pseudo.",
- 500, 0, 0)
-
-DEFPARAM (PARAM_LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF,
- "lra-inheritance-ebb-probability-cutoff",
- "Minimal fall-through edge probability in percentage used to add BB to inheritance EBB in LRA.",
- 40, 0, 100)
-
-/* Switch initialization conversion will refuse to create arrays that are
- bigger than this parameter times the number of switch branches. */
-
-DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO,
- "switch-conversion-max-branch-ratio",
- "The maximum ratio between array size and switch branches for "
- "a switch conversion to take place.",
- 8, 1, 0)
-
-/* Size of tiles when doing loop blocking. */
-
-DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE,
- "loop-block-tile-size",
- "Size of tiles for loop blocking.",
- 51, 0, 0)
-
-/* Maximal number of parameters that we allow in a SCoP. */
-
-DEFPARAM (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS,
- "graphite-max-nb-scop-params",
- "Maximum number of parameters in a SCoP.",
- 10, 0, 0)
-
-/* Maximal number of array references in a scop. */
-
-DEFPARAM (PARAM_GRAPHITE_MAX_ARRAYS_PER_SCOP,
- "graphite-max-arrays-per-scop",
- "Maximum number of arrays per SCoP.",
- 100, 0, 0)
-
-DEFPARAM (PARAM_MAX_ISL_OPERATIONS,
- "max-isl-operations",
- "Maximum number of isl operations, 0 means unlimited.",
- 350000, 0, 0)
-
-/* For testsuite purposes allow to check for codegen error handling. */
-DEFPARAM (PARAM_GRAPHITE_ALLOW_CODEGEN_ERRORS,
- "graphite-allow-codegen-errors",
- "Whether codegen errors should be ICEs when -fchecking.",
- 0, 0, 1)
-
-/* Avoid data dependence analysis on very large loops. */
-DEFPARAM (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS,
- "loop-max-datarefs-for-datadeps",
- "Maximum number of datarefs in loop for building loop data dependencies.",
- 1000, 0, 0)
-
-/* Avoid doing loop invariant motion on very large loops. */
-
-DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP,
- "loop-invariant-max-bbs-in-loop",
- "Max basic blocks number in loop for loop invariant motion.",
- 10000, 0, 0)
-
-/* When the parameter is 1, use the internal function id
- to look up for profile data. Otherwise, use a more stable
- external id based on assembler name and source location. */
-DEFPARAM (PARAM_PROFILE_FUNC_INTERNAL_ID,
- "profile-func-internal-id",
- "Use internal function id in profile lookup.",
- 0, 0, 1)
-
-/* Avoid SLP vectorization of large basic blocks. */
-DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB,
- "slp-max-insns-in-bb",
- "Maximum number of instructions in basic block to be considered for "
- "SLP vectorization.", 1000, 0, 0)
-
-DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO,
- "min-insn-to-prefetch-ratio",
- "Min. ratio of insns to prefetches to enable prefetching for "
- "a loop with an unknown trip count.",
- 9, 0, 0)
-
-DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO,
- "prefetch-min-insn-to-mem-ratio",
- "Min. ratio of insns to mem ops to enable prefetching in a loop.",
- 3, 0, 0)
-
-/* Set maximum hash table size for var tracking. */
-
-DEFPARAM (PARAM_MAX_VARTRACK_SIZE,
- "max-vartrack-size",
- "Max. size of var tracking hash tables.",
- 50000000, 0, 0)
-
-/* Set maximum recursion depth for var tracking expression expansion
- and resolution. */
-
-DEFPARAM (PARAM_MAX_VARTRACK_EXPR_DEPTH,
- "max-vartrack-expr-depth",
- "Max. recursion depth for expanding var tracking expressions.",
- 12, 0, 0)
-
-/* Set maximum length of value location list for which var tracking
- should add reverse operations. */
-
-DEFPARAM (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE,
- "max-vartrack-reverse-op-size",
- "Max. size of loc list for which reverse ops should be added.",
- 50, 0, 0)
-
-/* Set a threshold to discard debug markers (e.g. debug begin stmt
- markers) when expanding a function to RTL, or inlining it into
- another function. */
-
-DEFPARAM (PARAM_MAX_DEBUG_MARKER_COUNT,
- "max-debug-marker-count",
- "Max. count of debug markers to expand or inline.",
- 100000, 0, 0)
-
-/* Set minimum insn uid for non-debug insns. */
-
-DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID,
- "min-nondebug-insn-uid",
- "The minimum UID to be used for a nondebug insn.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR,
- "ipa-sra-ptr-growth-factor",
- "Maximum allowed growth of number and total size of new parameters "
- "that ipa-sra replaces a pointer to an aggregate with.",
- 2, 0, 0)
-
-DEFPARAM (PARAM_IPA_SRA_MAX_REPLACEMENTS,
- "ipa-sra-max-replacements",
- "Maximum pieces that IPA-SRA tracks per formal parameter, as "
- "a consequence, also the maximum number of replacements of a formal "
- "parameter.",
- 8, 0, 16)
-
-DEFPARAM (PARAM_TM_MAX_AGGREGATE_SIZE,
- "tm-max-aggregate-size",
- "Size in bytes after which thread-local aggregates should be "
- "instrumented with the logging functions instead of save/restore "
- "pairs.",
- 9, 0, 0)
-
-DEFPARAM (PARAM_SRA_MAX_SCALARIZATION_SIZE_SPEED,
- "sra-max-scalarization-size-Ospeed",
- "Maximum size, in storage units, of an aggregate which should be "
- "considered for scalarization when compiling for speed.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_SRA_MAX_SCALARIZATION_SIZE_SIZE,
- "sra-max-scalarization-size-Osize",
- "Maximum size, in storage units, of an aggregate which should be "
- "considered for scalarization when compiling for size.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_IPA_CP_VALUE_LIST_SIZE,
- "ipa-cp-value-list-size",
- "Maximum size of a list of values associated with each parameter for "
- "interprocedural constant propagation.",
- 8, 0, 0)
-
-DEFPARAM (PARAM_IPA_CP_EVAL_THRESHOLD,
- "ipa-cp-eval-threshold",
- "Threshold ipa-cp opportunity evaluation that is still considered "
- "beneficial to clone.",
- 500, 0, 0)
-
-DEFPARAM (PARAM_IPA_CP_RECURSION_PENALTY,
- "ipa-cp-recursion-penalty",
- "Percentage penalty the recursive functions will receive when they "
- "are evaluated for cloning.",
- 40, 0, 100)
-
-DEFPARAM (PARAM_IPA_CP_SINGLE_CALL_PENALTY,
- "ipa-cp-single-call-penalty",
- "Percentage penalty functions containing a single call to another "
- "function will receive when they are evaluated for cloning.",
- 15, 0, 100)
-
-DEFPARAM (PARAM_IPA_MAX_AGG_ITEMS,
- "ipa-max-agg-items",
- "Maximum number of aggregate content items for a parameter in "
- "jump functions and lattices.",
- 16, 0, 0)
-
-DEFPARAM (PARAM_IPA_CP_LOOP_HINT_BONUS,
- "ipa-cp-loop-hint-bonus",
- "Compile-time bonus IPA-CP assigns to candidates which make loop "
- "bounds or strides known.",
- 64, 0, 0)
-
-DEFPARAM (PARAM_IPA_MAX_AA_STEPS,
- "ipa-max-aa-steps",
- "Maximum number of statements that will be visited by IPA formal "
- "parameter analysis based on alias analysis in any given function.",
- 25000, 0, 0)
-
-DEFPARAM (PARAM_IPA_MAX_SWITCH_PREDICATE_BOUNDS,
- "ipa-max-switch-predicate-bounds",
- "Maximal number of boundary endpoints of case ranges of switch "
- "statement used during IPA functoin summary generation.",
- 5, 0, 0)
-
-DEFPARAM (PARAM_IPA_MAX_PARAM_EXPR_OPS,
- "ipa-max-param-expr-ops",
- "Maximum number of operations in a parameter expression that can "
- "be handled by IPA analysis.",
- 10, 0, 0)
-
-/* WHOPR partitioning configuration. */
-
-DEFPARAM (PARAM_LTO_PARTITIONS,
- "lto-partitions",
- "Number of partitions the program should be split to.",
- 128, 1, 0)
-
-DEFPARAM (MIN_PARTITION_SIZE,
- "lto-min-partition",
- "Minimal size of a partition for LTO (in estimated instructions).",
- 10000, 0, 0)
-
-DEFPARAM (MAX_PARTITION_SIZE,
- "lto-max-partition",
- "Maximal size of a partition for LTO (in estimated instructions).",
- 1000000, 0, INT_MAX)
-
-DEFPARAM (PARAM_MAX_LTO_STREAMING_PARALLELISM,
- "lto-max-streaming-parallelism",
- "maximal number of LTO partitions streamed in parallel.",
- 32, 1, 0)
-
-/* Diagnostic parameters. */
-
-DEFPARAM (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP,
- "cxx-max-namespaces-for-diagnostic-help",
- "Maximum number of namespaces to search for alternatives when "
- "name lookup fails.",
- 1000, 0, 0)
-
-/* Maximum number of conditional store pairs that can be sunk. */
-DEFPARAM (PARAM_MAX_STORES_TO_SINK,
- "max-stores-to-sink",
- "Maximum number of conditional store pairs that can be sunk.",
- 2, 0, 0)
-
-/* Override CASE_VALUES_THRESHOLD of when to switch from doing switch
- statements via if statements to using a table jump operation. If the value
- is 0, the default CASE_VALUES_THRESHOLD will be used. */
-DEFPARAM (PARAM_CASE_VALUES_THRESHOLD,
- "case-values-threshold",
- "The smallest number of different values for which it is best to "
- "use a jump-table instead of a tree of conditional branches, "
- "if 0, use the default for the machine.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SIZE,
- "jump-table-max-growth-ratio-for-size",
- "The maximum code size growth ratio when expanding "
- "into a jump table (in percent). The parameter is used when "
- "optimizing for size.",
- 300, 0, 0)
-
-DEFPARAM (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SPEED,
- "jump-table-max-growth-ratio-for-speed",
- "The maximum code size growth ratio when expanding "
- "into a jump table (in percent). The parameter is used when "
- "optimizing for speed.",
- 800, 0, 0)
-
-/* Reassociation width to be used by tree reassoc optimization. */
-DEFPARAM (PARAM_TREE_REASSOC_WIDTH,
- "tree-reassoc-width",
- "Set the maximum number of instructions executed in parallel in "
- "reassociated tree. If 0, use the target dependent heuristic.",
- 0, 0, 0)
-
-DEFPARAM (PARAM_MAX_TAIL_MERGE_COMPARISONS,
- "max-tail-merge-comparisons",
- "Maximum amount of similar bbs to compare a bb with.",
- 10, 0, 0)
-
-DEFPARAM (PARAM_STORE_MERGING_ALLOW_UNALIGNED,
- "store-merging-allow-unaligned",
- "Allow the store merging pass to introduce unaligned stores "
- "if it is legal to do so.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_MAX_STORES_TO_MERGE,
- "max-stores-to-merge",
- "Maximum number of constant stores to merge in the "
- "store merging pass.",
- 64, 2, 0)
-
-DEFPARAM (PARAM_STORE_MERGING_MAX_SIZE,
- "store-merging-max-size",
- "Maximum size of a single store merging region in bytes.",
- 65536, 1, 1)
-
-DEFPARAM (PARAM_MAX_TAIL_MERGE_ITERATIONS,
- "max-tail-merge-iterations",
- "Maximum amount of iterations of the pass over a function.",
- 2, 0, 0)
-
-/* Maximum number of strings for which strlen optimization pass will
- track string lenths. */
-DEFPARAM (PARAM_MAX_TRACKED_STRLENS,
- "max-tracked-strlens",
- "Maximum number of strings for which strlen optimization pass will "
- "track string lengths.",
- 10000, 0, 0)
-
-/* Keep this in sync with the sched_pressure_algorithm enum. */
-DEFPARAM (PARAM_SCHED_PRESSURE_ALGORITHM,
- "sched-pressure-algorithm",
- "Which -fsched-pressure algorithm to apply.",
- 1, 1, 2)
-
-/* Maximum length of candidate scans in straight-line strength reduction. */
-DEFPARAM (PARAM_MAX_SLSR_CANDIDATE_SCAN,
- "max-slsr-cand-scan",
- "Maximum length of candidate scans for straight-line "
- "strength reduction.",
- 50, 1, 999999)
-
-/* ASan stands for AddressSanitizer: https://github.com/google/sanitizers. */
-
-DEFPARAM (PARAM_ASAN_STACK,
- "asan-stack",
- "Enable asan stack protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_PROTECT_ALLOCAS,
- "asan-instrument-allocas",
- "Enable asan allocas/VLAs protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_GLOBALS,
- "asan-globals",
- "Enable asan globals protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_INSTRUMENT_WRITES,
- "asan-instrument-writes",
- "Enable asan store operations protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_INSTRUMENT_READS,
- "asan-instrument-reads",
- "Enable asan load operations protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_MEMINTRIN,
- "asan-memintrin",
- "Enable asan builtin functions protection.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_USE_AFTER_RETURN,
- "asan-use-after-return",
- "Enable asan detection of use-after-return bugs.",
- 1, 0, 1)
-
-DEFPARAM (PARAM_ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD,
- "asan-instrumentation-with-call-threshold",
- "Use callbacks instead of inline code if number of accesses "
- "in function becomes greater or equal to this number.",
- 7000, 0, INT_MAX)
-
-DEFPARAM (PARAM_USE_AFTER_SCOPE_DIRECT_EMISSION_THRESHOLD,
- "use-after-scope-direct-emission-threshold",
- "Use direct poisoning/unpoisoning instructions for variables "
- "smaller or equal to this number.",
- 256, 0, INT_MAX)
-
-DEFPARAM (PARAM_UNINIT_CONTROL_DEP_ATTEMPTS,
- "uninit-control-dep-attempts",
- "Maximum number of nested calls to search for control dependencies "
- "during uninitialized variable analysis.",
- 1000, 1, 0)
-
-DEFPARAM (PARAM_FSM_SCALE_PATH_STMTS,
- "fsm-scale-path-stmts",
- "Scale factor to apply to the number of statements in a threading path when comparing to the number of (scaled) blocks.",
- 2, 1, 10)
-
-DEFPARAM (PARAM_FSM_MAXIMUM_PHI_ARGUMENTS,
- "fsm-maximum-phi-arguments",
- "Maximum number of arguments a PHI may have before the FSM threader will not try to thread through its block.",
- 100, 1, 999999)
-
-DEFPARAM (PARAM_FSM_SCALE_PATH_BLOCKS,
- "fsm-scale-path-blocks",
- "Scale factor to apply to the number of blocks in a threading path when comparing to the number of (scaled) statements.",
- 3, 1, 10)
-
-DEFPARAM (PARAM_MAX_FSM_THREAD_PATH_INSNS,
- "max-fsm-thread-path-insns",
- "Maximum number of instructions to copy when duplicating blocks on a finite state automaton jump thread path.",
- 100, 1, 999999)
-
-DEFPARAM (PARAM_MAX_FSM_THREAD_LENGTH,
- "max-fsm-thread-length",
- "Maximum number of basic blocks on a finite state automaton jump thread path.",
- 10, 1, 999999)
-
-DEFPARAM (PARAM_MAX_FSM_THREAD_PATHS,
- "max-fsm-thread-paths",
- "Maximum number of new jump thread paths to create for a finite state automaton.",
- 50, 1, 999999)
-
-DEFPARAM (PARAM_PARLOOPS_CHUNK_SIZE,
- "parloops-chunk-size",
- "Chunk size of omp schedule for loops parallelized by parloops.",
- 0, 0, 0)
-
-DEFPARAMENUM5 (PARAM_PARLOOPS_SCHEDULE,
- "parloops-schedule",
- "Schedule type of omp schedule for loops parallelized by "
- "parloops (static, dynamic, guided, auto, runtime).",
- static,
- static, dynamic, guided, auto, runtime)
-
-DEFPARAM (PARAM_PARLOOPS_MIN_PER_THREAD,
- "parloops-min-per-thread",
- "Minimum number of iterations per thread of an innermost "
- "parallelized loop.",
- 100, 2, 0)
-
-DEFPARAM (PARAM_MAX_SSA_NAME_QUERY_DEPTH,
- "max-ssa-name-query-depth",
- "Maximum recursion depth allowed when querying a property of an"
- " SSA name.",
- 3, 1, 10)
-
-DEFPARAM (PARAM_MAX_RTL_IF_CONVERSION_INSNS,
- "max-rtl-if-conversion-insns",
- "Maximum number of insns in a basic block to consider for RTL "
- "if-conversion.",
- 10, 0, 99)
-
-DEFPARAM (PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST,
- "max-rtl-if-conversion-predictable-cost",
- "Maximum permissible cost for the sequence that would be "
- "generated by the RTL if-conversion pass for a branch that "
- "is considered predictable.",
- 20, 0, 200)
-
-DEFPARAM (PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST,
- "max-rtl-if-conversion-unpredictable-cost",
- "Maximum permissible cost for the sequence that would be "
- "generated by the RTL if-conversion pass for a branch that "
- "is considered unpredictable.",
- 40, 0, 200)
-
-DEFPARAM (PARAM_HSA_GEN_DEBUG_STORES,
- "hsa-gen-debug-stores",
- "Level of hsa debug stores verbosity.",
- 0, 0, 1)
-
-DEFPARAM (PARAM_MAX_SPECULATIVE_DEVIRT_MAYDEFS,
- "max-speculative-devirt-maydefs",
- "Maximum number of may-defs visited when devirtualizing "
- "speculatively.", 50, 0, 0)
-
-DEFPARAM (PARAM_MAX_VRP_SWITCH_ASSERTIONS,
- "max-vrp-switch-assertions",
- "Maximum number of assertions to add along the default "
- "edge of a switch statement during VRP.",
- 10, 0, 0)
-
-DEFPARAM (PARAM_VECT_EPILOGUES_NOMASK,
- "vect-epilogues-nomask",
- "Enable loop epilogue vectorization using smaller vector size.",
- 1, 0, 1)
-
-DEFPARAM(PARAM_UNROLL_JAM_MIN_PERCENT,
- "unroll-jam-min-percent",
- "Minimum percentage of memrefs that must go away for unroll-and-jam to be considered profitable.",
- 1, 0, 100)
-
-DEFPARAM(PARAM_UNROLL_JAM_MAX_UNROLL,
- "unroll-jam-max-unroll",
- "Maximum unroll factor for the unroll-and-jam transformation.",
- 4, 0, 0)
-
-DEFPARAM(PARAM_AVOID_FMA_MAX_BITS,
- "avoid-fma-max-bits",
- "Maximum number of bits for which we avoid creating FMAs.",
- 0, 0, 512)
-
-DEFPARAM(PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT,
- "logical-op-non-short-circuit",
- "True if a non-short-circuit operation is optimal.",
- -1, -1, 1)
-
-DEFPARAM(PARAM_LOOP_VERSIONING_MAX_INNER_INSNS,
- "loop-versioning-max-inner-insns",
- "The maximum number of instructions in an inner loop that is being"
- " considered for versioning.",
- 200, 0, 0)
-
-DEFPARAM(PARAM_LOOP_VERSIONING_MAX_OUTER_INSNS,
- "loop-versioning-max-outer-insns",
- "The maximum number of instructions in an outer loop that is being"
- " considered for versioning, on top of the instructions in inner"
- " loops.",
- 100, 0, 0)
-
-DEFPARAM(PARAM_GIMPLE_FE_COMPUTED_HOT_BB_THRESHOLD,
- "gimple-fe-computed-hot-bb-threshold",
- "The number of executions of a basic block which is considered hot."
- " The parameter is used only in GIMPLE FE.",
- 0, 0, 0)
-
-DEFPARAM(PARAM_HASH_TABLE_VERIFICATION_LIMIT,
- "hash-table-verification-limit",
- "The number of elements for which hash table verification is done for "
- "each searched element.",
- 10, 0, 0)
-
-DEFPARAM(PARAM_SSA_NAME_DEF_CHAIN_LIMIT,
- "ssa-name-def-chain-limit",
- "The maximum number of SSA_NAME assignments to follow in determining "
- "a value.",
- 512, 0, 0)
-
-/*
-
-Local variables:
-mode:c
-End:
-*/
diff --git a/gcc/params.h b/gcc/params.h
deleted file mode 100644
index 1aaef6d6a00..00000000000
--- a/gcc/params.h
+++ /dev/null
@@ -1,254 +0,0 @@
-/* params.h - Run-time parameters.
- Copyright (C) 2001-2019 Free Software Foundation, Inc.
- Written by Mark Mitchell <mark@codesourcery.com>.
-
-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
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-/* This module provides a means for setting integral parameters
- dynamically. Instead of encoding magic numbers in various places,
- use this module to organize all the magic numbers in a single
- place. The values of the parameters can be set on the
- command-line, thereby providing a way to control the amount of
- effort spent on particular optimization passes, or otherwise tune
- the behavior of the compiler.
-
- Since their values can be set on the command-line, these parameters
- should not be used for non-dynamic memory allocation. */
-
-#ifndef GCC_PARAMS_H
-#define GCC_PARAMS_H
-
-/* No parameter shall have this value. */
-
-#define INVALID_PARAM_VAL (-1)
-
-/* The information associated with each parameter. */
-
-struct param_info
-{
- /* The name used with the `--param <name>=<value>' switch to set this
- value. */
- const char *option;
-
- /* The default value. */
- int default_value;
-
- /* Minimum acceptable value. */
- int min_value;
-
- /* Maximum acceptable value, if greater than minimum */
- int max_value;
-
- /* A short description of the option. */
- const char *help;
-
- /* The optional names corresponding to the values. */
- const char **value_names;
-};
-
-/* An array containing the compiler parameters and their current
- values. */
-
-extern param_info *compiler_params;
-
-/* Returns the number of entries in the table, for the use by plugins. */
-extern size_t get_num_compiler_params (void);
-
-/* Add the N PARAMS to the current list of compiler parameters. */
-
-extern void add_params (const param_info params[], size_t n);
-
-/* Set the VALUE associated with the parameter given by NAME in the
- table PARAMS using PARAMS_SET to indicate which have been
- explicitly set. */
-
-extern void set_param_value (const char *name, int value,
- int *params, int *params_set);
-
-\f
-/* The parameters in use by language-independent code. */
-
-enum compiler_param
-{
-#include "params.list"
- LAST_PARAM
-};
-
-extern bool find_param (const char *, enum compiler_param *);
-extern const char *find_param_fuzzy (const char *name);
-extern bool param_string_value_p (enum compiler_param, const char *, int *);
-
-/* The value of the parameter given by ENUM. Not an lvalue. */
-#define PARAM_VALUE(ENUM) \
- ((int) global_options.x_param_values[(int) ENUM])
-
-/* Set the value of the parameter given by NUM to VALUE, implicitly,
- if it has not been set explicitly by the user, in the table PARAMS
- using PARAMS_SET to indicate which have been explicitly set. */
-
-extern void maybe_set_param_value (compiler_param num, int value,
- int *params, int *params_set);
-
-/* Set the default value of a parameter given by NUM to VALUE, before
- option processing. */
-
-extern void set_default_param_value (compiler_param num, int value);
-
-/* Add all parameters and default values that can be set in both the
- driver and the compiler proper. */
-
-extern void global_init_params (void);
-
-/* Note that all parameters have been added and all default values
- set. */
-extern void finish_params (void);
-
-/* Reset all state in params.c */
-
-extern void params_c_finalize (void);
-
-/* Return the default value of parameter NUM. */
-
-extern int default_param_value (compiler_param num);
-
-/* Initialize an array PARAMS with default values of the
- parameters. */
-extern void init_param_values (int *params);
-
-/* Macros for the various parameters. */
-#define MAX_INLINE_INSNS_SINGLE \
- PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE)
-#define MAX_INLINE_INSNS \
- PARAM_VALUE (PARAM_MAX_INLINE_INSNS)
-#define MAX_INLINE_SLOPE \
- PARAM_VALUE (PARAM_MAX_INLINE_SLOPE)
-#define MIN_INLINE_INSNS \
- PARAM_VALUE (PARAM_MIN_INLINE_INSNS)
-#define MAX_INLINE_INSNS_AUTO \
- PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO)
-#define MAX_VARIABLE_EXPANSIONS \
- PARAM_VALUE (PARAM_MAX_VARIABLE_EXPANSIONS)
-#define MIN_VECT_LOOP_BOUND \
- PARAM_VALUE (PARAM_MIN_VECT_LOOP_BOUND)
-#define MAX_DELAY_SLOT_INSN_SEARCH \
- PARAM_VALUE (PARAM_MAX_DELAY_SLOT_INSN_SEARCH)
-#define MAX_DELAY_SLOT_LIVE_SEARCH \
- PARAM_VALUE (PARAM_MAX_DELAY_SLOT_LIVE_SEARCH)
-#define MAX_PENDING_LIST_LENGTH \
- PARAM_VALUE (PARAM_MAX_PENDING_LIST_LENGTH)
-#define MAX_GCSE_MEMORY \
- ((size_t) PARAM_VALUE (PARAM_MAX_GCSE_MEMORY))
-#define MAX_GCSE_INSERTION_RATIO \
- ((size_t) PARAM_VALUE (PARAM_MAX_GCSE_INSERTION_RATIO))
-#define GCSE_AFTER_RELOAD_PARTIAL_FRACTION \
- PARAM_VALUE (PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION)
-#define GCSE_AFTER_RELOAD_CRITICAL_FRACTION \
- PARAM_VALUE (PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION)
-#define GCSE_COST_DISTANCE_RATIO \
- PARAM_VALUE (PARAM_GCSE_COST_DISTANCE_RATIO)
-#define GCSE_UNRESTRICTED_COST \
- PARAM_VALUE (PARAM_GCSE_UNRESTRICTED_COST)
-#define MAX_HOIST_DEPTH \
- PARAM_VALUE (PARAM_MAX_HOIST_DEPTH)
-#define MAX_UNROLLED_INSNS \
- PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS)
-#define MAX_SMS_LOOP_NUMBER \
- PARAM_VALUE (PARAM_MAX_SMS_LOOP_NUMBER)
-#define SMS_MAX_II_FACTOR \
- PARAM_VALUE (PARAM_SMS_MAX_II_FACTOR)
-#define SMS_DFA_HISTORY \
- PARAM_VALUE (PARAM_SMS_DFA_HISTORY)
-#define SMS_LOOP_AVERAGE_COUNT_THRESHOLD \
- PARAM_VALUE (PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD)
-#define INTEGER_SHARE_LIMIT \
- PARAM_VALUE (PARAM_INTEGER_SHARE_LIMIT)
-#define MAX_LAST_VALUE_RTL \
- PARAM_VALUE (PARAM_MAX_LAST_VALUE_RTL)
-#define MIN_VIRTUAL_MAPPINGS \
- PARAM_VALUE (PARAM_MIN_VIRTUAL_MAPPINGS)
-#define VIRTUAL_MAPPINGS_TO_SYMS_RATIO \
- PARAM_VALUE (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO)
-#define MAX_FIELDS_FOR_FIELD_SENSITIVE \
- ((size_t) PARAM_VALUE (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE))
-#define MAX_SCHED_READY_INSNS \
- PARAM_VALUE (PARAM_MAX_SCHED_READY_INSNS)
-#define PREFETCH_LATENCY \
- PARAM_VALUE (PARAM_PREFETCH_LATENCY)
-#define SIMULTANEOUS_PREFETCHES \
- PARAM_VALUE (PARAM_SIMULTANEOUS_PREFETCHES)
-#define L1_CACHE_SIZE \
- PARAM_VALUE (PARAM_L1_CACHE_SIZE)
-#define L1_CACHE_LINE_SIZE \
- PARAM_VALUE (PARAM_L1_CACHE_LINE_SIZE)
-#define L2_CACHE_SIZE \
- PARAM_VALUE (PARAM_L2_CACHE_SIZE)
-#define PREFETCH_DYNAMIC_STRIDES \
- PARAM_VALUE (PARAM_PREFETCH_DYNAMIC_STRIDES)
-#define PREFETCH_MINIMUM_STRIDE \
- PARAM_VALUE (PARAM_PREFETCH_MINIMUM_STRIDE)
-#define USE_CANONICAL_TYPES \
- PARAM_VALUE (PARAM_USE_CANONICAL_TYPES)
-#define IRA_MAX_LOOPS_NUM \
- PARAM_VALUE (PARAM_IRA_MAX_LOOPS_NUM)
-#define IRA_MAX_CONFLICT_TABLE_SIZE \
- PARAM_VALUE (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE)
-#define IRA_LOOP_RESERVED_REGS \
- PARAM_VALUE (PARAM_IRA_LOOP_RESERVED_REGS)
-#define LRA_MAX_CONSIDERED_RELOAD_PSEUDOS \
- PARAM_VALUE (PARAM_LRA_MAX_CONSIDERED_RELOAD_PSEUDOS)
-#define LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF \
- PARAM_VALUE (PARAM_LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF)
-#define SWITCH_CONVERSION_BRANCH_RATIO \
- PARAM_VALUE (PARAM_SWITCH_CONVERSION_BRANCH_RATIO)
-#define LOOP_INVARIANT_MAX_BBS_IN_LOOP \
- PARAM_VALUE (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP)
-#define SLP_MAX_INSNS_IN_BB \
- PARAM_VALUE (PARAM_SLP_MAX_INSNS_IN_BB)
-#define MIN_INSN_TO_PREFETCH_RATIO \
- PARAM_VALUE (PARAM_MIN_INSN_TO_PREFETCH_RATIO)
-#define PREFETCH_MIN_INSN_TO_MEM_RATIO \
- PARAM_VALUE (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO)
-#define MIN_NONDEBUG_INSN_UID \
- PARAM_VALUE (PARAM_MIN_NONDEBUG_INSN_UID)
-#define MAX_STORES_TO_SINK \
- PARAM_VALUE (PARAM_MAX_STORES_TO_SINK)
-#define ALLOW_LOAD_DATA_RACES \
- PARAM_VALUE (PARAM_ALLOW_LOAD_DATA_RACES)
-#define ALLOW_PACKED_LOAD_DATA_RACES \
- PARAM_VALUE (PARAM_ALLOW_PACKED_LOAD_DATA_RACES)
-#define ALLOW_PACKED_STORE_DATA_RACES \
- PARAM_VALUE (PARAM_ALLOW_PACKED_STORE_DATA_RACES)
-#define ASAN_STACK \
- PARAM_VALUE (PARAM_ASAN_STACK)
-#define ASAN_PROTECT_ALLOCAS \
- PARAM_VALUE (PARAM_ASAN_PROTECT_ALLOCAS)
-#define ASAN_GLOBALS \
- PARAM_VALUE (PARAM_ASAN_GLOBALS)
-#define ASAN_INSTRUMENT_READS \
- PARAM_VALUE (PARAM_ASAN_INSTRUMENT_READS)
-#define ASAN_INSTRUMENT_WRITES \
- PARAM_VALUE (PARAM_ASAN_INSTRUMENT_WRITES)
-#define ASAN_MEMINTRIN \
- PARAM_VALUE (PARAM_ASAN_MEMINTRIN)
-#define ASAN_USE_AFTER_RETURN \
- PARAM_VALUE (PARAM_ASAN_USE_AFTER_RETURN)
-#define ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD \
- PARAM_VALUE (PARAM_ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD)
-#define ASAN_PARAM_USE_AFTER_SCOPE_DIRECT_EMISSION_THRESHOLD \
- ((unsigned) PARAM_VALUE (PARAM_USE_AFTER_SCOPE_DIRECT_EMISSION_THRESHOLD))
-
-#endif /* ! GCC_PARAMS_H */
diff --git a/gcc/postreload-gcse.c b/gcc/postreload-gcse.c
index 83df1825f16..da35aa70978 100644
--- a/gcc/postreload-gcse.c
+++ b/gcc/postreload-gcse.c
@@ -35,7 +35,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgrtl.h"
#include "profile.h"
#include "expr.h"
-#include "params.h"
#include "tree-pass.h"
#include "dbgcnt.h"
#include "intl.h"
diff --git a/gcc/predict.c b/gcc/predict.c
index 5ee56a33fd7..8c66a27d8b6 100644
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -48,7 +48,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfganal.h"
#include "profile.h"
#include "sreal.h"
-#include "params.h"
#include "cfgloop.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
diff --git a/gcc/reload.c b/gcc/reload.c
index b8178238ff9..3e6a0888f94 100644
--- a/gcc/reload.c
+++ b/gcc/reload.c
@@ -105,7 +105,6 @@ a register with any other reload. */
#include "rtl-error.h"
#include "reload.h"
#include "addresses.h"
-#include "params.h"
#include "function-abi.h"
/* True if X is a constant that can be forced into the constant pool.
diff --git a/gcc/reorg.c b/gcc/reorg.c
index 460741213f2..add00a62a60 100644
--- a/gcc/reorg.c
+++ b/gcc/reorg.c
@@ -116,7 +116,6 @@ along with GCC; see the file COPYING3. If not see
#include "recog.h"
#include "insn-attr.h"
#include "resource.h"
-#include "params.h"
#include "tree-pass.h"
\f
diff --git a/gcc/resource.c b/gcc/resource.c
index 5d16100ef48..be6426f92df 100644
--- a/gcc/resource.c
+++ b/gcc/resource.c
@@ -29,7 +29,6 @@ along with GCC; see the file COPYING3. If not see
#include "emit-rtl.h"
#include "resource.h"
#include "insn-attr.h"
-#include "params.h"
#include "function-abi.h"
/* This structure is used to record liveness information at the targets or
diff --git a/gcc/sanopt.c b/gcc/sanopt.c
index 7a4daeaf458..7749c948c23 100644
--- a/gcc/sanopt.c
+++ b/gcc/sanopt.c
@@ -34,7 +34,6 @@ along with GCC; see the file COPYING3. If not see
#include "attribs.h"
#include "asan.h"
#include "ubsan.h"
-#include "params.h"
#include "tree-hash-traits.h"
#include "gimple-ssa.h"
#include "tree-phinodes.h"
diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c
index 8b544b88592..86f0d300b98 100644
--- a/gcc/sched-deps.c
+++ b/gcc/sched-deps.c
@@ -36,7 +36,6 @@ along with GCC; see the file COPYING3. If not see
#include "insn-attr.h"
#include "cfgbuild.h"
#include "sched-int.h"
-#include "params.h"
#include "cselib.h"
#include "function-abi.h"
diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c
index c60afa340e7..c8736831379 100644
--- a/gcc/sched-ebb.c
+++ b/gcc/sched-ebb.c
@@ -29,7 +29,6 @@ along with GCC; see the file COPYING3. If not see
#include "df.h"
#include "profile.h"
#include "insn-attr.h"
-#include "params.h"
#include "cfgrtl.h"
#include "cfgbuild.h"
#include "sched-int.h"
diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c
index 99b6619607b..bb6cb62b8ea 100644
--- a/gcc/sched-rgn.c
+++ b/gcc/sched-rgn.c
@@ -58,7 +58,6 @@ along with GCC; see the file COPYING3. If not see
#include "profile.h"
#include "insn-attr.h"
#include "except.h"
-#include "params.h"
#include "cfganal.h"
#include "sched-int.h"
#include "sel-sched.h"
diff --git a/gcc/sel-sched-ir.c b/gcc/sel-sched-ir.c
index d6513b136a0..2632dfa6506 100644
--- a/gcc/sel-sched-ir.c
+++ b/gcc/sel-sched-ir.c
@@ -33,7 +33,6 @@ along with GCC; see the file COPYING3. If not see
#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. */
diff --git a/gcc/sel-sched.c b/gcc/sel-sched.c
index 2ecc06d0f17..c1ed1a38ef3 100644
--- a/gcc/sel-sched.c
+++ b/gcc/sel-sched.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgcleanup.h"
#include "insn-config.h"
#include "insn-attr.h"
-#include "params.h"
#include "target.h"
#include "sched-int.h"
#include "rtlhooks-def.h"
diff --git a/gcc/shrink-wrap.c b/gcc/shrink-wrap.c
index e612f85c15a..c6e93596568 100644
--- a/gcc/shrink-wrap.c
+++ b/gcc/shrink-wrap.c
@@ -37,7 +37,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-pass.h"
#include "cfgrtl.h"
#include "cfgbuild.h"
-#include "params.h"
#include "bb-reorder.h"
#include "shrink-wrap.h"
#include "regcprop.h"
diff --git a/gcc/stmt.c b/gcc/stmt.c
index 17f43d14d88..4d2b7a5a845 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -50,7 +50,6 @@ along with GCC; see the file COPYING3. If not see
#include "langhooks.h"
#include "cfganal.h"
#include "tree-cfg.h"
-#include "params.h"
#include "dumpfile.h"
#include "builtins.h"
diff --git a/gcc/targhooks.c b/gcc/targhooks.c
index 2f26e468b8a..822a0313e9e 100644
--- a/gcc/targhooks.c
+++ b/gcc/targhooks.c
@@ -79,7 +79,6 @@ along with GCC; see the file COPYING3. If not see
#include "opts.h"
#include "gimplify.h"
#include "predict.h"
-#include "params.h"
#include "real.h"
#include "langhooks.h"
#include "sbitmap.h"
diff --git a/gcc/toplev.c b/gcc/toplev.c
index a836646f8a1..513e4e066b7 100644
--- a/gcc/toplev.c
+++ b/gcc/toplev.c
@@ -52,7 +52,6 @@ along with GCC; see the file COPYING3. If not see
#include "expr.h"
#include "intl.h"
#include "tree-diagnostic.h"
-#include "params.h"
#include "reload.h"
#include "lra.h"
#include "dwarf2asm.h"
diff --git a/gcc/tracer.c b/gcc/tracer.c
index 02203923369..4ee3fef92ec 100644
--- a/gcc/tracer.c
+++ b/gcc/tracer.c
@@ -44,7 +44,6 @@
#include "tree-pass.h"
#include "profile.h"
#include "cfganal.h"
-#include "params.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-ssa.h"
diff --git a/gcc/trans-mem.c b/gcc/trans-mem.c
index 4a0f6e7dee9..3aa5c532256 100644
--- a/gcc/trans-mem.c
+++ b/gcc/trans-mem.c
@@ -46,7 +46,6 @@
#include "demangle.h"
#include "output.h"
#include "trans-mem.h"
-#include "params.h"
#include "langhooks.h"
#include "cfgloop.h"
#include "tree-ssa-address.h"
diff --git a/gcc/tree-chrec.c b/gcc/tree-chrec.c
index 8d5fce30289..626688782f1 100644
--- a/gcc/tree-chrec.c
+++ b/gcc/tree-chrec.c
@@ -38,7 +38,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple.h"
#include "tree-ssa-loop.h"
#include "dumpfile.h"
-#include "params.h"
#include "tree-scalar-evolution.h"
/* Extended folder for chrecs. */
diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c
index e9fa4ae69c3..191beb9df99 100644
--- a/gcc/tree-data-ref.c
+++ b/gcc/tree-data-ref.c
@@ -93,7 +93,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-scalar-evolution.h"
#include "dumpfile.h"
#include "tree-affine.h"
-#include "params.h"
#include "builtins.h"
#include "tree-eh.h"
#include "ssa.h"
diff --git a/gcc/tree-if-conv.c b/gcc/tree-if-conv.c
index 09560198539..33d6cddb460 100644
--- a/gcc/tree-if-conv.c
+++ b/gcc/tree-if-conv.c
@@ -114,7 +114,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-hash-traits.h"
#include "varasm.h"
#include "builtins.h"
-#include "params.h"
#include "cfganal.h"
#include "internal-fn.h"
#include "fold-const.h"
diff --git a/gcc/tree-inline.c b/gcc/tree-inline.c
index b1b6dca9070..d77c53274ef 100644
--- a/gcc/tree-inline.c
+++ b/gcc/tree-inline.c
@@ -53,7 +53,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "except.h"
#include "debug.h"
-#include "params.h"
#include "value-prof.h"
#include "cfgloop.h"
#include "builtins.h"
diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c
index 9930daaafa9..39e17e23160 100644
--- a/gcc/tree-loop-distribution.c
+++ b/gcc/tree-loop-distribution.c
@@ -112,7 +112,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "cfgloop.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-vectorizer.h"
#include "tree-eh.h"
#include "gimple-fold.h"
diff --git a/gcc/tree-parloops.c b/gcc/tree-parloops.c
index 1a35c7dbdc3..6558dc11003 100644
--- a/gcc/tree-parloops.c
+++ b/gcc/tree-parloops.c
@@ -52,8 +52,6 @@ along with GCC; see the file COPYING3. If not see
#include "omp-general.h"
#include "omp-low.h"
#include "tree-ssa.h"
-#include "params.h"
-#include "params-enum.h"
#include "tree-ssa-alias.h"
#include "tree-eh.h"
#include "gomp-constants.h"
diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c
index 3fe2a6dcb0a..5eb3c8ba4cf 100644
--- a/gcc/tree-predcom.c
+++ b/gcc/tree-predcom.c
@@ -231,7 +231,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "tree-data-ref.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-affine.h"
#include "builtins.h"
diff --git a/gcc/tree-profile.c b/gcc/tree-profile.c
index 4c1ead5781f..6a4e62f5bae 100644
--- a/gcc/tree-profile.c
+++ b/gcc/tree-profile.c
@@ -49,7 +49,6 @@ along with GCC; see the file COPYING3. If not see
#include "value-prof.h"
#include "profile.h"
#include "tree-cfgcleanup.h"
-#include "params.h"
#include "stringpool.h"
#include "attribs.h"
#include "tree-pretty-print.h"
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c
index ed5d5663a3a..f01fee5f2c3 100644
--- a/gcc/tree-scalar-evolution.c
+++ b/gcc/tree-scalar-evolution.c
@@ -279,7 +279,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-affine.h"
#include "tree-scalar-evolution.h"
#include "dumpfile.h"
-#include "params.h"
#include "tree-ssa-propagate.h"
#include "gimple-fold.h"
#include "tree-into-ssa.h"
diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index 209f9718d33..35aa6a43331 100644
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -96,7 +96,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-cfg.h"
#include "tree-dfa.h"
#include "tree-ssa.h"
-#include "params.h"
#include "dbgcnt.h"
#include "builtins.h"
#include "tree-sra.h"
diff --git a/gcc/tree-ssa-ccp.c b/gcc/tree-ssa-ccp.c
index 335787e0517..1e8e47265a6 100644
--- a/gcc/tree-ssa-ccp.c
+++ b/gcc/tree-ssa-ccp.c
@@ -136,7 +136,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-cfg.h"
#include "tree-ssa-propagate.h"
#include "dbgcnt.h"
-#include "params.h"
#include "builtins.h"
#include "cfgloop.h"
#include "stor-layout.h"
diff --git a/gcc/tree-ssa-dom.c b/gcc/tree-ssa-dom.c
index 44a4289aa38..ec1c4effa38 100644
--- a/gcc/tree-ssa-dom.c
+++ b/gcc/tree-ssa-dom.c
@@ -39,7 +39,6 @@ along with GCC; see the file COPYING3. If not see
#include "domwalk.h"
#include "tree-ssa-propagate.h"
#include "tree-ssa-threadupdate.h"
-#include "params.h"
#include "tree-ssa-scopedtables.h"
#include "tree-ssa-threadedge.h"
#include "tree-ssa-dom.h"
diff --git a/gcc/tree-ssa-dse.c b/gcc/tree-ssa-dse.c
index 1b060d9e408..d42a9240a0d 100644
--- a/gcc/tree-ssa-dse.c
+++ b/gcc/tree-ssa-dse.c
@@ -33,7 +33,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-dfa.h"
#include "domwalk.h"
#include "tree-cfgcleanup.h"
-#include "params.h"
#include "alias.h"
#include "tree-ssa-loop.h"
#include "tree-ssa-dse.h"
diff --git a/gcc/tree-ssa-ifcombine.c b/gcc/tree-ssa-ifcombine.c
index fa3bc0a4377..6d907d46479 100644
--- a/gcc/tree-ssa-ifcombine.c
+++ b/gcc/tree-ssa-ifcombine.c
@@ -40,7 +40,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimplify-me.h"
#include "tree-cfg.h"
#include "tree-ssa.h"
-#include "params.h"
#ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
#define LOGICAL_OP_NON_SHORT_CIRCUIT \
diff --git a/gcc/tree-ssa-loop-ch.c b/gcc/tree-ssa-loop-ch.c
index fd6d74d5891..b894a7e0918 100644
--- a/gcc/tree-ssa-loop-ch.c
+++ b/gcc/tree-ssa-loop-ch.c
@@ -36,7 +36,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa-sccvn.h"
#include "tree-phinodes.h"
#include "ssa-iterators.h"
-#include "params.h"
/* Duplicates headers of loops if they are small enough, so that the statements
in the loop body are always executed when the loop is entered. This
diff --git a/gcc/tree-ssa-loop-im.c b/gcc/tree-ssa-loop-im.c
index cd1aa563e21..b2a64b059b5 100644
--- a/gcc/tree-ssa-loop-im.c
+++ b/gcc/tree-ssa-loop-im.c
@@ -38,7 +38,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-into-ssa.h"
#include "cfgloop.h"
#include "domwalk.h"
-#include "params.h"
#include "tree-affine.h"
#include "tree-ssa-propagate.h"
#include "trans-mem.h"
diff --git a/gcc/tree-ssa-loop-ivcanon.c b/gcc/tree-ssa-loop-ivcanon.c
index 7b352431225..c2543eec925 100644
--- a/gcc/tree-ssa-loop-ivcanon.c
+++ b/gcc/tree-ssa-loop-ivcanon.c
@@ -59,7 +59,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgloop.h"
#include "tree-chrec.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-inline.h"
#include "tree-cfgcleanup.h"
#include "builtins.h"
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index 6d0b8fdefd7..1be124c12c3 100644
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -125,7 +125,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "cfgloop.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-affine.h"
#include "tree-ssa-propagate.h"
#include "tree-ssa-address.h"
diff --git a/gcc/tree-ssa-loop-manip.c b/gcc/tree-ssa-loop-manip.c
index 06f90160047..a79912a0483 100644
--- a/gcc/tree-ssa-loop-manip.c
+++ b/gcc/tree-ssa-loop-manip.c
@@ -41,7 +41,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "cfgloop.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-inline.h"
/* All bitmaps for rewriting into loop-closed SSA go on this obstack,
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c
index fe24a70451d..d5c1b5b925f 100644
--- a/gcc/tree-ssa-loop-niter.c
+++ b/gcc/tree-ssa-loop-niter.c
@@ -41,7 +41,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgloop.h"
#include "tree-chrec.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "tree-dfa.h"
diff --git a/gcc/tree-ssa-loop-prefetch.c b/gcc/tree-ssa-loop-prefetch.c
index fbb65191ca0..e586408d69e 100644
--- a/gcc/tree-ssa-loop-prefetch.c
+++ b/gcc/tree-ssa-loop-prefetch.c
@@ -43,7 +43,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-into-ssa.h"
#include "cfgloop.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "langhooks.h"
#include "tree-inline.h"
#include "tree-data-ref.h"
diff --git a/gcc/tree-ssa-loop-unswitch.c b/gcc/tree-ssa-loop-unswitch.c
index 4e3aa7c41b7..49951eb21b6 100644
--- a/gcc/tree-ssa-loop-unswitch.c
+++ b/gcc/tree-ssa-loop-unswitch.c
@@ -33,7 +33,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa-loop.h"
#include "tree-into-ssa.h"
#include "cfgloop.h"
-#include "params.h"
#include "tree-inline.h"
#include "gimple-iterator.h"
#include "cfghooks.h"
diff --git a/gcc/tree-ssa-math-opts.c b/gcc/tree-ssa-math-opts.c
index 8b5f3149cbc..d90191aea2e 100644
--- a/gcc/tree-ssa-math-opts.c
+++ b/gcc/tree-ssa-math-opts.c
@@ -109,7 +109,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-dfa.h"
#include "tree-ssa.h"
#include "builtins.h"
-#include "params.h"
#include "internal-fn.h"
#include "case-cfn-macros.h"
#include "optabs-libfuncs.h"
diff --git a/gcc/tree-ssa-phiopt.c b/gcc/tree-ssa-phiopt.c
index 43990b79644..c2595c85241 100644
--- a/gcc/tree-ssa-phiopt.c
+++ b/gcc/tree-ssa-phiopt.c
@@ -44,7 +44,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-data-ref.h"
#include "tree-scalar-evolution.h"
#include "tree-inline.h"
-#include "params.h"
#include "case-cfn-macros.h"
static unsigned int tree_ssa_phiopt_worker (bool, bool, bool);
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c
index 58a147036af..d0a037b7057 100644
--- a/gcc/tree-ssa-pre.c
+++ b/gcc/tree-ssa-pre.c
@@ -45,7 +45,6 @@ along with GCC; see the file COPYING3. If not see
#include "cfgloop.h"
#include "tree-ssa-sccvn.h"
#include "tree-scalar-evolution.h"
-#include "params.h"
#include "dbgcnt.h"
#include "domwalk.h"
#include "tree-ssa-propagate.h"
diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c
index 9e5b5290b55..ed14b6b4e7a 100644
--- a/gcc/tree-ssa-reassoc.c
+++ b/gcc/tree-ssa-reassoc.c
@@ -48,7 +48,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "langhooks.h"
#include "cfgloop.h"
-#include "params.h"
#include "builtins.h"
#include "gimplify.h"
#include "case-cfn-macros.h"
diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c
index 98fbe81fa7b..579dee13522 100644
--- a/gcc/tree-ssa-sccvn.c
+++ b/gcc/tree-ssa-sccvn.c
@@ -53,7 +53,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa.h"
#include "dumpfile.h"
#include "cfgloop.h"
-#include "params.h"
#include "tree-ssa-propagate.h"
#include "tree-cfg.h"
#include "domwalk.h"
diff --git a/gcc/tree-ssa-scopedtables.c b/gcc/tree-ssa-scopedtables.c
index 9fb2f500f46..a9dfcf38287 100644
--- a/gcc/tree-ssa-scopedtables.c
+++ b/gcc/tree-ssa-scopedtables.c
@@ -34,7 +34,6 @@ along with GCC; see the file COPYING3. If not see
#include "internal-fn.h"
#include "tree-dfa.h"
#include "options.h"
-#include "params.h"
static bool hashable_expr_equal_p (const struct hashable_expr *,
const struct hashable_expr *);
diff --git a/gcc/tree-ssa-sink.c b/gcc/tree-ssa-sink.c
index cbad34b26de..9e210effcba 100644
--- a/gcc/tree-ssa-sink.c
+++ b/gcc/tree-ssa-sink.c
@@ -34,7 +34,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "cfgloop.h"
-#include "params.h"
/* TODO:
1. Sinking store only using scalar promotion (IE without moving the RHS):
diff --git a/gcc/tree-ssa-strlen.c b/gcc/tree-ssa-strlen.c
index 626d7f9dc8a..aa47259b0fe 100644
--- a/gcc/tree-ssa-strlen.c
+++ b/gcc/tree-ssa-strlen.c
@@ -45,7 +45,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa-alias.h"
#include "tree-ssa-propagate.h"
#include "tree-ssa-strlen.h"
-#include "params.h"
#include "tree-hash-traits.h"
#include "tree-object-size.h"
#include "builtins.h"
diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c
index 74edcd4458f..68298ea7eb2 100644
--- a/gcc/tree-ssa-structalias.c
+++ b/gcc/tree-ssa-structalias.c
@@ -37,7 +37,6 @@
#include "gimple-iterator.h"
#include "tree-into-ssa.h"
#include "tree-dfa.h"
-#include "params.h"
#include "gimple-walk.h"
#include "varasm.h"
#include "stringpool.h"
diff --git a/gcc/tree-ssa-tail-merge.c b/gcc/tree-ssa-tail-merge.c
index ddf7449d945..2c7e11e5492 100644
--- a/gcc/tree-ssa-tail-merge.c
+++ b/gcc/tree-ssa-tail-merge.c
@@ -201,7 +201,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-into-ssa.h"
-#include "params.h"
#include "tree-ssa-sccvn.h"
#include "cfgloop.h"
#include "tree-eh.h"
diff --git a/gcc/tree-ssa-threadbackward.c b/gcc/tree-ssa-threadbackward.c
index 6d534647c60..5629b688f96 100644
--- a/gcc/tree-ssa-threadbackward.c
+++ b/gcc/tree-ssa-threadbackward.c
@@ -29,7 +29,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-ssa-threadupdate.h"
-#include "params.h"
#include "tree-ssa-loop.h"
#include "cfganal.h"
#include "tree-pass.h"
diff --git a/gcc/tree-ssa-threadedge.c b/gcc/tree-ssa-threadedge.c
index c43d7c5c39e..1818895acb5 100644
--- a/gcc/tree-ssa-threadedge.c
+++ b/gcc/tree-ssa-threadedge.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-ssa-threadupdate.h"
-#include "params.h"
#include "tree-ssa-scopedtables.h"
#include "tree-ssa-threadedge.h"
#include "tree-ssa-dom.h"
diff --git a/gcc/tree-ssa-uninit.c b/gcc/tree-ssa-uninit.c
index ae441067789..1d911d2fbba 100644
--- a/gcc/tree-ssa-uninit.c
+++ b/gcc/tree-ssa-uninit.c
@@ -31,7 +31,6 @@ along with GCC; see the file COPYING3. If not see
#include "fold-const.h"
#include "gimple-iterator.h"
#include "tree-ssa.h"
-#include "params.h"
#include "tree-cfg.h"
#include "cfghooks.h"
diff --git a/gcc/tree-switch-conversion.c b/gcc/tree-switch-conversion.c
index 166e40c3931..af4fd5e33bd 100644
--- a/gcc/tree-switch-conversion.c
+++ b/gcc/tree-switch-conversion.c
@@ -36,7 +36,6 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
#include "optabs-tree.h"
#include "cgraph.h"
#include "gimple-pretty-print.h"
-#include "params.h"
#include "fold-const.h"
#include "varasm.h"
#include "stor-layout.h"
diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c
index 12d8a96b879..1e579b215a6 100644
--- a/gcc/tree-vect-data-refs.c
+++ b/gcc/tree-vect-data-refs.c
@@ -49,7 +49,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-vectorizer.h"
#include "expr.h"
#include "builtins.h"
-#include "params.h"
#include "tree-cfg.h"
#include "tree-hash-traits.h"
#include "vec-perm-indices.h"
diff --git a/gcc/tree-vect-loop.c b/gcc/tree-vect-loop.c
index d55d0e3158f..31a35bc10f3 100644
--- a/gcc/tree-vect-loop.c
+++ b/gcc/tree-vect-loop.c
@@ -43,7 +43,6 @@ along with GCC; see the file COPYING3. If not see
#include "tree-ssa-loop-niter.h"
#include "tree-ssa-loop.h"
#include "cfgloop.h"
-#include "params.h"
#include "tree-scalar-evolution.h"
#include "tree-vectorizer.h"
#include "gimple-fold.h"
diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c
index 9d3d991e516..4bc0cc77de4 100644
--- a/gcc/tree-vect-slp.c
+++ b/gcc/tree-vect-slp.c
@@ -32,7 +32,6 @@ along with GCC; see the file COPYING3. If not see
#include "optabs-tree.h"
#include "insn-config.h"
#include "recog.h" /* FIXME: for insn_data */
-#include "params.h"
#include "fold-const.h"
#include "stor-layout.h"
#include "gimple-iterator.h"
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c
index 21877c11c65..5c39d420abf 100644
--- a/gcc/tree-vrp.c
+++ b/gcc/tree-vrp.c
@@ -59,7 +59,6 @@ along with GCC; see the file COPYING3. If not see
#include "omp-general.h"
#include "target.h"
#include "case-cfn-macros.h"
-#include "params.h"
#include "alloc-pool.h"
#include "domwalk.h"
#include "tree-cfgcleanup.h"
diff --git a/gcc/tree.c b/gcc/tree.c
index ecc18b393a4..3f1474a1de7 100644
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -54,7 +54,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-iterator.h"
#include "gimplify.h"
#include "tree-dfa.h"
-#include "params.h"
#include "langhooks-def.h"
#include "tree-diagnostic.h"
#include "except.h"
diff --git a/gcc/value-prof.c b/gcc/value-prof.c
index 55ea0973a03..0f9bebcbb58 100644
--- a/gcc/value-prof.c
+++ b/gcc/value-prof.c
@@ -42,7 +42,6 @@ along with GCC; see the file COPYING3. If not see
#include "gimple-pretty-print.h"
#include "dumpfile.h"
#include "builtins.h"
-#include "params.h"
/* In this file value profile based optimizations are placed. Currently the
following optimizations are implemented (for more detailed descriptions
diff --git a/gcc/var-tracking.c b/gcc/var-tracking.c
index c80a06c92b7..88cc1a93027 100644
--- a/gcc/var-tracking.c
+++ b/gcc/var-tracking.c
@@ -111,7 +111,6 @@
#include "tree-dfa.h"
#include "tree-ssa.h"
#include "cselib.h"
-#include "params.h"
#include "tree-pretty-print.h"
#include "rtl-iter.h"
#include "fibonacci_heap.h"
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 6/7] Remove set_default_param_value from documentation.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (2 preceding siblings ...)
2019-11-07 12:33 ` [PATCH 4/7] Remove gcc/params.* files Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-07 12:33 ` [PATCH 1/7] Param to options conversion Martin Liska
` (4 subsequent siblings)
8 siblings, 0 replies; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 327 bytes --]
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* common/common-target.def:
Do not mention set_default_param_value
and set_param_value.
* doc/tm.texi: Likewise.
---
gcc/common/common-target.def | 6 ++----
gcc/doc/tm.texi | 4 ++--
2 files changed, 4 insertions(+), 6 deletions(-)
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0006-Remove-set_default_param_value-from-documentation.patch --]
[-- Type: text/x-patch; name="0006-Remove-set_default_param_value-from-documentation.patch", Size: 1582 bytes --]
diff --git a/gcc/common/common-target.def b/gcc/common/common-target.def
index 41b7e704c2e..48096720e44 100644
--- a/gcc/common/common-target.def
+++ b/gcc/common/common-target.def
@@ -51,15 +51,13 @@ DEFHOOKPOD
DEFHOOK
(option_default_params,
-"Set target-dependent default values for @option{--param} settings, using\
- calls to @code{set_default_param_value}.",
+"Set target-dependent default values for @option{--param} settings.",
void, (void),
hook_void_void)
DEFHOOK
(option_validate_param,
-"Validate target-dependent value for @option{--param} settings, using\
- calls to @code{set_param_value}.",
+"Validate target-dependent value for @option{--param} settings.",
bool, (int, int),
default_option_validate_param)
diff --git a/gcc/doc/tm.texi b/gcc/doc/tm.texi
index cd9aed9874f..f6bc31bef65 100644
--- a/gcc/doc/tm.texi
+++ b/gcc/doc/tm.texi
@@ -759,11 +759,11 @@ Set target-dependent initial values of fields in @var{opts}.
@end deftypefn
@deftypefn {Common Target Hook} void TARGET_OPTION_DEFAULT_PARAMS (void)
-Set target-dependent default values for @option{--param} settings, using calls to @code{set_default_param_value}.
+Set target-dependent default values for @option{--param} settings.
@end deftypefn
@deftypefn {Common Target Hook} bool TARGET_OPTION_VALIDATE_PARAM (int, @var{int})
-Validate target-dependent value for @option{--param} settings, using calls to @code{set_param_value}.
+Validate target-dependent value for @option{--param} settings.
@end deftypefn
@defmac SWITCHABLE_TARGET
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 5/7] Remove last leftover usage of params* files.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-12 15:45 ` Harwath, Frederik
2019-11-07 12:33 ` [PATCH 2/7] Include new generated gcc/params.opt file Martin Liska
` (7 subsequent siblings)
8 siblings, 1 reply; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 1545 bytes --]
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* common.opt: Remove param_values.
* config/i386/i386-options.c (ix86_valid_target_attribute_p):
Remove finalize_options_struct.
* gcc.c (driver::decode_argv): Do not call global_init_params
and finish_params.
(driver::finalize): Do not call params_c_finalize
and finalize_options_struct.
* opt-suggestions.c (option_proposer::get_completions): Remove
special casing of params.
(option_proposer::find_param_completions): Remove.
(test_completion_partial_match): Update expected output.
* opt-suggestions.h: Remove find_param_completions.
* opts-common.c (add_misspelling_candidates): Add
--param with a space.
* opts.c (handle_param): Remove.
(init_options_struct):. Remove init_options_struct and
similar calls.
(finalize_options_struct): Remove.
(common_handle_option): Use SET_OPTION_IF_UNSET.
* opts.h (finalize_options_struct): Remove.
* toplev.c (general_init): Do not call global_init_params.
(toplev::finalize): Do not call params_c_finalize and
finalize_options_struct.
---
gcc/common.opt | 3 --
gcc/config/i386/i386-options.c | 2 -
gcc/gcc.c | 8 ----
gcc/opt-suggestions.c | 58 ++++++---------------------
gcc/opt-suggestions.h | 5 ---
gcc/opts-common.c | 11 ++++++
gcc/opts.c | 71 ++--------------------------------
gcc/opts.h | 1 -
gcc/toplev.c | 8 ----
9 files changed, 27 insertions(+), 140 deletions(-)
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0005-Remove-last-leftover-usage-of-params-files.patch --]
[-- Type: text/x-patch; name="0005-Remove-last-leftover-usage-of-params-files.patch", Size: 11620 bytes --]
diff --git a/gcc/common.opt b/gcc/common.opt
index 8c6acabb1fc..26b6c2ce9e1 100644
--- a/gcc/common.opt
+++ b/gcc/common.opt
@@ -63,9 +63,6 @@ int flag_complex_method = 1
Variable
bool flag_warn_unused_result = false
-Variable
-int *param_values
-
; Nonzero if we should write GIMPLE bytecode for link-time optimization.
Variable
int flag_generate_lto
diff --git a/gcc/config/i386/i386-options.c b/gcc/config/i386/i386-options.c
index 1e3280d1bb9..c909f8ea1ed 100644
--- a/gcc/config/i386/i386-options.c
+++ b/gcc/config/i386/i386-options.c
@@ -1340,8 +1340,6 @@ ix86_valid_target_attribute_p (tree fndecl,
DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl) = new_optimize;
}
- finalize_options_struct (&func_options);
-
return ret;
}
diff --git a/gcc/gcc.c b/gcc/gcc.c
index 159ffe7cb53..539ded01ce6 100644
--- a/gcc/gcc.c
+++ b/gcc/gcc.c
@@ -7422,10 +7422,6 @@ driver::expand_at_files (int *argc, char ***argv) const
void
driver::decode_argv (int argc, const char **argv)
{
- /* Register the language-independent parameters. */
- global_init_params ();
- finish_params ();
-
init_opts_obstack ();
init_options_struct (&global_options, &global_options_set);
@@ -10113,7 +10109,6 @@ void
driver::finalize ()
{
env.restore ();
- params_c_finalize ();
diagnostic_finish (global_dc);
is_cpp_driver = 0;
@@ -10134,9 +10129,6 @@ driver::finalize ()
spec_machine = DEFAULT_TARGET_MACHINE;
greatest_status = 1;
- finalize_options_struct (&global_options);
- finalize_options_struct (&global_options_set);
-
obstack_free (&obstack, NULL);
obstack_free (&opts_obstack, NULL); /* in opts.c */
obstack_free (&collect_obstack, NULL);
diff --git a/gcc/opt-suggestions.c b/gcc/opt-suggestions.c
index 609e60bd20a..01ce331eb0e 100644
--- a/gcc/opt-suggestions.c
+++ b/gcc/opt-suggestions.c
@@ -64,32 +64,17 @@ option_proposer::get_completions (const char *option_prefix,
size_t length = strlen (option_prefix);
- /* Handle OPTION_PREFIX starting with "-param". */
- const char *prefix = "-param";
- if (length >= strlen (prefix)
- && strstr (option_prefix, prefix) == option_prefix)
- {
- /* We support both '-param-xyz=123' and '-param xyz=123' */
- option_prefix += strlen (prefix);
- char separator = option_prefix[0];
- option_prefix++;
- if (separator == ' ' || separator == '=')
- find_param_completions (separator, option_prefix, results);
- }
- else
- {
- /* Lazily populate m_option_suggestions. */
- if (!m_option_suggestions)
- build_option_suggestions (option_prefix);
- gcc_assert (m_option_suggestions);
+ /* Lazily populate m_option_suggestions. */
+ if (!m_option_suggestions)
+ build_option_suggestions (option_prefix);
+ gcc_assert (m_option_suggestions);
- for (unsigned i = 0; i < m_option_suggestions->length (); i++)
- {
- char *candidate = (*m_option_suggestions)[i];
- if (strlen (candidate) >= length
- && strstr (candidate, option_prefix) == candidate)
- results.safe_push (concat ("-", candidate, NULL));
- }
+ for (unsigned i = 0; i < m_option_suggestions->length (); i++)
+ {
+ char *candidate = (*m_option_suggestions)[i];
+ if (strlen (candidate) >= length
+ && strstr (candidate, option_prefix) == candidate)
+ results.safe_push (concat ("-", candidate, NULL));
}
}
@@ -212,25 +197,6 @@ option_proposer::build_option_suggestions (const char *prefix)
}
}
-/* Find parameter completions for --param format with SEPARATOR.
- Again, save the completions into results. */
-
-void
-option_proposer::find_param_completions (const char separator,
- const char *param_prefix,
- auto_string_vec &results)
-{
- char separator_str[] = {separator, '\0'};
- size_t length = strlen (param_prefix);
- for (unsigned i = 0; i < get_num_compiler_params (); ++i)
- {
- const char *candidate = compiler_params[i].option;
- if (strlen (candidate) >= length
- && strstr (candidate, param_prefix) == candidate)
- results.safe_push (concat ("--param", separator_str, candidate, NULL));
- }
-}
-
#if CHECKING_P
namespace selftest {
@@ -400,9 +366,9 @@ test_completion_partial_match (option_proposer &proposer)
ASSERT_TRUE (in_completion_p (proposer, "-fipa-icf", "-fipa-icf-functions"));
ASSERT_TRUE (in_completion_p (proposer, "-fipa-icf", "-fipa-icf"));
ASSERT_TRUE (in_completion_p (proposer, "--param=",
- "--param=max-vartrack-reverse-op-size"));
+ "--param=max-vartrack-reverse-op-size="));
ASSERT_TRUE (in_completion_p (proposer, "--param ",
- "--param max-vartrack-reverse-op-size"));
+ "--param max-vartrack-reverse-op-size="));
ASSERT_FALSE (in_completion_p (proposer, "-fipa-icf", "-fipa"));
ASSERT_FALSE (in_completion_p (proposer, "-fipa-icf-functions", "-fipa-icf"));
diff --git a/gcc/opt-suggestions.h b/gcc/opt-suggestions.h
index 8d24833c0ed..93f65bea3bb 100644
--- a/gcc/opt-suggestions.h
+++ b/gcc/opt-suggestions.h
@@ -63,11 +63,6 @@ private:
it's set to NULL. */
void build_option_suggestions (const char *prefix);
- /* Find parameter completions for --param format with SEPARATOR.
- Again, save the completions into results. */
- void find_param_completions (const char separator, const char *param_prefix,
- auto_string_vec &results);
-
private:
/* Cache with all suggestions. */
auto_string_vec *m_option_suggestions;
diff --git a/gcc/opts-common.c b/gcc/opts-common.c
index d55dc93e165..51e08d4f44c 100644
--- a/gcc/opts-common.c
+++ b/gcc/opts-common.c
@@ -510,6 +510,17 @@ add_misspelling_candidates (auto_vec<char *> *candidates,
candidates->safe_push (alternative);
}
}
+
+ /* For all params (e.g. --param=key=value),
+ include also '--param key=value'. */
+ const char *prefix = "--param=";
+ if (strstr (opt_text, prefix) == opt_text)
+ {
+ char *param = xstrdup (opt_text + 1);
+ gcc_assert (param[6] == '=');
+ param[6] = ' ';
+ candidates->safe_push (param);
+ }
}
/* Decode the switch beginning at ARGV for the language indicated by
diff --git a/gcc/opts.c b/gcc/opts.c
index f9c6f20c025..879b2100071 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -188,9 +188,6 @@ static const char use_diagnosed_msg[] = N_("Uses of this option are diagnosed.")
typedef char *char_p; /* For DEF_VEC_P. */
-static void handle_param (struct gcc_options *opts,
- struct gcc_options *opts_set, location_t loc,
- const char *carg);
static void set_debug_level (enum debug_info_type type, int extended,
const char *arg, struct gcc_options *opts,
struct gcc_options *opts_set,
@@ -283,8 +280,6 @@ init_opts_obstack (void)
void
init_options_struct (struct gcc_options *opts, struct gcc_options *opts_set)
{
- size_t num_params = get_num_compiler_params ();
-
/* Ensure that opts_obstack has already been initialized by the time
that we initialize any gcc_options instances (PR jit/68446). */
gcc_assert (opts_obstack.chunk_size > 0);
@@ -294,13 +289,6 @@ init_options_struct (struct gcc_options *opts, struct gcc_options *opts_set)
if (opts_set)
memset (opts_set, 0, sizeof (*opts_set));
- opts->x_param_values = XNEWVEC (int, num_params);
-
- if (opts_set)
- opts_set->x_param_values = XCNEWVEC (int, num_params);
-
- init_param_values (opts->x_param_values);
-
/* Initialize whether `char' is signed. */
opts->x_flag_signed_char = DEFAULT_SIGNED_CHAR;
/* Set this to a special "uninitialized" value. The actual default
@@ -318,14 +306,6 @@ init_options_struct (struct gcc_options *opts, struct gcc_options *opts_set)
targetm_common.option_init_struct (opts);
}
-/* Release any allocations owned by OPTS. */
-
-void
-finalize_options_struct (struct gcc_options *opts)
-{
- XDELETEVEC (opts->x_param_values);
-}
-
/* If indicated by the optimization level LEVEL (-Os if SIZE is set,
-Ofast if FAST is set, -Og if DEBUG is set), apply the option DEFAULT_OPT
to OPTS and OPTS_SET, diagnostic context DC, location LOC, with language
@@ -2465,10 +2445,10 @@ common_handle_option (struct gcc_options *opts,
break;
case OPT_finline_limit_:
- set_param_value ("max-inline-insns-single", value / 2,
- opts->x_param_values, opts_set->x_param_values);
- set_param_value ("max-inline-insns-auto", value / 2,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_inline_insns_single,
+ value / 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_inline_insns_auto,
+ value / 2);
break;
case OPT_finstrument_functions_exclude_function_list_:
@@ -2836,49 +2816,6 @@ common_handle_option (struct gcc_options *opts,
return true;
}
-/* Handle --param NAME=VALUE. */
-static void
-handle_param (struct gcc_options *opts, struct gcc_options *opts_set,
- location_t loc, const char *carg)
-{
- char *equal, *arg;
- int value;
-
- arg = xstrdup (carg);
- equal = strchr (arg, '=');
- if (!equal)
- error_at (loc, "%s: %qs arguments should be of the form NAME=VALUE",
- arg, "--param");
- else
- {
- *equal = '\0';
-
- enum compiler_param index;
- if (!find_param (arg, &index))
- {
- const char *suggestion = find_param_fuzzy (arg);
- if (suggestion)
- error_at (loc, "invalid %qs name %qs; did you mean %qs?",
- "--param", arg, suggestion);
- else
- error_at (loc, "invalid %qs name %qs", "--param", arg);
- }
- else
- {
- if (!param_string_value_p (index, equal + 1, &value))
- value = integral_argument (equal + 1);
-
- if (value == -1)
- error_at (loc, "invalid %qs value %qs", "--param", equal + 1);
- else
- set_param_value (arg, value,
- opts->x_param_values, opts_set->x_param_values);
- }
- }
-
- free (arg);
-}
-
/* Used to set the level of strict aliasing warnings in OPTS,
when no level is specified (i.e., when -Wstrict-aliasing, and not
-Wstrict-aliasing=level was given).
diff --git a/gcc/opts.h b/gcc/opts.h
index 0de8e4269db..b6173986b20 100644
--- a/gcc/opts.h
+++ b/gcc/opts.h
@@ -345,7 +345,6 @@ extern void init_options_once (void);
extern void init_options_struct (struct gcc_options *opts,
struct gcc_options *opts_set);
extern void init_opts_obstack (void);
-extern void finalize_options_struct (struct gcc_options *opts);
extern void decode_cmdline_options_to_array_default_mask (unsigned int argc,
const char **argv,
struct cl_decoded_option **decoded_options,
diff --git a/gcc/toplev.c b/gcc/toplev.c
index 513e4e066b7..d4583bac66c 100644
--- a/gcc/toplev.c
+++ b/gcc/toplev.c
@@ -1240,9 +1240,6 @@ general_init (const char *argv0, bool init_signals)
/* Initialize register usage now so switches may override. */
init_reg_sets ();
- /* Register the language-independent parameters. */
- global_init_params ();
-
/* This must be done after global_init_params but before argument
processing. */
init_ggc_heuristics ();
@@ -1262,7 +1259,6 @@ general_init (const char *argv0, bool init_signals)
statistics_early_init ();
debuginfo_early_init ();
- finish_params ();
}
/* Return true if the current target supports -fsection-anchors. */
@@ -2468,10 +2464,6 @@ toplev::finalize (void)
gcse_c_finalize ();
ipa_cp_c_finalize ();
ira_costs_c_finalize ();
- params_c_finalize ();
-
- finalize_options_struct (&global_options);
- finalize_options_struct (&global_options_set);
/* save_decoded_options uses opts_obstack, so these must
be cleaned up together. */
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 1/7] Param to options conversion.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (3 preceding siblings ...)
2019-11-07 12:33 ` [PATCH 6/7] Remove set_default_param_value from documentation Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-07 12:33 ` [PATCH 7/7] Fix test-suite fallout Martin Liska
` (3 subsequent siblings)
8 siblings, 0 replies; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 848 bytes --]
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* common.opt: Remove --param and --param= options.
* opt-functions.awk: Mark CL_PARAMS for options
that have Param keyword.
* opts-common.c (decode_cmdline_options_to_array):
Replace --param key=value with --param=key=value.
* opts.c (print_filtered_help): Remove special
printing of params.
(print_specific_help): Update title for params.
(common_handle_option): Do not handle OPT__param.
opts.h (SET_OPTION_IF_UNSET): New macro.
* doc/options.texi: Document Param keyword.
---
gcc/common.opt | 7 -------
gcc/doc/options.texi | 3 +++
gcc/opt-functions.awk | 3 ++-
gcc/opts-common.c | 9 +++++++++
gcc/opts.c | 38 +-------------------------------------
gcc/opts.h | 10 ++++++++++
6 files changed, 25 insertions(+), 45 deletions(-)
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0001-Param-to-options-conversion.patch --]
[-- Type: text/x-patch; name="0001-Param-to-options-conversion.patch", Size: 4467 bytes --]
diff --git a/gcc/common.opt b/gcc/common.opt
index 12c0083964e..8c6acabb1fc 100644
--- a/gcc/common.opt
+++ b/gcc/common.opt
@@ -437,13 +437,6 @@ Common Driver Alias(-target-help)
fversion
Common Driver Alias(-version)
--param
-Common Separate
---param <param>=<value> Set parameter <param> to value. See below for a complete list of parameters.
-
--param=
-Common Joined Alias(-param)
-
-sysroot
Driver Separate Alias(-sysroot=)
diff --git a/gcc/doc/options.texi b/gcc/doc/options.texi
index b59f4d39aef..c7c70acd526 100644
--- a/gcc/doc/options.texi
+++ b/gcc/doc/options.texi
@@ -475,6 +475,9 @@ affect executable code generation may use this flag instead, so that the
option is not taken into account in ways that might affect executable
code generation.
+@item Param
+This is an option that is a parameter.
+
@item Undocumented
The option is deliberately missing documentation and should not
be included in the @option{--help} output.
diff --git a/gcc/opt-functions.awk b/gcc/opt-functions.awk
index c1da80c648c..4f02b74e97c 100644
--- a/gcc/opt-functions.awk
+++ b/gcc/opt-functions.awk
@@ -105,7 +105,8 @@ function switch_flags (flags)
test_flag("Undocumented", flags, " | CL_UNDOCUMENTED") \
test_flag("NoDWARFRecord", flags, " | CL_NO_DWARF_RECORD") \
test_flag("Warning", flags, " | CL_WARNING") \
- test_flag("(Optimization|PerFunction)", flags, " | CL_OPTIMIZATION")
+ test_flag("(Optimization|PerFunction)", flags, " | CL_OPTIMIZATION") \
+ test_flag("Param", flags, " | CL_PARAMS")
sub( "^0 \\| ", "", result )
return result
}
diff --git a/gcc/opts-common.c b/gcc/opts-common.c
index b4ec1bd25ac..d55dc93e165 100644
--- a/gcc/opts-common.c
+++ b/gcc/opts-common.c
@@ -961,6 +961,15 @@ decode_cmdline_options_to_array (unsigned int argc, const char **argv,
continue;
}
+ /* Interpret "--param" "key=name" as "--param=key=name". */
+ const char *needle = "--param";
+ if (i + 1 < argc && strcmp (opt, needle) == 0)
+ {
+ const char *replacement
+ = opts_concat (needle, "=", argv[i + 1], NULL);
+ argv[++i] = replacement;
+ }
+
n = decode_cmdline_option (argv + i, lang_mask,
&opt_array[num_decoded_options]);
num_decoded_options++;
diff --git a/gcc/opts.c b/gcc/opts.c
index f46b468a968..394cbfd1c56 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -1278,38 +1278,6 @@ print_filtered_help (unsigned int include_flags,
bool displayed = false;
char new_help[256];
- if (include_flags == CL_PARAMS)
- {
- for (i = 0; i < LAST_PARAM; i++)
- {
- const char *param = compiler_params[i].option;
-
- help = compiler_params[i].help;
- if (help == NULL || *help == '\0')
- {
- if (exclude_flags & CL_UNDOCUMENTED)
- continue;
- help = undocumented_msg;
- }
-
- /* Get the translation. */
- help = _(help);
-
- if (!opts->x_quiet_flag)
- {
- snprintf (new_help, sizeof (new_help),
- _("default %d minimum %d maximum %d"),
- compiler_params[i].default_value,
- compiler_params[i].min_value,
- compiler_params[i].max_value);
- help = new_help;
- }
- wrap_help (help, param, strlen (param), columns);
- }
- putchar ('\n');
- return;
- }
-
if (!opts->x_help_printed)
opts->x_help_printed = XCNEWVAR (char, cl_options_count);
@@ -1679,7 +1647,7 @@ print_specific_help (unsigned int include_flags,
description = _("The following options are language-independent");
break;
case CL_PARAMS:
- description = _("The --param option recognizes the following as parameters");
+ description = _("The following options control parameters");
break;
default:
if (i >= cl_lang_count)
@@ -2241,10 +2209,6 @@ common_handle_option (struct gcc_options *opts,
switch (code)
{
- case OPT__param:
- handle_param (opts, opts_set, loc, arg);
- break;
-
case OPT__help:
{
unsigned int all_langs_mask = (1U << cl_lang_count) - 1;
diff --git a/gcc/opts.h b/gcc/opts.h
index 47223229388..0de8e4269db 100644
--- a/gcc/opts.h
+++ b/gcc/opts.h
@@ -461,4 +461,14 @@ extern bool parse_and_check_align_values (const char *flag,
bool report_error,
location_t loc);
+/* Set OPTION in OPTS to VALUE if the option is not set in OPTS_SET. */
+
+#define SET_OPTION_IF_UNSET(OPTS, OPTS_SET, OPTION, VALUE) \
+ do \
+ { \
+ if (!(OPTS_SET)->x_ ## OPTION) \
+ (OPTS)->x_ ## OPTION = VALUE; \
+ } \
+ while (false)
+
#endif
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 7/7] Fix test-suite fallout.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (4 preceding siblings ...)
2019-11-07 12:33 ` [PATCH 1/7] Param to options conversion Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-07 12:34 ` [PATCH 3/7] Apply mechanical replacement (generated patch) Martin Liska
` (2 subsequent siblings)
8 siblings, 0 replies; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 669 bytes --]
gcc/testsuite/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* gcc.dg/completion-3.c: Append = to all expected
results and sort expected output.
* gcc.dg/pr83620.c: Update error message.
* gcc.dg/spellcheck-params-2.c: Likewise.
* gcc.dg/spellcheck-params.c: Likewise.
* gcc.misc-tests/help.exp: Update expected output.
---
gcc/testsuite/gcc.dg/completion-3.c | 16 ++++++++--------
gcc/testsuite/gcc.dg/pr83620.c | 2 +-
gcc/testsuite/gcc.dg/spellcheck-params-2.c | 2 +-
gcc/testsuite/gcc.dg/spellcheck-params.c | 2 +-
gcc/testsuite/gcc.misc-tests/help.exp | 4 +---
5 files changed, 12 insertions(+), 14 deletions(-)
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0007-Fix-test-suite-fallout.patch --]
[-- Type: text/x-patch; name="0007-Fix-test-suite-fallout.patch", Size: 3835 bytes --]
diff --git a/gcc/testsuite/gcc.dg/completion-3.c b/gcc/testsuite/gcc.dg/completion-3.c
index 3c4a89ffdd5..a240993dd45 100644
--- a/gcc/testsuite/gcc.dg/completion-3.c
+++ b/gcc/testsuite/gcc.dg/completion-3.c
@@ -2,12 +2,12 @@
/* { dg-options "--completion=--param=asan-" } */
/* { dg-begin-multiline-output "" }
---param=asan-stack
---param=asan-instrument-allocas
---param=asan-globals
---param=asan-instrument-writes
---param=asan-instrument-reads
---param=asan-memintrin
---param=asan-use-after-return
---param=asan-instrumentation-with-call-threshold
+--param=asan-globals=
+--param=asan-instrument-allocas=
+--param=asan-instrument-reads=
+--param=asan-instrument-writes=
+--param=asan-instrumentation-with-call-threshold=
+--param=asan-memintrin=
+--param=asan-stack=
+--param=asan-use-after-return=
{ dg-end-multiline-output "" } */
diff --git a/gcc/testsuite/gcc.dg/pr83620.c b/gcc/testsuite/gcc.dg/pr83620.c
index e0e44a3b421..cf6eb91197f 100644
--- a/gcc/testsuite/gcc.dg/pr83620.c
+++ b/gcc/testsuite/gcc.dg/pr83620.c
@@ -1,7 +1,7 @@
/* PR rtl-optimization/86620 */
/* { dg-do compile } */
/* { dg-options "-O2 -flive-range-shrinkage --param=max-sched-ready-insns=0" } */
-/* { dg-error "minimum value of parameter 'max-sched-ready-insns' is 1" "" { target *-*-* } 0 } */
+/* { dg-error "argument to '--param=max-sched-ready-insns=' is not between 1 and 65536" "" { target *-*-* } 0 } */
void
foo (void)
diff --git a/gcc/testsuite/gcc.dg/spellcheck-params-2.c b/gcc/testsuite/gcc.dg/spellcheck-params-2.c
index 8187de43481..0f56241f48f 100644
--- a/gcc/testsuite/gcc.dg/spellcheck-params-2.c
+++ b/gcc/testsuite/gcc.dg/spellcheck-params-2.c
@@ -1,4 +1,4 @@
/* { dg-do compile } */
/* { dg-options "--param does-not-resemble-anything=42" } */
-/* { dg-error "invalid '--param' name 'does-not-resemble-anything'" "" { target *-*-* } 0 } */
+/* { dg-error "unrecognized command-line option '--param=does-not-resemble-anything=42'" "" { target *-*-* } 0 } */
diff --git a/gcc/testsuite/gcc.dg/spellcheck-params.c b/gcc/testsuite/gcc.dg/spellcheck-params.c
index 01e1343ab9e..4010a5df0d2 100644
--- a/gcc/testsuite/gcc.dg/spellcheck-params.c
+++ b/gcc/testsuite/gcc.dg/spellcheck-params.c
@@ -1,4 +1,4 @@
/* { dg-do compile } */
/* { dg-options "--param max-early-inliner-iteration=3" } */
-/* { dg-error "invalid '--param' name 'max-early-inliner-iteration'; did you mean 'max-early-inliner-iterations'?" "" { target *-*-* } 0 } */
+/* { dg-error "unrecognized command-line option '--param=max-early-inliner-iteration=3'; did you mean '--param=max-early-inliner-iterations='?" "" { target *-*-* } 0 } */
diff --git a/gcc/testsuite/gcc.misc-tests/help.exp b/gcc/testsuite/gcc.misc-tests/help.exp
index 4bb359f698d..60e794b1f46 100644
--- a/gcc/testsuite/gcc.misc-tests/help.exp
+++ b/gcc/testsuite/gcc.misc-tests/help.exp
@@ -64,7 +64,7 @@ check_for_options c "-v --help" "" {are likely to\n -std} ""
check_for_options c "--help=optimizers" "-O" " -g " ""
check_for_options c "--help=params" "maximum number of" "-Wunsafe-loop-optimizations" ""
check_for_options_with_filter c "--help=params" \
- "^The --param option recognizes the following as parameters:$" "" {[^.]$} ""
+ "^The following options control parameters:$" "" {[^.]$} ""
check_for_options c "--help=C" "-ansi" "-gnatO" ""
check_for_options c {--help=C++} {-std=c\+\+} "-gnatO" ""
check_for_options c "--help=common" "-dumpbase" "-gnatO" ""
@@ -133,8 +133,6 @@ check_for_options c "--help=warnings,^joined" \
"^ +-Wtrigraphs" "^ +-Wformat=" ""
check_for_options c "--help=joined,separate" \
"^ +-I" "" ""
-check_for_options c "--help=^joined,separate" \
- "^ +--param " "" ""
check_for_options c "--help=joined,^separate" \
"^ +--help=" "" ""
check_for_options c "--help=joined,undocumented" "" "" ""
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
2019-11-07 12:33 ` [PATCH 5/7] Remove last leftover usage of params* files Martin Liska
@ 2019-11-07 12:33 ` Martin Liska
2019-11-20 14:51 ` David Malcolm
2019-11-07 12:33 ` [PATCH 4/7] Remove gcc/params.* files Martin Liska
` (6 subsequent siblings)
8 siblings, 1 reply; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:33 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 433 bytes --]
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* Makefile.in: Include params.opt.
* flag-types.h (enum parloops_schedule_type): Add
parloops_schedule_type used in params.opt.
* params.opt: New file.
---
gcc/Makefile.in | 2 +-
gcc/flag-types.h | 11 +
gcc/params.opt | 967 +++++++++++++++++++++++++++++++++++++++++++++++
3 files changed, 979 insertions(+), 1 deletion(-)
create mode 100644 gcc/params.opt
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0002-Include-new-generated-gcc-params.opt-file.patch --]
[-- Type: text/x-patch; name="0002-Include-new-generated-gcc-params.opt-file.patch", Size: 51093 bytes --]
diff --git a/gcc/Makefile.in b/gcc/Makefile.in
index 95f054c4d4f..ed47a346689 100644
--- a/gcc/Makefile.in
+++ b/gcc/Makefile.in
@@ -567,7 +567,7 @@ xm_include_list=@xm_include_list@
xm_defines=@xm_defines@
lang_checks=
lang_checks_parallelized=
-lang_opt_files=@lang_opt_files@ $(srcdir)/c-family/c.opt $(srcdir)/common.opt
+lang_opt_files=@lang_opt_files@ $(srcdir)/c-family/c.opt $(srcdir)/common.opt $(srcdir)/params.opt
lang_specs_files=@lang_specs_files@
lang_tree_files=@lang_tree_files@
target_cpu_default=@target_cpu_default@
diff --git a/gcc/flag-types.h b/gcc/flag-types.h
index b23d3a271f1..0c23aadefed 100644
--- a/gcc/flag-types.h
+++ b/gcc/flag-types.h
@@ -370,4 +370,15 @@ enum cf_protection_level
CF_FULL = CF_BRANCH | CF_RETURN,
CF_SET = 1 << 2
};
+
+/* Parloops schedule type. */
+enum parloops_schedule_type
+{
+ PARLOOPS_SCHEDULE_STATIC = 0,
+ PARLOOPS_SCHEDULE_DYNAMIC,
+ PARLOOPS_SCHEDULE_GUIDED,
+ PARLOOPS_SCHEDULE_AUTO,
+ PARLOOPS_SCHEDULE_RUNTIME
+};
+
#endif /* ! GCC_FLAG_TYPES_H */
diff --git a/gcc/params.opt b/gcc/params.opt
new file mode 100644
index 00000000000..7f2f8610c40
--- /dev/null
+++ b/gcc/params.opt
@@ -0,0 +1,967 @@
+; Parameter options of the compiler.
+
+; Copyright (C) 2019 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
+; Software Foundation; either version 3, or (at your option) any later
+; version.
+;
+; GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+; WARRANTY; without even the implied warranty of MERCHANTABILITY or
+; FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+; for more details.
+;
+; You should have received a copy of the GNU General Public License
+; along with GCC; see the file COPYING3. If not see
+; <http://www.gnu.org/licenses/>.
+
+; See the GCC internals manual (options.texi) for a description of this file's format.
+
+; Please try to keep this file in ASCII collating order.
+
+-param=align-loop-iterations=
+Common Joined UInteger Var(param_align_loop_iterations) Optimization Init(4) Param
+Loops iterating at least selected number of iterations will get loop alignment.
+
+-param=align-threshold=
+Common Joined UInteger Var(param_align_threshold) Optimization Init(100) IntegerRange(1, 65536) Param
+Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment.
+
+-param=asan-globals=
+Common Joined UInteger Var(param_asan_globals) Init(1) IntegerRange(0, 1) Param
+Enable asan globals protection.
+
+-param=asan-instrument-allocas=
+Common Joined UInteger Var(param_asan_protect_allocas) Init(1) IntegerRange(0, 1) Param
+Enable asan allocas/VLAs protection.
+
+-param=asan-instrument-reads=
+Common Joined UInteger Var(param_asan_instrument_reads) Init(1) IntegerRange(0, 1) Param
+Enable asan load operations protection.
+
+-param=asan-instrument-writes=
+Common Joined UInteger Var(param_asan_instrument_writes) Init(1) IntegerRange(0, 1) Param
+Enable asan store operations protection.
+
+-param=asan-instrumentation-with-call-threshold=
+Common Joined UInteger Var(param_asan_instrumentation_with_call_threshold) Optimization Init(7000) Param
+Use callbacks instead of inline code if number of accesses in function becomes greater or equal to this number.
+
+-param=asan-memintrin=
+Common Joined UInteger Var(param_asan_memintrin) Init(1) IntegerRange(0, 1) Param
+Enable asan builtin functions protection.
+
+-param=asan-stack=
+Common Joined UInteger Var(param_asan_stack) Init(1) IntegerRange(0, 1) Param
+Enable asan stack protection.
+
+-param=asan-use-after-return=
+Common Joined UInteger Var(param_asan_use_after_return) Init(1) IntegerRange(0, 1) Param
+Enable asan detection of use-after-return bugs.
+
+-param=avg-loop-niter=
+Common Joined UInteger Var(param_avg_loop_niter) Optimization Init(10) IntegerRange(1, 65536) Param
+Average number of iterations of a loop.
+
+-param=avoid-fma-max-bits=
+Common Joined UInteger Var(param_avoid_fma_max_bits) Optimization IntegerRange(0, 512) Param
+Maximum number of bits for which we avoid creating FMAs.
+
+-param=builtin-expect-probability=
+Common Joined UInteger Var(param_builtin_expect_probability) Optimization Init(90) IntegerRange(0, 100) Param
+Set the estimated probability in percentage for builtin expect. The default value is 90% probability.
+
+-param=builtin-string-cmp-inline-length=
+Common Joined UInteger Var(param_builtin_string_cmp_inline_length) Optimization Init(3) IntegerRange(0, 100) Param
+The maximum length of a constant string for a builtin string cmp call eligible for inlining. The default value is 3.
+
+-param=case-values-threshold=
+Common Joined UInteger Var(param_case_values_threshold) Optimization Param
+The smallest number of different values for which it is best to use a jump-table instead of a tree of conditional branches, if 0, use the default for the machine.
+
+-param=comdat-sharing-probability=
+Common Joined UInteger Var(param_comdat_sharing_probability) Init(20) Param
+Probability that COMDAT function will be shared with different compilation unit.
+
+-param=cxx-max-namespaces-for-diagnostic-help=
+Common Joined UInteger Var(param_cxx_max_namespaces_for_diagnostic_help) Init(1000) Param
+Maximum number of namespaces to search for alternatives when name lookup fails.
+
+-param=dse-max-alias-queries-per-store=
+Common Joined UInteger Var(param_dse_max_alias_queries_per_store) Optimization Init(256) Param
+Maximum number of queries into the alias oracle per store.
+
+-param=dse-max-object-size=
+Common Joined UInteger Var(param_dse_max_object_size) Optimization Init(256) Param
+Maximum size (in bytes) of objects tracked bytewise by dead store elimination.
+
+-param=early-inlining-insns=
+Common Joined UInteger Var(param_early_inlining_insns) Init(14) Param
+Maximal estimated growth of function body caused by early inlining of single call with -O3 and -Ofast.
+
+-param=early-inlining-insns-O2=
+Common Joined UInteger Var(param_early_inlining_insns_o2) Init(6) Param
+Maximal estimated growth of function body caused by early inlining of single call with -O1 and -O2.
+
+-param=fsm-maximum-phi-arguments=
+Common Joined UInteger Var(param_fsm_maximum_phi_arguments) Optimization Init(100) IntegerRange(1, 999999) Param
+Maximum number of arguments a PHI may have before the FSM threader will not try to thread through its block.
+
+-param=fsm-scale-path-blocks=
+Common Joined UInteger Var(param_fsm_scale_path_blocks) Optimization Init(3) IntegerRange(1, 10) Param
+Scale factor to apply to the number of blocks in a threading path when comparing to the number of (scaled) statements.
+
+-param=fsm-scale-path-stmts=
+Common Joined UInteger Var(param_fsm_scale_path_stmts) Optimization Init(2) IntegerRange(1, 10) Param
+Scale factor to apply to the number of statements in a threading path when comparing to the number of (scaled) blocks.
+
+-param=gcse-after-reload-critical-fraction=
+Common Joined UInteger Var(param_gcse_after_reload_critical_fraction) Optimization Init(10) Param
+The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload.
+
+-param=gcse-after-reload-partial-fraction=
+Common Joined UInteger Var(param_gcse_after_reload_partial_fraction) Optimization Init(3) Param
+The threshold ratio for performing partial redundancy elimination after reload.
+
+-param=gcse-cost-distance-ratio=
+Common Joined UInteger Var(param_gcse_cost_distance_ratio) Optimization Init(10) Param
+Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations.
+
+-param=gcse-unrestricted-cost=
+Common Joined UInteger Var(param_gcse_unrestricted_cost) Optimization Init(3) Param
+Cost at which GCSE optimizations will not constraint the distance an expression can travel.
+
+-param=ggc-min-expand=
+Common Joined UInteger Var(param_ggc_min_expand) Init(30) Param
+Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap.
+
+-param=ggc-min-heapsize=
+Common Joined UInteger Var(param_ggc_min_heapsize) Init(4096) Param
+Minimum heap size before we start collecting garbage, in kilobytes.
+
+-param=gimple-fe-computed-hot-bb-threshold=
+Common Joined UInteger Var(param_gimple_fe_computed_hot_bb_threshold) Param
+The number of executions of a basic block which is considered hot. The parameter is used only in GIMPLE FE.
+
+-param=graphite-allow-codegen-errors=
+Common Joined UInteger Var(param_graphite_allow_codegen_errors) Optimization IntegerRange(0, 1) Param
+Whether codegen errors should be ICEs when -fchecking.
+
+-param=graphite-max-arrays-per-scop=
+Common Joined UInteger Var(param_graphite_max_arrays_per_scop) Optimization Init(100) Param
+Maximum number of arrays per SCoP.
+
+-param=graphite-max-nb-scop-params=
+Common Joined UInteger Var(param_graphite_max_nb_scop_params) Optimization Init(10) Param
+Maximum number of parameters in a SCoP.
+
+-param=hash-table-verification-limit=
+Common Joined UInteger Var(param_hash_table_verification_limit) Init(10) Param
+The number of elements for which hash table verification is done for each searched element.
+
+-param=hot-bb-count-fraction=
+Common Joined UInteger Var(param_hot_bb_count_fraction) Init(10000) Param
+The denominator n of fraction 1/n of the maximal execution count of a basic block in the entire program that a basic block needs to at least have in order to be considered hot (used in non-LTO mode).
+
+-param=hot-bb-count-ws-permille=
+Common Joined UInteger Var(param_hot_bb_count_ws_permille) Init(990) IntegerRange(0, 1000) Param
+The number of most executed permilles of the profiled execution of the entire program to which the execution count of a basic block must be part of in order to be considered hot (used in LTO mode).
+
+-param=hot-bb-frequency-fraction=
+Common Joined UInteger Var(param_hot_bb_frequency_fraction) Init(1000) Param
+The denominator n of fraction 1/n of the execution frequency of the entry block of a function that a basic block of this function needs to at least have in order to be considered hot.
+
+-param=hsa-gen-debug-stores=
+Common Joined UInteger Var(param_hsa_gen_debug_stores) IntegerRange(0, 1) Param
+Level of hsa debug stores verbosity.
+
+-param=inline-heuristics-hint-percent=
+Common Joined UInteger Var(param_inline_heuristics_hint_percent) Optimization Init(600) IntegerRange(100, 1000000) Param
+The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable with -O3 and -Ofast.
+
+-param=inline-heuristics-hint-percent-O2=
+Common Joined UInteger Var(param_inline_heuristics_hint_percent_o2) Init(200) IntegerRange(100, 1000000) Param
+The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable.
+
+-param=inline-min-speedup=
+Common Joined UInteger Var(param_inline_min_speedup) Init(15) IntegerRange(0, 100) Param
+The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto with -O3 and -Ofast.
+
+-param=inline-min-speedup-O2=
+Common Joined UInteger Var(param_inline_min_speedup_o2) Init(30) IntegerRange(0, 100) Param
+The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto.
+
+-param=inline-unit-growth=
+Common Joined UInteger Var(param_inline_unit_growth) Init(40) Param
+How much can given compilation unit grow because of the inlining (in percent).
+
+-param=integer-share-limit=
+Common Joined UInteger Var(param_integer_share_limit) Init(251) IntegerRange(2, 65536) Param
+The upper bound for sharing integer constants.
+
+-param=ipa-cp-eval-threshold=
+Common Joined UInteger Var(param_ipa_cp_eval_threshold) Init(500) Param
+Threshold ipa-cp opportunity evaluation that is still considered beneficial to clone.
+
+-param=ipa-cp-loop-hint-bonus=
+Common Joined UInteger Var(param_ipa_cp_loop_hint_bonus) Init(64) Param
+Compile-time bonus IPA-CP assigns to candidates which make loop bounds or strides known.
+
+-param=ipa-cp-recursion-penalty=
+Common Joined UInteger Var(param_ipa_cp_recursion_penalty) Init(40) IntegerRange(0, 100) Param
+Percentage penalty the recursive functions will receive when they are evaluated for cloning.
+
+-param=ipa-cp-single-call-penalty=
+Common Joined UInteger Var(param_ipa_cp_single_call_penalty) Init(15) IntegerRange(0, 100) Param
+Percentage penalty functions containing a single call to another function will receive when they are evaluated for cloning.
+
+-param=ipa-cp-value-list-size=
+Common Joined UInteger Var(param_ipa_cp_value_list_size) Init(8) Param
+Maximum size of a list of values associated with each parameter for interprocedural constant propagation.
+
+-param=ipa-max-aa-steps=
+Common Joined UInteger Var(param_ipa_max_aa_steps) Init(25000) Param
+Maximum number of statements that will be visited by IPA formal parameter analysis based on alias analysis in any given function.
+
+-param=ipa-max-agg-items=
+Common Joined UInteger Var(param_ipa_max_agg_items) Init(16) Param
+Maximum number of aggregate content items for a parameter in jump functions and lattices.
+
+-param=ipa-max-param-expr-ops=
+Common Joined UInteger Var(param_ipa_max_param_expr_ops) Init(10) Param
+Maximum number of operations in a parameter expression that can be handled by IPA analysis.
+
+-param=ipa-max-switch-predicate-bounds=
+Common Joined UInteger Var(param_ipa_max_switch_predicate_bounds) Init(5) Param
+Maximal number of boundary endpoints of case ranges of switch statement used during IPA functoin summary generation.
+
+-param=ipa-sra-max-replacements=
+Common Joined UInteger Var(param_ipa_sra_max_replacements) Init(8) IntegerRange(0, 16) Param
+Maximum pieces that IPA-SRA tracks per formal parameter, as a consequence, also the maximum number of replacements of a formal parameter.
+
+-param=ipa-sra-ptr-growth-factor=
+Common Joined UInteger Var(param_ipa_sra_ptr_growth_factor) Init(2) Param
+Maximum allowed growth of number and total size of new parameters that ipa-sra replaces a pointer to an aggregate with.
+
+-param=ipcp-unit-growth=
+Common Joined UInteger Var(param_ipcp_unit_growth) Init(10) Param
+How much can given compilation unit grow because of the interprocedural constant propagation (in percent).
+
+-param=ira-loop-reserved-regs=
+Common Joined UInteger Var(param_ira_loop_reserved_regs) Optimization Init(2) Param
+The number of registers in each class kept unused by loop invariant motion.
+
+-param=ira-max-conflict-table-size=
+Common Joined UInteger Var(param_ira_max_conflict_table_size) Optimization Init(1000) Param
+Max size of conflict table in MB.
+
+-param=ira-max-loops-num=
+Common Joined UInteger Var(param_ira_max_loops_num) Optimization Init(100) Param
+Max loops number for regional RA.
+
+-param=iv-always-prune-cand-set-bound=
+Common Joined UInteger Var(param_iv_always_prune_cand_set_bound) Optimization Init(10) Param
+If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization.
+
+-param=iv-consider-all-candidates-bound=
+Common Joined UInteger Var(param_iv_consider_all_candidates_bound) Optimization Init(40) Param
+Bound on number of candidates below that all candidates are considered in iv optimizations.
+
+-param=iv-max-considered-uses=
+Common Joined UInteger Var(param_iv_max_considered_uses) Optimization Init(250) Param
+Bound on number of iv uses in loop optimized in iv optimizations.
+
+-param=jump-table-max-growth-ratio-for-size=
+Common Joined UInteger Var(param_jump_table_max_growth_ratio_for_size) Optimization Init(300) Param
+The maximum code size growth ratio when expanding into a jump table (in percent). The parameter is used when optimizing for size.
+
+-param=jump-table-max-growth-ratio-for-speed=
+Common Joined UInteger Var(param_jump_table_max_growth_ratio_for_speed) Optimization Init(800) Param
+The maximum code size growth ratio when expanding into a jump table (in percent). The parameter is used when optimizing for speed.
+
+-param=l1-cache-line-size=
+Common Joined UInteger Var(param_l1_cache_line_size) Optimization Init(32) Param
+The size of L1 cache line.
+
+-param=l1-cache-size=
+Common Joined UInteger Var(param_l1_cache_size) Optimization Init(64) Param
+The size of L1 cache.
+
+-param=l2-cache-size=
+Common Joined UInteger Var(param_l2_cache_size) Optimization Init(512) Param
+The size of L2 cache.
+
+-param=large-function-growth=
+Common Joined UInteger Var(param_large_function_growth) Init(100) Param
+Maximal growth due to inlining of large function (in percent).
+
+-param=large-function-insns=
+Common Joined UInteger Var(param_large_function_insns) Init(2700) Param
+The size of function body to be considered large.
+
+-param=large-stack-frame=
+Common Joined UInteger Var(param_large_stack_frame) Init(256) Param
+The size of stack frame to be considered large.
+
+-param=large-stack-frame-growth=
+Common Joined UInteger Var(param_stack_frame_growth) Init(1000) Param
+Maximal stack frame growth due to inlining (in percent).
+
+-param=large-unit-insns=
+Common Joined UInteger Var(param_large_unit_insns) Init(10000) Param
+The size of translation unit to be considered large.
+
+-param=lim-expensive=
+Common Joined UInteger Var(param_lim_expensive) Optimization Init(20) Param
+The minimum cost of an expensive expression in the loop invariant motion.
+
+-param=logical-op-non-short-circuit=
+Common Joined UInteger Var(param_logical_op_non_short_circuit) Optimization Init(-1) IntegerRange(-1, 1) Param
+True if a non-short-circuit operation is optimal.
+
+-param=loop-block-tile-size=
+Common Joined UInteger Var(param_loop_block_tile_size) Optimization Init(51) Param
+Size of tiles for loop blocking.
+
+-param=loop-interchange-max-num-stmts=
+Common Joined UInteger Var(param_loop_interchange_max_num_stmts) Optimization Init(64) Param
+The maximum number of stmts in loop nest for loop interchange.
+
+-param=loop-interchange-stride-ratio=
+Common Joined UInteger Var(param_loop_interchange_stride_ratio) Optimization Init(2) Param
+The minimum stride ratio for loop interchange to be profitable.
+
+-param=loop-invariant-max-bbs-in-loop=
+Common Joined UInteger Var(param_loop_invariant_max_bbs_in_loop) Optimization Init(10000) Param
+Max basic blocks number in loop for loop invariant motion.
+
+-param=loop-max-datarefs-for-datadeps=
+Common Joined UInteger Var(param_loop_max_datarefs_for_datadeps) Optimization Init(1000) Param
+Maximum number of datarefs in loop for building loop data dependencies.
+
+-param=loop-versioning-max-inner-insns=
+Common Joined UInteger Var(param_loop_versioning_max_inner_insns) Optimization Init(200) Param
+The maximum number of instructions in an inner loop that is being considered for versioning.
+
+-param=loop-versioning-max-outer-insns=
+Common Joined UInteger Var(param_loop_versioning_max_outer_insns) Optimization Init(100) Param
+The maximum number of instructions in an outer loop that is being considered for versioning, on top of the instructions in inner loops.
+
+-param=lra-inheritance-ebb-probability-cutoff=
+Common Joined UInteger Var(param_lra_inheritance_ebb_probability_cutoff) Optimization Init(40) IntegerRange(0, 100) Param
+Minimal fall-through edge probability in percentage used to add BB to inheritance EBB in LRA.
+
+-param=lra-max-considered-reload-pseudos=
+Common Joined UInteger Var(param_lra_max_considered_reload_pseudos) Optimization Init(500) Param
+The max number of reload pseudos which are considered during spilling a non-reload pseudo.
+
+-param=lto-max-partition=
+Common Joined UInteger Var(param_max_partition_size) Init(1000000) Param
+Maximal size of a partition for LTO (in estimated instructions).
+
+-param=lto-max-streaming-parallelism=
+Common Joined UInteger Var(param_max_lto_streaming_parallelism) Init(32) IntegerRange(1, 65536) Param
+maximal number of LTO partitions streamed in parallel.
+
+-param=lto-min-partition=
+Common Joined UInteger Var(param_min_partition_size) Init(10000) Param
+Minimal size of a partition for LTO (in estimated instructions).
+
+-param=lto-partitions=
+Common Joined UInteger Var(param_lto_partitions) Init(128) IntegerRange(1, 65536) Param
+Number of partitions the program should be split to.
+
+-param=max-average-unrolled-insns=
+Common Joined UInteger Var(param_max_average_unrolled_insns) Optimization Init(80) Param
+The maximum number of instructions to consider to unroll in a loop on average.
+
+-param=max-combine-insns=
+Common Joined UInteger Var(param_max_combine_insns) Optimization Init(4) IntegerRange(2, 4) Param
+The maximum number of insns combine tries to combine.
+
+-param=max-completely-peel-loop-nest-depth=
+Common Joined UInteger Var(param_max_unroll_iterations) Optimization Init(8) Param
+The maximum depth of a loop nest we completely peel.
+
+-param=max-completely-peel-times=
+Common Joined UInteger Var(param_max_completely_peel_times) Optimization Init(16) Param
+The maximum number of peelings of a single loop that is peeled completely.
+
+-param=max-completely-peeled-insns=
+Common Joined UInteger Var(param_max_completely_peeled_insns) Optimization Init(200) Param
+The maximum number of insns of a completely peeled loop.
+
+-param=max-crossjump-edges=
+Common Joined UInteger Var(param_max_crossjump_edges) Optimization Init(100) Param
+The maximum number of incoming edges to consider for crossjumping.
+
+-param=max-cse-insns=
+Common Joined UInteger Var(param_max_cse_insns) Optimization Init(1000) Param
+The maximum instructions CSE process before flushing.
+
+-param=max-cse-path-length=
+Common Joined UInteger Var(param_max_cse_path_length) Optimization Init(10) IntegerRange(1, 65536) Param
+The maximum length of path considered in cse.
+
+-param=max-cselib-memory-locations=
+Common Joined UInteger Var(param_max_cselib_memory_locations) Optimization Init(500) Param
+The maximum memory locations recorded by cselib.
+
+-param=max-debug-marker-count=
+Common Joined UInteger Var(param_max_debug_marker_count) Init(100000) Param
+Max. count of debug markers to expand or inline.
+
+-param=max-delay-slot-insn-search=
+Common Joined UInteger Var(param_max_delay_slot_insn_search) Optimization Init(100) Param
+The maximum number of instructions to consider to fill a delay slot.
+
+-param=max-delay-slot-live-search=
+Common Joined UInteger Var(param_max_delay_slot_live_search) Optimization Init(333) Param
+The maximum number of instructions to consider to find accurate live register information.
+
+-param=max-dse-active-local-stores=
+Common Joined UInteger Var(param_max_dse_active_local_stores) Optimization Init(5000) Param
+Maximum number of active local stores in RTL dead store elimination.
+
+-param=max-early-inliner-iterations=
+Common Joined UInteger Var(param_early_inliner_max_iterations) Init(1) Param
+The maximum number of nested indirect inlining performed by early inliner.
+
+-param=max-fields-for-field-sensitive=
+Common Joined UInteger Var(param_max_fields_for_field_sensitive) Optimization Param
+Maximum number of fields in a structure before pointer analysis treats the structure as a single variable.
+
+-param=max-fsm-thread-length=
+Common Joined UInteger Var(param_max_fsm_thread_length) Optimization Init(10) IntegerRange(1, 999999) Param
+Maximum number of basic blocks on a finite state automaton jump thread path.
+
+-param=max-fsm-thread-path-insns=
+Common Joined UInteger Var(param_max_fsm_thread_path_insns) Optimization Init(100) IntegerRange(1, 999999) Param
+Maximum number of instructions to copy when duplicating blocks on a finite state automaton jump thread path.
+
+-param=max-fsm-thread-paths=
+Common Joined UInteger Var(param_max_fsm_thread_paths) Optimization Init(50) IntegerRange(1, 999999) Param
+Maximum number of new jump thread paths to create for a finite state automaton.
+
+-param=max-gcse-insertion-ratio=
+Common Joined UInteger Var(param_max_gcse_insertion_ratio) Optimization Init(20) Param
+The maximum ratio of insertions to deletions of expressions in GCSE.
+
+-param=max-gcse-memory=
+Common Joined UInteger Var(param_max_gcse_memory) Optimization Init(134217728) Param
+The maximum amount of memory to be allocated by GCSE.
+
+-param=max-goto-duplication-insns=
+Common Joined UInteger Var(param_max_goto_duplication_insns) Optimization Init(8) Param
+The maximum number of insns to duplicate when unfactoring computed gotos.
+
+-param=max-grow-copy-bb-insns=
+Common Joined UInteger Var(param_max_grow_copy_bb_insns) Optimization Init(8) Param
+The maximum expansion factor when copying basic blocks.
+
+-param=max-hoist-depth=
+Common Joined UInteger Var(param_max_hoist_depth) Optimization Init(30) Param
+Maximum depth of search in the dominator tree for expressions to hoist.
+
+-param=max-inline-insns-auto=
+Common Joined UInteger Var(param_max_inline_insns_auto) Init(30) Param
+The maximum number of instructions when automatically inlining with -O3 and -Ofast.
+
+-param=max-inline-insns-auto-O2=
+Common Joined UInteger Var(param_max_inline_insns_auto_o2) Init(15) Param
+The maximum number of instructions when automatically inlining.
+
+-param=max-inline-insns-recursive=
+Common Joined UInteger Var(param_max_inline_insns_recursive) Init(450) Param
+The maximum number of instructions inline function can grow to via recursive inlining.
+
+-param=max-inline-insns-recursive-auto=
+Common Joined UInteger Var(param_max_inline_insns_recursive_auto) Init(450) Param
+The maximum number of instructions non-inline function can grow to via recursive inlining.
+
+-param=max-inline-insns-single=
+Common Joined UInteger Var(param_max_inline_insns_single) Init(200) Param
+The maximum number of instructions in a single function eligible for inlining with -O3 and -Ofast.
+
+-param=max-inline-insns-single-O2=
+Common Joined UInteger Var(param_max_inline_insns_single_o2) Init(30) Param
+The maximum number of instructions in a single function eligible for inlining.
+
+-param=max-inline-insns-size=
+Common Joined UInteger Var(param_max_inline_insns_size) Optimization Param
+The maximum number of instructions when inlining for size.
+
+-param=max-inline-insns-small=
+Common Joined UInteger Var(param_max_inline_insns_small) Param
+The maximum number of instructions when automatically inlining small functions.
+
+-param=max-inline-recursive-depth=
+Common Joined UInteger Var(param_max_inline_recursive_depth) Init(8) Param
+The maximum depth of recursive inlining for inline functions.
+
+-param=max-inline-recursive-depth-auto=
+Common Joined UInteger Var(param_max_inline_recursive_depth_auto) Init(8) Param
+The maximum depth of recursive inlining for non-inline functions.
+
+-param=max-isl-operations=
+Common Joined UInteger Var(param_max_isl_operations) Optimization Init(350000) Param
+Maximum number of isl operations, 0 means unlimited.
+
+-param=max-iterations-computation-cost=
+Common Joined UInteger Var(param_max_iterations_computation_cost) Optimization Init(10) Param
+Bound on the cost of an expression to compute the number of iterations.
+
+-param=max-iterations-to-track=
+Common Joined UInteger Var(param_max_iterations_to_track) Optimization Init(1000) Param
+Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates.
+
+-param=max-jump-thread-duplication-stmts=
+Common Joined UInteger Var(param_max_jump_thread_duplication_stmts) Optimization Init(15) Param
+Maximum number of statements allowed in a block that needs to be duplicated when threading jumps.
+
+-param=max-last-value-rtl=
+Common Joined UInteger Var(param_max_last_value_rtl) Optimization Init(10000) Param
+The maximum number of RTL nodes that can be recorded as combiner's last value.
+
+-param=max-loop-header-insns=
+Common Joined UInteger Var(param_max_loop_header_insns) Optimization Init(20) Param
+The maximum number of insns in loop header duplicated by the copy loop headers pass.
+
+-param=max-modulo-backtrack-attempts=
+Common Joined UInteger Var(param_max_modulo_backtrack_attempts) Optimization Init(40) Param
+The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop.
+
+-param=max-partial-antic-length=
+Common Joined UInteger Var(param_max_partial_antic_length) Optimization Init(100) Param
+Maximum length of partial antic set when performing tree pre optimization.
+
+-param=max-peel-branches=
+Common Joined UInteger Var(param_max_peel_branches) Optimization Init(32) Param
+The maximum number of branches on the path through the peeled sequence.
+
+-param=max-peel-times=
+Common Joined UInteger Var(param_max_peel_times) Optimization Init(16) Param
+The maximum number of peelings of a single loop.
+
+-param=max-peeled-insns=
+Common Joined UInteger Var(param_max_peeled_insns) Optimization Init(100) Param
+The maximum number of insns of a peeled loop.
+
+-param=max-pending-list-length=
+Common Joined UInteger Var(param_max_pending_list_length) Optimization Init(32) Param
+The maximum length of scheduling's pending operations list.
+
+-param=max-pipeline-region-blocks=
+Common Joined UInteger Var(param_max_pipeline_region_blocks) Optimization Init(15) Param
+The maximum number of blocks in a region to be considered for interblock scheduling.
+
+-param=max-pipeline-region-insns=
+Common Joined UInteger Var(param_max_pipeline_region_insns) Optimization Init(200) Param
+The maximum number of insns in a region to be considered for interblock scheduling.
+
+-param=max-pow-sqrt-depth=
+Common Joined UInteger Var(param_max_pow_sqrt_depth) Optimization Init(5) IntegerRange(1, 32) Param
+Maximum depth of sqrt chains to use when synthesizing exponentiation by a real constant.
+
+-param=max-predicted-iterations=
+Common Joined UInteger Var(param_max_predicted_iterations) Optimization Init(100) Param
+The maximum number of loop iterations we predict statically.
+
+-param=max-reload-search-insns=
+Common Joined UInteger Var(param_max_reload_search_insns) Optimization Init(100) Param
+The maximum number of instructions to search backward when looking for equivalent reload.
+
+-param=max-rtl-if-conversion-insns=
+Common Joined UInteger Var(param_max_rtl_if_conversion_insns) Optimization Init(10) IntegerRange(0, 99) Param
+Maximum number of insns in a basic block to consider for RTL if-conversion.
+
+-param=max-rtl-if-conversion-predictable-cost=
+Common Joined UInteger Var(param_max_rtl_if_conversion_predictable_cost) Optimization Init(20) IntegerRange(0, 200) Param
+Maximum permissible cost for the sequence that would be generated by the RTL if-conversion pass for a branch that is considered predictable.
+
+-param=max-rtl-if-conversion-unpredictable-cost=
+Common Joined UInteger Var(param_max_rtl_if_conversion_unpredictable_cost) Optimization Init(40) IntegerRange(0, 200) Param
+Maximum permissible cost for the sequence that would be generated by the RTL if-conversion pass for a branch that is considered unpredictable.
+
+-param=max-sched-extend-regions-iters=
+Common Joined UInteger Var(param_max_sched_extend_regions_iters) Optimization Param
+The maximum number of iterations through CFG to extend regions.
+
+-param=max-sched-insn-conflict-delay=
+Common Joined UInteger Var(param_max_sched_insn_conflict_delay) Optimization Init(3) IntegerRange(1, 10) Param
+The maximum conflict delay for an insn to be considered for speculative motion.
+
+-param=max-sched-ready-insns=
+Common Joined UInteger Var(param_max_sched_ready_insns) Optimization Init(100) IntegerRange(1, 65536) Param
+The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass.
+
+-param=max-sched-region-blocks=
+Common Joined UInteger Var(param_max_sched_region_blocks) Optimization Init(10) Param
+The maximum number of blocks in a region to be considered for interblock scheduling.
+
+-param=max-sched-region-insns=
+Common Joined UInteger Var(param_max_sched_region_insns) Optimization Init(100) Param
+The maximum number of insns in a region to be considered for interblock scheduling.
+
+-param=max-slsr-cand-scan=
+Common Joined UInteger Var(param_max_slsr_candidate_scan) Optimization Init(50) IntegerRange(1, 999999) Param
+Maximum length of candidate scans for straight-line strength reduction.
+
+-param=max-speculative-devirt-maydefs=
+Common Joined UInteger Var(param_max_speculative_devirt_maydefs) Init(50) Param
+Maximum number of may-defs visited when devirtualizing speculatively.
+
+-param=max-ssa-name-query-depth=
+Common Joined UInteger Var(param_max_ssa_name_query_depth) Optimization Init(3) IntegerRange(1, 10) Param
+Maximum recursion depth allowed when querying a property of an SSA name.
+
+-param=max-stores-to-merge=
+Common Joined UInteger Var(param_max_stores_to_merge) Optimization Init(64) IntegerRange(2, 65536) Param
+Maximum number of constant stores to merge in the store merging pass.
+
+-param=max-stores-to-sink=
+Common Joined UInteger Var(param_max_stores_to_sink) Optimization Init(2) Param
+Maximum number of conditional store pairs that can be sunk.
+
+-param=max-tail-merge-comparisons=
+Common Joined UInteger Var(param_max_tail_merge_comparisons) Optimization Init(10) Param
+Maximum amount of similar bbs to compare a bb with.
+
+-param=max-tail-merge-iterations=
+Common Joined UInteger Var(param_max_tail_merge_iterations) Optimization Init(2) Param
+Maximum amount of iterations of the pass over a function.
+
+-param=max-tracked-strlens=
+Common Joined UInteger Var(param_max_tracked_strlens) Optimization Init(10000) Param
+Maximum number of strings for which strlen optimization pass will track string lengths.
+
+-param=max-tree-if-conversion-phi-args=
+Common Joined UInteger Var(param_max_tree_if_conversion_phi_args) Optimization Init(4) IntegerRange(2, 65536) Param
+Maximum number of arguments in a PHI supported by TREE if-conversion unless the loop is marked with simd pragma.
+
+-param=max-unroll-times=
+Common Joined UInteger Var(param_max_unroll_times) Optimization Init(8) Param
+The maximum number of unrollings of a single loop.
+
+-param=max-unrolled-insns=
+Common Joined UInteger Var(param_max_unrolled_insns) Optimization Init(200) Param
+The maximum number of instructions to consider to unroll in a loop.
+
+-param=max-unswitch-insns=
+Common Joined UInteger Var(param_max_unswitch_insns) Optimization Init(50) Param
+The maximum number of insns of an unswitched loop.
+
+-param=max-unswitch-level=
+Common Joined UInteger Var(param_max_unswitch_level) Optimization Init(3) Param
+The maximum number of unswitchings in a single loop.
+
+-param=max-variable-expansions-in-unroller=
+Common Joined UInteger Var(param_max_variable_expansions) Optimization Init(1) Param
+If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling.
+
+-param=max-vartrack-expr-depth=
+Common Joined UInteger Var(param_max_vartrack_expr_depth) Init(12) Param
+Max. recursion depth for expanding var tracking expressions.
+
+-param=max-vartrack-reverse-op-size=
+Common Joined UInteger Var(param_max_vartrack_reverse_op_size) Init(50) Param
+Max. size of loc list for which reverse ops should be added.
+
+-param=max-vartrack-size=
+Common Joined UInteger Var(param_max_vartrack_size) Init(50000000) Param
+Max. size of var tracking hash tables.
+
+-param=max-vrp-switch-assertions=
+Common Joined UInteger Var(param_max_vrp_switch_assertions) Optimization Init(10) Param
+Maximum number of assertions to add along the default edge of a switch statement during VRP.
+
+-param=min-crossjump-insns=
+Common Joined UInteger Var(param_min_crossjump_insns) Optimization Init(5) IntegerRange(1, 65536) Param
+The minimum number of matching instructions to consider for crossjumping.
+
+-param=min-inline-recursive-probability=
+Common Joined UInteger Var(param_min_inline_recursive_probability) Init(10) Param
+Inline recursively only when the probability of call being executed exceeds the parameter.
+
+-param=min-insn-to-prefetch-ratio=
+Common Joined UInteger Var(param_min_insn_to_prefetch_ratio) Optimization Init(9) Param
+Min. ratio of insns to prefetches to enable prefetching for a loop with an unknown trip count.
+
+-param=min-nondebug-insn-uid=
+Common Joined UInteger Var(param_min_nondebug_insn_uid) Param
+The minimum UID to be used for a nondebug insn.
+
+-param=min-size-for-stack-sharing=
+Common Joined UInteger Var(param_min_size_for_stack_sharing) Optimization Init(32) Param
+The minimum size of variables taking part in stack slot sharing when not optimizing.
+
+-param=min-spec-prob=
+Common Joined UInteger Var(param_min_spec_prob) Optimization Init(40) Param
+The minimum probability of reaching a source block for interblock speculative scheduling.
+
+-param=min-vect-loop-bound=
+Common Joined UInteger Var(param_min_vect_loop_bound) Optimization Param
+If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization.
+
+-param=parloops-chunk-size=
+Common Joined UInteger Var(param_parloops_chunk_size) Optimization Param
+Chunk size of omp schedule for loops parallelized by parloops.
+
+-param=parloops-min-per-thread=
+Common Joined UInteger Var(param_parloops_min_per_thread) Optimization Init(100) IntegerRange(2, 65536) Param
+Minimum number of iterations per thread of an innermost parallelized loop.
+
+-param=parloops-schedule=
+Common Joined Var(param_parloops_schedule) Enum(parloops_schedule_type) Optimization Param
+--param=parloops-schedule=[static|dynamic|guided|auto|runtime] Schedule type of omp schedule for loops parallelized by parloops.
+
+Enum
+Name(parloops_schedule_type) Type(int)
+
+EnumValue
+Enum(parloops_schedule_type) String(static) Value(PARLOOPS_SCHEDULE_STATIC)
+
+EnumValue
+Enum(parloops_schedule_type) String(dynamic) Value(PARLOOPS_SCHEDULE_DYNAMIC)
+
+EnumValue
+Enum(parloops_schedule_type) String(guided) Value(PARLOOPS_SCHEDULE_GUIDED)
+
+EnumValue
+Enum(parloops_schedule_type) String(auto) Value(PARLOOPS_SCHEDULE_AUTO)
+
+EnumValue
+Enum(parloops_schedule_type) String(runtime) Value(PARLOOPS_SCHEDULE_RUNTIME)
+
+-param=partial-inlining-entry-probability=
+Common Joined UInteger Var(param_partial_inlining_entry_probability) Init(70) IntegerRange(0, 100) Param
+Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen.
+
+-param=predictable-branch-outcome=
+Common Joined UInteger Var(param_predictable_branch_outcome) Optimization Init(2) IntegerRange(0, 50) Param
+Maximal estimated outcome of branch considered predictable.
+
+-param=prefetch-dynamic-strides=
+Common Joined UInteger Var(param_prefetch_dynamic_strides) Optimization Init(1) IntegerRange(0, 1) Param
+Whether software prefetch hints should be issued for non-constant strides.
+
+-param=prefetch-latency=
+Common Joined UInteger Var(param_prefetch_latency) Optimization Init(200) Param
+The number of insns executed before prefetch is completed.
+
+-param=prefetch-min-insn-to-mem-ratio=
+Common Joined UInteger Var(param_prefetch_min_insn_to_mem_ratio) Optimization Init(3) Param
+Min. ratio of insns to mem ops to enable prefetching in a loop.
+
+-param=prefetch-minimum-stride=
+Common Joined UInteger Var(param_prefetch_minimum_stride) Optimization Init(-1) Param
+The minimum constant stride beyond which we should use prefetch hints for.
+
+-param=profile-func-internal-id=
+Common Joined UInteger Var(param_profile_func_internal_id) IntegerRange(0, 1) Param
+Use internal function id in profile lookup.
+
+-param=rpo-vn-max-loop-depth=
+Common Joined UInteger Var(param_rpo_vn_max_loop_depth) Optimization Init(7) IntegerRange(2, 65536) Param
+Maximum depth of a loop nest to fully value-number optimistically.
+
+-param=sccvn-max-alias-queries-per-access=
+Common Joined UInteger Var(param_sccvn_max_alias_queries_per_access) Optimization Init(1000) Param
+Maximum number of disambiguations to perform per memory access.
+
+-param=scev-max-expr-complexity=
+Common Joined UInteger Var(param_scev_max_expr_complexity) Optimization Init(10) Param
+Bound on the complexity of the expressions in the scalar evolutions analyzer.
+
+-param=scev-max-expr-size=
+Common Joined UInteger Var(param_scev_max_expr_size) Optimization Init(100) Param
+Bound on size of expressions used in the scalar evolutions analyzer.
+
+-param=sched-autopref-queue-depth=
+Common Joined UInteger Var(param_sched_autopref_queue_depth) Optimization Init(-1) Param
+Hardware autoprefetcher scheduler model control flag. Number of lookahead cycles the model looks into, at '0' only enable instruction sorting heuristic. Disabled by default.
+
+-param=sched-mem-true-dep-cost=
+Common Joined UInteger Var(param_sched_mem_true_dep_cost) Optimization Init(1) Param
+Minimal distance between possibly conflicting store and load.
+
+-param=sched-pressure-algorithm=
+Common Joined UInteger Var(param_sched_pressure_algorithm) Optimization Init(1) IntegerRange(1, 2) Param
+Which -fsched-pressure algorithm to apply.
+
+-param=sched-spec-prob-cutoff=
+Common Joined UInteger Var(param_sched_spec_prob_cutoff) Optimization Init(40) IntegerRange(0, 100) Param
+The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.
+
+-param=sched-state-edge-prob-cutoff=
+Common Joined UInteger Var(param_sched_state_edge_prob_cutoff) Optimization Init(10) IntegerRange(0, 100) Param
+The minimum probability an edge must have for the scheduler to save its state across it.
+
+-param=selsched-insns-to-rename=
+Common Joined UInteger Var(param_selsched_insns_to_rename) Optimization Init(2) Param
+Maximum number of instructions in the ready list that are considered eligible for renaming.
+
+-param=selsched-max-lookahead=
+Common Joined UInteger Var(param_selsched_max_lookahead) Optimization Init(50) Param
+The maximum size of the lookahead window of selective scheduling.
+
+-param=selsched-max-sched-times=
+Common Joined UInteger Var(param_selsched_max_sched_times) Optimization Init(2) IntegerRange(1, 65536) Param
+Maximum number of times that an insn could be scheduled.
+
+-param=simultaneous-prefetches=
+Common Joined UInteger Var(param_simultaneous_prefetches) Optimization Init(3) Param
+The number of prefetches that can run at the same time.
+
+-param=sink-frequency-threshold=
+Common Joined UInteger Var(param_sink_frequency_threshold) Optimization Init(75) IntegerRange(0, 100) Param
+Target block's relative execution frequency (as a percentage) required to sink a statement.
+
+-param=slp-max-insns-in-bb=
+Common Joined UInteger Var(param_slp_max_insns_in_bb) Optimization Init(1000) Param
+Maximum number of instructions in basic block to be considered for SLP vectorization.
+
+-param=sms-dfa-history=
+Common Joined UInteger Var(param_sms_dfa_history) Optimization Param
+The number of cycles the swing modulo scheduler considers when checking conflicts using DFA.
+
+-param=sms-loop-average-count-threshold=
+Common Joined UInteger Var(param_sms_loop_average_count_threshold) Optimization Param
+A threshold on the average loop count considered by the swing modulo scheduler.
+
+-param=sms-max-ii-factor=
+Common Joined UInteger Var(param_sms_max_ii_factor) Optimization Init(100) Param
+A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop.
+
+-param=sms-min-sc=
+Common Joined UInteger Var(param_sms_min_sc) Optimization Init(2) IntegerRange(1, 65536) Param
+The minimum value of stage count that swing modulo scheduler will generate.
+
+-param=sra-max-scalarization-size-Osize=
+Common Joined UInteger Var(param_sra_max_scalarization_size_size) Optimization Param
+Maximum size, in storage units, of an aggregate which should be considered for scalarization when compiling for size.
+
+-param=sra-max-scalarization-size-Ospeed=
+Common Joined UInteger Var(param_sra_max_scalarization_size_speed) Optimization Param
+Maximum size, in storage units, of an aggregate which should be considered for scalarization when compiling for speed.
+
+-param=ssa-name-def-chain-limit=
+Common Joined UInteger Var(param_ssa_name_def_chain_limit) Optimization Init(512) Param
+The maximum number of SSA_NAME assignments to follow in determining a value.
+
+-param=ssp-buffer-size=
+Common Joined UInteger Var(param_ssp_buffer_size) Optimization Init(8) IntegerRange(1, 65536) Param
+The lower bound for a buffer to be considered for stack smashing protection.
+
+-param=stack-clash-protection-guard-size=
+Common Joined UInteger Var(param_stack_clash_protection_guard_size) Optimization Init(12) IntegerRange(12, 30) Param
+Size of the stack guard expressed as a power of two in bytes.
+
+-param=stack-clash-protection-probe-interval=
+Common Joined UInteger Var(param_stack_clash_protection_probe_interval) Optimization Init(12) IntegerRange(10, 16) Param
+Interval in which to probe the stack expressed as a power of two in bytes.
+
+-param=store-merging-allow-unaligned=
+Common Joined UInteger Var(param_store_merging_allow_unaligned) Optimization Init(1) IntegerRange(0, 1) Param
+Allow the store merging pass to introduce unaligned stores if it is legal to do so.
+
+-param=store-merging-max-size=
+Common Joined UInteger Var(param_store_merging_max_size) Optimization Init(65536) IntegerRange(1, 65536) Param
+Maximum size of a single store merging region in bytes.
+
+-param=switch-conversion-max-branch-ratio=
+Common Joined UInteger Var(param_switch_conversion_branch_ratio) Optimization Init(8) IntegerRange(1, 65536) Param
+The maximum ratio between array size and switch branches for a switch conversion to take place.
+
+-param=tm-max-aggregate-size=
+Common Joined UInteger Var(param_tm_max_aggregate_size) Optimization Init(9) Param
+Size in bytes after which thread-local aggregates should be instrumented with the logging functions instead of save/restore pairs.
+
+-param=tracer-dynamic-coverage=
+Common Joined UInteger Var(param_tracer_dynamic_coverage) Optimization Init(75) IntegerRange(0, 100) Param
+The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available.
+
+-param=tracer-dynamic-coverage-feedback=
+Common Joined UInteger Var(param_tracer_dynamic_coverage_feedback) Optimization Init(95) IntegerRange(0, 100) Param
+The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available.
+
+-param=tracer-max-code-growth=
+Common Joined UInteger Var(param_tracer_max_code_growth) Optimization Init(100) Param
+Maximal code growth caused by tail duplication (in percent).
+
+-param=tracer-min-branch-probability=
+Common Joined UInteger Var(param_tracer_min_branch_probability) Optimization Init(50) IntegerRange(0, 100) Param
+Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available.
+
+-param=tracer-min-branch-probability-feedback=
+Common Joined UInteger Var(param_tracer_min_branch_probability_feedback) Optimization Init(80) IntegerRange(0, 100) Param
+Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available.
+
+-param=tracer-min-branch-ratio=
+Common Joined UInteger Var(param_tracer_min_branch_ratio) Optimization Init(10) IntegerRange(0, 100) Param
+Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent).
+
+-param=tree-reassoc-width=
+Common Joined UInteger Var(param_tree_reassoc_width) Optimization Param
+Set the maximum number of instructions executed in parallel in reassociated tree. If 0, use the target dependent heuristic.
+
+-param=uninit-control-dep-attempts=
+Common Joined UInteger Var(param_uninit_control_dep_attempts) Optimization Init(1000) IntegerRange(1, 65536) Param
+Maximum number of nested calls to search for control dependencies during uninitialized variable analysis.
+
+-param=uninlined-function-insns=
+Common Joined UInteger Var(param_uninlined_function_insns) Init(2) IntegerRange(0, 1000000) Param
+Instruction accounted for function prologue, epilogue and other overhead.
+
+-param=uninlined-function-time=
+Common Joined UInteger Var(param_uninlined_function_time) IntegerRange(0, 1000000) Param
+Time accounted for function prologue, epilogue and other overhead.
+
+-param=uninlined-thunk-insns=
+Common Joined UInteger Var(param_uninlined_function_thunk_insns) Init(2) IntegerRange(0, 1000000) Param
+Instruction accounted for function thunk overhead.
+
+-param=uninlined-thunk-time=
+Common Joined UInteger Var(param_uninlined_function_thunk_time) Init(2) IntegerRange(0, 1000000) Param
+Time accounted for function thunk overhead.
+
+-param=unlikely-bb-count-fraction=
+Common Joined UInteger Var(param_unlikely_bb_count_fraction) Init(20) Param
+The denominator n of fraction 1/n of the number of profiled runs of the entire program below which the execution count of a basic block must be in order for the basic block to be considered unlikely.
+
+-param=unroll-jam-max-unroll=
+Common Joined UInteger Var(param_unroll_jam_max_unroll) Optimization Init(4) Param
+Maximum unroll factor for the unroll-and-jam transformation.
+
+-param=unroll-jam-min-percent=
+Common Joined UInteger Var(param_unroll_jam_min_percent) Optimization Init(1) IntegerRange(0, 100) Param
+Minimum percentage of memrefs that must go away for unroll-and-jam to be considered profitable.
+
+-param=use-after-scope-direct-emission-threshold=
+Common Joined UInteger Var(param_use_after_scope_direct_emission_threshold) Optimization Init(256) Param
+Use direct poisoning/unpoisoning instructions for variables smaller or equal to this number.
+
+-param=use-canonical-types=
+Common Joined UInteger Var(param_use_canonical_types) Init(1) IntegerRange(0, 1) Param
+Whether to use canonical types.
+
+-param=vect-epilogues-nomask=
+Common Joined UInteger Var(param_vect_epilogues_nomask) Optimization Init(1) IntegerRange(0, 1) Param
+Enable loop epilogue vectorization using smaller vector size.
+
+-param=vect-max-peeling-for-alignment=
+Common Joined UInteger Var(param_vect_max_peeling_for_alignment) Optimization Init(-1) IntegerRange(-1, 64) Param
+Maximum number of loop peels to enhance alignment of data references in a loop.
+
+-param=vect-max-version-for-alias-checks=
+Common Joined UInteger Var(param_vect_max_version_for_alias_checks) Optimization Init(10) Param
+Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check.
+
+-param=vect-max-version-for-alignment-checks=
+Common Joined UInteger Var(param_vect_max_version_for_alignment_checks) Optimization Init(6) Param
+Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check.
+
+; This comment is to ensure we retain the blank line above.
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 3/7] Apply mechanical replacement (generated patch).
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (5 preceding siblings ...)
2019-11-07 12:33 ` [PATCH 7/7] Fix test-suite fallout Martin Liska
@ 2019-11-07 12:34 ` Martin Liska
2019-11-11 14:39 ` Richard Biener
2019-11-11 14:06 ` [PATCH] Use more SET_OPTION_IF_UNSET Martin Liška
2019-11-11 14:50 ` [PATCH 0/7] Param conversion to option machinery Richard Biener
8 siblings, 1 reply; 29+ messages in thread
From: Martin Liska @ 2019-11-07 12:34 UTC (permalink / raw)
To: gcc-patches
[-- Attachment #1: Type: text/plain, Size: 21279 bytes --]
gcc/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* asan.c (asan_sanitize_stack_p): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
(asan_sanitize_allocas_p): Likewise.
(asan_emit_stack_protection): Likewise.
(asan_protect_global): Likewise.
(instrument_derefs): Likewise.
(instrument_builtin_call): Likewise.
(asan_expand_mark_ifn): Likewise.
* auto-profile.c (auto_profile): Likewise.
* bb-reorder.c (copy_bb_p): Likewise.
(duplicate_computed_gotos): Likewise.
* builtins.c (inline_expand_builtin_string_cmp): Likewise.
* cfgcleanup.c (try_crossjump_to_edge): Likewise.
(try_crossjump_bb): Likewise.
* cfgexpand.c (defer_stack_allocation): Likewise.
(stack_protect_classify_type): Likewise.
(pass_expand::execute): Likewise.
* cfgloopanal.c (expected_loop_iterations_unbounded): Likewise.
(estimate_reg_pressure_cost): Likewise.
* cgraph.c (cgraph_edge::maybe_hot_p): Likewise.
* combine.c (combine_instructions): Likewise.
(record_value_for_reg): Likewise.
* common/config/aarch64/aarch64-common.c (aarch64_option_validate_param): Likewise.
(aarch64_option_default_params): Likewise.
* common/config/ia64/ia64-common.c (ia64_option_default_params): Likewise.
* common/config/powerpcspe/powerpcspe-common.c (rs6000_option_default_params): Likewise.
* common/config/rs6000/rs6000-common.c (rs6000_option_default_params): Likewise.
* common/config/sh/sh-common.c (sh_option_default_params): Likewise.
* config/aarch64/aarch64.c (aarch64_output_probe_stack_range): Likewise.
(aarch64_allocate_and_probe_stack_space): Likewise.
(aarch64_expand_epilogue): Likewise.
(aarch64_override_options_internal): Likewise.
* config/alpha/alpha.c (alpha_option_override): Likewise.
* config/arm/arm.c (arm_option_override): Likewise.
(arm_valid_target_attribute_p): Likewise.
* config/i386/i386-options.c (ix86_option_override_internal): Likewise.
* config/i386/i386.c (get_probe_interval): Likewise.
(ix86_adjust_stack_and_probe_stack_clash): Likewise.
(ix86_max_noce_ifcvt_seq_cost): Likewise.
* config/ia64/ia64.c (ia64_adjust_cost): Likewise.
* config/rs6000/rs6000-logue.c (get_stack_clash_protection_probe_interval): Likewise.
(get_stack_clash_protection_guard_size): Likewise.
* config/rs6000/rs6000.c (rs6000_option_override_internal): Likewise.
* config/s390/s390.c (allocate_stack_space): Likewise.
(s390_emit_prologue): Likewise.
(s390_option_override_internal): Likewise.
* config/sparc/sparc.c (sparc_option_override): Likewise.
* config/visium/visium.c (visium_option_override): Likewise.
* coverage.c (get_coverage_counts): Likewise.
(coverage_compute_profile_id): Likewise.
(coverage_begin_function): Likewise.
(coverage_end_function): Likewise.
* cse.c (cse_find_path): Likewise.
(cse_extended_basic_block): Likewise.
(cse_main): Likewise.
* cselib.c (cselib_invalidate_mem): Likewise.
* dse.c (dse_step1): Likewise.
* emit-rtl.c (set_new_first_and_last_insn): Likewise.
(get_max_insn_count): Likewise.
(make_debug_insn_raw): Likewise.
(init_emit): Likewise.
* explow.c (compute_stack_clash_protection_loop_data): Likewise.
* final.c (compute_alignments): Likewise.
* fold-const.c (fold_range_test): Likewise.
(fold_truth_andor): Likewise.
(tree_single_nonnegative_warnv_p): Likewise.
(integer_valued_real_single_p): Likewise.
* gcse.c (want_to_gcse_p): Likewise.
(prune_insertions_deletions): Likewise.
(hoist_code): Likewise.
(gcse_or_cprop_is_too_expensive): Likewise.
* ggc-common.c: Likewise.
* ggc-page.c (ggc_collect): Likewise.
* gimple-loop-interchange.cc (MAX_NUM_STMT): Likewise.
(MAX_DATAREFS): Likewise.
(OUTER_STRIDE_RATIO): Likewise.
* gimple-loop-jam.c (tree_loop_unroll_and_jam): Likewise.
* gimple-loop-versioning.cc (loop_versioning::max_insns_for_loop): Likewise.
* gimple-ssa-split-paths.c (is_feasible_trace): Likewise.
* gimple-ssa-store-merging.c (imm_store_chain_info::try_coalesce_bswap): Likewise.
(imm_store_chain_info::coalesce_immediate_stores): Likewise.
(imm_store_chain_info::output_merged_store): Likewise.
(pass_store_merging::process_store): Likewise.
* gimple-ssa-strength-reduction.c (find_basis_for_base_expr): Likewise.
* graphite-isl-ast-to-gimple.c (class translate_isl_ast_to_gimple): Likewise.
(scop_to_isl_ast): Likewise.
* graphite-optimize-isl.c (get_schedule_for_node_st): Likewise.
(optimize_isl): Likewise.
* graphite-scop-detection.c (build_scops): Likewise.
* haifa-sched.c (set_modulo_params): Likewise.
(rank_for_schedule): Likewise.
(model_add_to_worklist): Likewise.
(model_promote_insn): Likewise.
(model_choose_insn): Likewise.
(queue_to_ready): Likewise.
(autopref_multipass_dfa_lookahead_guard): Likewise.
(schedule_block): Likewise.
(sched_init): Likewise.
* hsa-gen.c (init_prologue): Likewise.
* ifcvt.c (bb_ok_for_noce_convert_multiple_sets): Likewise.
(cond_move_process_if_block): Likewise.
* ipa-cp.c (ipcp_lattice::add_value): Likewise.
(merge_agg_lats_step): Likewise.
(devirtualization_time_bonus): Likewise.
(hint_time_bonus): Likewise.
(incorporate_penalties): Likewise.
(good_cloning_opportunity_p): Likewise.
(ipcp_propagate_stage): Likewise.
* ipa-fnsummary.c (decompose_param_expr): Likewise.
(set_switch_stmt_execution_predicate): Likewise.
(analyze_function_body): Likewise.
(compute_fn_summary): Likewise.
* ipa-inline-analysis.c (estimate_growth): Likewise.
* ipa-inline.c (caller_growth_limits): Likewise.
(inline_insns_single): Likewise.
(inline_insns_auto): Likewise.
(can_inline_edge_by_limits_p): Likewise.
(want_early_inline_function_p): Likewise.
(big_speedup_p): Likewise.
(want_inline_small_function_p): Likewise.
(want_inline_self_recursive_call_p): Likewise.
(edge_badness): Likewise.
(recursive_inlining): Likewise.
(compute_max_insns): Likewise.
(early_inliner): Likewise.
* ipa-polymorphic-call.c (csftc_abort_walking_p): Likewise.
* ipa-profile.c (ipa_profile): Likewise.
* ipa-prop.c (determine_known_aggregate_parts): Likewise.
(ipa_analyze_node): Likewise.
(ipcp_transform_function): Likewise.
* ipa-split.c (consider_split): Likewise.
* ipa-sra.c (allocate_access): Likewise.
(process_scan_results): Likewise.
(ipa_sra_summarize_function): Likewise.
(pull_accesses_from_callee): Likewise.
* ira-build.c (loop_compare_func): Likewise.
(mark_loops_for_removal): Likewise.
* ira-conflicts.c (build_conflict_bit_table): Likewise.
* loop-doloop.c (doloop_optimize): Likewise.
* loop-invariant.c (gain_for_invariant): Likewise.
(move_loop_invariants): Likewise.
* loop-unroll.c (decide_unroll_constant_iterations): Likewise.
(decide_unroll_runtime_iterations): Likewise.
(decide_unroll_stupid): Likewise.
(expand_var_during_unrolling): Likewise.
* lra-assigns.c (spill_for): Likewise.
* lra-constraints.c (EBB_PROBABILITY_CUTOFF): Likewise.
* modulo-sched.c (sms_schedule): Likewise.
(DFA_HISTORY): Likewise.
* opts.c (default_options_optimization): Likewise.
(finish_options): Likewise.
(common_handle_option): Likewise.
* postreload-gcse.c (eliminate_partially_redundant_load): Likewise.
(if): Likewise.
* predict.c (get_hot_bb_threshold): Likewise.
(maybe_hot_count_p): Likewise.
(probably_never_executed): Likewise.
(predictable_edge_p): Likewise.
(predict_loops): Likewise.
(expr_expected_value_1): Likewise.
(tree_predict_by_opcode): Likewise.
(handle_missing_profiles): Likewise.
* reload.c (find_equiv_reg): Likewise.
* reorg.c (redundant_insn): Likewise.
* resource.c (mark_target_live_regs): Likewise.
(incr_ticks_for_insn): Likewise.
* sanopt.c (pass_sanopt::execute): Likewise.
* sched-deps.c (sched_analyze_1): Likewise.
(sched_analyze_2): Likewise.
(sched_analyze_insn): Likewise.
(deps_analyze_insn): Likewise.
* sched-ebb.c (schedule_ebbs): Likewise.
* sched-rgn.c (find_single_block_region): Likewise.
(too_large): Likewise.
(haifa_find_rgns): Likewise.
(extend_rgns): Likewise.
(new_ready): Likewise.
(schedule_region): Likewise.
(sched_rgn_init): Likewise.
* sel-sched-ir.c (make_region_from_loop): Likewise.
* sel-sched-ir.h (MAX_WS): Likewise.
* sel-sched.c (process_pipelined_exprs): Likewise.
(sel_setup_region_sched_flags): Likewise.
* shrink-wrap.c (try_shrink_wrapping): Likewise.
* targhooks.c (default_max_noce_ifcvt_seq_cost): Likewise.
* toplev.c (print_version): Likewise.
(process_options): Likewise.
* tracer.c (tail_duplicate): Likewise.
* trans-mem.c (tm_log_add): Likewise.
* tree-chrec.c (chrec_fold_plus_1): Likewise.
* tree-data-ref.c (split_constant_offset): Likewise.
(compute_all_dependences): Likewise.
* tree-if-conv.c (MAX_PHI_ARG_NUM): Likewise.
* tree-inline.c (remap_gimple_stmt): Likewise.
* tree-loop-distribution.c (MAX_DATAREFS_NUM): Likewise.
* tree-parloops.c (MIN_PER_THREAD): Likewise.
(create_parallel_loop): Likewise.
* tree-predcom.c (determine_unroll_factor): Likewise.
* tree-scalar-evolution.c (instantiate_scev_r): Likewise.
* tree-sra.c (analyze_all_variable_accesses): Likewise.
* tree-ssa-ccp.c (fold_builtin_alloca_with_align): Likewise.
* tree-ssa-dse.c (setup_live_bytes_from_ref): Likewise.
(dse_optimize_redundant_stores): Likewise.
(dse_classify_store): Likewise.
* tree-ssa-ifcombine.c (ifcombine_ifandif): Likewise.
* tree-ssa-loop-ch.c (ch_base::copy_headers): Likewise.
* tree-ssa-loop-im.c (LIM_EXPENSIVE): Likewise.
* tree-ssa-loop-ivcanon.c (try_unroll_loop_completely): Likewise.
(try_peel_loop): Likewise.
(tree_unroll_loops_completely): Likewise.
* tree-ssa-loop-ivopts.c (avg_loop_niter): Likewise.
(CONSIDER_ALL_CANDIDATES_BOUND): Likewise.
(MAX_CONSIDERED_GROUPS): Likewise.
(ALWAYS_PRUNE_CAND_SET_BOUND): Likewise.
* tree-ssa-loop-manip.c (can_unroll_loop_p): Likewise.
* tree-ssa-loop-niter.c (MAX_ITERATIONS_TO_TRACK): Likewise.
* tree-ssa-loop-prefetch.c (PREFETCH_BLOCK): Likewise.
(L1_CACHE_SIZE_BYTES): Likewise.
(L2_CACHE_SIZE_BYTES): Likewise.
(should_issue_prefetch_p): Likewise.
(schedule_prefetches): Likewise.
(determine_unroll_factor): Likewise.
(volume_of_references): Likewise.
(add_subscript_strides): Likewise.
(self_reuse_distance): Likewise.
(mem_ref_count_reasonable_p): Likewise.
(insn_to_prefetch_ratio_too_small_p): Likewise.
(loop_prefetch_arrays): Likewise.
(tree_ssa_prefetch_arrays): Likewise.
* tree-ssa-loop-unswitch.c (tree_unswitch_single_loop): Likewise.
* tree-ssa-math-opts.c (gimple_expand_builtin_pow): Likewise.
(convert_mult_to_fma): Likewise.
(math_opts_dom_walker::after_dom_children): Likewise.
* tree-ssa-phiopt.c (cond_if_else_store_replacement): Likewise.
(hoist_adjacent_loads): Likewise.
(gate_hoist_loads): Likewise.
* tree-ssa-pre.c (translate_vuse_through_block): Likewise.
(compute_partial_antic_aux): Likewise.
* tree-ssa-reassoc.c (get_reassociation_width): Likewise.
* tree-ssa-sccvn.c (vn_reference_lookup_pieces): Likewise.
(vn_reference_lookup): Likewise.
(do_rpo_vn): Likewise.
* tree-ssa-scopedtables.c (avail_exprs_stack::lookup_avail_expr): Likewise.
* tree-ssa-sink.c (select_best_block): Likewise.
* tree-ssa-strlen.c (new_stridx): Likewise.
(new_addr_stridx): Likewise.
(get_range_strlen_dynamic): Likewise.
(class ssa_name_limit_t): Likewise.
* tree-ssa-structalias.c (push_fields_onto_fieldstack): Likewise.
(create_variable_info_for_1): Likewise.
(init_alias_vars): Likewise.
* tree-ssa-tail-merge.c (find_clusters_1): Likewise.
(tail_merge_optimize): Likewise.
* tree-ssa-threadbackward.c (thread_jumps::profitable_jump_thread_path): Likewise.
(thread_jumps::fsm_find_control_statement_thread_paths): Likewise.
(thread_jumps::find_jump_threads_backwards): Likewise.
* tree-ssa-threadedge.c (record_temporary_equivalences_from_stmts_at_dest): Likewise.
* tree-ssa-uninit.c (compute_control_dep_chain): Likewise.
* tree-switch-conversion.c (switch_conversion::check_range): Likewise.
(jump_table_cluster::can_be_handled): Likewise.
* tree-switch-conversion.h (jump_table_cluster::case_values_threshold): Likewise.
(SWITCH_CONVERSION_BRANCH_RATIO): Likewise.
(param_switch_conversion_branch_ratio): Likewise.
* tree-vect-data-refs.c (vect_mark_for_runtime_alias_test): Likewise.
(vect_enhance_data_refs_alignment): Likewise.
(vect_prune_runtime_alias_test_list): Likewise.
* tree-vect-loop.c (vect_analyze_loop_costing): Likewise.
(vect_get_datarefs_in_loop): Likewise.
(vect_analyze_loop): Likewise.
* tree-vect-slp.c (vect_slp_bb): Likewise.
* tree-vectorizer.h: Likewise.
* tree-vrp.c (find_switch_asserts): Likewise.
(vrp_prop::check_mem_ref): Likewise.
* tree.c (wide_int_to_tree_1): Likewise.
(cache_integer_cst): Likewise.
* var-tracking.c (EXPR_USE_DEPTH): Likewise.
(reverse_op): Likewise.
(vt_find_locations): Likewise.
gcc/c/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* gimple-parser.c (c_parser_parse_gimple_body): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
gcc/cp/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* name-lookup.c (namespace_hints::namespace_hints): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
* typeck.c (comptypes): Likewise.
gcc/lto/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* lto-partition.c (lto_balanced_map): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
* lto.c (do_whole_program_analysis): Likewise.
---
gcc/asan.c | 18 ++--
gcc/auto-profile.c | 2 +-
gcc/bb-reorder.c | 4 +-
gcc/builtins.c | 2 +-
gcc/c/gimple-parser.c | 2 +-
gcc/cfgcleanup.c | 4 +-
gcc/cfgexpand.c | 8 +-
gcc/cfgloopanal.c | 8 +-
gcc/cgraph.c | 2 +-
gcc/combine.c | 4 +-
gcc/common/config/aarch64/aarch64-common.c | 15 ++--
gcc/common/config/ia64/ia64-common.c | 8 +-
.../config/powerpcspe/powerpcspe-common.c | 2 +-
gcc/common/config/rs6000/rs6000-common.c | 2 +-
gcc/common/config/sh/sh-common.c | 2 +-
gcc/config/aarch64/aarch64.c | 79 ++++++++----------
gcc/config/alpha/alpha.c | 16 ++--
gcc/config/arm/arm.c | 43 ++++------
gcc/config/i386/i386-options.c | 32 +++----
gcc/config/i386/i386.c | 26 +++---
gcc/config/ia64/ia64.c | 2 +-
gcc/config/rs6000/rs6000-logue.c | 4 +-
gcc/config/rs6000/rs6000.c | 55 ++++++------
gcc/config/s390/s390.c | 79 ++++++------------
gcc/config/sparc/sparc.c | 83 +++++++++----------
gcc/config/visium/visium.c | 6 +-
gcc/coverage.c | 8 +-
gcc/cp/name-lookup.c | 2 +-
gcc/cp/typeck.c | 4 +-
gcc/cse.c | 6 +-
gcc/cselib.c | 2 +-
gcc/dse.c | 2 +-
gcc/emit-rtl.c | 18 ++--
gcc/explow.c | 2 +-
gcc/final.c | 4 +-
gcc/fold-const.c | 12 +--
gcc/gcse.c | 16 ++--
gcc/ggc-common.c | 4 +-
gcc/ggc-page.c | 4 +-
gcc/gimple-loop-interchange.cc | 6 +-
gcc/gimple-loop-jam.c | 8 +-
gcc/gimple-loop-versioning.cc | 4 +-
gcc/gimple-ssa-split-paths.c | 2 +-
gcc/gimple-ssa-store-merging.c | 8 +-
gcc/gimple-ssa-strength-reduction.c | 2 +-
gcc/graphite-isl-ast-to-gimple.c | 4 +-
gcc/graphite-optimize-isl.c | 4 +-
gcc/graphite-scop-detection.c | 4 +-
gcc/haifa-sched.c | 38 ++++-----
gcc/hsa-gen.c | 2 +-
gcc/ifcvt.c | 4 +-
gcc/ipa-cp.c | 30 +++----
gcc/ipa-fnsummary.c | 20 ++---
gcc/ipa-inline-analysis.c | 2 +-
gcc/ipa-inline.c | 77 +++++++++--------
gcc/ipa-polymorphic-call.c | 2 +-
gcc/ipa-profile.c | 2 +-
gcc/ipa-prop.c | 6 +-
gcc/ipa-split.c | 10 +--
gcc/ipa-sra.c | 9 +-
gcc/ira-build.c | 4 +-
gcc/ira-conflicts.c | 4 +-
gcc/loop-doloop.c | 2 +-
gcc/loop-invariant.c | 4 +-
gcc/loop-unroll.c | 26 +++---
gcc/lra-assigns.c | 2 +-
gcc/lra-constraints.c | 2 +-
gcc/lto/lto-partition.c | 10 +--
gcc/lto/lto.c | 10 +--
gcc/modulo-sched.c | 6 +-
gcc/opts.c | 48 ++++-------
gcc/postreload-gcse.c | 6 +-
gcc/predict.c | 20 ++---
gcc/reload.c | 2 +-
gcc/reorg.c | 4 +-
gcc/resource.c | 4 +-
gcc/sanopt.c | 4 +-
gcc/sched-deps.c | 10 +--
gcc/sched-ebb.c | 4 +-
gcc/sched-rgn.c | 18 ++--
gcc/sel-sched-ir.c | 4 +-
gcc/sel-sched-ir.h | 2 +-
gcc/sel-sched.c | 4 +-
gcc/shrink-wrap.c | 2 +-
gcc/targhooks.c | 21 ++---
gcc/toplev.c | 4 +-
gcc/tracer.c | 12 +--
gcc/trans-mem.c | 2 +-
gcc/tree-chrec.c | 4 +-
gcc/tree-data-ref.c | 4 +-
gcc/tree-if-conv.c | 2 +-
gcc/tree-inline.c | 2 +-
gcc/tree-loop-distribution.c | 2 +-
gcc/tree-parloops.c | 18 ++--
gcc/tree-predcom.c | 2 +-
gcc/tree-scalar-evolution.c | 4 +-
gcc/tree-sra.c | 19 +++--
gcc/tree-ssa-ccp.c | 2 +-
gcc/tree-ssa-dse.c | 8 +-
gcc/tree-ssa-ifcombine.c | 4 +-
gcc/tree-ssa-loop-ch.c | 2 +-
gcc/tree-ssa-loop-im.c | 2 +-
gcc/tree-ssa-loop-ivcanon.c | 18 ++--
gcc/tree-ssa-loop-ivopts.c | 10 +--
gcc/tree-ssa-loop-manip.c | 2 +-
gcc/tree-ssa-loop-niter.c | 2 +-
gcc/tree-ssa-loop-prefetch.c | 46 +++++-----
gcc/tree-ssa-loop-unswitch.c | 6 +-
gcc/tree-ssa-math-opts.c | 6 +-
gcc/tree-ssa-phiopt.c | 8 +-
gcc/tree-ssa-pre.c | 4 +-
gcc/tree-ssa-reassoc.c | 2 +-
gcc/tree-ssa-sccvn.c | 6 +-
gcc/tree-ssa-scopedtables.c | 2 +-
gcc/tree-ssa-sink.c | 2 +-
gcc/tree-ssa-strlen.c | 8 +-
gcc/tree-ssa-structalias.c | 8 +-
gcc/tree-ssa-tail-merge.c | 4 +-
gcc/tree-ssa-threadbackward.c | 16 ++--
gcc/tree-ssa-threadedge.c | 4 +-
gcc/tree-ssa-uninit.c | 2 +-
gcc/tree-switch-conversion.c | 6 +-
gcc/tree-switch-conversion.h | 4 +-
gcc/tree-vect-data-refs.c | 11 ++-
gcc/tree-vect-loop.c | 6 +-
gcc/tree-vect-slp.c | 2 +-
gcc/tree-vectorizer.h | 2 +-
gcc/tree-vrp.c | 4 +-
gcc/tree.c | 22 ++---
gcc/var-tracking.c | 6 +-
130 files changed, 640 insertions(+), 731 deletions(-)
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #2: 0003-Apply-mechanical-replacement-generated-patch.patch --]
[-- Type: text/x-patch; name="0003-Apply-mechanical-replacement-generated-patch.patch", Size: 189307 bytes --]
diff --git a/gcc/asan.c b/gcc/asan.c
index a731bd490b4..406d829125d 100644
--- a/gcc/asan.c
+++ b/gcc/asan.c
@@ -309,13 +309,13 @@ asan_mark_p (gimple *stmt, enum asan_mark_flags flag)
bool
asan_sanitize_stack_p (void)
{
- return (sanitize_flags_p (SANITIZE_ADDRESS) && ASAN_STACK);
+ return (sanitize_flags_p (SANITIZE_ADDRESS) && param_asan_stack);
}
bool
asan_sanitize_allocas_p (void)
{
- return (asan_sanitize_stack_p () && ASAN_PROTECT_ALLOCAS);
+ return (asan_sanitize_stack_p () && param_asan_protect_allocas);
}
/* Checks whether section SEC should be sanitized. */
@@ -1429,7 +1429,7 @@ asan_emit_stack_protection (rtx base, rtx pbase, unsigned int alignb,
/* Emit the prologue sequence. */
if (asan_frame_size > 32 && asan_frame_size <= 65536 && pbase
- && ASAN_USE_AFTER_RETURN)
+ && param_asan_use_after_return)
{
use_after_return_class = floor_log2 (asan_frame_size - 1) - 5;
/* __asan_stack_malloc_N guarantees alignment
@@ -1750,7 +1750,7 @@ is_odr_indicator (tree decl)
bool
asan_protect_global (tree decl, bool ignore_decl_rtl_set_p)
{
- if (!ASAN_GLOBALS)
+ if (!param_asan_globals)
return false;
rtx rtl, symbol;
@@ -2190,9 +2190,9 @@ static void
instrument_derefs (gimple_stmt_iterator *iter, tree t,
location_t location, bool is_store)
{
- if (is_store && !ASAN_INSTRUMENT_WRITES)
+ if (is_store && !param_asan_instrument_writes)
return;
- if (!is_store && !ASAN_INSTRUMENT_READS)
+ if (!is_store && !param_asan_instrument_reads)
return;
tree type, base;
@@ -2253,7 +2253,7 @@ instrument_derefs (gimple_stmt_iterator *iter, tree t,
{
if (DECL_THREAD_LOCAL_P (inner))
return;
- if (!ASAN_GLOBALS && is_global_var (inner))
+ if (!param_asan_globals && is_global_var (inner))
return;
if (!TREE_STATIC (inner))
{
@@ -2346,7 +2346,7 @@ instrument_mem_region_access (tree base, tree len,
static bool
instrument_builtin_call (gimple_stmt_iterator *iter)
{
- if (!ASAN_MEMINTRIN)
+ if (!param_asan_memintrin)
return false;
bool iter_advanced_p = false;
@@ -3219,7 +3219,7 @@ asan_expand_mark_ifn (gimple_stmt_iterator *iter)
tree base_addr = gimple_assign_lhs (g);
/* Generate direct emission if size_in_bytes is small. */
- if (size_in_bytes <= ASAN_PARAM_USE_AFTER_SCOPE_DIRECT_EMISSION_THRESHOLD)
+ if (size_in_bytes <= (unsigned)param_use_after_scope_direct_emission_threshold)
{
const unsigned HOST_WIDE_INT shadow_size
= shadow_mem_size (size_in_bytes);
diff --git a/gcc/auto-profile.c b/gcc/auto-profile.c
index ee1a83abce2..4fd1df6fa7f 100644
--- a/gcc/auto-profile.c
+++ b/gcc/auto-profile.c
@@ -1631,7 +1631,7 @@ auto_profile (void)
function before annotation, so the profile inside bar@loc_foo2
will be useful. */
autofdo::stmt_set promoted_stmts;
- for (int i = 0; i < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS); i++)
+ for (int i = 0; i < param_early_inliner_max_iterations; i++)
{
if (!flag_value_profile_transformations
|| !autofdo::afdo_vpt_for_early_inline (&promoted_stmts))
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c
index 0ac39140c6c..6a85c2a7fc0 100644
--- a/gcc/bb-reorder.c
+++ b/gcc/bb-reorder.c
@@ -1371,7 +1371,7 @@ copy_bb_p (const_basic_block bb, int code_may_grow)
return false;
if (code_may_grow && optimize_bb_for_speed_p (bb))
- max_size *= PARAM_VALUE (PARAM_MAX_GROW_COPY_BB_INSNS);
+ max_size *= param_max_grow_copy_bb_insns;
FOR_BB_INSNS (bb, insn)
{
@@ -2751,7 +2751,7 @@ duplicate_computed_gotos (function *fun)
/* Never copy a block larger than this. */
int max_size
- = uncond_jump_length * PARAM_VALUE (PARAM_MAX_GOTO_DUPLICATION_INSNS);
+ = uncond_jump_length * param_max_goto_duplication_insns;
bool changed = false;
diff --git a/gcc/builtins.c b/gcc/builtins.c
index 245fad02d9c..68baeb9bbe9 100644
--- a/gcc/builtins.c
+++ b/gcc/builtins.c
@@ -7214,7 +7214,7 @@ inline_expand_builtin_string_cmp (tree exp, rtx target)
/* If the length of the comparision is larger than the threshold,
do nothing. */
if (length > (unsigned HOST_WIDE_INT)
- PARAM_VALUE (BUILTIN_STRING_CMP_INLINE_LENGTH))
+ param_builtin_string_cmp_inline_length)
return NULL_RTX;
machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
diff --git a/gcc/c/gimple-parser.c b/gcc/c/gimple-parser.c
index ceec758ffbe..e40cfa2ec01 100644
--- a/gcc/c/gimple-parser.c
+++ b/gcc/c/gimple-parser.c
@@ -354,7 +354,7 @@ c_parser_parse_gimple_body (c_parser *cparser, char *gimple_pass,
if (cfun->curr_properties & PROP_cfg)
{
ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = entry_bb_count;
- gcov_type t = PARAM_VALUE (PARAM_GIMPLE_FE_COMPUTED_HOT_BB_THRESHOLD);
+ gcov_type t = param_gimple_fe_computed_hot_bb_threshold;
set_hot_bb_threshold (t);
update_max_bb_count ();
cgraph_node::get_create (cfun->decl);
diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c
index 835f7d79ea4..7b1dd245487 100644
--- a/gcc/cfgcleanup.c
+++ b/gcc/cfgcleanup.c
@@ -2022,7 +2022,7 @@ try_crossjump_to_edge (int mode, edge e1, edge e2,
of matching instructions or the 'from' block was totally matched
(such that its predecessors will hopefully be redirected and the
block removed). */
- if ((nmatch < PARAM_VALUE (PARAM_MIN_CROSSJUMP_INSNS))
+ if ((nmatch < param_min_crossjump_insns)
&& (newpos1 != BB_HEAD (src1)))
return false;
@@ -2215,7 +2215,7 @@ try_crossjump_bb (int mode, basic_block bb)
a block that falls through into BB, as that adds no branches to the
program. We'll try that combination first. */
fallthru = NULL;
- max = PARAM_VALUE (PARAM_MAX_CROSSJUMP_EDGES);
+ max = param_max_crossjump_edges;
if (EDGE_COUNT (bb->preds) > max)
return false;
diff --git a/gcc/cfgexpand.c b/gcc/cfgexpand.c
index c34a53b526b..5fed0738211 100644
--- a/gcc/cfgexpand.c
+++ b/gcc/cfgexpand.c
@@ -1548,7 +1548,7 @@ defer_stack_allocation (tree var, bool toplevel)
bool smallish
= (poly_int_tree_p (size_unit, &size)
&& (estimated_poly_value (size)
- < PARAM_VALUE (PARAM_MIN_SIZE_FOR_STACK_SHARING)));
+ < param_min_size_for_stack_sharing));
/* If stack protection is enabled, *all* stack variables must be deferred,
so that we can re-order the strings to the top of the frame.
@@ -1788,7 +1788,7 @@ stack_protect_classify_type (tree type)
|| t == signed_char_type_node
|| t == unsigned_char_type_node)
{
- unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE);
+ unsigned HOST_WIDE_INT max = param_ssp_buffer_size;
unsigned HOST_WIDE_INT len;
if (!TYPE_SIZE_UNIT (type)
@@ -6435,7 +6435,7 @@ pass_expand::execute (function *fun)
warning (OPT_Wstack_protector,
"stack protector not protecting function: "
"all local arrays are less than %d bytes long",
- (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE));
+ (int) param_ssp_buffer_size);
}
/* Set up parameters and prepare for return, for the function. */
@@ -6545,7 +6545,7 @@ pass_expand::execute (function *fun)
/* If the function has too many markers, drop them while expanding. */
if (cfun->debug_marker_count
- >= PARAM_VALUE (PARAM_MAX_DEBUG_MARKER_COUNT))
+ >= param_max_debug_marker_count)
cfun->debug_nonbind_markers = false;
lab_rtx_for_bb = new hash_map<basic_block, rtx_code_label *>;
diff --git a/gcc/cfgloopanal.c b/gcc/cfgloopanal.c
index 95ec929c7bd..84516efcfb6 100644
--- a/gcc/cfgloopanal.c
+++ b/gcc/cfgloopanal.c
@@ -256,7 +256,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
else if (loop->latch && (loop->latch->count.initialized_p ()
|| loop->header->count.initialized_p ()))
@@ -274,7 +274,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
else if (!count_in.nonzero_p ())
{
@@ -295,7 +295,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
if (!by_profile_only)
@@ -427,7 +427,7 @@ estimate_reg_pressure_cost (unsigned n_new, unsigned n_old, bool speed,
if (optimize && (flag_ira_region == IRA_REGION_ALL
|| flag_ira_region == IRA_REGION_MIXED)
- && number_of_loops (cfun) <= (unsigned) IRA_MAX_LOOPS_NUM)
+ && number_of_loops (cfun) <= (unsigned) param_ira_max_loops_num)
/* IRA regional allocation deals with high register pressure
better. So decrease the cost (to do more accurate the cost
calculation for IRA, we need to know how many registers lives
diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index 699209654f8..62a36c9f6c1 100644
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -2738,7 +2738,7 @@ cgraph_edge::maybe_hot_p (void)
if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE
&& sreal_frequency () * 2 < 3)
return false;
- if (sreal_frequency () * PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION) <= 1)
+ if (sreal_frequency () * param_hot_bb_frequency_fraction <= 1)
return false;
return true;
}
diff --git a/gcc/combine.c b/gcc/combine.c
index 857ea30dafd..ae3bc468910 100644
--- a/gcc/combine.c
+++ b/gcc/combine.c
@@ -1251,7 +1251,7 @@ combine_instructions (rtx_insn *f, unsigned int nregs)
init_reg_last ();
setup_incoming_promotions (first);
last_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
- int max_combine = PARAM_VALUE (PARAM_MAX_COMBINE_INSNS);
+ int max_combine = param_max_combine_insns;
FOR_EACH_BB_FN (this_basic_block, cfun)
{
@@ -13282,7 +13282,7 @@ record_value_for_reg (rtx reg, rtx_insn *insn, rtx value)
{
/* If there are two or more occurrences of REG in VALUE,
prevent the value from growing too much. */
- if (count_rtxs (tem) > MAX_LAST_VALUE_RTL)
+ if (count_rtxs (tem) > param_max_last_value_rtl)
tem = gen_rtx_CLOBBER (GET_MODE (tem), const0_rtx);
}
diff --git a/gcc/common/config/aarch64/aarch64-common.c b/gcc/common/config/aarch64/aarch64-common.c
index 07c03253951..adb3ff71af8 100644
--- a/gcc/common/config/aarch64/aarch64-common.c
+++ b/gcc/common/config/aarch64/aarch64-common.c
@@ -73,7 +73,7 @@ static bool
aarch64_option_validate_param (const int value, const int param)
{
/* Check that both parameters are the same. */
- if (param == (int) PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE)
+ if (param == param_stack_clash_protection_guard_size)
{
if (value != 12 && value != 16)
{
@@ -93,18 +93,15 @@ static void
aarch64_option_default_params (void)
{
/* We assume the guard page is 64k. */
- int index = (int) PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE;
- set_default_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE,
- DEFAULT_STK_CLASH_GUARD_SIZE == 0
- ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE);
+ int index = (int) param_stack_clash_protection_guard_size;
+ param_stack_clash_protection_guard_size
+ = (DEFAULT_STK_CLASH_GUARD_SIZE == 0 ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE);
- int guard_size
- = default_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ int guard_size = param_stack_clash_protection_guard_size;
/* Set the interval parameter to be the same as the guard size. This way the
mid-end code does the right thing for us. */
- set_default_param_value (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL,
- guard_size);
+ param_stack_clash_protection_probe_interval = guard_size;
/* Validate the options. */
aarch64_option_validate_param (guard_size, index);
diff --git a/gcc/common/config/ia64/ia64-common.c b/gcc/common/config/ia64/ia64-common.c
index 02e297ad69b..0a187160fd2 100644
--- a/gcc/common/config/ia64/ia64-common.c
+++ b/gcc/common/config/ia64/ia64-common.c
@@ -88,13 +88,13 @@ static void
ia64_option_default_params (void)
{
/* Let the scheduler form additional regions. */
- set_default_param_value (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS, 2);
+ param_max_sched_extend_regions_iters = 2;
/* Set the default values for cache-related parameters. */
- set_default_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 6);
- set_default_param_value (PARAM_L1_CACHE_LINE_SIZE, 32);
+ param_simultaneous_prefetches = 6;
+ param_l1_cache_line_size = 32;
- set_default_param_value (PARAM_SCHED_MEM_TRUE_DEP_COST, 4);
+ param_sched_mem_true_dep_cost = 4;
}
#undef TARGET_OPTION_OPTIMIZATION_TABLE
diff --git a/gcc/common/config/powerpcspe/powerpcspe-common.c b/gcc/common/config/powerpcspe/powerpcspe-common.c
index c949a601f57..7043a4bda31 100644
--- a/gcc/common/config/powerpcspe/powerpcspe-common.c
+++ b/gcc/common/config/powerpcspe/powerpcspe-common.c
@@ -57,7 +57,7 @@ static void
rs6000_option_default_params (void)
{
/* Double growth factor to counter reduced min jump length. */
- set_default_param_value (PARAM_MAX_GROW_COPY_BB_INSNS, 16);
+ param_max_grow_copy_bb_insns = 16;
}
/* If not otherwise specified by a target, make 'long double' equivalent to
diff --git a/gcc/common/config/rs6000/rs6000-common.c b/gcc/common/config/rs6000/rs6000-common.c
index b9471964a66..afc1a0cfcbc 100644
--- a/gcc/common/config/rs6000/rs6000-common.c
+++ b/gcc/common/config/rs6000/rs6000-common.c
@@ -69,7 +69,7 @@ static void
rs6000_option_default_params (void)
{
/* Double growth factor to counter reduced min jump length. */
- set_default_param_value (PARAM_MAX_GROW_COPY_BB_INSNS, 16);
+ param_max_grow_copy_bb_insns = 16;
}
/* If not otherwise specified by a target, make 'long double' equivalent to
diff --git a/gcc/common/config/sh/sh-common.c b/gcc/common/config/sh/sh-common.c
index 4a92146f0af..e6ecc3a632a 100644
--- a/gcc/common/config/sh/sh-common.c
+++ b/gcc/common/config/sh/sh-common.c
@@ -149,7 +149,7 @@ sh_handle_option (struct gcc_options *opts,
static void
sh_option_default_params (void)
{
- set_default_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 2);
+ param_simultaneous_prefetches = 2;
}
#undef TARGET_OPTION_OPTIMIZATION_TABLE
diff --git a/gcc/config/aarch64/aarch64.c b/gcc/config/aarch64/aarch64.c
index 1dfff331a5a..c4783861c5d 100644
--- a/gcc/config/aarch64/aarch64.c
+++ b/gcc/config/aarch64/aarch64.c
@@ -5589,7 +5589,7 @@ aarch64_output_probe_stack_range (rtx reg1, rtx reg2)
ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, loop_lab);
HOST_WIDE_INT stack_clash_probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
/* TEST_ADDR = TEST_ADDR + PROBE_INTERVAL. */
xops[0] = reg1;
@@ -6842,7 +6842,7 @@ aarch64_allocate_and_probe_stack_space (rtx temp1, rtx temp2,
bool final_adjustment_p)
{
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
HOST_WIDE_INT guard_used_by_caller = STACK_CLASH_CALLER_GUARD;
HOST_WIDE_INT min_probe_threshold
= (final_adjustment_p
@@ -7364,7 +7364,7 @@ aarch64_expand_epilogue (bool for_sibcall)
for each allocation. For stack clash we are in a usable state if
the adjustment is less than GUARD_SIZE - GUARD_USED_BY_CALLER. */
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
HOST_WIDE_INT guard_used_by_caller = STACK_CLASH_CALLER_GUARD;
/* We can re-use the registers when:
@@ -13306,73 +13306,62 @@ aarch64_override_options_internal (struct gcc_options *opts)
/* We don't mind passing in global_options_set here as we don't use
the *options_set structs anyway. */
- maybe_set_param_value (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH,
- queue_depth,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_sched_autopref_queue_depth, queue_depth);
/* Set up parameters to be used in prefetching algorithm. Do not
override the defaults unless we are tuning for a core we have
researched values for. */
if (aarch64_tune_params.prefetch->num_slots > 0)
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- aarch64_tune_params.prefetch->num_slots,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_simultaneous_prefetches,
+ aarch64_tune_params.prefetch->num_slots);
if (aarch64_tune_params.prefetch->l1_cache_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- aarch64_tune_params.prefetch->l1_cache_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l1_cache_size,
+ aarch64_tune_params.prefetch->l1_cache_size);
if (aarch64_tune_params.prefetch->l1_cache_line_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- aarch64_tune_params.prefetch->l1_cache_line_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l1_cache_line_size,
+ aarch64_tune_params.prefetch->l1_cache_line_size);
if (aarch64_tune_params.prefetch->l2_cache_size >= 0)
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- aarch64_tune_params.prefetch->l2_cache_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l2_cache_size,
+ aarch64_tune_params.prefetch->l2_cache_size);
if (!aarch64_tune_params.prefetch->prefetch_dynamic_strides)
- maybe_set_param_value (PARAM_PREFETCH_DYNAMIC_STRIDES,
- 0,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_prefetch_dynamic_strides, 0);
if (aarch64_tune_params.prefetch->minimum_stride >= 0)
- maybe_set_param_value (PARAM_PREFETCH_MINIMUM_STRIDE,
- aarch64_tune_params.prefetch->minimum_stride,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_prefetch_minimum_stride,
+ aarch64_tune_params.prefetch->minimum_stride);
/* Use the alternative scheduling-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM, SCHED_PRESSURE_MODEL,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_sched_pressure_algorithm,
+ SCHED_PRESSURE_MODEL);
/* If the user hasn't changed it via configure then set the default to 64 KB
for the backend. */
- maybe_set_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE,
- DEFAULT_STK_CLASH_GUARD_SIZE == 0
- ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_stack_clash_protection_guard_size,
+ (DEFAULT_STK_CLASH_GUARD_SIZE == 0
+ ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE));
/* Validate the guard size. */
- int guard_size = PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ int guard_size = param_stack_clash_protection_guard_size;
/* Enforce that interval is the same size as size so the mid-end does the
right thing. */
- maybe_set_param_value (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL,
- guard_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_stack_clash_protection_probe_interval,
+ guard_size);
/* The maybe_set calls won't update the value if the user has explicitly set
one. Which means we need to validate that probing interval and guard size
are equal. */
int probe_interval
- = PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = param_stack_clash_protection_probe_interval;
if (guard_size != probe_interval)
error ("stack clash guard size %<%d%> must be equal to probing interval "
"%<%d%>", guard_size, probe_interval);
diff --git a/gcc/config/alpha/alpha.c b/gcc/config/alpha/alpha.c
index a7d5454b574..8f389ead32d 100644
--- a/gcc/config/alpha/alpha.c
+++ b/gcc/config/alpha/alpha.c
@@ -68,6 +68,7 @@ along with GCC; see the file COPYING3. If not see
#include "builtins.h"
#include "rtl-iter.h"
#include "flags.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -484,17 +485,14 @@ alpha_option_override (void)
}
if (line_size)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE, line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size, line_size);
if (l1_size)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, l1_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size, l1_size);
if (l2_size)
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, l2_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size, l2_size);
/* Do some sanity checks on the above options. */
diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
index eddd3ca93ed..4437a5bc509 100644
--- a/gcc/config/arm/arm.c
+++ b/gcc/config/arm/arm.c
@@ -3521,9 +3521,8 @@ arm_option_override (void)
but measurable, size reduction for PIC code. Therefore, we decrease
the bar for unrestricted expression hoisting to the cost of PIC address
calculation, which is 2 instructions. */
- maybe_set_param_value (PARAM_GCSE_UNRESTRICTED_COST, 2,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_gcse_unrestricted_cost, 2);
/* ARM EABI defaults to strict volatile bitfields. */
if (TARGET_AAPCS_BASED && flag_strict_volatile_bitfields < 0
@@ -3543,47 +3542,43 @@ arm_option_override (void)
override the defaults unless we are tuning for a core we have
researched values for. */
if (current_tune->prefetch.num_slots > 0)
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- current_tune->prefetch.num_slots,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ current_tune->prefetch.num_slots);
if (current_tune->prefetch.l1_cache_line_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- current_tune->prefetch.l1_cache_line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ current_tune->prefetch.l1_cache_line_size);
if (current_tune->prefetch.l1_cache_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- current_tune->prefetch.l1_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ current_tune->prefetch.l1_cache_size);
/* Look through ready list and all of queue for instructions
relevant for L2 auto-prefetcher. */
- int param_sched_autopref_queue_depth;
+ int sched_autopref_queue_depth;
switch (current_tune->sched_autopref)
{
case tune_params::SCHED_AUTOPREF_OFF:
- param_sched_autopref_queue_depth = -1;
+ sched_autopref_queue_depth = -1;
break;
case tune_params::SCHED_AUTOPREF_RANK:
- param_sched_autopref_queue_depth = 0;
+ sched_autopref_queue_depth = 0;
break;
case tune_params::SCHED_AUTOPREF_FULL:
- param_sched_autopref_queue_depth = max_insn_queue_index + 1;
+ sched_autopref_queue_depth = max_insn_queue_index + 1;
break;
default:
gcc_unreachable ();
}
- maybe_set_param_value (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH,
- param_sched_autopref_queue_depth,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_sched_autopref_queue_depth,
+ sched_autopref_queue_depth);
/* Currently, for slow flash data, we just disable literal pools. We also
disable it for pure-code. */
@@ -31740,8 +31735,6 @@ arm_valid_target_attribute_p (tree fndecl, tree ARG_UNUSED (name),
DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl) = new_optimize;
- finalize_options_struct (&func_options);
-
return ret;
}
diff --git a/gcc/config/i386/i386-options.c b/gcc/config/i386/i386-options.c
index dfc8ae23ba0..72cd6dcc98c 100644
--- a/gcc/config/i386/i386-options.c
+++ b/gcc/config/i386/i386-options.c
@@ -2618,22 +2618,14 @@ ix86_option_override_internal (bool main_args_p,
if (!TARGET_SCHEDULE)
opts->x_flag_schedule_insns_after_reload = opts->x_flag_schedule_insns = 0;
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- ix86_tune_cost->simultaneous_prefetches,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- ix86_tune_cost->prefetch_block,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- ix86_tune_cost->l1_cache_size,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- ix86_tune_cost->l2_cache_size,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_simultaneous_prefetches,
+ ix86_tune_cost->simultaneous_prefetches);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_line_size,
+ ix86_tune_cost->prefetch_block);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_size,
+ ix86_tune_cost->l1_cache_size);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l2_cache_size,
+ ix86_tune_cost->l2_cache_size);
/* Enable sw prefetching at -O3 for CPUS that prefetching is helpful. */
if (opts->x_flag_prefetch_loop_arrays < 0
@@ -2868,13 +2860,9 @@ ix86_option_override_internal (bool main_args_p,
= (cf_protection_level) (opts->x_flag_cf_protection | CF_SET);
if (ix86_tune_features [X86_TUNE_AVOID_256FMA_CHAINS])
- maybe_set_param_value (PARAM_AVOID_FMA_MAX_BITS, 256,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_avoid_fma_max_bits, 256);
else if (ix86_tune_features [X86_TUNE_AVOID_128FMA_CHAINS])
- maybe_set_param_value (PARAM_AVOID_FMA_MAX_BITS, 128,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_avoid_fma_max_bits, 128);
/* PR86952: jump table usage with retpolines is slow.
The PR provides some numbers about the slowness. */
diff --git a/gcc/config/i386/i386.c b/gcc/config/i386/i386.c
index 03a7082d2fc..f775697f982 100644
--- a/gcc/config/i386/i386.c
+++ b/gcc/config/i386/i386.c
@@ -5773,7 +5773,7 @@ get_probe_interval (void)
{
if (flag_stack_clash_protection)
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL));
+ << param_stack_clash_protection_probe_interval);
else
return (HOST_WIDE_INT_1U << STACK_CHECK_PROBE_INTERVAL_EXP);
}
@@ -6942,7 +6942,7 @@ ix86_adjust_stack_and_probe_stack_clash (HOST_WIDE_INT size,
/* If we allocate less than the size of the guard statically,
then no probing is necessary, but we do need to allocate
the stack. */
- if (size < (1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE)))
+ if (size < (1 << param_stack_clash_protection_guard_size))
{
pro_epilogue_adjust_stack (stack_pointer_rtx, stack_pointer_rtx,
GEN_INT (-size), -1,
@@ -21468,18 +21468,18 @@ static unsigned int
ix86_max_noce_ifcvt_seq_cost (edge e)
{
bool predictable_p = predictable_edge_p (e);
-
- enum compiler_param param
- = (predictable_p
- ? PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST
- : PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST);
-
- /* If we have a parameter set, use that, otherwise take a guess using
- BRANCH_COST. */
- if (global_options_set.x_param_values[param])
- return PARAM_VALUE (param);
+ if (predictable_p)
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_predictable_cost)
+ return param_max_rtl_if_conversion_predictable_cost;
+ }
else
- return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (2);
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_unpredictable_cost)
+ return param_max_rtl_if_conversion_unpredictable_cost;
+ }
+
+ return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (2);
}
/* Return true if SEQ is a good candidate as a replacement for the
diff --git a/gcc/config/ia64/ia64.c b/gcc/config/ia64/ia64.c
index 7697e907aea..44f7f2eea06 100644
--- a/gcc/config/ia64/ia64.c
+++ b/gcc/config/ia64/ia64.c
@@ -7307,7 +7307,7 @@ ia64_adjust_cost (rtx_insn *insn, int dep_type1, rtx_insn *dep_insn,
if (dw == MIN_DEP_WEAK)
/* Store and load are likely to alias, use higher cost to avoid stall. */
- return PARAM_VALUE (PARAM_SCHED_MEM_TRUE_DEP_COST);
+ return param_sched_mem_true_dep_cost;
else if (dw > MIN_DEP_WEAK)
{
/* Store and load are less likely to alias. */
diff --git a/gcc/config/rs6000/rs6000-logue.c b/gcc/config/rs6000/rs6000-logue.c
index 04aae8052db..f0fd2065c02 100644
--- a/gcc/config/rs6000/rs6000-logue.c
+++ b/gcc/config/rs6000/rs6000-logue.c
@@ -1515,14 +1515,14 @@ static HOST_WIDE_INT
get_stack_clash_protection_probe_interval (void)
{
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL));
+ << param_stack_clash_protection_probe_interval);
}
static HOST_WIDE_INT
get_stack_clash_protection_guard_size (void)
{
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE));
+ << param_stack_clash_protection_guard_size);
}
/* Allocate ORIG_SIZE bytes on the stack and probe the newly
diff --git a/gcc/config/rs6000/rs6000.c b/gcc/config/rs6000/rs6000.c
index d9d275b01c0..0e9e5a79c54 100644
--- a/gcc/config/rs6000/rs6000.c
+++ b/gcc/config/rs6000/rs6000.c
@@ -80,6 +80,7 @@
#include "tree-vrp.h"
#include "tree-ssanames.h"
#include "rs6000-internal.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -4511,46 +4512,38 @@ rs6000_option_override_internal (bool global_init_p)
if (global_init_p)
{
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- rs6000_cost->simultaneous_prefetches,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, rs6000_cost->l1_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- rs6000_cost->cache_line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, rs6000_cost->l2_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ rs6000_cost->simultaneous_prefetches);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ rs6000_cost->l1_cache_size);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ rs6000_cost->cache_line_size);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size,
+ rs6000_cost->l2_cache_size);
/* Increase loop peeling limits based on performance analysis. */
- maybe_set_param_value (PARAM_MAX_PEELED_INSNS, 400,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEELED_INSNS, 400,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_peeled_insns, 400);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_completely_peeled_insns, 400);
/* Use the 'model' -fsched-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM,
- SCHED_PRESSURE_MODEL,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_sched_pressure_algorithm,
+ SCHED_PRESSURE_MODEL);
/* unroll very small loops 2 time if no -funroll-loops. */
if (!global_options_set.x_flag_unroll_loops
&& !global_options_set.x_flag_unroll_all_loops)
{
- maybe_set_param_value (PARAM_MAX_UNROLL_TIMES, 2,
- global_options.x_param_values,
- global_options_set.x_param_values);
-
- maybe_set_param_value (PARAM_MAX_UNROLLED_INSNS, 20,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_unroll_times, 2);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_unrolled_insns, 20);
/* If fweb or frename-registers are not specificed in command-line,
do not turn them on implicitly. */
diff --git a/gcc/config/s390/s390.c b/gcc/config/s390/s390.c
index ff0b43c2c29..b3a75222ac2 100644
--- a/gcc/config/s390/s390.c
+++ b/gcc/config/s390/s390.c
@@ -10968,9 +10968,9 @@ allocate_stack_space (rtx size, HOST_WIDE_INT last_probe_offset,
{
bool temp_reg_clobbered_p = false;
HOST_WIDE_INT probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
if (flag_stack_clash_protection)
{
@@ -11086,7 +11086,7 @@ s390_emit_prologue (void)
only exception is when TARGET_BACKCHAIN is active, in which case
we know *sp (offset 0) was written. */
HOST_WIDE_INT probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
HOST_WIDE_INT last_probe_offset
= (TARGET_BACKCHAIN
? (TARGET_PACKED_STACK ? STACK_POINTER_OFFSET - UNITS_PER_LONG : 0)
@@ -15264,10 +15264,8 @@ s390_option_override_internal (struct gcc_options *opts,
displacements. Trim that value down to 4k if that happens. This
might result in too many probes being generated only on the
oldest supported machine level z900. */
- if (!DISP_IN_RANGE ((1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL))))
- set_param_value ("stack-clash-protection-probe-interval", 12,
- opts->x_param_values,
- opts_set->x_param_values);
+ if (!DISP_IN_RANGE ((1 << param_stack_clash_protection_probe_interval)))
+ param_stack_clash_protection_probe_interval = 12;
#ifdef TARGET_DEFAULT_LONG_DOUBLE_128
if (!TARGET_LONG_DOUBLE_128_P (opts_set->x_target_flags))
@@ -15276,62 +15274,37 @@ s390_option_override_internal (struct gcc_options *opts,
if (opts->x_s390_tune >= PROCESSOR_2097_Z10)
{
- maybe_set_param_value (PARAM_MAX_UNROLLED_INSNS, 100,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_UNROLL_TIMES, 32,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEELED_INSNS, 2000,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEEL_TIMES, 64,
- opts->x_param_values,
- opts_set->x_param_values);
- }
-
- maybe_set_param_value (PARAM_MAX_PENDING_LIST_LENGTH, 256,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_unrolled_insns,
+ 100);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_unroll_times, 32);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_completely_peeled_insns,
+ 2000);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_completely_peel_times,
+ 64);
+ }
+
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_pending_list_length,
+ 256);
/* values for loop prefetching */
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE, 256,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, 128,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_line_size, 256);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_size, 128);
/* s390 has more than 2 levels and the size is much larger. Since
we are always running virtualized assume that we only get a small
part of the caches above l1. */
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, 1500,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO, 2,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 6,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l2_cache_size, 1500);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_prefetch_min_insn_to_mem_ratio, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_simultaneous_prefetches, 6);
/* Use the alternative scheduling-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM, 2,
- opts->x_param_values,
- opts_set->x_param_values);
-
- maybe_set_param_value (PARAM_MIN_VECT_LOOP_BOUND, 2,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_sched_pressure_algorithm, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_min_vect_loop_bound, 2);
/* Use aggressive inlining parameters. */
if (opts->x_s390_tune >= PROCESSOR_2964_Z13)
{
- maybe_set_param_value (PARAM_INLINE_MIN_SPEEDUP, 2,
- opts->x_param_values,
- opts_set->x_param_values);
-
- maybe_set_param_value (PARAM_MAX_INLINE_INSNS_AUTO, 80,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_inline_min_speedup, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_inline_insns_auto, 80);
}
/* Set the default alignment. */
diff --git a/gcc/config/sparc/sparc.c b/gcc/config/sparc/sparc.c
index fe5e94118ef..473011aa1e6 100644
--- a/gcc/config/sparc/sparc.c
+++ b/gcc/config/sparc/sparc.c
@@ -61,6 +61,7 @@ along with GCC; see the file COPYING3. If not see
#include "context.h"
#include "builtins.h"
#include "tree-vector-builder.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -2010,7 +2011,7 @@ sparc_option_override (void)
gcc_unreachable ();
};
- /* PARAM_SIMULTANEOUS_PREFETCHES is the number of prefetches that
+ /* param_simultaneous_prefetches is the number of prefetches that
can run at the same time. More important, it is the threshold
defining when additional prefetches will be dropped by the
hardware.
@@ -2033,21 +2034,20 @@ sparc_option_override (void)
single-threaded program. Experimental results show that setting
this parameter to 32 works well when the number of threads is not
high. */
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- ((sparc_cpu == PROCESSOR_ULTRASPARC
- || sparc_cpu == PROCESSOR_NIAGARA
- || sparc_cpu == PROCESSOR_NIAGARA2
- || sparc_cpu == PROCESSOR_NIAGARA3
- || sparc_cpu == PROCESSOR_NIAGARA4)
- ? 2
- : (sparc_cpu == PROCESSOR_ULTRASPARC3
- ? 8 : ((sparc_cpu == PROCESSOR_NIAGARA7
- || sparc_cpu == PROCESSOR_M8)
- ? 32 : 3))),
- global_options.x_param_values,
- global_options_set.x_param_values);
-
- /* PARAM_L1_CACHE_LINE_SIZE is the size of the L1 cache line, in
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ ((sparc_cpu == PROCESSOR_ULTRASPARC
+ || sparc_cpu == PROCESSOR_NIAGARA
+ || sparc_cpu == PROCESSOR_NIAGARA2
+ || sparc_cpu == PROCESSOR_NIAGARA3
+ || sparc_cpu == PROCESSOR_NIAGARA4)
+ ? 2
+ : (sparc_cpu == PROCESSOR_ULTRASPARC3
+ ? 8 : ((sparc_cpu == PROCESSOR_NIAGARA7
+ || sparc_cpu == PROCESSOR_M8)
+ ? 32 : 3))));
+
+ /* param_l1_cache_line_size is the size of the L1 cache line, in
bytes.
The Oracle SPARC Architecture (previously the UltraSPARC
@@ -2064,38 +2064,33 @@ sparc_option_override (void)
L2 and L3, but only 32B are brought into the L1D$. (Assuming it
is a read_n prefetch, which is the only type which allocates to
the L1.) */
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- (sparc_cpu == PROCESSOR_M8
- ? 64 : 32),
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ (sparc_cpu == PROCESSOR_M8 ? 64 : 32));
- /* PARAM_L1_CACHE_SIZE is the size of the L1D$ (most SPARC chips use
+ /* param_l1_cache_size is the size of the L1D$ (most SPARC chips use
Hardvard level-1 caches) in kilobytes. Both UltraSPARC and
Niagara processors feature a L1D$ of 16KB. */
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- ((sparc_cpu == PROCESSOR_ULTRASPARC
- || sparc_cpu == PROCESSOR_ULTRASPARC3
- || sparc_cpu == PROCESSOR_NIAGARA
- || sparc_cpu == PROCESSOR_NIAGARA2
- || sparc_cpu == PROCESSOR_NIAGARA3
- || sparc_cpu == PROCESSOR_NIAGARA4
- || sparc_cpu == PROCESSOR_NIAGARA7
- || sparc_cpu == PROCESSOR_M8)
- ? 16 : 64),
- global_options.x_param_values,
- global_options_set.x_param_values);
-
-
- /* PARAM_L2_CACHE_SIZE is the size fo the L2 in kilobytes. Note
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ ((sparc_cpu == PROCESSOR_ULTRASPARC
+ || sparc_cpu == PROCESSOR_ULTRASPARC3
+ || sparc_cpu == PROCESSOR_NIAGARA
+ || sparc_cpu == PROCESSOR_NIAGARA2
+ || sparc_cpu == PROCESSOR_NIAGARA3
+ || sparc_cpu == PROCESSOR_NIAGARA4
+ || sparc_cpu == PROCESSOR_NIAGARA7
+ || sparc_cpu == PROCESSOR_M8)
+ ? 16 : 64));
+
+ /* param_l2_cache_size is the size fo the L2 in kilobytes. Note
that 512 is the default in params.def. */
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- ((sparc_cpu == PROCESSOR_NIAGARA4
- || sparc_cpu == PROCESSOR_M8)
- ? 128 : (sparc_cpu == PROCESSOR_NIAGARA7
- ? 256 : 512)),
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size,
+ ((sparc_cpu == PROCESSOR_NIAGARA4
+ || sparc_cpu == PROCESSOR_M8)
+ ? 128 : (sparc_cpu == PROCESSOR_NIAGARA7
+ ? 256 : 512)));
/* Disable save slot sharing for call-clobbered registers by default.
diff --git a/gcc/config/visium/visium.c b/gcc/config/visium/visium.c
index 8477008320c..b1ace70b5f7 100644
--- a/gcc/config/visium/visium.c
+++ b/gcc/config/visium/visium.c
@@ -57,6 +57,7 @@
#include "tree-pass.h"
#include "context.h"
#include "builtins.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -457,9 +458,8 @@ visium_option_override (void)
/* Allow the size of compilation units to double because of inlining.
In practice the global size of the object code is hardly affected
because the additional instructions will take up the padding. */
- maybe_set_param_value (PARAM_INLINE_UNIT_GROWTH, 100,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_inline_unit_growth, 100);
}
/* Likewise for loops. */
diff --git a/gcc/coverage.c b/gcc/coverage.c
index bcba61c9a9a..ebe27a323b2 100644
--- a/gcc/coverage.c
+++ b/gcc/coverage.c
@@ -324,7 +324,7 @@ get_coverage_counts (unsigned counter, unsigned cfg_checksum,
}
return NULL;
}
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
elt.ident = current_function_funcdef_no + 1;
else
{
@@ -560,7 +560,7 @@ coverage_compute_profile_id (struct cgraph_node *n)
{
expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (n->decl));
- bool use_name_only = (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID) == 0);
+ bool use_name_only = (param_profile_func_internal_id == 0);
chksum = (use_name_only ? 0 : xloc.line);
if (xloc.file)
@@ -628,7 +628,7 @@ coverage_begin_function (unsigned lineno_checksum, unsigned cfg_checksum)
/* Announce function */
offset = gcov_write_tag (GCOV_TAG_FUNCTION);
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
gcov_write_unsigned (current_function_funcdef_no + 1);
else
{
@@ -682,7 +682,7 @@ coverage_end_function (unsigned lineno_checksum, unsigned cfg_checksum)
item = ggc_alloc<coverage_data> ();
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
item->ident = current_function_funcdef_no + 1;
else
{
diff --git a/gcc/cp/name-lookup.c b/gcc/cp/name-lookup.c
index cd0d9551aa3..be846a12141 100644
--- a/gcc/cp/name-lookup.c
+++ b/gcc/cp/name-lookup.c
@@ -5358,7 +5358,7 @@ namespace_hints::namespace_hints (location_t loc, tree name)
m_candidates = vNULL;
m_limited = false;
- m_limit = PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP);
+ m_limit = param_cxx_max_namespaces_for_diagnostic_help;
/* Breadth-first search of namespaces. Up to limit namespaces
searched (limit zero == unlimited). */
diff --git a/gcc/cp/typeck.c b/gcc/cp/typeck.c
index 38a15d14620..ce294171261 100644
--- a/gcc/cp/typeck.c
+++ b/gcc/cp/typeck.c
@@ -1498,7 +1498,7 @@ comptypes (tree t1, tree t2, int strict)
perform a deep check. */
return structural_comptypes (t1, t2, strict);
- if (flag_checking && USE_CANONICAL_TYPES)
+ if (flag_checking && param_use_canonical_types)
{
bool result = structural_comptypes (t1, t2, strict);
@@ -1519,7 +1519,7 @@ comptypes (tree t1, tree t2, int strict)
return result;
}
- if (!flag_checking && USE_CANONICAL_TYPES)
+ if (!flag_checking && param_use_canonical_types)
return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
else
return structural_comptypes (t1, t2, strict);
diff --git a/gcc/cse.c b/gcc/cse.c
index 097fb94e773..b1c0276b0f7 100644
--- a/gcc/cse.c
+++ b/gcc/cse.c
@@ -6414,7 +6414,7 @@ cse_find_path (basic_block first_bb, struct cse_basic_block_data *data,
if (follow_jumps)
{
bb = data->path[path_size - 1].bb;
- while (bb && path_size < PARAM_VALUE (PARAM_MAX_CSE_PATH_LENGTH))
+ while (bb && path_size < param_max_cse_path_length)
{
if (single_succ_p (bb))
e = single_succ_edge (bb);
@@ -6592,7 +6592,7 @@ cse_extended_basic_block (struct cse_basic_block_data *ebb_data)
FIXME: This is a real kludge and needs to be done some other
way. */
if (NONDEBUG_INSN_P (insn)
- && num_insns++ > PARAM_VALUE (PARAM_MAX_CSE_INSNS))
+ && num_insns++ > param_max_cse_insns)
{
flush_hash_table ();
num_insns = 0;
@@ -6736,7 +6736,7 @@ cse_main (rtx_insn *f ATTRIBUTE_UNUSED, int nregs)
init_cse_reg_info (nregs);
ebb_data.path = XNEWVEC (struct branch_path,
- PARAM_VALUE (PARAM_MAX_CSE_PATH_LENGTH));
+ param_max_cse_path_length);
cse_cfg_altered = false;
cse_jumps_altered = false;
diff --git a/gcc/cselib.c b/gcc/cselib.c
index 500793ba40e..1745256944a 100644
--- a/gcc/cselib.c
+++ b/gcc/cselib.c
@@ -2297,7 +2297,7 @@ cselib_invalidate_mem (rtx mem_rtx)
p = &(*p)->next;
continue;
}
- if (num_mems < PARAM_VALUE (PARAM_MAX_CSELIB_MEMORY_LOCATIONS)
+ if (num_mems < param_max_cselib_memory_locations
&& ! canon_anti_dependence (x, false, mem_rtx,
GET_MODE (mem_rtx), mem_addr))
{
diff --git a/gcc/dse.c b/gcc/dse.c
index 5d8c6f990ec..76abd873c78 100644
--- a/gcc/dse.c
+++ b/gcc/dse.c
@@ -2657,7 +2657,7 @@ dse_step1 (void)
/* For -O1 reduce the maximum number of active local stores for RTL DSE
since this can consume huge amounts of memory (PR89115). */
- int max_active_local_stores = PARAM_VALUE (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES);
+ int max_active_local_stores = param_max_dse_active_local_stores;
if (optimize < 2)
max_active_local_stores /= 10;
diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c
index feff49aa44f..5f3e549a7fe 100644
--- a/gcc/emit-rtl.c
+++ b/gcc/emit-rtl.c
@@ -2762,15 +2762,15 @@ set_new_first_and_last_insn (rtx_insn *first, rtx_insn *last)
set_last_insn (last);
cur_insn_uid = 0;
- if (MIN_NONDEBUG_INSN_UID || MAY_HAVE_DEBUG_INSNS)
+ if (param_min_nondebug_insn_uid || MAY_HAVE_DEBUG_INSNS)
{
int debug_count = 0;
- cur_insn_uid = MIN_NONDEBUG_INSN_UID - 1;
+ cur_insn_uid = param_min_nondebug_insn_uid - 1;
cur_debug_insn_uid = 0;
for (insn = first; insn; insn = NEXT_INSN (insn))
- if (INSN_UID (insn) < MIN_NONDEBUG_INSN_UID)
+ if (INSN_UID (insn) < param_min_nondebug_insn_uid)
cur_debug_insn_uid = MAX (cur_debug_insn_uid, INSN_UID (insn));
else
{
@@ -2780,7 +2780,7 @@ set_new_first_and_last_insn (rtx_insn *first, rtx_insn *last)
}
if (debug_count)
- cur_debug_insn_uid = MIN_NONDEBUG_INSN_UID + debug_count;
+ cur_debug_insn_uid = param_min_nondebug_insn_uid + debug_count;
else
cur_debug_insn_uid++;
}
@@ -3445,10 +3445,10 @@ get_max_insn_count (void)
differences due to debug insns, and not be affected by
-fmin-insn-uid, to avoid excessive table size and to simplify
debugging of -fcompare-debug failures. */
- if (cur_debug_insn_uid > MIN_NONDEBUG_INSN_UID)
+ if (cur_debug_insn_uid > param_min_nondebug_insn_uid)
n -= cur_debug_insn_uid;
else
- n -= MIN_NONDEBUG_INSN_UID;
+ n -= param_min_nondebug_insn_uid;
return n;
}
@@ -4085,7 +4085,7 @@ make_debug_insn_raw (rtx pattern)
insn = as_a <rtx_debug_insn *> (rtx_alloc (DEBUG_INSN));
INSN_UID (insn) = cur_debug_insn_uid++;
- if (cur_debug_insn_uid > MIN_NONDEBUG_INSN_UID)
+ if (cur_debug_insn_uid > param_min_nondebug_insn_uid)
INSN_UID (insn) = cur_insn_uid++;
PATTERN (insn) = pattern;
@@ -5860,8 +5860,8 @@ init_emit (void)
{
set_first_insn (NULL);
set_last_insn (NULL);
- if (MIN_NONDEBUG_INSN_UID)
- cur_insn_uid = MIN_NONDEBUG_INSN_UID;
+ if (param_min_nondebug_insn_uid)
+ cur_insn_uid = param_min_nondebug_insn_uid;
else
cur_insn_uid = 1;
cur_debug_insn_uid = 1;
diff --git a/gcc/explow.c b/gcc/explow.c
index 83c786366c1..93e31cc3ba1 100644
--- a/gcc/explow.c
+++ b/gcc/explow.c
@@ -1837,7 +1837,7 @@ compute_stack_clash_protection_loop_data (rtx *rounded_size, rtx *last_addr,
{
/* Round SIZE down to STACK_CLASH_PROTECTION_PROBE_INTERVAL */
*probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
*rounded_size = simplify_gen_binary (AND, Pmode, size,
GEN_INT (-*probe_interval));
diff --git a/gcc/final.c b/gcc/final.c
index 7cf9ef1effd..3b9a88dc8a7 100644
--- a/gcc/final.c
+++ b/gcc/final.c
@@ -657,7 +657,7 @@ compute_alignments (void)
}
loop_optimizer_init (AVOID_CFG_MODIFICATIONS);
profile_count count_threshold = cfun->cfg->count_max.apply_scale
- (1, PARAM_VALUE (PARAM_ALIGN_THRESHOLD));
+ (1, param_align_threshold);
if (dump_file)
{
@@ -743,7 +743,7 @@ compute_alignments (void)
&& branch_count + fallthru_count > count_threshold
&& (branch_count
> fallthru_count.apply_scale
- (PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS), 1)))
+ (param_align_loop_iterations, 1)))
{
align_flags alignment = LOOP_ALIGN (label);
if (dump_file)
diff --git a/gcc/fold-const.c b/gcc/fold-const.c
index 88a069f4306..931be36df84 100644
--- a/gcc/fold-const.c
+++ b/gcc/fold-const.c
@@ -5925,9 +5925,9 @@ fold_range_test (location_t loc, enum tree_code code, tree type,
short-circuited branch and the underlying object on both sides
is the same, make a non-short-circuit operation. */
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (logical_op_non_short_circuit
&& !flag_sanitize_coverage
&& lhs != 0 && rhs != 0
@@ -8596,9 +8596,9 @@ fold_truth_andor (location_t loc, enum tree_code code, tree type,
return tem;
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (logical_op_non_short_circuit
&& !flag_sanitize_coverage
&& (code == TRUTH_AND_EXPR
@@ -13361,7 +13361,7 @@ tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p, int depth)
would not, passes that need this information could be revised
to provide it through dataflow propagation. */
return (!name_registered_for_update_p (t)
- && depth < PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH)
+ && depth < param_max_ssa_name_query_depth
&& gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t),
strict_overflow_p, depth));
@@ -14009,7 +14009,7 @@ integer_valued_real_single_p (tree t, int depth)
would not, passes that need this information could be revised
to provide it through dataflow propagation. */
return (!name_registered_for_update_p (t)
- && depth < PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH)
+ && depth < param_max_ssa_name_query_depth
&& gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t),
depth));
diff --git a/gcc/gcse.c b/gcc/gcse.c
index aeb59c645e1..4f63bff6672 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -799,10 +799,10 @@ want_to_gcse_p (rtx x, machine_mode mode, HOST_WIDE_INT *max_distance_ptr)
&& optimize_function_for_size_p (cfun));
cost = set_src_cost (x, mode, 0);
- if (cost < COSTS_N_INSNS (GCSE_UNRESTRICTED_COST))
+ if (cost < COSTS_N_INSNS (param_gcse_unrestricted_cost))
{
max_distance
- = ((HOST_WIDE_INT)GCSE_COST_DISTANCE_RATIO * cost) / 10;
+ = ((HOST_WIDE_INT)param_gcse_cost_distance_ratio * cost) / 10;
if (max_distance == 0)
return 0;
@@ -1844,7 +1844,7 @@ prune_insertions_deletions (int n_elems)
PRUNE_EXPRS. */
for (j = 0; j < (unsigned) n_elems; j++)
if (deletions[j]
- && ((unsigned) insertions[j] / deletions[j]) > MAX_GCSE_INSERTION_RATIO)
+ && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
bitmap_set_bit (prune_exprs, j);
/* Now prune PRE_INSERT_MAP and PRE_DELETE_MAP based on PRUNE_EXPRS. */
@@ -3133,7 +3133,7 @@ hoist_code (void)
expressions, nothing gets hoisted from the entry block. */
FOR_EACH_VEC_ELT (dom_tree_walk, dom_tree_walk_index, bb)
{
- domby = get_dominated_to_depth (CDI_DOMINATORS, bb, MAX_HOIST_DEPTH);
+ domby = get_dominated_to_depth (CDI_DOMINATORS, bb, param_max_hoist_depth);
if (domby.length () == 0)
continue;
@@ -3982,9 +3982,9 @@ update_ld_motion_stores (struct gcse_expr * expr)
bool
gcse_or_cprop_is_too_expensive (const char *pass)
{
- unsigned int memory_request = (n_basic_blocks_for_fn (cfun)
- * SBITMAP_SET_SIZE (max_reg_num ())
- * sizeof (SBITMAP_ELT_TYPE));
+ int memory_request = (n_basic_blocks_for_fn (cfun)
+ * SBITMAP_SET_SIZE (max_reg_num ())
+ * sizeof (SBITMAP_ELT_TYPE));
/* Trying to perform global optimizations on flow graphs which have
a high connectivity will take a long time and is unlikely to be
@@ -4007,7 +4007,7 @@ gcse_or_cprop_is_too_expensive (const char *pass)
/* If allocating memory for the dataflow bitmaps would take up too much
storage it's better just to disable the optimization. */
- if (memory_request > MAX_GCSE_MEMORY)
+ if (memory_request > param_max_gcse_memory)
{
warning (OPT_Wdisabled_optimization,
"%s: %d basic blocks and %d registers; "
diff --git a/gcc/ggc-common.c b/gcc/ggc-common.c
index f94c39f110d..cf7a4f68405 100644
--- a/gcc/ggc-common.c
+++ b/gcc/ggc-common.c
@@ -814,8 +814,8 @@ void
init_ggc_heuristics (void)
{
#if !defined ENABLE_GC_CHECKING && !defined ENABLE_GC_ALWAYS_COLLECT
- set_default_param_value (GGC_MIN_EXPAND, ggc_min_expand_heuristic ());
- set_default_param_value (GGC_MIN_HEAPSIZE, ggc_min_heapsize_heuristic ());
+ param_ggc_min_expand = ggc_min_expand_heuristic ();
+ param_ggc_min_heapsize = ggc_min_heapsize_heuristic ();
#endif
}
diff --git a/gcc/ggc-page.c b/gcc/ggc-page.c
index b443d87ea57..b0d26256072 100644
--- a/gcc/ggc-page.c
+++ b/gcc/ggc-page.c
@@ -2185,9 +2185,9 @@ ggc_collect (void)
total allocations haven't expanded much since the last
collection. */
float allocated_last_gc =
- MAX (G.allocated_last_gc, (size_t)PARAM_VALUE (GGC_MIN_HEAPSIZE) * 1024);
+ MAX (G.allocated_last_gc, (size_t)param_ggc_min_heapsize * 1024);
- float min_expand = allocated_last_gc * PARAM_VALUE (GGC_MIN_EXPAND) / 100;
+ float min_expand = allocated_last_gc * param_ggc_min_expand / 100;
if (G.allocated < allocated_last_gc + min_expand && !ggc_force_collect)
return;
diff --git a/gcc/gimple-loop-interchange.cc b/gcc/gimple-loop-interchange.cc
index b56155b1fef..2a0cf6e41d8 100644
--- a/gcc/gimple-loop-interchange.cc
+++ b/gcc/gimple-loop-interchange.cc
@@ -78,14 +78,14 @@ along with GCC; see the file COPYING3. If not see
simple reduction of inner loop and double reduction of the loop nest. */
/* Maximum number of stmts in each loop that should be interchanged. */
-#define MAX_NUM_STMT (PARAM_VALUE (PARAM_LOOP_INTERCHANGE_MAX_NUM_STMTS))
+#define MAX_NUM_STMT (param_loop_interchange_max_num_stmts)
/* Maximum number of data references in loop nest. */
-#define MAX_DATAREFS (PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+#define MAX_DATAREFS (param_loop_max_datarefs_for_datadeps)
/* Comparison ratio of access stride between inner/outer loops to be
interchanged. This is the minimum stride ratio for loop interchange
to be profitable. */
-#define OUTER_STRIDE_RATIO (PARAM_VALUE (PARAM_LOOP_INTERCHANGE_STRIDE_RATIO))
+#define OUTER_STRIDE_RATIO (param_loop_interchange_stride_ratio)
/* The same as above, but we require higher ratio for interchanging the
innermost two loops. */
#define INNER_STRIDE_RATIO ((OUTER_STRIDE_RATIO) + 1)
diff --git a/gcc/gimple-loop-jam.c b/gcc/gimple-loop-jam.c
index 899653b0863..c1fc9ba9916 100644
--- a/gcc/gimple-loop-jam.c
+++ b/gcc/gimple-loop-jam.c
@@ -572,15 +572,15 @@ tree_loop_unroll_and_jam (void)
/* We regard a user-specified minimum percentage of zero as a request
to ignore all profitability concerns and apply the transformation
always. */
- if (!PARAM_VALUE (PARAM_UNROLL_JAM_MIN_PERCENT))
+ if (!param_unroll_jam_min_percent)
profit_unroll = MAX(2, profit_unroll);
else if (removed * 100 / datarefs.length ()
- < (unsigned)PARAM_VALUE (PARAM_UNROLL_JAM_MIN_PERCENT))
+ < (unsigned)param_unroll_jam_min_percent)
profit_unroll = 1;
if (unroll_factor > profit_unroll)
unroll_factor = profit_unroll;
- if (unroll_factor > (unsigned)PARAM_VALUE (PARAM_UNROLL_JAM_MAX_UNROLL))
- unroll_factor = PARAM_VALUE (PARAM_UNROLL_JAM_MAX_UNROLL);
+ if (unroll_factor > (unsigned)param_unroll_jam_max_unroll)
+ unroll_factor = param_unroll_jam_max_unroll;
unroll = (unroll_factor > 1
&& can_unroll_loop_p (outer, unroll_factor, &desc));
diff --git a/gcc/gimple-loop-versioning.cc b/gcc/gimple-loop-versioning.cc
index 1664d875e80..18456e87958 100644
--- a/gcc/gimple-loop-versioning.cc
+++ b/gcc/gimple-loop-versioning.cc
@@ -605,8 +605,8 @@ unsigned int
loop_versioning::max_insns_for_loop (class loop *loop)
{
return (loop->inner
- ? PARAM_VALUE (PARAM_LOOP_VERSIONING_MAX_OUTER_INSNS)
- : PARAM_VALUE (PARAM_LOOP_VERSIONING_MAX_INNER_INSNS));
+ ? param_loop_versioning_max_outer_insns
+ : param_loop_versioning_max_inner_insns);
}
/* Return true if for cost reasons we should avoid versioning any loop
diff --git a/gcc/gimple-ssa-split-paths.c b/gcc/gimple-ssa-split-paths.c
index 5bf45eeac28..49a0834d647 100644
--- a/gcc/gimple-ssa-split-paths.c
+++ b/gcc/gimple-ssa-split-paths.c
@@ -366,7 +366,7 @@ is_feasible_trace (basic_block bb)
/* Upper Hard limit on the number statements to copy. */
if (num_stmts_in_join
- >= PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS))
+ >= param_max_jump_thread_duplication_stmts)
return false;
return true;
diff --git a/gcc/gimple-ssa-store-merging.c b/gcc/gimple-ssa-store-merging.c
index 270159b518d..19c0b875a90 100644
--- a/gcc/gimple-ssa-store-merging.c
+++ b/gcc/gimple-ssa-store-merging.c
@@ -2502,7 +2502,7 @@ imm_store_chain_info::try_coalesce_bswap (merged_store_group *merged_store,
return false;
bool allow_unaligned
- = !STRICT_ALIGNMENT && PARAM_VALUE (PARAM_STORE_MERGING_ALLOW_UNALIGNED);
+ = !STRICT_ALIGNMENT && param_store_merging_allow_unaligned;
/* Punt if the combined store would not be aligned and we need alignment. */
if (!allow_unaligned)
{
@@ -2762,7 +2762,7 @@ imm_store_chain_info::coalesce_immediate_stores ()
if (info->order >= merged_store->first_nonmergeable_order
|| (((new_bitregion_end - new_bitregion_start + 1) / BITS_PER_UNIT)
- > (unsigned) PARAM_VALUE (PARAM_STORE_MERGING_MAX_SIZE)))
+ > (unsigned) param_store_merging_max_size))
;
/* |---store 1---|
@@ -3668,7 +3668,7 @@ imm_store_chain_info::output_merged_store (merged_store_group *group)
auto_vec<class split_store *, 32> split_stores;
bool allow_unaligned_store
- = !STRICT_ALIGNMENT && PARAM_VALUE (PARAM_STORE_MERGING_ALLOW_UNALIGNED);
+ = !STRICT_ALIGNMENT && param_store_merging_allow_unaligned;
bool allow_unaligned_load = allow_unaligned_store;
bool bzero_first = false;
if (group->stores[0]->rhs_code == INTEGER_CST
@@ -4752,7 +4752,7 @@ pass_store_merging::process_store (gimple *stmt)
/* If we reach the limit of stores to merge in a chain terminate and
process the chain now. */
if ((*chain_info)->m_store_info.length ()
- == (unsigned int) PARAM_VALUE (PARAM_MAX_STORES_TO_MERGE))
+ == (unsigned int) param_max_stores_to_merge)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/gimple-ssa-strength-reduction.c b/gcc/gimple-ssa-strength-reduction.c
index de7f36015ef..ab5011a7a1e 100644
--- a/gcc/gimple-ssa-strength-reduction.c
+++ b/gcc/gimple-ssa-strength-reduction.c
@@ -546,7 +546,7 @@ find_basis_for_base_expr (slsr_cand_t c, tree base_expr)
// Limit potential of N^2 behavior for long candidate chains.
int iters = 0;
- int max_iters = PARAM_VALUE (PARAM_MAX_SLSR_CANDIDATE_SCAN);
+ int max_iters = param_max_slsr_candidate_scan;
mapping_key.base_expr = base_expr;
chain = base_cand_map->find (&mapping_key);
diff --git a/gcc/graphite-isl-ast-to-gimple.c b/gcc/graphite-isl-ast-to-gimple.c
index 40d1e8de6ae..11a4da0a623 100644
--- a/gcc/graphite-isl-ast-to-gimple.c
+++ b/gcc/graphite-isl-ast-to-gimple.c
@@ -203,7 +203,7 @@ class translate_isl_ast_to_gimple
{
codegen_error = true;
gcc_assert (! flag_checking
- || PARAM_VALUE (PARAM_GRAPHITE_ALLOW_CODEGEN_ERRORS));
+ || param_graphite_allow_codegen_errors);
}
bool is_constant (tree op) const
@@ -1383,7 +1383,7 @@ scop_to_isl_ast (scop_p scop)
{
int old_err = isl_options_get_on_error (scop->isl_context);
int old_max_operations = isl_ctx_get_max_operations (scop->isl_context);
- int max_operations = PARAM_VALUE (PARAM_MAX_ISL_OPERATIONS);
+ int max_operations = param_max_isl_operations;
if (max_operations)
isl_ctx_set_max_operations (scop->isl_context, max_operations);
isl_options_set_on_error (scop->isl_context, ISL_ON_ERROR_CONTINUE);
diff --git a/gcc/graphite-optimize-isl.c b/gcc/graphite-optimize-isl.c
index c4b8f3bc876..1dc9c3cb7be 100644
--- a/gcc/graphite-optimize-isl.c
+++ b/gcc/graphite-optimize-isl.c
@@ -64,7 +64,7 @@ get_schedule_for_node_st (__isl_take isl_schedule_node *node, void *user)
if (type != isl_schedule_node_leaf)
return node;
- long tile_size = PARAM_VALUE (PARAM_LOOP_BLOCK_TILE_SIZE);
+ long tile_size = param_loop_block_tile_size;
if (dims <= 1
|| tile_size == 0
|| !isl_schedule_node_band_get_permutable (node))
@@ -115,7 +115,7 @@ optimize_isl (scop_p scop)
{
int old_err = isl_options_get_on_error (scop->isl_context);
int old_max_operations = isl_ctx_get_max_operations (scop->isl_context);
- int max_operations = PARAM_VALUE (PARAM_MAX_ISL_OPERATIONS);
+ int max_operations = param_max_isl_operations;
if (max_operations)
isl_ctx_set_max_operations (scop->isl_context, max_operations);
isl_options_set_on_error (scop->isl_context, ISL_ON_ERROR_CONTINUE);
diff --git a/gcc/graphite-scop-detection.c b/gcc/graphite-scop-detection.c
index 489d0b93b42..1505a13b860 100644
--- a/gcc/graphite-scop-detection.c
+++ b/gcc/graphite-scop-detection.c
@@ -1639,7 +1639,7 @@ build_scops (vec<scop_p> *scops)
continue;
}
- unsigned max_arrays = PARAM_VALUE (PARAM_GRAPHITE_MAX_ARRAYS_PER_SCOP);
+ unsigned max_arrays = param_graphite_max_arrays_per_scop;
if (max_arrays > 0
&& scop->drs.length () >= max_arrays)
{
@@ -1652,7 +1652,7 @@ build_scops (vec<scop_p> *scops)
}
find_scop_parameters (scop);
- graphite_dim_t max_dim = PARAM_VALUE (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS);
+ graphite_dim_t max_dim = param_graphite_max_nb_scop_params;
if (max_dim > 0
&& scop_nb_params (scop) > max_dim)
{
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index 41cf1f362e8..c634e83441a 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -584,7 +584,7 @@ set_modulo_params (int ii, int max_stages, int insns, int max_uid)
modulo_max_stages = max_stages;
modulo_n_insns = insns;
modulo_iter0_max_uid = max_uid;
- modulo_backtracks_left = PARAM_VALUE (PARAM_MAX_MODULO_BACKTRACK_ATTEMPTS);
+ modulo_backtracks_left = param_max_modulo_backtrack_attempts;
}
/* A structure to record a pair of insns where the first one is a real
@@ -2712,7 +2712,7 @@ rank_for_schedule (const void *x, const void *y)
if (flag_sched_critical_path_heuristic && priority_val)
return rfs_result (RFS_PRIORITY, priority_val, tmp, tmp2);
- if (PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) >= 0)
+ if (param_sched_autopref_queue_depth >= 0)
{
int autopref = autopref_rank_for_schedule (tmp, tmp2);
if (autopref != 0)
@@ -3413,7 +3413,7 @@ model_remove_from_worklist (struct model_insn_info *insn)
}
/* Add INSN to the model worklist. Start looking for a suitable position
- between neighbors PREV and NEXT, testing at most MAX_SCHED_READY_INSNS
+ between neighbors PREV and NEXT, testing at most param_max_sched_ready_insns
insns either side. A null PREV indicates the beginning of the list and
a null NEXT indicates the end. */
@@ -3424,7 +3424,7 @@ model_add_to_worklist (struct model_insn_info *insn,
{
int count;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
if (count > 0 && prev && model_order_p (insn, prev))
do
{
@@ -3452,7 +3452,7 @@ model_promote_insn (struct model_insn_info *insn)
int count;
prev = insn->prev;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
while (count > 0 && prev && model_order_p (insn, prev))
{
count--;
@@ -3738,7 +3738,7 @@ model_choose_insn (void)
{
fprintf (sched_dump, ";;\t+--- worklist:\n");
insn = model_worklist;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
while (count > 0 && insn)
{
fprintf (sched_dump, ";;\t+--- %d [%d, %d, %d, %d]\n",
@@ -3770,7 +3770,7 @@ model_choose_insn (void)
Failing that, just pick the highest-priority instruction in the
worklist. */
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
insn = model_worklist;
fallback = 0;
for (;;)
@@ -5147,12 +5147,12 @@ queue_to_ready (struct ready_list *ready)
/* If the ready list is full, delay the insn for 1 cycle.
See the comment in schedule_block for the rationale. */
if (!reload_completed
- && (ready->n_ready - ready->n_debug > MAX_SCHED_READY_INSNS
+ && (ready->n_ready - ready->n_debug > param_max_sched_ready_insns
|| (sched_pressure == SCHED_PRESSURE_MODEL
- /* Limit pressure recalculations to MAX_SCHED_READY_INSNS
+ /* Limit pressure recalculations to param_max_sched_ready_insns
instructions too. */
&& model_index (insn) > (model_curr_point
- + MAX_SCHED_READY_INSNS)))
+ + param_max_sched_ready_insns)))
&& !(sched_pressure == SCHED_PRESSURE_MODEL
&& model_curr_point < model_num_insns
/* Always allow the next model instruction to issue. */
@@ -5743,7 +5743,7 @@ autopref_multipass_dfa_lookahead_guard (rtx_insn *insn1, int ready_index)
/* Exit early if the param forbids this or if we're not entering here through
normal haifa scheduling. This can happen if selective scheduling is
explicitly enabled. */
- if (!insn_queue || PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) <= 0)
+ if (!insn_queue || param_sched_autopref_queue_depth <= 0)
return 0;
if (sched_verbose >= 2 && ready_index == 0)
@@ -5796,14 +5796,14 @@ autopref_multipass_dfa_lookahead_guard (rtx_insn *insn1, int ready_index)
}
}
- if (PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) == 1)
+ if (param_sched_autopref_queue_depth == 1)
continue;
/* Everything from the current queue slot should have been moved to
the ready list. */
gcc_assert (insn_queue[NEXT_Q_AFTER (q_ptr, 0)] == NULL_RTX);
- int n_stalls = PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) - 1;
+ int n_stalls = param_sched_autopref_queue_depth - 1;
if (n_stalls > max_insn_queue_index)
n_stalls = max_insn_queue_index;
@@ -6552,14 +6552,14 @@ schedule_block (basic_block *target_bb, state_t init_state)
time in the worst case. Before reload we are more likely to have
big lists so truncate them to a reasonable size. */
if (!reload_completed
- && ready.n_ready - ready.n_debug > MAX_SCHED_READY_INSNS)
+ && ready.n_ready - ready.n_debug > param_max_sched_ready_insns)
{
ready_sort_debug (&ready);
ready_sort_real (&ready);
- /* Find first free-standing insn past MAX_SCHED_READY_INSNS.
+ /* Find first free-standing insn past param_max_sched_ready_insns.
If there are debug insns, we know they're first. */
- for (i = MAX_SCHED_READY_INSNS + ready.n_debug; i < ready.n_ready; i++)
+ for (i = param_max_sched_ready_insns + ready.n_debug; i < ready.n_ready; i++)
if (!SCHED_GROUP_P (ready_element (&ready, i)))
break;
@@ -7258,7 +7258,7 @@ sched_init (void)
&& !reload_completed
&& common_sched_info->sched_pass_id == SCHED_RGN_PASS)
sched_pressure = ((enum sched_pressure_algorithm)
- PARAM_VALUE (PARAM_SCHED_PRESSURE_ALGORITHM));
+ param_sched_pressure_algorithm);
else
sched_pressure = SCHED_PRESSURE_NONE;
@@ -7274,9 +7274,9 @@ sched_init (void)
if (spec_info->mask != 0)
{
spec_info->data_weakness_cutoff =
- (PARAM_VALUE (PARAM_SCHED_SPEC_PROB_CUTOFF) * MAX_DEP_WEAK) / 100;
+ (param_sched_spec_prob_cutoff * MAX_DEP_WEAK) / 100;
spec_info->control_weakness_cutoff =
- (PARAM_VALUE (PARAM_SCHED_SPEC_PROB_CUTOFF)
+ (param_sched_spec_prob_cutoff
* REG_BR_PROB_BASE) / 100;
}
else
diff --git a/gcc/hsa-gen.c b/gcc/hsa-gen.c
index 436f4c5f9f5..c4a03f938cf 100644
--- a/gcc/hsa-gen.c
+++ b/gcc/hsa-gen.c
@@ -5940,7 +5940,7 @@ init_prologue (void)
unsigned index = hsa_get_number_decl_kernel_mappings ();
/* Emit store to debug argument. */
- if (PARAM_VALUE (PARAM_HSA_GEN_DEBUG_STORES) > 0)
+ if (param_hsa_gen_debug_stores > 0)
set_debug_value (prologue, new hsa_op_immed (1000 + index, BRIG_TYPE_U64));
}
diff --git a/gcc/ifcvt.c b/gcc/ifcvt.c
index 8bc6f53cb38..5df8a43a5f7 100644
--- a/gcc/ifcvt.c
+++ b/gcc/ifcvt.c
@@ -3311,7 +3311,7 @@ bb_ok_for_noce_convert_multiple_sets (basic_block test_bb)
{
rtx_insn *insn;
unsigned count = 0;
- unsigned param = PARAM_VALUE (PARAM_MAX_RTL_IF_CONVERSION_INSNS);
+ unsigned param = param_max_rtl_if_conversion_insns;
FOR_BB_INSNS (test_bb, insn)
{
@@ -3838,7 +3838,7 @@ cond_move_process_if_block (struct noce_if_info *if_info)
vec<rtx> else_regs = vNULL;
unsigned int i;
int success_p = FALSE;
- int limit = PARAM_VALUE (PARAM_MAX_RTL_IF_CONVERSION_INSNS);
+ int limit = param_max_rtl_if_conversion_insns;
/* Build a mapping for each block to the value used for each
register. */
diff --git a/gcc/ipa-cp.c b/gcc/ipa-cp.c
index c6bd265f593..5f52a4b0ad7 100644
--- a/gcc/ipa-cp.c
+++ b/gcc/ipa-cp.c
@@ -1609,7 +1609,7 @@ ipcp_lattice<valtype>::add_value (valtype newval, cgraph_edge *cs,
return false;
}
- if (values_count == PARAM_VALUE (PARAM_IPA_CP_VALUE_LIST_SIZE))
+ if (values_count == param_ipa_cp_value_list_size)
{
/* We can only free sources, not the values themselves, because sources
of other values in this SCC might point to them. */
@@ -2086,7 +2086,7 @@ merge_agg_lats_step (class ipcp_param_lattices *dest_plats,
set_agg_lats_to_bottom (dest_plats);
return false;
}
- if (dest_plats->aggs_count == PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS))
+ if (dest_plats->aggs_count == param_ipa_max_agg_items)
return false;
dest_plats->aggs_count++;
new_al = ipcp_agg_lattice_pool.allocate ();
@@ -2639,11 +2639,11 @@ devirtualization_time_bonus (struct cgraph_node *node,
int size = ipa_size_summaries->get (callee)->size;
/* FIXME: The values below need re-considering and perhaps also
integrating into the cost metrics, at lest in some very basic way. */
- if (size <= MAX_INLINE_INSNS_AUTO / 4)
+ if (size <= param_max_inline_insns_auto / 4)
res += 31 / ((int)speculative + 1);
- else if (size <= MAX_INLINE_INSNS_AUTO / 2)
+ else if (size <= param_max_inline_insns_auto / 2)
res += 15 / ((int)speculative + 1);
- else if (size <= MAX_INLINE_INSNS_AUTO
+ else if (size <= param_max_inline_insns_auto
|| DECL_DECLARED_INLINE_P (callee->decl))
res += 7 / ((int)speculative + 1);
}
@@ -2658,7 +2658,7 @@ hint_time_bonus (ipa_hints hints)
{
int result = 0;
if (hints & (INLINE_HINT_loop_iterations | INLINE_HINT_loop_stride))
- result += PARAM_VALUE (PARAM_IPA_CP_LOOP_HINT_BONUS);
+ result += param_ipa_cp_loop_hint_bonus;
return result;
}
@@ -2670,11 +2670,11 @@ incorporate_penalties (ipa_node_params *info, int64_t evaluation)
{
if (info->node_within_scc)
evaluation = (evaluation
- * (100 - PARAM_VALUE (PARAM_IPA_CP_RECURSION_PENALTY))) / 100;
+ * (100 - param_ipa_cp_recursion_penalty)) / 100;
if (info->node_calling_single_call)
evaluation = (evaluation
- * (100 - PARAM_VALUE (PARAM_IPA_CP_SINGLE_CALL_PENALTY)))
+ * (100 - param_ipa_cp_single_call_penalty))
/ 100;
return evaluation;
@@ -2714,10 +2714,10 @@ good_cloning_opportunity_p (struct cgraph_node *node, int time_benefit,
", threshold: %i\n",
info->node_within_scc ? ", scc" : "",
info->node_calling_single_call ? ", single_call" : "",
- evaluation, PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD));
+ evaluation, param_ipa_cp_eval_threshold);
}
- return evaluation >= PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD);
+ return evaluation >= param_ipa_cp_eval_threshold;
}
else
{
@@ -2732,9 +2732,9 @@ good_cloning_opportunity_p (struct cgraph_node *node, int time_benefit,
time_benefit, size_cost, freq_sum,
info->node_within_scc ? ", scc" : "",
info->node_calling_single_call ? ", single_call" : "",
- evaluation, PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD));
+ evaluation, param_ipa_cp_eval_threshold);
- return evaluation >= PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD);
+ return evaluation >= param_ipa_cp_eval_threshold;
}
}
@@ -3349,9 +3349,9 @@ ipcp_propagate_stage (class ipa_topo_info *topo)
}
max_new_size = overall_size;
- if (max_new_size < PARAM_VALUE (PARAM_LARGE_UNIT_INSNS))
- max_new_size = PARAM_VALUE (PARAM_LARGE_UNIT_INSNS);
- max_new_size += max_new_size * PARAM_VALUE (PARAM_IPCP_UNIT_GROWTH) / 100 + 1;
+ if (max_new_size < param_large_unit_insns)
+ max_new_size = param_large_unit_insns;
+ max_new_size += max_new_size * param_ipcp_unit_growth / 100 + 1;
if (dump_file)
fprintf (dump_file, "\noverall_size: %li, max_new_size: %li\n",
diff --git a/gcc/ipa-fnsummary.c b/gcc/ipa-fnsummary.c
index 64c4d95ccd4..4aac57446f2 100644
--- a/gcc/ipa-fnsummary.c
+++ b/gcc/ipa-fnsummary.c
@@ -1201,7 +1201,7 @@ decompose_param_expr (struct ipa_func_body_info *fbi,
struct agg_position_info *aggpos,
expr_eval_ops *param_ops_p = NULL)
{
- int op_limit = PARAM_VALUE (PARAM_IPA_MAX_PARAM_EXPR_OPS);
+ int op_limit = param_ipa_max_param_expr_ops;
int op_count = 0;
if (param_ops_p)
@@ -1432,7 +1432,7 @@ set_switch_stmt_execution_predicate (struct ipa_func_body_info *fbi,
auto_vec<std::pair<tree, tree> > ranges;
tree type = TREE_TYPE (op);
- int bound_limit = PARAM_VALUE (PARAM_IPA_MAX_SWITCH_PREDICATE_BOUNDS);
+ int bound_limit = param_ipa_max_switch_predicate_bounds;
int bound_count = 0;
wide_int vr_wmin, vr_wmax;
value_range_kind vr_type = get_range_info (op, &vr_wmin, &vr_wmax);
@@ -2277,9 +2277,9 @@ fp_expression_p (gimple *stmt)
static void
analyze_function_body (struct cgraph_node *node, bool early)
{
- sreal time = PARAM_VALUE (PARAM_UNINLINED_FUNCTION_TIME);
+ sreal time = param_uninlined_function_time;
/* Estimate static overhead for function prologue/epilogue and alignment. */
- int size = PARAM_VALUE (PARAM_UNINLINED_FUNCTION_INSNS);
+ int size = param_uninlined_function_insns;
/* Benefits are scaled by probability of elimination that is in range
<0,2>. */
basic_block bb;
@@ -2328,7 +2328,7 @@ analyze_function_body (struct cgraph_node *node, bool early)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = count_formal_params (node->decl);
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
nonconstant_names.safe_grow_cleared
(SSANAMES (my_function)->length ());
@@ -2345,9 +2345,9 @@ analyze_function_body (struct cgraph_node *node, bool early)
info->account_size_time (0, 0, bb_predicate, bb_predicate);
bb_predicate = predicate::not_inlined ();
- info->account_size_time (PARAM_VALUE (PARAM_UNINLINED_FUNCTION_INSNS)
+ info->account_size_time (param_uninlined_function_insns
* ipa_fn_summary::size_scale,
- PARAM_VALUE (PARAM_UNINLINED_FUNCTION_TIME),
+ param_uninlined_function_time,
bb_predicate,
bb_predicate);
@@ -2745,10 +2745,8 @@ compute_fn_summary (struct cgraph_node *node, bool early)
es->call_stmt_size = eni_size_weights.call_cost;
es->call_stmt_time = eni_time_weights.call_cost;
info->account_size_time (ipa_fn_summary::size_scale
- * PARAM_VALUE
- (PARAM_UNINLINED_FUNCTION_THUNK_INSNS),
- PARAM_VALUE
- (PARAM_UNINLINED_FUNCTION_THUNK_TIME), t, t);
+ * param_uninlined_function_thunk_insns,
+ param_uninlined_function_thunk_time, t, t);
t = predicate::not_inlined ();
info->account_size_time (2 * ipa_fn_summary::size_scale, 0, t, t);
ipa_update_overall_fn_summary (node);
diff --git a/gcc/ipa-inline-analysis.c b/gcc/ipa-inline-analysis.c
index ea1fae484ff..33822e11308 100644
--- a/gcc/ipa-inline-analysis.c
+++ b/gcc/ipa-inline-analysis.c
@@ -448,7 +448,7 @@ estimate_growth (struct cgraph_node *node)
else if (DECL_COMDAT (node->decl)
&& node->can_remove_if_no_direct_calls_p ())
d.growth -= (info->size
- * (100 - PARAM_VALUE (PARAM_COMDAT_SHARING_PROBABILITY))
+ * (100 - param_comdat_sharing_probability)
+ 50) / 100;
}
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c
index b2c90cc2dd9..b765a509564 100644
--- a/gcc/ipa-inline.c
+++ b/gcc/ipa-inline.c
@@ -179,13 +179,13 @@ caller_growth_limits (struct cgraph_edge *e)
if (limit < what_size_info->self_size)
limit = what_size_info->self_size;
- limit += limit * PARAM_VALUE (PARAM_LARGE_FUNCTION_GROWTH) / 100;
+ limit += limit * param_large_function_growth / 100;
/* Check the size after inlining against the function limits. But allow
the function to shrink if it went over the limits by forced inlining. */
newsize = estimate_size_after_inlining (to, e);
if (newsize >= ipa_size_summaries->get (what)->size
- && newsize > PARAM_VALUE (PARAM_LARGE_FUNCTION_INSNS)
+ && newsize > param_large_function_insns
&& newsize > limit)
{
e->inline_failed = CIF_LARGE_FUNCTION_GROWTH_LIMIT;
@@ -201,7 +201,7 @@ caller_growth_limits (struct cgraph_edge *e)
on every invocation of the caller (i.e. its call statement dominates
exit block). We do not track this information, yet. */
stack_size_limit += ((gcov_type)stack_size_limit
- * PARAM_VALUE (PARAM_STACK_FRAME_GROWTH) / 100);
+ * param_stack_frame_growth / 100);
inlined_stack = (ipa_get_stack_frame_offset (to)
+ outer_info->estimated_self_stack_size
@@ -214,7 +214,7 @@ caller_growth_limits (struct cgraph_edge *e)
This bit overoptimistically assume that we are good at stack
packing. */
&& inlined_stack > ipa_fn_summaries->get (to)->estimated_stack_size
- && inlined_stack > PARAM_VALUE (PARAM_LARGE_STACK_FRAME))
+ && inlined_stack > param_large_stack_frame)
{
e->inline_failed = CIF_LARGE_STACK_FRAME_GROWTH_LIMIT;
return false;
@@ -399,16 +399,16 @@ inline_insns_single (cgraph_node *n, bool hint)
if (opt_for_fn (n->decl, optimize) >= 3)
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE);
+ return param_max_inline_insns_single
+ * param_inline_heuristics_hint_percent / 100;
+ return param_max_inline_insns_single;
}
else
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE_O2)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT_O2) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE_O2);
+ return param_max_inline_insns_single_o2
+ * param_inline_heuristics_hint_percent_o2 / 100;
+ return param_max_inline_insns_single_o2;
}
}
@@ -421,16 +421,16 @@ inline_insns_auto (cgraph_node *n, bool hint)
if (opt_for_fn (n->decl, optimize) >= 3)
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO);
+ return param_max_inline_insns_auto
+ * param_inline_heuristics_hint_percent / 100;
+ return param_max_inline_insns_auto;
}
else
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO_O2)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT_O2) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO_O2);
+ return param_max_inline_insns_auto_o2
+ * param_inline_heuristics_hint_percent_o2 / 100;
+ return param_max_inline_insns_auto_o2;
}
}
@@ -567,14 +567,14 @@ can_inline_edge_by_limits_p (struct cgraph_edge *e, bool report,
inlinable = false;
}
/* If callee is optimized for size and caller is not, allow inlining if
- code shrinks or we are in MAX_INLINE_INSNS_SINGLE limit and callee
+ code shrinks or we are in param_max_inline_insns_single limit and callee
is inline (and thus likely an unified comdat). This will allow caller
to run faster. */
else if (opt_for_fn (callee->decl, optimize_size)
> opt_for_fn (caller->decl, optimize_size))
{
int growth = estimate_edge_growth (e);
- if (growth > PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE)
+ if (growth > param_max_inline_insns_size
&& (!DECL_DECLARED_INLINE_P (callee->decl)
&& growth >= MAX (inline_insns_single (caller, false),
inline_insns_auto (caller, false))))
@@ -686,11 +686,11 @@ want_early_inline_function_p (struct cgraph_edge *e)
int growth = estimate_edge_growth (e);
int n;
int early_inlining_insns = opt_for_fn (e->caller->decl, optimize) >= 3
- ? PARAM_VALUE (PARAM_EARLY_INLINING_INSNS)
- : PARAM_VALUE (PARAM_EARLY_INLINING_INSNS_O2);
+ ? param_early_inlining_insns
+ : param_early_inlining_insns_o2;
- if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE))
+ if (growth <= param_max_inline_insns_size)
;
else if (!e->maybe_hot_p ())
{
@@ -793,8 +793,8 @@ big_speedup_p (struct cgraph_edge *e)
? e->caller->inlined_to
: e->caller);
int limit = opt_for_fn (caller->decl, optimize) >= 3
- ? PARAM_VALUE (PARAM_INLINE_MIN_SPEEDUP)
- : PARAM_VALUE (PARAM_INLINE_MIN_SPEEDUP_O2);
+ ? param_inline_min_speedup
+ : param_inline_min_speedup_o2;
if ((time - inlined_time) * 100 > time * limit)
return true;
@@ -861,9 +861,9 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
| INLINE_HINT_loop_iterations
| INLINE_HINT_loop_stride));
- if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE))
+ if (growth <= param_max_inline_insns_size)
;
- /* Apply MAX_INLINE_INSNS_SINGLE limit. Do not do so when
+ /* Apply param_max_inline_insns_single limit. Do not do so when
hints suggests that inlining given function is very profitable.
Avoid computation of big_speedup_p when not necessary to change
outcome of decision. */
@@ -881,7 +881,7 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
}
else if (!DECL_DECLARED_INLINE_P (callee->decl)
&& !opt_for_fn (e->caller->decl, flag_inline_functions)
- && growth >= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SMALL))
+ && growth >= param_max_inline_insns_small)
{
/* growth_likely_positive is expensive, always test it last. */
if (growth >= inline_insns_single (e->caller, false)
@@ -891,7 +891,7 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
want_inline = false;
}
}
- /* Apply MAX_INLINE_INSNS_AUTO limit for functions not declared inline.
+ /* Apply param_max_inline_insns_auto limit for functions not declared inline.
Bypass the limit when speedup seems big. */
else if (!DECL_DECLARED_INLINE_P (callee->decl)
&& growth >= inline_insns_auto (e->caller, apply_hints)
@@ -944,10 +944,10 @@ want_inline_self_recursive_call_p (struct cgraph_edge *edge,
char const *reason = NULL;
bool want_inline = true;
sreal caller_freq = 1;
- int max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO);
+ int max_depth = param_max_inline_recursive_depth_auto;
if (DECL_DECLARED_INLINE_P (edge->caller->decl))
- max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH);
+ max_depth = param_max_inline_recursive_depth;
if (!edge->maybe_hot_p ())
{
@@ -1009,7 +1009,7 @@ want_inline_self_recursive_call_p (struct cgraph_edge *edge,
{
if (edge->sreal_frequency () * 100
<= caller_freq
- * PARAM_VALUE (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY))
+ * param_min_inline_recursive_probability)
{
reason = "frequency of recursive call is too small";
want_inline = false;
@@ -1206,8 +1206,7 @@ edge_badness (struct cgraph_edge *edge, bool dump)
frequency still indicates splitting is a win ... */
|| (callee->split_part && !caller->split_part
&& edge->sreal_frequency () * 100
- < PARAM_VALUE
- (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY)
+ < param_partial_inlining_entry_probability
/* ... and do not overwrite user specified hints. */
&& (!DECL_DECLARED_INLINE_P (edge->callee->decl)
|| DECL_DECLARED_INLINE_P (caller->decl)))))
@@ -1537,7 +1536,7 @@ static bool
recursive_inlining (struct cgraph_edge *edge,
vec<cgraph_edge *> *new_edges)
{
- int limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO);
+ int limit = param_max_inline_insns_recursive_auto;
edge_heap_t heap (sreal::min ());
struct cgraph_node *node;
struct cgraph_edge *e;
@@ -1550,7 +1549,7 @@ recursive_inlining (struct cgraph_edge *edge,
node = node->inlined_to;
if (DECL_DECLARED_INLINE_P (node->decl))
- limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE);
+ limit = param_max_inline_insns_recursive;
/* Make sure that function is small enough to be considered for inlining. */
if (estimate_size_after_inlining (node, edge) >= limit)
@@ -1675,11 +1674,11 @@ static int
compute_max_insns (int insns)
{
int max_insns = insns;
- if (max_insns < PARAM_VALUE (PARAM_LARGE_UNIT_INSNS))
- max_insns = PARAM_VALUE (PARAM_LARGE_UNIT_INSNS);
+ if (max_insns < param_large_unit_insns)
+ max_insns = param_large_unit_insns;
return ((int64_t) max_insns
- * (100 + PARAM_VALUE (PARAM_INLINE_UNIT_GROWTH)) / 100);
+ * (100 + param_inline_unit_growth) / 100);
}
@@ -2895,7 +2894,7 @@ early_inliner (function *fun)
}
/* We iterate incremental inlining to get trivial cases of indirect
inlining. */
- while (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS)
+ while (iterations < param_early_inliner_max_iterations
&& early_inline_small_functions (node))
{
timevar_push (TV_INTEGRATION);
@@ -2922,7 +2921,7 @@ early_inliner (function *fun)
edge->call_stmt_cannot_inline_p = true;
}
}
- if (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS) - 1)
+ if (iterations < param_early_inliner_max_iterations - 1)
ipa_update_overall_fn_summary (node);
timevar_pop (TV_INTEGRATION);
iterations++;
diff --git a/gcc/ipa-polymorphic-call.c b/gcc/ipa-polymorphic-call.c
index 705af03d20c..7c2b4c795fa 100644
--- a/gcc/ipa-polymorphic-call.c
+++ b/gcc/ipa-polymorphic-call.c
@@ -1400,7 +1400,7 @@ record_known_type (struct type_change_info *tci, tree type, HOST_WIDE_INT offset
static inline bool
csftc_abort_walking_p (unsigned speculative)
{
- unsigned max = PARAM_VALUE (PARAM_MAX_SPECULATIVE_DEVIRT_MAYDEFS);
+ unsigned max = param_max_speculative_devirt_maydefs;
return speculative > max ? true : false;
}
diff --git a/gcc/ipa-profile.c b/gcc/ipa-profile.c
index a1acd2e413a..19cf8eae18f 100644
--- a/gcc/ipa-profile.c
+++ b/gcc/ipa-profile.c
@@ -506,7 +506,7 @@ ipa_profile (void)
gcc_assert (overall_size);
- cutoff = (overall_time * PARAM_VALUE (HOT_BB_COUNT_WS_PERMILLE) + 500) / 1000;
+ cutoff = (overall_time * param_hot_bb_count_ws_permille + 500) / 1000;
threshold = 0;
for (i = 0; cumulated < cutoff; i++)
{
diff --git a/gcc/ipa-prop.c b/gcc/ipa-prop.c
index 094e68178ec..b763aefa478 100644
--- a/gcc/ipa-prop.c
+++ b/gcc/ipa-prop.c
@@ -1601,7 +1601,7 @@ determine_known_aggregate_parts (gcall *call, tree arg,
struct ipa_known_agg_contents_list *list = NULL, *all_list = NULL;
bitmap visited = NULL;
int item_count = 0, const_count = 0;
- int ipa_max_agg_items = PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS);
+ int ipa_max_agg_items = param_ipa_max_agg_items;
HOST_WIDE_INT arg_offset, arg_size;
tree arg_base;
bool check_ref, by_ref;
@@ -2632,7 +2632,7 @@ ipa_analyze_node (struct cgraph_node *node)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = ipa_get_param_count (info);
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
for (struct cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
{
@@ -5291,7 +5291,7 @@ ipcp_transform_function (struct cgraph_node *node)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = param_count;
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
vec_safe_grow_cleared (descriptors, param_count);
ipa_populate_param_decls (node, *descriptors);
diff --git a/gcc/ipa-split.c b/gcc/ipa-split.c
index 0444bda704d..c73b257ca7f 100644
--- a/gcc/ipa-split.c
+++ b/gcc/ipa-split.c
@@ -453,7 +453,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
is unknown. */
if (!(current->count
< (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.apply_scale
- (PARAM_VALUE (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY), 100))))
+ (param_partial_inlining_entry_probability, 100))))
{
/* When profile is guessed, we cannot expect it to give us
realistic estimate on likelyness of function taking the
@@ -563,8 +563,8 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
that. Next stage1 we should try to be more meaningful here. */
if (current->header_size + call_overhead
>= (unsigned int)(DECL_DECLARED_INLINE_P (current_function_decl)
- ? MAX_INLINE_INSNS_SINGLE
- : MAX_INLINE_INSNS_AUTO) + 10)
+ ? param_max_inline_insns_single
+ : param_max_inline_insns_auto) + 10)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -577,7 +577,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
Limit this duplication. This is consistent with limit in tree-sra.c
FIXME: with LTO we ought to be able to do better! */
if (DECL_ONE_ONLY (current_function_decl)
- && current->split_size >= (unsigned int) MAX_INLINE_INSNS_AUTO + 10)
+ && current->split_size >= (unsigned int) param_max_inline_insns_auto + 10)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -589,7 +589,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
FIXME: with LTO we ought to be able to do better! */
if (DECL_ONE_ONLY (current_function_decl)
&& current->split_size
- <= (unsigned int) PARAM_VALUE (PARAM_EARLY_INLINING_INSNS) / 2)
+ <= (unsigned int) param_early_inlining_insns / 2)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/ipa-sra.c b/gcc/ipa-sra.c
index aceb5c722ea..365c0eeedff 100644
--- a/gcc/ipa-sra.c
+++ b/gcc/ipa-sra.c
@@ -1266,7 +1266,7 @@ allocate_access (gensum_param_desc *desc,
HOST_WIDE_INT offset, HOST_WIDE_INT size)
{
if (desc->access_count
- == (unsigned) PARAM_VALUE (PARAM_IPA_SRA_MAX_REPLACEMENTS))
+ == (unsigned) param_ipa_sra_max_replacements)
{
disqualify_split_candidate (desc, "Too many replacement candidates");
return NULL;
@@ -2280,8 +2280,7 @@ process_scan_results (cgraph_node *node, struct function *fun,
if (!desc->by_ref || optimize_function_for_size_p (fun))
param_size_limit = cur_param_size;
else
- param_size_limit = (PARAM_VALUE (PARAM_IPA_SRA_PTR_GROWTH_FACTOR)
- * cur_param_size);
+ param_size_limit = param_ipa_sra_ptr_growth_factor * cur_param_size;
if (nonarg_acc_size > param_size_limit
|| (!desc->by_ref && nonarg_acc_size == param_size_limit))
{
@@ -2501,7 +2500,7 @@ ipa_sra_summarize_function (cgraph_node *node)
bb_dereferences = XCNEWVEC (HOST_WIDE_INT,
by_ref_count
* last_basic_block_for_fn (fun));
- aa_walking_limit = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ aa_walking_limit = param_ipa_max_aa_steps;
scan_function (node, fun);
if (dump_file)
@@ -3337,7 +3336,7 @@ pull_accesses_from_callee (isra_param_desc *param_desc,
return NULL;
if ((prop_count + pclen
- > (unsigned) PARAM_VALUE (PARAM_IPA_SRA_MAX_REPLACEMENTS))
+ > (unsigned) param_ipa_sra_max_replacements)
|| size_would_violate_limit_p (param_desc,
param_desc->size_reached + prop_size))
return "propagating accesses would violate the count or size limit";
diff --git a/gcc/ira-build.c b/gcc/ira-build.c
index 47ce189af47..e53bb813f37 100644
--- a/gcc/ira-build.c
+++ b/gcc/ira-build.c
@@ -2217,7 +2217,7 @@ loop_compare_func (const void *v1p, const void *v2p)
hardly helps (for irregular register file architecture it could
help by choosing a better hard register in the loop but we prefer
faster allocation even in this case). We also remove cheap loops
- if there are more than IRA_MAX_LOOPS_NUM of them. Loop with EH
+ if there are more than param_ira_max_loops_num of them. Loop with EH
exit or enter edges are removed too because the allocation might
require put pseudo moves on the EH edges (we could still do this
for pseudos with caller saved hard registers in some cases but it
@@ -2253,7 +2253,7 @@ mark_loops_for_removal (void)
);
}
qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
- for (i = 0; i < n - IRA_MAX_LOOPS_NUM; i++)
+ for (i = 0; i < n - param_ira_max_loops_num; i++)
{
sorted_loops[i]->to_remove_p = true;
if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL)
diff --git a/gcc/ira-conflicts.c b/gcc/ira-conflicts.c
index a0aefaa0549..8e7c0c41f2f 100644
--- a/gcc/ira-conflicts.c
+++ b/gcc/ira-conflicts.c
@@ -113,13 +113,13 @@ build_conflict_bit_table (void)
/ IRA_INT_BITS);
allocated_words_num += conflict_bit_vec_words_num;
if ((uint64_t) allocated_words_num * sizeof (IRA_INT_TYPE)
- > (uint64_t) IRA_MAX_CONFLICT_TABLE_SIZE * 1024 * 1024)
+ > (uint64_t) param_ira_max_conflict_table_size * 1024 * 1024)
{
if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL)
fprintf
(ira_dump_file,
"+++Conflict table will be too big(>%dMB) -- don't use it\n",
- IRA_MAX_CONFLICT_TABLE_SIZE);
+ param_ira_max_conflict_table_size);
return false;
}
}
diff --git a/gcc/loop-doloop.c b/gcc/loop-doloop.c
index ccd020a2dba..6a956a03b03 100644
--- a/gcc/loop-doloop.c
+++ b/gcc/loop-doloop.c
@@ -651,7 +651,7 @@ doloop_optimize (class loop *loop)
}
max_cost
- = COSTS_N_INSNS (PARAM_VALUE (PARAM_MAX_ITERATIONS_COMPUTATION_COST));
+ = COSTS_N_INSNS (param_max_iterations_computation_cost);
if (set_src_cost (desc->niter_expr, mode, optimize_loop_for_speed_p (loop))
> max_cost)
{
diff --git a/gcc/loop-invariant.c b/gcc/loop-invariant.c
index ef46c8aea22..d40ad37cced 100644
--- a/gcc/loop-invariant.c
+++ b/gcc/loop-invariant.c
@@ -1491,7 +1491,7 @@ gain_for_invariant (struct invariant *inv, unsigned *regs_needed,
if ((int) new_regs[pressure_class]
+ (int) regs_needed[pressure_class]
+ LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class]
- + IRA_LOOP_RESERVED_REGS
+ + param_ira_loop_reserved_regs
> ira_class_hard_regs_num[pressure_class])
break;
}
@@ -2279,7 +2279,7 @@ move_loop_invariants (void)
/* move_single_loop_invariants for very large loops is time consuming
and might need a lot of memory. For -O1 only do loop invariant
motion for very small loops. */
- unsigned max_bbs = LOOP_INVARIANT_MAX_BBS_IN_LOOP;
+ unsigned max_bbs = param_loop_invariant_max_bbs_in_loop;
if (optimize < 2)
max_bbs /= 10;
if (loop->num_nodes <= max_bbs)
diff --git a/gcc/loop-unroll.c b/gcc/loop-unroll.c
index 63fccd23fae..551405ad0d1 100644
--- a/gcc/loop-unroll.c
+++ b/gcc/loop-unroll.c
@@ -364,13 +364,13 @@ decide_unroll_constant_iterations (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once). */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
nunroll_by_av
- = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -684,12 +684,12 @@ decide_unroll_runtime_iterations (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once. */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
- nunroll_by_av = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
+ nunroll_by_av = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -1167,13 +1167,13 @@ decide_unroll_stupid (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once. */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
nunroll_by_av
- = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -1824,7 +1824,7 @@ expand_var_during_unrolling (struct var_to_expand *ve, rtx_insn *insn)
/* Generate a new register only if the expansion limit has not been
reached. Else reuse an already existing expansion. */
- if (PARAM_VALUE (PARAM_MAX_VARIABLE_EXPANSIONS) > ve->expansion_count)
+ if (param_max_variable_expansions > ve->expansion_count)
{
really_new_expansion = true;
new_reg = gen_reg_rtx (GET_MODE (ve->reg));
diff --git a/gcc/lra-assigns.c b/gcc/lra-assigns.c
index e14a246c0d2..56ab9631089 100644
--- a/gcc/lra-assigns.c
+++ b/gcc/lra-assigns.c
@@ -1008,7 +1008,7 @@ spill_for (int regno, bitmap spilled_pseudo_bitmap, bool first_p)
}
n = 0;
if (sparseset_cardinality (live_range_reload_inheritance_pseudos)
- <= (unsigned)LRA_MAX_CONSIDERED_RELOAD_PSEUDOS)
+ <= (unsigned)param_lra_max_considered_reload_pseudos)
EXECUTE_IF_SET_IN_SPARSESET (live_range_reload_inheritance_pseudos,
reload_regno)
if ((int) reload_regno != regno
diff --git a/gcc/lra-constraints.c b/gcc/lra-constraints.c
index 0db6d3151cd..ced7be79017 100644
--- a/gcc/lra-constraints.c
+++ b/gcc/lra-constraints.c
@@ -6682,7 +6682,7 @@ inherit_in_ebb (rtx_insn *head, rtx_insn *tail)
a BB is not greater than the following value, we don't add the BB
to EBB. */
#define EBB_PROBABILITY_CUTOFF \
- ((REG_BR_PROB_BASE * LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF) / 100)
+ ((REG_BR_PROB_BASE * param_lra_inheritance_ebb_probability_cutoff) / 100)
/* Current number of inheritance/split iteration. */
int lra_inheritance_iter;
diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c
index 32090359814..5354350378b 100644
--- a/gcc/lto/lto-partition.c
+++ b/gcc/lto/lto-partition.c
@@ -560,13 +560,13 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
varpool_order.qsort (varpool_node_cmp);
/* Compute partition size and create the first partition. */
- if (PARAM_VALUE (MIN_PARTITION_SIZE) > max_partition_size)
+ if (param_min_partition_size > max_partition_size)
fatal_error (input_location, "min partition size cannot be greater "
"than max partition size");
partition_size = total_size / n_lto_partitions;
- if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
- partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
+ if (partition_size < param_min_partition_size)
+ partition_size = param_min_partition_size;
npartitions = 1;
partition = new_partition ("");
if (dump_file)
@@ -816,8 +816,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
fprintf (dump_file,
"Total size: %" PRId64 " partition_size: %" PRId64 "\n",
total_size, partition_size);
- if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
- partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
+ if (partition_size < param_min_partition_size)
+ partition_size = param_min_partition_size;
npartitions ++;
}
}
diff --git a/gcc/lto/lto.c b/gcc/lto/lto.c
index 86d58010e0e..ef0923c7791 100644
--- a/gcc/lto/lto.c
+++ b/gcc/lto/lto.c
@@ -436,14 +436,14 @@ do_whole_program_analysis (void)
/* TODO: jobserver communication is not supported, yet. */
if (!strcmp (flag_wpa, "jobserver"))
- lto_parallelism = PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM);
+ lto_parallelism = param_max_lto_streaming_parallelism;
else
{
lto_parallelism = atoi (flag_wpa);
if (lto_parallelism <= 0)
lto_parallelism = 0;
- if (lto_parallelism >= PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM))
- lto_parallelism = PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM);
+ if (lto_parallelism >= param_max_lto_streaming_parallelism)
+ lto_parallelism = param_max_lto_streaming_parallelism;
}
timevar_start (TV_PHASE_OPT_GEN);
@@ -492,8 +492,8 @@ do_whole_program_analysis (void)
else if (flag_lto_partition == LTO_PARTITION_ONE)
lto_balanced_map (1, INT_MAX);
else if (flag_lto_partition == LTO_PARTITION_BALANCED)
- lto_balanced_map (PARAM_VALUE (PARAM_LTO_PARTITIONS),
- PARAM_VALUE (MAX_PARTITION_SIZE));
+ lto_balanced_map (param_lto_partitions,
+ param_max_partition_size);
else
gcc_unreachable ();
diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c
index c355594bb6b..3127fb1481e 100644
--- a/gcc/modulo-sched.c
+++ b/gcc/modulo-sched.c
@@ -1433,7 +1433,7 @@ sms_schedule (void)
if ( latch_edge->count () > profile_count::zero ()
&& (latch_edge->count()
< single_exit (loop)->count ().apply_scale
- (SMS_LOOP_AVERAGE_COUNT_THRESHOLD, 1)))
+ (param_sms_loop_average_count_threshold, 1)))
{
if (dump_file)
{
@@ -1640,7 +1640,7 @@ sms_schedule (void)
/* The default value of PARAM_SMS_MIN_SC is 2 as stage count of
1 means that there is no interleaving between iterations thus
we let the scheduling passes do the job in this case. */
- if (stage_count < PARAM_VALUE (PARAM_SMS_MIN_SC)
+ if (stage_count < param_sms_min_sc
|| (count_init && (loop_count <= stage_count))
|| (max_trip_count >= 0 && max_trip_count <= stage_count)
|| (trip_count >= 0 && trip_count <= stage_count))
@@ -1832,7 +1832,7 @@ sms_schedule (void)
/* A limit on the number of cycles that resource conflicts can span. ??? Should
be provided by DFA, and be dependent on the type of insn scheduled. Currently
set to 0 to save compile time. */
-#define DFA_HISTORY SMS_DFA_HISTORY
+#define DFA_HISTORY param_sms_dfa_history
/* A threshold for the number of repeated unsuccessful attempts to insert
an empty row, before we flush the partial schedule and start over. */
diff --git a/gcc/opts.c b/gcc/opts.c
index 394cbfd1c56..a47517df80e 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -667,25 +667,18 @@ default_options_optimization (struct gcc_options *opts,
opts->x_flag_ipa_pta = true;
/* Track fields in field-sensitive alias analysis. */
- maybe_set_param_value
- (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
- opt2 ? 100 : default_param_value (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE),
- opts->x_param_values, opts_set->x_param_values);
+ if (opt2)
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_fields_for_field_sensitive,
+ 100);
if (opts->x_optimize_size)
/* We want to crossjump as much as possible. */
- maybe_set_param_value (PARAM_MIN_CROSSJUMP_INSNS, 1,
- opts->x_param_values, opts_set->x_param_values);
- else
- maybe_set_param_value (PARAM_MIN_CROSSJUMP_INSNS,
- default_param_value (PARAM_MIN_CROSSJUMP_INSNS),
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_min_crossjump_insns, 1);
/* Restrict the amount of work combine does at -Og while retaining
most of its useful transforms. */
if (opts->x_optimize_debug)
- maybe_set_param_value (PARAM_MAX_COMBINE_INSNS, 2,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_combine_insns, 2);
/* Allow default optimizations to be specified on a per-machine basis. */
maybe_default_options (opts, opts_set,
@@ -1036,10 +1029,8 @@ finish_options (struct gcc_options *opts, struct gcc_options *opts_set,
if (opts->x_flag_conserve_stack)
{
- maybe_set_param_value (PARAM_LARGE_STACK_FRAME, 100,
- opts->x_param_values, opts_set->x_param_values);
- maybe_set_param_value (PARAM_STACK_FRAME_GROWTH, 40,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_large_stack_frame, 100);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_stack_frame_growth, 40);
}
if (opts->x_flag_lto)
@@ -2272,19 +2263,13 @@ common_handle_option (struct gcc_options *opts,
all features. */
if (opts->x_flag_sanitize & SANITIZE_KERNEL_ADDRESS)
{
- maybe_set_param_value (PARAM_ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD,
- 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_GLOBALS, 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_STACK, 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_PROTECT_ALLOCAS, 0,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_USE_AFTER_RETURN, 0,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_asan_instrumentation_with_call_threshold,
+ 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_globals, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_stack, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_protect_allocas, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_use_after_return, 0);
}
break;
@@ -2586,9 +2571,8 @@ common_handle_option (struct gcc_options *opts,
enable_fdo_optimizations (opts, opts_set, value);
if (!opts_set->x_flag_profile_correction)
opts->x_flag_profile_correction = value;
- maybe_set_param_value (
- PARAM_EARLY_INLINER_MAX_ITERATIONS, 10,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_early_inliner_max_iterations, 10);
break;
case OPT_fprofile_generate_:
diff --git a/gcc/postreload-gcse.c b/gcc/postreload-gcse.c
index 0c12b3808a6..83df1825f16 100644
--- a/gcc/postreload-gcse.c
+++ b/gcc/postreload-gcse.c
@@ -1146,17 +1146,17 @@ eliminate_partially_redundant_load (basic_block bb, rtx_insn *insn,
/* Check if it's worth applying the partial redundancy elimination. */
if (ok_count.to_gcov_type ()
- < GCSE_AFTER_RELOAD_PARTIAL_FRACTION * not_ok_count.to_gcov_type ())
+ < param_gcse_after_reload_partial_fraction * not_ok_count.to_gcov_type ())
goto cleanup;
gcov_type threshold;
#if (GCC_VERSION >= 5000)
- if (__builtin_mul_overflow (GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
+ if (__builtin_mul_overflow (param_gcse_after_reload_critical_fraction,
critical_count.to_gcov_type (), &threshold))
threshold = profile_count::max_count;
#else
threshold
- = GCSE_AFTER_RELOAD_CRITICAL_FRACTION * critical_count.to_gcov_type ();
+ = param_gcse_after_reload_critical_fraction * critical_count.to_gcov_type ();
#endif
if (ok_count.to_gcov_type () < threshold)
diff --git a/gcc/predict.c b/gcc/predict.c
index 915f0806b11..5ee56a33fd7 100644
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -132,7 +132,7 @@ get_hot_bb_threshold ()
{
if (min_count == -1)
{
- const int hot_frac = PARAM_VALUE (HOT_BB_COUNT_FRACTION);
+ const int hot_frac = param_hot_bb_count_fraction;
const gcov_type min_hot_count
= hot_frac
? profile_info->sum_max / hot_frac
@@ -177,7 +177,7 @@ maybe_hot_count_p (struct function *fun, profile_count count)
if (node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
&& count < (ENTRY_BLOCK_PTR_FOR_FN (fun)->count.apply_scale (2, 3)))
return false;
- if (count.apply_scale (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION), 1)
+ if (count.apply_scale (param_hot_bb_frequency_fraction, 1)
< ENTRY_BLOCK_PTR_FOR_FN (fun)->count)
return false;
return true;
@@ -223,7 +223,7 @@ probably_never_executed (struct function *fun, profile_count count)
desirable. */
if (count.precise_p () && profile_status_for_fn (fun) == PROFILE_READ)
{
- const int unlikely_frac = PARAM_VALUE (UNLIKELY_BB_COUNT_FRACTION);
+ const int unlikely_frac = param_unlikely_bb_count_fraction;
if (count.apply_scale (unlikely_frac, 1) >= profile_info->runs)
return false;
return true;
@@ -412,9 +412,9 @@ predictable_edge_p (edge e)
if (!e->probability.initialized_p ())
return false;
if ((e->probability.to_reg_br_prob_base ()
- <= PARAM_VALUE (PARAM_PREDICTABLE_BRANCH_OUTCOME) * REG_BR_PROB_BASE / 100)
+ <= param_predictable_branch_outcome * REG_BR_PROB_BASE / 100)
|| (REG_BR_PROB_BASE - e->probability.to_reg_br_prob_base ()
- <= PARAM_VALUE (PARAM_PREDICTABLE_BRANCH_OUTCOME) * REG_BR_PROB_BASE / 100))
+ <= param_predictable_branch_outcome * REG_BR_PROB_BASE / 100))
return true;
return false;
}
@@ -1963,7 +1963,7 @@ predict_loops (void)
{
tree niter = NULL;
HOST_WIDE_INT nitercst;
- int max = PARAM_VALUE (PARAM_MAX_PREDICTED_ITERATIONS);
+ int max = param_max_predicted_iterations;
int probability;
enum br_predictor predictor;
widest_int nit;
@@ -2443,7 +2443,7 @@ expr_expected_value_1 (tree type, tree op0, enum tree_code code,
*predictor = (enum br_predictor) tree_to_uhwi (val2);
if (*predictor == PRED_BUILTIN_EXPECT)
*probability
- = HITRATE (PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY));
+ = HITRATE (param_builtin_expect_probability);
return gimple_call_arg (def, 1);
}
return NULL;
@@ -2469,7 +2469,7 @@ expr_expected_value_1 (tree type, tree op0, enum tree_code code,
return val;
*predictor = PRED_BUILTIN_EXPECT;
*probability
- = HITRATE (PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY));
+ = HITRATE (param_builtin_expect_probability);
return gimple_call_arg (def, 1);
}
case BUILT_IN_EXPECT_WITH_PROBABILITY:
@@ -2660,7 +2660,7 @@ tree_predict_by_opcode (basic_block bb)
edge e = find_taken_edge_switch_expr (sw, val);
if (predictor == PRED_BUILTIN_EXPECT)
{
- int percent = PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY);
+ int percent = param_builtin_expect_probability;
gcc_assert (percent >= 0 && percent <= 100);
predict_edge (e, PRED_BUILTIN_EXPECT,
HITRATE (percent));
@@ -3531,7 +3531,7 @@ drop_profile (struct cgraph_node *node, profile_count call_count)
void
handle_missing_profiles (void)
{
- const int unlikely_frac = PARAM_VALUE (UNLIKELY_BB_COUNT_FRACTION);
+ const int unlikely_frac = param_unlikely_bb_count_fraction;
struct cgraph_node *node;
auto_vec<struct cgraph_node *, 64> worklist;
diff --git a/gcc/reload.c b/gcc/reload.c
index 8582b4840ae..b8178238ff9 100644
--- a/gcc/reload.c
+++ b/gcc/reload.c
@@ -6717,7 +6717,7 @@ find_equiv_reg (rtx goal, rtx_insn *insn, enum reg_class rclass, int other,
continue;
num++;
if (p == 0 || LABEL_P (p)
- || num > PARAM_VALUE (PARAM_MAX_RELOAD_SEARCH_INSNS))
+ || num > param_max_reload_search_insns)
return 0;
/* Don't reuse register contents from before a setjmp-type
diff --git a/gcc/reorg.c b/gcc/reorg.c
index cba183e9c72..460741213f2 100644
--- a/gcc/reorg.c
+++ b/gcc/reorg.c
@@ -1489,7 +1489,7 @@ redundant_insn (rtx insn, rtx_insn *target, const vec<rtx_insn *> &delay_list)
/* Scan backwards looking for a match. */
for (trial = PREV_INSN (target),
- insns_to_search = MAX_DELAY_SLOT_INSN_SEARCH;
+ insns_to_search = param_max_delay_slot_insn_search;
trial && insns_to_search > 0;
trial = PREV_INSN (trial))
{
@@ -1593,7 +1593,7 @@ redundant_insn (rtx insn, rtx_insn *target, const vec<rtx_insn *> &delay_list)
INSN sets or sets something insn uses or sets. */
for (trial = PREV_INSN (target),
- insns_to_search = MAX_DELAY_SLOT_INSN_SEARCH;
+ insns_to_search = param_max_delay_slot_insn_search;
trial && !LABEL_P (trial) && insns_to_search > 0;
trial = PREV_INSN (trial))
{
diff --git a/gcc/resource.c b/gcc/resource.c
index bf2d6beaf39..5d16100ef48 100644
--- a/gcc/resource.c
+++ b/gcc/resource.c
@@ -928,7 +928,7 @@ mark_target_live_regs (rtx_insn *insns, rtx target_maybe_return, struct resource
}
if (b == -1)
- b = find_basic_block (target, MAX_DELAY_SLOT_LIVE_SEARCH);
+ b = find_basic_block (target, param_max_delay_slot_live_search);
if (target_hash_table != NULL)
{
@@ -1289,7 +1289,7 @@ clear_hashed_info_for_insn (rtx_insn *insn)
void
incr_ticks_for_insn (rtx_insn *insn)
{
- int b = find_basic_block (insn, MAX_DELAY_SLOT_LIVE_SEARCH);
+ int b = find_basic_block (insn, param_max_delay_slot_live_search);
if (b != -1)
bb_ticks[b]++;
diff --git a/gcc/sanopt.c b/gcc/sanopt.c
index 00ade872832..7a4daeaf458 100644
--- a/gcc/sanopt.c
+++ b/gcc/sanopt.c
@@ -1289,8 +1289,8 @@ pass_sanopt::execute (function *fun)
if (asan_sanitize_stack_p ())
sanitize_rewrite_addressable_params (fun);
- bool use_calls = ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD < INT_MAX
- && asan_num_accesses >= ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD;
+ bool use_calls = param_asan_instrumentation_with_call_threshold < INT_MAX
+ && asan_num_accesses >= param_asan_instrumentation_with_call_threshold;
hash_map<tree, tree> shadow_vars_mapping;
bool need_commit_edge_insert = false;
diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c
index 308db4e3ca0..8b544b88592 100644
--- a/gcc/sched-deps.c
+++ b/gcc/sched-deps.c
@@ -2480,7 +2480,7 @@ sched_analyze_1 (class deps_desc *deps, rtx x, rtx_insn *insn)
/* Pending lists can't get larger with a readonly context. */
if (!deps->readonly
&& ((deps->pending_read_list_length + deps->pending_write_list_length)
- >= MAX_PENDING_LIST_LENGTH))
+ >= param_max_pending_list_length))
{
/* Flush all pending reads and writes to prevent the pending lists
from getting any larger. Insn scheduling runs too slowly when
@@ -2697,7 +2697,7 @@ sched_analyze_2 (class deps_desc *deps, rtx x, rtx_insn *insn)
{
if ((deps->pending_read_list_length
+ deps->pending_write_list_length)
- >= MAX_PENDING_LIST_LENGTH
+ >= param_max_pending_list_length
&& !DEBUG_INSN_P (insn))
flush_pending_lists (deps, insn, true, true);
add_insn_mem_dependence (deps, true, insn, x);
@@ -3222,8 +3222,8 @@ sched_analyze_insn (class deps_desc *deps, rtx x, rtx_insn *insn)
EXECUTE_IF_SET_IN_REG_SET (reg_pending_clobbers, 0, i, rsi)
{
struct deps_reg *reg_last = &deps->reg_last[i];
- if (reg_last->uses_length >= MAX_PENDING_LIST_LENGTH
- || reg_last->clobbers_length >= MAX_PENDING_LIST_LENGTH)
+ if (reg_last->uses_length >= param_max_pending_list_length
+ || reg_last->clobbers_length >= param_max_pending_list_length)
{
add_dependence_list_and_free (deps, insn, ®_last->sets, 0,
REG_DEP_OUTPUT, false);
@@ -3679,7 +3679,7 @@ deps_analyze_insn (class deps_desc *deps, rtx_insn *insn)
&& sel_insn_is_speculation_check (insn)))
{
/* Keep the list a reasonable size. */
- if (deps->pending_flush_length++ >= MAX_PENDING_LIST_LENGTH)
+ if (deps->pending_flush_length++ >= param_max_pending_list_length)
flush_pending_lists (deps, insn, true, true);
else
deps->pending_jump_insns
diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c
index a594b49ec66..c60afa340e7 100644
--- a/gcc/sched-ebb.c
+++ b/gcc/sched-ebb.c
@@ -620,9 +620,9 @@ schedule_ebbs (void)
return;
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
schedule_ebbs_init ();
diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c
index 3e0825075a3..99b6619607b 100644
--- a/gcc/sched-rgn.c
+++ b/gcc/sched-rgn.c
@@ -485,9 +485,9 @@ find_single_block_region (bool ebbs_p)
if (ebbs_p) {
int probability_cutoff;
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
FOR_EACH_BB_FN (ebb_start, cfun)
@@ -569,8 +569,8 @@ too_large (int block, int *num_bbs, int *num_insns)
(*num_insns) += (common_sched_info->estimate_number_of_insns
(BASIC_BLOCK_FOR_FN (cfun, block)));
- return ((*num_bbs > PARAM_VALUE (PARAM_MAX_SCHED_REGION_BLOCKS))
- || (*num_insns > PARAM_VALUE (PARAM_MAX_SCHED_REGION_INSNS)));
+ return ((*num_bbs > param_max_sched_region_blocks)
+ || (*num_insns > param_max_sched_region_insns));
}
/* Update_loop_relations(blk, hdr): Check if the loop headed by max_hdr[blk]
@@ -800,7 +800,7 @@ haifa_find_rgns (void)
queue = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
- extend_regions_p = PARAM_VALUE (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS) > 0;
+ extend_regions_p = param_max_sched_extend_regions_iters > 0;
if (extend_regions_p)
{
degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun));
@@ -1161,7 +1161,7 @@ extend_rgns (int *degree, int *idxp, sbitmap header, int *loop_hdr)
int *order, i, rescan = 0, idx = *idxp, iter = 0, max_iter, *max_hdr;
int nblocks = n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS;
- max_iter = PARAM_VALUE (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS);
+ max_iter = param_max_sched_extend_regions_iters;
max_hdr = XNEWVEC (int, last_basic_block_for_fn (cfun));
@@ -2224,7 +2224,7 @@ new_ready (rtx_insn *next, ds_t ts)
|| (IS_SPECULATIVE_INSN (next)
&& ((recog_memoized (next) >= 0
&& min_insn_conflict_delay (curr_state, next, next)
- > PARAM_VALUE (PARAM_MAX_SCHED_INSN_CONFLICT_DELAY))
+ > param_max_sched_insn_conflict_delay)
|| IS_SPECULATION_CHECK_P (next)
|| !check_live (next, INSN_BB (next))
|| (not_ex_free = !is_exception_free (next, INSN_BB (next),
@@ -3189,7 +3189,7 @@ schedule_region (int rgn)
if (f
&& (!f->probability.initialized_p ()
|| f->probability.to_reg_br_prob_base () * 100 / REG_BR_PROB_BASE >=
- PARAM_VALUE (PARAM_SCHED_STATE_EDGE_PROB_CUTOFF)))
+ param_sched_state_edge_prob_cutoff))
{
memcpy (bb_state[f->dest->index], curr_state,
dfa_state_size);
@@ -3229,7 +3229,7 @@ schedule_region (int rgn)
void
sched_rgn_init (bool single_blocks_p)
{
- min_spec_prob = ((PARAM_VALUE (PARAM_MIN_SPEC_PROB) * REG_BR_PROB_BASE)
+ min_spec_prob = ((param_min_spec_prob * REG_BR_PROB_BASE)
/ 100);
nr_inter = 0;
diff --git a/gcc/sel-sched-ir.c b/gcc/sel-sched-ir.c
index 8a1d41473b9..d6513b136a0 100644
--- a/gcc/sel-sched-ir.c
+++ b/gcc/sel-sched-ir.c
@@ -6012,7 +6012,7 @@ make_region_from_loop (class loop *loop)
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. */
@@ -6021,7 +6021,7 @@ make_region_from_loop (class loop *loop)
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);
diff --git a/gcc/sel-sched-ir.h b/gcc/sel-sched-ir.h
index ddc76a73ede..531b0129cd9 100644
--- a/gcc/sel-sched-ir.h
+++ b/gcc/sel-sched-ir.h
@@ -969,7 +969,7 @@ extern bool preheader_removed;
/* Software lookahead window size.
According to the results in Nakatani and Ebcioglu [1993], window size of 16
is enough to extract most ILP in integer code. */
-#define MAX_WS (PARAM_VALUE (PARAM_SELSCHED_MAX_LOOKAHEAD))
+#define MAX_WS (param_selsched_max_lookahead)
extern regset sel_all_regs;
\f
diff --git a/gcc/sel-sched.c b/gcc/sel-sched.c
index 652784e79ed..2ecc06d0f17 100644
--- a/gcc/sel-sched.c
+++ b/gcc/sel-sched.c
@@ -3454,7 +3454,7 @@ process_pipelined_exprs (av_set_t *av_ptr)
FOR_EACH_EXPR_1 (expr, si, av_ptr)
{
if (EXPR_SCHED_TIMES (expr)
- >= PARAM_VALUE (PARAM_SELSCHED_MAX_SCHED_TIMES))
+ >= param_selsched_max_sched_times)
av_set_iter_remove (&si);
}
}
@@ -6806,7 +6806,7 @@ sel_setup_region_sched_flags (void)
&& (flag_sel_sched_pipelining != 0)
&& current_loop_nest != NULL
&& loop_has_exit_edges (current_loop_nest));
- max_insns_to_rename = PARAM_VALUE (PARAM_SELSCHED_INSNS_TO_RENAME);
+ max_insns_to_rename = param_selsched_insns_to_rename;
max_ws = MAX_WS;
}
diff --git a/gcc/shrink-wrap.c b/gcc/shrink-wrap.c
index 2dc92c34b17..e612f85c15a 100644
--- a/gcc/shrink-wrap.c
+++ b/gcc/shrink-wrap.c
@@ -775,7 +775,7 @@ try_shrink_wrapping (edge *entry_edge, rtx_insn *prologue_seq)
vec.quick_push (pro);
unsigned max_grow_size = get_uncond_jump_length ();
- max_grow_size *= PARAM_VALUE (PARAM_MAX_GROW_COPY_BB_INSNS);
+ max_grow_size *= param_max_grow_copy_bb_insns;
while (!vec.is_empty () && pro != entry)
{
diff --git a/gcc/targhooks.c b/gcc/targhooks.c
index fee4cc271cd..2f26e468b8a 100644
--- a/gcc/targhooks.c
+++ b/gcc/targhooks.c
@@ -2274,17 +2274,18 @@ default_max_noce_ifcvt_seq_cost (edge e)
{
bool predictable_p = predictable_edge_p (e);
- enum compiler_param param
- = (predictable_p
- ? PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST
- : PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST);
-
- /* If we have a parameter set, use that, otherwise take a guess using
- BRANCH_COST. */
- if (global_options_set.x_param_values[param])
- return PARAM_VALUE (param);
+ if (predictable_p)
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_predictable_cost)
+ return param_max_rtl_if_conversion_predictable_cost;
+ }
else
- return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3);
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_unpredictable_cost)
+ return param_max_rtl_if_conversion_unpredictable_cost;
+ }
+
+ return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3);
}
/* Default implementation of TARGET_MIN_ARITHMETIC_PRECISION. */
diff --git a/gcc/toplev.c b/gcc/toplev.c
index 18fea1c3dd1..a836646f8a1 100644
--- a/gcc/toplev.c
+++ b/gcc/toplev.c
@@ -679,7 +679,7 @@ print_version (FILE *file, const char *indent, bool show_global_state)
fprintf (file,
file == stderr ? _(fmt4) : fmt4,
indent, *indent != 0 ? " " : "",
- PARAM_VALUE (GGC_MIN_EXPAND), PARAM_VALUE (GGC_MIN_HEAPSIZE));
+ param_ggc_min_expand, param_ggc_min_heapsize);
print_plugins_versions (file, indent);
}
@@ -1863,7 +1863,7 @@ process_options (void)
if (flag_checking >= 2)
hash_table_sanitize_eq_limit
- = PARAM_VALUE (PARAM_HASH_TABLE_VERIFICATION_LIMIT);
+ = param_hash_table_verification_limit;
/* Please don't change global_options after this point, those changes won't
be reflected in optimization_{default,current}_node. */
diff --git a/gcc/tracer.c b/gcc/tracer.c
index 52f07c56f03..02203923369 100644
--- a/gcc/tracer.c
+++ b/gcc/tracer.c
@@ -276,13 +276,13 @@ tail_duplicate (void)
initialize_original_copy_tables ();
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
branch_ratio_cutoff =
- (REG_BR_PROB_BASE / 100 * PARAM_VALUE (TRACER_MIN_BRANCH_RATIO));
+ (REG_BR_PROB_BASE / 100 * param_tracer_min_branch_ratio);
FOR_EACH_BB_FN (bb, cfun)
{
@@ -296,11 +296,11 @@ tail_duplicate (void)
}
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE_FEEDBACK);
+ cover_insns = param_tracer_dynamic_coverage_feedback;
else
- cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE);
+ cover_insns = param_tracer_dynamic_coverage;
cover_insns = (weighted_insns * cover_insns + 50) / 100;
- max_dup_insns = (ninsns * PARAM_VALUE (TRACER_MAX_CODE_GROWTH) + 50) / 100;
+ max_dup_insns = (ninsns * param_tracer_max_code_growth + 50) / 100;
while (traced_insns < cover_insns && nduplicated < max_dup_insns
&& !heap.empty ())
diff --git a/gcc/trans-mem.c b/gcc/trans-mem.c
index 2e775286540..4a0f6e7dee9 100644
--- a/gcc/trans-mem.c
+++ b/gcc/trans-mem.c
@@ -1108,7 +1108,7 @@ tm_log_add (basic_block entry_block, tree addr, gimple *stmt)
&& TYPE_SIZE_UNIT (type) != NULL
&& tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
&& ((HOST_WIDE_INT) tree_to_uhwi (TYPE_SIZE_UNIT (type))
- < PARAM_VALUE (PARAM_TM_MAX_AGGREGATE_SIZE))
+ < param_tm_max_aggregate_size)
/* We must be able to copy this type normally. I.e., no
special constructors and the like. */
&& !TREE_ADDRESSABLE (type))
diff --git a/gcc/tree-chrec.c b/gcc/tree-chrec.c
index 5ed62260993..8d5fce30289 100644
--- a/gcc/tree-chrec.c
+++ b/gcc/tree-chrec.c
@@ -333,9 +333,9 @@ chrec_fold_plus_1 (enum tree_code code, tree type,
int size = 0;
if ((tree_contains_chrecs (op0, &size)
|| tree_contains_chrecs (op1, &size))
- && size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ && size < param_scev_max_expr_size)
return build2 (code, type, op0, op1);
- else if (size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ else if (size < param_scev_max_expr_size)
{
if (code == POINTER_PLUS_EXPR)
return fold_build_pointer_plus (fold_convert (type, op0),
diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c
index 7f75b7e3afe..e9fa4ae69c3 100644
--- a/gcc/tree-data-ref.c
+++ b/gcc/tree-data-ref.c
@@ -836,7 +836,7 @@ split_constant_offset (tree exp, tree *var, tree *off,
void
split_constant_offset (tree exp, tree *var, tree *off)
{
- unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ unsigned limit = param_ssa_name_def_chain_limit;
static hash_map<tree, std::pair<tree, tree> > *cache;
if (!cache)
cache = new hash_map<tree, std::pair<tree, tree> > (37);
@@ -4917,7 +4917,7 @@ compute_all_dependences (vec<data_reference_p> datarefs,
unsigned int i, j;
if ((int) datarefs.length ()
- > PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ > param_loop_max_datarefs_for_datadeps)
{
struct data_dependence_relation *ddr;
diff --git a/gcc/tree-if-conv.c b/gcc/tree-if-conv.c
index df9046a3014..09560198539 100644
--- a/gcc/tree-if-conv.c
+++ b/gcc/tree-if-conv.c
@@ -125,7 +125,7 @@ along with GCC; see the file COPYING3. If not see
/* Only handle PHIs with no more arguments unless we are asked to by
simd pragma. */
#define MAX_PHI_ARG_NUM \
- ((unsigned) PARAM_VALUE (PARAM_MAX_TREE_IF_CONVERSION_PHI_ARGS))
+ ((unsigned) param_max_tree_if_conversion_phi_args)
/* True if we've converted a statement that was only executed when some
condition C was true, and if for correctness we need to predicate the
diff --git a/gcc/tree-inline.c b/gcc/tree-inline.c
index 2b8b9ee58c1..b1b6dca9070 100644
--- a/gcc/tree-inline.c
+++ b/gcc/tree-inline.c
@@ -1812,7 +1812,7 @@ remap_gimple_stmt (gimple *stmt, copy_body_data *id)
/* If the inlined function has too many debug markers,
don't copy them. */
if (id->src_cfun->debug_marker_count
- > PARAM_VALUE (PARAM_MAX_DEBUG_MARKER_COUNT))
+ > param_max_debug_marker_count)
return stmts;
gdebug *copy = as_a <gdebug *> (gimple_copy (stmt));
diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c
index 81784866ad1..9930daaafa9 100644
--- a/gcc/tree-loop-distribution.c
+++ b/gcc/tree-loop-distribution.c
@@ -119,7 +119,7 @@ along with GCC; see the file COPYING3. If not see
#define MAX_DATAREFS_NUM \
- ((unsigned) PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ ((unsigned) param_loop_max_datarefs_for_datadeps)
/* Threshold controlling number of distributed partitions. Given it may
be unnecessary if a memory stream cost model is invented in the future,
diff --git a/gcc/tree-parloops.c b/gcc/tree-parloops.c
index ae880e151db..1a35c7dbdc3 100644
--- a/gcc/tree-parloops.c
+++ b/gcc/tree-parloops.c
@@ -890,7 +890,7 @@ parloops_force_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info
/* Minimal number of iterations of a loop that should be executed in each
thread. */
-#define MIN_PER_THREAD PARAM_VALUE (PARAM_PARLOOPS_MIN_PER_THREAD)
+#define MIN_PER_THREAD param_parloops_min_per_thread
/* Element of the hashtable, representing a
reduction in the current loop. */
@@ -2875,25 +2875,23 @@ create_parallel_loop (class loop *loop, tree loop_fn, tree data,
else
{
t = build_omp_clause (loc, OMP_CLAUSE_SCHEDULE);
- int chunk_size = PARAM_VALUE (PARAM_PARLOOPS_CHUNK_SIZE);
- enum PARAM_PARLOOPS_SCHEDULE_KIND schedule_type \
- = (enum PARAM_PARLOOPS_SCHEDULE_KIND) PARAM_VALUE (PARAM_PARLOOPS_SCHEDULE);
- switch (schedule_type)
+ int chunk_size = param_parloops_chunk_size;
+ switch (param_parloops_schedule)
{
- case PARAM_PARLOOPS_SCHEDULE_KIND_static:
+ case PARLOOPS_SCHEDULE_STATIC:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_STATIC;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_dynamic:
+ case PARLOOPS_SCHEDULE_DYNAMIC:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_guided:
+ case PARLOOPS_SCHEDULE_GUIDED:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_GUIDED;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_auto:
+ case PARLOOPS_SCHEDULE_AUTO:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_AUTO;
chunk_size = 0;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_runtime:
+ case PARLOOPS_SCHEDULE_RUNTIME:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_RUNTIME;
chunk_size = 0;
break;
diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c
index 299c45e287b..3fe2a6dcb0a 100644
--- a/gcc/tree-predcom.c
+++ b/gcc/tree-predcom.c
@@ -2194,7 +2194,7 @@ determine_unroll_factor (vec<chain_p> chains)
{
chain_p chain;
unsigned factor = 1, af, nfactor, i;
- unsigned max = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ unsigned max = param_max_unroll_times;
FOR_EACH_VEC_ELT (chains, i, chain)
{
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c
index 50b2700834e..ed5d5663a3a 100644
--- a/gcc/tree-scalar-evolution.c
+++ b/gcc/tree-scalar-evolution.c
@@ -1149,7 +1149,7 @@ tail_recurse:
return t_false;
/* Give up if the path is longer than the MAX that we allow. */
- if (limit > PARAM_VALUE (PARAM_SCEV_MAX_EXPR_COMPLEXITY))
+ if (limit > param_scev_max_expr_complexity)
{
*evolution_of_loop = chrec_dont_know;
return t_dont_know;
@@ -2623,7 +2623,7 @@ instantiate_scev_r (edge instantiate_below,
bool *fold_conversions, int size_expr)
{
/* Give up if the expression is larger than the MAX that we allow. */
- if (size_expr++ > PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ if (size_expr++ > param_scev_max_expr_size)
return chrec_dont_know;
if (chrec == NULL_TREE
diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index 44862690559..209f9718d33 100644
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -2786,16 +2786,21 @@ analyze_all_variable_accesses (void)
unsigned i;
bool optimize_speed_p = !optimize_function_for_size_p (cfun);
- enum compiler_param param = optimize_speed_p
- ? PARAM_SRA_MAX_SCALARIZATION_SIZE_SPEED
- : PARAM_SRA_MAX_SCALARIZATION_SIZE_SIZE;
-
/* If the user didn't set PARAM_SRA_MAX_SCALARIZATION_SIZE_<...>,
fall back to a target default. */
unsigned HOST_WIDE_INT max_scalarization_size
- = global_options_set.x_param_values[param]
- ? PARAM_VALUE (param)
- : get_move_ratio (optimize_speed_p) * UNITS_PER_WORD;
+ = get_move_ratio (optimize_speed_p) * UNITS_PER_WORD;
+
+ if (optimize_speed_p)
+ {
+ if (global_options_set.x_param_sra_max_scalarization_size_speed)
+ max_scalarization_size = param_sra_max_scalarization_size_speed;
+ }
+ else
+ {
+ if (global_options_set.x_param_sra_max_scalarization_size_size)
+ max_scalarization_size = param_sra_max_scalarization_size_size;
+ }
max_scalarization_size *= BITS_PER_UNIT;
diff --git a/gcc/tree-ssa-ccp.c b/gcc/tree-ssa-ccp.c
index 567aef8bc26..335787e0517 100644
--- a/gcc/tree-ssa-ccp.c
+++ b/gcc/tree-ssa-ccp.c
@@ -2195,7 +2195,7 @@ fold_builtin_alloca_with_align (gimple *stmt)
size = tree_to_uhwi (arg);
/* Heuristic: don't fold large allocas. */
- threshold = (unsigned HOST_WIDE_INT)PARAM_VALUE (PARAM_LARGE_STACK_FRAME);
+ threshold = (unsigned HOST_WIDE_INT)param_large_stack_frame;
/* In case the alloca is located at function entry, it has the same lifetime
as a declared array, so we allow a larger size. */
block = gimple_block (stmt);
diff --git a/gcc/tree-ssa-dse.c b/gcc/tree-ssa-dse.c
index 21a15eef690..1b060d9e408 100644
--- a/gcc/tree-ssa-dse.c
+++ b/gcc/tree-ssa-dse.c
@@ -238,7 +238,7 @@ setup_live_bytes_from_ref (ao_ref *ref, sbitmap live_bytes)
if (valid_ao_ref_for_dse (ref)
&& ref->size.is_constant (&const_size)
&& (const_size / BITS_PER_UNIT
- <= PARAM_VALUE (PARAM_DSE_MAX_OBJECT_SIZE)))
+ <= param_dse_max_object_size))
{
bitmap_clear (live_bytes);
bitmap_set_range (live_bytes, 0, const_size / BITS_PER_UNIT);
@@ -611,7 +611,7 @@ dse_optimize_redundant_stores (gimple *stmt)
FOR_EACH_IMM_USE_STMT (use_stmt, ui, defvar)
{
/* Limit stmt walking. */
- if (++cnt > PARAM_VALUE (PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE))
+ if (++cnt > param_dse_max_alias_queries_per_store)
BREAK_FROM_IMM_USE_STMT (ui);
/* If USE_STMT stores 0 into one or more of the same locations
@@ -704,7 +704,7 @@ dse_classify_store (ao_ref *ref, gimple *stmt,
FOR_EACH_IMM_USE_STMT (use_stmt, ui, defvar)
{
/* Limit stmt walking. */
- if (++cnt > PARAM_VALUE (PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE))
+ if (++cnt > param_dse_max_alias_queries_per_store)
{
fail = true;
BREAK_FROM_IMM_USE_STMT (ui);
@@ -853,7 +853,7 @@ class dse_dom_walker : public dom_walker
public:
dse_dom_walker (cdi_direction direction)
: dom_walker (direction),
- m_live_bytes (PARAM_VALUE (PARAM_DSE_MAX_OBJECT_SIZE)),
+ m_live_bytes (param_dse_max_object_size),
m_byte_tracking_enabled (false) {}
virtual edge before_dom_children (basic_block);
diff --git a/gcc/tree-ssa-ifcombine.c b/gcc/tree-ssa-ifcombine.c
index 21c1b0e8918..fa3bc0a4377 100644
--- a/gcc/tree-ssa-ifcombine.c
+++ b/gcc/tree-ssa-ifcombine.c
@@ -565,9 +565,9 @@ ifcombine_ifandif (basic_block inner_cond_bb, bool inner_inv,
tree t1, t2;
gimple_stmt_iterator gsi;
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (!logical_op_non_short_circuit || flag_sanitize_coverage)
return false;
/* Only do this optimization if the inner bb contains only the conditional. */
diff --git a/gcc/tree-ssa-loop-ch.c b/gcc/tree-ssa-loop-ch.c
index 5a30a296d5e..fd6d74d5891 100644
--- a/gcc/tree-ssa-loop-ch.c
+++ b/gcc/tree-ssa-loop-ch.c
@@ -368,7 +368,7 @@ ch_base::copy_headers (function *fun)
FOR_EACH_LOOP (loop, 0)
{
- int initial_limit = PARAM_VALUE (PARAM_MAX_LOOP_HEADER_INSNS);
+ int initial_limit = param_max_loop_header_insns;
int remaining_limit = initial_limit;
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/tree-ssa-loop-im.c b/gcc/tree-ssa-loop-im.c
index 78664188c45..cd1aa563e21 100644
--- a/gcc/tree-ssa-loop-im.c
+++ b/gcc/tree-ssa-loop-im.c
@@ -230,7 +230,7 @@ static bool ref_indep_loop_p (class loop *, im_mem_ref *);
static bool ref_always_accessed_p (class loop *, im_mem_ref *, bool);
/* Minimum cost of an expensive expression. */
-#define LIM_EXPENSIVE ((unsigned) PARAM_VALUE (PARAM_LIM_EXPENSIVE))
+#define LIM_EXPENSIVE ((unsigned) param_lim_expensive)
/* The outermost loop for which execution of the header guarantees that the
block will be executed. */
diff --git a/gcc/tree-ssa-loop-ivcanon.c b/gcc/tree-ssa-loop-ivcanon.c
index c505f85f91a..7b352431225 100644
--- a/gcc/tree-ssa-loop-ivcanon.c
+++ b/gcc/tree-ssa-loop-ivcanon.c
@@ -739,7 +739,7 @@ try_unroll_loop_completely (class loop *loop,
return false;
if (!loop->unroll
- && n_unroll > (unsigned) PARAM_VALUE (PARAM_MAX_COMPLETELY_PEEL_TIMES))
+ && n_unroll > (unsigned) param_max_completely_peel_times)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d "
@@ -780,7 +780,7 @@ try_unroll_loop_completely (class loop *loop,
bool large
= tree_estimate_loop_size
(loop, remove_exit ? exit : NULL, edge_to_cancel, &size,
- PARAM_VALUE (PARAM_MAX_COMPLETELY_PEELED_INSNS));
+ param_max_completely_peeled_insns);
if (large)
{
if (dump_file && (dump_flags & TDF_DETAILS))
@@ -864,7 +864,7 @@ try_unroll_loop_completely (class loop *loop,
blow the branch predictor tables. Limit number of
branches on the hot path through the peeled sequence. */
else if (size.num_branches_on_hot_path * (int)n_unroll
- > PARAM_VALUE (PARAM_MAX_PEEL_BRANCHES))
+ > param_max_peel_branches)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d: "
@@ -874,7 +874,7 @@ try_unroll_loop_completely (class loop *loop,
return false;
}
else if (unr_insns
- > (unsigned) PARAM_VALUE (PARAM_MAX_COMPLETELY_PEELED_INSNS))
+ > (unsigned) param_max_completely_peeled_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d: "
@@ -998,7 +998,7 @@ try_peel_loop (class loop *loop,
int peeled_size;
if (!flag_peel_loops
- || PARAM_VALUE (PARAM_MAX_PEEL_TIMES) <= 0
+ || param_max_peel_times <= 0
|| !peeled_loops)
return false;
@@ -1057,7 +1057,7 @@ try_peel_loop (class loop *loop,
/* We want to peel estimated number of iterations + 1 (so we never
enter the loop on quick path). Check against PARAM_MAX_PEEL_TIMES
and be sure to avoid overflows. */
- if (npeel > PARAM_VALUE (PARAM_MAX_PEEL_TIMES) - 1)
+ if (npeel > param_max_peel_times - 1)
{
if (dump_file)
fprintf (dump_file, "Not peeling: rolls too much "
@@ -1068,9 +1068,9 @@ try_peel_loop (class loop *loop,
/* Check peeled loops size. */
tree_estimate_loop_size (loop, exit, NULL, &size,
- PARAM_VALUE (PARAM_MAX_PEELED_INSNS));
+ param_max_peeled_insns);
if ((peeled_size = estimated_peeled_sequence_size (&size, (int) npeel))
- > PARAM_VALUE (PARAM_MAX_PEELED_INSNS))
+ > param_max_peeled_insns)
{
if (dump_file)
fprintf (dump_file, "Not peeling: peeled sequence size is too large "
@@ -1502,7 +1502,7 @@ tree_unroll_loops_completely (bool may_increase_size, bool unroll_outer)
BITMAP_FREE (loop_closed_ssa_invalidated);
}
while (changed
- && ++iteration <= PARAM_VALUE (PARAM_MAX_UNROLL_ITERATIONS));
+ && ++iteration <= param_max_unroll_iterations);
BITMAP_FREE (father_bbs);
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index 5938cfec08b..6d0b8fdefd7 100644
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -151,8 +151,8 @@ avg_loop_niter (class loop *loop)
{
niter = likely_max_stmt_executions_int (loop);
- if (niter == -1 || niter > PARAM_VALUE (PARAM_AVG_LOOP_NITER))
- return PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ if (niter == -1 || niter > param_avg_loop_niter)
+ return param_avg_loop_niter;
}
return niter;
@@ -715,19 +715,19 @@ struct iv_ca_delta
/* Bound on number of candidates below that all candidates are considered. */
#define CONSIDER_ALL_CANDIDATES_BOUND \
- ((unsigned) PARAM_VALUE (PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND))
+ ((unsigned) param_iv_consider_all_candidates_bound)
/* If there are more iv occurrences, we just give up (it is quite unlikely that
optimizing such a loop would help, and it would take ages). */
#define MAX_CONSIDERED_GROUPS \
- ((unsigned) PARAM_VALUE (PARAM_IV_MAX_CONSIDERED_USES))
+ ((unsigned) param_iv_max_considered_uses)
/* If there are at most this number of ivs in the set, try removing unnecessary
ivs from the set always. */
#define ALWAYS_PRUNE_CAND_SET_BOUND \
- ((unsigned) PARAM_VALUE (PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND))
+ ((unsigned) param_iv_always_prune_cand_set_bound)
/* The list of trees for that the decl_rtl field must be reset is stored
here. */
diff --git a/gcc/tree-ssa-loop-manip.c b/gcc/tree-ssa-loop-manip.c
index 6a1bbaae573..06f90160047 100644
--- a/gcc/tree-ssa-loop-manip.c
+++ b/gcc/tree-ssa-loop-manip.c
@@ -984,7 +984,7 @@ can_unroll_loop_p (class loop *loop, unsigned factor,
/* The final loop should be small enough. */
if (tree_num_loop_insns (loop, &eni_size_weights) * factor
- > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS))
+ > (unsigned) param_max_unrolled_insns)
return false;
return true;
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c
index db666f01980..fe24a70451d 100644
--- a/gcc/tree-ssa-loop-niter.c
+++ b/gcc/tree-ssa-loop-niter.c
@@ -2863,7 +2863,7 @@ finite_loop_p (class loop *loop)
/* Bound on the number of iterations we try to evaluate. */
#define MAX_ITERATIONS_TO_TRACK \
- ((unsigned) PARAM_VALUE (PARAM_MAX_ITERATIONS_TO_TRACK))
+ ((unsigned) param_max_iterations_to_track)
/* Returns the loop phi node of LOOP such that ssa name X is derived from its
result by a chain of operations such that all but exactly one of their
diff --git a/gcc/tree-ssa-loop-prefetch.c b/gcc/tree-ssa-loop-prefetch.c
index 04ff5244b69..fbb65191ca0 100644
--- a/gcc/tree-ssa-loop-prefetch.c
+++ b/gcc/tree-ssa-loop-prefetch.c
@@ -167,7 +167,7 @@ along with GCC; see the file COPYING3. If not see
of cache hierarchy). */
#ifndef PREFETCH_BLOCK
-#define PREFETCH_BLOCK L1_CACHE_LINE_SIZE
+#define PREFETCH_BLOCK param_l1_cache_line_size
#endif
/* Do we have a forward hardware sequential prefetching? */
@@ -191,8 +191,8 @@ along with GCC; see the file COPYING3. If not see
#define ACCEPTABLE_MISS_RATE 50
#endif
-#define L1_CACHE_SIZE_BYTES ((unsigned) (L1_CACHE_SIZE * 1024))
-#define L2_CACHE_SIZE_BYTES ((unsigned) (L2_CACHE_SIZE * 1024))
+#define L1_CACHE_SIZE_BYTES ((unsigned) (param_l1_cache_size * 1024))
+#define L2_CACHE_SIZE_BYTES ((unsigned) (param_l2_cache_size * 1024))
/* We consider a memory access nontemporal if it is not reused sooner than
after L2_CACHE_SIZE_BYTES of memory are accessed. However, we ignore
@@ -993,7 +993,7 @@ static bool
should_issue_prefetch_p (struct mem_ref *ref)
{
/* Do we want to issue prefetches for non-constant strides? */
- if (!cst_and_fits_in_hwi (ref->group->step) && PREFETCH_DYNAMIC_STRIDES == 0)
+ if (!cst_and_fits_in_hwi (ref->group->step) && param_prefetch_dynamic_strides == 0)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1008,14 +1008,14 @@ should_issue_prefetch_p (struct mem_ref *ref)
range. */
if (cst_and_fits_in_hwi (ref->group->step)
&& abs_hwi (int_cst_value (ref->group->step))
- < (HOST_WIDE_INT) PREFETCH_MINIMUM_STRIDE)
+ < (HOST_WIDE_INT) param_prefetch_minimum_stride)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
"Step for reference %u:%u (" HOST_WIDE_INT_PRINT_DEC
") is less than the mininum required stride of %d\n",
ref->group->uid, ref->uid, int_cst_value (ref->group->step),
- PREFETCH_MINIMUM_STRIDE);
+ param_prefetch_minimum_stride);
return false;
}
@@ -1055,8 +1055,8 @@ schedule_prefetches (struct mem_ref_group *groups, unsigned unroll_factor,
struct mem_ref *ref;
bool any = false;
- /* At most SIMULTANEOUS_PREFETCHES should be running at the same time. */
- remaining_prefetch_slots = SIMULTANEOUS_PREFETCHES;
+ /* At most param_simultaneous_prefetches should be running at the same time. */
+ remaining_prefetch_slots = param_simultaneous_prefetches;
/* The prefetch will run for AHEAD iterations of the original loop, i.e.,
AHEAD / UNROLL_FACTOR iterations of the unrolled loop. In each iteration,
@@ -1406,7 +1406,7 @@ determine_unroll_factor (class loop *loop, struct mem_ref_group *refs,
us from unrolling the loops too many times in cases where we only expect
gains from better scheduling and decreasing loop overhead, which is not
the case here. */
- upper_bound = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / ninsns;
+ upper_bound = param_max_unrolled_insns / ninsns;
/* If we unrolled the loop more times than it iterates, the unrolled version
of the loop would be never entered. */
@@ -1459,7 +1459,7 @@ volume_of_references (struct mem_ref_group *refs)
accessed in each iteration. TODO -- in the latter case, we should
take the size of the reference into account, rounding it up on cache
line size multiple. */
- volume += L1_CACHE_LINE_SIZE / ref->prefetch_mod;
+ volume += param_l1_cache_line_size / ref->prefetch_mod;
}
return volume;
}
@@ -1512,7 +1512,7 @@ add_subscript_strides (tree access_fn, unsigned stride,
if (tree_fits_shwi_p (step))
astep = tree_to_shwi (step);
else
- astep = L1_CACHE_LINE_SIZE;
+ astep = param_l1_cache_line_size;
strides[n - 1 - loop_depth (loop) + loop_depth (aloop)] += astep * stride;
@@ -1562,7 +1562,7 @@ self_reuse_distance (data_reference_p dr, unsigned *loop_sizes, unsigned n,
if (tree_fits_uhwi_p (stride))
astride = tree_to_uhwi (stride);
else
- astride = L1_CACHE_LINE_SIZE;
+ astride = param_l1_cache_line_size;
ref = TREE_OPERAND (ref, 0);
}
@@ -1578,7 +1578,7 @@ self_reuse_distance (data_reference_p dr, unsigned *loop_sizes, unsigned n,
s = strides[i] < 0 ? -strides[i] : strides[i];
- if (s < (unsigned) L1_CACHE_LINE_SIZE
+ if (s < (unsigned) param_l1_cache_line_size
&& (loop_sizes[i]
> (unsigned) (L1_CACHE_SIZE_BYTES / NONTEMPORAL_FRACTION)))
{
@@ -1825,7 +1825,7 @@ mem_ref_count_reasonable_p (unsigned ninsns, unsigned mem_ref_count)
should account for cache misses. */
insn_to_mem_ratio = ninsns / mem_ref_count;
- if (insn_to_mem_ratio < PREFETCH_MIN_INSN_TO_MEM_RATIO)
+ if (insn_to_mem_ratio < param_prefetch_min_insn_to_mem_ratio)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1862,7 +1862,7 @@ insn_to_prefetch_ratio_too_small_p (unsigned ninsns, unsigned prefetch_count,
and the exit branches will get eliminated), so it might be better to use
tree_estimate_loop_size + estimated_unrolled_size. */
insn_to_prefetch_ratio = (unroll_factor * ninsns) / prefetch_count;
- if (insn_to_prefetch_ratio < MIN_INSN_TO_PREFETCH_RATIO)
+ if (insn_to_prefetch_ratio < param_min_insn_to_prefetch_ratio)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1902,7 +1902,7 @@ loop_prefetch_arrays (class loop *loop)
if (time == 0)
return false;
- ahead = (PREFETCH_LATENCY + time - 1) / time;
+ ahead = (param_prefetch_latency + time - 1) / time;
est_niter = estimated_stmt_executions_int (loop);
if (est_niter == -1)
est_niter = likely_max_stmt_executions_int (loop);
@@ -1998,17 +1998,17 @@ tree_ssa_prefetch_arrays (void)
{
fprintf (dump_file, "Prefetching parameters:\n");
fprintf (dump_file, " simultaneous prefetches: %d\n",
- SIMULTANEOUS_PREFETCHES);
- fprintf (dump_file, " prefetch latency: %d\n", PREFETCH_LATENCY);
+ param_simultaneous_prefetches);
+ fprintf (dump_file, " prefetch latency: %d\n", param_prefetch_latency);
fprintf (dump_file, " prefetch block size: %d\n", PREFETCH_BLOCK);
fprintf (dump_file, " L1 cache size: %d lines, %d kB\n",
- L1_CACHE_SIZE_BYTES / L1_CACHE_LINE_SIZE, L1_CACHE_SIZE);
- fprintf (dump_file, " L1 cache line size: %d\n", L1_CACHE_LINE_SIZE);
- fprintf (dump_file, " L2 cache size: %d kB\n", L2_CACHE_SIZE);
+ L1_CACHE_SIZE_BYTES / param_l1_cache_line_size, param_l1_cache_size);
+ fprintf (dump_file, " L1 cache line size: %d\n", param_l1_cache_line_size);
+ fprintf (dump_file, " L2 cache size: %d kB\n", param_l2_cache_size);
fprintf (dump_file, " min insn-to-prefetch ratio: %d \n",
- MIN_INSN_TO_PREFETCH_RATIO);
+ param_min_insn_to_prefetch_ratio);
fprintf (dump_file, " min insn-to-mem ratio: %d \n",
- PREFETCH_MIN_INSN_TO_MEM_RATIO);
+ param_prefetch_min_insn_to_mem_ratio);
fprintf (dump_file, "\n");
}
diff --git a/gcc/tree-ssa-loop-unswitch.c b/gcc/tree-ssa-loop-unswitch.c
index e60019db946..4e3aa7c41b7 100644
--- a/gcc/tree-ssa-loop-unswitch.c
+++ b/gcc/tree-ssa-loop-unswitch.c
@@ -288,7 +288,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
/* The loop should not be too large, to limit code growth. */
if (tree_num_loop_insns (loop, &eni_size_weights)
- > (unsigned) PARAM_VALUE (PARAM_MAX_UNSWITCH_INSNS))
+ > (unsigned) param_max_unswitch_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, ";; Not unswitching, loop too big\n");
@@ -323,7 +323,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
if (i == loop->num_nodes)
{
if (dump_file
- && num > PARAM_VALUE (PARAM_MAX_UNSWITCH_LEVEL)
+ && num > param_max_unswitch_level
&& (dump_flags & TDF_DETAILS))
fprintf (dump_file, ";; Not unswitching anymore, hit max level\n");
@@ -352,7 +352,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
changed = true;
}
/* Do not unswitch too much. */
- else if (num > PARAM_VALUE (PARAM_MAX_UNSWITCH_LEVEL))
+ else if (num > param_max_unswitch_level)
{
i++;
continue;
diff --git a/gcc/tree-ssa-math-opts.c b/gcc/tree-ssa-math-opts.c
index 013ef93e7ad..8b5f3149cbc 100644
--- a/gcc/tree-ssa-math-opts.c
+++ b/gcc/tree-ssa-math-opts.c
@@ -1975,7 +1975,7 @@ gimple_expand_builtin_pow (gimple_stmt_iterator *gsi, location_t loc,
&& !HONOR_SIGNED_ZEROS (mode))
{
unsigned int max_depth = speed_p
- ? PARAM_VALUE (PARAM_MAX_POW_SQRT_DEPTH)
+ ? param_max_pow_sqrt_depth
: 2;
tree expand_with_sqrts
@@ -3089,7 +3089,7 @@ convert_mult_to_fma (gimple *mul_stmt, tree op1, tree op2,
bool check_defer
= (state->m_deferring_p
&& (tree_to_shwi (TYPE_SIZE (type))
- <= PARAM_VALUE (PARAM_AVOID_FMA_MAX_BITS)));
+ <= param_avoid_fma_max_bits));
bool defer = check_defer;
bool seen_negate_p = false;
/* Make sure that the multiplication statement becomes dead after
@@ -3744,7 +3744,7 @@ math_opts_dom_walker::after_dom_children (basic_block bb)
{
gimple_stmt_iterator gsi;
- fma_deferring_state fma_state (PARAM_VALUE (PARAM_AVOID_FMA_MAX_BITS) > 0);
+ fma_deferring_state fma_state (param_avoid_fma_max_bits > 0);
for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi);)
{
diff --git a/gcc/tree-ssa-phiopt.c b/gcc/tree-ssa-phiopt.c
index 38bb8b24155..43990b79644 100644
--- a/gcc/tree-ssa-phiopt.c
+++ b/gcc/tree-ssa-phiopt.c
@@ -2469,7 +2469,7 @@ cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb,
/* If either vectorization or if-conversion is disabled then do
not sink any stores. */
- if (MAX_STORES_TO_SINK == 0
+ if (param_max_stores_to_sink == 0
|| (!flag_tree_loop_vectorize && !flag_tree_slp_vectorize)
|| !flag_tree_loop_if_convert)
return false;
@@ -2528,7 +2528,7 @@ cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb,
/* No pairs of stores found. */
if (!then_stores.length ()
- || then_stores.length () > (unsigned) MAX_STORES_TO_SINK)
+ || then_stores.length () > (unsigned) param_max_stores_to_sink)
{
free_data_refs (then_datarefs);
free_data_refs (else_datarefs);
@@ -2658,7 +2658,7 @@ static void
hoist_adjacent_loads (basic_block bb0, basic_block bb1,
basic_block bb2, basic_block bb3)
{
- int param_align = PARAM_VALUE (PARAM_L1_CACHE_LINE_SIZE);
+ int param_align = param_l1_cache_line_size;
unsigned param_align_bits = (unsigned) (param_align * BITS_PER_UNIT);
gphi_iterator gsi;
@@ -2808,7 +2808,7 @@ static bool
gate_hoist_loads (void)
{
return (flag_hoist_adjacent_loads == 1
- && PARAM_VALUE (PARAM_L1_CACHE_LINE_SIZE)
+ && param_l1_cache_line_size
&& HAVE_conditional_move);
}
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c
index 363dec6f4dd..58a147036af 100644
--- a/gcc/tree-ssa-pre.c
+++ b/gcc/tree-ssa-pre.c
@@ -1156,7 +1156,7 @@ translate_vuse_through_block (vec<vn_reference_op_s> operands,
if (gimple_bb (phi) != phiblock)
return vuse;
- unsigned int cnt = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned int cnt = param_sccvn_max_alias_queries_per_access;
use_oracle = ao_ref_init_from_vn_reference (&ref, set, type, operands);
/* Use the alias-oracle to find either the PHI node in this block,
@@ -2235,7 +2235,7 @@ compute_partial_antic_aux (basic_block block,
bitmap_set_t PA_OUT;
edge e;
edge_iterator ei;
- unsigned long max_pa = PARAM_VALUE (PARAM_MAX_PARTIAL_ANTIC_LENGTH);
+ unsigned long max_pa = param_max_partial_antic_length;
old_PA_IN = PA_OUT = NULL;
diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c
index 510dfd1e188..9e5b5290b55 100644
--- a/gcc/tree-ssa-reassoc.c
+++ b/gcc/tree-ssa-reassoc.c
@@ -4945,7 +4945,7 @@ static int
get_reassociation_width (int ops_num, enum tree_code opc,
machine_mode mode)
{
- int param_width = PARAM_VALUE (PARAM_TREE_REASSOC_WIDTH);
+ int param_width = param_tree_reassoc_width;
int width;
int width_min;
int cycles_best;
diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c
index 7465bedb349..98fbe81fa7b 100644
--- a/gcc/tree-ssa-sccvn.c
+++ b/gcc/tree-ssa-sccvn.c
@@ -3073,7 +3073,7 @@ vn_reference_lookup_pieces (tree vuse, alias_set_type set, tree type,
&& vr1.vuse)
{
ao_ref r;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
vn_walk_cb_data data (&vr1, NULL_TREE, NULL, kind, true);
if (ao_ref_init_from_vn_reference (&r, set, type, vr1.operands))
*vnresult =
@@ -3124,7 +3124,7 @@ vn_reference_lookup (tree op, tree vuse, vn_lookup_kind kind,
{
vn_reference_t wvnresult;
ao_ref r;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
/* Make sure to use a valueized reference if we valueized anything.
Otherwise preserve the full reference for advanced TBAA. */
if (!valuezied_anything
@@ -6984,7 +6984,7 @@ do_rpo_vn (function *fn, edge entry, bitmap exit_bbs,
if (iterate)
{
loop_p loop;
- unsigned max_depth = PARAM_VALUE (PARAM_RPO_VN_MAX_LOOP_DEPTH);
+ unsigned max_depth = param_rpo_vn_max_loop_depth;
FOR_EACH_LOOP (loop, LI_ONLY_INNERMOST)
if (loop_depth (loop) > max_depth)
for (unsigned i = 2;
diff --git a/gcc/tree-ssa-scopedtables.c b/gcc/tree-ssa-scopedtables.c
index 574bc30eee1..9fb2f500f46 100644
--- a/gcc/tree-ssa-scopedtables.c
+++ b/gcc/tree-ssa-scopedtables.c
@@ -292,7 +292,7 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p)
up the virtual use-def chain using walk_non_aliased_vuses.
But don't do this when removing expressions from the hash. */
ao_ref ref;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
if (!(vuse1 && vuse2
&& gimple_assign_single_p (stmt)
&& TREE_CODE (gimple_assign_lhs (stmt)) == SSA_NAME
diff --git a/gcc/tree-ssa-sink.c b/gcc/tree-ssa-sink.c
index 3bfad0f90ed..cbad34b26de 100644
--- a/gcc/tree-ssa-sink.c
+++ b/gcc/tree-ssa-sink.c
@@ -215,7 +215,7 @@ select_best_block (basic_block early_bb,
/* Get the sinking threshold. If the statement to be moved has memory
operands, then increase the threshold by 7% as those are even more
profitable to avoid, clamping at 100%. */
- threshold = PARAM_VALUE (PARAM_SINK_FREQUENCY_THRESHOLD);
+ threshold = param_sink_frequency_threshold;
if (gimple_vuse (stmt) || gimple_vdef (stmt))
{
threshold += 7;
diff --git a/gcc/tree-ssa-strlen.c b/gcc/tree-ssa-strlen.c
index 163be2d67f6..626d7f9dc8a 100644
--- a/gcc/tree-ssa-strlen.c
+++ b/gcc/tree-ssa-strlen.c
@@ -528,7 +528,7 @@ static int
new_stridx (tree exp)
{
int idx;
- if (max_stridx >= PARAM_VALUE (PARAM_MAX_TRACKED_STRLENS))
+ if (max_stridx >= param_max_tracked_strlens)
return 0;
if (TREE_CODE (exp) == SSA_NAME)
{
@@ -557,7 +557,7 @@ static int
new_addr_stridx (tree exp)
{
int *pidx;
- if (max_stridx >= PARAM_VALUE (PARAM_MAX_TRACKED_STRLENS))
+ if (max_stridx >= param_max_tracked_strlens)
return 0;
pidx = addr_stridxptr (exp);
if (pidx != NULL)
@@ -1082,7 +1082,7 @@ get_range_strlen_dynamic (tree src, c_strlen_data *pdata,
bitmap visited = NULL;
tree maxbound = pdata->maxbound;
- unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ unsigned limit = param_ssa_name_def_chain_limit;
if (!get_range_strlen_dynamic (src, pdata, &visited, rvals, &limit))
{
/* On failure extend the length range to an impossible maximum
@@ -3972,7 +3972,7 @@ class ssa_name_limit_t
ssa_name_limit_t ()
: visited (NULL),
- ssa_def_max (PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT)) { }
+ ssa_def_max (param_ssa_name_def_chain_limit) { }
int next_ssa_name (tree);
diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c
index 6e7d4dbc5b3..74edcd4458f 100644
--- a/gcc/tree-ssa-structalias.c
+++ b/gcc/tree-ssa-structalias.c
@@ -5691,9 +5691,9 @@ push_fields_onto_fieldstack (tree type, vec<fieldoff_s> *fieldstack,
return false;
/* If the vector of fields is growing too big, bail out early.
- Callers check for vec::length <= MAX_FIELDS_FOR_FIELD_SENSITIVE, make
+ Callers check for vec::length <= param_max_fields_for_field_sensitive, make
sure this fails. */
- if (fieldstack->length () > MAX_FIELDS_FOR_FIELD_SENSITIVE)
+ if (fieldstack->length () > (unsigned)param_max_fields_for_field_sensitive)
return false;
for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
@@ -6114,7 +6114,7 @@ create_variable_info_for_1 (tree decl, const char *name, bool add_id,
/* If we didn't end up collecting sub-variables create a full
variable for the decl. */
if (fieldstack.length () == 0
- || fieldstack.length () > MAX_FIELDS_FOR_FIELD_SENSITIVE)
+ || fieldstack.length () > (unsigned)param_max_fields_for_field_sensitive)
{
vi = new_var_info (decl, name, add_id);
vi->offset = 0;
@@ -7179,7 +7179,7 @@ init_base_vars (void)
static void
init_alias_vars (void)
{
- use_field_sensitive = (MAX_FIELDS_FOR_FIELD_SENSITIVE > 1);
+ use_field_sensitive = (param_max_fields_for_field_sensitive > 1);
bitmap_obstack_initialize (&pta_obstack);
bitmap_obstack_initialize (&oldpta_obstack);
diff --git a/gcc/tree-ssa-tail-merge.c b/gcc/tree-ssa-tail-merge.c
index cbd5a277b39..ddf7449d945 100644
--- a/gcc/tree-ssa-tail-merge.c
+++ b/gcc/tree-ssa-tail-merge.c
@@ -1469,7 +1469,7 @@ find_clusters_1 (same_succ *same_succ)
unsigned int i, j;
bitmap_iterator bi, bj;
int nr_comparisons;
- int max_comparisons = PARAM_VALUE (PARAM_MAX_TAIL_MERGE_COMPARISONS);
+ int max_comparisons = param_max_tail_merge_comparisons;
EXECUTE_IF_SET_IN_BITMAP (same_succ->bbs, 0, i, bi)
{
@@ -1731,7 +1731,7 @@ tail_merge_optimize (unsigned int todo)
int nr_bbs_removed;
bool loop_entered = false;
int iteration_nr = 0;
- int max_iterations = PARAM_VALUE (PARAM_MAX_TAIL_MERGE_ITERATIONS);
+ int max_iterations = param_max_tail_merge_iterations;
if (!flag_tree_tail_merge
|| max_iterations == 0)
diff --git a/gcc/tree-ssa-threadbackward.c b/gcc/tree-ssa-threadbackward.c
index 1ff870ad00b..6d534647c60 100644
--- a/gcc/tree-ssa-threadbackward.c
+++ b/gcc/tree-ssa-threadbackward.c
@@ -157,7 +157,7 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
return NULL;
if (m_path.length () + 1
- > (unsigned) PARAM_VALUE (PARAM_MAX_FSM_THREAD_LENGTH))
+ > (unsigned) param_max_fsm_thread_length)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "FSM jump-thread path not considered: "
@@ -367,7 +367,7 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
as in PR 78407 this leads to noticeable improvements. */
if (m_speed_p && (optimize_edge_for_speed_p (taken_edge) || contains_hot_bb))
{
- if (n_insns >= PARAM_VALUE (PARAM_MAX_FSM_THREAD_PATH_INSNS))
+ if (n_insns >= param_max_fsm_thread_path_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "FSM jump-thread path not considered: "
@@ -397,9 +397,9 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
optimizer would have done anyway, so an irreducible loop is not
so bad. */
if (!threaded_multiway_branch && *creates_irreducible_loop
- && (n_insns * (unsigned) PARAM_VALUE (PARAM_FSM_SCALE_PATH_STMTS)
+ && (n_insns * (unsigned) param_fsm_scale_path_stmts
> (m_path.length () *
- (unsigned) PARAM_VALUE (PARAM_FSM_SCALE_PATH_BLOCKS))))
+ (unsigned) param_fsm_scale_path_blocks)))
{
if (dump_file && (dump_flags & TDF_DETAILS))
@@ -419,8 +419,8 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
So for that case, drastically reduce the number of statements
we are allowed to copy. */
if (!(threaded_through_latch && threaded_multiway_branch)
- && (n_insns * PARAM_VALUE (PARAM_FSM_SCALE_PATH_STMTS)
- >= PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS)))
+ && (n_insns * param_fsm_scale_path_stmts
+ >= param_max_jump_thread_duplication_stmts))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -683,7 +683,7 @@ thread_jumps::fsm_find_control_statement_thread_paths (tree name)
if (gimple_code (def_stmt) == GIMPLE_PHI
&& (gimple_phi_num_args (def_stmt)
- >= (unsigned) PARAM_VALUE (PARAM_FSM_MAXIMUM_PHI_ARGUMENTS)))
+ >= (unsigned) param_fsm_maximum_phi_arguments))
return;
if (is_gimple_assign (def_stmt)
@@ -771,7 +771,7 @@ thread_jumps::find_jump_threads_backwards (basic_block bb, bool speed_p)
m_visited_bbs.empty ();
m_seen_loop_phi = false;
m_speed_p = speed_p;
- m_max_threaded_paths = PARAM_VALUE (PARAM_MAX_FSM_THREAD_PATHS);
+ m_max_threaded_paths = param_max_fsm_thread_paths;
fsm_find_control_statement_thread_paths (name);
}
diff --git a/gcc/tree-ssa-threadedge.c b/gcc/tree-ssa-threadedge.c
index a5d87662159..c43d7c5c39e 100644
--- a/gcc/tree-ssa-threadedge.c
+++ b/gcc/tree-ssa-threadedge.c
@@ -234,7 +234,7 @@ record_temporary_equivalences_from_stmts_at_dest (edge e,
gimple_stmt_iterator gsi;
int max_stmt_count;
- max_stmt_count = PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS);
+ max_stmt_count = param_max_jump_thread_duplication_stmts;
/* Walk through each statement in the block recording equivalences
we discover. Note any equivalences we discover are context
@@ -275,7 +275,7 @@ record_temporary_equivalences_from_stmts_at_dest (edge e,
killed due to threading, grow the max count
accordingly. */
if (max_stmt_count
- == PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS))
+ == param_max_jump_thread_duplication_stmts)
{
max_stmt_count += estimate_threading_killed_stmts (e->dest);
if (dump_file)
diff --git a/gcc/tree-ssa-uninit.c b/gcc/tree-ssa-uninit.c
index fe8f8f0bc28..ae441067789 100644
--- a/gcc/tree-ssa-uninit.c
+++ b/gcc/tree-ssa-uninit.c
@@ -545,7 +545,7 @@ compute_control_dep_chain (basic_block bb, basic_block dep_bb,
bool found_cd_chain = false;
size_t cur_chain_len = 0;
- if (*num_calls > PARAM_VALUE (PARAM_UNINIT_CONTROL_DEP_ATTEMPTS))
+ if (*num_calls > param_uninit_control_dep_attempts)
return false;
++*num_calls;
diff --git a/gcc/tree-switch-conversion.c b/gcc/tree-switch-conversion.c
index b7149039ae4..166e40c3931 100644
--- a/gcc/tree-switch-conversion.c
+++ b/gcc/tree-switch-conversion.c
@@ -194,7 +194,7 @@ switch_conversion::check_range ()
}
if (tree_to_uhwi (m_range_size)
- > ((unsigned) m_count * SWITCH_CONVERSION_BRANCH_RATIO))
+ > ((unsigned) m_count * param_switch_conversion_branch_ratio))
{
m_reason = "the maximum range-branch ratio exceeded";
return false;
@@ -1268,8 +1268,8 @@ jump_table_cluster::can_be_handled (const vec<cluster *> &clusters,
unsigned HOST_WIDE_INT max_ratio
= (optimize_insn_for_size_p ()
- ? PARAM_VALUE (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SIZE)
- : PARAM_VALUE (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SPEED));
+ ? param_jump_table_max_growth_ratio_for_size
+ : param_jump_table_max_growth_ratio_for_speed);
unsigned HOST_WIDE_INT range = get_range (clusters[start]->get_low (),
clusters[end]->get_high ());
/* Check overflow. */
diff --git a/gcc/tree-switch-conversion.h b/gcc/tree-switch-conversion.h
index 653007f0e17..d37841afb34 100644
--- a/gcc/tree-switch-conversion.h
+++ b/gcc/tree-switch-conversion.h
@@ -476,7 +476,7 @@ case_tree_node::case_tree_node ():
unsigned int
jump_table_cluster::case_values_threshold (void)
{
- unsigned int threshold = PARAM_VALUE (PARAM_CASE_VALUES_THRESHOLD);
+ unsigned int threshold = param_case_values_threshold;
if (threshold == 0)
threshold = targetm.case_values_threshold ();
@@ -683,7 +683,7 @@ is changed into:
b_b = PHI <b_6, b_7>
There are further constraints. Specifically, the range of values across all
-case labels must not be bigger than SWITCH_CONVERSION_BRANCH_RATIO (default
+case labels must not be bigger than param_switch_conversion_branch_ratio (default
eight) times the number of the actual switch branches.
This transformation was contributed by Martin Jambor, see this e-mail:
diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c
index 9dd18d26536..12d8a96b879 100644
--- a/gcc/tree-vect-data-refs.c
+++ b/gcc/tree-vect-data-refs.c
@@ -185,7 +185,7 @@ vect_mark_for_runtime_alias_test (ddr_p ddr, loop_vec_info loop_vinfo)
{
class loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
- if ((unsigned) PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS) == 0)
+ if ((unsigned) param_vect_max_version_for_alias_checks == 0)
return opt_result::failure_at (vect_location,
"will not create alias checks, as"
" --param vect-max-version-for-alias-checks"
@@ -2074,7 +2074,7 @@ vect_enhance_data_refs_alignment (loop_vec_info loop_vinfo)
if (do_peeling)
{
unsigned max_allowed_peel
- = PARAM_VALUE (PARAM_VECT_MAX_PEELING_FOR_ALIGNMENT);
+ = param_vect_max_peeling_for_alignment;
if (flag_vect_cost_model == VECT_COST_MODEL_CHEAP)
max_allowed_peel = 0;
if (max_allowed_peel != (unsigned)-1)
@@ -2215,7 +2215,7 @@ vect_enhance_data_refs_alignment (loop_vec_info loop_vinfo)
if (known_alignment_for_access_p (dr_info)
|| LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo).length ()
- >= (unsigned) PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS))
+ >= (unsigned) param_vect_max_version_for_alignment_checks)
{
do_versioning = false;
break;
@@ -3644,10 +3644,9 @@ vect_prune_runtime_alias_test_list (loop_vec_info loop_vinfo)
dump_printf_loc (MSG_NOTE, vect_location,
"improved number of alias checks from %d to %d\n",
may_alias_ddrs.length (), count);
- unsigned limit = PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS);
+ unsigned limit = param_vect_max_version_for_alias_checks;
if (flag_simd_cost_model == VECT_COST_MODEL_CHEAP)
- limit = default_param_value
- (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS) * 6 / 10;
+ limit = param_vect_max_version_for_alias_checks * 6 / 10;
if (count > limit)
return opt_result::failure_at
(vect_location,
diff --git a/gcc/tree-vect-loop.c b/gcc/tree-vect-loop.c
index 788cc8786ae..d55d0e3158f 100644
--- a/gcc/tree-vect-loop.c
+++ b/gcc/tree-vect-loop.c
@@ -1665,7 +1665,7 @@ vect_analyze_loop_costing (loop_vec_info loop_vinfo)
return -1;
}
- int min_scalar_loop_bound = (PARAM_VALUE (PARAM_MIN_VECT_LOOP_BOUND)
+ int min_scalar_loop_bound = (param_min_vect_loop_bound
* assumed_vf);
/* Use the cost model only if it is more conservative than user specified
@@ -1775,7 +1775,7 @@ vect_get_datarefs_in_loop (loop_p loop, basic_block *bbs,
/* If dependence analysis will give up due to the limit on the
number of datarefs stop here and fail fatally. */
if (datarefs->length ()
- > (unsigned)PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ > (unsigned)param_loop_max_datarefs_for_datadeps)
return opt_result::failure_at (stmt, "exceeded param "
"loop-max-datarefs-for-datadeps\n");
}
@@ -2458,7 +2458,7 @@ vect_analyze_loop (class loop *loop, vec_info_shared *shared)
enabled, this is not a simd loop and it is the innermost loop. */
vect_epilogues = (!loop->simdlen
&& loop->inner == NULL
- && PARAM_VALUE (PARAM_VECT_EPILOGUES_NOMASK)
+ && param_vect_epilogues_nomask
&& LOOP_VINFO_PEELING_FOR_NITER (first_loop_vinfo)
/* For now only allow one epilogue loop. */
&& first_loop_vinfo->epilogue_vinfos.is_empty ());
diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c
index f4b445ac1ef..9d3d991e516 100644
--- a/gcc/tree-vect-slp.c
+++ b/gcc/tree-vect-slp.c
@@ -3289,7 +3289,7 @@ vect_slp_bb (basic_block bb)
gimple_stmt_iterator region_end = gsi;
- if (insns > PARAM_VALUE (PARAM_SLP_MAX_INSNS_IN_BB))
+ if (insns > param_slp_max_insns_in_bb)
{
if (dump_enabled_p ())
dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location,
diff --git a/gcc/tree-vectorizer.h b/gcc/tree-vectorizer.h
index 6b4e92e78af..a8a9c9d497b 100644
--- a/gcc/tree-vectorizer.h
+++ b/gcc/tree-vectorizer.h
@@ -489,7 +489,7 @@ public:
/* Threshold of number of iterations below which vectorization will not be
performed. It is calculated from MIN_PROFITABLE_ITERS and
- PARAM_MIN_VECT_LOOP_BOUND. */
+ param_min_vect_loop_bound. */
unsigned int th;
/* When applying loop versioning, the vector form should only be used
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c
index 9889095fa13..21877c11c65 100644
--- a/gcc/tree-vrp.c
+++ b/gcc/tree-vrp.c
@@ -3395,7 +3395,7 @@ find_switch_asserts (basic_block bb, gswitch *last)
/* Now register along the default label assertions that correspond to the
anti-range of each label. */
- int insertion_limit = PARAM_VALUE (PARAM_MAX_VRP_SWITCH_ASSERTIONS);
+ int insertion_limit = param_max_vrp_switch_assertions;
if (insertion_limit == 0)
return;
@@ -4306,7 +4306,7 @@ vrp_prop::check_mem_ref (location_t location, tree ref,
The loop computes the range of the final offset for expressions such
as (A + i0 + ... + iN)[CSTOFF] where i0 through iN are SSA_NAMEs in
some range. */
- const unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ const unsigned limit = param_ssa_name_def_chain_limit;
for (unsigned n = 0; TREE_CODE (arg) == SSA_NAME && n < limit; ++n)
{
gimple *def = SSA_NAME_DEF_STMT (arg);
diff --git a/gcc/tree.c b/gcc/tree.c
index d08141bcfc2..ecc18b393a4 100644
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -1549,15 +1549,15 @@ wide_int_to_tree_1 (tree type, const wide_int_ref &pcst)
if (TYPE_SIGN (type) == UNSIGNED)
{
/* Cache [0, N). */
- limit = INTEGER_SHARE_LIMIT;
- if (IN_RANGE (hwi, 0, INTEGER_SHARE_LIMIT - 1))
+ limit = param_integer_share_limit;
+ if (IN_RANGE (hwi, 0, param_integer_share_limit - 1))
ix = hwi;
}
else
{
/* Cache [-1, N). */
- limit = INTEGER_SHARE_LIMIT + 1;
- if (IN_RANGE (hwi, -1, INTEGER_SHARE_LIMIT - 1))
+ limit = param_integer_share_limit + 1;
+ if (IN_RANGE (hwi, -1, param_integer_share_limit - 1))
ix = hwi + 1;
}
break;
@@ -1733,23 +1733,23 @@ cache_integer_cst (tree t)
if (TYPE_UNSIGNED (type))
{
/* Cache 0..N */
- limit = INTEGER_SHARE_LIMIT;
+ limit = param_integer_share_limit;
/* This is a little hokie, but if the prec is smaller than
- what is necessary to hold INTEGER_SHARE_LIMIT, then the
+ what is necessary to hold param_integer_share_limit, then the
obvious test will not get the correct answer. */
if (prec < HOST_BITS_PER_WIDE_INT)
{
- if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT) INTEGER_SHARE_LIMIT)
+ if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT) param_integer_share_limit)
ix = tree_to_uhwi (t);
}
- else if (wi::ltu_p (wi::to_wide (t), INTEGER_SHARE_LIMIT))
+ else if (wi::ltu_p (wi::to_wide (t), param_integer_share_limit))
ix = tree_to_uhwi (t);
}
else
{
/* Cache -1..N */
- limit = INTEGER_SHARE_LIMIT + 1;
+ limit = param_integer_share_limit + 1;
if (integer_minus_onep (t))
ix = 0;
@@ -1757,10 +1757,10 @@ cache_integer_cst (tree t)
{
if (prec < HOST_BITS_PER_WIDE_INT)
{
- if (tree_to_shwi (t) < INTEGER_SHARE_LIMIT)
+ if (tree_to_shwi (t) < param_integer_share_limit)
ix = tree_to_shwi (t) + 1;
}
- else if (wi::ltu_p (wi::to_wide (t), INTEGER_SHARE_LIMIT))
+ else if (wi::ltu_p (wi::to_wide (t), param_integer_share_limit))
ix = tree_to_shwi (t) + 1;
}
}
diff --git a/gcc/var-tracking.c b/gcc/var-tracking.c
index 5de36ae2f47..c80a06c92b7 100644
--- a/gcc/var-tracking.c
+++ b/gcc/var-tracking.c
@@ -5844,7 +5844,7 @@ add_uses_1 (rtx *x, void *cui)
compile time for ridiculously complex expressions, although they're
seldom useful, and they may often have to be discarded as not
representable anyway. */
-#define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
+#define EXPR_USE_DEPTH (param_max_vartrack_expr_depth)
/* Attempt to reverse the EXPR operation in the debug info and record
it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
@@ -5904,7 +5904,7 @@ reverse_op (rtx val, const_rtx expr, rtx_insn *insn)
&& (GET_CODE (l->loc) != CONST || !references_value_p (l->loc, 0)))
return;
/* Avoid creating too large locs lists. */
- else if (count == PARAM_VALUE (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE))
+ else if (count == param_max_vartrack_reverse_op_size)
return;
switch (GET_CODE (src))
@@ -7054,7 +7054,7 @@ vt_find_locations (void)
int *rc_order;
int i;
int htabsz = 0;
- int htabmax = PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE);
+ int htabmax = param_max_vartrack_size;
bool success = true;
timevar_push (TV_VAR_TRACKING_DATAFLOW);
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH] Use more SET_OPTION_IF_UNSET.
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (6 preceding siblings ...)
2019-11-07 12:34 ` [PATCH 3/7] Apply mechanical replacement (generated patch) Martin Liska
@ 2019-11-11 14:06 ` Martin Liška
2019-11-12 9:19 ` Richard Biener
2019-11-11 14:50 ` [PATCH 0/7] Param conversion to option machinery Richard Biener
8 siblings, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-11 14:06 UTC (permalink / raw)
To: gcc-patches; +Cc: richard.guenther
[-- Attachment #1: Type: text/plain, Size: 210 bytes --]
There's one more refactoring patch that is about more
usage of SET_OPTION_IF_UNSET for parameters.
Patch can bootstrap on x86_64-linux-gnu and survives regression tests.
Ready to be installed?
Thanks,
Martin
[-- Attachment #2: 0001-Use-more-SET_OPTION_IF_UNSET.patch --]
[-- Type: text/x-patch, Size: 19492 bytes --]
From 638a27f03c7ce06bcc02d7c5d27ba6eb794abede Mon Sep 17 00:00:00 2001
From: Martin Liska <mliska@suse.cz>
Date: Mon, 11 Nov 2019 13:35:55 +0100
Subject: [PATCH] Use more SET_OPTION_IF_UNSET.
gcc/ChangeLog:
2019-11-11 Martin Liska <mliska@suse.cz>
* config/i386/i386-options.c (ix86_recompute_optlev_based_flags):
Use SET_OPTION_IF_UNSET.
(ix86_option_override_internal): Likewise.
* opts.c (default_options_optimization): Likewise.
(finish_options): Likewise.
(enable_fdo_optimizations): Likewise.
(common_handle_option): Likewise.
gcc/c-family/ChangeLog:
2019-11-11 Martin Liska <mliska@suse.cz>
* c-opts.c (c_common_post_options):
Use SET_OPTION_IF_UNSET.
gcc/fortran/ChangeLog:
2019-11-11 Martin Liska <mliska@suse.cz>
* options.c (gfc_init_options):
Use SET_OPTION_IF_UNSET.
gcc/go/ChangeLog:
2019-11-11 Martin Liska <mliska@suse.cz>
* go-lang.c (go_langhook_post_options):
Use SET_OPTION_IF_UNSET.
---
gcc/c-family/c-opts.c | 34 ++++-----
gcc/config/i386/i386-options.c | 34 +++++----
gcc/fortran/options.c | 4 +-
gcc/go/go-lang.c | 20 +++---
gcc/opts.c | 123 +++++++++++++--------------------
5 files changed, 94 insertions(+), 121 deletions(-)
diff --git a/gcc/c-family/c-opts.c b/gcc/c-family/c-opts.c
index 75b69597be2..c913291c07c 100644
--- a/gcc/c-family/c-opts.c
+++ b/gcc/c-family/c-opts.c
@@ -828,9 +828,9 @@ c_common_post_options (const char **pfilename)
/* C2X Annex F does not permit certain built-in functions to raise
"inexact". */
- if (flag_isoc2x
- && !global_options_set.x_flag_fp_int_builtin_inexact)
- flag_fp_int_builtin_inexact = 0;
+ if (flag_isoc2x)
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_fp_int_builtin_inexact, 0);
/* By default we use C99 inline semantics in GNU99 or C99 mode. C99
inline semantics are not supported in GNU89 or C89 mode. */
@@ -847,9 +847,9 @@ c_common_post_options (const char **pfilename)
/* If -ffreestanding, -fno-hosted or -fno-builtin then disable
pattern recognition. */
- if (!global_options_set.x_flag_tree_loop_distribute_patterns
- && flag_no_builtin)
- flag_tree_loop_distribute_patterns = 0;
+ if (flag_no_builtin)
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_tree_loop_distribute_patterns, 0);
/* -Woverlength-strings is off by default, but is enabled by -Wpedantic.
It is never enabled in C++, as the minimum limit is not normative
@@ -918,16 +918,17 @@ c_common_post_options (const char **pfilename)
&& (cxx_dialect >= cxx11 || flag_isoc99));
/* -Wregister is enabled by default in C++17. */
- if (!global_options_set.x_warn_register)
- warn_register = cxx_dialect >= cxx17;
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set, warn_register,
+ cxx_dialect >= cxx17);
/* -Wcomma-subscript is enabled by default in C++20. */
- if (!global_options_set.x_warn_comma_subscript)
- warn_comma_subscript = (cxx_dialect >= cxx2a && warn_deprecated);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ warn_comma_subscript,
+ cxx_dialect >= cxx2a && warn_deprecated);
/* -Wvolatile is enabled by default in C++20. */
- if (!global_options_set.x_warn_volatile)
- warn_volatile = (cxx_dialect >= cxx2a && warn_deprecated);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set, warn_volatile,
+ cxx_dialect >= cxx2a && warn_deprecated);
/* Declone C++ 'structors if -Os. */
if (flag_declone_ctor_dtor == -1)
@@ -979,12 +980,13 @@ c_common_post_options (const char **pfilename)
/* By default, enable the new inheriting constructor semantics along with ABI
11. New and old should coexist fine, but it is a change in what
artificial symbols are generated. */
- if (!global_options_set.x_flag_new_inheriting_ctors)
- flag_new_inheriting_ctors = abi_version_at_least (11);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_new_inheriting_ctors,
+ abi_version_at_least (11));
/* For GCC 7, only enable DR150 resolution by default if -std=c++17. */
- if (!global_options_set.x_flag_new_ttp)
- flag_new_ttp = (cxx_dialect >= cxx17);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set, flag_new_ttp,
+ cxx_dialect >= cxx17);
if (cxx_dialect >= cxx11)
{
diff --git a/gcc/config/i386/i386-options.c b/gcc/config/i386/i386-options.c
index c909f8ea1ed..b082228ebf2 100644
--- a/gcc/config/i386/i386-options.c
+++ b/gcc/config/i386/i386-options.c
@@ -1605,12 +1605,12 @@ ix86_recompute_optlev_based_flags (struct gcc_options *opts,
in case they weren't overwritten by command line options. */
if (TARGET_64BIT_P (opts->x_ix86_isa_flags))
{
- if (opts->x_optimize >= 1 && !opts_set->x_flag_omit_frame_pointer)
- opts->x_flag_omit_frame_pointer = !USE_IX86_FRAME_POINTER;
+ if (opts->x_optimize >= 1)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_omit_frame_pointer,
+ !USE_IX86_FRAME_POINTER);
if (opts->x_flag_asynchronous_unwind_tables
- && !opts_set->x_flag_unwind_tables
&& TARGET_64BIT_MS_ABI)
- opts->x_flag_unwind_tables = 1;
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_unwind_tables, 1);
if (opts->x_flag_asynchronous_unwind_tables == 2)
opts->x_flag_unwind_tables
= opts->x_flag_asynchronous_unwind_tables = 1;
@@ -1619,9 +1619,9 @@ ix86_recompute_optlev_based_flags (struct gcc_options *opts,
}
else
{
- if (opts->x_optimize >= 1 && !opts_set->x_flag_omit_frame_pointer)
- opts->x_flag_omit_frame_pointer
- = !(USE_IX86_FRAME_POINTER || opts->x_optimize_size);
+ if (opts->x_optimize >= 1)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_omit_frame_pointer,
+ !(USE_IX86_FRAME_POINTER || opts->x_optimize_size));
if (opts->x_flag_asynchronous_unwind_tables == 2)
opts->x_flag_asynchronous_unwind_tables = !USE_IX86_FRAME_POINTER;
if (opts->x_flag_pcc_struct_return == 2)
@@ -1821,8 +1821,7 @@ ix86_option_override_internal (bool main_args_p,
opts->x_ix86_pmode = TARGET_LP64_P (opts->x_ix86_isa_flags)
? PMODE_DI : PMODE_SI;
- if (!opts_set->x_ix86_abi)
- opts->x_ix86_abi = DEFAULT_ABI;
+ SET_OPTION_IF_UNSET (opts, opts_set, ix86_abi, DEFAULT_ABI);
if (opts->x_ix86_abi == MS_ABI && TARGET_X32_P (opts->x_ix86_isa_flags))
error ("%<-mabi=ms%> not supported with X32 ABI");
@@ -1843,8 +1842,8 @@ ix86_option_override_internal (bool main_args_p,
/* For targets using ms ABI enable ms-extensions, if not
explicit turned off. For non-ms ABI we turn off this
option. */
- if (!opts_set->x_flag_ms_extensions)
- opts->x_flag_ms_extensions = (MS_ABI == DEFAULT_ABI);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ms_extensions,
+ (MS_ABI == DEFAULT_ABI));
if (opts_set->x_ix86_cmodel)
{
@@ -2367,8 +2366,8 @@ ix86_option_override_internal (bool main_args_p,
ix86_default_align (opts);
/* Provide default for -mbranch-cost= value. */
- if (!opts_set->x_ix86_branch_cost)
- opts->x_ix86_branch_cost = ix86_tune_cost->branch_cost;
+ SET_OPTION_IF_UNSET (opts, opts_set, ix86_branch_cost,
+ ix86_tune_cost->branch_cost);
if (TARGET_64BIT_P (opts->x_ix86_isa_flags))
{
@@ -2474,8 +2473,8 @@ ix86_option_override_internal (bool main_args_p,
}
/* Set the default value for -mstackrealign. */
- if (!opts_set->x_ix86_force_align_arg_pointer)
- opts->x_ix86_force_align_arg_pointer = STACK_REALIGN_DEFAULT;
+ SET_OPTION_IF_UNSET (opts, opts_set, ix86_force_align_arg_pointer,
+ STACK_REALIGN_DEFAULT);
ix86_default_incoming_stack_boundary = PREFERRED_STACK_BOUNDARY;
@@ -2863,9 +2862,8 @@ ix86_option_override_internal (bool main_args_p,
/* PR86952: jump table usage with retpolines is slow.
The PR provides some numbers about the slowness. */
- if (ix86_indirect_branch != indirect_branch_keep
- && !opts_set->x_flag_jump_tables)
- opts->x_flag_jump_tables = 0;
+ if (ix86_indirect_branch != indirect_branch_keep)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_jump_tables, 0);
return true;
}
diff --git a/gcc/fortran/options.c b/gcc/fortran/options.c
index 305c57de85d..f7a5299c5e3 100644
--- a/gcc/fortran/options.c
+++ b/gcc/fortran/options.c
@@ -162,8 +162,8 @@ gfc_init_options (unsigned int decoded_options_count,
/* ??? Wmissing-include-dirs is disabled by default in C/C++ but
enabled by default in Fortran. Ideally, we should express this
in .opt, but that is not supported yet. */
- if (!global_options_set.x_cpp_warn_missing_include_dirs)
- global_options.x_cpp_warn_missing_include_dirs = 1;
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ cpp_warn_missing_include_dirs, 1);
set_dec_flags (0);
diff --git a/gcc/go/go-lang.c b/gcc/go/go-lang.c
index 75d98933820..8766372b172 100644
--- a/gcc/go/go-lang.c
+++ b/gcc/go/go-lang.c
@@ -297,13 +297,13 @@ go_langhook_post_options (const char **pfilename ATTRIBUTE_UNUSED)
flag_excess_precision = EXCESS_PRECISION_STANDARD;
/* Tail call optimizations can confuse uses of runtime.Callers. */
- if (!global_options_set.x_flag_optimize_sibling_calls)
- global_options.x_flag_optimize_sibling_calls = 0;
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_optimize_sibling_calls, 0);
/* Partial inlining can confuses uses of runtime.Callers.
See https://gcc.gnu.org/PR91663. */
- if (!global_options_set.x_flag_partial_inlining)
- global_options.x_flag_partial_inlining = 0;
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_partial_inlining, 0);
/* If the debug info level is still 1, as set in init_options, make
sure that some debugging type is selected. */
@@ -312,18 +312,18 @@ go_langhook_post_options (const char **pfilename ATTRIBUTE_UNUSED)
global_options.x_write_symbols = PREFERRED_DEBUGGING_TYPE;
/* We turn on stack splitting if we can. */
- if (!global_options_set.x_flag_split_stack
- && targetm_common.supports_split_stack (false, &global_options))
- global_options.x_flag_split_stack = 1;
+ if (targetm_common.supports_split_stack (false, &global_options))
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_split_stack, 1);
/* If stack splitting is turned on, and the user did not explicitly
request function partitioning, turn off partitioning, as it
confuses the linker when trying to handle partitioned split-stack
code that calls a non-split-stack function. */
if (global_options.x_flag_split_stack
- && global_options.x_flag_reorder_blocks_and_partition
- && !global_options_set.x_flag_reorder_blocks_and_partition)
- global_options.x_flag_reorder_blocks_and_partition = 0;
+ && global_options.x_flag_reorder_blocks_and_partition)
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ flag_reorder_blocks_and_partition, 0);
/* Returning false means that the backend should be used. */
return false;
diff --git a/gcc/opts.c b/gcc/opts.c
index 879b2100071..faf2eef082e 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -641,9 +641,8 @@ default_options_optimization (struct gcc_options *opts,
/* -O2 param settings. */
opt2 = (opts->x_optimize >= 2);
- if (openacc_mode
- && !opts_set->x_flag_ipa_pta)
- opts->x_flag_ipa_pta = true;
+ if (openacc_mode)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_pta, true);
/* Track fields in field-sensitive alias analysis. */
if (opt2)
@@ -1064,13 +1063,11 @@ finish_options (struct gcc_options *opts, struct gcc_options *opts_set,
code that calls a non-split-stack functions. But if partitioning
was turned on explicitly just hope for the best. */
if (opts->x_flag_split_stack
- && opts->x_flag_reorder_blocks_and_partition
- && !opts_set->x_flag_reorder_blocks_and_partition)
- opts->x_flag_reorder_blocks_and_partition = 0;
+ && opts->x_flag_reorder_blocks_and_partition)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_reorder_blocks_and_partition, 0);
- if (opts->x_flag_reorder_blocks_and_partition
- && !opts_set->x_flag_reorder_functions)
- opts->x_flag_reorder_functions = 1;
+ if (opts->x_flag_reorder_blocks_and_partition)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_reorder_functions, 1);
/* The -gsplit-dwarf option requires -ggnu-pubnames. */
if (opts->x_dwarf_split_debug_info)
@@ -1127,9 +1124,9 @@ finish_options (struct gcc_options *opts, struct gcc_options *opts_set,
/* Enable -fsanitize-address-use-after-scope if address sanitizer is
enabled. */
- if ((opts->x_flag_sanitize & SANITIZE_USER_ADDRESS)
- && !opts_set->x_flag_sanitize_address_use_after_scope)
- opts->x_flag_sanitize_address_use_after_scope = true;
+ if (opts->x_flag_sanitize & SANITIZE_USER_ADDRESS)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_sanitize_address_use_after_scope,
+ true);
/* Force -fstack-reuse=none in case -fsanitize-address-use-after-scope
is enabled. */
@@ -1670,52 +1667,34 @@ enable_fdo_optimizations (struct gcc_options *opts,
struct gcc_options *opts_set,
int value)
{
- if (!opts_set->x_flag_branch_probabilities)
- opts->x_flag_branch_probabilities = value;
- if (!opts_set->x_flag_profile_values)
- opts->x_flag_profile_values = value;
- if (!opts_set->x_flag_unroll_loops)
- opts->x_flag_unroll_loops = value;
- if (!opts_set->x_flag_peel_loops)
- opts->x_flag_peel_loops = value;
- if (!opts_set->x_flag_tracer)
- opts->x_flag_tracer = value;
- if (!opts_set->x_flag_value_profile_transformations)
- opts->x_flag_value_profile_transformations = value;
- if (!opts_set->x_flag_inline_functions)
- opts->x_flag_inline_functions = value;
- if (!opts_set->x_flag_ipa_cp)
- opts->x_flag_ipa_cp = value;
- if (!opts_set->x_flag_ipa_cp_clone
- && value && opts->x_flag_ipa_cp)
- opts->x_flag_ipa_cp_clone = value;
- if (!opts_set->x_flag_ipa_bit_cp
- && value && opts->x_flag_ipa_cp)
- opts->x_flag_ipa_bit_cp = value;
- if (!opts_set->x_flag_predictive_commoning)
- opts->x_flag_predictive_commoning = value;
- if (!opts_set->x_flag_split_loops)
- opts->x_flag_split_loops = value;
- if (!opts_set->x_flag_unswitch_loops)
- opts->x_flag_unswitch_loops = value;
- if (!opts_set->x_flag_gcse_after_reload)
- opts->x_flag_gcse_after_reload = value;
- if (!opts_set->x_flag_tree_loop_vectorize)
- opts->x_flag_tree_loop_vectorize = value;
- if (!opts_set->x_flag_tree_slp_vectorize)
- opts->x_flag_tree_slp_vectorize = value;
- if (!opts_set->x_flag_version_loops_for_strides)
- opts->x_flag_version_loops_for_strides = value;
- if (!opts_set->x_flag_vect_cost_model)
- opts->x_flag_vect_cost_model = VECT_COST_MODEL_DYNAMIC;
- if (!opts_set->x_flag_tree_loop_distribute_patterns)
- opts->x_flag_tree_loop_distribute_patterns = value;
- if (!opts_set->x_flag_loop_interchange)
- opts->x_flag_loop_interchange = value;
- if (!opts_set->x_flag_unroll_jam)
- opts->x_flag_unroll_jam = value;
- if (!opts_set->x_flag_tree_loop_distribution)
- opts->x_flag_tree_loop_distribution = value;
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_branch_probabilities, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_profile_values, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_unroll_loops, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_peel_loops, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_tracer, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_value_profile_transformations,
+ value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_inline_functions, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_cp, value);
+ if (value)
+ {
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_cp_clone, 1);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_bit_cp, 1);
+ }
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_predictive_commoning, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_split_loops, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_unswitch_loops, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_gcse_after_reload, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_tree_loop_vectorize, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_tree_slp_vectorize, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_version_loops_for_strides, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_vect_cost_model,
+ VECT_COST_MODEL_DYNAMIC);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_tree_loop_distribute_patterns,
+ value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_loop_interchange, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_unroll_jam, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_tree_loop_distribution, value);
}
/* -f{,no-}sanitize{,-recover}= suboptions. */
@@ -2531,13 +2510,13 @@ common_handle_option (struct gcc_options *opts,
/* FALLTHRU */
case OPT_fprofile_use:
enable_fdo_optimizations (opts, opts_set, value);
- if (!opts_set->x_flag_profile_reorder_functions)
- opts->x_flag_profile_reorder_functions = value;
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_profile_reorder_functions,
+ value);
/* Indirect call profiling should do all useful transformations
speculative devirtualization does. */
- if (!opts_set->x_flag_devirtualize_speculatively
- && opts->x_flag_value_profile_transformations)
- opts->x_flag_devirtualize_speculatively = false;
+ if (opts->x_flag_value_profile_transformations)
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_devirtualize_speculatively,
+ false);
break;
case OPT_fauto_profile_:
@@ -2548,8 +2527,7 @@ common_handle_option (struct gcc_options *opts,
/* FALLTHRU */
case OPT_fauto_profile:
enable_fdo_optimizations (opts, opts_set, value);
- if (!opts_set->x_flag_profile_correction)
- opts->x_flag_profile_correction = value;
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_profile_correction, value);
SET_OPTION_IF_UNSET (opts, opts_set,
param_early_inliner_max_iterations, 10);
break;
@@ -2560,19 +2538,14 @@ common_handle_option (struct gcc_options *opts,
/* No break here - do -fprofile-generate processing. */
/* FALLTHRU */
case OPT_fprofile_generate:
- if (!opts_set->x_profile_arc_flag)
- opts->x_profile_arc_flag = value;
- if (!opts_set->x_flag_profile_values)
- opts->x_flag_profile_values = value;
- if (!opts_set->x_flag_inline_functions)
- opts->x_flag_inline_functions = value;
- if (!opts_set->x_flag_ipa_bit_cp)
- opts->x_flag_ipa_bit_cp = value;
+ SET_OPTION_IF_UNSET (opts, opts_set, profile_arc_flag, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_profile_values, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_inline_functions, value);
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_bit_cp, value);
/* FIXME: Instrumentation we insert makes ipa-reference bitmaps
quadratic. Disable the pass until better memory representation
is done. */
- if (!opts_set->x_flag_ipa_reference)
- opts->x_flag_ipa_reference = false;
+ SET_OPTION_IF_UNSET (opts, opts_set, flag_ipa_reference, false);
break;
case OPT_fpatchable_function_entry_:
--
2.24.0
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 3/7] Apply mechanical replacement (generated patch).
2019-11-07 12:34 ` [PATCH 3/7] Apply mechanical replacement (generated patch) Martin Liska
@ 2019-11-11 14:39 ` Richard Biener
2019-11-12 9:20 ` Martin Liška
2019-11-12 9:22 ` [PATCH 8/9] Remove option_default_params and option_validate_param hooks Martin Liška
0 siblings, 2 replies; 29+ messages in thread
From: Richard Biener @ 2019-11-11 14:39 UTC (permalink / raw)
To: Martin Liska; +Cc: GCC Patches
On Thu, Nov 7, 2019 at 1:35 PM Martin Liska <mliska@suse.cz> wrote:
>
>
> gcc/ChangeLog:
I think I've noticed at least one long line (please double-check):
- if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
INTEGER_SHARE_LIMIT)
+ if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
param_integer_share_limit)
as a followup I notice that the targets *_default_params () functions should
be merged into the default-options structs they have (did you check the
defaults are still applied and user-overridable?)
> 2019-11-07 Martin Liska <mliska@suse.cz>
>
> * asan.c (asan_sanitize_stack_p): Replace old parameter syntax
> with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
> macro.
> (asan_sanitize_allocas_p): Likewise.
> (asan_emit_stack_protection): Likewise.
> (asan_protect_global): Likewise.
> (instrument_derefs): Likewise.
> (instrument_builtin_call): Likewise.
> (asan_expand_mark_ifn): Likewise.
> * auto-profile.c (auto_profile): Likewise.
> * bb-reorder.c (copy_bb_p): Likewise.
> (duplicate_computed_gotos): Likewise.
> * builtins.c (inline_expand_builtin_string_cmp): Likewise.
> * cfgcleanup.c (try_crossjump_to_edge): Likewise.
> (try_crossjump_bb): Likewise.
> * cfgexpand.c (defer_stack_allocation): Likewise.
> (stack_protect_classify_type): Likewise.
> (pass_expand::execute): Likewise.
> * cfgloopanal.c (expected_loop_iterations_unbounded): Likewise.
> (estimate_reg_pressure_cost): Likewise.
> * cgraph.c (cgraph_edge::maybe_hot_p): Likewise.
> * combine.c (combine_instructions): Likewise.
> (record_value_for_reg): Likewise.
> * common/config/aarch64/aarch64-common.c (aarch64_option_validate_param): Likewise.
> (aarch64_option_default_params): Likewise.
> * common/config/ia64/ia64-common.c (ia64_option_default_params): Likewise.
> * common/config/powerpcspe/powerpcspe-common.c (rs6000_option_default_params): Likewise.
> * common/config/rs6000/rs6000-common.c (rs6000_option_default_params): Likewise.
> * common/config/sh/sh-common.c (sh_option_default_params): Likewise.
> * config/aarch64/aarch64.c (aarch64_output_probe_stack_range): Likewise.
> (aarch64_allocate_and_probe_stack_space): Likewise.
> (aarch64_expand_epilogue): Likewise.
> (aarch64_override_options_internal): Likewise.
> * config/alpha/alpha.c (alpha_option_override): Likewise.
> * config/arm/arm.c (arm_option_override): Likewise.
> (arm_valid_target_attribute_p): Likewise.
> * config/i386/i386-options.c (ix86_option_override_internal): Likewise.
> * config/i386/i386.c (get_probe_interval): Likewise.
> (ix86_adjust_stack_and_probe_stack_clash): Likewise.
> (ix86_max_noce_ifcvt_seq_cost): Likewise.
> * config/ia64/ia64.c (ia64_adjust_cost): Likewise.
> * config/rs6000/rs6000-logue.c (get_stack_clash_protection_probe_interval): Likewise.
> (get_stack_clash_protection_guard_size): Likewise.
> * config/rs6000/rs6000.c (rs6000_option_override_internal): Likewise.
> * config/s390/s390.c (allocate_stack_space): Likewise.
> (s390_emit_prologue): Likewise.
> (s390_option_override_internal): Likewise.
> * config/sparc/sparc.c (sparc_option_override): Likewise.
> * config/visium/visium.c (visium_option_override): Likewise.
> * coverage.c (get_coverage_counts): Likewise.
> (coverage_compute_profile_id): Likewise.
> (coverage_begin_function): Likewise.
> (coverage_end_function): Likewise.
> * cse.c (cse_find_path): Likewise.
> (cse_extended_basic_block): Likewise.
> (cse_main): Likewise.
> * cselib.c (cselib_invalidate_mem): Likewise.
> * dse.c (dse_step1): Likewise.
> * emit-rtl.c (set_new_first_and_last_insn): Likewise.
> (get_max_insn_count): Likewise.
> (make_debug_insn_raw): Likewise.
> (init_emit): Likewise.
> * explow.c (compute_stack_clash_protection_loop_data): Likewise.
> * final.c (compute_alignments): Likewise.
> * fold-const.c (fold_range_test): Likewise.
> (fold_truth_andor): Likewise.
> (tree_single_nonnegative_warnv_p): Likewise.
> (integer_valued_real_single_p): Likewise.
> * gcse.c (want_to_gcse_p): Likewise.
> (prune_insertions_deletions): Likewise.
> (hoist_code): Likewise.
> (gcse_or_cprop_is_too_expensive): Likewise.
> * ggc-common.c: Likewise.
> * ggc-page.c (ggc_collect): Likewise.
> * gimple-loop-interchange.cc (MAX_NUM_STMT): Likewise.
> (MAX_DATAREFS): Likewise.
> (OUTER_STRIDE_RATIO): Likewise.
> * gimple-loop-jam.c (tree_loop_unroll_and_jam): Likewise.
> * gimple-loop-versioning.cc (loop_versioning::max_insns_for_loop): Likewise.
> * gimple-ssa-split-paths.c (is_feasible_trace): Likewise.
> * gimple-ssa-store-merging.c (imm_store_chain_info::try_coalesce_bswap): Likewise.
> (imm_store_chain_info::coalesce_immediate_stores): Likewise.
> (imm_store_chain_info::output_merged_store): Likewise.
> (pass_store_merging::process_store): Likewise.
> * gimple-ssa-strength-reduction.c (find_basis_for_base_expr): Likewise.
> * graphite-isl-ast-to-gimple.c (class translate_isl_ast_to_gimple): Likewise.
> (scop_to_isl_ast): Likewise.
> * graphite-optimize-isl.c (get_schedule_for_node_st): Likewise.
> (optimize_isl): Likewise.
> * graphite-scop-detection.c (build_scops): Likewise.
> * haifa-sched.c (set_modulo_params): Likewise.
> (rank_for_schedule): Likewise.
> (model_add_to_worklist): Likewise.
> (model_promote_insn): Likewise.
> (model_choose_insn): Likewise.
> (queue_to_ready): Likewise.
> (autopref_multipass_dfa_lookahead_guard): Likewise.
> (schedule_block): Likewise.
> (sched_init): Likewise.
> * hsa-gen.c (init_prologue): Likewise.
> * ifcvt.c (bb_ok_for_noce_convert_multiple_sets): Likewise.
> (cond_move_process_if_block): Likewise.
> * ipa-cp.c (ipcp_lattice::add_value): Likewise.
> (merge_agg_lats_step): Likewise.
> (devirtualization_time_bonus): Likewise.
> (hint_time_bonus): Likewise.
> (incorporate_penalties): Likewise.
> (good_cloning_opportunity_p): Likewise.
> (ipcp_propagate_stage): Likewise.
> * ipa-fnsummary.c (decompose_param_expr): Likewise.
> (set_switch_stmt_execution_predicate): Likewise.
> (analyze_function_body): Likewise.
> (compute_fn_summary): Likewise.
> * ipa-inline-analysis.c (estimate_growth): Likewise.
> * ipa-inline.c (caller_growth_limits): Likewise.
> (inline_insns_single): Likewise.
> (inline_insns_auto): Likewise.
> (can_inline_edge_by_limits_p): Likewise.
> (want_early_inline_function_p): Likewise.
> (big_speedup_p): Likewise.
> (want_inline_small_function_p): Likewise.
> (want_inline_self_recursive_call_p): Likewise.
> (edge_badness): Likewise.
> (recursive_inlining): Likewise.
> (compute_max_insns): Likewise.
> (early_inliner): Likewise.
> * ipa-polymorphic-call.c (csftc_abort_walking_p): Likewise.
> * ipa-profile.c (ipa_profile): Likewise.
> * ipa-prop.c (determine_known_aggregate_parts): Likewise.
> (ipa_analyze_node): Likewise.
> (ipcp_transform_function): Likewise.
> * ipa-split.c (consider_split): Likewise.
> * ipa-sra.c (allocate_access): Likewise.
> (process_scan_results): Likewise.
> (ipa_sra_summarize_function): Likewise.
> (pull_accesses_from_callee): Likewise.
> * ira-build.c (loop_compare_func): Likewise.
> (mark_loops_for_removal): Likewise.
> * ira-conflicts.c (build_conflict_bit_table): Likewise.
> * loop-doloop.c (doloop_optimize): Likewise.
> * loop-invariant.c (gain_for_invariant): Likewise.
> (move_loop_invariants): Likewise.
> * loop-unroll.c (decide_unroll_constant_iterations): Likewise.
> (decide_unroll_runtime_iterations): Likewise.
> (decide_unroll_stupid): Likewise.
> (expand_var_during_unrolling): Likewise.
> * lra-assigns.c (spill_for): Likewise.
> * lra-constraints.c (EBB_PROBABILITY_CUTOFF): Likewise.
> * modulo-sched.c (sms_schedule): Likewise.
> (DFA_HISTORY): Likewise.
> * opts.c (default_options_optimization): Likewise.
> (finish_options): Likewise.
> (common_handle_option): Likewise.
> * postreload-gcse.c (eliminate_partially_redundant_load): Likewise.
> (if): Likewise.
> * predict.c (get_hot_bb_threshold): Likewise.
> (maybe_hot_count_p): Likewise.
> (probably_never_executed): Likewise.
> (predictable_edge_p): Likewise.
> (predict_loops): Likewise.
> (expr_expected_value_1): Likewise.
> (tree_predict_by_opcode): Likewise.
> (handle_missing_profiles): Likewise.
> * reload.c (find_equiv_reg): Likewise.
> * reorg.c (redundant_insn): Likewise.
> * resource.c (mark_target_live_regs): Likewise.
> (incr_ticks_for_insn): Likewise.
> * sanopt.c (pass_sanopt::execute): Likewise.
> * sched-deps.c (sched_analyze_1): Likewise.
> (sched_analyze_2): Likewise.
> (sched_analyze_insn): Likewise.
> (deps_analyze_insn): Likewise.
> * sched-ebb.c (schedule_ebbs): Likewise.
> * sched-rgn.c (find_single_block_region): Likewise.
> (too_large): Likewise.
> (haifa_find_rgns): Likewise.
> (extend_rgns): Likewise.
> (new_ready): Likewise.
> (schedule_region): Likewise.
> (sched_rgn_init): Likewise.
> * sel-sched-ir.c (make_region_from_loop): Likewise.
> * sel-sched-ir.h (MAX_WS): Likewise.
> * sel-sched.c (process_pipelined_exprs): Likewise.
> (sel_setup_region_sched_flags): Likewise.
> * shrink-wrap.c (try_shrink_wrapping): Likewise.
> * targhooks.c (default_max_noce_ifcvt_seq_cost): Likewise.
> * toplev.c (print_version): Likewise.
> (process_options): Likewise.
> * tracer.c (tail_duplicate): Likewise.
> * trans-mem.c (tm_log_add): Likewise.
> * tree-chrec.c (chrec_fold_plus_1): Likewise.
> * tree-data-ref.c (split_constant_offset): Likewise.
> (compute_all_dependences): Likewise.
> * tree-if-conv.c (MAX_PHI_ARG_NUM): Likewise.
> * tree-inline.c (remap_gimple_stmt): Likewise.
> * tree-loop-distribution.c (MAX_DATAREFS_NUM): Likewise.
> * tree-parloops.c (MIN_PER_THREAD): Likewise.
> (create_parallel_loop): Likewise.
> * tree-predcom.c (determine_unroll_factor): Likewise.
> * tree-scalar-evolution.c (instantiate_scev_r): Likewise.
> * tree-sra.c (analyze_all_variable_accesses): Likewise.
> * tree-ssa-ccp.c (fold_builtin_alloca_with_align): Likewise.
> * tree-ssa-dse.c (setup_live_bytes_from_ref): Likewise.
> (dse_optimize_redundant_stores): Likewise.
> (dse_classify_store): Likewise.
> * tree-ssa-ifcombine.c (ifcombine_ifandif): Likewise.
> * tree-ssa-loop-ch.c (ch_base::copy_headers): Likewise.
> * tree-ssa-loop-im.c (LIM_EXPENSIVE): Likewise.
> * tree-ssa-loop-ivcanon.c (try_unroll_loop_completely): Likewise.
> (try_peel_loop): Likewise.
> (tree_unroll_loops_completely): Likewise.
> * tree-ssa-loop-ivopts.c (avg_loop_niter): Likewise.
> (CONSIDER_ALL_CANDIDATES_BOUND): Likewise.
> (MAX_CONSIDERED_GROUPS): Likewise.
> (ALWAYS_PRUNE_CAND_SET_BOUND): Likewise.
> * tree-ssa-loop-manip.c (can_unroll_loop_p): Likewise.
> * tree-ssa-loop-niter.c (MAX_ITERATIONS_TO_TRACK): Likewise.
> * tree-ssa-loop-prefetch.c (PREFETCH_BLOCK): Likewise.
> (L1_CACHE_SIZE_BYTES): Likewise.
> (L2_CACHE_SIZE_BYTES): Likewise.
> (should_issue_prefetch_p): Likewise.
> (schedule_prefetches): Likewise.
> (determine_unroll_factor): Likewise.
> (volume_of_references): Likewise.
> (add_subscript_strides): Likewise.
> (self_reuse_distance): Likewise.
> (mem_ref_count_reasonable_p): Likewise.
> (insn_to_prefetch_ratio_too_small_p): Likewise.
> (loop_prefetch_arrays): Likewise.
> (tree_ssa_prefetch_arrays): Likewise.
> * tree-ssa-loop-unswitch.c (tree_unswitch_single_loop): Likewise.
> * tree-ssa-math-opts.c (gimple_expand_builtin_pow): Likewise.
> (convert_mult_to_fma): Likewise.
> (math_opts_dom_walker::after_dom_children): Likewise.
> * tree-ssa-phiopt.c (cond_if_else_store_replacement): Likewise.
> (hoist_adjacent_loads): Likewise.
> (gate_hoist_loads): Likewise.
> * tree-ssa-pre.c (translate_vuse_through_block): Likewise.
> (compute_partial_antic_aux): Likewise.
> * tree-ssa-reassoc.c (get_reassociation_width): Likewise.
> * tree-ssa-sccvn.c (vn_reference_lookup_pieces): Likewise.
> (vn_reference_lookup): Likewise.
> (do_rpo_vn): Likewise.
> * tree-ssa-scopedtables.c (avail_exprs_stack::lookup_avail_expr): Likewise.
> * tree-ssa-sink.c (select_best_block): Likewise.
> * tree-ssa-strlen.c (new_stridx): Likewise.
> (new_addr_stridx): Likewise.
> (get_range_strlen_dynamic): Likewise.
> (class ssa_name_limit_t): Likewise.
> * tree-ssa-structalias.c (push_fields_onto_fieldstack): Likewise.
> (create_variable_info_for_1): Likewise.
> (init_alias_vars): Likewise.
> * tree-ssa-tail-merge.c (find_clusters_1): Likewise.
> (tail_merge_optimize): Likewise.
> * tree-ssa-threadbackward.c (thread_jumps::profitable_jump_thread_path): Likewise.
> (thread_jumps::fsm_find_control_statement_thread_paths): Likewise.
> (thread_jumps::find_jump_threads_backwards): Likewise.
> * tree-ssa-threadedge.c (record_temporary_equivalences_from_stmts_at_dest): Likewise.
> * tree-ssa-uninit.c (compute_control_dep_chain): Likewise.
> * tree-switch-conversion.c (switch_conversion::check_range): Likewise.
> (jump_table_cluster::can_be_handled): Likewise.
> * tree-switch-conversion.h (jump_table_cluster::case_values_threshold): Likewise.
> (SWITCH_CONVERSION_BRANCH_RATIO): Likewise.
> (param_switch_conversion_branch_ratio): Likewise.
> * tree-vect-data-refs.c (vect_mark_for_runtime_alias_test): Likewise.
> (vect_enhance_data_refs_alignment): Likewise.
> (vect_prune_runtime_alias_test_list): Likewise.
> * tree-vect-loop.c (vect_analyze_loop_costing): Likewise.
> (vect_get_datarefs_in_loop): Likewise.
> (vect_analyze_loop): Likewise.
> * tree-vect-slp.c (vect_slp_bb): Likewise.
> * tree-vectorizer.h: Likewise.
> * tree-vrp.c (find_switch_asserts): Likewise.
> (vrp_prop::check_mem_ref): Likewise.
> * tree.c (wide_int_to_tree_1): Likewise.
> (cache_integer_cst): Likewise.
> * var-tracking.c (EXPR_USE_DEPTH): Likewise.
> (reverse_op): Likewise.
> (vt_find_locations): Likewise.
>
> gcc/c/ChangeLog:
>
> 2019-11-07 Martin Liska <mliska@suse.cz>
>
> * gimple-parser.c (c_parser_parse_gimple_body): Replace old parameter syntax
> with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
> macro.
>
> gcc/cp/ChangeLog:
>
> 2019-11-07 Martin Liska <mliska@suse.cz>
>
> * name-lookup.c (namespace_hints::namespace_hints): Replace old parameter syntax
> with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
> macro.
> * typeck.c (comptypes): Likewise.
>
> gcc/lto/ChangeLog:
>
> 2019-11-07 Martin Liska <mliska@suse.cz>
>
> * lto-partition.c (lto_balanced_map): Replace old parameter syntax
> with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
> macro.
> * lto.c (do_whole_program_analysis): Likewise.
> ---
> gcc/asan.c | 18 ++--
> gcc/auto-profile.c | 2 +-
> gcc/bb-reorder.c | 4 +-
> gcc/builtins.c | 2 +-
> gcc/c/gimple-parser.c | 2 +-
> gcc/cfgcleanup.c | 4 +-
> gcc/cfgexpand.c | 8 +-
> gcc/cfgloopanal.c | 8 +-
> gcc/cgraph.c | 2 +-
> gcc/combine.c | 4 +-
> gcc/common/config/aarch64/aarch64-common.c | 15 ++--
> gcc/common/config/ia64/ia64-common.c | 8 +-
> .../config/powerpcspe/powerpcspe-common.c | 2 +-
> gcc/common/config/rs6000/rs6000-common.c | 2 +-
> gcc/common/config/sh/sh-common.c | 2 +-
> gcc/config/aarch64/aarch64.c | 79 ++++++++----------
> gcc/config/alpha/alpha.c | 16 ++--
> gcc/config/arm/arm.c | 43 ++++------
> gcc/config/i386/i386-options.c | 32 +++----
> gcc/config/i386/i386.c | 26 +++---
> gcc/config/ia64/ia64.c | 2 +-
> gcc/config/rs6000/rs6000-logue.c | 4 +-
> gcc/config/rs6000/rs6000.c | 55 ++++++------
> gcc/config/s390/s390.c | 79 ++++++------------
> gcc/config/sparc/sparc.c | 83 +++++++++----------
> gcc/config/visium/visium.c | 6 +-
> gcc/coverage.c | 8 +-
> gcc/cp/name-lookup.c | 2 +-
> gcc/cp/typeck.c | 4 +-
> gcc/cse.c | 6 +-
> gcc/cselib.c | 2 +-
> gcc/dse.c | 2 +-
> gcc/emit-rtl.c | 18 ++--
> gcc/explow.c | 2 +-
> gcc/final.c | 4 +-
> gcc/fold-const.c | 12 +--
> gcc/gcse.c | 16 ++--
> gcc/ggc-common.c | 4 +-
> gcc/ggc-page.c | 4 +-
> gcc/gimple-loop-interchange.cc | 6 +-
> gcc/gimple-loop-jam.c | 8 +-
> gcc/gimple-loop-versioning.cc | 4 +-
> gcc/gimple-ssa-split-paths.c | 2 +-
> gcc/gimple-ssa-store-merging.c | 8 +-
> gcc/gimple-ssa-strength-reduction.c | 2 +-
> gcc/graphite-isl-ast-to-gimple.c | 4 +-
> gcc/graphite-optimize-isl.c | 4 +-
> gcc/graphite-scop-detection.c | 4 +-
> gcc/haifa-sched.c | 38 ++++-----
> gcc/hsa-gen.c | 2 +-
> gcc/ifcvt.c | 4 +-
> gcc/ipa-cp.c | 30 +++----
> gcc/ipa-fnsummary.c | 20 ++---
> gcc/ipa-inline-analysis.c | 2 +-
> gcc/ipa-inline.c | 77 +++++++++--------
> gcc/ipa-polymorphic-call.c | 2 +-
> gcc/ipa-profile.c | 2 +-
> gcc/ipa-prop.c | 6 +-
> gcc/ipa-split.c | 10 +--
> gcc/ipa-sra.c | 9 +-
> gcc/ira-build.c | 4 +-
> gcc/ira-conflicts.c | 4 +-
> gcc/loop-doloop.c | 2 +-
> gcc/loop-invariant.c | 4 +-
> gcc/loop-unroll.c | 26 +++---
> gcc/lra-assigns.c | 2 +-
> gcc/lra-constraints.c | 2 +-
> gcc/lto/lto-partition.c | 10 +--
> gcc/lto/lto.c | 10 +--
> gcc/modulo-sched.c | 6 +-
> gcc/opts.c | 48 ++++-------
> gcc/postreload-gcse.c | 6 +-
> gcc/predict.c | 20 ++---
> gcc/reload.c | 2 +-
> gcc/reorg.c | 4 +-
> gcc/resource.c | 4 +-
> gcc/sanopt.c | 4 +-
> gcc/sched-deps.c | 10 +--
> gcc/sched-ebb.c | 4 +-
> gcc/sched-rgn.c | 18 ++--
> gcc/sel-sched-ir.c | 4 +-
> gcc/sel-sched-ir.h | 2 +-
> gcc/sel-sched.c | 4 +-
> gcc/shrink-wrap.c | 2 +-
> gcc/targhooks.c | 21 ++---
> gcc/toplev.c | 4 +-
> gcc/tracer.c | 12 +--
> gcc/trans-mem.c | 2 +-
> gcc/tree-chrec.c | 4 +-
> gcc/tree-data-ref.c | 4 +-
> gcc/tree-if-conv.c | 2 +-
> gcc/tree-inline.c | 2 +-
> gcc/tree-loop-distribution.c | 2 +-
> gcc/tree-parloops.c | 18 ++--
> gcc/tree-predcom.c | 2 +-
> gcc/tree-scalar-evolution.c | 4 +-
> gcc/tree-sra.c | 19 +++--
> gcc/tree-ssa-ccp.c | 2 +-
> gcc/tree-ssa-dse.c | 8 +-
> gcc/tree-ssa-ifcombine.c | 4 +-
> gcc/tree-ssa-loop-ch.c | 2 +-
> gcc/tree-ssa-loop-im.c | 2 +-
> gcc/tree-ssa-loop-ivcanon.c | 18 ++--
> gcc/tree-ssa-loop-ivopts.c | 10 +--
> gcc/tree-ssa-loop-manip.c | 2 +-
> gcc/tree-ssa-loop-niter.c | 2 +-
> gcc/tree-ssa-loop-prefetch.c | 46 +++++-----
> gcc/tree-ssa-loop-unswitch.c | 6 +-
> gcc/tree-ssa-math-opts.c | 6 +-
> gcc/tree-ssa-phiopt.c | 8 +-
> gcc/tree-ssa-pre.c | 4 +-
> gcc/tree-ssa-reassoc.c | 2 +-
> gcc/tree-ssa-sccvn.c | 6 +-
> gcc/tree-ssa-scopedtables.c | 2 +-
> gcc/tree-ssa-sink.c | 2 +-
> gcc/tree-ssa-strlen.c | 8 +-
> gcc/tree-ssa-structalias.c | 8 +-
> gcc/tree-ssa-tail-merge.c | 4 +-
> gcc/tree-ssa-threadbackward.c | 16 ++--
> gcc/tree-ssa-threadedge.c | 4 +-
> gcc/tree-ssa-uninit.c | 2 +-
> gcc/tree-switch-conversion.c | 6 +-
> gcc/tree-switch-conversion.h | 4 +-
> gcc/tree-vect-data-refs.c | 11 ++-
> gcc/tree-vect-loop.c | 6 +-
> gcc/tree-vect-slp.c | 2 +-
> gcc/tree-vectorizer.h | 2 +-
> gcc/tree-vrp.c | 4 +-
> gcc/tree.c | 22 ++---
> gcc/var-tracking.c | 6 +-
> 130 files changed, 640 insertions(+), 731 deletions(-)
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 0/7] Param conversion to option machinery
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
` (7 preceding siblings ...)
2019-11-11 14:06 ` [PATCH] Use more SET_OPTION_IF_UNSET Martin Liška
@ 2019-11-11 14:50 ` Richard Biener
2019-11-12 9:24 ` Martin Liška
8 siblings, 1 reply; 29+ messages in thread
From: Richard Biener @ 2019-11-11 14:50 UTC (permalink / raw)
To: Martin Liska; +Cc: GCC Patches
On Thu, Nov 7, 2019 at 1:33 PM Martin Liska <mliska@suse.cz> wrote:
>
> The email thread is follow up of a demo that I made here:
> https://gcc.gnu.org/ml/gcc-patches/2019-10/msg02220.html
>
> The patchset converts current param infrastructure to
> the option machinery. The parts 3 and 4 are quite
> mechanical.
>
> I would appreciate a feedback about what parameters
> should be per function (Optimization keyword) and global.
I didn't go over them but maybe we can postpone this to a followup
and for now make _none_ of them Optimization which preserves
previous behavior (I guess the optimize attribute/pragma doesn't
accept -param either at the moment).
I've commented on part 3/4 spotting a long line and also a
followup / testing opportunity.
> The patch survives bootstrap and regtests on x86_64-linux-gnu
> and ppc64-linux-gnu and I made cross build of all target compilers.
OK if you split the long lines. The rest can be done as followup.
Thanks for the work,
Richard.
> Thoughts?
> Martin
>
> Martin Liska (7):
> Param to options conversion.
> Include new generated gcc/params.opt file.
> Apply mechanical replacement (generated patch).
> Remove gcc/params.* files.
> Remove last leftover usage of params* files.
> Remove set_default_param_value from documentation.
> Fix test-suite fallout.
>
> gcc/Makefile.in | 20 +-
> gcc/asan.c | 19 +-
> gcc/auto-profile.c | 3 +-
> gcc/bb-reorder.c | 5 +-
> gcc/builtins.c | 3 +-
> gcc/c/gimple-parser.c | 3 +-
> gcc/cfgcleanup.c | 5 +-
> gcc/cfgexpand.c | 9 +-
> gcc/cfgloopanal.c | 9 +-
> gcc/cgraph.c | 3 +-
> gcc/combine.c | 5 +-
> gcc/common.opt | 10 -
> gcc/common/common-target.def | 6 +-
> gcc/common/config/aarch64/aarch64-common.c | 16 +-
> gcc/common/config/gcn/gcn-common.c | 1 -
> gcc/common/config/ia64/ia64-common.c | 9 +-
> .../config/powerpcspe/powerpcspe-common.c | 3 +-
> gcc/common/config/rs6000/rs6000-common.c | 3 +-
> gcc/common/config/sh/sh-common.c | 3 +-
> gcc/config/aarch64/aarch64.c | 80 +-
> gcc/config/alpha/alpha.c | 17 +-
> gcc/config/arm/arm.c | 44 +-
> gcc/config/avr/avr.c | 1 -
> gcc/config/csky/csky.c | 1 -
> gcc/config/i386/i386-builtins.c | 1 -
> gcc/config/i386/i386-expand.c | 1 -
> gcc/config/i386/i386-features.c | 1 -
> gcc/config/i386/i386-options.c | 35 +-
> gcc/config/i386/i386.c | 27 +-
> gcc/config/ia64/ia64.c | 3 +-
> gcc/config/rs6000/rs6000-logue.c | 5 +-
> gcc/config/rs6000/rs6000.c | 56 +-
> gcc/config/s390/s390.c | 80 +-
> gcc/config/sparc/sparc.c | 84 +-
> gcc/config/visium/visium.c | 7 +-
> gcc/coverage.c | 9 +-
> gcc/cp/name-lookup.c | 3 +-
> gcc/cp/typeck.c | 5 +-
> gcc/cprop.c | 1 -
> gcc/cse.c | 7 +-
> gcc/cselib.c | 3 +-
> gcc/doc/options.texi | 3 +
> gcc/doc/tm.texi | 4 +-
> gcc/dse.c | 3 +-
> gcc/emit-rtl.c | 19 +-
> gcc/explow.c | 3 +-
> gcc/final.c | 5 +-
> gcc/flag-types.h | 11 +
> gcc/fold-const.c | 13 +-
> gcc/gcc.c | 9 -
> gcc/gcse.c | 17 +-
> gcc/ggc-common.c | 5 +-
> gcc/ggc-page.c | 5 +-
> gcc/gimple-loop-interchange.cc | 7 +-
> gcc/gimple-loop-jam.c | 9 +-
> gcc/gimple-loop-versioning.cc | 5 +-
> gcc/gimple-ssa-split-paths.c | 3 +-
> gcc/gimple-ssa-sprintf.c | 1 -
> gcc/gimple-ssa-store-merging.c | 9 +-
> gcc/gimple-ssa-strength-reduction.c | 3 +-
> gcc/gimple-ssa-warn-alloca.c | 1 -
> gcc/gimple-ssa-warn-restrict.c | 1 -
> gcc/graphite-isl-ast-to-gimple.c | 5 +-
> gcc/graphite-optimize-isl.c | 5 +-
> gcc/graphite-scop-detection.c | 5 +-
> gcc/graphite-sese-to-poly.c | 1 -
> gcc/graphite.c | 1 -
> gcc/haifa-sched.c | 39 +-
> gcc/hsa-gen.c | 3 +-
> gcc/ifcvt.c | 5 +-
> gcc/ipa-cp.c | 31 +-
> gcc/ipa-fnsummary.c | 21 +-
> gcc/ipa-inline-analysis.c | 3 +-
> gcc/ipa-inline.c | 78 +-
> gcc/ipa-polymorphic-call.c | 3 +-
> gcc/ipa-profile.c | 3 +-
> gcc/ipa-prop.c | 7 +-
> gcc/ipa-split.c | 11 +-
> gcc/ipa-sra.c | 10 +-
> gcc/ira-build.c | 5 +-
> gcc/ira-conflicts.c | 5 +-
> gcc/loop-doloop.c | 3 +-
> gcc/loop-invariant.c | 5 +-
> gcc/loop-unroll.c | 27 +-
> gcc/lra-assigns.c | 3 +-
> gcc/lra-constraints.c | 3 +-
> gcc/lto/lto-common.c | 1 -
> gcc/lto/lto-partition.c | 11 +-
> gcc/lto/lto.c | 11 +-
> gcc/modulo-sched.c | 7 +-
> gcc/opt-functions.awk | 3 +-
> gcc/opt-suggestions.c | 59 +-
> gcc/opt-suggestions.h | 5 -
> gcc/opts-common.c | 20 +
> gcc/opts.c | 158 +-
> gcc/opts.h | 11 +-
> gcc/params-enum.h | 39 -
> gcc/params-list.h | 26 -
> gcc/params-options.h | 27 -
> gcc/params.c | 302 ----
> gcc/params.def | 1495 -----------------
> gcc/params.h | 254 ---
> gcc/params.opt | 967 +++++++++++
> gcc/postreload-gcse.c | 7 +-
> gcc/predict.c | 21 +-
> gcc/reload.c | 3 +-
> gcc/reorg.c | 5 +-
> gcc/resource.c | 5 +-
> gcc/sanopt.c | 5 +-
> gcc/sched-deps.c | 11 +-
> gcc/sched-ebb.c | 5 +-
> gcc/sched-rgn.c | 19 +-
> gcc/sel-sched-ir.c | 5 +-
> gcc/sel-sched-ir.h | 2 +-
> gcc/sel-sched.c | 5 +-
> gcc/shrink-wrap.c | 3 +-
> gcc/stmt.c | 1 -
> gcc/targhooks.c | 22 +-
> gcc/testsuite/gcc.dg/completion-3.c | 16 +-
> gcc/testsuite/gcc.dg/pr83620.c | 2 +-
> gcc/testsuite/gcc.dg/spellcheck-params-2.c | 2 +-
> gcc/testsuite/gcc.dg/spellcheck-params.c | 2 +-
> gcc/testsuite/gcc.misc-tests/help.exp | 4 +-
> gcc/toplev.c | 13 +-
> gcc/tracer.c | 13 +-
> gcc/trans-mem.c | 3 +-
> gcc/tree-chrec.c | 5 +-
> gcc/tree-data-ref.c | 5 +-
> gcc/tree-if-conv.c | 3 +-
> gcc/tree-inline.c | 3 +-
> gcc/tree-loop-distribution.c | 3 +-
> gcc/tree-parloops.c | 20 +-
> gcc/tree-predcom.c | 3 +-
> gcc/tree-profile.c | 1 -
> gcc/tree-scalar-evolution.c | 5 +-
> gcc/tree-sra.c | 20 +-
> gcc/tree-ssa-ccp.c | 3 +-
> gcc/tree-ssa-dom.c | 1 -
> gcc/tree-ssa-dse.c | 9 +-
> gcc/tree-ssa-ifcombine.c | 5 +-
> gcc/tree-ssa-loop-ch.c | 3 +-
> gcc/tree-ssa-loop-im.c | 3 +-
> gcc/tree-ssa-loop-ivcanon.c | 19 +-
> gcc/tree-ssa-loop-ivopts.c | 11 +-
> gcc/tree-ssa-loop-manip.c | 3 +-
> gcc/tree-ssa-loop-niter.c | 3 +-
> gcc/tree-ssa-loop-prefetch.c | 47 +-
> gcc/tree-ssa-loop-unswitch.c | 7 +-
> gcc/tree-ssa-math-opts.c | 7 +-
> gcc/tree-ssa-phiopt.c | 9 +-
> gcc/tree-ssa-pre.c | 5 +-
> gcc/tree-ssa-reassoc.c | 3 +-
> gcc/tree-ssa-sccvn.c | 7 +-
> gcc/tree-ssa-scopedtables.c | 3 +-
> gcc/tree-ssa-sink.c | 3 +-
> gcc/tree-ssa-strlen.c | 9 +-
> gcc/tree-ssa-structalias.c | 9 +-
> gcc/tree-ssa-tail-merge.c | 5 +-
> gcc/tree-ssa-threadbackward.c | 17 +-
> gcc/tree-ssa-threadedge.c | 5 +-
> gcc/tree-ssa-uninit.c | 3 +-
> gcc/tree-switch-conversion.c | 7 +-
> gcc/tree-switch-conversion.h | 4 +-
> gcc/tree-vect-data-refs.c | 12 +-
> gcc/tree-vect-loop.c | 7 +-
> gcc/tree-vect-slp.c | 3 +-
> gcc/tree-vectorizer.h | 2 +-
> gcc/tree-vrp.c | 5 +-
> gcc/tree.c | 23 +-
> gcc/value-prof.c | 1 -
> gcc/var-tracking.c | 7 +-
> 171 files changed, 1689 insertions(+), 3243 deletions(-)
> delete mode 100644 gcc/params-enum.h
> delete mode 100644 gcc/params-list.h
> delete mode 100644 gcc/params-options.h
> delete mode 100644 gcc/params.c
> delete mode 100644 gcc/params.def
> delete mode 100644 gcc/params.h
> create mode 100644 gcc/params.opt
>
> --
> 2.23.0
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH] Use more SET_OPTION_IF_UNSET.
2019-11-11 14:06 ` [PATCH] Use more SET_OPTION_IF_UNSET Martin Liška
@ 2019-11-12 9:19 ` Richard Biener
0 siblings, 0 replies; 29+ messages in thread
From: Richard Biener @ 2019-11-12 9:19 UTC (permalink / raw)
To: Martin Liška; +Cc: GCC Patches
On Mon, Nov 11, 2019 at 3:04 PM Martin Liška <mliska@suse.cz> wrote:
>
> There's one more refactoring patch that is about more
> usage of SET_OPTION_IF_UNSET for parameters.
>
> Patch can bootstrap on x86_64-linux-gnu and survives regression tests.
>
> Ready to be installed?
OK.
Richard.
> Thanks,
> Martin
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 3/7] Apply mechanical replacement (generated patch).
2019-11-11 14:39 ` Richard Biener
@ 2019-11-12 9:20 ` Martin Liška
2019-11-12 9:52 ` Richard Biener
2019-11-12 9:22 ` [PATCH 8/9] Remove option_default_params and option_validate_param hooks Martin Liška
1 sibling, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-12 9:20 UTC (permalink / raw)
To: Richard Biener; +Cc: GCC Patches
[-- Attachment #1: Type: text/plain, Size: 641 bytes --]
On 11/11/19 3:36 PM, Richard Biener wrote:
> I think I've noticed at least one long line (please double-check):
>
> - if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
> INTEGER_SHARE_LIMIT)
> + if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
> param_integer_share_limit)
You are right, they were quite some GNU coding style violations.
I'm sending updated version of the patch where I fixed that.
Martin
>
> as a followup I notice that the targets *_default_params () functions should
> be merged into the default-options structs they have (did you check the
> defaults are still applied and user-overridable?)
[-- Attachment #2: 0003-Apply-mechanical-replacement-generated-patch.patch --]
[-- Type: text/x-patch, Size: 206967 bytes --]
From 6860b576c48ded749a8f260d2321328386cab6a9 Mon Sep 17 00:00:00 2001
From: Martin Liska <mliska@suse.cz>
Date: Wed, 6 Nov 2019 11:50:56 +0100
Subject: [PATCH 3/9] Apply mechanical replacement (generated patch).
gcc/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* asan.c (asan_sanitize_stack_p): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
(asan_sanitize_allocas_p): Likewise.
(asan_emit_stack_protection): Likewise.
(asan_protect_global): Likewise.
(instrument_derefs): Likewise.
(instrument_builtin_call): Likewise.
(asan_expand_mark_ifn): Likewise.
* auto-profile.c (auto_profile): Likewise.
* bb-reorder.c (copy_bb_p): Likewise.
(duplicate_computed_gotos): Likewise.
* builtins.c (inline_expand_builtin_string_cmp): Likewise.
* cfgcleanup.c (try_crossjump_to_edge): Likewise.
(try_crossjump_bb): Likewise.
* cfgexpand.c (defer_stack_allocation): Likewise.
(stack_protect_classify_type): Likewise.
(pass_expand::execute): Likewise.
* cfgloopanal.c (expected_loop_iterations_unbounded): Likewise.
(estimate_reg_pressure_cost): Likewise.
* cgraph.c (cgraph_edge::maybe_hot_p): Likewise.
* combine.c (combine_instructions): Likewise.
(record_value_for_reg): Likewise.
* common/config/aarch64/aarch64-common.c (aarch64_option_validate_param): Likewise.
(aarch64_option_default_params): Likewise.
* common/config/ia64/ia64-common.c (ia64_option_default_params): Likewise.
* common/config/powerpcspe/powerpcspe-common.c (rs6000_option_default_params): Likewise.
* common/config/rs6000/rs6000-common.c (rs6000_option_default_params): Likewise.
* common/config/sh/sh-common.c (sh_option_default_params): Likewise.
* config/aarch64/aarch64.c (aarch64_output_probe_stack_range): Likewise.
(aarch64_allocate_and_probe_stack_space): Likewise.
(aarch64_expand_epilogue): Likewise.
(aarch64_override_options_internal): Likewise.
* config/alpha/alpha.c (alpha_option_override): Likewise.
* config/arm/arm.c (arm_option_override): Likewise.
(arm_valid_target_attribute_p): Likewise.
* config/i386/i386-options.c (ix86_option_override_internal): Likewise.
* config/i386/i386.c (get_probe_interval): Likewise.
(ix86_adjust_stack_and_probe_stack_clash): Likewise.
(ix86_max_noce_ifcvt_seq_cost): Likewise.
* config/ia64/ia64.c (ia64_adjust_cost): Likewise.
* config/rs6000/rs6000-logue.c (get_stack_clash_protection_probe_interval): Likewise.
(get_stack_clash_protection_guard_size): Likewise.
* config/rs6000/rs6000.c (rs6000_option_override_internal): Likewise.
* config/s390/s390.c (allocate_stack_space): Likewise.
(s390_emit_prologue): Likewise.
(s390_option_override_internal): Likewise.
* config/sparc/sparc.c (sparc_option_override): Likewise.
* config/visium/visium.c (visium_option_override): Likewise.
* coverage.c (get_coverage_counts): Likewise.
(coverage_compute_profile_id): Likewise.
(coverage_begin_function): Likewise.
(coverage_end_function): Likewise.
* cse.c (cse_find_path): Likewise.
(cse_extended_basic_block): Likewise.
(cse_main): Likewise.
* cselib.c (cselib_invalidate_mem): Likewise.
* dse.c (dse_step1): Likewise.
* emit-rtl.c (set_new_first_and_last_insn): Likewise.
(get_max_insn_count): Likewise.
(make_debug_insn_raw): Likewise.
(init_emit): Likewise.
* explow.c (compute_stack_clash_protection_loop_data): Likewise.
* final.c (compute_alignments): Likewise.
* fold-const.c (fold_range_test): Likewise.
(fold_truth_andor): Likewise.
(tree_single_nonnegative_warnv_p): Likewise.
(integer_valued_real_single_p): Likewise.
* gcse.c (want_to_gcse_p): Likewise.
(prune_insertions_deletions): Likewise.
(hoist_code): Likewise.
(gcse_or_cprop_is_too_expensive): Likewise.
* ggc-common.c: Likewise.
* ggc-page.c (ggc_collect): Likewise.
* gimple-loop-interchange.cc (MAX_NUM_STMT): Likewise.
(MAX_DATAREFS): Likewise.
(OUTER_STRIDE_RATIO): Likewise.
* gimple-loop-jam.c (tree_loop_unroll_and_jam): Likewise.
* gimple-loop-versioning.cc (loop_versioning::max_insns_for_loop): Likewise.
* gimple-ssa-split-paths.c (is_feasible_trace): Likewise.
* gimple-ssa-store-merging.c (imm_store_chain_info::try_coalesce_bswap): Likewise.
(imm_store_chain_info::coalesce_immediate_stores): Likewise.
(imm_store_chain_info::output_merged_store): Likewise.
(pass_store_merging::process_store): Likewise.
* gimple-ssa-strength-reduction.c (find_basis_for_base_expr): Likewise.
* graphite-isl-ast-to-gimple.c (class translate_isl_ast_to_gimple): Likewise.
(scop_to_isl_ast): Likewise.
* graphite-optimize-isl.c (get_schedule_for_node_st): Likewise.
(optimize_isl): Likewise.
* graphite-scop-detection.c (build_scops): Likewise.
* haifa-sched.c (set_modulo_params): Likewise.
(rank_for_schedule): Likewise.
(model_add_to_worklist): Likewise.
(model_promote_insn): Likewise.
(model_choose_insn): Likewise.
(queue_to_ready): Likewise.
(autopref_multipass_dfa_lookahead_guard): Likewise.
(schedule_block): Likewise.
(sched_init): Likewise.
* hsa-gen.c (init_prologue): Likewise.
* ifcvt.c (bb_ok_for_noce_convert_multiple_sets): Likewise.
(cond_move_process_if_block): Likewise.
* ipa-cp.c (ipcp_lattice::add_value): Likewise.
(merge_agg_lats_step): Likewise.
(devirtualization_time_bonus): Likewise.
(hint_time_bonus): Likewise.
(incorporate_penalties): Likewise.
(good_cloning_opportunity_p): Likewise.
(ipcp_propagate_stage): Likewise.
* ipa-fnsummary.c (decompose_param_expr): Likewise.
(set_switch_stmt_execution_predicate): Likewise.
(analyze_function_body): Likewise.
(compute_fn_summary): Likewise.
* ipa-inline-analysis.c (estimate_growth): Likewise.
* ipa-inline.c (caller_growth_limits): Likewise.
(inline_insns_single): Likewise.
(inline_insns_auto): Likewise.
(can_inline_edge_by_limits_p): Likewise.
(want_early_inline_function_p): Likewise.
(big_speedup_p): Likewise.
(want_inline_small_function_p): Likewise.
(want_inline_self_recursive_call_p): Likewise.
(edge_badness): Likewise.
(recursive_inlining): Likewise.
(compute_max_insns): Likewise.
(early_inliner): Likewise.
* ipa-polymorphic-call.c (csftc_abort_walking_p): Likewise.
* ipa-profile.c (ipa_profile): Likewise.
* ipa-prop.c (determine_known_aggregate_parts): Likewise.
(ipa_analyze_node): Likewise.
(ipcp_transform_function): Likewise.
* ipa-split.c (consider_split): Likewise.
* ipa-sra.c (allocate_access): Likewise.
(process_scan_results): Likewise.
(ipa_sra_summarize_function): Likewise.
(pull_accesses_from_callee): Likewise.
* ira-build.c (loop_compare_func): Likewise.
(mark_loops_for_removal): Likewise.
* ira-conflicts.c (build_conflict_bit_table): Likewise.
* loop-doloop.c (doloop_optimize): Likewise.
* loop-invariant.c (gain_for_invariant): Likewise.
(move_loop_invariants): Likewise.
* loop-unroll.c (decide_unroll_constant_iterations): Likewise.
(decide_unroll_runtime_iterations): Likewise.
(decide_unroll_stupid): Likewise.
(expand_var_during_unrolling): Likewise.
* lra-assigns.c (spill_for): Likewise.
* lra-constraints.c (EBB_PROBABILITY_CUTOFF): Likewise.
* modulo-sched.c (sms_schedule): Likewise.
(DFA_HISTORY): Likewise.
* opts.c (default_options_optimization): Likewise.
(finish_options): Likewise.
(common_handle_option): Likewise.
* postreload-gcse.c (eliminate_partially_redundant_load): Likewise.
(if): Likewise.
* predict.c (get_hot_bb_threshold): Likewise.
(maybe_hot_count_p): Likewise.
(probably_never_executed): Likewise.
(predictable_edge_p): Likewise.
(predict_loops): Likewise.
(expr_expected_value_1): Likewise.
(tree_predict_by_opcode): Likewise.
(handle_missing_profiles): Likewise.
* reload.c (find_equiv_reg): Likewise.
* reorg.c (redundant_insn): Likewise.
* resource.c (mark_target_live_regs): Likewise.
(incr_ticks_for_insn): Likewise.
* sanopt.c (pass_sanopt::execute): Likewise.
* sched-deps.c (sched_analyze_1): Likewise.
(sched_analyze_2): Likewise.
(sched_analyze_insn): Likewise.
(deps_analyze_insn): Likewise.
* sched-ebb.c (schedule_ebbs): Likewise.
* sched-rgn.c (find_single_block_region): Likewise.
(too_large): Likewise.
(haifa_find_rgns): Likewise.
(extend_rgns): Likewise.
(new_ready): Likewise.
(schedule_region): Likewise.
(sched_rgn_init): Likewise.
* sel-sched-ir.c (make_region_from_loop): Likewise.
* sel-sched-ir.h (MAX_WS): Likewise.
* sel-sched.c (process_pipelined_exprs): Likewise.
(sel_setup_region_sched_flags): Likewise.
* shrink-wrap.c (try_shrink_wrapping): Likewise.
* targhooks.c (default_max_noce_ifcvt_seq_cost): Likewise.
* toplev.c (print_version): Likewise.
(process_options): Likewise.
* tracer.c (tail_duplicate): Likewise.
* trans-mem.c (tm_log_add): Likewise.
* tree-chrec.c (chrec_fold_plus_1): Likewise.
* tree-data-ref.c (split_constant_offset): Likewise.
(compute_all_dependences): Likewise.
* tree-if-conv.c (MAX_PHI_ARG_NUM): Likewise.
* tree-inline.c (remap_gimple_stmt): Likewise.
* tree-loop-distribution.c (MAX_DATAREFS_NUM): Likewise.
* tree-parloops.c (MIN_PER_THREAD): Likewise.
(create_parallel_loop): Likewise.
* tree-predcom.c (determine_unroll_factor): Likewise.
* tree-scalar-evolution.c (instantiate_scev_r): Likewise.
* tree-sra.c (analyze_all_variable_accesses): Likewise.
* tree-ssa-ccp.c (fold_builtin_alloca_with_align): Likewise.
* tree-ssa-dse.c (setup_live_bytes_from_ref): Likewise.
(dse_optimize_redundant_stores): Likewise.
(dse_classify_store): Likewise.
* tree-ssa-ifcombine.c (ifcombine_ifandif): Likewise.
* tree-ssa-loop-ch.c (ch_base::copy_headers): Likewise.
* tree-ssa-loop-im.c (LIM_EXPENSIVE): Likewise.
* tree-ssa-loop-ivcanon.c (try_unroll_loop_completely): Likewise.
(try_peel_loop): Likewise.
(tree_unroll_loops_completely): Likewise.
* tree-ssa-loop-ivopts.c (avg_loop_niter): Likewise.
(CONSIDER_ALL_CANDIDATES_BOUND): Likewise.
(MAX_CONSIDERED_GROUPS): Likewise.
(ALWAYS_PRUNE_CAND_SET_BOUND): Likewise.
* tree-ssa-loop-manip.c (can_unroll_loop_p): Likewise.
* tree-ssa-loop-niter.c (MAX_ITERATIONS_TO_TRACK): Likewise.
* tree-ssa-loop-prefetch.c (PREFETCH_BLOCK): Likewise.
(L1_CACHE_SIZE_BYTES): Likewise.
(L2_CACHE_SIZE_BYTES): Likewise.
(should_issue_prefetch_p): Likewise.
(schedule_prefetches): Likewise.
(determine_unroll_factor): Likewise.
(volume_of_references): Likewise.
(add_subscript_strides): Likewise.
(self_reuse_distance): Likewise.
(mem_ref_count_reasonable_p): Likewise.
(insn_to_prefetch_ratio_too_small_p): Likewise.
(loop_prefetch_arrays): Likewise.
(tree_ssa_prefetch_arrays): Likewise.
* tree-ssa-loop-unswitch.c (tree_unswitch_single_loop): Likewise.
* tree-ssa-math-opts.c (gimple_expand_builtin_pow): Likewise.
(convert_mult_to_fma): Likewise.
(math_opts_dom_walker::after_dom_children): Likewise.
* tree-ssa-phiopt.c (cond_if_else_store_replacement): Likewise.
(hoist_adjacent_loads): Likewise.
(gate_hoist_loads): Likewise.
* tree-ssa-pre.c (translate_vuse_through_block): Likewise.
(compute_partial_antic_aux): Likewise.
* tree-ssa-reassoc.c (get_reassociation_width): Likewise.
* tree-ssa-sccvn.c (vn_reference_lookup_pieces): Likewise.
(vn_reference_lookup): Likewise.
(do_rpo_vn): Likewise.
* tree-ssa-scopedtables.c (avail_exprs_stack::lookup_avail_expr): Likewise.
* tree-ssa-sink.c (select_best_block): Likewise.
* tree-ssa-strlen.c (new_stridx): Likewise.
(new_addr_stridx): Likewise.
(get_range_strlen_dynamic): Likewise.
(class ssa_name_limit_t): Likewise.
* tree-ssa-structalias.c (push_fields_onto_fieldstack): Likewise.
(create_variable_info_for_1): Likewise.
(init_alias_vars): Likewise.
* tree-ssa-tail-merge.c (find_clusters_1): Likewise.
(tail_merge_optimize): Likewise.
* tree-ssa-threadbackward.c (thread_jumps::profitable_jump_thread_path): Likewise.
(thread_jumps::fsm_find_control_statement_thread_paths): Likewise.
(thread_jumps::find_jump_threads_backwards): Likewise.
* tree-ssa-threadedge.c (record_temporary_equivalences_from_stmts_at_dest): Likewise.
* tree-ssa-uninit.c (compute_control_dep_chain): Likewise.
* tree-switch-conversion.c (switch_conversion::check_range): Likewise.
(jump_table_cluster::can_be_handled): Likewise.
* tree-switch-conversion.h (jump_table_cluster::case_values_threshold): Likewise.
(SWITCH_CONVERSION_BRANCH_RATIO): Likewise.
(param_switch_conversion_branch_ratio): Likewise.
* tree-vect-data-refs.c (vect_mark_for_runtime_alias_test): Likewise.
(vect_enhance_data_refs_alignment): Likewise.
(vect_prune_runtime_alias_test_list): Likewise.
* tree-vect-loop.c (vect_analyze_loop_costing): Likewise.
(vect_get_datarefs_in_loop): Likewise.
(vect_analyze_loop): Likewise.
* tree-vect-slp.c (vect_slp_bb): Likewise.
* tree-vectorizer.h: Likewise.
* tree-vrp.c (find_switch_asserts): Likewise.
(vrp_prop::check_mem_ref): Likewise.
* tree.c (wide_int_to_tree_1): Likewise.
(cache_integer_cst): Likewise.
* var-tracking.c (EXPR_USE_DEPTH): Likewise.
(reverse_op): Likewise.
(vt_find_locations): Likewise.
gcc/c/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* gimple-parser.c (c_parser_parse_gimple_body): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
gcc/cp/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* name-lookup.c (namespace_hints::namespace_hints): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
* typeck.c (comptypes): Likewise.
gcc/lto/ChangeLog:
2019-11-07 Martin Liska <mliska@suse.cz>
* lto-partition.c (lto_balanced_map): Replace old parameter syntax
with the new one, include opts.h if needed. Use SET_OPTION_IF_UNSET
macro.
* lto.c (do_whole_program_analysis): Likewise.
---
gcc/asan.c | 19 +++--
gcc/auto-profile.c | 2 +-
gcc/bb-reorder.c | 4 +-
gcc/builtins.c | 2 +-
gcc/c/gimple-parser.c | 2 +-
gcc/cfgcleanup.c | 4 +-
gcc/cfgexpand.c | 8 +-
gcc/cfgloopanal.c | 8 +-
gcc/cgraph.c | 2 +-
gcc/combine.c | 4 +-
gcc/common/config/aarch64/aarch64-common.c | 15 ++--
gcc/common/config/ia64/ia64-common.c | 8 +-
.../config/powerpcspe/powerpcspe-common.c | 2 +-
gcc/common/config/rs6000/rs6000-common.c | 2 +-
gcc/common/config/sh/sh-common.c | 2 +-
gcc/config/aarch64/aarch64.c | 79 ++++++++---------
gcc/config/alpha/alpha.c | 16 ++--
gcc/config/arm/arm.c | 43 ++++------
gcc/config/i386/i386-options.c | 32 +++----
gcc/config/i386/i386.c | 26 +++---
gcc/config/ia64/ia64.c | 2 +-
gcc/config/rs6000/rs6000-logue.c | 4 +-
gcc/config/rs6000/rs6000.c | 44 +++++-----
gcc/config/s390/s390.c | 79 ++++++-----------
gcc/config/sparc/sparc.c | 83 +++++++++---------
gcc/config/visium/visium.c | 6 +-
gcc/coverage.c | 8 +-
gcc/cp/name-lookup.c | 2 +-
gcc/cp/typeck.c | 4 +-
gcc/cse.c | 6 +-
gcc/cselib.c | 2 +-
gcc/dse.c | 2 +-
gcc/emit-rtl.c | 18 ++--
gcc/explow.c | 2 +-
gcc/final.c | 4 +-
gcc/fold-const.c | 12 +--
gcc/gcse.c | 17 ++--
gcc/ggc-common.c | 4 +-
gcc/ggc-page.c | 4 +-
gcc/gimple-loop-interchange.cc | 6 +-
gcc/gimple-loop-jam.c | 8 +-
gcc/gimple-loop-versioning.cc | 4 +-
gcc/gimple-ssa-split-paths.c | 2 +-
gcc/gimple-ssa-store-merging.c | 8 +-
gcc/gimple-ssa-strength-reduction.c | 2 +-
gcc/graphite-isl-ast-to-gimple.c | 4 +-
gcc/graphite-optimize-isl.c | 4 +-
gcc/graphite-scop-detection.c | 4 +-
gcc/haifa-sched.c | 46 +++++-----
gcc/hsa-gen.c | 2 +-
gcc/ifcvt.c | 4 +-
gcc/ipa-cp.c | 30 +++----
gcc/ipa-fnsummary.c | 20 ++---
gcc/ipa-inline-analysis.c | 4 +-
gcc/ipa-inline.c | 84 +++++++++----------
gcc/ipa-polymorphic-call.c | 2 +-
gcc/ipa-profile.c | 2 +-
gcc/ipa-prop.c | 6 +-
gcc/ipa-split.c | 10 +--
gcc/ipa-sra.c | 9 +-
gcc/ira-build.c | 4 +-
gcc/ira-conflicts.c | 4 +-
gcc/loop-doloop.c | 2 +-
gcc/loop-invariant.c | 4 +-
gcc/loop-unroll.c | 26 +++---
gcc/lra-assigns.c | 2 +-
gcc/lra-constraints.c | 2 +-
gcc/lto/lto-partition.c | 10 +--
gcc/lto/lto.c | 10 +--
gcc/modulo-sched.c | 6 +-
gcc/opts.c | 48 ++++-------
gcc/postreload-gcse.c | 7 +-
gcc/predict.c | 20 ++---
gcc/reload.c | 2 +-
gcc/reorg.c | 4 +-
gcc/resource.c | 4 +-
gcc/sanopt.c | 4 +-
gcc/sched-deps.c | 12 +--
gcc/sched-ebb.c | 4 +-
gcc/sched-rgn.c | 21 ++---
gcc/sel-sched-ir.c | 4 +-
gcc/sel-sched-ir.h | 2 +-
gcc/sel-sched.c | 4 +-
gcc/shrink-wrap.c | 2 +-
gcc/targhooks.c | 21 ++---
gcc/toplev.c | 4 +-
gcc/tracer.c | 12 +--
gcc/trans-mem.c | 2 +-
gcc/tree-chrec.c | 4 +-
gcc/tree-data-ref.c | 4 +-
gcc/tree-if-conv.c | 2 +-
gcc/tree-inline.c | 2 +-
gcc/tree-loop-distribution.c | 2 +-
gcc/tree-parloops.c | 18 ++--
gcc/tree-predcom.c | 2 +-
gcc/tree-scalar-evolution.c | 4 +-
gcc/tree-sra.c | 19 +++--
gcc/tree-ssa-ccp.c | 2 +-
gcc/tree-ssa-dse.c | 8 +-
gcc/tree-ssa-ifcombine.c | 4 +-
gcc/tree-ssa-loop-ch.c | 2 +-
gcc/tree-ssa-loop-im.c | 2 +-
gcc/tree-ssa-loop-ivcanon.c | 18 ++--
gcc/tree-ssa-loop-ivopts.c | 10 +--
gcc/tree-ssa-loop-manip.c | 2 +-
gcc/tree-ssa-loop-niter.c | 2 +-
gcc/tree-ssa-loop-prefetch.c | 50 ++++++-----
gcc/tree-ssa-loop-split.c | 5 +-
gcc/tree-ssa-loop-unswitch.c | 6 +-
gcc/tree-ssa-math-opts.c | 6 +-
gcc/tree-ssa-phiopt.c | 8 +-
gcc/tree-ssa-pre.c | 4 +-
gcc/tree-ssa-reassoc.c | 2 +-
gcc/tree-ssa-sccvn.c | 6 +-
gcc/tree-ssa-scopedtables.c | 2 +-
gcc/tree-ssa-sink.c | 2 +-
gcc/tree-ssa-strlen.c | 8 +-
gcc/tree-ssa-structalias.c | 8 +-
gcc/tree-ssa-tail-merge.c | 4 +-
gcc/tree-ssa-threadbackward.c | 16 ++--
gcc/tree-ssa-threadedge.c | 4 +-
gcc/tree-ssa-uninit.c | 2 +-
gcc/tree-switch-conversion.c | 6 +-
gcc/tree-switch-conversion.h | 6 +-
gcc/tree-vect-data-refs.c | 11 ++-
gcc/tree-vect-loop.c | 6 +-
gcc/tree-vect-slp.c | 2 +-
gcc/tree-vectorizer.h | 2 +-
gcc/tree-vrp.c | 4 +-
gcc/tree.c | 23 ++---
gcc/var-tracking.c | 6 +-
131 files changed, 658 insertions(+), 739 deletions(-)
diff --git a/gcc/asan.c b/gcc/asan.c
index a731bd490b4..5ae66942941 100644
--- a/gcc/asan.c
+++ b/gcc/asan.c
@@ -309,13 +309,13 @@ asan_mark_p (gimple *stmt, enum asan_mark_flags flag)
bool
asan_sanitize_stack_p (void)
{
- return (sanitize_flags_p (SANITIZE_ADDRESS) && ASAN_STACK);
+ return (sanitize_flags_p (SANITIZE_ADDRESS) && param_asan_stack);
}
bool
asan_sanitize_allocas_p (void)
{
- return (asan_sanitize_stack_p () && ASAN_PROTECT_ALLOCAS);
+ return (asan_sanitize_stack_p () && param_asan_protect_allocas);
}
/* Checks whether section SEC should be sanitized. */
@@ -1429,7 +1429,7 @@ asan_emit_stack_protection (rtx base, rtx pbase, unsigned int alignb,
/* Emit the prologue sequence. */
if (asan_frame_size > 32 && asan_frame_size <= 65536 && pbase
- && ASAN_USE_AFTER_RETURN)
+ && param_asan_use_after_return)
{
use_after_return_class = floor_log2 (asan_frame_size - 1) - 5;
/* __asan_stack_malloc_N guarantees alignment
@@ -1750,7 +1750,7 @@ is_odr_indicator (tree decl)
bool
asan_protect_global (tree decl, bool ignore_decl_rtl_set_p)
{
- if (!ASAN_GLOBALS)
+ if (!param_asan_globals)
return false;
rtx rtl, symbol;
@@ -2190,9 +2190,9 @@ static void
instrument_derefs (gimple_stmt_iterator *iter, tree t,
location_t location, bool is_store)
{
- if (is_store && !ASAN_INSTRUMENT_WRITES)
+ if (is_store && !param_asan_instrument_writes)
return;
- if (!is_store && !ASAN_INSTRUMENT_READS)
+ if (!is_store && !param_asan_instrument_reads)
return;
tree type, base;
@@ -2253,7 +2253,7 @@ instrument_derefs (gimple_stmt_iterator *iter, tree t,
{
if (DECL_THREAD_LOCAL_P (inner))
return;
- if (!ASAN_GLOBALS && is_global_var (inner))
+ if (!param_asan_globals && is_global_var (inner))
return;
if (!TREE_STATIC (inner))
{
@@ -2346,7 +2346,7 @@ instrument_mem_region_access (tree base, tree len,
static bool
instrument_builtin_call (gimple_stmt_iterator *iter)
{
- if (!ASAN_MEMINTRIN)
+ if (!param_asan_memintrin)
return false;
bool iter_advanced_p = false;
@@ -3219,7 +3219,8 @@ asan_expand_mark_ifn (gimple_stmt_iterator *iter)
tree base_addr = gimple_assign_lhs (g);
/* Generate direct emission if size_in_bytes is small. */
- if (size_in_bytes <= ASAN_PARAM_USE_AFTER_SCOPE_DIRECT_EMISSION_THRESHOLD)
+ if (size_in_bytes
+ <= (unsigned)param_use_after_scope_direct_emission_threshold)
{
const unsigned HOST_WIDE_INT shadow_size
= shadow_mem_size (size_in_bytes);
diff --git a/gcc/auto-profile.c b/gcc/auto-profile.c
index 4d8fb525cb1..92e980f68a2 100644
--- a/gcc/auto-profile.c
+++ b/gcc/auto-profile.c
@@ -1629,7 +1629,7 @@ auto_profile (void)
function before annotation, so the profile inside bar@loc_foo2
will be useful. */
autofdo::stmt_set promoted_stmts;
- for (int i = 0; i < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS); i++)
+ for (int i = 0; i < param_early_inliner_max_iterations; i++)
{
if (!flag_value_profile_transformations
|| !autofdo::afdo_vpt_for_early_inline (&promoted_stmts))
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c
index 0ac39140c6c..6a85c2a7fc0 100644
--- a/gcc/bb-reorder.c
+++ b/gcc/bb-reorder.c
@@ -1371,7 +1371,7 @@ copy_bb_p (const_basic_block bb, int code_may_grow)
return false;
if (code_may_grow && optimize_bb_for_speed_p (bb))
- max_size *= PARAM_VALUE (PARAM_MAX_GROW_COPY_BB_INSNS);
+ max_size *= param_max_grow_copy_bb_insns;
FOR_BB_INSNS (bb, insn)
{
@@ -2751,7 +2751,7 @@ duplicate_computed_gotos (function *fun)
/* Never copy a block larger than this. */
int max_size
- = uncond_jump_length * PARAM_VALUE (PARAM_MAX_GOTO_DUPLICATION_INSNS);
+ = uncond_jump_length * param_max_goto_duplication_insns;
bool changed = false;
diff --git a/gcc/builtins.c b/gcc/builtins.c
index 245fad02d9c..68baeb9bbe9 100644
--- a/gcc/builtins.c
+++ b/gcc/builtins.c
@@ -7214,7 +7214,7 @@ inline_expand_builtin_string_cmp (tree exp, rtx target)
/* If the length of the comparision is larger than the threshold,
do nothing. */
if (length > (unsigned HOST_WIDE_INT)
- PARAM_VALUE (BUILTIN_STRING_CMP_INLINE_LENGTH))
+ param_builtin_string_cmp_inline_length)
return NULL_RTX;
machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
diff --git a/gcc/c/gimple-parser.c b/gcc/c/gimple-parser.c
index ceec758ffbe..e40cfa2ec01 100644
--- a/gcc/c/gimple-parser.c
+++ b/gcc/c/gimple-parser.c
@@ -354,7 +354,7 @@ c_parser_parse_gimple_body (c_parser *cparser, char *gimple_pass,
if (cfun->curr_properties & PROP_cfg)
{
ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = entry_bb_count;
- gcov_type t = PARAM_VALUE (PARAM_GIMPLE_FE_COMPUTED_HOT_BB_THRESHOLD);
+ gcov_type t = param_gimple_fe_computed_hot_bb_threshold;
set_hot_bb_threshold (t);
update_max_bb_count ();
cgraph_node::get_create (cfun->decl);
diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c
index 835f7d79ea4..7b1dd245487 100644
--- a/gcc/cfgcleanup.c
+++ b/gcc/cfgcleanup.c
@@ -2022,7 +2022,7 @@ try_crossjump_to_edge (int mode, edge e1, edge e2,
of matching instructions or the 'from' block was totally matched
(such that its predecessors will hopefully be redirected and the
block removed). */
- if ((nmatch < PARAM_VALUE (PARAM_MIN_CROSSJUMP_INSNS))
+ if ((nmatch < param_min_crossjump_insns)
&& (newpos1 != BB_HEAD (src1)))
return false;
@@ -2215,7 +2215,7 @@ try_crossjump_bb (int mode, basic_block bb)
a block that falls through into BB, as that adds no branches to the
program. We'll try that combination first. */
fallthru = NULL;
- max = PARAM_VALUE (PARAM_MAX_CROSSJUMP_EDGES);
+ max = param_max_crossjump_edges;
if (EDGE_COUNT (bb->preds) > max)
return false;
diff --git a/gcc/cfgexpand.c b/gcc/cfgexpand.c
index c34a53b526b..5fed0738211 100644
--- a/gcc/cfgexpand.c
+++ b/gcc/cfgexpand.c
@@ -1548,7 +1548,7 @@ defer_stack_allocation (tree var, bool toplevel)
bool smallish
= (poly_int_tree_p (size_unit, &size)
&& (estimated_poly_value (size)
- < PARAM_VALUE (PARAM_MIN_SIZE_FOR_STACK_SHARING)));
+ < param_min_size_for_stack_sharing));
/* If stack protection is enabled, *all* stack variables must be deferred,
so that we can re-order the strings to the top of the frame.
@@ -1788,7 +1788,7 @@ stack_protect_classify_type (tree type)
|| t == signed_char_type_node
|| t == unsigned_char_type_node)
{
- unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE);
+ unsigned HOST_WIDE_INT max = param_ssp_buffer_size;
unsigned HOST_WIDE_INT len;
if (!TYPE_SIZE_UNIT (type)
@@ -6435,7 +6435,7 @@ pass_expand::execute (function *fun)
warning (OPT_Wstack_protector,
"stack protector not protecting function: "
"all local arrays are less than %d bytes long",
- (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE));
+ (int) param_ssp_buffer_size);
}
/* Set up parameters and prepare for return, for the function. */
@@ -6545,7 +6545,7 @@ pass_expand::execute (function *fun)
/* If the function has too many markers, drop them while expanding. */
if (cfun->debug_marker_count
- >= PARAM_VALUE (PARAM_MAX_DEBUG_MARKER_COUNT))
+ >= param_max_debug_marker_count)
cfun->debug_nonbind_markers = false;
lab_rtx_for_bb = new hash_map<basic_block, rtx_code_label *>;
diff --git a/gcc/cfgloopanal.c b/gcc/cfgloopanal.c
index 95ec929c7bd..84516efcfb6 100644
--- a/gcc/cfgloopanal.c
+++ b/gcc/cfgloopanal.c
@@ -256,7 +256,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
else if (loop->latch && (loop->latch->count.initialized_p ()
|| loop->header->count.initialized_p ()))
@@ -274,7 +274,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
else if (!count_in.nonzero_p ())
{
@@ -295,7 +295,7 @@ expected_loop_iterations_unbounded (const class loop *loop,
{
if (by_profile_only)
return -1;
- expected = PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ expected = param_avg_loop_niter;
}
if (!by_profile_only)
@@ -427,7 +427,7 @@ estimate_reg_pressure_cost (unsigned n_new, unsigned n_old, bool speed,
if (optimize && (flag_ira_region == IRA_REGION_ALL
|| flag_ira_region == IRA_REGION_MIXED)
- && number_of_loops (cfun) <= (unsigned) IRA_MAX_LOOPS_NUM)
+ && number_of_loops (cfun) <= (unsigned) param_ira_max_loops_num)
/* IRA regional allocation deals with high register pressure
better. So decrease the cost (to do more accurate the cost
calculation for IRA, we need to know how many registers lives
diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index aa54e955c76..5497235b7d4 100644
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -2707,7 +2707,7 @@ cgraph_edge::maybe_hot_p (void)
if (count.apply_scale (2, 1) < where->count.apply_scale (3, 1))
return false;
}
- else if (count.apply_scale (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION), 1)
+ else if (count.apply_scale (param_hot_bb_frequency_fraction , 1)
< where->count)
return false;
return true;
diff --git a/gcc/combine.c b/gcc/combine.c
index 857ea30dafd..ae3bc468910 100644
--- a/gcc/combine.c
+++ b/gcc/combine.c
@@ -1251,7 +1251,7 @@ combine_instructions (rtx_insn *f, unsigned int nregs)
init_reg_last ();
setup_incoming_promotions (first);
last_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
- int max_combine = PARAM_VALUE (PARAM_MAX_COMBINE_INSNS);
+ int max_combine = param_max_combine_insns;
FOR_EACH_BB_FN (this_basic_block, cfun)
{
@@ -13282,7 +13282,7 @@ record_value_for_reg (rtx reg, rtx_insn *insn, rtx value)
{
/* If there are two or more occurrences of REG in VALUE,
prevent the value from growing too much. */
- if (count_rtxs (tem) > MAX_LAST_VALUE_RTL)
+ if (count_rtxs (tem) > param_max_last_value_rtl)
tem = gen_rtx_CLOBBER (GET_MODE (tem), const0_rtx);
}
diff --git a/gcc/common/config/aarch64/aarch64-common.c b/gcc/common/config/aarch64/aarch64-common.c
index 07c03253951..adb3ff71af8 100644
--- a/gcc/common/config/aarch64/aarch64-common.c
+++ b/gcc/common/config/aarch64/aarch64-common.c
@@ -73,7 +73,7 @@ static bool
aarch64_option_validate_param (const int value, const int param)
{
/* Check that both parameters are the same. */
- if (param == (int) PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE)
+ if (param == param_stack_clash_protection_guard_size)
{
if (value != 12 && value != 16)
{
@@ -93,18 +93,15 @@ static void
aarch64_option_default_params (void)
{
/* We assume the guard page is 64k. */
- int index = (int) PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE;
- set_default_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE,
- DEFAULT_STK_CLASH_GUARD_SIZE == 0
- ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE);
+ int index = (int) param_stack_clash_protection_guard_size;
+ param_stack_clash_protection_guard_size
+ = (DEFAULT_STK_CLASH_GUARD_SIZE == 0 ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE);
- int guard_size
- = default_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ int guard_size = param_stack_clash_protection_guard_size;
/* Set the interval parameter to be the same as the guard size. This way the
mid-end code does the right thing for us. */
- set_default_param_value (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL,
- guard_size);
+ param_stack_clash_protection_probe_interval = guard_size;
/* Validate the options. */
aarch64_option_validate_param (guard_size, index);
diff --git a/gcc/common/config/ia64/ia64-common.c b/gcc/common/config/ia64/ia64-common.c
index 02e297ad69b..0a187160fd2 100644
--- a/gcc/common/config/ia64/ia64-common.c
+++ b/gcc/common/config/ia64/ia64-common.c
@@ -88,13 +88,13 @@ static void
ia64_option_default_params (void)
{
/* Let the scheduler form additional regions. */
- set_default_param_value (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS, 2);
+ param_max_sched_extend_regions_iters = 2;
/* Set the default values for cache-related parameters. */
- set_default_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 6);
- set_default_param_value (PARAM_L1_CACHE_LINE_SIZE, 32);
+ param_simultaneous_prefetches = 6;
+ param_l1_cache_line_size = 32;
- set_default_param_value (PARAM_SCHED_MEM_TRUE_DEP_COST, 4);
+ param_sched_mem_true_dep_cost = 4;
}
#undef TARGET_OPTION_OPTIMIZATION_TABLE
diff --git a/gcc/common/config/powerpcspe/powerpcspe-common.c b/gcc/common/config/powerpcspe/powerpcspe-common.c
index c949a601f57..7043a4bda31 100644
--- a/gcc/common/config/powerpcspe/powerpcspe-common.c
+++ b/gcc/common/config/powerpcspe/powerpcspe-common.c
@@ -57,7 +57,7 @@ static void
rs6000_option_default_params (void)
{
/* Double growth factor to counter reduced min jump length. */
- set_default_param_value (PARAM_MAX_GROW_COPY_BB_INSNS, 16);
+ param_max_grow_copy_bb_insns = 16;
}
/* If not otherwise specified by a target, make 'long double' equivalent to
diff --git a/gcc/common/config/rs6000/rs6000-common.c b/gcc/common/config/rs6000/rs6000-common.c
index 9dc7ae87f43..1d39912443b 100644
--- a/gcc/common/config/rs6000/rs6000-common.c
+++ b/gcc/common/config/rs6000/rs6000-common.c
@@ -76,7 +76,7 @@ static void
rs6000_option_default_params (void)
{
/* Double growth factor to counter reduced min jump length. */
- set_default_param_value (PARAM_MAX_GROW_COPY_BB_INSNS, 16);
+ param_max_grow_copy_bb_insns = 16;
}
/* If not otherwise specified by a target, make 'long double' equivalent to
diff --git a/gcc/common/config/sh/sh-common.c b/gcc/common/config/sh/sh-common.c
index 4a92146f0af..e6ecc3a632a 100644
--- a/gcc/common/config/sh/sh-common.c
+++ b/gcc/common/config/sh/sh-common.c
@@ -149,7 +149,7 @@ sh_handle_option (struct gcc_options *opts,
static void
sh_option_default_params (void)
{
- set_default_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 2);
+ param_simultaneous_prefetches = 2;
}
#undef TARGET_OPTION_OPTIMIZATION_TABLE
diff --git a/gcc/config/aarch64/aarch64.c b/gcc/config/aarch64/aarch64.c
index 1dfff331a5a..c4783861c5d 100644
--- a/gcc/config/aarch64/aarch64.c
+++ b/gcc/config/aarch64/aarch64.c
@@ -5589,7 +5589,7 @@ aarch64_output_probe_stack_range (rtx reg1, rtx reg2)
ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, loop_lab);
HOST_WIDE_INT stack_clash_probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
/* TEST_ADDR = TEST_ADDR + PROBE_INTERVAL. */
xops[0] = reg1;
@@ -6842,7 +6842,7 @@ aarch64_allocate_and_probe_stack_space (rtx temp1, rtx temp2,
bool final_adjustment_p)
{
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
HOST_WIDE_INT guard_used_by_caller = STACK_CLASH_CALLER_GUARD;
HOST_WIDE_INT min_probe_threshold
= (final_adjustment_p
@@ -7364,7 +7364,7 @@ aarch64_expand_epilogue (bool for_sibcall)
for each allocation. For stack clash we are in a usable state if
the adjustment is less than GUARD_SIZE - GUARD_USED_BY_CALLER. */
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
HOST_WIDE_INT guard_used_by_caller = STACK_CLASH_CALLER_GUARD;
/* We can re-use the registers when:
@@ -13306,73 +13306,62 @@ aarch64_override_options_internal (struct gcc_options *opts)
/* We don't mind passing in global_options_set here as we don't use
the *options_set structs anyway. */
- maybe_set_param_value (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH,
- queue_depth,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_sched_autopref_queue_depth, queue_depth);
/* Set up parameters to be used in prefetching algorithm. Do not
override the defaults unless we are tuning for a core we have
researched values for. */
if (aarch64_tune_params.prefetch->num_slots > 0)
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- aarch64_tune_params.prefetch->num_slots,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_simultaneous_prefetches,
+ aarch64_tune_params.prefetch->num_slots);
if (aarch64_tune_params.prefetch->l1_cache_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- aarch64_tune_params.prefetch->l1_cache_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l1_cache_size,
+ aarch64_tune_params.prefetch->l1_cache_size);
if (aarch64_tune_params.prefetch->l1_cache_line_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- aarch64_tune_params.prefetch->l1_cache_line_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l1_cache_line_size,
+ aarch64_tune_params.prefetch->l1_cache_line_size);
if (aarch64_tune_params.prefetch->l2_cache_size >= 0)
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- aarch64_tune_params.prefetch->l2_cache_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_l2_cache_size,
+ aarch64_tune_params.prefetch->l2_cache_size);
if (!aarch64_tune_params.prefetch->prefetch_dynamic_strides)
- maybe_set_param_value (PARAM_PREFETCH_DYNAMIC_STRIDES,
- 0,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_prefetch_dynamic_strides, 0);
if (aarch64_tune_params.prefetch->minimum_stride >= 0)
- maybe_set_param_value (PARAM_PREFETCH_MINIMUM_STRIDE,
- aarch64_tune_params.prefetch->minimum_stride,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_prefetch_minimum_stride,
+ aarch64_tune_params.prefetch->minimum_stride);
/* Use the alternative scheduling-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM, SCHED_PRESSURE_MODEL,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_sched_pressure_algorithm,
+ SCHED_PRESSURE_MODEL);
/* If the user hasn't changed it via configure then set the default to 64 KB
for the backend. */
- maybe_set_param_value (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE,
- DEFAULT_STK_CLASH_GUARD_SIZE == 0
- ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_stack_clash_protection_guard_size,
+ (DEFAULT_STK_CLASH_GUARD_SIZE == 0
+ ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE));
/* Validate the guard size. */
- int guard_size = PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ int guard_size = param_stack_clash_protection_guard_size;
/* Enforce that interval is the same size as size so the mid-end does the
right thing. */
- maybe_set_param_value (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL,
- guard_size,
- opts->x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (opts, &global_options_set,
+ param_stack_clash_protection_probe_interval,
+ guard_size);
/* The maybe_set calls won't update the value if the user has explicitly set
one. Which means we need to validate that probing interval and guard size
are equal. */
int probe_interval
- = PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = param_stack_clash_protection_probe_interval;
if (guard_size != probe_interval)
error ("stack clash guard size %<%d%> must be equal to probing interval "
"%<%d%>", guard_size, probe_interval);
diff --git a/gcc/config/alpha/alpha.c b/gcc/config/alpha/alpha.c
index a7d5454b574..8f389ead32d 100644
--- a/gcc/config/alpha/alpha.c
+++ b/gcc/config/alpha/alpha.c
@@ -68,6 +68,7 @@ along with GCC; see the file COPYING3. If not see
#include "builtins.h"
#include "rtl-iter.h"
#include "flags.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -484,17 +485,14 @@ alpha_option_override (void)
}
if (line_size)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE, line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size, line_size);
if (l1_size)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, l1_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size, l1_size);
if (l2_size)
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, l2_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size, l2_size);
/* Do some sanity checks on the above options. */
diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
index 7c9cdbd7a46..ca7fd9020b8 100644
--- a/gcc/config/arm/arm.c
+++ b/gcc/config/arm/arm.c
@@ -3524,9 +3524,8 @@ arm_option_override (void)
but measurable, size reduction for PIC code. Therefore, we decrease
the bar for unrestricted expression hoisting to the cost of PIC address
calculation, which is 2 instructions. */
- maybe_set_param_value (PARAM_GCSE_UNRESTRICTED_COST, 2,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_gcse_unrestricted_cost, 2);
/* ARM EABI defaults to strict volatile bitfields. */
if (TARGET_AAPCS_BASED && flag_strict_volatile_bitfields < 0
@@ -3546,47 +3545,43 @@ arm_option_override (void)
override the defaults unless we are tuning for a core we have
researched values for. */
if (current_tune->prefetch.num_slots > 0)
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- current_tune->prefetch.num_slots,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ current_tune->prefetch.num_slots);
if (current_tune->prefetch.l1_cache_line_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- current_tune->prefetch.l1_cache_line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ current_tune->prefetch.l1_cache_line_size);
if (current_tune->prefetch.l1_cache_size >= 0)
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- current_tune->prefetch.l1_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ current_tune->prefetch.l1_cache_size);
/* Look through ready list and all of queue for instructions
relevant for L2 auto-prefetcher. */
- int param_sched_autopref_queue_depth;
+ int sched_autopref_queue_depth;
switch (current_tune->sched_autopref)
{
case tune_params::SCHED_AUTOPREF_OFF:
- param_sched_autopref_queue_depth = -1;
+ sched_autopref_queue_depth = -1;
break;
case tune_params::SCHED_AUTOPREF_RANK:
- param_sched_autopref_queue_depth = 0;
+ sched_autopref_queue_depth = 0;
break;
case tune_params::SCHED_AUTOPREF_FULL:
- param_sched_autopref_queue_depth = max_insn_queue_index + 1;
+ sched_autopref_queue_depth = max_insn_queue_index + 1;
break;
default:
gcc_unreachable ();
}
- maybe_set_param_value (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH,
- param_sched_autopref_queue_depth,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_sched_autopref_queue_depth,
+ sched_autopref_queue_depth);
/* Currently, for slow flash data, we just disable literal pools. We also
disable it for pure-code. */
@@ -31748,8 +31743,6 @@ arm_valid_target_attribute_p (tree fndecl, tree ARG_UNUSED (name),
DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl) = new_optimize;
- finalize_options_struct (&func_options);
-
return ret;
}
diff --git a/gcc/config/i386/i386-options.c b/gcc/config/i386/i386-options.c
index dfc8ae23ba0..72cd6dcc98c 100644
--- a/gcc/config/i386/i386-options.c
+++ b/gcc/config/i386/i386-options.c
@@ -2618,22 +2618,14 @@ ix86_option_override_internal (bool main_args_p,
if (!TARGET_SCHEDULE)
opts->x_flag_schedule_insns_after_reload = opts->x_flag_schedule_insns = 0;
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- ix86_tune_cost->simultaneous_prefetches,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- ix86_tune_cost->prefetch_block,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- ix86_tune_cost->l1_cache_size,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- ix86_tune_cost->l2_cache_size,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_simultaneous_prefetches,
+ ix86_tune_cost->simultaneous_prefetches);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_line_size,
+ ix86_tune_cost->prefetch_block);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_size,
+ ix86_tune_cost->l1_cache_size);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l2_cache_size,
+ ix86_tune_cost->l2_cache_size);
/* Enable sw prefetching at -O3 for CPUS that prefetching is helpful. */
if (opts->x_flag_prefetch_loop_arrays < 0
@@ -2868,13 +2860,9 @@ ix86_option_override_internal (bool main_args_p,
= (cf_protection_level) (opts->x_flag_cf_protection | CF_SET);
if (ix86_tune_features [X86_TUNE_AVOID_256FMA_CHAINS])
- maybe_set_param_value (PARAM_AVOID_FMA_MAX_BITS, 256,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_avoid_fma_max_bits, 256);
else if (ix86_tune_features [X86_TUNE_AVOID_128FMA_CHAINS])
- maybe_set_param_value (PARAM_AVOID_FMA_MAX_BITS, 128,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_avoid_fma_max_bits, 128);
/* PR86952: jump table usage with retpolines is slow.
The PR provides some numbers about the slowness. */
diff --git a/gcc/config/i386/i386.c b/gcc/config/i386/i386.c
index 03a7082d2fc..f775697f982 100644
--- a/gcc/config/i386/i386.c
+++ b/gcc/config/i386/i386.c
@@ -5773,7 +5773,7 @@ get_probe_interval (void)
{
if (flag_stack_clash_protection)
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL));
+ << param_stack_clash_protection_probe_interval);
else
return (HOST_WIDE_INT_1U << STACK_CHECK_PROBE_INTERVAL_EXP);
}
@@ -6942,7 +6942,7 @@ ix86_adjust_stack_and_probe_stack_clash (HOST_WIDE_INT size,
/* If we allocate less than the size of the guard statically,
then no probing is necessary, but we do need to allocate
the stack. */
- if (size < (1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE)))
+ if (size < (1 << param_stack_clash_protection_guard_size))
{
pro_epilogue_adjust_stack (stack_pointer_rtx, stack_pointer_rtx,
GEN_INT (-size), -1,
@@ -21468,18 +21468,18 @@ static unsigned int
ix86_max_noce_ifcvt_seq_cost (edge e)
{
bool predictable_p = predictable_edge_p (e);
-
- enum compiler_param param
- = (predictable_p
- ? PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST
- : PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST);
-
- /* If we have a parameter set, use that, otherwise take a guess using
- BRANCH_COST. */
- if (global_options_set.x_param_values[param])
- return PARAM_VALUE (param);
+ if (predictable_p)
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_predictable_cost)
+ return param_max_rtl_if_conversion_predictable_cost;
+ }
else
- return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (2);
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_unpredictable_cost)
+ return param_max_rtl_if_conversion_unpredictable_cost;
+ }
+
+ return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (2);
}
/* Return true if SEQ is a good candidate as a replacement for the
diff --git a/gcc/config/ia64/ia64.c b/gcc/config/ia64/ia64.c
index 7697e907aea..44f7f2eea06 100644
--- a/gcc/config/ia64/ia64.c
+++ b/gcc/config/ia64/ia64.c
@@ -7307,7 +7307,7 @@ ia64_adjust_cost (rtx_insn *insn, int dep_type1, rtx_insn *dep_insn,
if (dw == MIN_DEP_WEAK)
/* Store and load are likely to alias, use higher cost to avoid stall. */
- return PARAM_VALUE (PARAM_SCHED_MEM_TRUE_DEP_COST);
+ return param_sched_mem_true_dep_cost;
else if (dw > MIN_DEP_WEAK)
{
/* Store and load are less likely to alias. */
diff --git a/gcc/config/rs6000/rs6000-logue.c b/gcc/config/rs6000/rs6000-logue.c
index 04aae8052db..f0fd2065c02 100644
--- a/gcc/config/rs6000/rs6000-logue.c
+++ b/gcc/config/rs6000/rs6000-logue.c
@@ -1515,14 +1515,14 @@ static HOST_WIDE_INT
get_stack_clash_protection_probe_interval (void)
{
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL));
+ << param_stack_clash_protection_probe_interval);
}
static HOST_WIDE_INT
get_stack_clash_protection_guard_size (void)
{
return (HOST_WIDE_INT_1U
- << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE));
+ << param_stack_clash_protection_guard_size);
}
/* Allocate ORIG_SIZE bytes on the stack and probe the newly
diff --git a/gcc/config/rs6000/rs6000.c b/gcc/config/rs6000/rs6000.c
index 32101b77ea3..4c830fcfba3 100644
--- a/gcc/config/rs6000/rs6000.c
+++ b/gcc/config/rs6000/rs6000.c
@@ -80,6 +80,7 @@
#include "tree-vrp.h"
#include "tree-ssanames.h"
#include "rs6000-internal.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -4514,34 +4515,29 @@ rs6000_option_override_internal (bool global_init_p)
if (global_init_p)
{
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- rs6000_cost->simultaneous_prefetches,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, rs6000_cost->l1_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- rs6000_cost->cache_line_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, rs6000_cost->l2_cache_size,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ rs6000_cost->simultaneous_prefetches);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ rs6000_cost->l1_cache_size);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ rs6000_cost->cache_line_size);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size,
+ rs6000_cost->l2_cache_size);
/* Increase loop peeling limits based on performance analysis. */
- maybe_set_param_value (PARAM_MAX_PEELED_INSNS, 400,
- global_options.x_param_values,
- global_options_set.x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEELED_INSNS, 400,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_peeled_insns, 400);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_max_completely_peeled_insns, 400);
/* Use the 'model' -fsched-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM,
- SCHED_PRESSURE_MODEL,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_sched_pressure_algorithm,
+ SCHED_PRESSURE_MODEL);
/* Explicit -funroll-loops turns -munroll-only-small-loops off. */
if (((global_options_set.x_flag_unroll_loops && flag_unroll_loops)
diff --git a/gcc/config/s390/s390.c b/gcc/config/s390/s390.c
index ff0b43c2c29..b3a75222ac2 100644
--- a/gcc/config/s390/s390.c
+++ b/gcc/config/s390/s390.c
@@ -10968,9 +10968,9 @@ allocate_stack_space (rtx size, HOST_WIDE_INT last_probe_offset,
{
bool temp_reg_clobbered_p = false;
HOST_WIDE_INT probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
HOST_WIDE_INT guard_size
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_GUARD_SIZE);
+ = 1 << param_stack_clash_protection_guard_size;
if (flag_stack_clash_protection)
{
@@ -11086,7 +11086,7 @@ s390_emit_prologue (void)
only exception is when TARGET_BACKCHAIN is active, in which case
we know *sp (offset 0) was written. */
HOST_WIDE_INT probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
HOST_WIDE_INT last_probe_offset
= (TARGET_BACKCHAIN
? (TARGET_PACKED_STACK ? STACK_POINTER_OFFSET - UNITS_PER_LONG : 0)
@@ -15264,10 +15264,8 @@ s390_option_override_internal (struct gcc_options *opts,
displacements. Trim that value down to 4k if that happens. This
might result in too many probes being generated only on the
oldest supported machine level z900. */
- if (!DISP_IN_RANGE ((1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL))))
- set_param_value ("stack-clash-protection-probe-interval", 12,
- opts->x_param_values,
- opts_set->x_param_values);
+ if (!DISP_IN_RANGE ((1 << param_stack_clash_protection_probe_interval)))
+ param_stack_clash_protection_probe_interval = 12;
#ifdef TARGET_DEFAULT_LONG_DOUBLE_128
if (!TARGET_LONG_DOUBLE_128_P (opts_set->x_target_flags))
@@ -15276,62 +15274,37 @@ s390_option_override_internal (struct gcc_options *opts,
if (opts->x_s390_tune >= PROCESSOR_2097_Z10)
{
- maybe_set_param_value (PARAM_MAX_UNROLLED_INSNS, 100,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_UNROLL_TIMES, 32,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEELED_INSNS, 2000,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_MAX_COMPLETELY_PEEL_TIMES, 64,
- opts->x_param_values,
- opts_set->x_param_values);
- }
-
- maybe_set_param_value (PARAM_MAX_PENDING_LIST_LENGTH, 256,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_unrolled_insns,
+ 100);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_unroll_times, 32);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_completely_peeled_insns,
+ 2000);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_completely_peel_times,
+ 64);
+ }
+
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_pending_list_length,
+ 256);
/* values for loop prefetching */
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE, 256,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_L1_CACHE_SIZE, 128,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_line_size, 256);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l1_cache_size, 128);
/* s390 has more than 2 levels and the size is much larger. Since
we are always running virtualized assume that we only get a small
part of the caches above l1. */
- maybe_set_param_value (PARAM_L2_CACHE_SIZE, 1500,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO, 2,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES, 6,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_l2_cache_size, 1500);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_prefetch_min_insn_to_mem_ratio, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_simultaneous_prefetches, 6);
/* Use the alternative scheduling-pressure algorithm by default. */
- maybe_set_param_value (PARAM_SCHED_PRESSURE_ALGORITHM, 2,
- opts->x_param_values,
- opts_set->x_param_values);
-
- maybe_set_param_value (PARAM_MIN_VECT_LOOP_BOUND, 2,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_sched_pressure_algorithm, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_min_vect_loop_bound, 2);
/* Use aggressive inlining parameters. */
if (opts->x_s390_tune >= PROCESSOR_2964_Z13)
{
- maybe_set_param_value (PARAM_INLINE_MIN_SPEEDUP, 2,
- opts->x_param_values,
- opts_set->x_param_values);
-
- maybe_set_param_value (PARAM_MAX_INLINE_INSNS_AUTO, 80,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_inline_min_speedup, 2);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_inline_insns_auto, 80);
}
/* Set the default alignment. */
diff --git a/gcc/config/sparc/sparc.c b/gcc/config/sparc/sparc.c
index 75b3d4ef499..50385518b1b 100644
--- a/gcc/config/sparc/sparc.c
+++ b/gcc/config/sparc/sparc.c
@@ -61,6 +61,7 @@ along with GCC; see the file COPYING3. If not see
#include "context.h"
#include "builtins.h"
#include "tree-vector-builder.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -2010,7 +2011,7 @@ sparc_option_override (void)
gcc_unreachable ();
};
- /* PARAM_SIMULTANEOUS_PREFETCHES is the number of prefetches that
+ /* param_simultaneous_prefetches is the number of prefetches that
can run at the same time. More important, it is the threshold
defining when additional prefetches will be dropped by the
hardware.
@@ -2033,21 +2034,20 @@ sparc_option_override (void)
single-threaded program. Experimental results show that setting
this parameter to 32 works well when the number of threads is not
high. */
- maybe_set_param_value (PARAM_SIMULTANEOUS_PREFETCHES,
- ((sparc_cpu == PROCESSOR_ULTRASPARC
- || sparc_cpu == PROCESSOR_NIAGARA
- || sparc_cpu == PROCESSOR_NIAGARA2
- || sparc_cpu == PROCESSOR_NIAGARA3
- || sparc_cpu == PROCESSOR_NIAGARA4)
- ? 2
- : (sparc_cpu == PROCESSOR_ULTRASPARC3
- ? 8 : ((sparc_cpu == PROCESSOR_NIAGARA7
- || sparc_cpu == PROCESSOR_M8)
- ? 32 : 3))),
- global_options.x_param_values,
- global_options_set.x_param_values);
-
- /* PARAM_L1_CACHE_LINE_SIZE is the size of the L1 cache line, in
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_simultaneous_prefetches,
+ ((sparc_cpu == PROCESSOR_ULTRASPARC
+ || sparc_cpu == PROCESSOR_NIAGARA
+ || sparc_cpu == PROCESSOR_NIAGARA2
+ || sparc_cpu == PROCESSOR_NIAGARA3
+ || sparc_cpu == PROCESSOR_NIAGARA4)
+ ? 2
+ : (sparc_cpu == PROCESSOR_ULTRASPARC3
+ ? 8 : ((sparc_cpu == PROCESSOR_NIAGARA7
+ || sparc_cpu == PROCESSOR_M8)
+ ? 32 : 3))));
+
+ /* param_l1_cache_line_size is the size of the L1 cache line, in
bytes.
The Oracle SPARC Architecture (previously the UltraSPARC
@@ -2064,38 +2064,33 @@ sparc_option_override (void)
L2 and L3, but only 32B are brought into the L1D$. (Assuming it
is a read_n prefetch, which is the only type which allocates to
the L1.) */
- maybe_set_param_value (PARAM_L1_CACHE_LINE_SIZE,
- (sparc_cpu == PROCESSOR_M8
- ? 64 : 32),
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_line_size,
+ (sparc_cpu == PROCESSOR_M8 ? 64 : 32));
- /* PARAM_L1_CACHE_SIZE is the size of the L1D$ (most SPARC chips use
+ /* param_l1_cache_size is the size of the L1D$ (most SPARC chips use
Hardvard level-1 caches) in kilobytes. Both UltraSPARC and
Niagara processors feature a L1D$ of 16KB. */
- maybe_set_param_value (PARAM_L1_CACHE_SIZE,
- ((sparc_cpu == PROCESSOR_ULTRASPARC
- || sparc_cpu == PROCESSOR_ULTRASPARC3
- || sparc_cpu == PROCESSOR_NIAGARA
- || sparc_cpu == PROCESSOR_NIAGARA2
- || sparc_cpu == PROCESSOR_NIAGARA3
- || sparc_cpu == PROCESSOR_NIAGARA4
- || sparc_cpu == PROCESSOR_NIAGARA7
- || sparc_cpu == PROCESSOR_M8)
- ? 16 : 64),
- global_options.x_param_values,
- global_options_set.x_param_values);
-
-
- /* PARAM_L2_CACHE_SIZE is the size fo the L2 in kilobytes. Note
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l1_cache_size,
+ ((sparc_cpu == PROCESSOR_ULTRASPARC
+ || sparc_cpu == PROCESSOR_ULTRASPARC3
+ || sparc_cpu == PROCESSOR_NIAGARA
+ || sparc_cpu == PROCESSOR_NIAGARA2
+ || sparc_cpu == PROCESSOR_NIAGARA3
+ || sparc_cpu == PROCESSOR_NIAGARA4
+ || sparc_cpu == PROCESSOR_NIAGARA7
+ || sparc_cpu == PROCESSOR_M8)
+ ? 16 : 64));
+
+ /* param_l2_cache_size is the size fo the L2 in kilobytes. Note
that 512 is the default in params.def. */
- maybe_set_param_value (PARAM_L2_CACHE_SIZE,
- ((sparc_cpu == PROCESSOR_NIAGARA4
- || sparc_cpu == PROCESSOR_M8)
- ? 128 : (sparc_cpu == PROCESSOR_NIAGARA7
- ? 256 : 512)),
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_l2_cache_size,
+ ((sparc_cpu == PROCESSOR_NIAGARA4
+ || sparc_cpu == PROCESSOR_M8)
+ ? 128 : (sparc_cpu == PROCESSOR_NIAGARA7
+ ? 256 : 512)));
/* Disable save slot sharing for call-clobbered registers by default.
diff --git a/gcc/config/visium/visium.c b/gcc/config/visium/visium.c
index 8477008320c..b1ace70b5f7 100644
--- a/gcc/config/visium/visium.c
+++ b/gcc/config/visium/visium.c
@@ -57,6 +57,7 @@
#include "tree-pass.h"
#include "context.h"
#include "builtins.h"
+#include "opts.h"
/* This file should be included last. */
#include "target-def.h"
@@ -457,9 +458,8 @@ visium_option_override (void)
/* Allow the size of compilation units to double because of inlining.
In practice the global size of the object code is hardly affected
because the additional instructions will take up the padding. */
- maybe_set_param_value (PARAM_INLINE_UNIT_GROWTH, 100,
- global_options.x_param_values,
- global_options_set.x_param_values);
+ SET_OPTION_IF_UNSET (&global_options, &global_options_set,
+ param_inline_unit_growth, 100);
}
/* Likewise for loops. */
diff --git a/gcc/coverage.c b/gcc/coverage.c
index bcba61c9a9a..ebe27a323b2 100644
--- a/gcc/coverage.c
+++ b/gcc/coverage.c
@@ -324,7 +324,7 @@ get_coverage_counts (unsigned counter, unsigned cfg_checksum,
}
return NULL;
}
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
elt.ident = current_function_funcdef_no + 1;
else
{
@@ -560,7 +560,7 @@ coverage_compute_profile_id (struct cgraph_node *n)
{
expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (n->decl));
- bool use_name_only = (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID) == 0);
+ bool use_name_only = (param_profile_func_internal_id == 0);
chksum = (use_name_only ? 0 : xloc.line);
if (xloc.file)
@@ -628,7 +628,7 @@ coverage_begin_function (unsigned lineno_checksum, unsigned cfg_checksum)
/* Announce function */
offset = gcov_write_tag (GCOV_TAG_FUNCTION);
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
gcov_write_unsigned (current_function_funcdef_no + 1);
else
{
@@ -682,7 +682,7 @@ coverage_end_function (unsigned lineno_checksum, unsigned cfg_checksum)
item = ggc_alloc<coverage_data> ();
- if (PARAM_VALUE (PARAM_PROFILE_FUNC_INTERNAL_ID))
+ if (param_profile_func_internal_id)
item->ident = current_function_funcdef_no + 1;
else
{
diff --git a/gcc/cp/name-lookup.c b/gcc/cp/name-lookup.c
index cd0d9551aa3..be846a12141 100644
--- a/gcc/cp/name-lookup.c
+++ b/gcc/cp/name-lookup.c
@@ -5358,7 +5358,7 @@ namespace_hints::namespace_hints (location_t loc, tree name)
m_candidates = vNULL;
m_limited = false;
- m_limit = PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP);
+ m_limit = param_cxx_max_namespaces_for_diagnostic_help;
/* Breadth-first search of namespaces. Up to limit namespaces
searched (limit zero == unlimited). */
diff --git a/gcc/cp/typeck.c b/gcc/cp/typeck.c
index ff603f3d8d9..d3e70311229 100644
--- a/gcc/cp/typeck.c
+++ b/gcc/cp/typeck.c
@@ -1498,7 +1498,7 @@ comptypes (tree t1, tree t2, int strict)
perform a deep check. */
return structural_comptypes (t1, t2, strict);
- if (flag_checking && USE_CANONICAL_TYPES)
+ if (flag_checking && param_use_canonical_types)
{
bool result = structural_comptypes (t1, t2, strict);
@@ -1519,7 +1519,7 @@ comptypes (tree t1, tree t2, int strict)
return result;
}
- if (!flag_checking && USE_CANONICAL_TYPES)
+ if (!flag_checking && param_use_canonical_types)
return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
else
return structural_comptypes (t1, t2, strict);
diff --git a/gcc/cse.c b/gcc/cse.c
index 097fb94e773..b1c0276b0f7 100644
--- a/gcc/cse.c
+++ b/gcc/cse.c
@@ -6414,7 +6414,7 @@ cse_find_path (basic_block first_bb, struct cse_basic_block_data *data,
if (follow_jumps)
{
bb = data->path[path_size - 1].bb;
- while (bb && path_size < PARAM_VALUE (PARAM_MAX_CSE_PATH_LENGTH))
+ while (bb && path_size < param_max_cse_path_length)
{
if (single_succ_p (bb))
e = single_succ_edge (bb);
@@ -6592,7 +6592,7 @@ cse_extended_basic_block (struct cse_basic_block_data *ebb_data)
FIXME: This is a real kludge and needs to be done some other
way. */
if (NONDEBUG_INSN_P (insn)
- && num_insns++ > PARAM_VALUE (PARAM_MAX_CSE_INSNS))
+ && num_insns++ > param_max_cse_insns)
{
flush_hash_table ();
num_insns = 0;
@@ -6736,7 +6736,7 @@ cse_main (rtx_insn *f ATTRIBUTE_UNUSED, int nregs)
init_cse_reg_info (nregs);
ebb_data.path = XNEWVEC (struct branch_path,
- PARAM_VALUE (PARAM_MAX_CSE_PATH_LENGTH));
+ param_max_cse_path_length);
cse_cfg_altered = false;
cse_jumps_altered = false;
diff --git a/gcc/cselib.c b/gcc/cselib.c
index 500793ba40e..1745256944a 100644
--- a/gcc/cselib.c
+++ b/gcc/cselib.c
@@ -2297,7 +2297,7 @@ cselib_invalidate_mem (rtx mem_rtx)
p = &(*p)->next;
continue;
}
- if (num_mems < PARAM_VALUE (PARAM_MAX_CSELIB_MEMORY_LOCATIONS)
+ if (num_mems < param_max_cselib_memory_locations
&& ! canon_anti_dependence (x, false, mem_rtx,
GET_MODE (mem_rtx), mem_addr))
{
diff --git a/gcc/dse.c b/gcc/dse.c
index 5d8c6f990ec..76abd873c78 100644
--- a/gcc/dse.c
+++ b/gcc/dse.c
@@ -2657,7 +2657,7 @@ dse_step1 (void)
/* For -O1 reduce the maximum number of active local stores for RTL DSE
since this can consume huge amounts of memory (PR89115). */
- int max_active_local_stores = PARAM_VALUE (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES);
+ int max_active_local_stores = param_max_dse_active_local_stores;
if (optimize < 2)
max_active_local_stores /= 10;
diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c
index feff49aa44f..5f3e549a7fe 100644
--- a/gcc/emit-rtl.c
+++ b/gcc/emit-rtl.c
@@ -2762,15 +2762,15 @@ set_new_first_and_last_insn (rtx_insn *first, rtx_insn *last)
set_last_insn (last);
cur_insn_uid = 0;
- if (MIN_NONDEBUG_INSN_UID || MAY_HAVE_DEBUG_INSNS)
+ if (param_min_nondebug_insn_uid || MAY_HAVE_DEBUG_INSNS)
{
int debug_count = 0;
- cur_insn_uid = MIN_NONDEBUG_INSN_UID - 1;
+ cur_insn_uid = param_min_nondebug_insn_uid - 1;
cur_debug_insn_uid = 0;
for (insn = first; insn; insn = NEXT_INSN (insn))
- if (INSN_UID (insn) < MIN_NONDEBUG_INSN_UID)
+ if (INSN_UID (insn) < param_min_nondebug_insn_uid)
cur_debug_insn_uid = MAX (cur_debug_insn_uid, INSN_UID (insn));
else
{
@@ -2780,7 +2780,7 @@ set_new_first_and_last_insn (rtx_insn *first, rtx_insn *last)
}
if (debug_count)
- cur_debug_insn_uid = MIN_NONDEBUG_INSN_UID + debug_count;
+ cur_debug_insn_uid = param_min_nondebug_insn_uid + debug_count;
else
cur_debug_insn_uid++;
}
@@ -3445,10 +3445,10 @@ get_max_insn_count (void)
differences due to debug insns, and not be affected by
-fmin-insn-uid, to avoid excessive table size and to simplify
debugging of -fcompare-debug failures. */
- if (cur_debug_insn_uid > MIN_NONDEBUG_INSN_UID)
+ if (cur_debug_insn_uid > param_min_nondebug_insn_uid)
n -= cur_debug_insn_uid;
else
- n -= MIN_NONDEBUG_INSN_UID;
+ n -= param_min_nondebug_insn_uid;
return n;
}
@@ -4085,7 +4085,7 @@ make_debug_insn_raw (rtx pattern)
insn = as_a <rtx_debug_insn *> (rtx_alloc (DEBUG_INSN));
INSN_UID (insn) = cur_debug_insn_uid++;
- if (cur_debug_insn_uid > MIN_NONDEBUG_INSN_UID)
+ if (cur_debug_insn_uid > param_min_nondebug_insn_uid)
INSN_UID (insn) = cur_insn_uid++;
PATTERN (insn) = pattern;
@@ -5860,8 +5860,8 @@ init_emit (void)
{
set_first_insn (NULL);
set_last_insn (NULL);
- if (MIN_NONDEBUG_INSN_UID)
- cur_insn_uid = MIN_NONDEBUG_INSN_UID;
+ if (param_min_nondebug_insn_uid)
+ cur_insn_uid = param_min_nondebug_insn_uid;
else
cur_insn_uid = 1;
cur_debug_insn_uid = 1;
diff --git a/gcc/explow.c b/gcc/explow.c
index 83c786366c1..93e31cc3ba1 100644
--- a/gcc/explow.c
+++ b/gcc/explow.c
@@ -1837,7 +1837,7 @@ compute_stack_clash_protection_loop_data (rtx *rounded_size, rtx *last_addr,
{
/* Round SIZE down to STACK_CLASH_PROTECTION_PROBE_INTERVAL */
*probe_interval
- = 1 << PARAM_VALUE (PARAM_STACK_CLASH_PROTECTION_PROBE_INTERVAL);
+ = 1 << param_stack_clash_protection_probe_interval;
*rounded_size = simplify_gen_binary (AND, Pmode, size,
GEN_INT (-*probe_interval));
diff --git a/gcc/final.c b/gcc/final.c
index 7cf9ef1effd..3b9a88dc8a7 100644
--- a/gcc/final.c
+++ b/gcc/final.c
@@ -657,7 +657,7 @@ compute_alignments (void)
}
loop_optimizer_init (AVOID_CFG_MODIFICATIONS);
profile_count count_threshold = cfun->cfg->count_max.apply_scale
- (1, PARAM_VALUE (PARAM_ALIGN_THRESHOLD));
+ (1, param_align_threshold);
if (dump_file)
{
@@ -743,7 +743,7 @@ compute_alignments (void)
&& branch_count + fallthru_count > count_threshold
&& (branch_count
> fallthru_count.apply_scale
- (PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS), 1)))
+ (param_align_loop_iterations, 1)))
{
align_flags alignment = LOOP_ALIGN (label);
if (dump_file)
diff --git a/gcc/fold-const.c b/gcc/fold-const.c
index 52cb2383db2..542cc018656 100644
--- a/gcc/fold-const.c
+++ b/gcc/fold-const.c
@@ -5929,9 +5929,9 @@ fold_range_test (location_t loc, enum tree_code code, tree type,
short-circuited branch and the underlying object on both sides
is the same, make a non-short-circuit operation. */
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (logical_op_non_short_circuit
&& !flag_sanitize_coverage
&& lhs != 0 && rhs != 0
@@ -8600,9 +8600,9 @@ fold_truth_andor (location_t loc, enum tree_code code, tree type,
return tem;
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (logical_op_non_short_circuit
&& !flag_sanitize_coverage
&& (code == TRUTH_AND_EXPR
@@ -13365,7 +13365,7 @@ tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p, int depth)
would not, passes that need this information could be revised
to provide it through dataflow propagation. */
return (!name_registered_for_update_p (t)
- && depth < PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH)
+ && depth < param_max_ssa_name_query_depth
&& gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t),
strict_overflow_p, depth));
@@ -14013,7 +14013,7 @@ integer_valued_real_single_p (tree t, int depth)
would not, passes that need this information could be revised
to provide it through dataflow propagation. */
return (!name_registered_for_update_p (t)
- && depth < PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH)
+ && depth < param_max_ssa_name_query_depth
&& gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t),
depth));
diff --git a/gcc/gcse.c b/gcc/gcse.c
index aeb59c645e1..0ae39e44b01 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -799,10 +799,10 @@ want_to_gcse_p (rtx x, machine_mode mode, HOST_WIDE_INT *max_distance_ptr)
&& optimize_function_for_size_p (cfun));
cost = set_src_cost (x, mode, 0);
- if (cost < COSTS_N_INSNS (GCSE_UNRESTRICTED_COST))
+ if (cost < COSTS_N_INSNS (param_gcse_unrestricted_cost))
{
max_distance
- = ((HOST_WIDE_INT)GCSE_COST_DISTANCE_RATIO * cost) / 10;
+ = ((HOST_WIDE_INT)param_gcse_cost_distance_ratio * cost) / 10;
if (max_distance == 0)
return 0;
@@ -1844,7 +1844,7 @@ prune_insertions_deletions (int n_elems)
PRUNE_EXPRS. */
for (j = 0; j < (unsigned) n_elems; j++)
if (deletions[j]
- && ((unsigned) insertions[j] / deletions[j]) > MAX_GCSE_INSERTION_RATIO)
+ && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
bitmap_set_bit (prune_exprs, j);
/* Now prune PRE_INSERT_MAP and PRE_DELETE_MAP based on PRUNE_EXPRS. */
@@ -3133,7 +3133,8 @@ hoist_code (void)
expressions, nothing gets hoisted from the entry block. */
FOR_EACH_VEC_ELT (dom_tree_walk, dom_tree_walk_index, bb)
{
- domby = get_dominated_to_depth (CDI_DOMINATORS, bb, MAX_HOIST_DEPTH);
+ domby = get_dominated_to_depth (CDI_DOMINATORS, bb,
+ param_max_hoist_depth);
if (domby.length () == 0)
continue;
@@ -3982,9 +3983,9 @@ update_ld_motion_stores (struct gcse_expr * expr)
bool
gcse_or_cprop_is_too_expensive (const char *pass)
{
- unsigned int memory_request = (n_basic_blocks_for_fn (cfun)
- * SBITMAP_SET_SIZE (max_reg_num ())
- * sizeof (SBITMAP_ELT_TYPE));
+ int memory_request = (n_basic_blocks_for_fn (cfun)
+ * SBITMAP_SET_SIZE (max_reg_num ())
+ * sizeof (SBITMAP_ELT_TYPE));
/* Trying to perform global optimizations on flow graphs which have
a high connectivity will take a long time and is unlikely to be
@@ -4007,7 +4008,7 @@ gcse_or_cprop_is_too_expensive (const char *pass)
/* If allocating memory for the dataflow bitmaps would take up too much
storage it's better just to disable the optimization. */
- if (memory_request > MAX_GCSE_MEMORY)
+ if (memory_request > param_max_gcse_memory)
{
warning (OPT_Wdisabled_optimization,
"%s: %d basic blocks and %d registers; "
diff --git a/gcc/ggc-common.c b/gcc/ggc-common.c
index f94c39f110d..cf7a4f68405 100644
--- a/gcc/ggc-common.c
+++ b/gcc/ggc-common.c
@@ -814,8 +814,8 @@ void
init_ggc_heuristics (void)
{
#if !defined ENABLE_GC_CHECKING && !defined ENABLE_GC_ALWAYS_COLLECT
- set_default_param_value (GGC_MIN_EXPAND, ggc_min_expand_heuristic ());
- set_default_param_value (GGC_MIN_HEAPSIZE, ggc_min_heapsize_heuristic ());
+ param_ggc_min_expand = ggc_min_expand_heuristic ();
+ param_ggc_min_heapsize = ggc_min_heapsize_heuristic ();
#endif
}
diff --git a/gcc/ggc-page.c b/gcc/ggc-page.c
index b443d87ea57..b0d26256072 100644
--- a/gcc/ggc-page.c
+++ b/gcc/ggc-page.c
@@ -2185,9 +2185,9 @@ ggc_collect (void)
total allocations haven't expanded much since the last
collection. */
float allocated_last_gc =
- MAX (G.allocated_last_gc, (size_t)PARAM_VALUE (GGC_MIN_HEAPSIZE) * 1024);
+ MAX (G.allocated_last_gc, (size_t)param_ggc_min_heapsize * 1024);
- float min_expand = allocated_last_gc * PARAM_VALUE (GGC_MIN_EXPAND) / 100;
+ float min_expand = allocated_last_gc * param_ggc_min_expand / 100;
if (G.allocated < allocated_last_gc + min_expand && !ggc_force_collect)
return;
diff --git a/gcc/gimple-loop-interchange.cc b/gcc/gimple-loop-interchange.cc
index b56155b1fef..2a0cf6e41d8 100644
--- a/gcc/gimple-loop-interchange.cc
+++ b/gcc/gimple-loop-interchange.cc
@@ -78,14 +78,14 @@ along with GCC; see the file COPYING3. If not see
simple reduction of inner loop and double reduction of the loop nest. */
/* Maximum number of stmts in each loop that should be interchanged. */
-#define MAX_NUM_STMT (PARAM_VALUE (PARAM_LOOP_INTERCHANGE_MAX_NUM_STMTS))
+#define MAX_NUM_STMT (param_loop_interchange_max_num_stmts)
/* Maximum number of data references in loop nest. */
-#define MAX_DATAREFS (PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+#define MAX_DATAREFS (param_loop_max_datarefs_for_datadeps)
/* Comparison ratio of access stride between inner/outer loops to be
interchanged. This is the minimum stride ratio for loop interchange
to be profitable. */
-#define OUTER_STRIDE_RATIO (PARAM_VALUE (PARAM_LOOP_INTERCHANGE_STRIDE_RATIO))
+#define OUTER_STRIDE_RATIO (param_loop_interchange_stride_ratio)
/* The same as above, but we require higher ratio for interchanging the
innermost two loops. */
#define INNER_STRIDE_RATIO ((OUTER_STRIDE_RATIO) + 1)
diff --git a/gcc/gimple-loop-jam.c b/gcc/gimple-loop-jam.c
index 899653b0863..c1fc9ba9916 100644
--- a/gcc/gimple-loop-jam.c
+++ b/gcc/gimple-loop-jam.c
@@ -572,15 +572,15 @@ tree_loop_unroll_and_jam (void)
/* We regard a user-specified minimum percentage of zero as a request
to ignore all profitability concerns and apply the transformation
always. */
- if (!PARAM_VALUE (PARAM_UNROLL_JAM_MIN_PERCENT))
+ if (!param_unroll_jam_min_percent)
profit_unroll = MAX(2, profit_unroll);
else if (removed * 100 / datarefs.length ()
- < (unsigned)PARAM_VALUE (PARAM_UNROLL_JAM_MIN_PERCENT))
+ < (unsigned)param_unroll_jam_min_percent)
profit_unroll = 1;
if (unroll_factor > profit_unroll)
unroll_factor = profit_unroll;
- if (unroll_factor > (unsigned)PARAM_VALUE (PARAM_UNROLL_JAM_MAX_UNROLL))
- unroll_factor = PARAM_VALUE (PARAM_UNROLL_JAM_MAX_UNROLL);
+ if (unroll_factor > (unsigned)param_unroll_jam_max_unroll)
+ unroll_factor = param_unroll_jam_max_unroll;
unroll = (unroll_factor > 1
&& can_unroll_loop_p (outer, unroll_factor, &desc));
diff --git a/gcc/gimple-loop-versioning.cc b/gcc/gimple-loop-versioning.cc
index 1664d875e80..18456e87958 100644
--- a/gcc/gimple-loop-versioning.cc
+++ b/gcc/gimple-loop-versioning.cc
@@ -605,8 +605,8 @@ unsigned int
loop_versioning::max_insns_for_loop (class loop *loop)
{
return (loop->inner
- ? PARAM_VALUE (PARAM_LOOP_VERSIONING_MAX_OUTER_INSNS)
- : PARAM_VALUE (PARAM_LOOP_VERSIONING_MAX_INNER_INSNS));
+ ? param_loop_versioning_max_outer_insns
+ : param_loop_versioning_max_inner_insns);
}
/* Return true if for cost reasons we should avoid versioning any loop
diff --git a/gcc/gimple-ssa-split-paths.c b/gcc/gimple-ssa-split-paths.c
index 5bf45eeac28..49a0834d647 100644
--- a/gcc/gimple-ssa-split-paths.c
+++ b/gcc/gimple-ssa-split-paths.c
@@ -366,7 +366,7 @@ is_feasible_trace (basic_block bb)
/* Upper Hard limit on the number statements to copy. */
if (num_stmts_in_join
- >= PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS))
+ >= param_max_jump_thread_duplication_stmts)
return false;
return true;
diff --git a/gcc/gimple-ssa-store-merging.c b/gcc/gimple-ssa-store-merging.c
index c6dbac268c8..fbab13c59a0 100644
--- a/gcc/gimple-ssa-store-merging.c
+++ b/gcc/gimple-ssa-store-merging.c
@@ -2502,7 +2502,7 @@ imm_store_chain_info::try_coalesce_bswap (merged_store_group *merged_store,
return false;
bool allow_unaligned
- = !STRICT_ALIGNMENT && PARAM_VALUE (PARAM_STORE_MERGING_ALLOW_UNALIGNED);
+ = !STRICT_ALIGNMENT && param_store_merging_allow_unaligned;
/* Punt if the combined store would not be aligned and we need alignment. */
if (!allow_unaligned)
{
@@ -2762,7 +2762,7 @@ imm_store_chain_info::coalesce_immediate_stores ()
if (info->order >= merged_store->first_nonmergeable_order
|| (((new_bitregion_end - new_bitregion_start + 1) / BITS_PER_UNIT)
- > (unsigned) PARAM_VALUE (PARAM_STORE_MERGING_MAX_SIZE)))
+ > (unsigned) param_store_merging_max_size))
;
/* |---store 1---|
@@ -3710,7 +3710,7 @@ imm_store_chain_info::output_merged_store (merged_store_group *group)
auto_vec<class split_store *, 32> split_stores;
bool allow_unaligned_store
- = !STRICT_ALIGNMENT && PARAM_VALUE (PARAM_STORE_MERGING_ALLOW_UNALIGNED);
+ = !STRICT_ALIGNMENT && param_store_merging_allow_unaligned;
bool allow_unaligned_load = allow_unaligned_store;
bool bzero_first = false;
store_immediate_info *store;
@@ -4890,7 +4890,7 @@ pass_store_merging::process_store (gimple *stmt)
/* If we reach the limit of stores to merge in a chain terminate and
process the chain now. */
if ((*chain_info)->m_store_info.length ()
- == (unsigned int) PARAM_VALUE (PARAM_MAX_STORES_TO_MERGE))
+ == (unsigned int) param_max_stores_to_merge)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/gimple-ssa-strength-reduction.c b/gcc/gimple-ssa-strength-reduction.c
index de7f36015ef..ab5011a7a1e 100644
--- a/gcc/gimple-ssa-strength-reduction.c
+++ b/gcc/gimple-ssa-strength-reduction.c
@@ -546,7 +546,7 @@ find_basis_for_base_expr (slsr_cand_t c, tree base_expr)
// Limit potential of N^2 behavior for long candidate chains.
int iters = 0;
- int max_iters = PARAM_VALUE (PARAM_MAX_SLSR_CANDIDATE_SCAN);
+ int max_iters = param_max_slsr_candidate_scan;
mapping_key.base_expr = base_expr;
chain = base_cand_map->find (&mapping_key);
diff --git a/gcc/graphite-isl-ast-to-gimple.c b/gcc/graphite-isl-ast-to-gimple.c
index 40d1e8de6ae..11a4da0a623 100644
--- a/gcc/graphite-isl-ast-to-gimple.c
+++ b/gcc/graphite-isl-ast-to-gimple.c
@@ -203,7 +203,7 @@ class translate_isl_ast_to_gimple
{
codegen_error = true;
gcc_assert (! flag_checking
- || PARAM_VALUE (PARAM_GRAPHITE_ALLOW_CODEGEN_ERRORS));
+ || param_graphite_allow_codegen_errors);
}
bool is_constant (tree op) const
@@ -1383,7 +1383,7 @@ scop_to_isl_ast (scop_p scop)
{
int old_err = isl_options_get_on_error (scop->isl_context);
int old_max_operations = isl_ctx_get_max_operations (scop->isl_context);
- int max_operations = PARAM_VALUE (PARAM_MAX_ISL_OPERATIONS);
+ int max_operations = param_max_isl_operations;
if (max_operations)
isl_ctx_set_max_operations (scop->isl_context, max_operations);
isl_options_set_on_error (scop->isl_context, ISL_ON_ERROR_CONTINUE);
diff --git a/gcc/graphite-optimize-isl.c b/gcc/graphite-optimize-isl.c
index c4b8f3bc876..1dc9c3cb7be 100644
--- a/gcc/graphite-optimize-isl.c
+++ b/gcc/graphite-optimize-isl.c
@@ -64,7 +64,7 @@ get_schedule_for_node_st (__isl_take isl_schedule_node *node, void *user)
if (type != isl_schedule_node_leaf)
return node;
- long tile_size = PARAM_VALUE (PARAM_LOOP_BLOCK_TILE_SIZE);
+ long tile_size = param_loop_block_tile_size;
if (dims <= 1
|| tile_size == 0
|| !isl_schedule_node_band_get_permutable (node))
@@ -115,7 +115,7 @@ optimize_isl (scop_p scop)
{
int old_err = isl_options_get_on_error (scop->isl_context);
int old_max_operations = isl_ctx_get_max_operations (scop->isl_context);
- int max_operations = PARAM_VALUE (PARAM_MAX_ISL_OPERATIONS);
+ int max_operations = param_max_isl_operations;
if (max_operations)
isl_ctx_set_max_operations (scop->isl_context, max_operations);
isl_options_set_on_error (scop->isl_context, ISL_ON_ERROR_CONTINUE);
diff --git a/gcc/graphite-scop-detection.c b/gcc/graphite-scop-detection.c
index 489d0b93b42..1505a13b860 100644
--- a/gcc/graphite-scop-detection.c
+++ b/gcc/graphite-scop-detection.c
@@ -1639,7 +1639,7 @@ build_scops (vec<scop_p> *scops)
continue;
}
- unsigned max_arrays = PARAM_VALUE (PARAM_GRAPHITE_MAX_ARRAYS_PER_SCOP);
+ unsigned max_arrays = param_graphite_max_arrays_per_scop;
if (max_arrays > 0
&& scop->drs.length () >= max_arrays)
{
@@ -1652,7 +1652,7 @@ build_scops (vec<scop_p> *scops)
}
find_scop_parameters (scop);
- graphite_dim_t max_dim = PARAM_VALUE (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS);
+ graphite_dim_t max_dim = param_graphite_max_nb_scop_params;
if (max_dim > 0
&& scop_nb_params (scop) > max_dim)
{
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index 41cf1f362e8..58bf704ea15 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -584,7 +584,7 @@ set_modulo_params (int ii, int max_stages, int insns, int max_uid)
modulo_max_stages = max_stages;
modulo_n_insns = insns;
modulo_iter0_max_uid = max_uid;
- modulo_backtracks_left = PARAM_VALUE (PARAM_MAX_MODULO_BACKTRACK_ATTEMPTS);
+ modulo_backtracks_left = param_max_modulo_backtrack_attempts;
}
/* A structure to record a pair of insns where the first one is a real
@@ -2712,7 +2712,7 @@ rank_for_schedule (const void *x, const void *y)
if (flag_sched_critical_path_heuristic && priority_val)
return rfs_result (RFS_PRIORITY, priority_val, tmp, tmp2);
- if (PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) >= 0)
+ if (param_sched_autopref_queue_depth >= 0)
{
int autopref = autopref_rank_for_schedule (tmp, tmp2);
if (autopref != 0)
@@ -3413,7 +3413,7 @@ model_remove_from_worklist (struct model_insn_info *insn)
}
/* Add INSN to the model worklist. Start looking for a suitable position
- between neighbors PREV and NEXT, testing at most MAX_SCHED_READY_INSNS
+ between neighbors PREV and NEXT, testing at most param_max_sched_ready_insns
insns either side. A null PREV indicates the beginning of the list and
a null NEXT indicates the end. */
@@ -3424,7 +3424,7 @@ model_add_to_worklist (struct model_insn_info *insn,
{
int count;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
if (count > 0 && prev && model_order_p (insn, prev))
do
{
@@ -3452,7 +3452,7 @@ model_promote_insn (struct model_insn_info *insn)
int count;
prev = insn->prev;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
while (count > 0 && prev && model_order_p (insn, prev))
{
count--;
@@ -3738,7 +3738,7 @@ model_choose_insn (void)
{
fprintf (sched_dump, ";;\t+--- worklist:\n");
insn = model_worklist;
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
while (count > 0 && insn)
{
fprintf (sched_dump, ";;\t+--- %d [%d, %d, %d, %d]\n",
@@ -3770,7 +3770,7 @@ model_choose_insn (void)
Failing that, just pick the highest-priority instruction in the
worklist. */
- count = MAX_SCHED_READY_INSNS;
+ count = param_max_sched_ready_insns;
insn = model_worklist;
fallback = 0;
for (;;)
@@ -5147,12 +5147,12 @@ queue_to_ready (struct ready_list *ready)
/* If the ready list is full, delay the insn for 1 cycle.
See the comment in schedule_block for the rationale. */
if (!reload_completed
- && (ready->n_ready - ready->n_debug > MAX_SCHED_READY_INSNS
+ && (ready->n_ready - ready->n_debug > param_max_sched_ready_insns
|| (sched_pressure == SCHED_PRESSURE_MODEL
- /* Limit pressure recalculations to MAX_SCHED_READY_INSNS
- instructions too. */
+ /* Limit pressure recalculations to
+ param_max_sched_ready_insns instructions too. */
&& model_index (insn) > (model_curr_point
- + MAX_SCHED_READY_INSNS)))
+ + param_max_sched_ready_insns)))
&& !(sched_pressure == SCHED_PRESSURE_MODEL
&& model_curr_point < model_num_insns
/* Always allow the next model instruction to issue. */
@@ -5743,7 +5743,7 @@ autopref_multipass_dfa_lookahead_guard (rtx_insn *insn1, int ready_index)
/* Exit early if the param forbids this or if we're not entering here through
normal haifa scheduling. This can happen if selective scheduling is
explicitly enabled. */
- if (!insn_queue || PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) <= 0)
+ if (!insn_queue || param_sched_autopref_queue_depth <= 0)
return 0;
if (sched_verbose >= 2 && ready_index == 0)
@@ -5796,14 +5796,14 @@ autopref_multipass_dfa_lookahead_guard (rtx_insn *insn1, int ready_index)
}
}
- if (PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) == 1)
+ if (param_sched_autopref_queue_depth == 1)
continue;
/* Everything from the current queue slot should have been moved to
the ready list. */
gcc_assert (insn_queue[NEXT_Q_AFTER (q_ptr, 0)] == NULL_RTX);
- int n_stalls = PARAM_VALUE (PARAM_SCHED_AUTOPREF_QUEUE_DEPTH) - 1;
+ int n_stalls = param_sched_autopref_queue_depth - 1;
if (n_stalls > max_insn_queue_index)
n_stalls = max_insn_queue_index;
@@ -6552,14 +6552,15 @@ schedule_block (basic_block *target_bb, state_t init_state)
time in the worst case. Before reload we are more likely to have
big lists so truncate them to a reasonable size. */
if (!reload_completed
- && ready.n_ready - ready.n_debug > MAX_SCHED_READY_INSNS)
+ && ready.n_ready - ready.n_debug > param_max_sched_ready_insns)
{
ready_sort_debug (&ready);
ready_sort_real (&ready);
- /* Find first free-standing insn past MAX_SCHED_READY_INSNS.
+ /* Find first free-standing insn past param_max_sched_ready_insns.
If there are debug insns, we know they're first. */
- for (i = MAX_SCHED_READY_INSNS + ready.n_debug; i < ready.n_ready; i++)
+ for (i = param_max_sched_ready_insns + ready.n_debug; i < ready.n_ready;
+ i++)
if (!SCHED_GROUP_P (ready_element (&ready, i)))
break;
@@ -7258,7 +7259,7 @@ sched_init (void)
&& !reload_completed
&& common_sched_info->sched_pass_id == SCHED_RGN_PASS)
sched_pressure = ((enum sched_pressure_algorithm)
- PARAM_VALUE (PARAM_SCHED_PRESSURE_ALGORITHM));
+ param_sched_pressure_algorithm);
else
sched_pressure = SCHED_PRESSURE_NONE;
@@ -7273,11 +7274,10 @@ sched_init (void)
if (spec_info->mask != 0)
{
- spec_info->data_weakness_cutoff =
- (PARAM_VALUE (PARAM_SCHED_SPEC_PROB_CUTOFF) * MAX_DEP_WEAK) / 100;
- spec_info->control_weakness_cutoff =
- (PARAM_VALUE (PARAM_SCHED_SPEC_PROB_CUTOFF)
- * REG_BR_PROB_BASE) / 100;
+ spec_info->data_weakness_cutoff
+ = (param_sched_spec_prob_cutoff * MAX_DEP_WEAK) / 100;
+ spec_info->control_weakness_cutoff
+ = (param_sched_spec_prob_cutoff * REG_BR_PROB_BASE) / 100;
}
else
/* So we won't read anything accidentally. */
diff --git a/gcc/hsa-gen.c b/gcc/hsa-gen.c
index 436f4c5f9f5..c4a03f938cf 100644
--- a/gcc/hsa-gen.c
+++ b/gcc/hsa-gen.c
@@ -5940,7 +5940,7 @@ init_prologue (void)
unsigned index = hsa_get_number_decl_kernel_mappings ();
/* Emit store to debug argument. */
- if (PARAM_VALUE (PARAM_HSA_GEN_DEBUG_STORES) > 0)
+ if (param_hsa_gen_debug_stores > 0)
set_debug_value (prologue, new hsa_op_immed (1000 + index, BRIG_TYPE_U64));
}
diff --git a/gcc/ifcvt.c b/gcc/ifcvt.c
index 8bc6f53cb38..5df8a43a5f7 100644
--- a/gcc/ifcvt.c
+++ b/gcc/ifcvt.c
@@ -3311,7 +3311,7 @@ bb_ok_for_noce_convert_multiple_sets (basic_block test_bb)
{
rtx_insn *insn;
unsigned count = 0;
- unsigned param = PARAM_VALUE (PARAM_MAX_RTL_IF_CONVERSION_INSNS);
+ unsigned param = param_max_rtl_if_conversion_insns;
FOR_BB_INSNS (test_bb, insn)
{
@@ -3838,7 +3838,7 @@ cond_move_process_if_block (struct noce_if_info *if_info)
vec<rtx> else_regs = vNULL;
unsigned int i;
int success_p = FALSE;
- int limit = PARAM_VALUE (PARAM_MAX_RTL_IF_CONVERSION_INSNS);
+ int limit = param_max_rtl_if_conversion_insns;
/* Build a mapping for each block to the value used for each
register. */
diff --git a/gcc/ipa-cp.c b/gcc/ipa-cp.c
index b1d899976e8..345f1792ad6 100644
--- a/gcc/ipa-cp.c
+++ b/gcc/ipa-cp.c
@@ -1612,7 +1612,7 @@ ipcp_lattice<valtype>::add_value (valtype newval, cgraph_edge *cs,
return false;
}
- if (values_count == PARAM_VALUE (PARAM_IPA_CP_VALUE_LIST_SIZE))
+ if (values_count == param_ipa_cp_value_list_size)
{
/* We can only free sources, not the values themselves, because sources
of other values in this SCC might point to them. */
@@ -2089,7 +2089,7 @@ merge_agg_lats_step (class ipcp_param_lattices *dest_plats,
set_agg_lats_to_bottom (dest_plats);
return false;
}
- if (dest_plats->aggs_count == PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS))
+ if (dest_plats->aggs_count == param_ipa_max_agg_items)
return false;
dest_plats->aggs_count++;
new_al = ipcp_agg_lattice_pool.allocate ();
@@ -2644,11 +2644,11 @@ devirtualization_time_bonus (struct cgraph_node *node,
int size = ipa_size_summaries->get (callee)->size;
/* FIXME: The values below need re-considering and perhaps also
integrating into the cost metrics, at lest in some very basic way. */
- if (size <= MAX_INLINE_INSNS_AUTO / 4)
+ if (size <= param_max_inline_insns_auto / 4)
res += 31 / ((int)speculative + 1);
- else if (size <= MAX_INLINE_INSNS_AUTO / 2)
+ else if (size <= param_max_inline_insns_auto / 2)
res += 15 / ((int)speculative + 1);
- else if (size <= MAX_INLINE_INSNS_AUTO
+ else if (size <= param_max_inline_insns_auto
|| DECL_DECLARED_INLINE_P (callee->decl))
res += 7 / ((int)speculative + 1);
}
@@ -2663,7 +2663,7 @@ hint_time_bonus (ipa_hints hints)
{
int result = 0;
if (hints & (INLINE_HINT_loop_iterations | INLINE_HINT_loop_stride))
- result += PARAM_VALUE (PARAM_IPA_CP_LOOP_HINT_BONUS);
+ result += param_ipa_cp_loop_hint_bonus;
return result;
}
@@ -2675,11 +2675,11 @@ incorporate_penalties (ipa_node_params *info, int64_t evaluation)
{
if (info->node_within_scc)
evaluation = (evaluation
- * (100 - PARAM_VALUE (PARAM_IPA_CP_RECURSION_PENALTY))) / 100;
+ * (100 - param_ipa_cp_recursion_penalty)) / 100;
if (info->node_calling_single_call)
evaluation = (evaluation
- * (100 - PARAM_VALUE (PARAM_IPA_CP_SINGLE_CALL_PENALTY)))
+ * (100 - param_ipa_cp_single_call_penalty))
/ 100;
return evaluation;
@@ -2719,10 +2719,10 @@ good_cloning_opportunity_p (struct cgraph_node *node, int time_benefit,
", threshold: %i\n",
info->node_within_scc ? ", scc" : "",
info->node_calling_single_call ? ", single_call" : "",
- evaluation, PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD));
+ evaluation, param_ipa_cp_eval_threshold);
}
- return evaluation >= PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD);
+ return evaluation >= param_ipa_cp_eval_threshold;
}
else
{
@@ -2737,9 +2737,9 @@ good_cloning_opportunity_p (struct cgraph_node *node, int time_benefit,
time_benefit, size_cost, freq_sum,
info->node_within_scc ? ", scc" : "",
info->node_calling_single_call ? ", single_call" : "",
- evaluation, PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD));
+ evaluation, param_ipa_cp_eval_threshold);
- return evaluation >= PARAM_VALUE (PARAM_IPA_CP_EVAL_THRESHOLD);
+ return evaluation >= param_ipa_cp_eval_threshold;
}
}
@@ -3364,9 +3364,9 @@ ipcp_propagate_stage (class ipa_topo_info *topo)
}
max_new_size = overall_size;
- if (max_new_size < PARAM_VALUE (PARAM_LARGE_UNIT_INSNS))
- max_new_size = PARAM_VALUE (PARAM_LARGE_UNIT_INSNS);
- max_new_size += max_new_size * PARAM_VALUE (PARAM_IPCP_UNIT_GROWTH) / 100 + 1;
+ if (max_new_size < param_large_unit_insns)
+ max_new_size = param_large_unit_insns;
+ max_new_size += max_new_size * param_ipcp_unit_growth / 100 + 1;
if (dump_file)
fprintf (dump_file, "\noverall_size: %li, max_new_size: %li\n",
diff --git a/gcc/ipa-fnsummary.c b/gcc/ipa-fnsummary.c
index 686d960f75b..fe619d1dbb6 100644
--- a/gcc/ipa-fnsummary.c
+++ b/gcc/ipa-fnsummary.c
@@ -1204,7 +1204,7 @@ decompose_param_expr (struct ipa_func_body_info *fbi,
struct agg_position_info *aggpos,
expr_eval_ops *param_ops_p = NULL)
{
- int op_limit = PARAM_VALUE (PARAM_IPA_MAX_PARAM_EXPR_OPS);
+ int op_limit = param_ipa_max_param_expr_ops;
int op_count = 0;
if (param_ops_p)
@@ -1435,7 +1435,7 @@ set_switch_stmt_execution_predicate (struct ipa_func_body_info *fbi,
auto_vec<std::pair<tree, tree> > ranges;
tree type = TREE_TYPE (op);
- int bound_limit = PARAM_VALUE (PARAM_IPA_MAX_SWITCH_PREDICATE_BOUNDS);
+ int bound_limit = param_ipa_max_switch_predicate_bounds;
int bound_count = 0;
wide_int vr_wmin, vr_wmax;
value_range_kind vr_type = get_range_info (op, &vr_wmin, &vr_wmax);
@@ -2280,9 +2280,9 @@ fp_expression_p (gimple *stmt)
static void
analyze_function_body (struct cgraph_node *node, bool early)
{
- sreal time = PARAM_VALUE (PARAM_UNINLINED_FUNCTION_TIME);
+ sreal time = param_uninlined_function_time;
/* Estimate static overhead for function prologue/epilogue and alignment. */
- int size = PARAM_VALUE (PARAM_UNINLINED_FUNCTION_INSNS);
+ int size = param_uninlined_function_insns;
/* Benefits are scaled by probability of elimination that is in range
<0,2>. */
basic_block bb;
@@ -2331,7 +2331,7 @@ analyze_function_body (struct cgraph_node *node, bool early)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = count_formal_params (node->decl);
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
nonconstant_names.safe_grow_cleared
(SSANAMES (my_function)->length ());
@@ -2348,9 +2348,9 @@ analyze_function_body (struct cgraph_node *node, bool early)
info->account_size_time (0, 0, bb_predicate, bb_predicate);
bb_predicate = predicate::not_inlined ();
- info->account_size_time (PARAM_VALUE (PARAM_UNINLINED_FUNCTION_INSNS)
+ info->account_size_time (param_uninlined_function_insns
* ipa_fn_summary::size_scale,
- PARAM_VALUE (PARAM_UNINLINED_FUNCTION_TIME),
+ param_uninlined_function_time,
bb_predicate,
bb_predicate);
@@ -2748,10 +2748,8 @@ compute_fn_summary (struct cgraph_node *node, bool early)
es->call_stmt_size = eni_size_weights.call_cost;
es->call_stmt_time = eni_time_weights.call_cost;
info->account_size_time (ipa_fn_summary::size_scale
- * PARAM_VALUE
- (PARAM_UNINLINED_FUNCTION_THUNK_INSNS),
- PARAM_VALUE
- (PARAM_UNINLINED_FUNCTION_THUNK_TIME), t, t);
+ * param_uninlined_function_thunk_insns,
+ param_uninlined_function_thunk_time, t, t);
t = predicate::not_inlined ();
info->account_size_time (2 * ipa_fn_summary::size_scale, 0, t, t);
ipa_update_overall_fn_summary (node);
diff --git a/gcc/ipa-inline-analysis.c b/gcc/ipa-inline-analysis.c
index 9839cae43a3..d5a9fb0682e 100644
--- a/gcc/ipa-inline-analysis.c
+++ b/gcc/ipa-inline-analysis.c
@@ -442,8 +442,8 @@ offline_size (struct cgraph_node *node, ipa_size_summary *info)
else if (DECL_COMDAT (node->decl)
&& node->can_remove_if_no_direct_calls_p ())
return (info->size
- * (100 - PARAM_VALUE (PARAM_COMDAT_SHARING_PROBABILITY))
- + 50) / 100;
+ * (100 - param_comdat_sharing_probability)
+ + 50) / 100;
}
return 0;
}
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c
index 53252e18cf0..b159f440e91 100644
--- a/gcc/ipa-inline.c
+++ b/gcc/ipa-inline.c
@@ -179,13 +179,13 @@ caller_growth_limits (struct cgraph_edge *e)
if (limit < what_size_info->self_size)
limit = what_size_info->self_size;
- limit += limit * PARAM_VALUE (PARAM_LARGE_FUNCTION_GROWTH) / 100;
+ limit += limit * param_large_function_growth / 100;
/* Check the size after inlining against the function limits. But allow
the function to shrink if it went over the limits by forced inlining. */
newsize = estimate_size_after_inlining (to, e);
if (newsize >= ipa_size_summaries->get (what)->size
- && newsize > PARAM_VALUE (PARAM_LARGE_FUNCTION_INSNS)
+ && newsize > param_large_function_insns
&& newsize > limit)
{
e->inline_failed = CIF_LARGE_FUNCTION_GROWTH_LIMIT;
@@ -201,7 +201,7 @@ caller_growth_limits (struct cgraph_edge *e)
on every invocation of the caller (i.e. its call statement dominates
exit block). We do not track this information, yet. */
stack_size_limit += ((gcov_type)stack_size_limit
- * PARAM_VALUE (PARAM_STACK_FRAME_GROWTH) / 100);
+ * param_stack_frame_growth / 100);
inlined_stack = (ipa_get_stack_frame_offset (to)
+ outer_info->estimated_self_stack_size
@@ -214,7 +214,7 @@ caller_growth_limits (struct cgraph_edge *e)
This bit overoptimistically assume that we are good at stack
packing. */
&& inlined_stack > ipa_fn_summaries->get (to)->estimated_stack_size
- && inlined_stack > PARAM_VALUE (PARAM_LARGE_STACK_FRAME))
+ && inlined_stack > param_large_stack_frame)
{
e->inline_failed = CIF_LARGE_STACK_FRAME_GROWTH_LIMIT;
return false;
@@ -399,16 +399,16 @@ inline_insns_single (cgraph_node *n, bool hint)
if (opt_for_fn (n->decl, optimize) >= 3)
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE);
+ return param_max_inline_insns_single
+ * param_inline_heuristics_hint_percent / 100;
+ return param_max_inline_insns_single;
}
else
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE_O2)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT_O2) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SINGLE_O2);
+ return param_max_inline_insns_single_o2
+ * param_inline_heuristics_hint_percent_o2 / 100;
+ return param_max_inline_insns_single_o2;
}
}
@@ -421,16 +421,16 @@ inline_insns_auto (cgraph_node *n, bool hint)
if (opt_for_fn (n->decl, optimize) >= 3)
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO);
+ return param_max_inline_insns_auto
+ * param_inline_heuristics_hint_percent / 100;
+ return param_max_inline_insns_auto;
}
else
{
if (hint)
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO_O2)
- * PARAM_VALUE (PARAM_INLINE_HEURISTICS_HINT_PERCENT_O2) / 100;
- return PARAM_VALUE (PARAM_MAX_INLINE_INSNS_AUTO_O2);
+ return param_max_inline_insns_auto_o2
+ * param_inline_heuristics_hint_percent_o2 / 100;
+ return param_max_inline_insns_auto_o2;
}
}
@@ -567,14 +567,14 @@ can_inline_edge_by_limits_p (struct cgraph_edge *e, bool report,
inlinable = false;
}
/* If callee is optimized for size and caller is not, allow inlining if
- code shrinks or we are in MAX_INLINE_INSNS_SINGLE limit and callee
- is inline (and thus likely an unified comdat). This will allow caller
- to run faster. */
+ code shrinks or we are in param_max_inline_insns_single limit and
+ callee is inline (and thus likely an unified comdat).
+ This will allow caller to run faster. */
else if (opt_for_fn (callee->decl, optimize_size)
> opt_for_fn (caller->decl, optimize_size))
{
int growth = estimate_edge_growth (e);
- if (growth > PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE)
+ if (growth > param_max_inline_insns_size
&& (!DECL_DECLARED_INLINE_P (callee->decl)
&& growth >= MAX (inline_insns_single (caller, false),
inline_insns_auto (caller, false))))
@@ -686,11 +686,11 @@ want_early_inline_function_p (struct cgraph_edge *e)
int growth = estimate_edge_growth (e);
int n;
int early_inlining_insns = opt_for_fn (e->caller->decl, optimize) >= 3
- ? PARAM_VALUE (PARAM_EARLY_INLINING_INSNS)
- : PARAM_VALUE (PARAM_EARLY_INLINING_INSNS_O2);
+ ? param_early_inlining_insns
+ : param_early_inlining_insns_o2;
- if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE))
+ if (growth <= param_max_inline_insns_size)
;
else if (!e->maybe_hot_p ())
{
@@ -794,8 +794,8 @@ big_speedup_p (struct cgraph_edge *e)
? e->caller->inlined_to
: e->caller);
int limit = opt_for_fn (caller->decl, optimize) >= 3
- ? PARAM_VALUE (PARAM_INLINE_MIN_SPEEDUP)
- : PARAM_VALUE (PARAM_INLINE_MIN_SPEEDUP_O2);
+ ? param_inline_min_speedup
+ : param_inline_min_speedup_o2;
if ((time - inlined_time) * 100 > time * limit)
return true;
@@ -862,9 +862,9 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
| INLINE_HINT_loop_iterations
| INLINE_HINT_loop_stride));
- if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE))
+ if (growth <= param_max_inline_insns_size)
;
- /* Apply MAX_INLINE_INSNS_SINGLE limit. Do not do so when
+ /* Apply param_max_inline_insns_single limit. Do not do so when
hints suggests that inlining given function is very profitable.
Avoid computation of big_speedup_p when not necessary to change
outcome of decision. */
@@ -882,7 +882,7 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
}
else if (!DECL_DECLARED_INLINE_P (callee->decl)
&& !opt_for_fn (e->caller->decl, flag_inline_functions)
- && growth >= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SMALL))
+ && growth >= param_max_inline_insns_small)
{
/* growth_positive_p is expensive, always test it last. */
if (growth >= inline_insns_single (e->caller, false)
@@ -892,8 +892,8 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report)
want_inline = false;
}
}
- /* Apply MAX_INLINE_INSNS_AUTO limit for functions not declared inline.
- Bypass the limit when speedup seems big. */
+ /* Apply param_max_inline_insns_auto limit for functions not declared
+ inline. Bypass the limit when speedup seems big. */
else if (!DECL_DECLARED_INLINE_P (callee->decl)
&& growth >= inline_insns_auto (e->caller, apply_hints)
&& (apply_hints
@@ -945,10 +945,10 @@ want_inline_self_recursive_call_p (struct cgraph_edge *edge,
char const *reason = NULL;
bool want_inline = true;
sreal caller_freq = 1;
- int max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO);
+ int max_depth = param_max_inline_recursive_depth_auto;
if (DECL_DECLARED_INLINE_P (edge->caller->decl))
- max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH);
+ max_depth = param_max_inline_recursive_depth;
if (!edge->maybe_hot_p ())
{
@@ -1010,7 +1010,7 @@ want_inline_self_recursive_call_p (struct cgraph_edge *edge,
{
if (edge->sreal_frequency () * 100
<= caller_freq
- * PARAM_VALUE (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY))
+ * param_min_inline_recursive_probability)
{
reason = "frequency of recursive call is too small";
want_inline = false;
@@ -1207,9 +1207,7 @@ edge_badness (struct cgraph_edge *edge, bool dump)
/* ... or when early optimizers decided to split and edge
frequency still indicates splitting is a win ... */
|| (callee->split_part && !caller->split_part
- && freq * 100
- < PARAM_VALUE
- (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY)
+ && freq * 100 < param_partial_inlining_entry_probability
/* ... and do not overwrite user specified hints. */
&& (!DECL_DECLARED_INLINE_P (edge->callee->decl)
|| DECL_DECLARED_INLINE_P (caller->decl)))))
@@ -1539,7 +1537,7 @@ static bool
recursive_inlining (struct cgraph_edge *edge,
vec<cgraph_edge *> *new_edges)
{
- int limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO);
+ int limit = param_max_inline_insns_recursive_auto;
edge_heap_t heap (sreal::min ());
struct cgraph_node *node;
struct cgraph_edge *e;
@@ -1552,7 +1550,7 @@ recursive_inlining (struct cgraph_edge *edge,
node = node->inlined_to;
if (DECL_DECLARED_INLINE_P (node->decl))
- limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE);
+ limit = param_max_inline_insns_recursive;
/* Make sure that function is small enough to be considered for inlining. */
if (estimate_size_after_inlining (node, edge) >= limit)
@@ -1677,11 +1675,11 @@ static int
compute_max_insns (int insns)
{
int max_insns = insns;
- if (max_insns < PARAM_VALUE (PARAM_LARGE_UNIT_INSNS))
- max_insns = PARAM_VALUE (PARAM_LARGE_UNIT_INSNS);
+ if (max_insns < param_large_unit_insns)
+ max_insns = param_large_unit_insns;
return ((int64_t) max_insns
- * (100 + PARAM_VALUE (PARAM_INLINE_UNIT_GROWTH)) / 100);
+ * (100 + param_inline_unit_growth) / 100);
}
@@ -2897,7 +2895,7 @@ early_inliner (function *fun)
}
/* We iterate incremental inlining to get trivial cases of indirect
inlining. */
- while (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS)
+ while (iterations < param_early_inliner_max_iterations
&& early_inline_small_functions (node))
{
timevar_push (TV_INTEGRATION);
@@ -2916,7 +2914,7 @@ early_inliner (function *fun)
es->call_stmt_time
= estimate_num_insns (edge->call_stmt, &eni_time_weights);
}
- if (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS) - 1)
+ if (iterations < param_early_inliner_max_iterations - 1)
ipa_update_overall_fn_summary (node);
timevar_pop (TV_INTEGRATION);
iterations++;
diff --git a/gcc/ipa-polymorphic-call.c b/gcc/ipa-polymorphic-call.c
index 705af03d20c..7c2b4c795fa 100644
--- a/gcc/ipa-polymorphic-call.c
+++ b/gcc/ipa-polymorphic-call.c
@@ -1400,7 +1400,7 @@ record_known_type (struct type_change_info *tci, tree type, HOST_WIDE_INT offset
static inline bool
csftc_abort_walking_p (unsigned speculative)
{
- unsigned max = PARAM_VALUE (PARAM_MAX_SPECULATIVE_DEVIRT_MAYDEFS);
+ unsigned max = param_max_speculative_devirt_maydefs;
return speculative > max ? true : false;
}
diff --git a/gcc/ipa-profile.c b/gcc/ipa-profile.c
index 79cabc5573e..cd34ae62854 100644
--- a/gcc/ipa-profile.c
+++ b/gcc/ipa-profile.c
@@ -506,7 +506,7 @@ ipa_profile (void)
gcc_assert (overall_size);
- cutoff = (overall_time * PARAM_VALUE (HOT_BB_COUNT_WS_PERMILLE) + 500) / 1000;
+ cutoff = (overall_time * param_hot_bb_count_ws_permille + 500) / 1000;
threshold = 0;
for (i = 0; cumulated < cutoff; i++)
{
diff --git a/gcc/ipa-prop.c b/gcc/ipa-prop.c
index a6c135f242b..3e78321bf16 100644
--- a/gcc/ipa-prop.c
+++ b/gcc/ipa-prop.c
@@ -1601,7 +1601,7 @@ determine_known_aggregate_parts (gcall *call, tree arg,
struct ipa_known_agg_contents_list *list = NULL, *all_list = NULL;
bitmap visited = NULL;
int item_count = 0, const_count = 0;
- int ipa_max_agg_items = PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS);
+ int ipa_max_agg_items = param_ipa_max_agg_items;
HOST_WIDE_INT arg_offset, arg_size;
tree arg_base;
bool check_ref, by_ref;
@@ -2632,7 +2632,7 @@ ipa_analyze_node (struct cgraph_node *node)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = ipa_get_param_count (info);
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
for (struct cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
{
@@ -5314,7 +5314,7 @@ ipcp_transform_function (struct cgraph_node *node)
fbi.bb_infos = vNULL;
fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun));
fbi.param_count = param_count;
- fbi.aa_walk_budget = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ fbi.aa_walk_budget = param_ipa_max_aa_steps;
vec_safe_grow_cleared (descriptors, param_count);
ipa_populate_param_decls (node, *descriptors);
diff --git a/gcc/ipa-split.c b/gcc/ipa-split.c
index 0444bda704d..c73b257ca7f 100644
--- a/gcc/ipa-split.c
+++ b/gcc/ipa-split.c
@@ -453,7 +453,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
is unknown. */
if (!(current->count
< (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.apply_scale
- (PARAM_VALUE (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY), 100))))
+ (param_partial_inlining_entry_probability, 100))))
{
/* When profile is guessed, we cannot expect it to give us
realistic estimate on likelyness of function taking the
@@ -563,8 +563,8 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
that. Next stage1 we should try to be more meaningful here. */
if (current->header_size + call_overhead
>= (unsigned int)(DECL_DECLARED_INLINE_P (current_function_decl)
- ? MAX_INLINE_INSNS_SINGLE
- : MAX_INLINE_INSNS_AUTO) + 10)
+ ? param_max_inline_insns_single
+ : param_max_inline_insns_auto) + 10)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -577,7 +577,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
Limit this duplication. This is consistent with limit in tree-sra.c
FIXME: with LTO we ought to be able to do better! */
if (DECL_ONE_ONLY (current_function_decl)
- && current->split_size >= (unsigned int) MAX_INLINE_INSNS_AUTO + 10)
+ && current->split_size >= (unsigned int) param_max_inline_insns_auto + 10)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -589,7 +589,7 @@ consider_split (class split_point *current, bitmap non_ssa_vars,
FIXME: with LTO we ought to be able to do better! */
if (DECL_ONE_ONLY (current_function_decl)
&& current->split_size
- <= (unsigned int) PARAM_VALUE (PARAM_EARLY_INLINING_INSNS) / 2)
+ <= (unsigned int) param_early_inlining_insns / 2)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/ipa-sra.c b/gcc/ipa-sra.c
index a9674af9c94..303e4a7028a 100644
--- a/gcc/ipa-sra.c
+++ b/gcc/ipa-sra.c
@@ -1266,7 +1266,7 @@ allocate_access (gensum_param_desc *desc,
HOST_WIDE_INT offset, HOST_WIDE_INT size)
{
if (desc->access_count
- == (unsigned) PARAM_VALUE (PARAM_IPA_SRA_MAX_REPLACEMENTS))
+ == (unsigned) param_ipa_sra_max_replacements)
{
disqualify_split_candidate (desc, "Too many replacement candidates");
return NULL;
@@ -2280,8 +2280,7 @@ process_scan_results (cgraph_node *node, struct function *fun,
if (!desc->by_ref || optimize_function_for_size_p (fun))
param_size_limit = cur_param_size;
else
- param_size_limit = (PARAM_VALUE (PARAM_IPA_SRA_PTR_GROWTH_FACTOR)
- * cur_param_size);
+ param_size_limit = param_ipa_sra_ptr_growth_factor * cur_param_size;
if (nonarg_acc_size > param_size_limit
|| (!desc->by_ref && nonarg_acc_size == param_size_limit))
{
@@ -2501,7 +2500,7 @@ ipa_sra_summarize_function (cgraph_node *node)
bb_dereferences = XCNEWVEC (HOST_WIDE_INT,
by_ref_count
* last_basic_block_for_fn (fun));
- aa_walking_limit = PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS);
+ aa_walking_limit = param_ipa_max_aa_steps;
scan_function (node, fun);
if (dump_file)
@@ -3337,7 +3336,7 @@ pull_accesses_from_callee (isra_param_desc *param_desc,
return NULL;
if ((prop_count + pclen
- > (unsigned) PARAM_VALUE (PARAM_IPA_SRA_MAX_REPLACEMENTS))
+ > (unsigned) param_ipa_sra_max_replacements)
|| size_would_violate_limit_p (param_desc,
param_desc->size_reached + prop_size))
return "propagating accesses would violate the count or size limit";
diff --git a/gcc/ira-build.c b/gcc/ira-build.c
index 47ce189af47..e53bb813f37 100644
--- a/gcc/ira-build.c
+++ b/gcc/ira-build.c
@@ -2217,7 +2217,7 @@ loop_compare_func (const void *v1p, const void *v2p)
hardly helps (for irregular register file architecture it could
help by choosing a better hard register in the loop but we prefer
faster allocation even in this case). We also remove cheap loops
- if there are more than IRA_MAX_LOOPS_NUM of them. Loop with EH
+ if there are more than param_ira_max_loops_num of them. Loop with EH
exit or enter edges are removed too because the allocation might
require put pseudo moves on the EH edges (we could still do this
for pseudos with caller saved hard registers in some cases but it
@@ -2253,7 +2253,7 @@ mark_loops_for_removal (void)
);
}
qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
- for (i = 0; i < n - IRA_MAX_LOOPS_NUM; i++)
+ for (i = 0; i < n - param_ira_max_loops_num; i++)
{
sorted_loops[i]->to_remove_p = true;
if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL)
diff --git a/gcc/ira-conflicts.c b/gcc/ira-conflicts.c
index a0aefaa0549..8e7c0c41f2f 100644
--- a/gcc/ira-conflicts.c
+++ b/gcc/ira-conflicts.c
@@ -113,13 +113,13 @@ build_conflict_bit_table (void)
/ IRA_INT_BITS);
allocated_words_num += conflict_bit_vec_words_num;
if ((uint64_t) allocated_words_num * sizeof (IRA_INT_TYPE)
- > (uint64_t) IRA_MAX_CONFLICT_TABLE_SIZE * 1024 * 1024)
+ > (uint64_t) param_ira_max_conflict_table_size * 1024 * 1024)
{
if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL)
fprintf
(ira_dump_file,
"+++Conflict table will be too big(>%dMB) -- don't use it\n",
- IRA_MAX_CONFLICT_TABLE_SIZE);
+ param_ira_max_conflict_table_size);
return false;
}
}
diff --git a/gcc/loop-doloop.c b/gcc/loop-doloop.c
index ccd020a2dba..6a956a03b03 100644
--- a/gcc/loop-doloop.c
+++ b/gcc/loop-doloop.c
@@ -651,7 +651,7 @@ doloop_optimize (class loop *loop)
}
max_cost
- = COSTS_N_INSNS (PARAM_VALUE (PARAM_MAX_ITERATIONS_COMPUTATION_COST));
+ = COSTS_N_INSNS (param_max_iterations_computation_cost);
if (set_src_cost (desc->niter_expr, mode, optimize_loop_for_speed_p (loop))
> max_cost)
{
diff --git a/gcc/loop-invariant.c b/gcc/loop-invariant.c
index ef46c8aea22..d40ad37cced 100644
--- a/gcc/loop-invariant.c
+++ b/gcc/loop-invariant.c
@@ -1491,7 +1491,7 @@ gain_for_invariant (struct invariant *inv, unsigned *regs_needed,
if ((int) new_regs[pressure_class]
+ (int) regs_needed[pressure_class]
+ LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class]
- + IRA_LOOP_RESERVED_REGS
+ + param_ira_loop_reserved_regs
> ira_class_hard_regs_num[pressure_class])
break;
}
@@ -2279,7 +2279,7 @@ move_loop_invariants (void)
/* move_single_loop_invariants for very large loops is time consuming
and might need a lot of memory. For -O1 only do loop invariant
motion for very small loops. */
- unsigned max_bbs = LOOP_INVARIANT_MAX_BBS_IN_LOOP;
+ unsigned max_bbs = param_loop_invariant_max_bbs_in_loop;
if (optimize < 2)
max_bbs /= 10;
if (loop->num_nodes <= max_bbs)
diff --git a/gcc/loop-unroll.c b/gcc/loop-unroll.c
index 63fccd23fae..551405ad0d1 100644
--- a/gcc/loop-unroll.c
+++ b/gcc/loop-unroll.c
@@ -364,13 +364,13 @@ decide_unroll_constant_iterations (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once). */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
nunroll_by_av
- = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -684,12 +684,12 @@ decide_unroll_runtime_iterations (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once. */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
- nunroll_by_av = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
+ nunroll_by_av = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -1167,13 +1167,13 @@ decide_unroll_stupid (class loop *loop, int flags)
/* nunroll = total number of copies of the original loop body in
unrolled loop (i.e. if it is 2, we have to duplicate loop body once. */
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / loop->ninsns;
+ nunroll = param_max_unrolled_insns / loop->ninsns;
nunroll_by_av
- = PARAM_VALUE (PARAM_MAX_AVERAGE_UNROLLED_INSNS) / loop->av_ninsns;
+ = param_max_average_unrolled_insns / loop->av_ninsns;
if (nunroll > nunroll_by_av)
nunroll = nunroll_by_av;
- if (nunroll > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLL_TIMES))
- nunroll = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ if (nunroll > (unsigned) param_max_unroll_times)
+ nunroll = param_max_unroll_times;
if (targetm.loop_unroll_adjust)
nunroll = targetm.loop_unroll_adjust (nunroll, loop);
@@ -1824,7 +1824,7 @@ expand_var_during_unrolling (struct var_to_expand *ve, rtx_insn *insn)
/* Generate a new register only if the expansion limit has not been
reached. Else reuse an already existing expansion. */
- if (PARAM_VALUE (PARAM_MAX_VARIABLE_EXPANSIONS) > ve->expansion_count)
+ if (param_max_variable_expansions > ve->expansion_count)
{
really_new_expansion = true;
new_reg = gen_reg_rtx (GET_MODE (ve->reg));
diff --git a/gcc/lra-assigns.c b/gcc/lra-assigns.c
index e14a246c0d2..56ab9631089 100644
--- a/gcc/lra-assigns.c
+++ b/gcc/lra-assigns.c
@@ -1008,7 +1008,7 @@ spill_for (int regno, bitmap spilled_pseudo_bitmap, bool first_p)
}
n = 0;
if (sparseset_cardinality (live_range_reload_inheritance_pseudos)
- <= (unsigned)LRA_MAX_CONSIDERED_RELOAD_PSEUDOS)
+ <= (unsigned)param_lra_max_considered_reload_pseudos)
EXECUTE_IF_SET_IN_SPARSESET (live_range_reload_inheritance_pseudos,
reload_regno)
if ((int) reload_regno != regno
diff --git a/gcc/lra-constraints.c b/gcc/lra-constraints.c
index 0db6d3151cd..ced7be79017 100644
--- a/gcc/lra-constraints.c
+++ b/gcc/lra-constraints.c
@@ -6682,7 +6682,7 @@ inherit_in_ebb (rtx_insn *head, rtx_insn *tail)
a BB is not greater than the following value, we don't add the BB
to EBB. */
#define EBB_PROBABILITY_CUTOFF \
- ((REG_BR_PROB_BASE * LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF) / 100)
+ ((REG_BR_PROB_BASE * param_lra_inheritance_ebb_probability_cutoff) / 100)
/* Current number of inheritance/split iteration. */
int lra_inheritance_iter;
diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c
index 32090359814..5354350378b 100644
--- a/gcc/lto/lto-partition.c
+++ b/gcc/lto/lto-partition.c
@@ -560,13 +560,13 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
varpool_order.qsort (varpool_node_cmp);
/* Compute partition size and create the first partition. */
- if (PARAM_VALUE (MIN_PARTITION_SIZE) > max_partition_size)
+ if (param_min_partition_size > max_partition_size)
fatal_error (input_location, "min partition size cannot be greater "
"than max partition size");
partition_size = total_size / n_lto_partitions;
- if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
- partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
+ if (partition_size < param_min_partition_size)
+ partition_size = param_min_partition_size;
npartitions = 1;
partition = new_partition ("");
if (dump_file)
@@ -816,8 +816,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
fprintf (dump_file,
"Total size: %" PRId64 " partition_size: %" PRId64 "\n",
total_size, partition_size);
- if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
- partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
+ if (partition_size < param_min_partition_size)
+ partition_size = param_min_partition_size;
npartitions ++;
}
}
diff --git a/gcc/lto/lto.c b/gcc/lto/lto.c
index 9ef70da91a9..1d2d52754c7 100644
--- a/gcc/lto/lto.c
+++ b/gcc/lto/lto.c
@@ -436,14 +436,14 @@ do_whole_program_analysis (void)
/* TODO: jobserver communication is not supported, yet. */
if (!strcmp (flag_wpa, "jobserver"))
- lto_parallelism = PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM);
+ lto_parallelism = param_max_lto_streaming_parallelism;
else
{
lto_parallelism = atoi (flag_wpa);
if (lto_parallelism <= 0)
lto_parallelism = 0;
- if (lto_parallelism >= PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM))
- lto_parallelism = PARAM_VALUE (PARAM_MAX_LTO_STREAMING_PARALLELISM);
+ if (lto_parallelism >= param_max_lto_streaming_parallelism)
+ lto_parallelism = param_max_lto_streaming_parallelism;
}
timevar_start (TV_PHASE_OPT_GEN);
@@ -496,8 +496,8 @@ do_whole_program_analysis (void)
else if (flag_lto_partition == LTO_PARTITION_ONE)
lto_balanced_map (1, INT_MAX);
else if (flag_lto_partition == LTO_PARTITION_BALANCED)
- lto_balanced_map (PARAM_VALUE (PARAM_LTO_PARTITIONS),
- PARAM_VALUE (MAX_PARTITION_SIZE));
+ lto_balanced_map (param_lto_partitions,
+ param_max_partition_size);
else
gcc_unreachable ();
diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c
index c355594bb6b..3127fb1481e 100644
--- a/gcc/modulo-sched.c
+++ b/gcc/modulo-sched.c
@@ -1433,7 +1433,7 @@ sms_schedule (void)
if ( latch_edge->count () > profile_count::zero ()
&& (latch_edge->count()
< single_exit (loop)->count ().apply_scale
- (SMS_LOOP_AVERAGE_COUNT_THRESHOLD, 1)))
+ (param_sms_loop_average_count_threshold, 1)))
{
if (dump_file)
{
@@ -1640,7 +1640,7 @@ sms_schedule (void)
/* The default value of PARAM_SMS_MIN_SC is 2 as stage count of
1 means that there is no interleaving between iterations thus
we let the scheduling passes do the job in this case. */
- if (stage_count < PARAM_VALUE (PARAM_SMS_MIN_SC)
+ if (stage_count < param_sms_min_sc
|| (count_init && (loop_count <= stage_count))
|| (max_trip_count >= 0 && max_trip_count <= stage_count)
|| (trip_count >= 0 && trip_count <= stage_count))
@@ -1832,7 +1832,7 @@ sms_schedule (void)
/* A limit on the number of cycles that resource conflicts can span. ??? Should
be provided by DFA, and be dependent on the type of insn scheduled. Currently
set to 0 to save compile time. */
-#define DFA_HISTORY SMS_DFA_HISTORY
+#define DFA_HISTORY param_sms_dfa_history
/* A threshold for the number of repeated unsuccessful attempts to insert
an empty row, before we flush the partial schedule and start over. */
diff --git a/gcc/opts.c b/gcc/opts.c
index 394cbfd1c56..a47517df80e 100644
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -667,25 +667,18 @@ default_options_optimization (struct gcc_options *opts,
opts->x_flag_ipa_pta = true;
/* Track fields in field-sensitive alias analysis. */
- maybe_set_param_value
- (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
- opt2 ? 100 : default_param_value (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE),
- opts->x_param_values, opts_set->x_param_values);
+ if (opt2)
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_fields_for_field_sensitive,
+ 100);
if (opts->x_optimize_size)
/* We want to crossjump as much as possible. */
- maybe_set_param_value (PARAM_MIN_CROSSJUMP_INSNS, 1,
- opts->x_param_values, opts_set->x_param_values);
- else
- maybe_set_param_value (PARAM_MIN_CROSSJUMP_INSNS,
- default_param_value (PARAM_MIN_CROSSJUMP_INSNS),
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_min_crossjump_insns, 1);
/* Restrict the amount of work combine does at -Og while retaining
most of its useful transforms. */
if (opts->x_optimize_debug)
- maybe_set_param_value (PARAM_MAX_COMBINE_INSNS, 2,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_max_combine_insns, 2);
/* Allow default optimizations to be specified on a per-machine basis. */
maybe_default_options (opts, opts_set,
@@ -1036,10 +1029,8 @@ finish_options (struct gcc_options *opts, struct gcc_options *opts_set,
if (opts->x_flag_conserve_stack)
{
- maybe_set_param_value (PARAM_LARGE_STACK_FRAME, 100,
- opts->x_param_values, opts_set->x_param_values);
- maybe_set_param_value (PARAM_STACK_FRAME_GROWTH, 40,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_large_stack_frame, 100);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_stack_frame_growth, 40);
}
if (opts->x_flag_lto)
@@ -2272,19 +2263,13 @@ common_handle_option (struct gcc_options *opts,
all features. */
if (opts->x_flag_sanitize & SANITIZE_KERNEL_ADDRESS)
{
- maybe_set_param_value (PARAM_ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD,
- 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_GLOBALS, 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_STACK, 0, opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_PROTECT_ALLOCAS, 0,
- opts->x_param_values,
- opts_set->x_param_values);
- maybe_set_param_value (PARAM_ASAN_USE_AFTER_RETURN, 0,
- opts->x_param_values,
- opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_asan_instrumentation_with_call_threshold,
+ 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_globals, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_stack, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_protect_allocas, 0);
+ SET_OPTION_IF_UNSET (opts, opts_set, param_asan_use_after_return, 0);
}
break;
@@ -2586,9 +2571,8 @@ common_handle_option (struct gcc_options *opts,
enable_fdo_optimizations (opts, opts_set, value);
if (!opts_set->x_flag_profile_correction)
opts->x_flag_profile_correction = value;
- maybe_set_param_value (
- PARAM_EARLY_INLINER_MAX_ITERATIONS, 10,
- opts->x_param_values, opts_set->x_param_values);
+ SET_OPTION_IF_UNSET (opts, opts_set,
+ param_early_inliner_max_iterations, 10);
break;
case OPT_fprofile_generate_:
diff --git a/gcc/postreload-gcse.c b/gcc/postreload-gcse.c
index 0c12b3808a6..161e6d926b5 100644
--- a/gcc/postreload-gcse.c
+++ b/gcc/postreload-gcse.c
@@ -1146,17 +1146,18 @@ eliminate_partially_redundant_load (basic_block bb, rtx_insn *insn,
/* Check if it's worth applying the partial redundancy elimination. */
if (ok_count.to_gcov_type ()
- < GCSE_AFTER_RELOAD_PARTIAL_FRACTION * not_ok_count.to_gcov_type ())
+ < param_gcse_after_reload_partial_fraction * not_ok_count.to_gcov_type ())
goto cleanup;
gcov_type threshold;
#if (GCC_VERSION >= 5000)
- if (__builtin_mul_overflow (GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
+ if (__builtin_mul_overflow (param_gcse_after_reload_critical_fraction,
critical_count.to_gcov_type (), &threshold))
threshold = profile_count::max_count;
#else
threshold
- = GCSE_AFTER_RELOAD_CRITICAL_FRACTION * critical_count.to_gcov_type ();
+ = (param_gcse_after_reload_critical_fraction
+ * critical_count.to_gcov_type ());
#endif
if (ok_count.to_gcov_type () < threshold)
diff --git a/gcc/predict.c b/gcc/predict.c
index 915f0806b11..5ee56a33fd7 100644
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -132,7 +132,7 @@ get_hot_bb_threshold ()
{
if (min_count == -1)
{
- const int hot_frac = PARAM_VALUE (HOT_BB_COUNT_FRACTION);
+ const int hot_frac = param_hot_bb_count_fraction;
const gcov_type min_hot_count
= hot_frac
? profile_info->sum_max / hot_frac
@@ -177,7 +177,7 @@ maybe_hot_count_p (struct function *fun, profile_count count)
if (node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
&& count < (ENTRY_BLOCK_PTR_FOR_FN (fun)->count.apply_scale (2, 3)))
return false;
- if (count.apply_scale (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION), 1)
+ if (count.apply_scale (param_hot_bb_frequency_fraction, 1)
< ENTRY_BLOCK_PTR_FOR_FN (fun)->count)
return false;
return true;
@@ -223,7 +223,7 @@ probably_never_executed (struct function *fun, profile_count count)
desirable. */
if (count.precise_p () && profile_status_for_fn (fun) == PROFILE_READ)
{
- const int unlikely_frac = PARAM_VALUE (UNLIKELY_BB_COUNT_FRACTION);
+ const int unlikely_frac = param_unlikely_bb_count_fraction;
if (count.apply_scale (unlikely_frac, 1) >= profile_info->runs)
return false;
return true;
@@ -412,9 +412,9 @@ predictable_edge_p (edge e)
if (!e->probability.initialized_p ())
return false;
if ((e->probability.to_reg_br_prob_base ()
- <= PARAM_VALUE (PARAM_PREDICTABLE_BRANCH_OUTCOME) * REG_BR_PROB_BASE / 100)
+ <= param_predictable_branch_outcome * REG_BR_PROB_BASE / 100)
|| (REG_BR_PROB_BASE - e->probability.to_reg_br_prob_base ()
- <= PARAM_VALUE (PARAM_PREDICTABLE_BRANCH_OUTCOME) * REG_BR_PROB_BASE / 100))
+ <= param_predictable_branch_outcome * REG_BR_PROB_BASE / 100))
return true;
return false;
}
@@ -1963,7 +1963,7 @@ predict_loops (void)
{
tree niter = NULL;
HOST_WIDE_INT nitercst;
- int max = PARAM_VALUE (PARAM_MAX_PREDICTED_ITERATIONS);
+ int max = param_max_predicted_iterations;
int probability;
enum br_predictor predictor;
widest_int nit;
@@ -2443,7 +2443,7 @@ expr_expected_value_1 (tree type, tree op0, enum tree_code code,
*predictor = (enum br_predictor) tree_to_uhwi (val2);
if (*predictor == PRED_BUILTIN_EXPECT)
*probability
- = HITRATE (PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY));
+ = HITRATE (param_builtin_expect_probability);
return gimple_call_arg (def, 1);
}
return NULL;
@@ -2469,7 +2469,7 @@ expr_expected_value_1 (tree type, tree op0, enum tree_code code,
return val;
*predictor = PRED_BUILTIN_EXPECT;
*probability
- = HITRATE (PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY));
+ = HITRATE (param_builtin_expect_probability);
return gimple_call_arg (def, 1);
}
case BUILT_IN_EXPECT_WITH_PROBABILITY:
@@ -2660,7 +2660,7 @@ tree_predict_by_opcode (basic_block bb)
edge e = find_taken_edge_switch_expr (sw, val);
if (predictor == PRED_BUILTIN_EXPECT)
{
- int percent = PARAM_VALUE (BUILTIN_EXPECT_PROBABILITY);
+ int percent = param_builtin_expect_probability;
gcc_assert (percent >= 0 && percent <= 100);
predict_edge (e, PRED_BUILTIN_EXPECT,
HITRATE (percent));
@@ -3531,7 +3531,7 @@ drop_profile (struct cgraph_node *node, profile_count call_count)
void
handle_missing_profiles (void)
{
- const int unlikely_frac = PARAM_VALUE (UNLIKELY_BB_COUNT_FRACTION);
+ const int unlikely_frac = param_unlikely_bb_count_fraction;
struct cgraph_node *node;
auto_vec<struct cgraph_node *, 64> worklist;
diff --git a/gcc/reload.c b/gcc/reload.c
index 8582b4840ae..b8178238ff9 100644
--- a/gcc/reload.c
+++ b/gcc/reload.c
@@ -6717,7 +6717,7 @@ find_equiv_reg (rtx goal, rtx_insn *insn, enum reg_class rclass, int other,
continue;
num++;
if (p == 0 || LABEL_P (p)
- || num > PARAM_VALUE (PARAM_MAX_RELOAD_SEARCH_INSNS))
+ || num > param_max_reload_search_insns)
return 0;
/* Don't reuse register contents from before a setjmp-type
diff --git a/gcc/reorg.c b/gcc/reorg.c
index cba183e9c72..460741213f2 100644
--- a/gcc/reorg.c
+++ b/gcc/reorg.c
@@ -1489,7 +1489,7 @@ redundant_insn (rtx insn, rtx_insn *target, const vec<rtx_insn *> &delay_list)
/* Scan backwards looking for a match. */
for (trial = PREV_INSN (target),
- insns_to_search = MAX_DELAY_SLOT_INSN_SEARCH;
+ insns_to_search = param_max_delay_slot_insn_search;
trial && insns_to_search > 0;
trial = PREV_INSN (trial))
{
@@ -1593,7 +1593,7 @@ redundant_insn (rtx insn, rtx_insn *target, const vec<rtx_insn *> &delay_list)
INSN sets or sets something insn uses or sets. */
for (trial = PREV_INSN (target),
- insns_to_search = MAX_DELAY_SLOT_INSN_SEARCH;
+ insns_to_search = param_max_delay_slot_insn_search;
trial && !LABEL_P (trial) && insns_to_search > 0;
trial = PREV_INSN (trial))
{
diff --git a/gcc/resource.c b/gcc/resource.c
index bf2d6beaf39..5d16100ef48 100644
--- a/gcc/resource.c
+++ b/gcc/resource.c
@@ -928,7 +928,7 @@ mark_target_live_regs (rtx_insn *insns, rtx target_maybe_return, struct resource
}
if (b == -1)
- b = find_basic_block (target, MAX_DELAY_SLOT_LIVE_SEARCH);
+ b = find_basic_block (target, param_max_delay_slot_live_search);
if (target_hash_table != NULL)
{
@@ -1289,7 +1289,7 @@ clear_hashed_info_for_insn (rtx_insn *insn)
void
incr_ticks_for_insn (rtx_insn *insn)
{
- int b = find_basic_block (insn, MAX_DELAY_SLOT_LIVE_SEARCH);
+ int b = find_basic_block (insn, param_max_delay_slot_live_search);
if (b != -1)
bb_ticks[b]++;
diff --git a/gcc/sanopt.c b/gcc/sanopt.c
index 00ade872832..7a4daeaf458 100644
--- a/gcc/sanopt.c
+++ b/gcc/sanopt.c
@@ -1289,8 +1289,8 @@ pass_sanopt::execute (function *fun)
if (asan_sanitize_stack_p ())
sanitize_rewrite_addressable_params (fun);
- bool use_calls = ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD < INT_MAX
- && asan_num_accesses >= ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD;
+ bool use_calls = param_asan_instrumentation_with_call_threshold < INT_MAX
+ && asan_num_accesses >= param_asan_instrumentation_with_call_threshold;
hash_map<tree, tree> shadow_vars_mapping;
bool need_commit_edge_insert = false;
diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c
index 308db4e3ca0..7cd2e65ccac 100644
--- a/gcc/sched-deps.c
+++ b/gcc/sched-deps.c
@@ -2480,7 +2480,7 @@ sched_analyze_1 (class deps_desc *deps, rtx x, rtx_insn *insn)
/* Pending lists can't get larger with a readonly context. */
if (!deps->readonly
&& ((deps->pending_read_list_length + deps->pending_write_list_length)
- >= MAX_PENDING_LIST_LENGTH))
+ >= param_max_pending_list_length))
{
/* Flush all pending reads and writes to prevent the pending lists
from getting any larger. Insn scheduling runs too slowly when
@@ -2697,7 +2697,7 @@ sched_analyze_2 (class deps_desc *deps, rtx x, rtx_insn *insn)
{
if ((deps->pending_read_list_length
+ deps->pending_write_list_length)
- >= MAX_PENDING_LIST_LENGTH
+ >= param_max_pending_list_length
&& !DEBUG_INSN_P (insn))
flush_pending_lists (deps, insn, true, true);
add_insn_mem_dependence (deps, true, insn, x);
@@ -3222,8 +3222,8 @@ sched_analyze_insn (class deps_desc *deps, rtx x, rtx_insn *insn)
EXECUTE_IF_SET_IN_REG_SET (reg_pending_clobbers, 0, i, rsi)
{
struct deps_reg *reg_last = &deps->reg_last[i];
- if (reg_last->uses_length >= MAX_PENDING_LIST_LENGTH
- || reg_last->clobbers_length >= MAX_PENDING_LIST_LENGTH)
+ if (reg_last->uses_length >= param_max_pending_list_length
+ || reg_last->clobbers_length >= param_max_pending_list_length)
{
add_dependence_list_and_free (deps, insn, ®_last->sets, 0,
REG_DEP_OUTPUT, false);
@@ -3679,8 +3679,8 @@ deps_analyze_insn (class deps_desc *deps, rtx_insn *insn)
&& sel_insn_is_speculation_check (insn)))
{
/* Keep the list a reasonable size. */
- if (deps->pending_flush_length++ >= MAX_PENDING_LIST_LENGTH)
- flush_pending_lists (deps, insn, true, true);
+ if (deps->pending_flush_length++ >= param_max_pending_list_length)
+ flush_pending_lists (deps, insn, true, true);
else
deps->pending_jump_insns
= alloc_INSN_LIST (insn, deps->pending_jump_insns);
diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c
index a594b49ec66..c60afa340e7 100644
--- a/gcc/sched-ebb.c
+++ b/gcc/sched-ebb.c
@@ -620,9 +620,9 @@ schedule_ebbs (void)
return;
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
schedule_ebbs_init ();
diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c
index 3e0825075a3..6321692ed00 100644
--- a/gcc/sched-rgn.c
+++ b/gcc/sched-rgn.c
@@ -485,9 +485,9 @@ find_single_block_region (bool ebbs_p)
if (ebbs_p) {
int probability_cutoff;
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
FOR_EACH_BB_FN (ebb_start, cfun)
@@ -569,8 +569,8 @@ too_large (int block, int *num_bbs, int *num_insns)
(*num_insns) += (common_sched_info->estimate_number_of_insns
(BASIC_BLOCK_FOR_FN (cfun, block)));
- return ((*num_bbs > PARAM_VALUE (PARAM_MAX_SCHED_REGION_BLOCKS))
- || (*num_insns > PARAM_VALUE (PARAM_MAX_SCHED_REGION_INSNS)));
+ return ((*num_bbs > param_max_sched_region_blocks)
+ || (*num_insns > param_max_sched_region_insns));
}
/* Update_loop_relations(blk, hdr): Check if the loop headed by max_hdr[blk]
@@ -800,7 +800,7 @@ haifa_find_rgns (void)
queue = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
- extend_regions_p = PARAM_VALUE (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS) > 0;
+ extend_regions_p = param_max_sched_extend_regions_iters > 0;
if (extend_regions_p)
{
degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun));
@@ -1161,7 +1161,7 @@ extend_rgns (int *degree, int *idxp, sbitmap header, int *loop_hdr)
int *order, i, rescan = 0, idx = *idxp, iter = 0, max_iter, *max_hdr;
int nblocks = n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS;
- max_iter = PARAM_VALUE (PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS);
+ max_iter = param_max_sched_extend_regions_iters;
max_hdr = XNEWVEC (int, last_basic_block_for_fn (cfun));
@@ -2224,7 +2224,7 @@ new_ready (rtx_insn *next, ds_t ts)
|| (IS_SPECULATIVE_INSN (next)
&& ((recog_memoized (next) >= 0
&& min_insn_conflict_delay (curr_state, next, next)
- > PARAM_VALUE (PARAM_MAX_SCHED_INSN_CONFLICT_DELAY))
+ > param_max_sched_insn_conflict_delay)
|| IS_SPECULATION_CHECK_P (next)
|| !check_live (next, INSN_BB (next))
|| (not_ex_free = !is_exception_free (next, INSN_BB (next),
@@ -3188,8 +3188,9 @@ schedule_region (int rgn)
f = find_fallthru_edge (last_bb->succs);
if (f
&& (!f->probability.initialized_p ()
- || f->probability.to_reg_br_prob_base () * 100 / REG_BR_PROB_BASE >=
- PARAM_VALUE (PARAM_SCHED_STATE_EDGE_PROB_CUTOFF)))
+ || (f->probability.to_reg_br_prob_base () * 100
+ / REG_BR_PROB_BASE
+ >= param_sched_state_edge_prob_cutoff)))
{
memcpy (bb_state[f->dest->index], curr_state,
dfa_state_size);
@@ -3229,7 +3230,7 @@ schedule_region (int rgn)
void
sched_rgn_init (bool single_blocks_p)
{
- min_spec_prob = ((PARAM_VALUE (PARAM_MIN_SPEC_PROB) * REG_BR_PROB_BASE)
+ min_spec_prob = ((param_min_spec_prob * REG_BR_PROB_BASE)
/ 100);
nr_inter = 0;
diff --git a/gcc/sel-sched-ir.c b/gcc/sel-sched-ir.c
index 8a1d41473b9..d6513b136a0 100644
--- a/gcc/sel-sched-ir.c
+++ b/gcc/sel-sched-ir.c
@@ -6012,7 +6012,7 @@ make_region_from_loop (class loop *loop)
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. */
@@ -6021,7 +6021,7 @@ make_region_from_loop (class loop *loop)
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);
diff --git a/gcc/sel-sched-ir.h b/gcc/sel-sched-ir.h
index ddc76a73ede..531b0129cd9 100644
--- a/gcc/sel-sched-ir.h
+++ b/gcc/sel-sched-ir.h
@@ -969,7 +969,7 @@ extern bool preheader_removed;
/* Software lookahead window size.
According to the results in Nakatani and Ebcioglu [1993], window size of 16
is enough to extract most ILP in integer code. */
-#define MAX_WS (PARAM_VALUE (PARAM_SELSCHED_MAX_LOOKAHEAD))
+#define MAX_WS (param_selsched_max_lookahead)
extern regset sel_all_regs;
\f
diff --git a/gcc/sel-sched.c b/gcc/sel-sched.c
index 652784e79ed..2ecc06d0f17 100644
--- a/gcc/sel-sched.c
+++ b/gcc/sel-sched.c
@@ -3454,7 +3454,7 @@ process_pipelined_exprs (av_set_t *av_ptr)
FOR_EACH_EXPR_1 (expr, si, av_ptr)
{
if (EXPR_SCHED_TIMES (expr)
- >= PARAM_VALUE (PARAM_SELSCHED_MAX_SCHED_TIMES))
+ >= param_selsched_max_sched_times)
av_set_iter_remove (&si);
}
}
@@ -6806,7 +6806,7 @@ sel_setup_region_sched_flags (void)
&& (flag_sel_sched_pipelining != 0)
&& current_loop_nest != NULL
&& loop_has_exit_edges (current_loop_nest));
- max_insns_to_rename = PARAM_VALUE (PARAM_SELSCHED_INSNS_TO_RENAME);
+ max_insns_to_rename = param_selsched_insns_to_rename;
max_ws = MAX_WS;
}
diff --git a/gcc/shrink-wrap.c b/gcc/shrink-wrap.c
index 2dc92c34b17..e612f85c15a 100644
--- a/gcc/shrink-wrap.c
+++ b/gcc/shrink-wrap.c
@@ -775,7 +775,7 @@ try_shrink_wrapping (edge *entry_edge, rtx_insn *prologue_seq)
vec.quick_push (pro);
unsigned max_grow_size = get_uncond_jump_length ();
- max_grow_size *= PARAM_VALUE (PARAM_MAX_GROW_COPY_BB_INSNS);
+ max_grow_size *= param_max_grow_copy_bb_insns;
while (!vec.is_empty () && pro != entry)
{
diff --git a/gcc/targhooks.c b/gcc/targhooks.c
index fee4cc271cd..2f26e468b8a 100644
--- a/gcc/targhooks.c
+++ b/gcc/targhooks.c
@@ -2274,17 +2274,18 @@ default_max_noce_ifcvt_seq_cost (edge e)
{
bool predictable_p = predictable_edge_p (e);
- enum compiler_param param
- = (predictable_p
- ? PARAM_MAX_RTL_IF_CONVERSION_PREDICTABLE_COST
- : PARAM_MAX_RTL_IF_CONVERSION_UNPREDICTABLE_COST);
-
- /* If we have a parameter set, use that, otherwise take a guess using
- BRANCH_COST. */
- if (global_options_set.x_param_values[param])
- return PARAM_VALUE (param);
+ if (predictable_p)
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_predictable_cost)
+ return param_max_rtl_if_conversion_predictable_cost;
+ }
else
- return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3);
+ {
+ if (global_options_set.x_param_max_rtl_if_conversion_unpredictable_cost)
+ return param_max_rtl_if_conversion_unpredictable_cost;
+ }
+
+ return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3);
}
/* Default implementation of TARGET_MIN_ARITHMETIC_PRECISION. */
diff --git a/gcc/toplev.c b/gcc/toplev.c
index 18fea1c3dd1..a836646f8a1 100644
--- a/gcc/toplev.c
+++ b/gcc/toplev.c
@@ -679,7 +679,7 @@ print_version (FILE *file, const char *indent, bool show_global_state)
fprintf (file,
file == stderr ? _(fmt4) : fmt4,
indent, *indent != 0 ? " " : "",
- PARAM_VALUE (GGC_MIN_EXPAND), PARAM_VALUE (GGC_MIN_HEAPSIZE));
+ param_ggc_min_expand, param_ggc_min_heapsize);
print_plugins_versions (file, indent);
}
@@ -1863,7 +1863,7 @@ process_options (void)
if (flag_checking >= 2)
hash_table_sanitize_eq_limit
- = PARAM_VALUE (PARAM_HASH_TABLE_VERIFICATION_LIMIT);
+ = param_hash_table_verification_limit;
/* Please don't change global_options after this point, those changes won't
be reflected in optimization_{default,current}_node. */
diff --git a/gcc/tracer.c b/gcc/tracer.c
index 52f07c56f03..02203923369 100644
--- a/gcc/tracer.c
+++ b/gcc/tracer.c
@@ -276,13 +276,13 @@ tail_duplicate (void)
initialize_original_copy_tables ();
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
+ probability_cutoff = param_tracer_min_branch_probability_feedback;
else
- probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
+ probability_cutoff = param_tracer_min_branch_probability;
probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
branch_ratio_cutoff =
- (REG_BR_PROB_BASE / 100 * PARAM_VALUE (TRACER_MIN_BRANCH_RATIO));
+ (REG_BR_PROB_BASE / 100 * param_tracer_min_branch_ratio);
FOR_EACH_BB_FN (bb, cfun)
{
@@ -296,11 +296,11 @@ tail_duplicate (void)
}
if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
- cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE_FEEDBACK);
+ cover_insns = param_tracer_dynamic_coverage_feedback;
else
- cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE);
+ cover_insns = param_tracer_dynamic_coverage;
cover_insns = (weighted_insns * cover_insns + 50) / 100;
- max_dup_insns = (ninsns * PARAM_VALUE (TRACER_MAX_CODE_GROWTH) + 50) / 100;
+ max_dup_insns = (ninsns * param_tracer_max_code_growth + 50) / 100;
while (traced_insns < cover_insns && nduplicated < max_dup_insns
&& !heap.empty ())
diff --git a/gcc/trans-mem.c b/gcc/trans-mem.c
index 2e775286540..4a0f6e7dee9 100644
--- a/gcc/trans-mem.c
+++ b/gcc/trans-mem.c
@@ -1108,7 +1108,7 @@ tm_log_add (basic_block entry_block, tree addr, gimple *stmt)
&& TYPE_SIZE_UNIT (type) != NULL
&& tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
&& ((HOST_WIDE_INT) tree_to_uhwi (TYPE_SIZE_UNIT (type))
- < PARAM_VALUE (PARAM_TM_MAX_AGGREGATE_SIZE))
+ < param_tm_max_aggregate_size)
/* We must be able to copy this type normally. I.e., no
special constructors and the like. */
&& !TREE_ADDRESSABLE (type))
diff --git a/gcc/tree-chrec.c b/gcc/tree-chrec.c
index 5ed62260993..8d5fce30289 100644
--- a/gcc/tree-chrec.c
+++ b/gcc/tree-chrec.c
@@ -333,9 +333,9 @@ chrec_fold_plus_1 (enum tree_code code, tree type,
int size = 0;
if ((tree_contains_chrecs (op0, &size)
|| tree_contains_chrecs (op1, &size))
- && size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ && size < param_scev_max_expr_size)
return build2 (code, type, op0, op1);
- else if (size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ else if (size < param_scev_max_expr_size)
{
if (code == POINTER_PLUS_EXPR)
return fold_build_pointer_plus (fold_convert (type, op0),
diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c
index 7f75b7e3afe..e9fa4ae69c3 100644
--- a/gcc/tree-data-ref.c
+++ b/gcc/tree-data-ref.c
@@ -836,7 +836,7 @@ split_constant_offset (tree exp, tree *var, tree *off,
void
split_constant_offset (tree exp, tree *var, tree *off)
{
- unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ unsigned limit = param_ssa_name_def_chain_limit;
static hash_map<tree, std::pair<tree, tree> > *cache;
if (!cache)
cache = new hash_map<tree, std::pair<tree, tree> > (37);
@@ -4917,7 +4917,7 @@ compute_all_dependences (vec<data_reference_p> datarefs,
unsigned int i, j;
if ((int) datarefs.length ()
- > PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ > param_loop_max_datarefs_for_datadeps)
{
struct data_dependence_relation *ddr;
diff --git a/gcc/tree-if-conv.c b/gcc/tree-if-conv.c
index df9046a3014..09560198539 100644
--- a/gcc/tree-if-conv.c
+++ b/gcc/tree-if-conv.c
@@ -125,7 +125,7 @@ along with GCC; see the file COPYING3. If not see
/* Only handle PHIs with no more arguments unless we are asked to by
simd pragma. */
#define MAX_PHI_ARG_NUM \
- ((unsigned) PARAM_VALUE (PARAM_MAX_TREE_IF_CONVERSION_PHI_ARGS))
+ ((unsigned) param_max_tree_if_conversion_phi_args)
/* True if we've converted a statement that was only executed when some
condition C was true, and if for correctness we need to predicate the
diff --git a/gcc/tree-inline.c b/gcc/tree-inline.c
index 63274f74679..b05f05d446a 100644
--- a/gcc/tree-inline.c
+++ b/gcc/tree-inline.c
@@ -1812,7 +1812,7 @@ remap_gimple_stmt (gimple *stmt, copy_body_data *id)
/* If the inlined function has too many debug markers,
don't copy them. */
if (id->src_cfun->debug_marker_count
- > PARAM_VALUE (PARAM_MAX_DEBUG_MARKER_COUNT))
+ > param_max_debug_marker_count)
return stmts;
gdebug *copy = as_a <gdebug *> (gimple_copy (stmt));
diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c
index 81784866ad1..9930daaafa9 100644
--- a/gcc/tree-loop-distribution.c
+++ b/gcc/tree-loop-distribution.c
@@ -119,7 +119,7 @@ along with GCC; see the file COPYING3. If not see
#define MAX_DATAREFS_NUM \
- ((unsigned) PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ ((unsigned) param_loop_max_datarefs_for_datadeps)
/* Threshold controlling number of distributed partitions. Given it may
be unnecessary if a memory stream cost model is invented in the future,
diff --git a/gcc/tree-parloops.c b/gcc/tree-parloops.c
index ae880e151db..1a35c7dbdc3 100644
--- a/gcc/tree-parloops.c
+++ b/gcc/tree-parloops.c
@@ -890,7 +890,7 @@ parloops_force_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info
/* Minimal number of iterations of a loop that should be executed in each
thread. */
-#define MIN_PER_THREAD PARAM_VALUE (PARAM_PARLOOPS_MIN_PER_THREAD)
+#define MIN_PER_THREAD param_parloops_min_per_thread
/* Element of the hashtable, representing a
reduction in the current loop. */
@@ -2875,25 +2875,23 @@ create_parallel_loop (class loop *loop, tree loop_fn, tree data,
else
{
t = build_omp_clause (loc, OMP_CLAUSE_SCHEDULE);
- int chunk_size = PARAM_VALUE (PARAM_PARLOOPS_CHUNK_SIZE);
- enum PARAM_PARLOOPS_SCHEDULE_KIND schedule_type \
- = (enum PARAM_PARLOOPS_SCHEDULE_KIND) PARAM_VALUE (PARAM_PARLOOPS_SCHEDULE);
- switch (schedule_type)
+ int chunk_size = param_parloops_chunk_size;
+ switch (param_parloops_schedule)
{
- case PARAM_PARLOOPS_SCHEDULE_KIND_static:
+ case PARLOOPS_SCHEDULE_STATIC:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_STATIC;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_dynamic:
+ case PARLOOPS_SCHEDULE_DYNAMIC:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_guided:
+ case PARLOOPS_SCHEDULE_GUIDED:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_GUIDED;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_auto:
+ case PARLOOPS_SCHEDULE_AUTO:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_AUTO;
chunk_size = 0;
break;
- case PARAM_PARLOOPS_SCHEDULE_KIND_runtime:
+ case PARLOOPS_SCHEDULE_RUNTIME:
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_RUNTIME;
chunk_size = 0;
break;
diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c
index 299c45e287b..3fe2a6dcb0a 100644
--- a/gcc/tree-predcom.c
+++ b/gcc/tree-predcom.c
@@ -2194,7 +2194,7 @@ determine_unroll_factor (vec<chain_p> chains)
{
chain_p chain;
unsigned factor = 1, af, nfactor, i;
- unsigned max = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES);
+ unsigned max = param_max_unroll_times;
FOR_EACH_VEC_ELT (chains, i, chain)
{
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c
index 50b2700834e..ed5d5663a3a 100644
--- a/gcc/tree-scalar-evolution.c
+++ b/gcc/tree-scalar-evolution.c
@@ -1149,7 +1149,7 @@ tail_recurse:
return t_false;
/* Give up if the path is longer than the MAX that we allow. */
- if (limit > PARAM_VALUE (PARAM_SCEV_MAX_EXPR_COMPLEXITY))
+ if (limit > param_scev_max_expr_complexity)
{
*evolution_of_loop = chrec_dont_know;
return t_dont_know;
@@ -2623,7 +2623,7 @@ instantiate_scev_r (edge instantiate_below,
bool *fold_conversions, int size_expr)
{
/* Give up if the expression is larger than the MAX that we allow. */
- if (size_expr++ > PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE))
+ if (size_expr++ > param_scev_max_expr_size)
return chrec_dont_know;
if (chrec == NULL_TREE
diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index 8bcfef42e35..d739aed9e44 100644
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -2787,16 +2787,21 @@ analyze_all_variable_accesses (void)
unsigned i;
bool optimize_speed_p = !optimize_function_for_size_p (cfun);
- enum compiler_param param = optimize_speed_p
- ? PARAM_SRA_MAX_SCALARIZATION_SIZE_SPEED
- : PARAM_SRA_MAX_SCALARIZATION_SIZE_SIZE;
-
/* If the user didn't set PARAM_SRA_MAX_SCALARIZATION_SIZE_<...>,
fall back to a target default. */
unsigned HOST_WIDE_INT max_scalarization_size
- = global_options_set.x_param_values[param]
- ? PARAM_VALUE (param)
- : get_move_ratio (optimize_speed_p) * UNITS_PER_WORD;
+ = get_move_ratio (optimize_speed_p) * UNITS_PER_WORD;
+
+ if (optimize_speed_p)
+ {
+ if (global_options_set.x_param_sra_max_scalarization_size_speed)
+ max_scalarization_size = param_sra_max_scalarization_size_speed;
+ }
+ else
+ {
+ if (global_options_set.x_param_sra_max_scalarization_size_size)
+ max_scalarization_size = param_sra_max_scalarization_size_size;
+ }
max_scalarization_size *= BITS_PER_UNIT;
diff --git a/gcc/tree-ssa-ccp.c b/gcc/tree-ssa-ccp.c
index 567aef8bc26..335787e0517 100644
--- a/gcc/tree-ssa-ccp.c
+++ b/gcc/tree-ssa-ccp.c
@@ -2195,7 +2195,7 @@ fold_builtin_alloca_with_align (gimple *stmt)
size = tree_to_uhwi (arg);
/* Heuristic: don't fold large allocas. */
- threshold = (unsigned HOST_WIDE_INT)PARAM_VALUE (PARAM_LARGE_STACK_FRAME);
+ threshold = (unsigned HOST_WIDE_INT)param_large_stack_frame;
/* In case the alloca is located at function entry, it has the same lifetime
as a declared array, so we allow a larger size. */
block = gimple_block (stmt);
diff --git a/gcc/tree-ssa-dse.c b/gcc/tree-ssa-dse.c
index 21a15eef690..1b060d9e408 100644
--- a/gcc/tree-ssa-dse.c
+++ b/gcc/tree-ssa-dse.c
@@ -238,7 +238,7 @@ setup_live_bytes_from_ref (ao_ref *ref, sbitmap live_bytes)
if (valid_ao_ref_for_dse (ref)
&& ref->size.is_constant (&const_size)
&& (const_size / BITS_PER_UNIT
- <= PARAM_VALUE (PARAM_DSE_MAX_OBJECT_SIZE)))
+ <= param_dse_max_object_size))
{
bitmap_clear (live_bytes);
bitmap_set_range (live_bytes, 0, const_size / BITS_PER_UNIT);
@@ -611,7 +611,7 @@ dse_optimize_redundant_stores (gimple *stmt)
FOR_EACH_IMM_USE_STMT (use_stmt, ui, defvar)
{
/* Limit stmt walking. */
- if (++cnt > PARAM_VALUE (PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE))
+ if (++cnt > param_dse_max_alias_queries_per_store)
BREAK_FROM_IMM_USE_STMT (ui);
/* If USE_STMT stores 0 into one or more of the same locations
@@ -704,7 +704,7 @@ dse_classify_store (ao_ref *ref, gimple *stmt,
FOR_EACH_IMM_USE_STMT (use_stmt, ui, defvar)
{
/* Limit stmt walking. */
- if (++cnt > PARAM_VALUE (PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE))
+ if (++cnt > param_dse_max_alias_queries_per_store)
{
fail = true;
BREAK_FROM_IMM_USE_STMT (ui);
@@ -853,7 +853,7 @@ class dse_dom_walker : public dom_walker
public:
dse_dom_walker (cdi_direction direction)
: dom_walker (direction),
- m_live_bytes (PARAM_VALUE (PARAM_DSE_MAX_OBJECT_SIZE)),
+ m_live_bytes (param_dse_max_object_size),
m_byte_tracking_enabled (false) {}
virtual edge before_dom_children (basic_block);
diff --git a/gcc/tree-ssa-ifcombine.c b/gcc/tree-ssa-ifcombine.c
index 21c1b0e8918..fa3bc0a4377 100644
--- a/gcc/tree-ssa-ifcombine.c
+++ b/gcc/tree-ssa-ifcombine.c
@@ -565,9 +565,9 @@ ifcombine_ifandif (basic_block inner_cond_bb, bool inner_inv,
tree t1, t2;
gimple_stmt_iterator gsi;
bool logical_op_non_short_circuit = LOGICAL_OP_NON_SHORT_CIRCUIT;
- if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT) != -1)
+ if (param_logical_op_non_short_circuit != -1)
logical_op_non_short_circuit
- = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT);
+ = param_logical_op_non_short_circuit;
if (!logical_op_non_short_circuit || flag_sanitize_coverage)
return false;
/* Only do this optimization if the inner bb contains only the conditional. */
diff --git a/gcc/tree-ssa-loop-ch.c b/gcc/tree-ssa-loop-ch.c
index 5a30a296d5e..fd6d74d5891 100644
--- a/gcc/tree-ssa-loop-ch.c
+++ b/gcc/tree-ssa-loop-ch.c
@@ -368,7 +368,7 @@ ch_base::copy_headers (function *fun)
FOR_EACH_LOOP (loop, 0)
{
- int initial_limit = PARAM_VALUE (PARAM_MAX_LOOP_HEADER_INSNS);
+ int initial_limit = param_max_loop_header_insns;
int remaining_limit = initial_limit;
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
diff --git a/gcc/tree-ssa-loop-im.c b/gcc/tree-ssa-loop-im.c
index 78664188c45..cd1aa563e21 100644
--- a/gcc/tree-ssa-loop-im.c
+++ b/gcc/tree-ssa-loop-im.c
@@ -230,7 +230,7 @@ static bool ref_indep_loop_p (class loop *, im_mem_ref *);
static bool ref_always_accessed_p (class loop *, im_mem_ref *, bool);
/* Minimum cost of an expensive expression. */
-#define LIM_EXPENSIVE ((unsigned) PARAM_VALUE (PARAM_LIM_EXPENSIVE))
+#define LIM_EXPENSIVE ((unsigned) param_lim_expensive)
/* The outermost loop for which execution of the header guarantees that the
block will be executed. */
diff --git a/gcc/tree-ssa-loop-ivcanon.c b/gcc/tree-ssa-loop-ivcanon.c
index c505f85f91a..7b352431225 100644
--- a/gcc/tree-ssa-loop-ivcanon.c
+++ b/gcc/tree-ssa-loop-ivcanon.c
@@ -739,7 +739,7 @@ try_unroll_loop_completely (class loop *loop,
return false;
if (!loop->unroll
- && n_unroll > (unsigned) PARAM_VALUE (PARAM_MAX_COMPLETELY_PEEL_TIMES))
+ && n_unroll > (unsigned) param_max_completely_peel_times)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d "
@@ -780,7 +780,7 @@ try_unroll_loop_completely (class loop *loop,
bool large
= tree_estimate_loop_size
(loop, remove_exit ? exit : NULL, edge_to_cancel, &size,
- PARAM_VALUE (PARAM_MAX_COMPLETELY_PEELED_INSNS));
+ param_max_completely_peeled_insns);
if (large)
{
if (dump_file && (dump_flags & TDF_DETAILS))
@@ -864,7 +864,7 @@ try_unroll_loop_completely (class loop *loop,
blow the branch predictor tables. Limit number of
branches on the hot path through the peeled sequence. */
else if (size.num_branches_on_hot_path * (int)n_unroll
- > PARAM_VALUE (PARAM_MAX_PEEL_BRANCHES))
+ > param_max_peel_branches)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d: "
@@ -874,7 +874,7 @@ try_unroll_loop_completely (class loop *loop,
return false;
}
else if (unr_insns
- > (unsigned) PARAM_VALUE (PARAM_MAX_COMPLETELY_PEELED_INSNS))
+ > (unsigned) param_max_completely_peeled_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Not unrolling loop %d: "
@@ -998,7 +998,7 @@ try_peel_loop (class loop *loop,
int peeled_size;
if (!flag_peel_loops
- || PARAM_VALUE (PARAM_MAX_PEEL_TIMES) <= 0
+ || param_max_peel_times <= 0
|| !peeled_loops)
return false;
@@ -1057,7 +1057,7 @@ try_peel_loop (class loop *loop,
/* We want to peel estimated number of iterations + 1 (so we never
enter the loop on quick path). Check against PARAM_MAX_PEEL_TIMES
and be sure to avoid overflows. */
- if (npeel > PARAM_VALUE (PARAM_MAX_PEEL_TIMES) - 1)
+ if (npeel > param_max_peel_times - 1)
{
if (dump_file)
fprintf (dump_file, "Not peeling: rolls too much "
@@ -1068,9 +1068,9 @@ try_peel_loop (class loop *loop,
/* Check peeled loops size. */
tree_estimate_loop_size (loop, exit, NULL, &size,
- PARAM_VALUE (PARAM_MAX_PEELED_INSNS));
+ param_max_peeled_insns);
if ((peeled_size = estimated_peeled_sequence_size (&size, (int) npeel))
- > PARAM_VALUE (PARAM_MAX_PEELED_INSNS))
+ > param_max_peeled_insns)
{
if (dump_file)
fprintf (dump_file, "Not peeling: peeled sequence size is too large "
@@ -1502,7 +1502,7 @@ tree_unroll_loops_completely (bool may_increase_size, bool unroll_outer)
BITMAP_FREE (loop_closed_ssa_invalidated);
}
while (changed
- && ++iteration <= PARAM_VALUE (PARAM_MAX_UNROLL_ITERATIONS));
+ && ++iteration <= param_max_unroll_iterations);
BITMAP_FREE (father_bbs);
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index ceaa327e408..78efd62a9a5 100644
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -152,8 +152,8 @@ avg_loop_niter (class loop *loop)
{
niter = likely_max_stmt_executions_int (loop);
- if (niter == -1 || niter > PARAM_VALUE (PARAM_AVG_LOOP_NITER))
- return PARAM_VALUE (PARAM_AVG_LOOP_NITER);
+ if (niter == -1 || niter > param_avg_loop_niter)
+ return param_avg_loop_niter;
}
return niter;
@@ -716,19 +716,19 @@ struct iv_ca_delta
/* Bound on number of candidates below that all candidates are considered. */
#define CONSIDER_ALL_CANDIDATES_BOUND \
- ((unsigned) PARAM_VALUE (PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND))
+ ((unsigned) param_iv_consider_all_candidates_bound)
/* If there are more iv occurrences, we just give up (it is quite unlikely that
optimizing such a loop would help, and it would take ages). */
#define MAX_CONSIDERED_GROUPS \
- ((unsigned) PARAM_VALUE (PARAM_IV_MAX_CONSIDERED_USES))
+ ((unsigned) param_iv_max_considered_uses)
/* If there are at most this number of ivs in the set, try removing unnecessary
ivs from the set always. */
#define ALWAYS_PRUNE_CAND_SET_BOUND \
- ((unsigned) PARAM_VALUE (PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND))
+ ((unsigned) param_iv_always_prune_cand_set_bound)
/* The list of trees for that the decl_rtl field must be reset is stored
here. */
diff --git a/gcc/tree-ssa-loop-manip.c b/gcc/tree-ssa-loop-manip.c
index 6a1bbaae573..06f90160047 100644
--- a/gcc/tree-ssa-loop-manip.c
+++ b/gcc/tree-ssa-loop-manip.c
@@ -984,7 +984,7 @@ can_unroll_loop_p (class loop *loop, unsigned factor,
/* The final loop should be small enough. */
if (tree_num_loop_insns (loop, &eni_size_weights) * factor
- > (unsigned) PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS))
+ > (unsigned) param_max_unrolled_insns)
return false;
return true;
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c
index db666f01980..fe24a70451d 100644
--- a/gcc/tree-ssa-loop-niter.c
+++ b/gcc/tree-ssa-loop-niter.c
@@ -2863,7 +2863,7 @@ finite_loop_p (class loop *loop)
/* Bound on the number of iterations we try to evaluate. */
#define MAX_ITERATIONS_TO_TRACK \
- ((unsigned) PARAM_VALUE (PARAM_MAX_ITERATIONS_TO_TRACK))
+ ((unsigned) param_max_iterations_to_track)
/* Returns the loop phi node of LOOP such that ssa name X is derived from its
result by a chain of operations such that all but exactly one of their
diff --git a/gcc/tree-ssa-loop-prefetch.c b/gcc/tree-ssa-loop-prefetch.c
index 04ff5244b69..cb22657c309 100644
--- a/gcc/tree-ssa-loop-prefetch.c
+++ b/gcc/tree-ssa-loop-prefetch.c
@@ -167,7 +167,7 @@ along with GCC; see the file COPYING3. If not see
of cache hierarchy). */
#ifndef PREFETCH_BLOCK
-#define PREFETCH_BLOCK L1_CACHE_LINE_SIZE
+#define PREFETCH_BLOCK param_l1_cache_line_size
#endif
/* Do we have a forward hardware sequential prefetching? */
@@ -191,8 +191,8 @@ along with GCC; see the file COPYING3. If not see
#define ACCEPTABLE_MISS_RATE 50
#endif
-#define L1_CACHE_SIZE_BYTES ((unsigned) (L1_CACHE_SIZE * 1024))
-#define L2_CACHE_SIZE_BYTES ((unsigned) (L2_CACHE_SIZE * 1024))
+#define L1_CACHE_SIZE_BYTES ((unsigned) (param_l1_cache_size * 1024))
+#define L2_CACHE_SIZE_BYTES ((unsigned) (param_l2_cache_size * 1024))
/* We consider a memory access nontemporal if it is not reused sooner than
after L2_CACHE_SIZE_BYTES of memory are accessed. However, we ignore
@@ -993,7 +993,8 @@ static bool
should_issue_prefetch_p (struct mem_ref *ref)
{
/* Do we want to issue prefetches for non-constant strides? */
- if (!cst_and_fits_in_hwi (ref->group->step) && PREFETCH_DYNAMIC_STRIDES == 0)
+ if (!cst_and_fits_in_hwi (ref->group->step)
+ && param_prefetch_dynamic_strides == 0)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1008,14 +1009,14 @@ should_issue_prefetch_p (struct mem_ref *ref)
range. */
if (cst_and_fits_in_hwi (ref->group->step)
&& abs_hwi (int_cst_value (ref->group->step))
- < (HOST_WIDE_INT) PREFETCH_MINIMUM_STRIDE)
+ < (HOST_WIDE_INT) param_prefetch_minimum_stride)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
"Step for reference %u:%u (" HOST_WIDE_INT_PRINT_DEC
") is less than the mininum required stride of %d\n",
ref->group->uid, ref->uid, int_cst_value (ref->group->step),
- PREFETCH_MINIMUM_STRIDE);
+ param_prefetch_minimum_stride);
return false;
}
@@ -1055,8 +1056,9 @@ schedule_prefetches (struct mem_ref_group *groups, unsigned unroll_factor,
struct mem_ref *ref;
bool any = false;
- /* At most SIMULTANEOUS_PREFETCHES should be running at the same time. */
- remaining_prefetch_slots = SIMULTANEOUS_PREFETCHES;
+ /* At most param_simultaneous_prefetches should be running
+ at the same time. */
+ remaining_prefetch_slots = param_simultaneous_prefetches;
/* The prefetch will run for AHEAD iterations of the original loop, i.e.,
AHEAD / UNROLL_FACTOR iterations of the unrolled loop. In each iteration,
@@ -1406,7 +1408,7 @@ determine_unroll_factor (class loop *loop, struct mem_ref_group *refs,
us from unrolling the loops too many times in cases where we only expect
gains from better scheduling and decreasing loop overhead, which is not
the case here. */
- upper_bound = PARAM_VALUE (PARAM_MAX_UNROLLED_INSNS) / ninsns;
+ upper_bound = param_max_unrolled_insns / ninsns;
/* If we unrolled the loop more times than it iterates, the unrolled version
of the loop would be never entered. */
@@ -1459,7 +1461,7 @@ volume_of_references (struct mem_ref_group *refs)
accessed in each iteration. TODO -- in the latter case, we should
take the size of the reference into account, rounding it up on cache
line size multiple. */
- volume += L1_CACHE_LINE_SIZE / ref->prefetch_mod;
+ volume += param_l1_cache_line_size / ref->prefetch_mod;
}
return volume;
}
@@ -1512,7 +1514,7 @@ add_subscript_strides (tree access_fn, unsigned stride,
if (tree_fits_shwi_p (step))
astep = tree_to_shwi (step);
else
- astep = L1_CACHE_LINE_SIZE;
+ astep = param_l1_cache_line_size;
strides[n - 1 - loop_depth (loop) + loop_depth (aloop)] += astep * stride;
@@ -1562,7 +1564,7 @@ self_reuse_distance (data_reference_p dr, unsigned *loop_sizes, unsigned n,
if (tree_fits_uhwi_p (stride))
astride = tree_to_uhwi (stride);
else
- astride = L1_CACHE_LINE_SIZE;
+ astride = param_l1_cache_line_size;
ref = TREE_OPERAND (ref, 0);
}
@@ -1578,7 +1580,7 @@ self_reuse_distance (data_reference_p dr, unsigned *loop_sizes, unsigned n,
s = strides[i] < 0 ? -strides[i] : strides[i];
- if (s < (unsigned) L1_CACHE_LINE_SIZE
+ if (s < (unsigned) param_l1_cache_line_size
&& (loop_sizes[i]
> (unsigned) (L1_CACHE_SIZE_BYTES / NONTEMPORAL_FRACTION)))
{
@@ -1825,7 +1827,7 @@ mem_ref_count_reasonable_p (unsigned ninsns, unsigned mem_ref_count)
should account for cache misses. */
insn_to_mem_ratio = ninsns / mem_ref_count;
- if (insn_to_mem_ratio < PREFETCH_MIN_INSN_TO_MEM_RATIO)
+ if (insn_to_mem_ratio < param_prefetch_min_insn_to_mem_ratio)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1862,7 +1864,7 @@ insn_to_prefetch_ratio_too_small_p (unsigned ninsns, unsigned prefetch_count,
and the exit branches will get eliminated), so it might be better to use
tree_estimate_loop_size + estimated_unrolled_size. */
insn_to_prefetch_ratio = (unroll_factor * ninsns) / prefetch_count;
- if (insn_to_prefetch_ratio < MIN_INSN_TO_PREFETCH_RATIO)
+ if (insn_to_prefetch_ratio < param_min_insn_to_prefetch_ratio)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -1902,7 +1904,7 @@ loop_prefetch_arrays (class loop *loop)
if (time == 0)
return false;
- ahead = (PREFETCH_LATENCY + time - 1) / time;
+ ahead = (param_prefetch_latency + time - 1) / time;
est_niter = estimated_stmt_executions_int (loop);
if (est_niter == -1)
est_niter = likely_max_stmt_executions_int (loop);
@@ -1998,17 +2000,19 @@ tree_ssa_prefetch_arrays (void)
{
fprintf (dump_file, "Prefetching parameters:\n");
fprintf (dump_file, " simultaneous prefetches: %d\n",
- SIMULTANEOUS_PREFETCHES);
- fprintf (dump_file, " prefetch latency: %d\n", PREFETCH_LATENCY);
+ param_simultaneous_prefetches);
+ fprintf (dump_file, " prefetch latency: %d\n", param_prefetch_latency);
fprintf (dump_file, " prefetch block size: %d\n", PREFETCH_BLOCK);
fprintf (dump_file, " L1 cache size: %d lines, %d kB\n",
- L1_CACHE_SIZE_BYTES / L1_CACHE_LINE_SIZE, L1_CACHE_SIZE);
- fprintf (dump_file, " L1 cache line size: %d\n", L1_CACHE_LINE_SIZE);
- fprintf (dump_file, " L2 cache size: %d kB\n", L2_CACHE_SIZE);
+ L1_CACHE_SIZE_BYTES / param_l1_cache_line_size,
+ param_l1_cache_size);
+ fprintf (dump_file, " L1 cache line size: %d\n",
+ param_l1_cache_line_size);
+ fprintf (dump_file, " L2 cache size: %d kB\n", param_l2_cache_size);
fprintf (dump_file, " min insn-to-prefetch ratio: %d \n",
- MIN_INSN_TO_PREFETCH_RATIO);
+ param_min_insn_to_prefetch_ratio);
fprintf (dump_file, " min insn-to-mem ratio: %d \n",
- PREFETCH_MIN_INSN_TO_MEM_RATIO);
+ param_prefetch_min_insn_to_mem_ratio);
fprintf (dump_file, "\n");
}
diff --git a/gcc/tree-ssa-loop-split.c b/gcc/tree-ssa-loop-split.c
index 6302d044e09..57dbc8769dc 100644
--- a/gcc/tree-ssa-loop-split.c
+++ b/gcc/tree-ssa-loop-split.c
@@ -1404,15 +1404,14 @@ get_cond_branch_to_split_loop (struct loop *loop, gcond *cond)
profile_probability prob = invar_branch->probability;
if (prob.reliable_p ())
{
- int thres = PARAM_VALUE (PARAM_MIN_LOOP_COND_SPLIT_PROB);
+ int thres = param_min_loop_cond_split_prob;
if (prob < profile_probability::always ().apply_scale (thres, 100))
return NULL;
}
/* Add a threshold for increased code size to disable loop split. */
- if (compute_added_num_insns (loop, invar_branch)
- > PARAM_VALUE (PARAM_MAX_PEELED_INSNS))
+ if (compute_added_num_insns (loop, invar_branch) > param_max_peeled_insns)
return NULL;
return invar_branch;
diff --git a/gcc/tree-ssa-loop-unswitch.c b/gcc/tree-ssa-loop-unswitch.c
index e60019db946..4e3aa7c41b7 100644
--- a/gcc/tree-ssa-loop-unswitch.c
+++ b/gcc/tree-ssa-loop-unswitch.c
@@ -288,7 +288,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
/* The loop should not be too large, to limit code growth. */
if (tree_num_loop_insns (loop, &eni_size_weights)
- > (unsigned) PARAM_VALUE (PARAM_MAX_UNSWITCH_INSNS))
+ > (unsigned) param_max_unswitch_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, ";; Not unswitching, loop too big\n");
@@ -323,7 +323,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
if (i == loop->num_nodes)
{
if (dump_file
- && num > PARAM_VALUE (PARAM_MAX_UNSWITCH_LEVEL)
+ && num > param_max_unswitch_level
&& (dump_flags & TDF_DETAILS))
fprintf (dump_file, ";; Not unswitching anymore, hit max level\n");
@@ -352,7 +352,7 @@ tree_unswitch_single_loop (class loop *loop, int num)
changed = true;
}
/* Do not unswitch too much. */
- else if (num > PARAM_VALUE (PARAM_MAX_UNSWITCH_LEVEL))
+ else if (num > param_max_unswitch_level)
{
i++;
continue;
diff --git a/gcc/tree-ssa-math-opts.c b/gcc/tree-ssa-math-opts.c
index 013ef93e7ad..8b5f3149cbc 100644
--- a/gcc/tree-ssa-math-opts.c
+++ b/gcc/tree-ssa-math-opts.c
@@ -1975,7 +1975,7 @@ gimple_expand_builtin_pow (gimple_stmt_iterator *gsi, location_t loc,
&& !HONOR_SIGNED_ZEROS (mode))
{
unsigned int max_depth = speed_p
- ? PARAM_VALUE (PARAM_MAX_POW_SQRT_DEPTH)
+ ? param_max_pow_sqrt_depth
: 2;
tree expand_with_sqrts
@@ -3089,7 +3089,7 @@ convert_mult_to_fma (gimple *mul_stmt, tree op1, tree op2,
bool check_defer
= (state->m_deferring_p
&& (tree_to_shwi (TYPE_SIZE (type))
- <= PARAM_VALUE (PARAM_AVOID_FMA_MAX_BITS)));
+ <= param_avoid_fma_max_bits));
bool defer = check_defer;
bool seen_negate_p = false;
/* Make sure that the multiplication statement becomes dead after
@@ -3744,7 +3744,7 @@ math_opts_dom_walker::after_dom_children (basic_block bb)
{
gimple_stmt_iterator gsi;
- fma_deferring_state fma_state (PARAM_VALUE (PARAM_AVOID_FMA_MAX_BITS) > 0);
+ fma_deferring_state fma_state (param_avoid_fma_max_bits > 0);
for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi);)
{
diff --git a/gcc/tree-ssa-phiopt.c b/gcc/tree-ssa-phiopt.c
index 38bb8b24155..43990b79644 100644
--- a/gcc/tree-ssa-phiopt.c
+++ b/gcc/tree-ssa-phiopt.c
@@ -2469,7 +2469,7 @@ cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb,
/* If either vectorization or if-conversion is disabled then do
not sink any stores. */
- if (MAX_STORES_TO_SINK == 0
+ if (param_max_stores_to_sink == 0
|| (!flag_tree_loop_vectorize && !flag_tree_slp_vectorize)
|| !flag_tree_loop_if_convert)
return false;
@@ -2528,7 +2528,7 @@ cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb,
/* No pairs of stores found. */
if (!then_stores.length ()
- || then_stores.length () > (unsigned) MAX_STORES_TO_SINK)
+ || then_stores.length () > (unsigned) param_max_stores_to_sink)
{
free_data_refs (then_datarefs);
free_data_refs (else_datarefs);
@@ -2658,7 +2658,7 @@ static void
hoist_adjacent_loads (basic_block bb0, basic_block bb1,
basic_block bb2, basic_block bb3)
{
- int param_align = PARAM_VALUE (PARAM_L1_CACHE_LINE_SIZE);
+ int param_align = param_l1_cache_line_size;
unsigned param_align_bits = (unsigned) (param_align * BITS_PER_UNIT);
gphi_iterator gsi;
@@ -2808,7 +2808,7 @@ static bool
gate_hoist_loads (void)
{
return (flag_hoist_adjacent_loads == 1
- && PARAM_VALUE (PARAM_L1_CACHE_LINE_SIZE)
+ && param_l1_cache_line_size
&& HAVE_conditional_move);
}
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c
index 363dec6f4dd..58a147036af 100644
--- a/gcc/tree-ssa-pre.c
+++ b/gcc/tree-ssa-pre.c
@@ -1156,7 +1156,7 @@ translate_vuse_through_block (vec<vn_reference_op_s> operands,
if (gimple_bb (phi) != phiblock)
return vuse;
- unsigned int cnt = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned int cnt = param_sccvn_max_alias_queries_per_access;
use_oracle = ao_ref_init_from_vn_reference (&ref, set, type, operands);
/* Use the alias-oracle to find either the PHI node in this block,
@@ -2235,7 +2235,7 @@ compute_partial_antic_aux (basic_block block,
bitmap_set_t PA_OUT;
edge e;
edge_iterator ei;
- unsigned long max_pa = PARAM_VALUE (PARAM_MAX_PARTIAL_ANTIC_LENGTH);
+ unsigned long max_pa = param_max_partial_antic_length;
old_PA_IN = PA_OUT = NULL;
diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c
index 510dfd1e188..9e5b5290b55 100644
--- a/gcc/tree-ssa-reassoc.c
+++ b/gcc/tree-ssa-reassoc.c
@@ -4945,7 +4945,7 @@ static int
get_reassociation_width (int ops_num, enum tree_code opc,
machine_mode mode)
{
- int param_width = PARAM_VALUE (PARAM_TREE_REASSOC_WIDTH);
+ int param_width = param_tree_reassoc_width;
int width;
int width_min;
int cycles_best;
diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c
index f58dbe15047..429f09d4017 100644
--- a/gcc/tree-ssa-sccvn.c
+++ b/gcc/tree-ssa-sccvn.c
@@ -3074,7 +3074,7 @@ vn_reference_lookup_pieces (tree vuse, alias_set_type set, tree type,
&& vr1.vuse)
{
ao_ref r;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
vn_walk_cb_data data (&vr1, NULL_TREE, NULL, kind, true);
if (ao_ref_init_from_vn_reference (&r, set, type, vr1.operands))
*vnresult =
@@ -3125,7 +3125,7 @@ vn_reference_lookup (tree op, tree vuse, vn_lookup_kind kind,
{
vn_reference_t wvnresult;
ao_ref r;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
/* Make sure to use a valueized reference if we valueized anything.
Otherwise preserve the full reference for advanced TBAA. */
if (!valuezied_anything
@@ -6985,7 +6985,7 @@ do_rpo_vn (function *fn, edge entry, bitmap exit_bbs,
if (iterate)
{
loop_p loop;
- unsigned max_depth = PARAM_VALUE (PARAM_RPO_VN_MAX_LOOP_DEPTH);
+ unsigned max_depth = param_rpo_vn_max_loop_depth;
FOR_EACH_LOOP (loop, LI_ONLY_INNERMOST)
if (loop_depth (loop) > max_depth)
for (unsigned i = 2;
diff --git a/gcc/tree-ssa-scopedtables.c b/gcc/tree-ssa-scopedtables.c
index 574bc30eee1..9fb2f500f46 100644
--- a/gcc/tree-ssa-scopedtables.c
+++ b/gcc/tree-ssa-scopedtables.c
@@ -292,7 +292,7 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p)
up the virtual use-def chain using walk_non_aliased_vuses.
But don't do this when removing expressions from the hash. */
ao_ref ref;
- unsigned limit = PARAM_VALUE (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS);
+ unsigned limit = param_sccvn_max_alias_queries_per_access;
if (!(vuse1 && vuse2
&& gimple_assign_single_p (stmt)
&& TREE_CODE (gimple_assign_lhs (stmt)) == SSA_NAME
diff --git a/gcc/tree-ssa-sink.c b/gcc/tree-ssa-sink.c
index 3bfad0f90ed..cbad34b26de 100644
--- a/gcc/tree-ssa-sink.c
+++ b/gcc/tree-ssa-sink.c
@@ -215,7 +215,7 @@ select_best_block (basic_block early_bb,
/* Get the sinking threshold. If the statement to be moved has memory
operands, then increase the threshold by 7% as those are even more
profitable to avoid, clamping at 100%. */
- threshold = PARAM_VALUE (PARAM_SINK_FREQUENCY_THRESHOLD);
+ threshold = param_sink_frequency_threshold;
if (gimple_vuse (stmt) || gimple_vdef (stmt))
{
threshold += 7;
diff --git a/gcc/tree-ssa-strlen.c b/gcc/tree-ssa-strlen.c
index 15c0c4576b7..54f9bcf05f2 100644
--- a/gcc/tree-ssa-strlen.c
+++ b/gcc/tree-ssa-strlen.c
@@ -528,7 +528,7 @@ static int
new_stridx (tree exp)
{
int idx;
- if (max_stridx >= PARAM_VALUE (PARAM_MAX_TRACKED_STRLENS))
+ if (max_stridx >= param_max_tracked_strlens)
return 0;
if (TREE_CODE (exp) == SSA_NAME)
{
@@ -557,7 +557,7 @@ static int
new_addr_stridx (tree exp)
{
int *pidx;
- if (max_stridx >= PARAM_VALUE (PARAM_MAX_TRACKED_STRLENS))
+ if (max_stridx >= param_max_tracked_strlens)
return 0;
pidx = addr_stridxptr (exp);
if (pidx != NULL)
@@ -1082,7 +1082,7 @@ get_range_strlen_dynamic (tree src, c_strlen_data *pdata,
bitmap visited = NULL;
tree maxbound = pdata->maxbound;
- unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ unsigned limit = param_ssa_name_def_chain_limit;
if (!get_range_strlen_dynamic (src, pdata, &visited, rvals, &limit))
{
/* On failure extend the length range to an impossible maximum
@@ -3972,7 +3972,7 @@ class ssa_name_limit_t
ssa_name_limit_t ()
: visited (NULL),
- ssa_def_max (PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT)) { }
+ ssa_def_max (param_ssa_name_def_chain_limit) { }
int next_ssa_name (tree);
diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c
index 6e7d4dbc5b3..74edcd4458f 100644
--- a/gcc/tree-ssa-structalias.c
+++ b/gcc/tree-ssa-structalias.c
@@ -5691,9 +5691,9 @@ push_fields_onto_fieldstack (tree type, vec<fieldoff_s> *fieldstack,
return false;
/* If the vector of fields is growing too big, bail out early.
- Callers check for vec::length <= MAX_FIELDS_FOR_FIELD_SENSITIVE, make
+ Callers check for vec::length <= param_max_fields_for_field_sensitive, make
sure this fails. */
- if (fieldstack->length () > MAX_FIELDS_FOR_FIELD_SENSITIVE)
+ if (fieldstack->length () > (unsigned)param_max_fields_for_field_sensitive)
return false;
for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
@@ -6114,7 +6114,7 @@ create_variable_info_for_1 (tree decl, const char *name, bool add_id,
/* If we didn't end up collecting sub-variables create a full
variable for the decl. */
if (fieldstack.length () == 0
- || fieldstack.length () > MAX_FIELDS_FOR_FIELD_SENSITIVE)
+ || fieldstack.length () > (unsigned)param_max_fields_for_field_sensitive)
{
vi = new_var_info (decl, name, add_id);
vi->offset = 0;
@@ -7179,7 +7179,7 @@ init_base_vars (void)
static void
init_alias_vars (void)
{
- use_field_sensitive = (MAX_FIELDS_FOR_FIELD_SENSITIVE > 1);
+ use_field_sensitive = (param_max_fields_for_field_sensitive > 1);
bitmap_obstack_initialize (&pta_obstack);
bitmap_obstack_initialize (&oldpta_obstack);
diff --git a/gcc/tree-ssa-tail-merge.c b/gcc/tree-ssa-tail-merge.c
index cbd5a277b39..ddf7449d945 100644
--- a/gcc/tree-ssa-tail-merge.c
+++ b/gcc/tree-ssa-tail-merge.c
@@ -1469,7 +1469,7 @@ find_clusters_1 (same_succ *same_succ)
unsigned int i, j;
bitmap_iterator bi, bj;
int nr_comparisons;
- int max_comparisons = PARAM_VALUE (PARAM_MAX_TAIL_MERGE_COMPARISONS);
+ int max_comparisons = param_max_tail_merge_comparisons;
EXECUTE_IF_SET_IN_BITMAP (same_succ->bbs, 0, i, bi)
{
@@ -1731,7 +1731,7 @@ tail_merge_optimize (unsigned int todo)
int nr_bbs_removed;
bool loop_entered = false;
int iteration_nr = 0;
- int max_iterations = PARAM_VALUE (PARAM_MAX_TAIL_MERGE_ITERATIONS);
+ int max_iterations = param_max_tail_merge_iterations;
if (!flag_tree_tail_merge
|| max_iterations == 0)
diff --git a/gcc/tree-ssa-threadbackward.c b/gcc/tree-ssa-threadbackward.c
index 1ff870ad00b..6d534647c60 100644
--- a/gcc/tree-ssa-threadbackward.c
+++ b/gcc/tree-ssa-threadbackward.c
@@ -157,7 +157,7 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
return NULL;
if (m_path.length () + 1
- > (unsigned) PARAM_VALUE (PARAM_MAX_FSM_THREAD_LENGTH))
+ > (unsigned) param_max_fsm_thread_length)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "FSM jump-thread path not considered: "
@@ -367,7 +367,7 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
as in PR 78407 this leads to noticeable improvements. */
if (m_speed_p && (optimize_edge_for_speed_p (taken_edge) || contains_hot_bb))
{
- if (n_insns >= PARAM_VALUE (PARAM_MAX_FSM_THREAD_PATH_INSNS))
+ if (n_insns >= param_max_fsm_thread_path_insns)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "FSM jump-thread path not considered: "
@@ -397,9 +397,9 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
optimizer would have done anyway, so an irreducible loop is not
so bad. */
if (!threaded_multiway_branch && *creates_irreducible_loop
- && (n_insns * (unsigned) PARAM_VALUE (PARAM_FSM_SCALE_PATH_STMTS)
+ && (n_insns * (unsigned) param_fsm_scale_path_stmts
> (m_path.length () *
- (unsigned) PARAM_VALUE (PARAM_FSM_SCALE_PATH_BLOCKS))))
+ (unsigned) param_fsm_scale_path_blocks)))
{
if (dump_file && (dump_flags & TDF_DETAILS))
@@ -419,8 +419,8 @@ thread_jumps::profitable_jump_thread_path (basic_block bbi, tree name,
So for that case, drastically reduce the number of statements
we are allowed to copy. */
if (!(threaded_through_latch && threaded_multiway_branch)
- && (n_insns * PARAM_VALUE (PARAM_FSM_SCALE_PATH_STMTS)
- >= PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS)))
+ && (n_insns * param_fsm_scale_path_stmts
+ >= param_max_jump_thread_duplication_stmts))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
@@ -683,7 +683,7 @@ thread_jumps::fsm_find_control_statement_thread_paths (tree name)
if (gimple_code (def_stmt) == GIMPLE_PHI
&& (gimple_phi_num_args (def_stmt)
- >= (unsigned) PARAM_VALUE (PARAM_FSM_MAXIMUM_PHI_ARGUMENTS)))
+ >= (unsigned) param_fsm_maximum_phi_arguments))
return;
if (is_gimple_assign (def_stmt)
@@ -771,7 +771,7 @@ thread_jumps::find_jump_threads_backwards (basic_block bb, bool speed_p)
m_visited_bbs.empty ();
m_seen_loop_phi = false;
m_speed_p = speed_p;
- m_max_threaded_paths = PARAM_VALUE (PARAM_MAX_FSM_THREAD_PATHS);
+ m_max_threaded_paths = param_max_fsm_thread_paths;
fsm_find_control_statement_thread_paths (name);
}
diff --git a/gcc/tree-ssa-threadedge.c b/gcc/tree-ssa-threadedge.c
index a5d87662159..c43d7c5c39e 100644
--- a/gcc/tree-ssa-threadedge.c
+++ b/gcc/tree-ssa-threadedge.c
@@ -234,7 +234,7 @@ record_temporary_equivalences_from_stmts_at_dest (edge e,
gimple_stmt_iterator gsi;
int max_stmt_count;
- max_stmt_count = PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS);
+ max_stmt_count = param_max_jump_thread_duplication_stmts;
/* Walk through each statement in the block recording equivalences
we discover. Note any equivalences we discover are context
@@ -275,7 +275,7 @@ record_temporary_equivalences_from_stmts_at_dest (edge e,
killed due to threading, grow the max count
accordingly. */
if (max_stmt_count
- == PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS))
+ == param_max_jump_thread_duplication_stmts)
{
max_stmt_count += estimate_threading_killed_stmts (e->dest);
if (dump_file)
diff --git a/gcc/tree-ssa-uninit.c b/gcc/tree-ssa-uninit.c
index fe8f8f0bc28..ae441067789 100644
--- a/gcc/tree-ssa-uninit.c
+++ b/gcc/tree-ssa-uninit.c
@@ -545,7 +545,7 @@ compute_control_dep_chain (basic_block bb, basic_block dep_bb,
bool found_cd_chain = false;
size_t cur_chain_len = 0;
- if (*num_calls > PARAM_VALUE (PARAM_UNINIT_CONTROL_DEP_ATTEMPTS))
+ if (*num_calls > param_uninit_control_dep_attempts)
return false;
++*num_calls;
diff --git a/gcc/tree-switch-conversion.c b/gcc/tree-switch-conversion.c
index b7149039ae4..166e40c3931 100644
--- a/gcc/tree-switch-conversion.c
+++ b/gcc/tree-switch-conversion.c
@@ -194,7 +194,7 @@ switch_conversion::check_range ()
}
if (tree_to_uhwi (m_range_size)
- > ((unsigned) m_count * SWITCH_CONVERSION_BRANCH_RATIO))
+ > ((unsigned) m_count * param_switch_conversion_branch_ratio))
{
m_reason = "the maximum range-branch ratio exceeded";
return false;
@@ -1268,8 +1268,8 @@ jump_table_cluster::can_be_handled (const vec<cluster *> &clusters,
unsigned HOST_WIDE_INT max_ratio
= (optimize_insn_for_size_p ()
- ? PARAM_VALUE (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SIZE)
- : PARAM_VALUE (PARAM_JUMP_TABLE_MAX_GROWTH_RATIO_FOR_SPEED));
+ ? param_jump_table_max_growth_ratio_for_size
+ : param_jump_table_max_growth_ratio_for_speed);
unsigned HOST_WIDE_INT range = get_range (clusters[start]->get_low (),
clusters[end]->get_high ());
/* Check overflow. */
diff --git a/gcc/tree-switch-conversion.h b/gcc/tree-switch-conversion.h
index 653007f0e17..c58bccea7f1 100644
--- a/gcc/tree-switch-conversion.h
+++ b/gcc/tree-switch-conversion.h
@@ -476,7 +476,7 @@ case_tree_node::case_tree_node ():
unsigned int
jump_table_cluster::case_values_threshold (void)
{
- unsigned int threshold = PARAM_VALUE (PARAM_CASE_VALUES_THRESHOLD);
+ unsigned int threshold = param_case_values_threshold;
if (threshold == 0)
threshold = targetm.case_values_threshold ();
@@ -683,8 +683,8 @@ is changed into:
b_b = PHI <b_6, b_7>
There are further constraints. Specifically, the range of values across all
-case labels must not be bigger than SWITCH_CONVERSION_BRANCH_RATIO (default
-eight) times the number of the actual switch branches.
+case labels must not be bigger than param_switch_conversion_branch_ratio
+(default eight) times the number of the actual switch branches.
This transformation was contributed by Martin Jambor, see this e-mail:
http://gcc.gnu.org/ml/gcc-patches/2008-07/msg00011.html */
diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c
index 88f14e73d65..5abbdc747f4 100644
--- a/gcc/tree-vect-data-refs.c
+++ b/gcc/tree-vect-data-refs.c
@@ -185,7 +185,7 @@ vect_mark_for_runtime_alias_test (ddr_p ddr, loop_vec_info loop_vinfo)
{
class loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
- if ((unsigned) PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS) == 0)
+ if ((unsigned) param_vect_max_version_for_alias_checks == 0)
return opt_result::failure_at (vect_location,
"will not create alias checks, as"
" --param vect-max-version-for-alias-checks"
@@ -2086,7 +2086,7 @@ vect_enhance_data_refs_alignment (loop_vec_info loop_vinfo)
if (do_peeling)
{
unsigned max_allowed_peel
- = PARAM_VALUE (PARAM_VECT_MAX_PEELING_FOR_ALIGNMENT);
+ = param_vect_max_peeling_for_alignment;
if (flag_vect_cost_model == VECT_COST_MODEL_CHEAP)
max_allowed_peel = 0;
if (max_allowed_peel != (unsigned)-1)
@@ -2227,7 +2227,7 @@ vect_enhance_data_refs_alignment (loop_vec_info loop_vinfo)
if (known_alignment_for_access_p (dr_info)
|| LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo).length ()
- >= (unsigned) PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS))
+ >= (unsigned) param_vect_max_version_for_alignment_checks)
{
do_versioning = false;
break;
@@ -3656,10 +3656,9 @@ vect_prune_runtime_alias_test_list (loop_vec_info loop_vinfo)
dump_printf_loc (MSG_NOTE, vect_location,
"improved number of alias checks from %d to %d\n",
may_alias_ddrs.length (), count);
- unsigned limit = PARAM_VALUE (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS);
+ unsigned limit = param_vect_max_version_for_alias_checks;
if (flag_simd_cost_model == VECT_COST_MODEL_CHEAP)
- limit = default_param_value
- (PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS) * 6 / 10;
+ limit = param_vect_max_version_for_alias_checks * 6 / 10;
if (count > limit)
return opt_result::failure_at
(vect_location,
diff --git a/gcc/tree-vect-loop.c b/gcc/tree-vect-loop.c
index 78fe6290ee6..4012f36171f 100644
--- a/gcc/tree-vect-loop.c
+++ b/gcc/tree-vect-loop.c
@@ -1665,7 +1665,7 @@ vect_analyze_loop_costing (loop_vec_info loop_vinfo)
return -1;
}
- int min_scalar_loop_bound = (PARAM_VALUE (PARAM_MIN_VECT_LOOP_BOUND)
+ int min_scalar_loop_bound = (param_min_vect_loop_bound
* assumed_vf);
/* Use the cost model only if it is more conservative than user specified
@@ -1775,7 +1775,7 @@ vect_get_datarefs_in_loop (loop_p loop, basic_block *bbs,
/* If dependence analysis will give up due to the limit on the
number of datarefs stop here and fail fatally. */
if (datarefs->length ()
- > (unsigned)PARAM_VALUE (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS))
+ > (unsigned)param_loop_max_datarefs_for_datadeps)
return opt_result::failure_at (stmt, "exceeded param "
"loop-max-datarefs-for-datadeps\n");
}
@@ -2461,7 +2461,7 @@ vect_analyze_loop (class loop *loop, vec_info_shared *shared)
TODO: Enable epilogue vectorization for loops with SIMDUID set. */
vect_epilogues = (!simdlen
&& loop->inner == NULL
- && PARAM_VALUE (PARAM_VECT_EPILOGUES_NOMASK)
+ && param_vect_epilogues_nomask
&& LOOP_VINFO_PEELING_FOR_NITER (first_loop_vinfo)
&& !loop->simduid
/* For now only allow one epilogue loop. */
diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c
index f4b445ac1ef..9d3d991e516 100644
--- a/gcc/tree-vect-slp.c
+++ b/gcc/tree-vect-slp.c
@@ -3289,7 +3289,7 @@ vect_slp_bb (basic_block bb)
gimple_stmt_iterator region_end = gsi;
- if (insns > PARAM_VALUE (PARAM_SLP_MAX_INSNS_IN_BB))
+ if (insns > param_slp_max_insns_in_bb)
{
if (dump_enabled_p ())
dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location,
diff --git a/gcc/tree-vectorizer.h b/gcc/tree-vectorizer.h
index e9575a184ad..e556e0e9888 100644
--- a/gcc/tree-vectorizer.h
+++ b/gcc/tree-vectorizer.h
@@ -489,7 +489,7 @@ public:
/* Threshold of number of iterations below which vectorization will not be
performed. It is calculated from MIN_PROFITABLE_ITERS and
- PARAM_MIN_VECT_LOOP_BOUND. */
+ param_min_vect_loop_bound. */
unsigned int th;
/* When applying loop versioning, the vector form should only be used
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c
index b8b6967dae7..7a8716e0a02 100644
--- a/gcc/tree-vrp.c
+++ b/gcc/tree-vrp.c
@@ -3391,7 +3391,7 @@ find_switch_asserts (basic_block bb, gswitch *last)
/* Now register along the default label assertions that correspond to the
anti-range of each label. */
- int insertion_limit = PARAM_VALUE (PARAM_MAX_VRP_SWITCH_ASSERTIONS);
+ int insertion_limit = param_max_vrp_switch_assertions;
if (insertion_limit == 0)
return;
@@ -4302,7 +4302,7 @@ vrp_prop::check_mem_ref (location_t location, tree ref,
The loop computes the range of the final offset for expressions such
as (A + i0 + ... + iN)[CSTOFF] where i0 through iN are SSA_NAMEs in
some range. */
- const unsigned limit = PARAM_VALUE (PARAM_SSA_NAME_DEF_CHAIN_LIMIT);
+ const unsigned limit = param_ssa_name_def_chain_limit;
for (unsigned n = 0; TREE_CODE (arg) == SSA_NAME && n < limit; ++n)
{
gimple *def = SSA_NAME_DEF_STMT (arg);
diff --git a/gcc/tree.c b/gcc/tree.c
index d6a3970ddb6..c3cd527e14a 100644
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -1553,15 +1553,15 @@ wide_int_to_tree_1 (tree type, const wide_int_ref &pcst)
if (TYPE_SIGN (type) == UNSIGNED)
{
/* Cache [0, N). */
- limit = INTEGER_SHARE_LIMIT;
- if (IN_RANGE (hwi, 0, INTEGER_SHARE_LIMIT - 1))
+ limit = param_integer_share_limit;
+ if (IN_RANGE (hwi, 0, param_integer_share_limit - 1))
ix = hwi;
}
else
{
/* Cache [-1, N). */
- limit = INTEGER_SHARE_LIMIT + 1;
- if (IN_RANGE (hwi, -1, INTEGER_SHARE_LIMIT - 1))
+ limit = param_integer_share_limit + 1;
+ if (IN_RANGE (hwi, -1, param_integer_share_limit - 1))
ix = hwi + 1;
}
break;
@@ -1737,23 +1737,24 @@ cache_integer_cst (tree t)
if (TYPE_UNSIGNED (type))
{
/* Cache 0..N */
- limit = INTEGER_SHARE_LIMIT;
+ limit = param_integer_share_limit;
/* This is a little hokie, but if the prec is smaller than
- what is necessary to hold INTEGER_SHARE_LIMIT, then the
+ what is necessary to hold param_integer_share_limit, then the
obvious test will not get the correct answer. */
if (prec < HOST_BITS_PER_WIDE_INT)
{
- if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT) INTEGER_SHARE_LIMIT)
+ if (tree_to_uhwi (t)
+ < (unsigned HOST_WIDE_INT) param_integer_share_limit)
ix = tree_to_uhwi (t);
}
- else if (wi::ltu_p (wi::to_wide (t), INTEGER_SHARE_LIMIT))
+ else if (wi::ltu_p (wi::to_wide (t), param_integer_share_limit))
ix = tree_to_uhwi (t);
}
else
{
/* Cache -1..N */
- limit = INTEGER_SHARE_LIMIT + 1;
+ limit = param_integer_share_limit + 1;
if (integer_minus_onep (t))
ix = 0;
@@ -1761,10 +1762,10 @@ cache_integer_cst (tree t)
{
if (prec < HOST_BITS_PER_WIDE_INT)
{
- if (tree_to_shwi (t) < INTEGER_SHARE_LIMIT)
+ if (tree_to_shwi (t) < param_integer_share_limit)
ix = tree_to_shwi (t) + 1;
}
- else if (wi::ltu_p (wi::to_wide (t), INTEGER_SHARE_LIMIT))
+ else if (wi::ltu_p (wi::to_wide (t), param_integer_share_limit))
ix = tree_to_shwi (t) + 1;
}
}
diff --git a/gcc/var-tracking.c b/gcc/var-tracking.c
index 5de36ae2f47..c80a06c92b7 100644
--- a/gcc/var-tracking.c
+++ b/gcc/var-tracking.c
@@ -5844,7 +5844,7 @@ add_uses_1 (rtx *x, void *cui)
compile time for ridiculously complex expressions, although they're
seldom useful, and they may often have to be discarded as not
representable anyway. */
-#define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
+#define EXPR_USE_DEPTH (param_max_vartrack_expr_depth)
/* Attempt to reverse the EXPR operation in the debug info and record
it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
@@ -5904,7 +5904,7 @@ reverse_op (rtx val, const_rtx expr, rtx_insn *insn)
&& (GET_CODE (l->loc) != CONST || !references_value_p (l->loc, 0)))
return;
/* Avoid creating too large locs lists. */
- else if (count == PARAM_VALUE (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE))
+ else if (count == param_max_vartrack_reverse_op_size)
return;
switch (GET_CODE (src))
@@ -7054,7 +7054,7 @@ vt_find_locations (void)
int *rc_order;
int i;
int htabsz = 0;
- int htabmax = PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE);
+ int htabmax = param_max_vartrack_size;
bool success = true;
timevar_push (TV_VAR_TRACKING_DATAFLOW);
--
2.24.0
^ permalink raw reply [flat|nested] 29+ messages in thread
* [PATCH 8/9] Remove option_default_params and option_validate_param hooks.
2019-11-11 14:39 ` Richard Biener
2019-11-12 9:20 ` Martin Liška
@ 2019-11-12 9:22 ` Martin Liška
2019-11-12 9:44 ` Richard Biener
1 sibling, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-12 9:22 UTC (permalink / raw)
To: Richard Biener; +Cc: GCC Patches
[-- Attachment #1: Type: text/plain, Size: 702 bytes --]
On 11/11/19 3:36 PM, Richard Biener wrote:
> as a followup I notice that the targets *_default_params () functions should
> be merged into the default-options structs they have (did you check the
> defaults are still applied and user-overridable?)
Apparently, the *_default_params target hook is not called right now. So that
I decided to directly transform all usages of that to default-options structs.
I built all the affected cross compilers and checked --help=param -Q, where
I can see the overwritten default. Moreover, a param value can be properly
adjusted with a user option.
I'm running tests on x86_64-linux-gnu and ppc64-linux-gnu right now to check
affect of the attached patch.
Martin
[-- Attachment #2: 0008-Remove-option_default_params-and-option_validate_par.patch --]
[-- Type: text/x-patch, Size: 15334 bytes --]
From c5cf7c135d93cfa07373e6469708b0f42f419ad5 Mon Sep 17 00:00:00 2001
From: Martin Liska <mliska@suse.cz>
Date: Tue, 12 Nov 2019 09:41:31 +0100
Subject: [PATCH 8/9] Remove option_default_params and option_validate_param
hooks.
gcc/ChangeLog:
2019-11-12 Martin Liska <mliska@suse.cz>
* common/common-target.def: Remove option_validate_param and
option_default_params.
* common/common-targhooks.c (default_option_validate_param):
Remove.
* common/common-targhooks.h (default_option_validate_param):
Remove.
* common/config/aarch64/aarch64-common.c (TARGET_OPTION_DEFAULT_PARAMS):
Remove usage of this.
(TARGET_OPTION_VALIDATE_PARAM): Likewise.
(aarch64_option_validate_param): Likewise.
(aarch64_option_default_params): Likewise
* common/config/bpf/bpf-common.c (bpf_option_default_params): Likewise.
(TARGET_OPTION_DEFAULT_PARAMS): Likewise.
* common/config/ia64/ia64-common.c (ia64_option_default_params): Likewise.
(TARGET_OPTION_DEFAULT_PARAMS): Likewise.
* common/config/powerpcspe/powerpcspe-common.c (rs6000_option_default_params): Likewise.
(TARGET_OPTION_DEFAULT_PARAMS): Likewise.
* common/config/rs6000/rs6000-common.c (rs6000_option_default_params): Likewise.
(TARGET_OPTION_DEFAULT_PARAMS): Likewise.
* common/config/sh/sh-common.c (sh_option_default_params): Likewise.
(TARGET_OPTION_DEFAULT_PARAMS): Likewise.
* config/aarch64/aarch64.c (aarch64_override_options_internal): Validate
guard_size here.
* doc/tm.texi: Remove option_default_params and option_validate_param.
* doc/tm.texi.in: Likewise.
---
gcc/common/common-target.def | 12 -----
gcc/common/common-targhooks.c | 9 ----
gcc/common/common-targhooks.h | 2 -
gcc/common/config/aarch64/aarch64-common.c | 47 ++-----------------
gcc/common/config/bpf/bpf-common.c | 13 -----
gcc/common/config/ia64/ia64-common.c | 25 ++++------
.../config/powerpcspe/powerpcspe-common.c | 14 +-----
gcc/common/config/rs6000/rs6000-common.c | 15 ++----
gcc/common/config/sh/sh-common.c | 10 +---
gcc/config/aarch64/aarch64.c | 12 ++---
gcc/doc/tm.texi | 8 ----
gcc/doc/tm.texi.in | 4 --
12 files changed, 22 insertions(+), 149 deletions(-)
diff --git a/gcc/common/common-target.def b/gcc/common/common-target.def
index 48096720e44..de5e1c2265e 100644
--- a/gcc/common/common-target.def
+++ b/gcc/common/common-target.def
@@ -49,18 +49,6 @@ DEFHOOKPOD
"",
const struct default_options *, empty_optimization_table)
-DEFHOOK
-(option_default_params,
-"Set target-dependent default values for @option{--param} settings.",
- void, (void),
- hook_void_void)
-
-DEFHOOK
-(option_validate_param,
-"Validate target-dependent value for @option{--param} settings.",
- bool, (int, int),
- default_option_validate_param)
-
/* The initial value of target_flags. */
DEFHOOKPOD
(default_target_flags,
diff --git a/gcc/common/common-targhooks.c b/gcc/common/common-targhooks.c
index 9ed7822cab4..41626bad5d8 100644
--- a/gcc/common/common-targhooks.c
+++ b/gcc/common/common-targhooks.c
@@ -86,15 +86,6 @@ default_get_valid_option_values (int, const char *)
return vec<const char *> ();
}
-/* Default version of TARGET_OPTION_VALIDATE_PARAM. */
-
-bool
-default_option_validate_param (const int value ATTRIBUTE_UNUSED,
- const int param ATTRIBUTE_UNUSED)
-{
- return true;
-}
-
const struct default_options empty_optimization_table[] =
{
{ OPT_LEVELS_NONE, 0, NULL, 0 }
diff --git a/gcc/common/common-targhooks.h b/gcc/common/common-targhooks.h
index 18cfb5ab802..af0bffe0e8c 100644
--- a/gcc/common/common-targhooks.h
+++ b/gcc/common/common-targhooks.h
@@ -30,8 +30,6 @@ extern bool default_target_handle_option (struct gcc_options *,
location_t);
extern vec<const char *> default_get_valid_option_values (int, const char *);
-extern bool default_option_validate_param (const int, const int);
-
extern const struct default_options empty_optimization_table[];
#endif
diff --git a/gcc/common/config/aarch64/aarch64-common.c b/gcc/common/config/aarch64/aarch64-common.c
index b4ba6708af1..7e966f8fe5d 100644
--- a/gcc/common/config/aarch64/aarch64-common.c
+++ b/gcc/common/config/aarch64/aarch64-common.c
@@ -41,10 +41,6 @@
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE aarch_option_optimization_table
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS aarch64_option_default_params
-#undef TARGET_OPTION_VALIDATE_PARAM
-#define TARGET_OPTION_VALIDATE_PARAM aarch64_option_validate_param
#undef TARGET_OPTION_INIT_STRUCT
#define TARGET_OPTION_INIT_STRUCT aarch64_option_init_struct
@@ -63,49 +59,12 @@ static const struct default_options aarch_option_optimization_table[] =
{ OPT_LEVELS_ALL, OPT_fasynchronous_unwind_tables, NULL, 1 },
{ OPT_LEVELS_ALL, OPT_funwind_tables, NULL, 1},
#endif
+ { OPT_LEVELS_ALL, OPT__param_stack_clash_protection_guard_size_, NULL,
+ DEFAULT_STK_CLASH_GUARD_SIZE == 0 ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE },
+
{ OPT_LEVELS_NONE, 0, NULL, 0 }
};
-/* Implement target validation TARGET_OPTION_DEFAULT_PARAM. */
-
-static bool
-aarch64_option_validate_param (const int value, const int param)
-{
- /* Check that both parameters are the same. */
- if (param == param_stack_clash_protection_guard_size)
- {
- if (value != 12 && value != 16)
- {
- error ("only values 12 (4 KB) and 16 (64 KB) are supported for guard "
- "size. Given value %d (%llu KB) is out of range",
- value, (1ULL << value) / 1024ULL);
- return false;
- }
- }
-
- return true;
-}
-
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-
-static void
-aarch64_option_default_params (void)
-{
- /* We assume the guard page is 64k. */
- int index = (int) param_stack_clash_protection_guard_size;
- param_stack_clash_protection_guard_size
- = (DEFAULT_STK_CLASH_GUARD_SIZE == 0 ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE);
-
- int guard_size = param_stack_clash_protection_guard_size;
-
- /* Set the interval parameter to be the same as the guard size. This way the
- mid-end code does the right thing for us. */
- param_stack_clash_protection_probe_interval = guard_size;
-
- /* Validate the options. */
- aarch64_option_validate_param (guard_size, index);
-}
-
/* Implement TARGET_HANDLE_OPTION.
This function handles the target specific options for CPU/target selection.
diff --git a/gcc/common/config/bpf/bpf-common.c b/gcc/common/config/bpf/bpf-common.c
index 0d04f21b8f9..bd73933bf86 100644
--- a/gcc/common/config/bpf/bpf-common.c
+++ b/gcc/common/config/bpf/bpf-common.c
@@ -39,17 +39,4 @@ static const struct default_options bpf_option_optimization_table[] =
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE bpf_option_optimization_table
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-
-static void
-bpf_option_default_params (void)
-{
- /* XXX large-stack-frame = 512 bytes */
- /* XXX max-unrolled-insns */
- /* XXX max-unroll-times */
-}
-
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS bpf_option_default_params
-
struct gcc_targetm_common targetm_common = TARGETM_COMMON_INITIALIZER;
diff --git a/gcc/common/config/ia64/ia64-common.c b/gcc/common/config/ia64/ia64-common.c
index a9ff29563a3..899cbb92db6 100644
--- a/gcc/common/config/ia64/ia64-common.c
+++ b/gcc/common/config/ia64/ia64-common.c
@@ -35,6 +35,14 @@ static const struct default_options ia64_option_optimization_table[] =
#ifdef SUBTARGET_OPTIMIZATION_OPTIONS
SUBTARGET_OPTIMIZATION_OPTIONS,
#endif
+
+ /* Let the scheduler form additional regions. */
+ { OPT_LEVELS_ALL, OPT__param_max_sched_extend_regions_iters_, NULL, 2 },
+ /* Set the default values for cache-related parameters. */
+ { OPT_LEVELS_ALL, OPT__param_simultaneous_prefetches_, NULL, 6 },
+ { OPT_LEVELS_ALL, OPT__param_l1_cache_line_size_ , NULL, 32},
+ { OPT_LEVELS_ALL, OPT__param_sched_mem_true_dep_cost_, NULL, 4 },
+
{ OPT_LEVELS_NONE, 0, NULL, 0 }
};
@@ -81,25 +89,8 @@ ia64_except_unwind_info (struct gcc_options *opts)
return UI_TARGET;
}
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-
-static void
-ia64_option_default_params (void)
-{
- /* Let the scheduler form additional regions. */
- param_max_sched_extend_regions_iters = 2;
-
- /* Set the default values for cache-related parameters. */
- param_simultaneous_prefetches = 6;
- param_l1_cache_line_size = 32;
-
- param_sched_mem_true_dep_cost = 4;
-}
-
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE ia64_option_optimization_table
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS ia64_option_default_params
#undef TARGET_EXCEPT_UNWIND_INFO
#define TARGET_EXCEPT_UNWIND_INFO ia64_except_unwind_info
diff --git a/gcc/common/config/powerpcspe/powerpcspe-common.c b/gcc/common/config/powerpcspe/powerpcspe-common.c
index 8976425b434..2ec5d9a0d88 100644
--- a/gcc/common/config/powerpcspe/powerpcspe-common.c
+++ b/gcc/common/config/powerpcspe/powerpcspe-common.c
@@ -32,6 +32,8 @@ static const struct default_options rs6000_option_optimization_table[] =
{
/* Enable -fsched-pressure for first pass instruction scheduling. */
{ OPT_LEVELS_1_PLUS, OPT_fsched_pressure, NULL, 1 },
+ /* Double growth factor to counter reduced min jump length. */
+ { OPT_LEVELS_ALL, OPT__param_max_grow_copy_bb_insns_, NULL, 16 },
{ OPT_LEVELS_NONE, 0, NULL, 0 }
};
@@ -50,15 +52,6 @@ rs6000_option_init_struct (struct gcc_options *opts)
opts->x_flag_section_anchors = 1;
}
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-
-static void
-rs6000_option_default_params (void)
-{
- /* Double growth factor to counter reduced min jump length. */
- param_max_grow_copy_bb_insns = 16;
-}
-
/* If not otherwise specified by a target, make 'long double' equivalent to
'double'. */
@@ -319,9 +312,6 @@ rs6000_supports_split_stack (bool report,
#undef TARGET_OPTION_INIT_STRUCT
#define TARGET_OPTION_INIT_STRUCT rs6000_option_init_struct
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS rs6000_option_default_params
-
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE rs6000_option_optimization_table
diff --git a/gcc/common/config/rs6000/rs6000-common.c b/gcc/common/config/rs6000/rs6000-common.c
index 250eca7ecf9..eb0328dee63 100644
--- a/gcc/common/config/rs6000/rs6000-common.c
+++ b/gcc/common/config/rs6000/rs6000-common.c
@@ -42,6 +42,9 @@ static const struct default_options rs6000_option_optimization_table[] =
turn them off. */
{ OPT_LEVELS_ALL, OPT_fweb, NULL, 0 },
{ OPT_LEVELS_ALL, OPT_frename_registers, NULL, 0 },
+
+ /* Double growth factor to counter reduced min jump length. */
+ { OPT_LEVELS_ALL, OPT__param_max_grow_copy_bb_insns_, NULL, 16 },
{ OPT_LEVELS_NONE, 0, NULL, 0 }
};
@@ -69,15 +72,6 @@ rs6000_option_init_struct (struct gcc_options *opts)
#endif
}
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-
-static void
-rs6000_option_default_params (void)
-{
- /* Double growth factor to counter reduced min jump length. */
- param_max_grow_copy_bb_insns = 16;
-}
-
/* If not otherwise specified by a target, make 'long double' equivalent to
'double'. */
@@ -271,9 +265,6 @@ rs6000_supports_split_stack (bool report,
#undef TARGET_OPTION_INIT_STRUCT
#define TARGET_OPTION_INIT_STRUCT rs6000_option_init_struct
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS rs6000_option_default_params
-
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE rs6000_option_optimization_table
diff --git a/gcc/common/config/sh/sh-common.c b/gcc/common/config/sh/sh-common.c
index 104b1b4a304..f195753c70b 100644
--- a/gcc/common/config/sh/sh-common.c
+++ b/gcc/common/config/sh/sh-common.c
@@ -31,6 +31,7 @@ static const struct default_options sh_option_optimization_table[] =
{
{ OPT_LEVELS_SIZE, OPT_mdiv_, SH_DIV_STR_FOR_SIZE, 1 },
{ OPT_LEVELS_0_ONLY, OPT_mdiv_, "", 1 },
+ { OPT_LEVELS_ALL, OPT__param_simultaneous_prefetches_, NULL, 2 },
{ OPT_LEVELS_NONE, 0, NULL, 0 }
};
@@ -144,17 +145,8 @@ sh_handle_option (struct gcc_options *opts,
}
}
-/* Implement TARGET_OPTION_DEFAULT_PARAMS. */
-static void
-sh_option_default_params (void)
-{
- param_simultaneous_prefetches = 2;
-}
-
#undef TARGET_OPTION_OPTIMIZATION_TABLE
#define TARGET_OPTION_OPTIMIZATION_TABLE sh_option_optimization_table
-#undef TARGET_OPTION_DEFAULT_PARAMS
-#define TARGET_OPTION_DEFAULT_PARAMS sh_option_default_params
#undef TARGET_DEFAULT_TARGET_FLAGS
#define TARGET_DEFAULT_TARGET_FLAGS TARGET_DEFAULT
#undef TARGET_HANDLE_OPTION
diff --git a/gcc/config/aarch64/aarch64.c b/gcc/config/aarch64/aarch64.c
index 78e6bc0475e..d2a3c7ef90a 100644
--- a/gcc/config/aarch64/aarch64.c
+++ b/gcc/config/aarch64/aarch64.c
@@ -13340,16 +13340,14 @@ aarch64_override_options_internal (struct gcc_options *opts)
param_sched_pressure_algorithm,
SCHED_PRESSURE_MODEL);
- /* If the user hasn't changed it via configure then set the default to 64 KB
- for the backend. */
- SET_OPTION_IF_UNSET (opts, &global_options_set,
- param_stack_clash_protection_guard_size,
- (DEFAULT_STK_CLASH_GUARD_SIZE == 0
- ? 16 : DEFAULT_STK_CLASH_GUARD_SIZE));
-
/* Validate the guard size. */
int guard_size = param_stack_clash_protection_guard_size;
+ if (guard_size != 12 && guard_size != 16)
+ error ("only values 12 (4 KB) and 16 (64 KB) are supported for guard "
+ "size. Given value %d (%llu KB) is out of range",
+ guard_size, (1ULL << guard_size) / 1024ULL);
+
/* Enforce that interval is the same size as size so the mid-end does the
right thing. */
SET_OPTION_IF_UNSET (opts, &global_options_set,
diff --git a/gcc/doc/tm.texi b/gcc/doc/tm.texi
index f6bc31bef65..11c236e1c65 100644
--- a/gcc/doc/tm.texi
+++ b/gcc/doc/tm.texi
@@ -758,14 +758,6 @@ options are changed via @code{#pragma GCC optimize} or by using the
Set target-dependent initial values of fields in @var{opts}.
@end deftypefn
-@deftypefn {Common Target Hook} void TARGET_OPTION_DEFAULT_PARAMS (void)
-Set target-dependent default values for @option{--param} settings.
-@end deftypefn
-
-@deftypefn {Common Target Hook} bool TARGET_OPTION_VALIDATE_PARAM (int, @var{int})
-Validate target-dependent value for @option{--param} settings.
-@end deftypefn
-
@defmac SWITCHABLE_TARGET
Some targets need to switch between substantially different subtargets
during compilation. For example, the MIPS target has one subtarget for
diff --git a/gcc/doc/tm.texi.in b/gcc/doc/tm.texi.in
index 2739e9ceec5..b8c41b5a7aa 100644
--- a/gcc/doc/tm.texi.in
+++ b/gcc/doc/tm.texi.in
@@ -736,10 +736,6 @@ options are changed via @code{#pragma GCC optimize} or by using the
@hook TARGET_OPTION_INIT_STRUCT
-@hook TARGET_OPTION_DEFAULT_PARAMS
-
-@hook TARGET_OPTION_VALIDATE_PARAM
-
@defmac SWITCHABLE_TARGET
Some targets need to switch between substantially different subtargets
during compilation. For example, the MIPS target has one subtarget for
--
2.24.0
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 0/7] Param conversion to option machinery
2019-11-11 14:50 ` [PATCH 0/7] Param conversion to option machinery Richard Biener
@ 2019-11-12 9:24 ` Martin Liška
2019-11-12 9:45 ` Richard Biener
0 siblings, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-12 9:24 UTC (permalink / raw)
To: Richard Biener; +Cc: GCC Patches
[-- Attachment #1: Type: text/plain, Size: 380 bytes --]
On 11/11/19 3:42 PM, Richard Biener wrote:
> I didn't go over them but maybe we can postpone this to a followup
> and for now make_none_ of them Optimization which preserves
Ok, there's updated patch w/o the Optimization keyword.
> previous behavior (I guess the optimize attribute/pragma doesn't
> accept -param either at the moment).
No, the syntax is not allowed.
Martin
[-- Attachment #2: 0002-Include-new-generated-gcc-params.opt-file.patch --]
[-- Type: text/x-patch, Size: 49885 bytes --]
From eaa526ee24841022bc542da86d4ee4b23c881eaf Mon Sep 17 00:00:00 2001
From: Martin Liska <mliska@suse.cz>
Date: Wed, 6 Nov 2019 11:30:57 +0100
Subject: [PATCH 2/9] Include new generated gcc/params.opt file.
gcc/ChangeLog:
2019-11-06 Martin Liska <mliska@suse.cz>
* Makefile.in: Include params.opt.
* flag-types.h (enum parloops_schedule_type): Add
parloops_schedule_type used in params.opt.
* params.opt: New file.
---
gcc/Makefile.in | 2 +-
gcc/flag-types.h | 11 +
gcc/params.opt | 971 +++++++++++++++++++++++++++++++++++++++++++++++
3 files changed, 983 insertions(+), 1 deletion(-)
create mode 100644 gcc/params.opt
diff --git a/gcc/Makefile.in b/gcc/Makefile.in
index ac21401af39..ff9a2841d52 100644
--- a/gcc/Makefile.in
+++ b/gcc/Makefile.in
@@ -567,7 +567,7 @@ xm_include_list=@xm_include_list@
xm_defines=@xm_defines@
lang_checks=
lang_checks_parallelized=
-lang_opt_files=@lang_opt_files@ $(srcdir)/c-family/c.opt $(srcdir)/common.opt
+lang_opt_files=@lang_opt_files@ $(srcdir)/c-family/c.opt $(srcdir)/common.opt $(srcdir)/params.opt
lang_specs_files=@lang_specs_files@
lang_tree_files=@lang_tree_files@
target_cpu_default=@target_cpu_default@
diff --git a/gcc/flag-types.h b/gcc/flag-types.h
index b23d3a271f1..0c23aadefed 100644
--- a/gcc/flag-types.h
+++ b/gcc/flag-types.h
@@ -370,4 +370,15 @@ enum cf_protection_level
CF_FULL = CF_BRANCH | CF_RETURN,
CF_SET = 1 << 2
};
+
+/* Parloops schedule type. */
+enum parloops_schedule_type
+{
+ PARLOOPS_SCHEDULE_STATIC = 0,
+ PARLOOPS_SCHEDULE_DYNAMIC,
+ PARLOOPS_SCHEDULE_GUIDED,
+ PARLOOPS_SCHEDULE_AUTO,
+ PARLOOPS_SCHEDULE_RUNTIME
+};
+
#endif /* ! GCC_FLAG_TYPES_H */
diff --git a/gcc/params.opt b/gcc/params.opt
new file mode 100644
index 00000000000..be0a3a15598
--- /dev/null
+++ b/gcc/params.opt
@@ -0,0 +1,971 @@
+; Parameter options of the compiler.
+
+; Copyright (C) 2019 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
+; Software Foundation; either version 3, or (at your option) any later
+; version.
+;
+; GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+; WARRANTY; without even the implied warranty of MERCHANTABILITY or
+; FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+; for more details.
+;
+; You should have received a copy of the GNU General Public License
+; along with GCC; see the file COPYING3. If not see
+; <http://www.gnu.org/licenses/>.
+
+; See the GCC internals manual (options.texi) for a description of this file's format.
+
+; Please try to keep this file in ASCII collating order.
+
+-param=align-loop-iterations=
+Common Joined UInteger Var(param_align_loop_iterations) Init(4) Param
+Loops iterating at least selected number of iterations will get loop alignment.
+
+-param=align-threshold=
+Common Joined UInteger Var(param_align_threshold) Init(100) IntegerRange(1, 65536) Param
+Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment.
+
+-param=asan-globals=
+Common Joined UInteger Var(param_asan_globals) Init(1) IntegerRange(0, 1) Param
+Enable asan globals protection.
+
+-param=asan-instrument-allocas=
+Common Joined UInteger Var(param_asan_protect_allocas) Init(1) IntegerRange(0, 1) Param
+Enable asan allocas/VLAs protection.
+
+-param=asan-instrument-reads=
+Common Joined UInteger Var(param_asan_instrument_reads) Init(1) IntegerRange(0, 1) Param
+Enable asan load operations protection.
+
+-param=asan-instrument-writes=
+Common Joined UInteger Var(param_asan_instrument_writes) Init(1) IntegerRange(0, 1) Param
+Enable asan store operations protection.
+
+-param=asan-instrumentation-with-call-threshold=
+Common Joined UInteger Var(param_asan_instrumentation_with_call_threshold) Init(7000) Param
+Use callbacks instead of inline code if number of accesses in function becomes greater or equal to this number.
+
+-param=asan-memintrin=
+Common Joined UInteger Var(param_asan_memintrin) Init(1) IntegerRange(0, 1) Param
+Enable asan builtin functions protection.
+
+-param=asan-stack=
+Common Joined UInteger Var(param_asan_stack) Init(1) IntegerRange(0, 1) Param
+Enable asan stack protection.
+
+-param=asan-use-after-return=
+Common Joined UInteger Var(param_asan_use_after_return) Init(1) IntegerRange(0, 1) Param
+Enable asan detection of use-after-return bugs.
+
+-param=avg-loop-niter=
+Common Joined UInteger Var(param_avg_loop_niter) Init(10) IntegerRange(1, 65536) Param
+Average number of iterations of a loop.
+
+-param=avoid-fma-max-bits=
+Common Joined UInteger Var(param_avoid_fma_max_bits) IntegerRange(0, 512) Param
+Maximum number of bits for which we avoid creating FMAs.
+
+-param=builtin-expect-probability=
+Common Joined UInteger Var(param_builtin_expect_probability) Init(90) IntegerRange(0, 100) Param
+Set the estimated probability in percentage for builtin expect. The default value is 90% probability.
+
+-param=builtin-string-cmp-inline-length=
+Common Joined UInteger Var(param_builtin_string_cmp_inline_length) Init(3) IntegerRange(0, 100) Param
+The maximum length of a constant string for a builtin string cmp call eligible for inlining. The default value is 3.
+
+-param=case-values-threshold=
+Common Joined UInteger Var(param_case_values_threshold) Param
+The smallest number of different values for which it is best to use a jump-table instead of a tree of conditional branches, if 0, use the default for the machine.
+
+-param=comdat-sharing-probability=
+Common Joined UInteger Var(param_comdat_sharing_probability) Init(20) Param
+Probability that COMDAT function will be shared with different compilation unit.
+
+-param=cxx-max-namespaces-for-diagnostic-help=
+Common Joined UInteger Var(param_cxx_max_namespaces_for_diagnostic_help) Init(1000) Param
+Maximum number of namespaces to search for alternatives when name lookup fails.
+
+-param=dse-max-alias-queries-per-store=
+Common Joined UInteger Var(param_dse_max_alias_queries_per_store) Init(256) Param
+Maximum number of queries into the alias oracle per store.
+
+-param=dse-max-object-size=
+Common Joined UInteger Var(param_dse_max_object_size) Init(256) Param
+Maximum size (in bytes) of objects tracked bytewise by dead store elimination.
+
+-param=early-inlining-insns=
+Common Joined UInteger Var(param_early_inlining_insns) Init(14) Param
+Maximal estimated growth of function body caused by early inlining of single call with -O3 and -Ofast.
+
+-param=early-inlining-insns-O2=
+Common Joined UInteger Var(param_early_inlining_insns_o2) Init(6) Param
+Maximal estimated growth of function body caused by early inlining of single call with -O1 and -O2.
+
+-param=fsm-maximum-phi-arguments=
+Common Joined UInteger Var(param_fsm_maximum_phi_arguments) Init(100) IntegerRange(1, 999999) Param
+Maximum number of arguments a PHI may have before the FSM threader will not try to thread through its block.
+
+-param=fsm-scale-path-blocks=
+Common Joined UInteger Var(param_fsm_scale_path_blocks) Init(3) IntegerRange(1, 10) Param
+Scale factor to apply to the number of blocks in a threading path when comparing to the number of (scaled) statements.
+
+-param=fsm-scale-path-stmts=
+Common Joined UInteger Var(param_fsm_scale_path_stmts) Init(2) IntegerRange(1, 10) Param
+Scale factor to apply to the number of statements in a threading path when comparing to the number of (scaled) blocks.
+
+-param=gcse-after-reload-critical-fraction=
+Common Joined UInteger Var(param_gcse_after_reload_critical_fraction) Init(10) Param
+The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload.
+
+-param=gcse-after-reload-partial-fraction=
+Common Joined UInteger Var(param_gcse_after_reload_partial_fraction) Init(3) Param
+The threshold ratio for performing partial redundancy elimination after reload.
+
+-param=gcse-cost-distance-ratio=
+Common Joined UInteger Var(param_gcse_cost_distance_ratio) Init(10) Param
+Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations.
+
+-param=gcse-unrestricted-cost=
+Common Joined UInteger Var(param_gcse_unrestricted_cost) Init(3) Param
+Cost at which GCSE optimizations will not constraint the distance an expression can travel.
+
+-param=ggc-min-expand=
+Common Joined UInteger Var(param_ggc_min_expand) Init(30) Param
+Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap.
+
+-param=ggc-min-heapsize=
+Common Joined UInteger Var(param_ggc_min_heapsize) Init(4096) Param
+Minimum heap size before we start collecting garbage, in kilobytes.
+
+-param=gimple-fe-computed-hot-bb-threshold=
+Common Joined UInteger Var(param_gimple_fe_computed_hot_bb_threshold) Param
+The number of executions of a basic block which is considered hot. The parameter is used only in GIMPLE FE.
+
+-param=graphite-allow-codegen-errors=
+Common Joined UInteger Var(param_graphite_allow_codegen_errors) IntegerRange(0, 1) Param
+Whether codegen errors should be ICEs when -fchecking.
+
+-param=graphite-max-arrays-per-scop=
+Common Joined UInteger Var(param_graphite_max_arrays_per_scop) Init(100) Param
+Maximum number of arrays per SCoP.
+
+-param=graphite-max-nb-scop-params=
+Common Joined UInteger Var(param_graphite_max_nb_scop_params) Init(10) Param
+Maximum number of parameters in a SCoP.
+
+-param=hash-table-verification-limit=
+Common Joined UInteger Var(param_hash_table_verification_limit) Init(10) Param
+The number of elements for which hash table verification is done for each searched element.
+
+-param=hot-bb-count-fraction=
+Common Joined UInteger Var(param_hot_bb_count_fraction) Init(10000) Param
+The denominator n of fraction 1/n of the maximal execution count of a basic block in the entire program that a basic block needs to at least have in order to be considered hot (used in non-LTO mode).
+
+-param=hot-bb-count-ws-permille=
+Common Joined UInteger Var(param_hot_bb_count_ws_permille) Init(990) IntegerRange(0, 1000) Param
+The number of most executed permilles of the profiled execution of the entire program to which the execution count of a basic block must be part of in order to be considered hot (used in LTO mode).
+
+-param=hot-bb-frequency-fraction=
+Common Joined UInteger Var(param_hot_bb_frequency_fraction) Init(1000) Param
+The denominator n of fraction 1/n of the execution frequency of the entry block of a function that a basic block of this function needs to at least have in order to be considered hot.
+
+-param=hsa-gen-debug-stores=
+Common Joined UInteger Var(param_hsa_gen_debug_stores) IntegerRange(0, 1) Param
+Level of hsa debug stores verbosity.
+
+-param=inline-heuristics-hint-percent=
+Common Joined UInteger Var(param_inline_heuristics_hint_percent) Init(600) IntegerRange(100, 1000000) Param
+The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable with -O3 and -Ofast.
+
+-param=inline-heuristics-hint-percent-O2=
+Common Joined UInteger Var(param_inline_heuristics_hint_percent_o2) Init(200) IntegerRange(100, 1000000) Param
+The scale (in percents) applied to inline-insns-single and auto limits when heuristics hints that inlining is very profitable.
+
+-param=inline-min-speedup=
+Common Joined UInteger Var(param_inline_min_speedup) Init(15) IntegerRange(0, 100) Param
+The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto with -O3 and -Ofast.
+
+-param=inline-min-speedup-O2=
+Common Joined UInteger Var(param_inline_min_speedup_o2) Init(30) IntegerRange(0, 100) Param
+The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-insns-auto.
+
+-param=inline-unit-growth=
+Common Joined UInteger Var(param_inline_unit_growth) Init(40) Param
+How much can given compilation unit grow because of the inlining (in percent).
+
+-param=integer-share-limit=
+Common Joined UInteger Var(param_integer_share_limit) Init(251) IntegerRange(2, 65536) Param
+The upper bound for sharing integer constants.
+
+-param=ipa-cp-eval-threshold=
+Common Joined UInteger Var(param_ipa_cp_eval_threshold) Init(500) Param
+Threshold ipa-cp opportunity evaluation that is still considered beneficial to clone.
+
+-param=ipa-cp-loop-hint-bonus=
+Common Joined UInteger Var(param_ipa_cp_loop_hint_bonus) Init(64) Param
+Compile-time bonus IPA-CP assigns to candidates which make loop bounds or strides known.
+
+-param=ipa-cp-recursion-penalty=
+Common Joined UInteger Var(param_ipa_cp_recursion_penalty) Init(40) IntegerRange(0, 100) Param
+Percentage penalty the recursive functions will receive when they are evaluated for cloning.
+
+-param=ipa-cp-single-call-penalty=
+Common Joined UInteger Var(param_ipa_cp_single_call_penalty) Init(15) IntegerRange(0, 100) Param
+Percentage penalty functions containing a single call to another function will receive when they are evaluated for cloning.
+
+-param=ipa-cp-value-list-size=
+Common Joined UInteger Var(param_ipa_cp_value_list_size) Init(8) Param
+Maximum size of a list of values associated with each parameter for interprocedural constant propagation.
+
+-param=ipa-max-aa-steps=
+Common Joined UInteger Var(param_ipa_max_aa_steps) Init(25000) Param
+Maximum number of statements that will be visited by IPA formal parameter analysis based on alias analysis in any given function.
+
+-param=ipa-max-agg-items=
+Common Joined UInteger Var(param_ipa_max_agg_items) Init(16) Param
+Maximum number of aggregate content items for a parameter in jump functions and lattices.
+
+-param=ipa-max-param-expr-ops=
+Common Joined UInteger Var(param_ipa_max_param_expr_ops) Init(10) Param
+Maximum number of operations in a parameter expression that can be handled by IPA analysis.
+
+-param=ipa-max-switch-predicate-bounds=
+Common Joined UInteger Var(param_ipa_max_switch_predicate_bounds) Init(5) Param
+Maximal number of boundary endpoints of case ranges of switch statement used during IPA functoin summary generation.
+
+-param=ipa-sra-max-replacements=
+Common Joined UInteger Var(param_ipa_sra_max_replacements) Init(8) IntegerRange(0, 16) Param
+Maximum pieces that IPA-SRA tracks per formal parameter, as a consequence, also the maximum number of replacements of a formal parameter.
+
+-param=ipa-sra-ptr-growth-factor=
+Common Joined UInteger Var(param_ipa_sra_ptr_growth_factor) Init(2) Param
+Maximum allowed growth of number and total size of new parameters that ipa-sra replaces a pointer to an aggregate with.
+
+-param=ipcp-unit-growth=
+Common Joined UInteger Var(param_ipcp_unit_growth) Init(10) Param
+How much can given compilation unit grow because of the interprocedural constant propagation (in percent).
+
+-param=ira-loop-reserved-regs=
+Common Joined UInteger Var(param_ira_loop_reserved_regs) Init(2) Param
+The number of registers in each class kept unused by loop invariant motion.
+
+-param=ira-max-conflict-table-size=
+Common Joined UInteger Var(param_ira_max_conflict_table_size) Init(1000) Param
+Max size of conflict table in MB.
+
+-param=ira-max-loops-num=
+Common Joined UInteger Var(param_ira_max_loops_num) Init(100) Param
+Max loops number for regional RA.
+
+-param=iv-always-prune-cand-set-bound=
+Common Joined UInteger Var(param_iv_always_prune_cand_set_bound) Init(10) Param
+If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization.
+
+-param=iv-consider-all-candidates-bound=
+Common Joined UInteger Var(param_iv_consider_all_candidates_bound) Init(40) Param
+Bound on number of candidates below that all candidates are considered in iv optimizations.
+
+-param=iv-max-considered-uses=
+Common Joined UInteger Var(param_iv_max_considered_uses) Init(250) Param
+Bound on number of iv uses in loop optimized in iv optimizations.
+
+-param=jump-table-max-growth-ratio-for-size=
+Common Joined UInteger Var(param_jump_table_max_growth_ratio_for_size) Init(300) Param
+The maximum code size growth ratio when expanding into a jump table (in percent). The parameter is used when optimizing for size.
+
+-param=jump-table-max-growth-ratio-for-speed=
+Common Joined UInteger Var(param_jump_table_max_growth_ratio_for_speed) Init(800) Param
+The maximum code size growth ratio when expanding into a jump table (in percent). The parameter is used when optimizing for speed.
+
+-param=l1-cache-line-size=
+Common Joined UInteger Var(param_l1_cache_line_size) Init(32) Param
+The size of L1 cache line.
+
+-param=l1-cache-size=
+Common Joined UInteger Var(param_l1_cache_size) Init(64) Param
+The size of L1 cache.
+
+-param=l2-cache-size=
+Common Joined UInteger Var(param_l2_cache_size) Init(512) Param
+The size of L2 cache.
+
+-param=large-function-growth=
+Common Joined UInteger Var(param_large_function_growth) Init(100) Param
+Maximal growth due to inlining of large function (in percent).
+
+-param=large-function-insns=
+Common Joined UInteger Var(param_large_function_insns) Init(2700) Param
+The size of function body to be considered large.
+
+-param=large-stack-frame=
+Common Joined UInteger Var(param_large_stack_frame) Init(256) Param
+The size of stack frame to be considered large.
+
+-param=large-stack-frame-growth=
+Common Joined UInteger Var(param_stack_frame_growth) Init(1000) Param
+Maximal stack frame growth due to inlining (in percent).
+
+-param=large-unit-insns=
+Common Joined UInteger Var(param_large_unit_insns) Init(10000) Param
+The size of translation unit to be considered large.
+
+-param=lim-expensive=
+Common Joined UInteger Var(param_lim_expensive) Init(20) Param
+The minimum cost of an expensive expression in the loop invariant motion.
+
+-param=logical-op-non-short-circuit=
+Common Joined UInteger Var(param_logical_op_non_short_circuit) Init(-1) IntegerRange(-1, 1) Param
+True if a non-short-circuit operation is optimal.
+
+-param=loop-block-tile-size=
+Common Joined UInteger Var(param_loop_block_tile_size) Init(51) Param
+Size of tiles for loop blocking.
+
+-param=loop-interchange-max-num-stmts=
+Common Joined UInteger Var(param_loop_interchange_max_num_stmts) Init(64) Param
+The maximum number of stmts in loop nest for loop interchange.
+
+-param=loop-interchange-stride-ratio=
+Common Joined UInteger Var(param_loop_interchange_stride_ratio) Init(2) Param
+The minimum stride ratio for loop interchange to be profitable.
+
+-param=loop-invariant-max-bbs-in-loop=
+Common Joined UInteger Var(param_loop_invariant_max_bbs_in_loop) Init(10000) Param
+Max basic blocks number in loop for loop invariant motion.
+
+-param=loop-max-datarefs-for-datadeps=
+Common Joined UInteger Var(param_loop_max_datarefs_for_datadeps) Init(1000) Param
+Maximum number of datarefs in loop for building loop data dependencies.
+
+-param=loop-versioning-max-inner-insns=
+Common Joined UInteger Var(param_loop_versioning_max_inner_insns) Init(200) Param
+The maximum number of instructions in an inner loop that is being considered for versioning.
+
+-param=loop-versioning-max-outer-insns=
+Common Joined UInteger Var(param_loop_versioning_max_outer_insns) Init(100) Param
+The maximum number of instructions in an outer loop that is being considered for versioning, on top of the instructions in inner loops.
+
+-param=lra-inheritance-ebb-probability-cutoff=
+Common Joined UInteger Var(param_lra_inheritance_ebb_probability_cutoff) Init(40) IntegerRange(0, 100) Param
+Minimal fall-through edge probability in percentage used to add BB to inheritance EBB in LRA.
+
+-param=lra-max-considered-reload-pseudos=
+Common Joined UInteger Var(param_lra_max_considered_reload_pseudos) Init(500) Param
+The max number of reload pseudos which are considered during spilling a non-reload pseudo.
+
+-param=lto-max-partition=
+Common Joined UInteger Var(param_max_partition_size) Init(1000000) Param
+Maximal size of a partition for LTO (in estimated instructions).
+
+-param=lto-max-streaming-parallelism=
+Common Joined UInteger Var(param_max_lto_streaming_parallelism) Init(32) IntegerRange(1, 65536) Param
+maximal number of LTO partitions streamed in parallel.
+
+-param=lto-min-partition=
+Common Joined UInteger Var(param_min_partition_size) Init(10000) Param
+Minimal size of a partition for LTO (in estimated instructions).
+
+-param=lto-partitions=
+Common Joined UInteger Var(param_lto_partitions) Init(128) IntegerRange(1, 65536) Param
+Number of partitions the program should be split to.
+
+-param=max-average-unrolled-insns=
+Common Joined UInteger Var(param_max_average_unrolled_insns) Init(80) Param
+The maximum number of instructions to consider to unroll in a loop on average.
+
+-param=max-combine-insns=
+Common Joined UInteger Var(param_max_combine_insns) Init(4) IntegerRange(2, 4) Param
+The maximum number of insns combine tries to combine.
+
+-param=max-completely-peel-loop-nest-depth=
+Common Joined UInteger Var(param_max_unroll_iterations) Init(8) Param
+The maximum depth of a loop nest we completely peel.
+
+-param=max-completely-peel-times=
+Common Joined UInteger Var(param_max_completely_peel_times) Init(16) Param
+The maximum number of peelings of a single loop that is peeled completely.
+
+-param=max-completely-peeled-insns=
+Common Joined UInteger Var(param_max_completely_peeled_insns) Init(200) Param
+The maximum number of insns of a completely peeled loop.
+
+-param=max-crossjump-edges=
+Common Joined UInteger Var(param_max_crossjump_edges) Init(100) Param
+The maximum number of incoming edges to consider for crossjumping.
+
+-param=max-cse-insns=
+Common Joined UInteger Var(param_max_cse_insns) Init(1000) Param
+The maximum instructions CSE process before flushing.
+
+-param=max-cse-path-length=
+Common Joined UInteger Var(param_max_cse_path_length) Init(10) IntegerRange(1, 65536) Param
+The maximum length of path considered in cse.
+
+-param=max-cselib-memory-locations=
+Common Joined UInteger Var(param_max_cselib_memory_locations) Init(500) Param
+The maximum memory locations recorded by cselib.
+
+-param=max-debug-marker-count=
+Common Joined UInteger Var(param_max_debug_marker_count) Init(100000) Param
+Max. count of debug markers to expand or inline.
+
+-param=max-delay-slot-insn-search=
+Common Joined UInteger Var(param_max_delay_slot_insn_search) Init(100) Param
+The maximum number of instructions to consider to fill a delay slot.
+
+-param=max-delay-slot-live-search=
+Common Joined UInteger Var(param_max_delay_slot_live_search) Init(333) Param
+The maximum number of instructions to consider to find accurate live register information.
+
+-param=max-dse-active-local-stores=
+Common Joined UInteger Var(param_max_dse_active_local_stores) Init(5000) Param
+Maximum number of active local stores in RTL dead store elimination.
+
+-param=max-early-inliner-iterations=
+Common Joined UInteger Var(param_early_inliner_max_iterations) Init(1) Param
+The maximum number of nested indirect inlining performed by early inliner.
+
+-param=max-fields-for-field-sensitive=
+Common Joined UInteger Var(param_max_fields_for_field_sensitive) Param
+Maximum number of fields in a structure before pointer analysis treats the structure as a single variable.
+
+-param=max-fsm-thread-length=
+Common Joined UInteger Var(param_max_fsm_thread_length) Init(10) IntegerRange(1, 999999) Param
+Maximum number of basic blocks on a finite state automaton jump thread path.
+
+-param=max-fsm-thread-path-insns=
+Common Joined UInteger Var(param_max_fsm_thread_path_insns) Init(100) IntegerRange(1, 999999) Param
+Maximum number of instructions to copy when duplicating blocks on a finite state automaton jump thread path.
+
+-param=max-fsm-thread-paths=
+Common Joined UInteger Var(param_max_fsm_thread_paths) Init(50) IntegerRange(1, 999999) Param
+Maximum number of new jump thread paths to create for a finite state automaton.
+
+-param=max-gcse-insertion-ratio=
+Common Joined UInteger Var(param_max_gcse_insertion_ratio) Init(20) Param
+The maximum ratio of insertions to deletions of expressions in GCSE.
+
+-param=max-gcse-memory=
+Common Joined UInteger Var(param_max_gcse_memory) Init(134217728) Param
+The maximum amount of memory to be allocated by GCSE.
+
+-param=max-goto-duplication-insns=
+Common Joined UInteger Var(param_max_goto_duplication_insns) Init(8) Param
+The maximum number of insns to duplicate when unfactoring computed gotos.
+
+-param=max-grow-copy-bb-insns=
+Common Joined UInteger Var(param_max_grow_copy_bb_insns) Init(8) Param
+The maximum expansion factor when copying basic blocks.
+
+-param=max-hoist-depth=
+Common Joined UInteger Var(param_max_hoist_depth) Init(30) Param
+Maximum depth of search in the dominator tree for expressions to hoist.
+
+-param=max-inline-insns-auto=
+Common Joined UInteger Var(param_max_inline_insns_auto) Init(30) Param
+The maximum number of instructions when automatically inlining with -O3 and -Ofast.
+
+-param=max-inline-insns-auto-O2=
+Common Joined UInteger Var(param_max_inline_insns_auto_o2) Init(15) Param
+The maximum number of instructions when automatically inlining.
+
+-param=max-inline-insns-recursive=
+Common Joined UInteger Var(param_max_inline_insns_recursive) Init(450) Param
+The maximum number of instructions inline function can grow to via recursive inlining.
+
+-param=max-inline-insns-recursive-auto=
+Common Joined UInteger Var(param_max_inline_insns_recursive_auto) Init(450) Param
+The maximum number of instructions non-inline function can grow to via recursive inlining.
+
+-param=max-inline-insns-single=
+Common Joined UInteger Var(param_max_inline_insns_single) Init(200) Param
+The maximum number of instructions in a single function eligible for inlining with -O3 and -Ofast.
+
+-param=max-inline-insns-single-O2=
+Common Joined UInteger Var(param_max_inline_insns_single_o2) Init(30) Param
+The maximum number of instructions in a single function eligible for inlining.
+
+-param=max-inline-insns-size=
+Common Joined UInteger Var(param_max_inline_insns_size) Param
+The maximum number of instructions when inlining for size.
+
+-param=max-inline-insns-small=
+Common Joined UInteger Var(param_max_inline_insns_small) Param
+The maximum number of instructions when automatically inlining small functions.
+
+-param=max-inline-recursive-depth=
+Common Joined UInteger Var(param_max_inline_recursive_depth) Init(8) Param
+The maximum depth of recursive inlining for inline functions.
+
+-param=max-inline-recursive-depth-auto=
+Common Joined UInteger Var(param_max_inline_recursive_depth_auto) Init(8) Param
+The maximum depth of recursive inlining for non-inline functions.
+
+-param=max-isl-operations=
+Common Joined UInteger Var(param_max_isl_operations) Init(350000) Param
+Maximum number of isl operations, 0 means unlimited.
+
+-param=max-iterations-computation-cost=
+Common Joined UInteger Var(param_max_iterations_computation_cost) Init(10) Param
+Bound on the cost of an expression to compute the number of iterations.
+
+-param=max-iterations-to-track=
+Common Joined UInteger Var(param_max_iterations_to_track) Init(1000) Param
+Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates.
+
+-param=max-jump-thread-duplication-stmts=
+Common Joined UInteger Var(param_max_jump_thread_duplication_stmts) Init(15) Param
+Maximum number of statements allowed in a block that needs to be duplicated when threading jumps.
+
+-param=max-last-value-rtl=
+Common Joined UInteger Var(param_max_last_value_rtl) Init(10000) Param
+The maximum number of RTL nodes that can be recorded as combiner's last value.
+
+-param=max-loop-header-insns=
+Common Joined UInteger Var(param_max_loop_header_insns) Init(20) Param
+The maximum number of insns in loop header duplicated by the copy loop headers pass.
+
+-param=max-modulo-backtrack-attempts=
+Common Joined UInteger Var(param_max_modulo_backtrack_attempts) Init(40) Param
+The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop.
+
+-param=max-partial-antic-length=
+Common Joined UInteger Var(param_max_partial_antic_length) Init(100) Param
+Maximum length of partial antic set when performing tree pre optimization.
+
+-param=max-peel-branches=
+Common Joined UInteger Var(param_max_peel_branches) Init(32) Param
+The maximum number of branches on the path through the peeled sequence.
+
+-param=max-peel-times=
+Common Joined UInteger Var(param_max_peel_times) Init(16) Param
+The maximum number of peelings of a single loop.
+
+-param=max-peeled-insns=
+Common Joined UInteger Var(param_max_peeled_insns) Init(100) Param
+The maximum number of insns of a peeled loop.
+
+-param=max-pending-list-length=
+Common Joined UInteger Var(param_max_pending_list_length) Init(32) Param
+The maximum length of scheduling's pending operations list.
+
+-param=max-pipeline-region-blocks=
+Common Joined UInteger Var(param_max_pipeline_region_blocks) Init(15) Param
+The maximum number of blocks in a region to be considered for interblock scheduling.
+
+-param=max-pipeline-region-insns=
+Common Joined UInteger Var(param_max_pipeline_region_insns) Init(200) Param
+The maximum number of insns in a region to be considered for interblock scheduling.
+
+-param=max-pow-sqrt-depth=
+Common Joined UInteger Var(param_max_pow_sqrt_depth) Init(5) IntegerRange(1, 32) Param
+Maximum depth of sqrt chains to use when synthesizing exponentiation by a real constant.
+
+-param=max-predicted-iterations=
+Common Joined UInteger Var(param_max_predicted_iterations) Init(100) Param
+The maximum number of loop iterations we predict statically.
+
+-param=max-reload-search-insns=
+Common Joined UInteger Var(param_max_reload_search_insns) Init(100) Param
+The maximum number of instructions to search backward when looking for equivalent reload.
+
+-param=max-rtl-if-conversion-insns=
+Common Joined UInteger Var(param_max_rtl_if_conversion_insns) Init(10) IntegerRange(0, 99) Param
+Maximum number of insns in a basic block to consider for RTL if-conversion.
+
+-param=max-rtl-if-conversion-predictable-cost=
+Common Joined UInteger Var(param_max_rtl_if_conversion_predictable_cost) Init(20) IntegerRange(0, 200) Param
+Maximum permissible cost for the sequence that would be generated by the RTL if-conversion pass for a branch that is considered predictable.
+
+-param=max-rtl-if-conversion-unpredictable-cost=
+Common Joined UInteger Var(param_max_rtl_if_conversion_unpredictable_cost) Init(40) IntegerRange(0, 200) Param
+Maximum permissible cost for the sequence that would be generated by the RTL if-conversion pass for a branch that is considered unpredictable.
+
+-param=max-sched-extend-regions-iters=
+Common Joined UInteger Var(param_max_sched_extend_regions_iters) Param
+The maximum number of iterations through CFG to extend regions.
+
+-param=max-sched-insn-conflict-delay=
+Common Joined UInteger Var(param_max_sched_insn_conflict_delay) Init(3) IntegerRange(1, 10) Param
+The maximum conflict delay for an insn to be considered for speculative motion.
+
+-param=max-sched-ready-insns=
+Common Joined UInteger Var(param_max_sched_ready_insns) Init(100) IntegerRange(1, 65536) Param
+The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass.
+
+-param=max-sched-region-blocks=
+Common Joined UInteger Var(param_max_sched_region_blocks) Init(10) Param
+The maximum number of blocks in a region to be considered for interblock scheduling.
+
+-param=max-sched-region-insns=
+Common Joined UInteger Var(param_max_sched_region_insns) Init(100) Param
+The maximum number of insns in a region to be considered for interblock scheduling.
+
+-param=max-slsr-cand-scan=
+Common Joined UInteger Var(param_max_slsr_candidate_scan) Init(50) IntegerRange(1, 999999) Param
+Maximum length of candidate scans for straight-line strength reduction.
+
+-param=max-speculative-devirt-maydefs=
+Common Joined UInteger Var(param_max_speculative_devirt_maydefs) Init(50) Param
+Maximum number of may-defs visited when devirtualizing speculatively.
+
+-param=max-ssa-name-query-depth=
+Common Joined UInteger Var(param_max_ssa_name_query_depth) Init(3) IntegerRange(1, 10) Param
+Maximum recursion depth allowed when querying a property of an SSA name.
+
+-param=max-stores-to-merge=
+Common Joined UInteger Var(param_max_stores_to_merge) Init(64) IntegerRange(2, 65536) Param
+Maximum number of constant stores to merge in the store merging pass.
+
+-param=max-stores-to-sink=
+Common Joined UInteger Var(param_max_stores_to_sink) Init(2) Param
+Maximum number of conditional store pairs that can be sunk.
+
+-param=max-tail-merge-comparisons=
+Common Joined UInteger Var(param_max_tail_merge_comparisons) Init(10) Param
+Maximum amount of similar bbs to compare a bb with.
+
+-param=max-tail-merge-iterations=
+Common Joined UInteger Var(param_max_tail_merge_iterations) Init(2) Param
+Maximum amount of iterations of the pass over a function.
+
+-param=max-tracked-strlens=
+Common Joined UInteger Var(param_max_tracked_strlens) Init(10000) Param
+Maximum number of strings for which strlen optimization pass will track string lengths.
+
+-param=max-tree-if-conversion-phi-args=
+Common Joined UInteger Var(param_max_tree_if_conversion_phi_args) Init(4) IntegerRange(2, 65536) Param
+Maximum number of arguments in a PHI supported by TREE if-conversion unless the loop is marked with simd pragma.
+
+-param=max-unroll-times=
+Common Joined UInteger Var(param_max_unroll_times) Init(8) Param
+The maximum number of unrollings of a single loop.
+
+-param=max-unrolled-insns=
+Common Joined UInteger Var(param_max_unrolled_insns) Init(200) Param
+The maximum number of instructions to consider to unroll in a loop.
+
+-param=max-unswitch-insns=
+Common Joined UInteger Var(param_max_unswitch_insns) Init(50) Param
+The maximum number of insns of an unswitched loop.
+
+-param=max-unswitch-level=
+Common Joined UInteger Var(param_max_unswitch_level) Init(3) Param
+The maximum number of unswitchings in a single loop.
+
+-param=max-variable-expansions-in-unroller=
+Common Joined UInteger Var(param_max_variable_expansions) Init(1) Param
+If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling.
+
+-param=max-vartrack-expr-depth=
+Common Joined UInteger Var(param_max_vartrack_expr_depth) Init(12) Param
+Max. recursion depth for expanding var tracking expressions.
+
+-param=max-vartrack-reverse-op-size=
+Common Joined UInteger Var(param_max_vartrack_reverse_op_size) Init(50) Param
+Max. size of loc list for which reverse ops should be added.
+
+-param=max-vartrack-size=
+Common Joined UInteger Var(param_max_vartrack_size) Init(50000000) Param
+Max. size of var tracking hash tables.
+
+-param=max-vrp-switch-assertions=
+Common Joined UInteger Var(param_max_vrp_switch_assertions) Init(10) Param
+Maximum number of assertions to add along the default edge of a switch statement during VRP.
+
+-param=min-crossjump-insns=
+Common Joined UInteger Var(param_min_crossjump_insns) Init(5) IntegerRange(1, 65536) Param
+The minimum number of matching instructions to consider for crossjumping.
+
+-param=min-inline-recursive-probability=
+Common Joined UInteger Var(param_min_inline_recursive_probability) Init(10) Param
+Inline recursively only when the probability of call being executed exceeds the parameter.
+
+-param=min-insn-to-prefetch-ratio=
+Common Joined UInteger Var(param_min_insn_to_prefetch_ratio) Init(9) Param
+Min. ratio of insns to prefetches to enable prefetching for a loop with an unknown trip count.
+
+-param=min-loop-cond-split-prob=
+Common Joined UInteger Var(param_min_loop_cond_split_prob) Init(30) IntegerRange(0, 100) Param
+The minimum threshold for probability of semi-invariant condition statement to trigger loop split.
+
+-param=min-nondebug-insn-uid=
+Common Joined UInteger Var(param_min_nondebug_insn_uid) Param
+The minimum UID to be used for a nondebug insn.
+
+-param=min-size-for-stack-sharing=
+Common Joined UInteger Var(param_min_size_for_stack_sharing) Init(32) Param
+The minimum size of variables taking part in stack slot sharing when not optimizing.
+
+-param=min-spec-prob=
+Common Joined UInteger Var(param_min_spec_prob) Init(40) Param
+The minimum probability of reaching a source block for interblock speculative scheduling.
+
+-param=min-vect-loop-bound=
+Common Joined UInteger Var(param_min_vect_loop_bound) Param
+If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization.
+
+-param=parloops-chunk-size=
+Common Joined UInteger Var(param_parloops_chunk_size) Param
+Chunk size of omp schedule for loops parallelized by parloops.
+
+-param=parloops-min-per-thread=
+Common Joined UInteger Var(param_parloops_min_per_thread) Init(100) IntegerRange(2, 65536) Param
+Minimum number of iterations per thread of an innermost parallelized loop.
+
+-param=parloops-schedule=
+Common Joined Var(param_parloops_schedule) Enum(parloops_schedule_type) Param
+--param=parloops-schedule=[static|dynamic|guided|auto|runtime] Schedule type of omp schedule for loops parallelized by parloops.
+
+Enum
+Name(parloops_schedule_type) Type(int)
+
+EnumValue
+Enum(parloops_schedule_type) String(static) Value(PARLOOPS_SCHEDULE_STATIC)
+
+EnumValue
+Enum(parloops_schedule_type) String(dynamic) Value(PARLOOPS_SCHEDULE_DYNAMIC)
+
+EnumValue
+Enum(parloops_schedule_type) String(guided) Value(PARLOOPS_SCHEDULE_GUIDED)
+
+EnumValue
+Enum(parloops_schedule_type) String(auto) Value(PARLOOPS_SCHEDULE_AUTO)
+
+EnumValue
+Enum(parloops_schedule_type) String(runtime) Value(PARLOOPS_SCHEDULE_RUNTIME)
+
+-param=partial-inlining-entry-probability=
+Common Joined UInteger Var(param_partial_inlining_entry_probability) Init(70) IntegerRange(0, 100) Param
+Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen.
+
+-param=predictable-branch-outcome=
+Common Joined UInteger Var(param_predictable_branch_outcome) Init(2) IntegerRange(0, 50) Param
+Maximal estimated outcome of branch considered predictable.
+
+-param=prefetch-dynamic-strides=
+Common Joined UInteger Var(param_prefetch_dynamic_strides) Init(1) IntegerRange(0, 1) Param
+Whether software prefetch hints should be issued for non-constant strides.
+
+-param=prefetch-latency=
+Common Joined UInteger Var(param_prefetch_latency) Init(200) Param
+The number of insns executed before prefetch is completed.
+
+-param=prefetch-min-insn-to-mem-ratio=
+Common Joined UInteger Var(param_prefetch_min_insn_to_mem_ratio) Init(3) Param
+Min. ratio of insns to mem ops to enable prefetching in a loop.
+
+-param=prefetch-minimum-stride=
+Common Joined UInteger Var(param_prefetch_minimum_stride) Init(-1) Param
+The minimum constant stride beyond which we should use prefetch hints for.
+
+-param=profile-func-internal-id=
+Common Joined UInteger Var(param_profile_func_internal_id) IntegerRange(0, 1) Param
+Use internal function id in profile lookup.
+
+-param=rpo-vn-max-loop-depth=
+Common Joined UInteger Var(param_rpo_vn_max_loop_depth) Init(7) IntegerRange(2, 65536) Param
+Maximum depth of a loop nest to fully value-number optimistically.
+
+-param=sccvn-max-alias-queries-per-access=
+Common Joined UInteger Var(param_sccvn_max_alias_queries_per_access) Init(1000) Param
+Maximum number of disambiguations to perform per memory access.
+
+-param=scev-max-expr-complexity=
+Common Joined UInteger Var(param_scev_max_expr_complexity) Init(10) Param
+Bound on the complexity of the expressions in the scalar evolutions analyzer.
+
+-param=scev-max-expr-size=
+Common Joined UInteger Var(param_scev_max_expr_size) Init(100) Param
+Bound on size of expressions used in the scalar evolutions analyzer.
+
+-param=sched-autopref-queue-depth=
+Common Joined UInteger Var(param_sched_autopref_queue_depth) Init(-1) Param
+Hardware autoprefetcher scheduler model control flag. Number of lookahead cycles the model looks into, at '0' only enable instruction sorting heuristic. Disabled by default.
+
+-param=sched-mem-true-dep-cost=
+Common Joined UInteger Var(param_sched_mem_true_dep_cost) Init(1) Param
+Minimal distance between possibly conflicting store and load.
+
+-param=sched-pressure-algorithm=
+Common Joined UInteger Var(param_sched_pressure_algorithm) Init(1) IntegerRange(1, 2) Param
+Which -fsched-pressure algorithm to apply.
+
+-param=sched-spec-prob-cutoff=
+Common Joined UInteger Var(param_sched_spec_prob_cutoff) Init(40) IntegerRange(0, 100) Param
+The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.
+
+-param=sched-state-edge-prob-cutoff=
+Common Joined UInteger Var(param_sched_state_edge_prob_cutoff) Init(10) IntegerRange(0, 100) Param
+The minimum probability an edge must have for the scheduler to save its state across it.
+
+-param=selsched-insns-to-rename=
+Common Joined UInteger Var(param_selsched_insns_to_rename) Init(2) Param
+Maximum number of instructions in the ready list that are considered eligible for renaming.
+
+-param=selsched-max-lookahead=
+Common Joined UInteger Var(param_selsched_max_lookahead) Init(50) Param
+The maximum size of the lookahead window of selective scheduling.
+
+-param=selsched-max-sched-times=
+Common Joined UInteger Var(param_selsched_max_sched_times) Init(2) IntegerRange(1, 65536) Param
+Maximum number of times that an insn could be scheduled.
+
+-param=simultaneous-prefetches=
+Common Joined UInteger Var(param_simultaneous_prefetches) Init(3) Param
+The number of prefetches that can run at the same time.
+
+-param=sink-frequency-threshold=
+Common Joined UInteger Var(param_sink_frequency_threshold) Init(75) IntegerRange(0, 100) Param
+Target block's relative execution frequency (as a percentage) required to sink a statement.
+
+-param=slp-max-insns-in-bb=
+Common Joined UInteger Var(param_slp_max_insns_in_bb) Init(1000) Param
+Maximum number of instructions in basic block to be considered for SLP vectorization.
+
+-param=sms-dfa-history=
+Common Joined UInteger Var(param_sms_dfa_history) Param
+The number of cycles the swing modulo scheduler considers when checking conflicts using DFA.
+
+-param=sms-loop-average-count-threshold=
+Common Joined UInteger Var(param_sms_loop_average_count_threshold) Param
+A threshold on the average loop count considered by the swing modulo scheduler.
+
+-param=sms-max-ii-factor=
+Common Joined UInteger Var(param_sms_max_ii_factor) Init(100) Param
+A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop.
+
+-param=sms-min-sc=
+Common Joined UInteger Var(param_sms_min_sc) Init(2) IntegerRange(1, 65536) Param
+The minimum value of stage count that swing modulo scheduler will generate.
+
+-param=sra-max-scalarization-size-Osize=
+Common Joined UInteger Var(param_sra_max_scalarization_size_size) Param
+Maximum size, in storage units, of an aggregate which should be considered for scalarization when compiling for size.
+
+-param=sra-max-scalarization-size-Ospeed=
+Common Joined UInteger Var(param_sra_max_scalarization_size_speed) Param
+Maximum size, in storage units, of an aggregate which should be considered for scalarization when compiling for speed.
+
+-param=ssa-name-def-chain-limit=
+Common Joined UInteger Var(param_ssa_name_def_chain_limit) Init(512) Param
+The maximum number of SSA_NAME assignments to follow in determining a value.
+
+-param=ssp-buffer-size=
+Common Joined UInteger Var(param_ssp_buffer_size) Init(8) IntegerRange(1, 65536) Param
+The lower bound for a buffer to be considered for stack smashing protection.
+
+-param=stack-clash-protection-guard-size=
+Common Joined UInteger Var(param_stack_clash_protection_guard_size) Init(12) IntegerRange(12, 30) Param
+Size of the stack guard expressed as a power of two in bytes.
+
+-param=stack-clash-protection-probe-interval=
+Common Joined UInteger Var(param_stack_clash_protection_probe_interval) Init(12) IntegerRange(10, 16) Param
+Interval in which to probe the stack expressed as a power of two in bytes.
+
+-param=store-merging-allow-unaligned=
+Common Joined UInteger Var(param_store_merging_allow_unaligned) Init(1) IntegerRange(0, 1) Param
+Allow the store merging pass to introduce unaligned stores if it is legal to do so.
+
+-param=store-merging-max-size=
+Common Joined UInteger Var(param_store_merging_max_size) Init(65536) IntegerRange(1, 65536) Param
+Maximum size of a single store merging region in bytes.
+
+-param=switch-conversion-max-branch-ratio=
+Common Joined UInteger Var(param_switch_conversion_branch_ratio) Init(8) IntegerRange(1, 65536) Param
+The maximum ratio between array size and switch branches for a switch conversion to take place.
+
+-param=tm-max-aggregate-size=
+Common Joined UInteger Var(param_tm_max_aggregate_size) Init(9) Param
+Size in bytes after which thread-local aggregates should be instrumented with the logging functions instead of save/restore pairs.
+
+-param=tracer-dynamic-coverage=
+Common Joined UInteger Var(param_tracer_dynamic_coverage) Init(75) IntegerRange(0, 100) Param
+The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available.
+
+-param=tracer-dynamic-coverage-feedback=
+Common Joined UInteger Var(param_tracer_dynamic_coverage_feedback) Init(95) IntegerRange(0, 100) Param
+The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available.
+
+-param=tracer-max-code-growth=
+Common Joined UInteger Var(param_tracer_max_code_growth) Init(100) Param
+Maximal code growth caused by tail duplication (in percent).
+
+-param=tracer-min-branch-probability=
+Common Joined UInteger Var(param_tracer_min_branch_probability) Init(50) IntegerRange(0, 100) Param
+Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available.
+
+-param=tracer-min-branch-probability-feedback=
+Common Joined UInteger Var(param_tracer_min_branch_probability_feedback) Init(80) IntegerRange(0, 100) Param
+Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available.
+
+-param=tracer-min-branch-ratio=
+Common Joined UInteger Var(param_tracer_min_branch_ratio) Init(10) IntegerRange(0, 100) Param
+Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent).
+
+-param=tree-reassoc-width=
+Common Joined UInteger Var(param_tree_reassoc_width) Param
+Set the maximum number of instructions executed in parallel in reassociated tree. If 0, use the target dependent heuristic.
+
+-param=uninit-control-dep-attempts=
+Common Joined UInteger Var(param_uninit_control_dep_attempts) Init(1000) IntegerRange(1, 65536) Param
+Maximum number of nested calls to search for control dependencies during uninitialized variable analysis.
+
+-param=uninlined-function-insns=
+Common Joined UInteger Var(param_uninlined_function_insns) Init(2) IntegerRange(0, 1000000) Param
+Instruction accounted for function prologue, epilogue and other overhead.
+
+-param=uninlined-function-time=
+Common Joined UInteger Var(param_uninlined_function_time) IntegerRange(0, 1000000) Param
+Time accounted for function prologue, epilogue and other overhead.
+
+-param=uninlined-thunk-insns=
+Common Joined UInteger Var(param_uninlined_function_thunk_insns) Init(2) IntegerRange(0, 1000000) Param
+Instruction accounted for function thunk overhead.
+
+-param=uninlined-thunk-time=
+Common Joined UInteger Var(param_uninlined_function_thunk_time) Init(2) IntegerRange(0, 1000000) Param
+Time accounted for function thunk overhead.
+
+-param=unlikely-bb-count-fraction=
+Common Joined UInteger Var(param_unlikely_bb_count_fraction) Init(20) Param
+The denominator n of fraction 1/n of the number of profiled runs of the entire program below which the execution count of a basic block must be in order for the basic block to be considered unlikely.
+
+-param=unroll-jam-max-unroll=
+Common Joined UInteger Var(param_unroll_jam_max_unroll) Init(4) Param
+Maximum unroll factor for the unroll-and-jam transformation.
+
+-param=unroll-jam-min-percent=
+Common Joined UInteger Var(param_unroll_jam_min_percent) Init(1) IntegerRange(0, 100) Param
+Minimum percentage of memrefs that must go away for unroll-and-jam to be considered profitable.
+
+-param=use-after-scope-direct-emission-threshold=
+Common Joined UInteger Var(param_use_after_scope_direct_emission_threshold) Init(256) Param
+Use direct poisoning/unpoisoning instructions for variables smaller or equal to this number.
+
+-param=use-canonical-types=
+Common Joined UInteger Var(param_use_canonical_types) Init(1) IntegerRange(0, 1) Param
+Whether to use canonical types.
+
+-param=vect-epilogues-nomask=
+Common Joined UInteger Var(param_vect_epilogues_nomask) Init(1) IntegerRange(0, 1) Param
+Enable loop epilogue vectorization using smaller vector size.
+
+-param=vect-max-peeling-for-alignment=
+Common Joined UInteger Var(param_vect_max_peeling_for_alignment) Init(-1) IntegerRange(-1, 64) Param
+Maximum number of loop peels to enhance alignment of data references in a loop.
+
+-param=vect-max-version-for-alias-checks=
+Common Joined UInteger Var(param_vect_max_version_for_alias_checks) Init(10) Param
+Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check.
+
+-param=vect-max-version-for-alignment-checks=
+Common Joined UInteger Var(param_vect_max_version_for_alignment_checks) Init(6) Param
+Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check.
+
+; This comment is to ensure we retain the blank line above.
--
2.24.0
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 8/9] Remove option_default_params and option_validate_param hooks.
2019-11-12 9:22 ` [PATCH 8/9] Remove option_default_params and option_validate_param hooks Martin Liška
@ 2019-11-12 9:44 ` Richard Biener
0 siblings, 0 replies; 29+ messages in thread
From: Richard Biener @ 2019-11-12 9:44 UTC (permalink / raw)
To: Martin Liška; +Cc: GCC Patches
On Tue, Nov 12, 2019 at 10:21 AM Martin Liška <mliska@suse.cz> wrote:
>
> On 11/11/19 3:36 PM, Richard Biener wrote:
> > as a followup I notice that the targets *_default_params () functions should
> > be merged into the default-options structs they have (did you check the
> > defaults are still applied and user-overridable?)
>
> Apparently, the *_default_params target hook is not called right now. So that
> I decided to directly transform all usages of that to default-options structs.
> I built all the affected cross compilers and checked --help=param -Q, where
> I can see the overwritten default. Moreover, a param value can be properly
> adjusted with a user option.
>
> I'm running tests on x86_64-linux-gnu and ppc64-linux-gnu right now to check
> affect of the attached patch.
OK.
Thanks,
Richard.
>
> Martin
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 0/7] Param conversion to option machinery
2019-11-12 9:24 ` Martin Liška
@ 2019-11-12 9:45 ` Richard Biener
0 siblings, 0 replies; 29+ messages in thread
From: Richard Biener @ 2019-11-12 9:45 UTC (permalink / raw)
To: Martin Liška; +Cc: GCC Patches
On Tue, Nov 12, 2019 at 10:23 AM Martin Liška <mliska@suse.cz> wrote:
>
> On 11/11/19 3:42 PM, Richard Biener wrote:
> > I didn't go over them but maybe we can postpone this to a followup
> > and for now make_none_ of them Optimization which preserves
>
> Ok, there's updated patch w/o the Optimization keyword.
OK.
Richard.
> > previous behavior (I guess the optimize attribute/pragma doesn't
> > accept -param either at the moment).
>
> No, the syntax is not allowed.
>
> Martin
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 3/7] Apply mechanical replacement (generated patch).
2019-11-12 9:20 ` Martin Liška
@ 2019-11-12 9:52 ` Richard Biener
0 siblings, 0 replies; 29+ messages in thread
From: Richard Biener @ 2019-11-12 9:52 UTC (permalink / raw)
To: Martin Liška; +Cc: GCC Patches
On Tue, Nov 12, 2019 at 10:19 AM Martin Liška <mliska@suse.cz> wrote:
>
> On 11/11/19 3:36 PM, Richard Biener wrote:
> > I think I've noticed at least one long line (please double-check):
> >
> > - if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
> > INTEGER_SHARE_LIMIT)
> > + if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT)
> > param_integer_share_limit)
>
> You are right, they were quite some GNU coding style violations.
>
> I'm sending updated version of the patch where I fixed that.
OK.
Thanks,
Richard.
> Martin
>
> >
> > as a followup I notice that the targets *_default_params () functions should
> > be merged into the default-options structs they have (did you check the
> > defaults are still applied and user-overridable?)
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 5/7] Remove last leftover usage of params* files.
2019-11-07 12:33 ` [PATCH 5/7] Remove last leftover usage of params* files Martin Liska
@ 2019-11-12 15:45 ` Harwath, Frederik
2019-11-12 19:33 ` Martin Liška
0 siblings, 1 reply; 29+ messages in thread
From: Harwath, Frederik @ 2019-11-12 15:45 UTC (permalink / raw)
To: Martin Liska, gcc-patches
Hi Martin,
On 06.11.19 13:40, Martin Liska wrote:
> (finalize_options_struct): Remove.
This patch has been committed by now, but it seems that a single use of finalize_options_struct has been overlooked
in gcc/tree-streamer-in.c.
Best regards,
Frederik
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 5/7] Remove last leftover usage of params* files.
2019-11-12 15:45 ` Harwath, Frederik
@ 2019-11-12 19:33 ` Martin Liška
0 siblings, 0 replies; 29+ messages in thread
From: Martin Liška @ 2019-11-12 19:33 UTC (permalink / raw)
To: Harwath, Frederik, gcc-patches
On 11/12/19 4:39 PM, Harwath, Frederik wrote:
> Hi Martin,
>
> On 06.11.19 13:40, Martin Liska wrote:
>
>> (finalize_options_struct): Remove.
>
> This patch has been committed by now, but it seems that a single use of finalize_options_struct has been overlooked
> in gcc/tree-streamer-in.c.
Thank you for heads up. I'll fix it tomorrow.
Martin
>
> Best regards,
> Frederik
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 4/7] Remove gcc/params.* files.
2019-11-07 12:33 ` [PATCH 4/7] Remove gcc/params.* files Martin Liska
@ 2019-11-12 21:17 ` Rainer Orth
2019-11-13 8:44 ` Martin Liška
0 siblings, 1 reply; 29+ messages in thread
From: Rainer Orth @ 2019-11-12 21:17 UTC (permalink / raw)
To: Martin Liska; +Cc: gcc-patches
Hi Martin,
> gcc/ChangeLog:
>
> 2019-11-06 Martin Liska <mliska@suse.cz>
>
> * Makefile.in: Remove PARAMS_H and params.list
> and params.options.
this has obviously not been tested properly: it completely broke
gcc.dg/params/params.exp:
+ERROR: couldn't open "/var/gcc/regression/trunk/11.5-gcc/build/gcc/testsuite/gcc/../../params.options": no such file or directory
[...]
+ERROR: tcl error sourcing /vol/gcc/src/hg/trunk/local/gcc/testsuite/gcc.dg/para
ms/params.exp.
[...]
once for every instance of parallel testing.
Please fix and properly follow testing procedures in the future. Just
looking for FAILs is not enough: e.g. comparing mail-report.log before
and after the patch would have immediately shown this.
Rainer
--
-----------------------------------------------------------------------------
Rainer Orth, Center for Biotechnology, Bielefeld University
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 4/7] Remove gcc/params.* files.
2019-11-12 21:17 ` Rainer Orth
@ 2019-11-13 8:44 ` Martin Liška
2019-11-13 9:15 ` Rainer Orth
0 siblings, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-13 8:44 UTC (permalink / raw)
To: Rainer Orth; +Cc: gcc-patches
On 11/12/19 10:13 PM, Rainer Orth wrote:
> Hi Martin,
>
>> gcc/ChangeLog:
>>
>> 2019-11-06 Martin Liska <mliska@suse.cz>
>>
>> * Makefile.in: Remove PARAMS_H and params.list
>> and params.options.
>
> this has obviously not been tested properly: it completely broke
> gcc.dg/params/params.exp:
Hello.
Sorry for the breakage, I'm going to fix the issue soon.
>
> +ERROR: couldn't open "/var/gcc/regression/trunk/11.5-gcc/build/gcc/testsuite/gcc/../../params.options": no such file or directory
> [...]
> +ERROR: tcl error sourcing /vol/gcc/src/hg/trunk/local/gcc/testsuite/gcc.dg/para
> ms/params.exp.
> [...]
>
> once for every instance of parallel testing.
>
> Please fix and properly follow testing procedures in the future. Just
> looking for FAILs is not enough: e.g. comparing mail-report.log before
> and after the patch would have immediately shown this.
Note that the patch set was very huge and I had to test very many targets
at the same time. So that's why a fallout happened ;)
Martin
>
> Rainer
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 4/7] Remove gcc/params.* files.
2019-11-13 8:44 ` Martin Liška
@ 2019-11-13 9:15 ` Rainer Orth
0 siblings, 0 replies; 29+ messages in thread
From: Rainer Orth @ 2019-11-13 9:15 UTC (permalink / raw)
To: Martin Liška; +Cc: gcc-patches
Hi Martin,
>> Please fix and properly follow testing procedures in the future. Just
>> looking for FAILs is not enough: e.g. comparing mail-report.log before
>> and after the patch would have immediately shown this.
>
> Note that the patch set was very huge and I had to test very many targets
> at the same time. So that's why a fallout happened ;)
understood. However, this would have shown up on any target and it's
not the first time your testing missed non-FAIL regressions.
Rainer
--
-----------------------------------------------------------------------------
Rainer Orth, Center for Biotechnology, Bielefeld University
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-07 12:33 ` [PATCH 2/7] Include new generated gcc/params.opt file Martin Liska
@ 2019-11-20 14:51 ` David Malcolm
2019-11-20 14:53 ` Martin Liška
0 siblings, 1 reply; 29+ messages in thread
From: David Malcolm @ 2019-11-20 14:51 UTC (permalink / raw)
To: Martin Liska, gcc-patches
On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
> gcc/ChangeLog:
>
> 2019-11-06 Martin Liska <mliska@suse.cz>
>
> * Makefile.in: Include params.opt.
> * flag-types.h (enum parloops_schedule_type): Add
> parloops_schedule_type used in params.opt.
> * params.opt: New file.
> ---
> gcc/Makefile.in | 2 +-
> gcc/flag-types.h | 11 +
> gcc/params.opt | 967
> +++++++++++++++++++++++++++++++++++++++++++++++
> 3 files changed, 979 insertions(+), 1 deletion(-)
> create mode 100644 gcc/params.opt
Is your params.def -> params.opt script available somewhere? (sorry if
I missed it, I didn't see it looking over the patch kit)
(I'm rebasing my static analyzer patch kit and am about to convert my
params.def additions to be params.opt additions, though I'm only adding
4 params, so hopefully doing it by hand will be trivial)
Thanks
Dave
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-20 14:51 ` David Malcolm
@ 2019-11-20 14:53 ` Martin Liška
2019-11-20 15:03 ` David Malcolm
0 siblings, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-20 14:53 UTC (permalink / raw)
To: David Malcolm, gcc-patches
On 11/20/19 3:49 PM, David Malcolm wrote:
> On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
>> gcc/ChangeLog:
>>
>> 2019-11-06 Martin Liska <mliska@suse.cz>
>>
>> * Makefile.in: Include params.opt.
>> * flag-types.h (enum parloops_schedule_type): Add
>> parloops_schedule_type used in params.opt.
>> * params.opt: New file.
>> ---
>> gcc/Makefile.in | 2 +-
>> gcc/flag-types.h | 11 +
>> gcc/params.opt | 967
>> +++++++++++++++++++++++++++++++++++++++++++++++
>> 3 files changed, 979 insertions(+), 1 deletion(-)
>> create mode 100644 gcc/params.opt
>
> Is your params.def -> params.opt script available somewhere? (sorry if
> I missed it, I didn't see it looking over the patch kit)
Hi David.
>
> (I'm rebasing my static analyzer patch kit and am about to convert my
> params.def additions to be params.opt additions, though I'm only adding
> 4 params, so hopefully doing it by hand will be trivial)
No, it's not public. Please convert it by hand, it will be faster ;)
Martin
>
> Thanks
> Dave
>
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-20 14:53 ` Martin Liška
@ 2019-11-20 15:03 ` David Malcolm
2019-11-20 15:08 ` Martin Liška
0 siblings, 1 reply; 29+ messages in thread
From: David Malcolm @ 2019-11-20 15:03 UTC (permalink / raw)
To: Martin Liška, gcc-patches
On Wed, 2019-11-20 at 15:51 +0100, Martin Liška wrote:
> On 11/20/19 3:49 PM, David Malcolm wrote:
> > On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
> > > gcc/ChangeLog:
> > >
> > > 2019-11-06 Martin Liska <mliska@suse.cz>
> > >
> > > * Makefile.in: Include params.opt.
> > > * flag-types.h (enum parloops_schedule_type): Add
> > > parloops_schedule_type used in params.opt.
> > > * params.opt: New file.
> > > ---
> > > gcc/Makefile.in | 2 +-
> > > gcc/flag-types.h | 11 +
> > > gcc/params.opt | 967
> > > +++++++++++++++++++++++++++++++++++++++++++++++
> > > 3 files changed, 979 insertions(+), 1 deletion(-)
> > > create mode 100644 gcc/params.opt
> >
> > Is your params.def -> params.opt script available
> > somewhere? (sorry if
> > I missed it, I didn't see it looking over the patch kit)
>
> Hi David.
>
> > (I'm rebasing my static analyzer patch kit and am about to convert
> > my
> > params.def additions to be params.opt additions, though I'm only
> > adding
> > 4 params, so hopefully doing it by hand will be trivial)
>
> No, it's not public. Please convert it by hand, it will be faster ;)
Fair enough.
Does this new machinery mean we can have per-frontend params (by
putting the Param options in the pertinent .opt file) ? (not sure what
that will do to LTO)
Dave
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-20 15:03 ` David Malcolm
@ 2019-11-20 15:08 ` Martin Liška
2019-11-20 21:32 ` David Malcolm
0 siblings, 1 reply; 29+ messages in thread
From: Martin Liška @ 2019-11-20 15:08 UTC (permalink / raw)
To: David Malcolm, gcc-patches
On 11/20/19 4:02 PM, David Malcolm wrote:
> On Wed, 2019-11-20 at 15:51 +0100, Martin Liška wrote:
>> On 11/20/19 3:49 PM, David Malcolm wrote:
>>> On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
>>>> gcc/ChangeLog:
>>>>
>>>> 2019-11-06 Martin Liska <mliska@suse.cz>
>>>>
>>>> * Makefile.in: Include params.opt.
>>>> * flag-types.h (enum parloops_schedule_type): Add
>>>> parloops_schedule_type used in params.opt.
>>>> * params.opt: New file.
>>>> ---
>>>> gcc/Makefile.in | 2 +-
>>>> gcc/flag-types.h | 11 +
>>>> gcc/params.opt | 967
>>>> +++++++++++++++++++++++++++++++++++++++++++++++
>>>> 3 files changed, 979 insertions(+), 1 deletion(-)
>>>> create mode 100644 gcc/params.opt
>>>
>>> Is your params.def -> params.opt script available
>>> somewhere? (sorry if
>>> I missed it, I didn't see it looking over the patch kit)
>>
>> Hi David.
>>
>>> (I'm rebasing my static analyzer patch kit and am about to convert
>>> my
>>> params.def additions to be params.opt additions, though I'm only
>>> adding
>>> 4 params, so hopefully doing it by hand will be trivial)
>>
>> No, it's not public. Please convert it by hand, it will be faster ;)
>
> Fair enough.
>
> Does this new machinery mean we can have per-frontend params (by
> putting the Param options in the pertinent .opt file) ? (not sure what
> that will do to LTO)
I guess so. Note that now parameters are first class citizens same as options.
So that, having a per-FE should work fine.
Martin
>
> Dave
>
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-20 15:08 ` Martin Liška
@ 2019-11-20 21:32 ` David Malcolm
2019-11-21 13:05 ` Martin Liška
0 siblings, 1 reply; 29+ messages in thread
From: David Malcolm @ 2019-11-20 21:32 UTC (permalink / raw)
To: Martin Liška, gcc-patches
On Wed, 2019-11-20 at 16:07 +0100, Martin Liška wrote:
> On 11/20/19 4:02 PM, David Malcolm wrote:
> > On Wed, 2019-11-20 at 15:51 +0100, Martin Liška wrote:
> > > On 11/20/19 3:49 PM, David Malcolm wrote:
> > > > On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
> > > > > gcc/ChangeLog:
> > > > >
> > > > > 2019-11-06 Martin Liska <mliska@suse.cz>
> > > > >
> > > > > * Makefile.in: Include params.opt.
> > > > > * flag-types.h (enum parloops_schedule_type): Add
> > > > > parloops_schedule_type used in params.opt.
> > > > > * params.opt: New file.
> > > > > ---
> > > > > gcc/Makefile.in | 2 +-
> > > > > gcc/flag-types.h | 11 +
> > > > > gcc/params.opt | 967
> > > > > +++++++++++++++++++++++++++++++++++++++++++++++
> > > > > 3 files changed, 979 insertions(+), 1 deletion(-)
> > > > > create mode 100644 gcc/params.opt
> > > >
> > > > Is your params.def -> params.opt script available
> > > > somewhere? (sorry if
> > > > I missed it, I didn't see it looking over the patch kit)
> > >
> > > Hi David.
> > >
> > > > (I'm rebasing my static analyzer patch kit and am about to
> > > > convert
> > > > my
> > > > params.def additions to be params.opt additions, though I'm
> > > > only
> > > > adding
> > > > 4 params, so hopefully doing it by hand will be trivial)
> > >
> > > No, it's not public. Please convert it by hand, it will be faster
> > > ;)
> >
> > Fair enough.
> >
> > Does this new machinery mean we can have per-frontend params (by
> > putting the Param options in the pertinent .opt file) ? (not sure
> > what
> > that will do to LTO)
>
> I guess so. Note that now parameters are first class citizens same as
> options.
> So that, having a per-FE should work fine.
Thanks.
FWIW, given my branch adds support for in-tree plugins (which can add
options), I've added them to the plugin.opt file:
https://gcc.gnu.org/ml/gcc-patches/2019-11/msg02030.html
Dave
^ permalink raw reply [flat|nested] 29+ messages in thread
* Re: [PATCH 2/7] Include new generated gcc/params.opt file.
2019-11-20 21:32 ` David Malcolm
@ 2019-11-21 13:05 ` Martin Liška
0 siblings, 0 replies; 29+ messages in thread
From: Martin Liška @ 2019-11-21 13:05 UTC (permalink / raw)
To: David Malcolm, gcc-patches
On 11/20/19 10:12 PM, David Malcolm wrote:
> On Wed, 2019-11-20 at 16:07 +0100, Martin Liška wrote:
>> On 11/20/19 4:02 PM, David Malcolm wrote:
>>> On Wed, 2019-11-20 at 15:51 +0100, Martin Liška wrote:
>>>> On 11/20/19 3:49 PM, David Malcolm wrote:
>>>>> On Wed, 2019-11-06 at 11:30 +0100, Martin Liska wrote:
>>>>>> gcc/ChangeLog:
>>>>>>
>>>>>> 2019-11-06 Martin Liska <mliska@suse.cz>
>>>>>>
>>>>>> * Makefile.in: Include params.opt.
>>>>>> * flag-types.h (enum parloops_schedule_type): Add
>>>>>> parloops_schedule_type used in params.opt.
>>>>>> * params.opt: New file.
>>>>>> ---
>>>>>> gcc/Makefile.in | 2 +-
>>>>>> gcc/flag-types.h | 11 +
>>>>>> gcc/params.opt | 967
>>>>>> +++++++++++++++++++++++++++++++++++++++++++++++
>>>>>> 3 files changed, 979 insertions(+), 1 deletion(-)
>>>>>> create mode 100644 gcc/params.opt
>>>>>
>>>>> Is your params.def -> params.opt script available
>>>>> somewhere? (sorry if
>>>>> I missed it, I didn't see it looking over the patch kit)
>>>>
>>>> Hi David.
>>>>
>>>>> (I'm rebasing my static analyzer patch kit and am about to
>>>>> convert
>>>>> my
>>>>> params.def additions to be params.opt additions, though I'm
>>>>> only
>>>>> adding
>>>>> 4 params, so hopefully doing it by hand will be trivial)
>>>>
>>>> No, it's not public. Please convert it by hand, it will be faster
>>>> ;)
>>>
>>> Fair enough.
>>>
>>> Does this new machinery mean we can have per-frontend params (by
>>> putting the Param options in the pertinent .opt file) ? (not sure
>>> what
>>> that will do to LTO)
>>
>> I guess so. Note that now parameters are first class citizens same as
>> options.
>> So that, having a per-FE should work fine.
>
> Thanks.
>
> FWIW, given my branch adds support for in-tree plugins (which can add
> options), I've added them to the plugin.opt file:
Which seams reasonable to me! We already have a target-specific parameter
that lives in the corresponding target .opt file:
gcc/config/aarch64/aarch64.opt:-param=aarch64-sve-compare-costs=
Martin
>
> https://gcc.gnu.org/ml/gcc-patches/2019-11/msg02030.html
>
> Dave
>
^ permalink raw reply [flat|nested] 29+ messages in thread
end of thread, other threads:[~2019-11-21 12:32 UTC | newest]
Thread overview: 29+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2019-11-07 12:33 [PATCH 0/7] Param conversion to option machinery Martin Liska
2019-11-07 12:33 ` [PATCH 5/7] Remove last leftover usage of params* files Martin Liska
2019-11-12 15:45 ` Harwath, Frederik
2019-11-12 19:33 ` Martin Liška
2019-11-07 12:33 ` [PATCH 2/7] Include new generated gcc/params.opt file Martin Liska
2019-11-20 14:51 ` David Malcolm
2019-11-20 14:53 ` Martin Liška
2019-11-20 15:03 ` David Malcolm
2019-11-20 15:08 ` Martin Liška
2019-11-20 21:32 ` David Malcolm
2019-11-21 13:05 ` Martin Liška
2019-11-07 12:33 ` [PATCH 4/7] Remove gcc/params.* files Martin Liska
2019-11-12 21:17 ` Rainer Orth
2019-11-13 8:44 ` Martin Liška
2019-11-13 9:15 ` Rainer Orth
2019-11-07 12:33 ` [PATCH 6/7] Remove set_default_param_value from documentation Martin Liska
2019-11-07 12:33 ` [PATCH 1/7] Param to options conversion Martin Liska
2019-11-07 12:33 ` [PATCH 7/7] Fix test-suite fallout Martin Liska
2019-11-07 12:34 ` [PATCH 3/7] Apply mechanical replacement (generated patch) Martin Liska
2019-11-11 14:39 ` Richard Biener
2019-11-12 9:20 ` Martin Liška
2019-11-12 9:52 ` Richard Biener
2019-11-12 9:22 ` [PATCH 8/9] Remove option_default_params and option_validate_param hooks Martin Liška
2019-11-12 9:44 ` Richard Biener
2019-11-11 14:06 ` [PATCH] Use more SET_OPTION_IF_UNSET Martin Liška
2019-11-12 9:19 ` Richard Biener
2019-11-11 14:50 ` [PATCH 0/7] Param conversion to option machinery Richard Biener
2019-11-12 9:24 ` Martin Liška
2019-11-12 9:45 ` Richard Biener
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).