diff options
| author | Vladimir N. Makarov <vmakarov@redhat.com> | 2022-02-28 16:43:50 -0500 |
|---|---|---|
| committer | Vladimir N. Makarov <vmakarov@redhat.com> | 2022-02-28 16:44:57 -0500 |
| commit | ec1b9ba2d7913fe5e9deacc8e55e7539262f5124 (patch) | |
| tree | 10d05113e76081a88da4ae120a40c18314dd2873 /gcc/tree.h | |
| parent | 1027dc459204894f4503f713a3d73826e4bbab15 (diff) | |
| download | gcc-ec1b9ba2d7913fe5e9deacc8e55e7539262f5124.zip gcc-ec1b9ba2d7913fe5e9deacc8e55e7539262f5124.tar.gz gcc-ec1b9ba2d7913fe5e9deacc8e55e7539262f5124.tar.bz2 | |
[PR104637] LRA: Split hard regs as many as possible on one subpass
LRA hard reg split subpass is a small subpass used as the last
resort for LRA when it can not assign a hard reg to a reload
pseudo by other ways (e.g. by spilling non-reload pseudos). For
simplicity the subpass works on one split base (as each split
changes pseudo live range info). In this case it results in
reaching maximal possible number of subpasses. The patch
implements as many non-overlapping hard reg splits
splits as possible on each subpass.
gcc/ChangeLog:
PR rtl-optimization/104637
* lra-assigns.cc (lra_split_hard_reg_for): Split hard regs as many
as possible on one subpass.
gcc/testsuite/ChangeLog:
PR rtl-optimization/104637
* gcc.target/i386/pr104637.c: New.
Diffstat (limited to 'gcc/tree.h')
0 files changed, 0 insertions, 0 deletions