paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-09-29 09:59:19 +02:00
Code Issues Packages Projects Releases Wiki Activity

+ more rlwinm optimizations

Browse Source 
git-svn-id: trunk@3823 -
This commit is contained in:
Jonas Maebe 2006-06-08 09:48:08 +00:00
parent 4cbb626991
commit bc96cd8008
1 changed files with 40 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

68
compiler/powerpc/aoptcpu.pas
View File

@ -170,7 +170,7 @@ const
function TCpuAsmOptimizer.PeepHoleOptPass1Cpu(var p: tai): boolean; function TCpuAsmOptimizer.PeepHoleOptPass1Cpu(var p: tai): boolean;
var var
next1, next2: tai; next1, next2: tai;
l1, l2: longint; l1, l2, shlcount: longint;
begin begin
result := false; result := false;
case p.typ of case p.typ of
@ -221,17 +221,14 @@ const
(taicpu(next1).oper[0]^.reg = taicpu(p).oper[0]^.reg) and (taicpu(next1).oper[0]^.reg = taicpu(p).oper[0]^.reg) and
(taicpu(next1).oper[1]^.reg = taicpu(p).oper[0]^.reg) then (taicpu(next1).oper[1]^.reg = taicpu(p).oper[0]^.reg) then
begin begin
if (taicpu(next1).oper[2]^.val = 0) then { convert slwi to rlwinm and see if the rlwinm }
begin { optimization can do something with it }
{ convert slwi to rlwinm and see if the rlwinm } taicpu(p).opcode := A_RLWINM;
{ optimization can do something with it } taicpu(p).ops := 5;
taicpu(p).opcode := A_RLWINM; taicpu(p).loadconst(2,taicpu(p).oper[2]^.val);
taicpu(p).ops := 5; taicpu(p).loadconst(3,0);
taicpu(p).loadconst(2,taicpu(p).oper[2]^.val); taicpu(p).loadconst(4,31-taicpu(p).oper[2]^.val);
taicpu(p).loadconst(3,0); result := true;
taicpu(p).loadconst(4,31-taicpu(p).oper[2]^.val);
result := true;
end;
end; end;
end; end;
A_SRWI: A_SRWI:
@ -265,17 +262,14 @@ const
end; end;
A_RLWINM: A_RLWINM:
begin begin
if (taicpu(next1).oper[2]^.val = 0) then { convert srwi to rlwinm and see if the rlwinm }
begin { optimization can do something with it }
{ convert srwi to rlwinm and see if the rlwinm } taicpu(p).opcode := A_RLWINM;
{ optimization can do something with it } taicpu(p).ops := 5;
taicpu(p).opcode := A_RLWINM; taicpu(p).loadconst(3,taicpu(p).oper[2]^.val);
taicpu(p).ops := 5; taicpu(p).loadconst(4,31);
taicpu(p).loadconst(3,taicpu(p).oper[2]^.val); taicpu(p).loadconst(2,(32-taicpu(p).oper[2]^.val) and 31);
taicpu(p).loadconst(4,31); result := true;
taicpu(p).loadconst(2,(32-taicpu(p).oper[2]^.val) and 31);
result := true;
end;
end; end;
end; end;
end; end;
@ -283,18 +277,36 @@ const
begin begin
if getnextinstruction(p,next1) and if getnextinstruction(p,next1) and
(next1.typ = ait_instruction) and (next1.typ = ait_instruction) and
(taicpu(next1).opcode = A_RLWINM) and ((taicpu(next1).opcode = A_RLWINM) or
(taicpu(next1).opcode = A_SRWI) or
(taicpu(next1).opcode = A_SLWI)) and
(taicpu(next1).oper[0]^.reg = taicpu(p).oper[0]^.reg) and (taicpu(next1).oper[0]^.reg = taicpu(p).oper[0]^.reg) and
// both source and target of next1 must equal target of p // both source and target of next1 must equal target of p
(taicpu(next1).oper[1]^.reg = taicpu(p).oper[0]^.reg) then (taicpu(next1).oper[1]^.reg = taicpu(p).oper[0]^.reg) then
begin begin
l1 := rlwinm2mask((taicpu(p).oper[3]^.val-taicpu(next1).oper[2]^.val) and 31,(taicpu(p).oper[4]^.val-taicpu(next1).oper[2]^.val) and 31); case taicpu(next1).opcode of
l2 := rlwinm2mask(taicpu(next1).oper[3]^.val,taicpu(next1).oper[4]^.val); A_RLWINM:
begin
shlcount := taicpu(next1).oper[2]^.val;
l2 := rlwinm2mask(taicpu(next1).oper[3]^.val,taicpu(next1).oper[4]^.val);
end;
A_SLWI:
begin
shlcount := taicpu(next1).oper[2]^.val;
l2 := (-1) shl shlcount;
end;
A_SRWI:
begin
shlcount := 32-taicpu(next1).oper[2]^.val;
l2 := (-1) shr taicpu(next1).oper[2]^.val;
end;
end;
l1 := rlwinm2mask((taicpu(p).oper[3]^.val-shlcount) and 31,(taicpu(p).oper[4]^.val-shlcount) and 31);
l1 := l1 and l2; l1 := l1 and l2;
case l1 of case l1 of
-1: -1:
begin begin
taicpu(p).oper[2]^.val := (taicpu(p).oper[2]^.val + taicpu(next1).oper[2]^.val) and 31; taicpu(p).oper[2]^.val := (taicpu(p).oper[2]^.val + shlcount) and 31;
asml.remove(next1); asml.remove(next1);
next1.free; next1.free;
if (taicpu(p).oper[2]^.val = 0) then if (taicpu(p).oper[2]^.val = 0) then
@ -322,7 +334,7 @@ const
end end
else if tcgppc(cg).get_rlwi_const(l1,l1,l2) then else if tcgppc(cg).get_rlwi_const(l1,l1,l2) then
begin begin
taicpu(p).oper[2]^.val := (taicpu(p).oper[2]^.val + taicpu(next1).oper[2]^.val) and 31; taicpu(p).oper[2]^.val := (taicpu(p).oper[2]^.val + shlcount) and 31;
taicpu(p).oper[3]^.val := l1; taicpu(p).oper[3]^.val := l1;
taicpu(p).oper[4]^.val := l2; taicpu(p).oper[4]^.val := l2;
asml.remove(next1); asml.remove(next1);