* simplify and optimize generated LLVM code for case statements

git-svn-id: trunk@42305 -
This commit is contained in:
Jonas Maebe 2019-06-29 12:17:49 +00:00
parent 982a870b15
commit c425c51963
3 changed files with 55 additions and 1 deletions

1
.gitattributes vendored
View File

@ -363,6 +363,7 @@ compiler/llvm/nllvminl.pas svneol=native#text/plain
compiler/llvm/nllvmld.pas svneol=native#text/plain
compiler/llvm/nllvmmat.pas svneol=native#text/plain
compiler/llvm/nllvmmem.pas svneol=native#text/plain
compiler/llvm/nllvmset.pas svneol=native#text/plain
compiler/llvm/nllvmtcon.pas svneol=native#text/plain
compiler/llvm/nllvmutil.pas svneol=native#text/plain
compiler/llvm/rgllvm.pas svneol=native#text/plain

View File

@ -38,7 +38,7 @@ implementation
ncgadd,ncgcal,ncgmat,ncginl,
tgllvm,hlcgllvm,
nllvmadd,nllvmbas,nllvmcal,nllvmcnv,nllvmcon,nllvmflw,nllvminl,nllvmld,
nllvmmat,nllvmmem,nllvmtcon,nllvmutil,
nllvmmat,nllvmmem,nllvmset,nllvmtcon,nllvmutil,
llvmpara,llvmpi,
symllvm,
llvmcfi;

View File

@ -0,0 +1,53 @@
{
Copyright (c) 2019 by Jonas Maebe
Generate LLVM bytecode for set/case nodes
This program 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 2 of the License, or
(at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit nllvmset;
{$i fpcdefs.inc}
interface
uses
nset, ncgset;
type
tllvmcasenode = class(tcgcasenode)
protected
procedure genlinearlist(hp: pcaselabel); override;
end;
implementation
procedure tllvmcasenode.genlinearlist(hp: pcaselabel);
begin
{ genlinearlist constantly updates the case value in the register,
which causes tons of spilling with LLVM due to the need to bring
it back into SSA form. LLVM will recognise and optimise the linear
cmp list just as well (or even better), while the code that FPC
has to generate is much smaller (no spilling) }
genlinearcmplist(hp);
end;
begin
ccasenode:=tllvmcasenode;
end.