mirror of
https://gitlab.com/freepascal.org/fpc/source.git
synced 2025-11-04 04:22:07 +01:00
553 lines
23 KiB
ObjectPascal
553 lines
23 KiB
ObjectPascal
{
|
|
Copyright (c) 1998-2002 by Florian Klaempfl
|
|
|
|
Generate x86 assembler for in/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 nx86set;
|
|
|
|
{$i fpcdefs.inc}
|
|
|
|
interface
|
|
|
|
uses
|
|
globtype,
|
|
node,nset,pass_1,ncgset;
|
|
|
|
type
|
|
tx86innode = class(tinnode)
|
|
procedure pass_generate_code;override;
|
|
function pass_1 : tnode;override;
|
|
end;
|
|
|
|
tx86casenode = class(tcgcasenode)
|
|
function has_jumptable : boolean;override;
|
|
procedure genjumptable(hp : pcaselabel;min_,max_ : aint);override;
|
|
end;
|
|
|
|
implementation
|
|
|
|
uses
|
|
systems,constexp,
|
|
verbose,globals,
|
|
symconst,symdef,defutil,
|
|
aasmbase,aasmtai,aasmdata,aasmcpu,
|
|
cgbase,pass_2,tgobj,
|
|
ncon,
|
|
cpubase,
|
|
cga,cgobj,cgutils,ncgutil,
|
|
cgx86,
|
|
procinfo;
|
|
|
|
{*****************************************************************************
|
|
TX86INNODE
|
|
*****************************************************************************}
|
|
|
|
function tx86innode.pass_1 : tnode;
|
|
begin
|
|
result:=nil;
|
|
{ this is the only difference from the generic version }
|
|
expectloc:=LOC_FLAGS;
|
|
|
|
firstpass(right);
|
|
firstpass(left);
|
|
if codegenerror then
|
|
exit;
|
|
end;
|
|
|
|
|
|
function tx86casenode.has_jumptable : boolean;
|
|
begin
|
|
has_jumptable:=true;
|
|
end;
|
|
|
|
|
|
procedure tx86casenode.genjumptable(hp : pcaselabel;min_,max_ : aint);
|
|
var
|
|
table : tasmlabel;
|
|
last : TConstExprInt;
|
|
indexreg : tregister;
|
|
href : treference;
|
|
jtlist: tasmlist;
|
|
sectype: TAsmSectiontype;
|
|
|
|
procedure genitem(list:TAsmList;t : pcaselabel);
|
|
var
|
|
i : aint;
|
|
begin
|
|
if assigned(t^.less) then
|
|
genitem(list,t^.less);
|
|
{ fill possible hole }
|
|
i:=last.svalue+1;
|
|
while i<=t^._low.svalue-1 do
|
|
begin
|
|
list.concat(Tai_const.Create_sym(elselabel));
|
|
inc(i);
|
|
end;
|
|
i:=t^._low.svalue;
|
|
while i<=t^._high.svalue do
|
|
begin
|
|
list.concat(Tai_const.Create_sym(blocklabel(t^.blockid)));
|
|
inc(i);
|
|
end;
|
|
last:=t^._high;
|
|
if assigned(t^.greater) then
|
|
genitem(list,t^.greater);
|
|
end;
|
|
|
|
begin
|
|
last:=min_;
|
|
if not(jumptable_no_range) then
|
|
begin
|
|
{ a <= x <= b <-> unsigned(x-a) <= (b-a) }
|
|
cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opsize,aint(min_),hregister);
|
|
{ case expr greater than max_ => goto elselabel }
|
|
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_A,aint(max_)-aint(min_),hregister,elselabel);
|
|
min_:=0;
|
|
end;
|
|
current_asmdata.getjumplabel(table);
|
|
{ make it a 32bit register }
|
|
indexreg:=cg.makeregsize(current_asmdata.CurrAsmList,hregister,OS_INT);
|
|
cg.a_load_reg_reg(current_asmdata.CurrAsmList,opsize,OS_INT,hregister,indexreg);
|
|
{ create reference }
|
|
reference_reset_symbol(href,table,0);
|
|
href.offset:=(-aint(min_))*sizeof(aint);
|
|
href.index:=indexreg;
|
|
href.scalefactor:=sizeof(aint);
|
|
emit_ref(A_JMP,S_NO,href);
|
|
{ generate jump table }
|
|
if (target_info.system = system_i386_darwin) then
|
|
begin
|
|
jtlist:=current_asmdata.asmlists[al_const];
|
|
sectype:=sec_rodata;
|
|
end
|
|
else
|
|
begin
|
|
jtlist:=current_procinfo.aktlocaldata;
|
|
sectype:=sec_data;
|
|
end;
|
|
new_section(jtlist,sectype,current_procinfo.procdef.mangledname,sizeof(aint));
|
|
jtlist.concat(Tai_label.Create(table));
|
|
genitem(jtlist,hp);
|
|
end;
|
|
|
|
|
|
procedure tx86innode.pass_generate_code;
|
|
type
|
|
Tsetpart=record
|
|
range : boolean; {Part is a range.}
|
|
start,stop : byte; {Start/stop when range; Stop=element when an element.}
|
|
end;
|
|
var
|
|
hreg,hreg2,
|
|
pleftreg : tregister;
|
|
opsize : tcgsize;
|
|
orgopsize : tcgsize;
|
|
setparts : array[1..8] of Tsetpart;
|
|
setbase : aint;
|
|
adjustment : longint;
|
|
l,l2 : tasmlabel;
|
|
i,numparts : byte;
|
|
genjumps,
|
|
use_small,
|
|
ranges : boolean;
|
|
{$ifdef CORRECT_SET_IN_FPC}
|
|
AM : tasmop;
|
|
{$endif CORRECT_SET_IN_FPC}
|
|
|
|
function analizeset(Aset:pconstset;is_small:boolean):boolean;
|
|
var
|
|
compares,maxcompares:word;
|
|
i:byte;
|
|
begin
|
|
if tnormalset(Aset^)=[] then
|
|
{The expression...
|
|
if expr in []
|
|
...is allways false. It should be optimized away in the
|
|
resultdef pass, and thus never occur here. Since we
|
|
do generate wrong code for it, do internalerror.}
|
|
internalerror(2002072301);
|
|
analizeset:=false;
|
|
ranges:=false;
|
|
numparts:=0;
|
|
compares:=0;
|
|
{ Lots of comparisions take a lot of time, so do not allow
|
|
too much comparisions. 8 comparisions are, however, still
|
|
smalller than emitting the set }
|
|
if cs_opt_size in current_settings.optimizerswitches then
|
|
maxcompares:=8
|
|
else
|
|
maxcompares:=5;
|
|
{ when smallset is possible allow only 3 compares the smallset
|
|
code is for littlesize also smaller when more compares are used }
|
|
if is_small then
|
|
maxcompares:=3;
|
|
for i:=0 to 255 do
|
|
if i in tnormalset(Aset^) then
|
|
begin
|
|
if (numparts=0) or (i<>setparts[numparts].stop+1) then
|
|
begin
|
|
{Set element is a separate element.}
|
|
inc(compares);
|
|
if compares>maxcompares then
|
|
exit;
|
|
inc(numparts);
|
|
setparts[numparts].range:=false;
|
|
setparts[numparts].stop:=i;
|
|
end
|
|
else
|
|
{Set element is part of a range.}
|
|
if not setparts[numparts].range then
|
|
begin
|
|
{Transform an element into a range.}
|
|
setparts[numparts].range:=true;
|
|
setparts[numparts].start:=setparts[numparts].stop;
|
|
setparts[numparts].stop:=i;
|
|
ranges := true;
|
|
end
|
|
else
|
|
begin
|
|
{Extend a range.}
|
|
setparts[numparts].stop:=i;
|
|
end;
|
|
end;
|
|
analizeset:=true;
|
|
end;
|
|
|
|
begin
|
|
{ We check first if we can generate jumps, this can be done
|
|
because the resultdef is already set in firstpass }
|
|
|
|
{ check if we can use smallset operation using btl which is limited
|
|
to 32 bits, the left side may also not contain higher values or be signed !! }
|
|
use_small:=is_smallset(right.resultdef) and
|
|
not is_signed(left.resultdef) and
|
|
((left.resultdef.typ=orddef) and (torddef(left.resultdef).high.svalue<32) or
|
|
(left.resultdef.typ=enumdef) and (tenumdef(left.resultdef).max<32));
|
|
|
|
{ Can we generate jumps? Possible for all types of sets }
|
|
genjumps:=(right.nodetype=setconstn) and
|
|
analizeset(tsetconstnode(right).value_set,use_small);
|
|
{ calculate both operators }
|
|
{ the complex one first }
|
|
{ not in case of genjumps, because then we don't secondpass }
|
|
{ right at all (so we have to make sure that "right" really is }
|
|
{ "right" and not "swapped left" in that case) }
|
|
if not(genjumps) then
|
|
firstcomplex(self);
|
|
secondpass(left);
|
|
{ Only process the right if we are not generating jumps }
|
|
if not genjumps then
|
|
begin
|
|
secondpass(right);
|
|
end;
|
|
if codegenerror then
|
|
exit;
|
|
|
|
{ ofcourse not commutative }
|
|
if nf_swapped in flags then
|
|
swapleftright;
|
|
|
|
orgopsize := def_cgsize(left.resultdef);
|
|
opsize := OS_32;
|
|
if is_signed(left.resultdef) then
|
|
opsize := tcgsize(ord(opsize)+(ord(OS_S8)-ord(OS_8)));
|
|
|
|
if not(left.location.loc in [LOC_REGISTER,LOC_CREGISTER,LOC_REFERENCE,LOC_CREFERENCE,LOC_CONSTANT]) then
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
|
|
if (right.location.loc in [LOC_SUBSETREG,LOC_CSUBSETREG]) then
|
|
location_force_reg(current_asmdata.CurrAsmList,right.location,opsize,true);
|
|
|
|
if genjumps then
|
|
begin
|
|
{ It gives us advantage to check for the set elements
|
|
separately instead of using the SET_IN_BYTE procedure.
|
|
To do: Build in support for LOC_JUMP }
|
|
|
|
{ load and zero or sign extend as necessary }
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
|
|
pleftreg:=left.location.register;
|
|
|
|
{ Get a label to jump to the end }
|
|
location_reset(location,LOC_FLAGS,OS_NO);
|
|
|
|
{ It's better to use the zero flag when there are
|
|
no ranges }
|
|
if ranges then
|
|
location.resflags:=F_C
|
|
else
|
|
location.resflags:=F_E;
|
|
|
|
current_asmdata.getjumplabel(l);
|
|
|
|
{ how much have we already substracted from the x in the }
|
|
{ "x in [y..z]" expression }
|
|
adjustment := 0;
|
|
|
|
for i:=1 to numparts do
|
|
if setparts[i].range then
|
|
{ use fact that a <= x <= b <=> cardinal(x-a) <= cardinal(b-a) }
|
|
begin
|
|
{ is the range different from all legal values? }
|
|
if (setparts[i].stop-setparts[i].start <> 255) or not (orgopsize = OS_8) then
|
|
begin
|
|
{ yes, is the lower bound <> 0? }
|
|
if (setparts[i].start <> 0) then
|
|
begin
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
|
|
hreg:=left.location.register;
|
|
pleftreg:=hreg;
|
|
cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opsize,setparts[i].start-adjustment,pleftreg);
|
|
end;
|
|
|
|
{ new total value substracted from x: }
|
|
{ adjustment + (setparts[i].start - adjustment) }
|
|
adjustment := setparts[i].start;
|
|
|
|
{ check if result < b-a+1 (not "result <= b-a", since }
|
|
{ we need a carry in case the element is in the range }
|
|
{ (this will never overflow since we check at the }
|
|
{ beginning whether stop-start <> 255) }
|
|
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_B,setparts[i].stop-setparts[i].start+1,pleftreg,l);
|
|
end
|
|
else
|
|
{ if setparts[i].start = 0 and setparts[i].stop = 255, }
|
|
{ it's always true since "in" is only allowed for bytes }
|
|
begin
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
|
|
cg.a_jmp_always(current_asmdata.CurrAsmList,l);
|
|
end;
|
|
end
|
|
else
|
|
begin
|
|
{ Emit code to check if left is an element }
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,TCGSize2OpSize[opsize],setparts[i].stop-adjustment,
|
|
pleftreg));
|
|
{ Result should be in carry flag when ranges are used }
|
|
if ranges then
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
|
|
{ If found, jump to end }
|
|
cg.a_jmp_flags(current_asmdata.CurrAsmList,F_E,l);
|
|
end;
|
|
if ranges and
|
|
{ if the last one was a range, the carry flag is already }
|
|
{ set appropriately }
|
|
not(setparts[numparts].range) then
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
|
|
{ To compensate for not doing a second pass }
|
|
right.location.reference.symbol:=nil;
|
|
{ Now place the end label }
|
|
cg.a_label(current_asmdata.CurrAsmList,l);
|
|
end
|
|
else
|
|
begin
|
|
location_reset(location,LOC_FLAGS,OS_NO);
|
|
setbase:=tsetdef(right.resultdef).setbase;
|
|
|
|
{ We will now generated code to check the set itself, no jmps,
|
|
handle smallsets separate, because it allows faster checks }
|
|
if use_small then
|
|
begin
|
|
if left.location.loc=LOC_CONSTANT then
|
|
begin
|
|
location.resflags:=F_NE;
|
|
case right.location.loc of
|
|
LOC_REGISTER,
|
|
LOC_CREGISTER:
|
|
begin
|
|
emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],
|
|
1 shl ((left.location.value-setbase) and 31),right.location.register);
|
|
end;
|
|
LOC_REFERENCE,
|
|
LOC_CREFERENCE :
|
|
begin
|
|
emit_const_ref(A_TEST,TCGSize2OpSize[right.location.size],1 shl ((left.location.value-setbase) and 31),
|
|
right.location.reference);
|
|
end;
|
|
else
|
|
internalerror(200203312);
|
|
end;
|
|
end
|
|
else
|
|
begin
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,OS_32,true);
|
|
register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
|
|
if (tcgsize2size[right.location.size] < 4) or
|
|
(right.location.loc = LOC_CONSTANT) then
|
|
location_force_reg(current_asmdata.CurrAsmList,right.location,OS_32,true);
|
|
hreg:=left.location.register;
|
|
|
|
case right.location.loc of
|
|
LOC_REGISTER,
|
|
LOC_CREGISTER :
|
|
begin
|
|
emit_reg_reg(A_BT,S_L,hreg,right.location.register);
|
|
end;
|
|
LOC_CREFERENCE,
|
|
LOC_REFERENCE :
|
|
begin
|
|
emit_reg_ref(A_BT,S_L,hreg,right.location.reference);
|
|
end;
|
|
else
|
|
internalerror(2002032210);
|
|
end;
|
|
location.resflags:=F_C;
|
|
end;
|
|
end
|
|
else
|
|
begin
|
|
if right.location.loc=LOC_CONSTANT then
|
|
begin
|
|
location.resflags:=F_C;
|
|
current_asmdata.getjumplabel(l);
|
|
current_asmdata.getjumplabel(l2);
|
|
|
|
{ load constants to a register }
|
|
if (left.location.loc=LOC_CONSTANT) or
|
|
(setbase<>0) then
|
|
begin
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
|
|
register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
|
|
end;
|
|
|
|
case left.location.loc of
|
|
LOC_REGISTER,
|
|
LOC_CREGISTER:
|
|
begin
|
|
hreg:=cg.makeregsize(current_asmdata.CurrAsmList,left.location.register,opsize);
|
|
cg.a_load_reg_reg(current_asmdata.CurrAsmList,left.location.size,opsize,left.location.register,hreg);
|
|
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,31,hreg,l);
|
|
{ reset carry flag }
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
|
|
cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
|
|
cg.a_label(current_asmdata.CurrAsmList,l);
|
|
{ We have to load the value into a register because
|
|
btl does not accept values only refs or regs (PFV) }
|
|
hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
|
|
cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
|
|
emit_reg_reg(A_BT,S_L,hreg,hreg2);
|
|
end;
|
|
else
|
|
begin
|
|
emit_const_ref(A_CMP,TCGSize2OpSize[orgopsize],31,left.location.reference);
|
|
cg.a_jmp_flags(current_asmdata.CurrAsmList,F_BE,l);
|
|
{ reset carry flag }
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
|
|
cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
|
|
cg.a_label(current_asmdata.CurrAsmList,l);
|
|
hreg:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
|
|
cg.a_load_ref_reg(current_asmdata.CurrAsmList,OS_32,OS_32,left.location.reference,hreg);
|
|
{ We have to load the value into a register because
|
|
btl does not accept values only refs or regs (PFV) }
|
|
hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
|
|
cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
|
|
emit_reg_reg(A_BT,S_L,hreg,hreg2);
|
|
end;
|
|
end;
|
|
cg.a_label(current_asmdata.CurrAsmList,l2);
|
|
end { of right.location.loc=LOC_CONSTANT }
|
|
{ do search in a normal set which could have >32 elementsm
|
|
but also used if the left side contains values > 32 or < 0 }
|
|
else if left.location.loc=LOC_CONSTANT then
|
|
begin
|
|
if (left.location.value<setbase) or (((left.location.value-setbase) shr 3) >= right.resultdef.size) then
|
|
{should be caught earlier }
|
|
internalerror(2007020201);
|
|
|
|
location.resflags:=F_NE;
|
|
case right.location.loc of
|
|
LOC_REFERENCE,LOC_CREFERENCE:
|
|
begin
|
|
inc(right.location.reference.offset,(left.location.value-setbase) shr 3);
|
|
emit_const_ref(A_TEST,S_B,1 shl (left.location.value and 7),right.location.reference);
|
|
end;
|
|
LOC_REGISTER,LOC_CREGISTER:
|
|
begin
|
|
emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],1 shl (left.location.value-setbase),right.location.register);
|
|
end;
|
|
else
|
|
internalerror(2007051901);
|
|
end;
|
|
end
|
|
else
|
|
begin
|
|
location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
|
|
register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
|
|
pleftreg:=left.location.register;
|
|
|
|
if (opsize >= OS_S8) or { = if signed }
|
|
((left.resultdef.typ=orddef) and
|
|
((torddef(left.resultdef).low < int64(tsetdef(right.resultdef).setbase)) or
|
|
(torddef(left.resultdef).high > int64(tsetdef(right.resultdef).setmax)))) or
|
|
((left.resultdef.typ=enumdef) and
|
|
((tenumdef(left.resultdef).min < aint(tsetdef(right.resultdef).setbase)) or
|
|
(tenumdef(left.resultdef).max > aint(tsetdef(right.resultdef).setmax)))) then
|
|
begin
|
|
|
|
{ we have to check if the value is < 0 or > setmax }
|
|
|
|
current_asmdata.getjumplabel(l);
|
|
current_asmdata.getjumplabel(l2);
|
|
|
|
{ BE will be false for negative values }
|
|
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,tsetdef(right.resultdef).setmax-tsetdef(right.resultdef).setbase,pleftreg,l);
|
|
{ reset carry flag }
|
|
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
|
|
cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
|
|
|
|
cg.a_label(current_asmdata.CurrAsmList,l);
|
|
|
|
pleftreg:=left.location.register;
|
|
case right.location.loc of
|
|
LOC_REGISTER, LOC_CREGISTER :
|
|
emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
|
|
LOC_CREFERENCE, LOC_REFERENCE :
|
|
emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
|
|
else
|
|
internalerror(2007020301);
|
|
end;
|
|
|
|
cg.a_label(current_asmdata.CurrAsmList,l2);
|
|
|
|
location.resflags:=F_C;
|
|
|
|
end
|
|
else
|
|
begin
|
|
case right.location.loc of
|
|
LOC_REGISTER, LOC_CREGISTER :
|
|
emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
|
|
LOC_CREFERENCE, LOC_REFERENCE :
|
|
emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
|
|
else
|
|
internalerror(2007020302);
|
|
end;
|
|
location.resflags:=F_C;
|
|
end;
|
|
end;
|
|
end;
|
|
end;
|
|
if not genjumps then
|
|
location_freetemp(current_asmdata.CurrAsmList,right.location);
|
|
end;
|
|
|
|
begin
|
|
cinnode:=tx86innode;
|
|
ccasenode:=tx86casenode;
|
|
end.
|