123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523 |
- {
- $Id$
- Copyright (c) 1993-98 by Florian Klaempfl
- Type checking and register allocation for math 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 tcmat;
- interface
- uses
- tree;
- procedure firstmoddiv(var p : ptree);
- procedure firstshlshr(var p : ptree);
- procedure firstunaryminus(var p : ptree);
- procedure firstnot(var p : ptree);
- implementation
- uses
- globtype,systems,tokens,
- cobjects,verbose,globals,
- symconst,symtable,aasm,types,
- hcodegen,htypechk,pass_1,cpubase,
- { for isbinaryoverloaded function }
- tcadd;
- {*****************************************************************************
- FirstModDiv
- *****************************************************************************}
- procedure firstmoddiv(var p : ptree);
- var
- t : ptree;
- rv,lv : longint;
- rd,ld : pdef;
- begin
- firstpass(p^.left);
- set_varstate(p^.left,true);
- firstpass(p^.right);
- set_varstate(p^.right,true);
- if codegenerror then
- exit;
- if isbinaryoverloaded(p) then
- exit;
- { check for division by zero }
- rv:=p^.right^.value;
- lv:=p^.left^.value;
- if is_constintnode(p^.right) and (rv=0) then
- begin
- Message(parser_e_division_by_zero);
- { recover }
- rv:=1;
- end;
- if is_constintnode(p^.left) and is_constintnode(p^.right) then
- begin
- case p^.treetype of
- modn : t:=genordinalconstnode(lv mod rv,s32bitdef);
- divn : t:=genordinalconstnode(lv div rv,s32bitdef);
- end;
- disposetree(p);
- firstpass(t);
- p:=t;
- exit;
- end;
- if (p^.left^.resulttype^.deftype=orddef) and (p^.right^.resulttype^.deftype=orddef) and
- (is_64bitint(p^.left^.resulttype) or is_64bitint(p^.right^.resulttype)) then
- begin
- rd:=p^.right^.resulttype;
- ld:=p^.left^.resulttype;
- if (porddef(rd)^.typ=s64bit) or (porddef(ld)^.typ=s64bit) then
- begin
- if (porddef(ld)^.typ<>s64bit) then
- begin
- p^.left:=gentypeconvnode(p^.left,cs64bitdef);
- firstpass(p^.left);
- end;
- if (porddef(rd)^.typ<>s64bit) then
- begin
- p^.right:=gentypeconvnode(p^.right,cs64bitdef);
- firstpass(p^.right);
- end;
- calcregisters(p,2,0,0);
- end
- else if (porddef(rd)^.typ=u64bit) or (porddef(ld)^.typ=u64bit) then
- begin
- if (porddef(ld)^.typ<>u64bit) then
- begin
- p^.left:=gentypeconvnode(p^.left,cu64bitdef);
- firstpass(p^.left);
- end;
- if (porddef(rd)^.typ<>u64bit) then
- begin
- p^.right:=gentypeconvnode(p^.right,cu64bitdef);
- firstpass(p^.right);
- end;
- calcregisters(p,2,0,0);
- end;
- p^.resulttype:=p^.left^.resulttype;
- end
- else
- begin
- if not(p^.right^.resulttype^.deftype=orddef) or
- not(porddef(p^.right^.resulttype)^.typ in [s32bit,u32bit]) then
- p^.right:=gentypeconvnode(p^.right,s32bitdef);
- if not(p^.left^.resulttype^.deftype=orddef) or
- not(porddef(p^.left^.resulttype)^.typ in [s32bit,u32bit]) then
- p^.left:=gentypeconvnode(p^.left,s32bitdef);
- firstpass(p^.left);
- firstpass(p^.right);
- { the resulttype depends on the right side, because the left becomes }
- { always 64 bit }
- p^.resulttype:=p^.right^.resulttype;
- if codegenerror then
- exit;
- left_right_max(p);
- if p^.left^.registers32<=p^.right^.registers32 then
- inc(p^.registers32);
- end;
- p^.location.loc:=LOC_REGISTER;
- end;
- {*****************************************************************************
- FirstShlShr
- *****************************************************************************}
- procedure firstshlshr(var p : ptree);
- var
- t : ptree;
- regs : longint;
- begin
- firstpass(p^.left);
- set_varstate(p^.left,true);
- firstpass(p^.right);
- set_varstate(p^.right,true);
- if codegenerror then
- exit;
- if isbinaryoverloaded(p) then
- exit;
- if is_constintnode(p^.left) and is_constintnode(p^.right) then
- begin
- case p^.treetype of
- shrn : t:=genordinalconstnode(p^.left^.value shr p^.right^.value,s32bitdef);
- shln : t:=genordinalconstnode(p^.left^.value shl p^.right^.value,s32bitdef);
- end;
- disposetree(p);
- firstpass(t);
- p:=t;
- exit;
- end;
- { 64 bit ints have their own shift handling }
- if not(is_64bitint(p^.left^.resulttype)) then
- begin
- p^.left:=gentypeconvnode(p^.left,s32bitdef);
- firstpass(p^.left);
- regs:=1;
- p^.resulttype:=s32bitdef;
- end
- else
- begin
- p^.resulttype:=p^.left^.resulttype;
- regs:=2;
- end;
- p^.right:=gentypeconvnode(p^.right,s32bitdef);
- firstpass(p^.right);
- if codegenerror then
- exit;
- if (p^.right^.treetype<>ordconstn) then
- inc(regs);
- calcregisters(p,regs,0,0);
- p^.location.loc:=LOC_REGISTER;
- end;
- {*****************************************************************************
- FirstUnaryMinus
- *****************************************************************************}
- procedure firstunaryminus(var p : ptree);
- var
- t : ptree;
- minusdef : pprocdef;
- begin
- firstpass(p^.left);
- set_varstate(p^.left,true);
- p^.registers32:=p^.left^.registers32;
- p^.registersfpu:=p^.left^.registersfpu;
- {$ifdef SUPPORT_MMX}
- p^.registersmmx:=p^.left^.registersmmx;
- {$endif SUPPORT_MMX}
- p^.resulttype:=p^.left^.resulttype;
- if codegenerror then
- exit;
- if is_constintnode(p^.left) then
- begin
- t:=genordinalconstnode(-p^.left^.value,s32bitdef);
- disposetree(p);
- firstpass(t);
- p:=t;
- exit;
- end;
- { nasm can not cope with negativ reals !! }
- if is_constrealnode(p^.left)
- {$ifdef i386}
- and not(aktoutputformat in [as_i386_nasmcoff,as_i386_nasmelf,as_i386_nasmobj])
- {$endif i386}
- then
- begin
- t:=genrealconstnode(-p^.left^.value_real,bestrealdef^);
- disposetree(p);
- firstpass(t);
- p:=t;
- exit;
- end;
- if (p^.left^.resulttype^.deftype=floatdef) then
- begin
- if pfloatdef(p^.left^.resulttype)^.typ=f32bit then
- begin
- if (p^.left^.location.loc<>LOC_REGISTER) and
- (p^.registers32<1) then
- p^.registers32:=1;
- p^.location.loc:=LOC_REGISTER;
- end
- else
- p^.location.loc:=LOC_FPU;
- end
- {$ifdef SUPPORT_MMX}
- else if (cs_mmx in aktlocalswitches) and
- is_mmx_able_array(p^.left^.resulttype) then
- begin
- if (p^.left^.location.loc<>LOC_MMXREGISTER) and
- (p^.registersmmx<1) then
- p^.registersmmx:=1;
- { if saturation is on, p^.left^.resulttype isn't
- "mmx able" (FK)
- if (cs_mmx_saturation in aktlocalswitches^) and
- (porddef(parraydef(p^.resulttype)^.definition)^.typ in
- [s32bit,u32bit]) then
- CGMessage(type_e_mismatch);
- }
- end
- {$endif SUPPORT_MMX}
- else if is_64bitint(p^.left^.resulttype) then
- begin
- firstpass(p^.left);
- p^.registersfpu:=p^.left^.registersfpu;
- {$ifdef SUPPORT_MMX}
- p^.registersmmx:=p^.left^.registersmmx;
- {$endif SUPPORT_MMX}
- p^.registers32:=p^.left^.registers32;
- if codegenerror then
- exit;
- if (p^.left^.location.loc<>LOC_REGISTER) and
- (p^.registers32<2) then
- p^.registers32:=2;
- p^.location.loc:=LOC_REGISTER;
- p^.resulttype:=p^.left^.resulttype;
- end
- else if (p^.left^.resulttype^.deftype=orddef) then
- begin
- p^.left:=gentypeconvnode(p^.left,s32bitdef);
- firstpass(p^.left);
- p^.registersfpu:=p^.left^.registersfpu;
- {$ifdef SUPPORT_MMX}
- p^.registersmmx:=p^.left^.registersmmx;
- {$endif SUPPORT_MMX}
- p^.registers32:=p^.left^.registers32;
- if codegenerror then
- exit;
- if (p^.left^.location.loc<>LOC_REGISTER) and
- (p^.registers32<1) then
- p^.registers32:=1;
- p^.location.loc:=LOC_REGISTER;
- p^.resulttype:=p^.left^.resulttype;
- end
- else
- begin
- if assigned(overloaded_operators[_minus]) then
- minusdef:=overloaded_operators[_minus]^.definition
- else
- minusdef:=nil;
- while assigned(minusdef) do
- begin
- if (pparaitem(minusdef^.para^.first)^.paratype.def=p^.left^.resulttype) and
- (pparaitem(minusdef^.para^.first)^.next=nil) then
- begin
- t:=gencallnode(overloaded_operators[_minus],nil);
- t^.left:=gencallparanode(p^.left,nil);
- putnode(p);
- p:=t;
- firstpass(p);
- exit;
- end;
- minusdef:=minusdef^.nextoverloaded;
- end;
- CGMessage(type_e_mismatch);
- end;
- end;
- {*****************************************************************************
- FirstNot
- *****************************************************************************}
- procedure firstnot(var p : ptree);
- var
- t : ptree;
- begin
- firstpass(p^.left);
- set_varstate(p^.left,true);
- if codegenerror then
- exit;
- if (p^.left^.treetype=ordconstn) then
- begin
- if is_boolean(p^.left^.resulttype) then
- t:=genordinalconstnode(byte(not(boolean(p^.left^.value))),p^.left^.resulttype)
- else
- t:=genordinalconstnode(not(p^.left^.value),p^.left^.resulttype);
- disposetree(p);
- firstpass(t);
- p:=t;
- exit;
- end;
- p^.resulttype:=p^.left^.resulttype;
- p^.location.loc:=p^.left^.location.loc;
- {$ifdef SUPPORT_MMX}
- p^.registersmmx:=p^.left^.registersmmx;
- {$endif SUPPORT_MMX}
- if is_boolean(p^.resulttype) then
- begin
- p^.registers32:=p^.left^.registers32;
- if (p^.location.loc in [LOC_REFERENCE,LOC_MEM,LOC_CREGISTER]) then
- begin
- p^.location.loc:=LOC_REGISTER;
- if (p^.registers32<1) then
- p^.registers32:=1;
- end;
- { before loading it into flags we need to load it into
- a register thus 1 register is need PM }
- {$ifdef i386}
- if p^.left^.location.loc<>LOC_JUMP then
- p^.location.loc:=LOC_FLAGS;
- {$endif def i386}
- end
- else
- {$ifdef SUPPORT_MMX}
- if (cs_mmx in aktlocalswitches) and
- is_mmx_able_array(p^.left^.resulttype) then
- begin
- if (p^.left^.location.loc<>LOC_MMXREGISTER) and
- (p^.registersmmx<1) then
- p^.registersmmx:=1;
- end
- else
- {$endif SUPPORT_MMX}
- if is_64bitint(p^.left^.resulttype) then
- begin
- p^.registers32:=p^.left^.registers32;
- if (p^.location.loc in [LOC_REFERENCE,LOC_MEM,LOC_CREGISTER]) then
- begin
- p^.location.loc:=LOC_REGISTER;
- if (p^.registers32<2) then
- p^.registers32:=2;
- end;
- end
- else
- begin
- p^.left:=gentypeconvnode(p^.left,s32bitdef);
- firstpass(p^.left);
- if codegenerror then
- exit;
- p^.resulttype:=p^.left^.resulttype;
- p^.registers32:=p^.left^.registers32;
- {$ifdef SUPPORT_MMX}
- p^.registersmmx:=p^.left^.registersmmx;
- {$endif SUPPORT_MMX}
- if (p^.left^.location.loc<>LOC_REGISTER) and
- (p^.registers32<1) then
- p^.registers32:=1;
- p^.location.loc:=LOC_REGISTER;
- end;
- p^.registersfpu:=p^.left^.registersfpu;
- end;
- end.
- {
- $Log$
- Revision 1.25 1999-11-30 10:40:58 peter
- + ttype, tsymlist
- Revision 1.24 1999/11/26 13:51:29 pierre
- * fix for overloading of shr shl mod and div
- Revision 1.23 1999/11/18 15:34:50 pierre
- * Notes/Hints for local syms changed to
- Set_varstate function
- Revision 1.22 1999/11/06 14:34:30 peter
- * truncated log to 20 revs
- Revision 1.21 1999/10/26 12:30:46 peter
- * const parameter is now checked
- * better and generic check if a node can be used for assigning
- * export fixes
- * procvar equal works now (it never had worked at least from 0.99.8)
- * defcoll changed to linkedlist with pparaitem so it can easily be
- walked both directions
- Revision 1.20 1999/08/23 23:37:01 pierre
- * firstnot register counting error corrected
- Revision 1.19 1999/08/04 13:03:15 jonas
- * all tokens now start with an underscore
- * PowerPC compiles!!
- Revision 1.18 1999/08/04 00:23:43 florian
- * renamed i386asm and i386base to cpuasm and cpubase
- Revision 1.17 1999/08/03 22:03:34 peter
- * moved bitmask constants to sets
- * some other type/const renamings
- Revision 1.16 1999/06/02 10:11:54 florian
- * make cycle fixed i.e. compilation with 0.99.10
- * some fixes for qword
- * start of register calling conventions
- Revision 1.15 1999/05/27 19:45:22 peter
- * removed oldasm
- * plabel -> pasmlabel
- * -a switches to source writing automaticly
- * assembler readers OOPed
- * asmsymbol automaticly external
- * jumptables and other label fixes for asm readers
- Revision 1.14 1999/05/06 09:05:38 peter
- * generic write_float and str_float
- * fixed constant float conversions
- Revision 1.13 1999/05/01 13:24:55 peter
- * merged nasm compiler
- * old asm moved to oldasm/
- Revision 1.12 1999/02/22 02:15:53 peter
- * updates for ag386bin
- Revision 1.11 1999/02/03 10:11:11 pierre
- * fix for bug0211 for i386
- Revision 1.10 1998/12/11 16:50:24 florian
- + typed const int64 and qword
- + unary minus-operator q1:=-q2;
- + not-operator
- Revision 1.9 1998/12/11 16:10:12 florian
- + shifting for 64 bit ints added
- * bug in getexplicitregister32 fixed: usableregs wasn't decremented !!
- Revision 1.8 1998/12/11 00:03:56 peter
- + globtype,tokens,version unit splitted from globals
- Revision 1.7 1998/11/13 10:16:38 peter
- * fixed constant not(boolean)
- Revision 1.6 1998/11/05 14:26:01 peter
- * fixed shlshr which would push ecx when not needed
- Revision 1.5 1998/10/20 13:12:39 peter
- * fixed 'not not boolean', the location was not set to register
- Revision 1.4 1998/10/13 16:50:25 pierre
- * undid some changes of Peter that made the compiler wrong
- for m68k (I had to reinsert some ifdefs)
- * removed several memory leaks under m68k
- * removed the meory leaks for assembler readers
- * cross compiling shoud work again better
- ( crosscompiling sysamiga works
- but as68k still complain about some code !)
- Revision 1.3 1998/10/13 13:10:33 peter
- * new style for m68k/i386 infos and enums
- Revision 1.2 1998/10/11 14:31:20 peter
- + checks for division by zero
- }
|