cg68k.pas 242 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565
  1. {
  2. $Id$
  3. Copyright (c) 1993,98 by Florian Klaempfl, Carl Eric Codere
  4. This unit generates 68000 (or better) assembler from the parse tree
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************}
  17. {$ifdef tp}
  18. {$E+,F+,N+,D+,L+,Y+}
  19. {$endif}
  20. {---------------------------------------------------------------------------}
  21. { LEFT TO DO IN CG68k AND CG68k2 }
  22. {---------------------------------------------------------------------------}
  23. { o Test and correct problems with extended support. }
  24. { o Optimize secondmoddiv when doing a constant modulo. }
  25. { o Add emulation support for Cardinal under MC68000. }
  26. {---------------------------------------------------------------------------}
  27. unit cg68k;
  28. {***************************************************************************}
  29. interface
  30. {***************************************************************************}
  31. uses objects,verbose,cobjects,comphook,systems,globals,tree,
  32. symtable,types,strings,pass_1,hcodegen,temp_gen,
  33. aasm,m68k,tgen68k,files,cga68k,cg68k2,link
  34. {$ifdef GDB}
  35. ,gdb
  36. {$endif}
  37. ;
  38. { produces assembler for the expression in variable p }
  39. { and produces an assembler node at the end }
  40. procedure generatecode(var p : ptree);
  41. { produces the actual code }
  42. function do_secondpass(var p : ptree) : boolean;
  43. procedure secondpass(var p : ptree);
  44. {$ifdef test_dest_loc}
  45. const { used to avoid temporary assignments }
  46. dest_loc_known : boolean = false;
  47. in_dest_loc : boolean = false;
  48. dest_loc_tree : ptree = nil;
  49. var dest_loc : tlocation;
  50. procedure mov_reg_to_dest(p : ptree; s : topsize; reg : tregister);
  51. {$endif test_dest_loc}
  52. {***************************************************************************}
  53. implementation
  54. {***************************************************************************}
  55. uses
  56. scanner;
  57. const
  58. never_copy_const_param : boolean = false;
  59. bytes2Sxx:array[1..4] of Topsize=(S_B,S_W,S_NO,S_L);
  60. { used to avoid temporary assignments }
  61. dest_loc_known : boolean = false;
  62. in_dest_loc : boolean = false;
  63. dest_loc_tree : ptree = nil;
  64. var
  65. { this is for open arrays and strings }
  66. { but be careful, this data is in the }
  67. { generated code destroyed quick, and also }
  68. { the next call of secondload destroys this }
  69. { data }
  70. { So be careful using the informations }
  71. { provided by this variables }
  72. highframepointer : tregister;
  73. highoffset : longint;
  74. dest_loc : tlocation;
  75. procedure mov_reg_to_dest(p : ptree; s : topsize; reg : tregister);
  76. begin
  77. if (dest_loc.loc=LOC_CREGISTER) or (dest_loc.loc=LOC_REGISTER) then
  78. begin
  79. emit_reg_reg(A_MOVE,s,reg,dest_loc.register);
  80. p^.location:=dest_loc;
  81. in_dest_loc:=true;
  82. end
  83. else
  84. if (dest_loc.loc=LOC_REFERENCE) or (dest_loc.loc=LOC_MEM) then
  85. begin
  86. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,s,reg,newreference(dest_loc.reference))));
  87. p^.location:=dest_loc;
  88. in_dest_loc:=true;
  89. end
  90. else
  91. internalerror(20080);
  92. end;
  93. procedure error(const t : tmsgconst);
  94. begin
  95. if not(codegenerror) then
  96. verbose.Message(t);
  97. codegenerror:=true;
  98. end;
  99. type
  100. secondpassproc = procedure(var p : ptree);
  101. procedure seconderror(var p : ptree);
  102. begin
  103. p^.error:=true;
  104. codegenerror:=true;
  105. end;
  106. procedure secondstatement(var p : ptree);
  107. var
  108. hp : ptree;
  109. begin
  110. hp:=p;
  111. while assigned(hp) do
  112. begin
  113. { assignments could be distance optimized }
  114. if assigned(hp^.right) then
  115. begin
  116. cleartempgen;
  117. secondpass(hp^.right);
  118. end;
  119. hp:=hp^.left;
  120. end;
  121. end;
  122. procedure secondload(var p : ptree);
  123. var
  124. hregister : tregister;
  125. i : longint;
  126. symtabletype: tsymtabletype;
  127. hp : preference;
  128. begin
  129. simple_loadn:=true;
  130. reset_reference(p^.location.reference);
  131. case p^.symtableentry^.typ of
  132. { this is only for toasm and toaddr }
  133. absolutesym :
  134. begin
  135. stringdispose(p^.location.reference.symbol);
  136. p^.location.reference.symbol:=stringdup(p^.symtableentry^.mangledname);
  137. if p^.symtableentry^.owner^.symtabletype=unitsymtable then
  138. concat_external(p^.symtableentry^.mangledname,EXT_NEAR);
  139. end;
  140. varsym :
  141. begin
  142. hregister:=R_NO;
  143. symtabletype:=p^.symtable^.symtabletype;
  144. { in case it is a register variable: }
  145. { we simply set the location to the }
  146. { correct register. }
  147. if pvarsym(p^.symtableentry)^.reg<>R_NO then
  148. begin
  149. p^.location.loc:=LOC_CREGISTER;
  150. p^.location.register:=pvarsym(p^.symtableentry)^.reg;
  151. unused:=unused-[pvarsym(p^.symtableentry)^.reg];
  152. end
  153. else
  154. begin
  155. { --------------------- LOCAL AND TEMP VARIABLES ------------- }
  156. if (symtabletype=parasymtable) or (symtabletype=localsymtable) then
  157. begin
  158. p^.location.reference.base:=procinfo.framepointer;
  159. p^.location.reference.offset:=pvarsym(p^.symtableentry)^.address;
  160. if (symtabletype=localsymtable) then
  161. p^.location.reference.offset:=-p^.location.reference.offset;
  162. if (symtabletype=parasymtable) then
  163. inc(p^.location.reference.offset,p^.symtable^.call_offset);
  164. if (lexlevel>(p^.symtable^.symtablelevel)) then
  165. begin
  166. hregister:=getaddressreg;
  167. { make a reference }
  168. new(hp);
  169. reset_reference(hp^);
  170. hp^.offset:=procinfo.framepointer_offset;
  171. hp^.base:=procinfo.framepointer;
  172. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,hp,hregister)));
  173. simple_loadn:=false;
  174. i:=lexlevel-1;
  175. while i>(p^.symtable^.symtablelevel) do
  176. begin
  177. { make a reference }
  178. new(hp);
  179. reset_reference(hp^);
  180. hp^.offset:=8;
  181. hp^.base:=hregister;
  182. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,hp,hregister)));
  183. dec(i);
  184. end;
  185. p^.location.reference.base:=hregister;
  186. end;
  187. end
  188. { --------------------- END OF LOCAL AND TEMP VARS ---------------- }
  189. else
  190. case symtabletype of
  191. unitsymtable,globalsymtable,
  192. staticsymtable : begin
  193. stringdispose(p^.location.reference.symbol);
  194. p^.location.reference.symbol:=stringdup(p^.symtableentry^.mangledname);
  195. if symtabletype=unitsymtable then
  196. concat_external(p^.symtableentry^.mangledname,EXT_NEAR);
  197. end;
  198. objectsymtable : begin
  199. if (pvarsym(p^.symtableentry)^.properties and sp_static)<>0 then
  200. begin
  201. stringdispose(p^.location.reference.symbol);
  202. p^.location.reference.symbol:=stringdup(p^.symtableentry^.mangledname);
  203. if p^.symtable^.defowner^.owner^.symtabletype=unitsymtable then
  204. concat_external(p^.symtableentry^.mangledname,EXT_NEAR);
  205. end
  206. else
  207. begin
  208. p^.location.reference.base:=R_A5;
  209. p^.location.reference.offset:=pvarsym(p^.symtableentry)^.address;
  210. end;
  211. end;
  212. withsymtable : begin
  213. hregister:=getaddressreg;
  214. p^.location.reference.base:=hregister;
  215. { make a reference }
  216. new(hp);
  217. reset_reference(hp^);
  218. hp^.offset:=p^.symtable^.datasize;
  219. hp^.base:=procinfo.framepointer;
  220. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,hp,hregister)));
  221. p^.location.reference.offset:=
  222. pvarsym(p^.symtableentry)^.address;
  223. end;
  224. end;
  225. { in case call by reference, then calculate: }
  226. if (pvarsym(p^.symtableentry)^.varspez=vs_var) or
  227. ((pvarsym(p^.symtableentry)^.varspez=vs_const) and
  228. dont_copy_const_param(pvarsym(p^.symtableentry)^.definition)) then
  229. begin
  230. simple_loadn:=false;
  231. if hregister=R_NO then
  232. hregister:=getaddressreg;
  233. { ADDED FOR OPEN ARRAY SUPPORT. }
  234. if (p^.location.reference.base=procinfo.framepointer) then
  235. begin
  236. highframepointer:=p^.location.reference.base;
  237. highoffset:=p^.location.reference.offset;
  238. end
  239. else
  240. begin
  241. highframepointer:=R_A1;
  242. highoffset:=p^.location.reference.offset;
  243. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  244. p^.location.reference.base,R_A1)));
  245. end;
  246. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.location.reference),
  247. hregister)));
  248. { END ADDITION }
  249. clear_reference(p^.location.reference);
  250. p^.location.reference.base:=hregister;
  251. end;
  252. { should be dereferenced later (FK)
  253. if (pvarsym(p^.symtableentry)^.definition^.deftype=objectdef) and
  254. ((pobjectdef(pvarsym(p^.symtableentry)^.definition)^.options and oois_class)<>0) then
  255. begin
  256. simple_loadn:=false;
  257. if hregister=R_NO then
  258. hregister:=getaddressreg;
  259. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.location.reference),
  260. hregister)));
  261. clear_reference(p^.location.reference);
  262. p^.location.reference.base:=hregister;
  263. end;
  264. }
  265. end;
  266. end;
  267. procsym:
  268. begin
  269. {!!!!! Be aware, work on virtual methods too }
  270. stringdispose(p^.location.reference.symbol);
  271. p^.location.reference.symbol:=
  272. stringdup(pprocsym(p^.symtableentry)^.definition^.mangledname);
  273. if p^.symtable^.symtabletype=unitsymtable then
  274. concat_external(p^.symtableentry^.mangledname,EXT_NEAR);
  275. end;
  276. typedconstsym :
  277. begin
  278. stringdispose(p^.location.reference.symbol);
  279. p^.location.reference.symbol:=stringdup(p^.symtableentry^.mangledname);
  280. if p^.symtable^.symtabletype=unitsymtable then
  281. concat_external(p^.symtableentry^.mangledname,EXT_NEAR);
  282. end;
  283. else internalerror(4);
  284. end;
  285. end;
  286. { D0 and D1 used as temp (ok) }
  287. procedure secondmoddiv(var p : ptree);
  288. var
  289. hreg1 : tregister;
  290. power : longint;
  291. hl : plabel;
  292. reg: tregister;
  293. pushed: boolean;
  294. hl1: plabel;
  295. begin
  296. secondpass(p^.left);
  297. set_location(p^.location,p^.left^.location);
  298. pushed:=maybe_push(p^.right^.registers32,p);
  299. secondpass(p^.right);
  300. if pushed then restore(p);
  301. { put numerator in register }
  302. if p^.left^.location.loc<>LOC_REGISTER then
  303. begin
  304. if p^.left^.location.loc=LOC_CREGISTER then
  305. begin
  306. hreg1:=getregister32;
  307. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hreg1);
  308. end
  309. else
  310. begin
  311. del_reference(p^.left^.location.reference);
  312. hreg1:=getregister32;
  313. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  314. hreg1)));
  315. end;
  316. p^.left^.location.loc:=LOC_REGISTER;
  317. p^.left^.location.register:=hreg1;
  318. end
  319. else hreg1:=p^.left^.location.register;
  320. if (p^.treetype=divn) and (p^.right^.treetype=ordconstn) and
  321. ispowerof2(p^.right^.value,power) then
  322. begin
  323. exprasmlist^.concat(new(pai68k, op_reg(A_TST, S_L, hreg1)));
  324. getlabel(hl);
  325. emitl(A_BPL,hl);
  326. if (power = 1) then
  327. exprasmlist^.concat(new(pai68k, op_const_reg(A_ADDQ, S_L,1, hreg1)))
  328. else
  329. Begin
  330. { optimize using ADDQ if possible! }
  331. if (p^.right^.value-1) < 9 then
  332. exprasmlist^.concat(new(pai68k, op_const_reg(A_ADDQ, S_L,p^.right^.value-1, hreg1)))
  333. else
  334. exprasmlist^.concat(new(pai68k, op_const_reg(A_ADD, S_L,p^.right^.value-1, hreg1)));
  335. end;
  336. emitl(A_LABEL, hl);
  337. if (power > 0) and (power < 9) then
  338. exprasmlist^.concat(new(pai68k, op_const_reg(A_ASR, S_L,power, hreg1)))
  339. else
  340. begin
  341. exprasmlist^.concat(new(pai68k, op_const_reg(A_MOVE,S_L,power, R_D0)));
  342. exprasmlist^.concat(new(pai68k, op_reg_reg(A_ASR,S_L,R_D0, hreg1)));
  343. end;
  344. end
  345. else
  346. begin
  347. { bring denominator to D1 }
  348. { D1 is always free, it's }
  349. { only used for temporary }
  350. { purposes }
  351. if (p^.right^.location.loc<>LOC_REGISTER) and
  352. (p^.right^.location.loc<>LOC_CREGISTER) then
  353. begin
  354. del_reference(p^.right^.location.reference);
  355. p^.left^.location.loc:=LOC_REGISTER;
  356. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.right^.location.reference),R_D1)));
  357. end
  358. else
  359. begin
  360. ungetregister32(p^.right^.location.register);
  361. emit_reg_reg(A_MOVE,S_L,p^.right^.location.register,R_D1);
  362. end;
  363. { on entering this section D1 should contain the divisor }
  364. if (aktoptprocessor = MC68020) then
  365. begin
  366. { Check if divisor is ZERO - if so call HALT_ERROR }
  367. { with d0 = 200 (Division by zero!) }
  368. getlabel(hl1);
  369. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_L,R_D1)));
  370. { if not zero then simply continue on }
  371. emitl(A_BNE,hl1);
  372. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,200,R_D0)));
  373. emitcall('HALT_ERROR',true);
  374. emitl(A_LABEL,hl1);
  375. if (p^.treetype = modn) then
  376. Begin
  377. reg := getregister32;
  378. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,S_L,reg)));
  379. getlabel(hl);
  380. { here what we do is prepare the high register with the }
  381. { correct sign. i.e we clear it, check if the low dword reg }
  382. { which will participate in the division is signed, if so we}
  383. { we extend the sign to the high doword register by inverting }
  384. { all the bits. }
  385. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_L,hreg1)));
  386. emitl(A_BPL,hl);
  387. exprasmlist^.concat(new(pai68k,op_reg(A_NOT,S_L,reg)));
  388. emitl(A_LABEL,hl);
  389. { reg:hreg1 / d1 }
  390. exprasmlist^.concat(new(pai68k,op_reg_reg_reg(A_DIVSL,S_L,R_D1,reg,hreg1)));
  391. { hreg1 already contains quotient }
  392. { looking for remainder }
  393. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,reg,hreg1)));
  394. ungetregister32(reg);
  395. end
  396. else
  397. { simple division... }
  398. Begin
  399. { reg:hreg1 / d1 }
  400. exprasmlist^.concat(new(pai68k,op_reg_reg(A_DIVS,S_L,R_D1,hreg1)));
  401. end;
  402. end
  403. else { MC68000 operations }
  404. begin
  405. { put numerator in d0 }
  406. emit_reg_reg(A_MOVE,S_L,hreg1,R_D0);
  407. { operation to perform on entry to both }
  408. { routines... d0/d1 }
  409. { return result in d0 }
  410. if p^.treetype = divn then
  411. emitcall('LONGDIV',true)
  412. else
  413. emitcall('LONGMOD',true);
  414. emit_reg_reg(A_MOVE,S_L,R_D0,hreg1);
  415. end; { endif }
  416. end;
  417. { this registers are always used when div/mod are present }
  418. usedinproc:=usedinproc or ($800 shr word(R_D1));
  419. usedinproc:=usedinproc or ($800 shr word(R_D0));
  420. p^.location.loc:=LOC_REGISTER;
  421. p^.location.register:=hreg1;
  422. end;
  423. { D6 used as scratch (ok) }
  424. procedure secondshlshr(var p : ptree);
  425. var
  426. hregister1,hregister2,hregister3 : tregister;
  427. op : tasmop;
  428. pushed : boolean;
  429. begin
  430. secondpass(p^.left);
  431. pushed:=maybe_push(p^.right^.registers32,p);
  432. secondpass(p^.right);
  433. if pushed then restore(p);
  434. { load left operators in a register }
  435. if p^.left^.location.loc<>LOC_REGISTER then
  436. begin
  437. if p^.left^.location.loc=LOC_CREGISTER then
  438. begin
  439. hregister1:=getregister32;
  440. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,
  441. hregister1);
  442. end
  443. else
  444. begin
  445. del_reference(p^.left^.location.reference);
  446. hregister1:=getregister32;
  447. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  448. hregister1)));
  449. end;
  450. end
  451. else hregister1:=p^.left^.location.register;
  452. { determine operator }
  453. if p^.treetype=shln then
  454. op:=A_LSL
  455. else
  456. op:=A_LSR;
  457. { shifting by a constant directly decode: }
  458. if (p^.right^.treetype=ordconstn) then
  459. begin
  460. if (p^.right^.location.reference.offset and 31 > 0) and (p^.right^.location.reference.offset and 31 < 9) then
  461. exprasmlist^.concat(new(pai68k,op_const_reg(op,S_L,p^.right^.location.reference.offset and 31,
  462. hregister1)))
  463. else
  464. begin
  465. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,p^.right^.location.reference.offset and 31,
  466. R_D6)));
  467. exprasmlist^.concat(new(pai68k,op_reg_reg(op,S_L,R_D6,hregister1)));
  468. end;
  469. p^.location.loc:=LOC_REGISTER;
  470. p^.location.register:=hregister1;
  471. end
  472. else
  473. begin
  474. { load right operators in a register }
  475. if p^.right^.location.loc<>LOC_REGISTER then
  476. begin
  477. if p^.right^.location.loc=LOC_CREGISTER then
  478. begin
  479. hregister2:=getregister32;
  480. emit_reg_reg(A_MOVE,S_L,p^.right^.location.register,
  481. hregister2);
  482. end
  483. else
  484. begin
  485. del_reference(p^.right^.location.reference);
  486. hregister2:=getregister32;
  487. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.right^.location.reference),
  488. hregister2)));
  489. end;
  490. end
  491. else hregister2:=p^.right^.location.register;
  492. emit_reg_reg(op,S_L,hregister2,hregister1);
  493. p^.location.register:=hregister1;
  494. end;
  495. { this register is always used when shl/shr are present }
  496. usedinproc:=usedinproc or ($800 shr byte(R_D6));
  497. end;
  498. procedure secondrealconst(var p : ptree);
  499. var
  500. hp1 : pai;
  501. lastlabel : plabel;
  502. found : boolean;
  503. begin
  504. clear_reference(p^.location.reference);
  505. lastlabel:=nil;
  506. found:=false;
  507. { const already used ? }
  508. if p^.labnumber=-1 then
  509. begin
  510. { tries to found an old entry }
  511. hp1:=pai(consts^.first);
  512. while assigned(hp1) do
  513. begin
  514. if hp1^.typ=ait_label then
  515. lastlabel:=pai_label(hp1)^.l
  516. else
  517. begin
  518. if (hp1^.typ=p^.realtyp) and (lastlabel<>nil) then
  519. begin
  520. { Florian this caused a internalerror(10)=> no free reg !! }
  521. {if ((p^.realtyp=ait_real_64bit) and (pai_double(hp1)^.value=p^.valued)) or
  522. ((p^.realtyp=ait_real_80bit) and (pai_extended(hp1)^.value=p^.valued)) or
  523. ((p^.realtyp=ait_real_32bit) and (pai_single(hp1)^.value=p^.valued)) then }
  524. if ((p^.realtyp=ait_real_64bit) and (pai_double(hp1)^.value=p^.valued)) then
  525. found:=true;
  526. if ((p^.realtyp=ait_real_32bit) and (pai_single(hp1)^.value=p^.valued)) then
  527. found:=true;
  528. if ((p^.realtyp=ait_real_extended) and (pai_extended(hp1)^.value=p^.valued)) then
  529. found:=true;
  530. if found then
  531. begin
  532. { found! }
  533. p^.labnumber:=lastlabel^.nb;
  534. break;
  535. end;
  536. end;
  537. lastlabel:=nil;
  538. end;
  539. hp1:=pai(hp1^.next);
  540. end;
  541. { :-(, we must generate a new entry }
  542. if p^.labnumber=-1 then
  543. begin
  544. getlabel(lastlabel);
  545. p^.labnumber:=lastlabel^.nb;
  546. case p^.realtyp of
  547. ait_real_64bit : consts^.insert(new(pai_double,init(p^.valued)));
  548. ait_real_32bit : consts^.insert(new(pai_single,init(p^.valued)));
  549. ait_real_extended : consts^.insert(new(pai_extended,init(p^.valued)));
  550. else
  551. internalerror(10120);
  552. end;
  553. consts^.insert(new(pai_label,init(lastlabel)));
  554. end;
  555. end;
  556. stringdispose(p^.location.reference.symbol);
  557. p^.location.reference.symbol:=stringdup(lab2str(lastlabel));
  558. end;
  559. procedure secondfixconst(var p : ptree);
  560. begin
  561. { an fix comma const. behaves as a memory reference }
  562. p^.location.loc:=LOC_MEM;
  563. p^.location.reference.isintvalue:=true;
  564. p^.location.reference.offset:=p^.valuef;
  565. end;
  566. procedure secondordconst(var p : ptree);
  567. begin
  568. { an integer const. behaves as a memory reference }
  569. p^.location.loc:=LOC_MEM;
  570. p^.location.reference.isintvalue:=true;
  571. p^.location.reference.offset:=p^.value;
  572. end;
  573. procedure secondniln(var p : ptree);
  574. begin
  575. p^.location.loc:=LOC_MEM;
  576. p^.location.reference.isintvalue:=true;
  577. p^.location.reference.offset:=0;
  578. end;
  579. procedure secondstringconst(var p : ptree);
  580. var
  581. hp1 : pai;
  582. lastlabel : plabel;
  583. pc : pchar;
  584. same_string : boolean;
  585. i : word;
  586. begin
  587. clear_reference(p^.location.reference);
  588. lastlabel:=nil;
  589. { const already used ? }
  590. if p^.labstrnumber=-1 then
  591. begin
  592. { tries to found an old entry }
  593. hp1:=pai(consts^.first);
  594. while assigned(hp1) do
  595. begin
  596. if hp1^.typ=ait_label then
  597. lastlabel:=pai_label(hp1)^.l
  598. else
  599. begin
  600. if (hp1^.typ=ait_string) and (lastlabel<>nil) and
  601. (pai_string(hp1)^.len=length(p^.values^)+2) then
  602. begin
  603. same_string:=true;
  604. for i:=1 to length(p^.values^) do
  605. if pai_string(hp1)^.str[i]<>p^.values^[i] then
  606. begin
  607. same_string:=false;
  608. break;
  609. end;
  610. if same_string then
  611. begin
  612. { found! }
  613. p^.labstrnumber:=lastlabel^.nb;
  614. break;
  615. end;
  616. end;
  617. lastlabel:=nil;
  618. end;
  619. hp1:=pai(hp1^.next);
  620. end;
  621. { :-(, we must generate a new entry }
  622. if p^.labstrnumber=-1 then
  623. begin
  624. getlabel(lastlabel);
  625. p^.labstrnumber:=lastlabel^.nb;
  626. getmem(pc,length(p^.values^)+3);
  627. move(p^.values^,pc^,length(p^.values^)+1);
  628. pc[length(p^.values^)+1]:=#0;
  629. { we still will have a problem if there is a #0 inside the pchar }
  630. consts^.insert(new(pai_string,init_pchar(pc)));
  631. { to overcome this problem we set the length explicitly }
  632. { with the ending null char }
  633. pai_string(consts^.first)^.len:=length(p^.values^)+2;
  634. consts^.insert(new(pai_label,init(lastlabel)));
  635. end;
  636. end;
  637. stringdispose(p^.location.reference.symbol);
  638. p^.location.reference.symbol:=stringdup(lab2str(lastlabel));
  639. p^.location.loc := LOC_MEM;
  640. end;
  641. procedure secondumminus(var p : ptree);
  642. begin
  643. secondpass(p^.left);
  644. p^.location.loc:=LOC_REGISTER;
  645. case p^.left^.location.loc of
  646. LOC_REGISTER : begin
  647. p^.location.register:=p^.left^.location.register;
  648. exprasmlist^.concat(new(pai68k,op_reg(A_NEG,S_L,p^.location.register)));
  649. end;
  650. LOC_CREGISTER : begin
  651. p^.location.register:=getregister32;
  652. emit_reg_reg(A_MOVE,S_L,p^.location.register,
  653. p^.location.register);
  654. exprasmlist^.concat(new(pai68k,op_reg(A_NEG,S_L,p^.location.register)));
  655. end;
  656. LOC_REFERENCE,LOC_MEM :
  657. begin
  658. del_reference(p^.left^.location.reference);
  659. { change sign of a floating point }
  660. { in the case of emulation, get }
  661. { a free register, and change sign }
  662. { manually. }
  663. { otherwise simply load into an FPU}
  664. { register. }
  665. if (p^.left^.resulttype^.deftype=floatdef) and
  666. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  667. begin
  668. { move to FPU }
  669. floatload(pfloatdef(p^.left^.resulttype)^.typ,
  670. p^.left^.location.reference,p^.location);
  671. if (cs_fp_emulation) in aktmoduleswitches then
  672. { if in emulation mode change sign manually }
  673. exprasmlist^.concat(new(pai68k,op_const_reg(A_BCHG,S_L,31,
  674. p^.location.fpureg)))
  675. else
  676. exprasmlist^.concat(new(pai68k,op_reg(A_FNEG,S_FX,
  677. p^.location.fpureg)));
  678. end
  679. else
  680. begin
  681. p^.location.register:=getregister32;
  682. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  683. newreference(p^.left^.location.reference),
  684. p^.location.register)));
  685. exprasmlist^.concat(new(pai68k,op_reg(A_NEG,S_L,p^.location.register)));
  686. end;
  687. end;
  688. LOC_FPU : begin
  689. p^.location.loc:=LOC_FPU;
  690. p^.location.fpureg := p^.left^.location.fpureg;
  691. if (cs_fp_emulation) in aktmoduleswitches then
  692. exprasmlist^.concat(new(pai68k,op_const_reg(A_BCHG,S_L,31,p^.location.fpureg)))
  693. else
  694. exprasmlist^.concat(new(pai68k,op_reg(A_FNEG,S_FX,p^.location.fpureg)));
  695. end;
  696. end;
  697. { emitoverflowcheck;}
  698. end;
  699. { use of A6 is required only temp (ok) }
  700. procedure secondaddr(var p : ptree);
  701. begin
  702. secondpass(p^.left);
  703. p^.location.loc:=LOC_REGISTER;
  704. p^.location.register:=getregister32;
  705. {@ on a procvar means returning an address to the procedure that
  706. is stored in it.}
  707. { yes but p^.left^.symtableentry can be nil
  708. for example on @self !! }
  709. { symtableentry can be also invalid, if left is no tree node }
  710. if (p^.left^.treetype=loadn) and
  711. assigned(p^.left^.symtableentry) and
  712. (p^.left^.symtableentry^.typ=varsym) and
  713. (Pvarsym(p^.left^.symtableentry)^.definition^.deftype=
  714. procvardef) then
  715. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  716. newreference(p^.left^.location.reference),
  717. p^.location.register)))
  718. else
  719. begin
  720. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  721. newreference(p^.left^.location.reference),R_A0)));
  722. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  723. R_A0,p^.location.register)));
  724. end;
  725. { for use of other segments }
  726. { if p^.left^.location.reference.segment<>R_DEFAULT_SEG then
  727. p^.location.segment:=p^.left^.location.reference.segment;
  728. }
  729. del_reference(p^.left^.location.reference);
  730. end;
  731. { register a6 used as scratch }
  732. procedure seconddoubleaddr(var p : ptree);
  733. begin
  734. secondpass(p^.left);
  735. p^.location.loc:=LOC_REGISTER;
  736. del_reference(p^.left^.location.reference);
  737. p^.location.register:=getregister32;
  738. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  739. newreference(p^.left^.location.reference),R_A0)));
  740. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  741. R_A0,p^.location.register)));
  742. end;
  743. procedure secondnot(var p : ptree);
  744. const
  745. flagsinvers : array[F_E..F_BE] of tresflags =
  746. (F_NE,F_E,F_LE,F_GE,F_L,F_G,F_NC,F_C,
  747. F_A,F_AE,F_B,F_BE);
  748. var
  749. hl : plabel;
  750. begin
  751. if (p^.resulttype^.deftype=orddef) and
  752. (porddef(p^.resulttype)^.typ=bool8bit) then
  753. begin
  754. case p^.location.loc of
  755. LOC_JUMP : begin
  756. hl:=truelabel;
  757. truelabel:=falselabel;
  758. falselabel:=hl;
  759. secondpass(p^.left);
  760. maketojumpbool(p^.left);
  761. hl:=truelabel;
  762. truelabel:=falselabel;
  763. falselabel:=hl;
  764. end;
  765. LOC_FLAGS : begin
  766. secondpass(p^.left);
  767. p^.location.resflags:=flagsinvers[p^.left^.location.resflags];
  768. end;
  769. LOC_REGISTER : begin
  770. secondpass(p^.left);
  771. p^.location.register:=p^.left^.location.register;
  772. exprasmlist^.concat(new(pai68k,op_const_reg(A_EOR,S_B,1,p^.location.register)));
  773. end;
  774. LOC_CREGISTER : begin
  775. secondpass(p^.left);
  776. p^.location.loc:=LOC_REGISTER;
  777. p^.location.register:=getregister32;
  778. emit_reg_reg(A_MOVE,S_B,p^.left^.location.register,
  779. p^.location.register);
  780. exprasmlist^.concat(new(pai68k,op_const_reg(A_EOR,S_B,1,p^.location.register)));
  781. end;
  782. LOC_REFERENCE,LOC_MEM : begin
  783. secondpass(p^.left);
  784. del_reference(p^.left^.location.reference);
  785. p^.location.loc:=LOC_REGISTER;
  786. p^.location.register:=getregister32;
  787. if p^.left^.location.loc=LOC_CREGISTER then
  788. emit_reg_reg(A_MOVE,S_B,p^.left^.location.register,
  789. p^.location.register)
  790. else
  791. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,
  792. newreference(p^.left^.location.reference),
  793. p^.location.register)));
  794. exprasmlist^.concat(new(pai68k,op_const_reg(A_EOR,S_B,1,p^.location.register)));
  795. end;
  796. end;
  797. end
  798. else
  799. begin
  800. secondpass(p^.left);
  801. p^.location.loc:=LOC_REGISTER;
  802. case p^.left^.location.loc of
  803. LOC_REGISTER : begin
  804. p^.location.register:=p^.left^.location.register;
  805. exprasmlist^.concat(new(pai68k,op_reg(A_NOT,S_L,p^.location.register)));
  806. end;
  807. LOC_CREGISTER : begin
  808. p^.location.register:=getregister32;
  809. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,
  810. p^.location.register);
  811. exprasmlist^.concat(new(pai68k,op_reg(A_NOT,S_L,p^.location.register)));
  812. end;
  813. LOC_REFERENCE,LOC_MEM :
  814. begin
  815. del_reference(p^.left^.location.reference);
  816. p^.location.register:=getregister32;
  817. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  818. newreference(p^.left^.location.reference),
  819. p^.location.register)));
  820. exprasmlist^.concat(new(pai68k,op_reg(A_NOT,S_L,p^.location.register)));
  821. end;
  822. end;
  823. {if p^.left^.location.loc=loc_register then
  824. p^.location.register:=p^.left^.location.register
  825. else
  826. begin
  827. del_locref(p^.left^.location);
  828. p^.location.register:=getregister32;
  829. exprasmlist^.concat(new(pai68k,op_loc_reg(A_MOV,S_L,
  830. p^.left^.location,
  831. p^.location.register)));
  832. end;
  833. exprasmlist^.concat(new(pai68k,op_reg(A_NOT,S_L,p^.location.register)));}
  834. end;
  835. end;
  836. procedure secondnothing(var p : ptree);
  837. begin
  838. end;
  839. procedure secondassignment(var p : ptree);
  840. var
  841. opsize : topsize;
  842. withresult : boolean;
  843. otlabel,hlabel,oflabel : plabel;
  844. hregister : tregister;
  845. loc : tloc;
  846. begin
  847. otlabel:=truelabel;
  848. oflabel:=falselabel;
  849. getlabel(truelabel);
  850. getlabel(falselabel);
  851. withresult:=false;
  852. { calculate left sides }
  853. secondpass(p^.left);
  854. case p^.left^.location.loc of
  855. LOC_REFERENCE : begin
  856. { in case left operator uses too many registers }
  857. { but to few are free then LEA }
  858. if (p^.left^.location.reference.base<>R_NO) and
  859. (p^.left^.location.reference.index<>R_NO) and
  860. (usableaddress<p^.right^.registers32) then
  861. begin
  862. del_reference(p^.left^.location.reference);
  863. hregister:=getaddressreg;
  864. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,newreference(
  865. p^.left^.location.reference),
  866. hregister)));
  867. clear_reference(p^.left^.location.reference);
  868. p^.left^.location.reference.base:=hregister;
  869. p^.left^.location.reference.index:=R_NO;
  870. end;
  871. loc:=LOC_REFERENCE;
  872. end;
  873. LOC_CREGISTER : loc:=LOC_CREGISTER;
  874. else
  875. begin
  876. Message(cg_e_illegal_expression);
  877. exit;
  878. end;
  879. end;
  880. { lets try to optimize this (PM) }
  881. { define a dest_loc that is the location }
  882. { and a ptree to verify that it is the right }
  883. { place to insert it }
  884. {$ifdef test_dest_loc}
  885. if (aktexprlevel<4) then
  886. begin
  887. dest_loc_known:=true;
  888. dest_loc:=p^.left^.location;
  889. dest_loc_tree:=p^.right;
  890. end;
  891. {$endif test_dest_loc}
  892. if (p^.right^.treetype=realconstn) then
  893. begin
  894. if p^.left^.resulttype^.deftype=floatdef then
  895. begin
  896. case pfloatdef(p^.left^.resulttype)^.typ of
  897. s32real : p^.right^.realtyp:=ait_real_32bit;
  898. s64real : p^.right^.realtyp:=ait_real_64bit;
  899. s80real : p^.right^.realtyp:=ait_real_extended;
  900. { what about f32bit and s64bit }
  901. end;
  902. end;
  903. end;
  904. secondpass(p^.right);
  905. {$ifdef test_dest_loc}
  906. dest_loc_known:=false;
  907. if in_dest_loc then
  908. begin
  909. truelabel:=otlabel;
  910. falselabel:=oflabel;
  911. in_dest_loc:=false;
  912. exit;
  913. end;
  914. {$endif test_dest_loc}
  915. if p^.left^.resulttype^.deftype=stringdef then
  916. begin
  917. { we do not need destination anymore }
  918. del_reference(p^.left^.location.reference);
  919. { only source if withresult is set }
  920. if not(withresult) then
  921. del_reference(p^.right^.location.reference);
  922. loadstring(p);
  923. ungetiftemp(p^.right^.location.reference);
  924. end
  925. else case p^.right^.location.loc of
  926. LOC_REFERENCE,
  927. LOC_MEM : begin
  928. { handle ordinal constants trimmed }
  929. if (p^.right^.treetype in [ordconstn,fixconstn]) or
  930. (loc=LOC_CREGISTER) then
  931. begin
  932. case p^.left^.resulttype^.size of
  933. 1 : opsize:=S_B;
  934. 2 : opsize:=S_W;
  935. 4 : opsize:=S_L;
  936. end;
  937. if loc=LOC_CREGISTER then
  938. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,opsize,
  939. newreference(p^.right^.location.reference),
  940. p^.left^.location.register)))
  941. else
  942. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,opsize,
  943. p^.right^.location.reference.offset,
  944. newreference(p^.left^.location.reference))));
  945. {exprasmlist^.concat(new(pai68k,op_const_loc(A_MOV,opsize,
  946. p^.right^.location.reference.offset,
  947. p^.left^.location)));}
  948. end
  949. else
  950. begin
  951. concatcopy(p^.right^.location.reference,
  952. p^.left^.location.reference,p^.left^.resulttype^.size,
  953. withresult);
  954. ungetiftemp(p^.right^.location.reference);
  955. end;
  956. end;
  957. LOC_REGISTER,
  958. LOC_CREGISTER : begin
  959. case p^.right^.resulttype^.size of
  960. 1 : opsize:=S_B;
  961. 2 : opsize:=S_W;
  962. 4 : opsize:=S_L;
  963. end;
  964. { simplified with op_reg_loc }
  965. if loc=LOC_CREGISTER then
  966. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,opsize,
  967. p^.right^.location.register,
  968. p^.left^.location.register)))
  969. else
  970. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,opsize,
  971. p^.right^.location.register,
  972. newreference(p^.left^.location.reference))));
  973. {exprasmlist^.concat(new(pai68k,op_reg_loc(A_MOV,opsize,
  974. p^.right^.location.register,
  975. p^.left^.location))); }
  976. end;
  977. LOC_FPU : begin
  978. if loc<>LOC_REFERENCE then
  979. internalerror(10010)
  980. else
  981. floatstore(pfloatdef(p^.left^.resulttype)^.typ,
  982. p^.right^.location,p^.left^.location.reference);
  983. end;
  984. LOC_JUMP : begin
  985. getlabel(hlabel);
  986. emitl(A_LABEL,truelabel);
  987. if loc=LOC_CREGISTER then
  988. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_B,
  989. 1,p^.left^.location.register)))
  990. else
  991. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,S_B,
  992. 1,newreference(p^.left^.location.reference))));
  993. {exprasmlist^.concat(new(pai68k,op_const_loc(A_MOV,S_B,
  994. 1,p^.left^.location)));}
  995. emitl(A_JMP,hlabel);
  996. emitl(A_LABEL,falselabel);
  997. if loc=LOC_CREGISTER then
  998. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,S_B,
  999. p^.left^.location.register)))
  1000. else
  1001. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,S_B,
  1002. 0,newreference(p^.left^.location.reference))));
  1003. emitl(A_LABEL,hlabel);
  1004. end;
  1005. LOC_FLAGS : begin
  1006. if loc=LOC_CREGISTER then
  1007. begin
  1008. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.right^.location.resflags],S_B,
  1009. p^.left^.location.register)));
  1010. exprasmlist^.concat(new(pai68k,op_reg(A_NEG,S_B,p^.left^.location.register)));
  1011. end
  1012. else
  1013. begin
  1014. exprasmlist^.concat(new(pai68k,op_ref(flag_2_set[p^.right^.location.resflags],S_B,
  1015. newreference(p^.left^.location.reference))));
  1016. exprasmlist^.concat(new(pai68k,op_ref(A_NEG,S_B,newreference(p^.left^.location.reference))));
  1017. end;
  1018. end;
  1019. end;
  1020. truelabel:=otlabel;
  1021. falselabel:=oflabel;
  1022. end;
  1023. procedure secondderef(var p : ptree);
  1024. var
  1025. hr : tregister;
  1026. begin
  1027. secondpass(p^.left);
  1028. clear_reference(p^.location.reference);
  1029. case p^.left^.location.loc of
  1030. LOC_REGISTER : Begin
  1031. hr := getaddressreg;
  1032. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  1033. p^.location.reference.base:=hr;
  1034. ungetregister(p^.left^.location.register);
  1035. end;
  1036. LOC_CREGISTER : begin
  1037. { ... and reserve one for the pointer }
  1038. hr:=getaddressreg;
  1039. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  1040. p^.location.reference.base:=hr;
  1041. { LOC_REGISTER indicates that this is a
  1042. variable register which should not be freed. }
  1043. { ungetregister(p^.left^.location.register); }
  1044. end;
  1045. else
  1046. begin
  1047. { free register }
  1048. del_reference(p^.left^.location.reference);
  1049. { ...and reserve one for the pointer }
  1050. hr:=getaddressreg;
  1051. exprasmlist^.concat(new(pai68k,op_ref_reg(
  1052. A_MOVE,S_L,newreference(p^.left^.location.reference),
  1053. hr)));
  1054. p^.location.reference.base:=hr;
  1055. end;
  1056. end;
  1057. end;
  1058. { used D0, D1 as scratch (ok) }
  1059. { arrays ... }
  1060. { Sets up the array and string }
  1061. { references . }
  1062. procedure secondvecn(var p : ptree);
  1063. var
  1064. pushed : boolean;
  1065. ind : tregister;
  1066. _p : ptree;
  1067. procedure calc_emit_mul;
  1068. var
  1069. l1,l2 : longint;
  1070. begin
  1071. l1:=p^.resulttype^.size;
  1072. case l1 of
  1073. 1 : p^.location.reference.scalefactor:=l1;
  1074. 2 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,ind)));
  1075. 4 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,2,ind)));
  1076. 8 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,3,ind)));
  1077. else
  1078. begin
  1079. if ispowerof2(l1,l2) then
  1080. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,l2,ind)))
  1081. else
  1082. begin
  1083. { use normal MC68000 signed multiply }
  1084. if (l1 >= -32768) and (l1 <= 32767) then
  1085. exprasmlist^.concat(new(pai68k,op_const_reg(A_MULS,S_W,l1,ind)))
  1086. else
  1087. { use long MC68020 long multiply }
  1088. if (aktoptprocessor = MC68020) then
  1089. exprasmlist^.concat(new(pai68k,op_const_reg(A_MULS,S_L,l1,ind)))
  1090. else
  1091. { MC68000 long multiply }
  1092. begin
  1093. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,l1,R_D0)));
  1094. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,ind,R_D1)));
  1095. emitcall('LONGMUL',true);
  1096. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,ind)));
  1097. end;
  1098. end;
  1099. end; { else case }
  1100. end; { end case }
  1101. end; { calc_emit_mul }
  1102. var
  1103. extraoffset : longint;
  1104. t : ptree;
  1105. hp : preference;
  1106. tai:pai68k;
  1107. reg: tregister;
  1108. begin
  1109. secondpass(p^.left);
  1110. { RESULT IS IN p^.location.reference }
  1111. set_location(p^.location,p^.left^.location);
  1112. { offset can only differ from 0 if arraydef }
  1113. if p^.left^.resulttype^.deftype=arraydef then
  1114. dec(p^.location.reference.offset,
  1115. p^.resulttype^.size*
  1116. parraydef(p^.left^.resulttype)^.lowrange);
  1117. if p^.right^.treetype=ordconstn then
  1118. begin
  1119. { offset can only differ from 0 if arraydef }
  1120. if (p^.left^.resulttype^.deftype=arraydef) then
  1121. begin
  1122. if not(is_open_array(p^.left^.resulttype)) then
  1123. begin
  1124. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  1125. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  1126. Message(parser_e_range_check_error);
  1127. dec(p^.left^.location.reference.offset,
  1128. p^.resulttype^.size*parraydef(p^.left^.resulttype)^.lowrange);
  1129. end
  1130. else
  1131. begin
  1132. { range checking for open arrays }
  1133. end;
  1134. end;
  1135. inc(p^.left^.location.reference.offset,
  1136. p^.right^.value*p^.resulttype^.size);
  1137. p^.left^.resulttype:=p^.resulttype;
  1138. disposetree(p^.right);
  1139. _p:=p^.left;
  1140. putnode(p);
  1141. p:=_p;
  1142. end
  1143. else
  1144. begin
  1145. { quick hack, to overcome Delphi 2 }
  1146. if (�cs_regalloc in aktglobalswitches) and
  1147. (p^.left^.resulttype^.deftype=arraydef) then
  1148. begin
  1149. extraoffset:=0;
  1150. if (p^.right^.treetype=addn) then
  1151. begin
  1152. if p^.right^.right^.treetype=ordconstn then
  1153. begin
  1154. extraoffset:=p^.right^.right^.value;
  1155. t:=p^.right^.left;
  1156. putnode(p^.right);
  1157. putnode(p^.right^.right);
  1158. p^.right:=t
  1159. end
  1160. else if p^.right^.left^.treetype=ordconstn then
  1161. begin
  1162. extraoffset:=p^.right^.left^.value;
  1163. t:=p^.right^.right;
  1164. putnode(p^.right);
  1165. putnode(p^.right^.left);
  1166. p^.right:=t
  1167. end;
  1168. end
  1169. else if (p^.right^.treetype=subn) then
  1170. begin
  1171. if p^.right^.right^.treetype=ordconstn then
  1172. begin
  1173. extraoffset:=p^.right^.right^.value;
  1174. t:=p^.right^.left;
  1175. putnode(p^.right);
  1176. putnode(p^.right^.right);
  1177. p^.right:=t
  1178. end
  1179. else if p^.right^.left^.treetype=ordconstn then
  1180. begin
  1181. extraoffset:=p^.right^.left^.value;
  1182. t:=p^.right^.right;
  1183. putnode(p^.right);
  1184. putnode(p^.right^.left);
  1185. p^.right:=t
  1186. end;
  1187. end;
  1188. inc(p^.location.reference.offset,
  1189. p^.resulttype^.size*extraoffset);
  1190. end;
  1191. { calculate from left to right }
  1192. if (p^.location.loc<>LOC_REFERENCE) and
  1193. (p^.location.loc<>LOC_MEM) then
  1194. Message(cg_e_illegal_expression);
  1195. pushed:=maybe_push(p^.right^.registers32,p);
  1196. secondpass(p^.right);
  1197. if pushed then restore(p);
  1198. case p^.right^.location.loc of
  1199. LOC_REGISTER : begin
  1200. ind:=p^.right^.location.register;
  1201. case p^.right^.resulttype^.size of
  1202. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1203. $ff,ind)));
  1204. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1205. $ffff,ind)));
  1206. end;
  1207. end;
  1208. LOC_CREGISTER : begin
  1209. ind:=getregister32;
  1210. emit_reg_reg(A_MOVE,S_L,p^.right^.location.register,ind);
  1211. case p^.right^.resulttype^.size of
  1212. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1213. $ff,ind)));
  1214. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1215. $ffff,ind)));
  1216. end;
  1217. end;
  1218. LOC_FLAGS:
  1219. begin
  1220. ind:=getregister32;
  1221. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.right^.location.resflags],S_B,ind)));
  1222. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ff,ind)));
  1223. end
  1224. else { else outer case }
  1225. begin
  1226. del_reference(p^.right^.location.reference);
  1227. ind:=getregister32;
  1228. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  1229. newreference(p^.right^.location.reference),ind)));
  1230. {Booleans are stored in an 8 bit memory location, so
  1231. the use of MOVL is not correct.}
  1232. case p^.right^.resulttype^.size of
  1233. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1234. $ff,ind)));
  1235. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  1236. $ffff,ind)));
  1237. end; { end case }
  1238. end; { end else begin }
  1239. end;
  1240. { produce possible range check code: }
  1241. if cs_check_range in aktlocalswitches then
  1242. begin
  1243. if p^.left^.resulttype^.deftype=arraydef then
  1244. begin
  1245. new(hp);
  1246. reset_reference(hp^);
  1247. parraydef(p^.left^.resulttype)^.genrangecheck;
  1248. hp^.symbol:=stringdup('R_'+tostr(parraydef(p^.left^.resulttype)^.rangenr));
  1249. emit_bounds_check(hp^,ind);
  1250. end;
  1251. end;
  1252. { ------------------------ HANDLE INDEXING ----------------------- }
  1253. { In Motorola 680x0 mode, displacement can only be of 64K max. }
  1254. { Therefore instead of doing a direct displacement, we must first }
  1255. { load the new address into an address register. Therefore the }
  1256. { symbol is not used. }
  1257. if assigned(p^.location.reference.symbol) then
  1258. begin
  1259. if p^.location.reference.base <> R_NO then
  1260. Message(cg_f_secondvecn_base_defined_twice);
  1261. p^.location.reference.base:=getaddressreg;
  1262. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_LEA,S_L,newcsymbol(p^.location.reference.symbol^,0),
  1263. p^.location.reference.base)));
  1264. stringdispose(p^.location.reference.symbol);
  1265. end;
  1266. if (p^.location.reference.index=R_NO) then
  1267. begin
  1268. p^.location.reference.index:=ind;
  1269. calc_emit_mul;
  1270. { here we must check for the offset }
  1271. { and if out of bounds for the motorola }
  1272. { eg: out of signed d8 then reload index }
  1273. { with correct value. }
  1274. if p^.location.reference.offset > 127 then
  1275. begin
  1276. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADD,S_L,p^.location.reference.offset,ind)));
  1277. p^.location.reference.offset := 0;
  1278. end
  1279. else
  1280. if p^.location.reference.offset < -128 then
  1281. begin
  1282. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,S_L,-p^.location.reference.offset,ind)));
  1283. p^.location.reference.offset := 0;
  1284. end;
  1285. end
  1286. else
  1287. begin
  1288. if p^.location.reference.base=R_NO then
  1289. begin
  1290. case p^.location.reference.scalefactor of
  1291. 2 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,p^.location.reference.index)));
  1292. 4 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,2,p^.location.reference.index)));
  1293. 8 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,3,p^.location.reference.index)));
  1294. end;
  1295. calc_emit_mul;
  1296. { we must use address register to put index in base }
  1297. { compare with cgi386.pas }
  1298. reg := getaddressreg;
  1299. p^.location.reference.base := reg;
  1300. emit_reg_reg(A_MOVE,S_L,p^.location.reference.index,reg);
  1301. ungetregister(p^.location.reference.index);
  1302. p^.location.reference.index:=ind;
  1303. end
  1304. else
  1305. begin
  1306. reg := getaddressreg;
  1307. exprasmlist^.concat(new(pai68k,op_ref_reg(
  1308. A_LEA,S_L,newreference(p^.location.reference),
  1309. reg)));
  1310. ungetregister(p^.location.reference.base);
  1311. { the symbol offset is loaded, }
  1312. { so release the symbol name and set symbol }
  1313. { to nil }
  1314. stringdispose(p^.location.reference.symbol);
  1315. p^.location.reference.offset:=0;
  1316. calc_emit_mul;
  1317. p^.location.reference.base:=reg;
  1318. ungetregister32(p^.location.reference.index);
  1319. p^.location.reference.index:=ind;
  1320. end;
  1321. end;
  1322. end;
  1323. end;
  1324. { *************** Converting Types **************** }
  1325. { produces if necessary rangecheckcode }
  1326. procedure maybe_rangechecking(p : ptree;p2,p1 : pdef);
  1327. var
  1328. hp : preference;
  1329. hregister : tregister;
  1330. neglabel,poslabel : plabel;
  1331. begin
  1332. { convert from p2 to p1 }
  1333. { range check from enums is not made yet !!}
  1334. { and its probably not easy }
  1335. if (p1^.deftype<>orddef) or (p2^.deftype<>orddef) then
  1336. exit;
  1337. { range checking is different for u32bit }
  1338. { lets try to generate it allways }
  1339. if (cs_check_range in aktlocalswitches) and
  1340. { with $R+ explicit type conversations in TP aren't range checked! }
  1341. (not(p^.explizit) or not(cs_tp_compatible in aktmoduleswitches)) and
  1342. ((porddef(p1)^.low>porddef(p2)^.low) or
  1343. (porddef(p1)^.high<porddef(p2)^.high) or
  1344. (porddef(p1)^.typ=u32bit) or
  1345. (porddef(p2)^.typ=u32bit)) then
  1346. begin
  1347. porddef(p1)^.genrangecheck;
  1348. if porddef(p2)^.typ=u8bit then
  1349. begin
  1350. if (p^.location.loc=LOC_REGISTER) or
  1351. (p^.location.loc=LOC_CREGISTER) then
  1352. begin
  1353. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_B,p^.location.register,R_D6)));
  1354. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$FF,R_D6)));
  1355. end
  1356. else
  1357. begin
  1358. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,newreference(p^.location.reference),R_D6)));
  1359. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$FF,R_D6)));
  1360. end;
  1361. hregister:=R_D6;
  1362. end
  1363. else if porddef(p2)^.typ=s8bit then
  1364. begin
  1365. if (p^.location.loc=LOC_REGISTER) or
  1366. (p^.location.loc=LOC_CREGISTER) then
  1367. begin
  1368. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_B,p^.location.register,R_D6)));
  1369. { byte to long }
  1370. if aktoptprocessor = MC68020 then
  1371. exprasmlist^.concat(new(pai68k,op_reg(A_EXTB,S_L,R_D6)))
  1372. else
  1373. begin
  1374. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_W,R_D6)));
  1375. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_L,R_D6)));
  1376. end;
  1377. end
  1378. else
  1379. begin
  1380. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,newreference(p^.location.reference),R_D6)));
  1381. { byte to long }
  1382. if aktoptprocessor = MC68020 then
  1383. exprasmlist^.concat(new(pai68k,op_reg(A_EXTB,S_L,R_D6)))
  1384. else
  1385. begin
  1386. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_W,R_D6)));
  1387. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_L,R_D6)));
  1388. end;
  1389. end; { end outermost else }
  1390. hregister:=R_D6;
  1391. end
  1392. { rangechecking for u32bit ?? !!!!!!}
  1393. { lets try }
  1394. else if (porddef(p2)^.typ=s32bit) or (porddef(p2)^.typ=u32bit) then
  1395. begin
  1396. if (p^.location.loc=LOC_REGISTER) or
  1397. (p^.location.loc=LOC_CREGISTER) then
  1398. hregister:=p^.location.register
  1399. else
  1400. begin
  1401. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.location.reference),R_D6)));
  1402. hregister:=R_D6;
  1403. end;
  1404. end
  1405. { rangechecking for u32bit ?? !!!!!!}
  1406. else if porddef(p2)^.typ=u16bit then
  1407. begin
  1408. if (p^.location.loc=LOC_REGISTER) or
  1409. (p^.location.loc=LOC_CREGISTER) then
  1410. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,p^.location.register,R_D6)))
  1411. else
  1412. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.location.reference),R_D6)));
  1413. { unisgned extend }
  1414. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$FFFF,R_D6)));
  1415. hregister:=R_D6;
  1416. end
  1417. else if porddef(p2)^.typ=s16bit then
  1418. begin
  1419. if (p^.location.loc=LOC_REGISTER) or
  1420. (p^.location.loc=LOC_CREGISTER) then
  1421. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,p^.location.register,R_D6)))
  1422. else
  1423. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.location.reference),R_D6)));
  1424. { sign extend }
  1425. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_L,R_D6)));
  1426. hregister:=R_D6;
  1427. end
  1428. else internalerror(6);
  1429. new(hp);
  1430. reset_reference(hp^);
  1431. hp^.symbol:=stringdup('R_'+tostr(porddef(p1)^.rangenr));
  1432. if porddef(p1)^.low>porddef(p1)^.high then
  1433. begin
  1434. getlabel(neglabel);
  1435. getlabel(poslabel);
  1436. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_L,hregister)));
  1437. emitl(A_BLT,neglabel);
  1438. end;
  1439. emit_bounds_check(hp^,hregister);
  1440. if porddef(p1)^.low>porddef(p1)^.high then
  1441. begin
  1442. new(hp);
  1443. reset_reference(hp^);
  1444. hp^.symbol:=stringdup('R_'+tostr(porddef(p1)^.rangenr+1));
  1445. emitl(A_JMP,poslabel);
  1446. emitl(A_LABEL,neglabel);
  1447. emit_bounds_check(hp^,hregister);
  1448. emitl(A_LABEL,poslabel);
  1449. end;
  1450. end;
  1451. end;
  1452. type
  1453. tsecondconvproc = procedure(p,hp : ptree;convtyp : tconverttype);
  1454. procedure second_nothing(p,hp : ptree;convtyp : tconverttype);
  1455. begin
  1456. end;
  1457. procedure second_only_rangecheck(p,hp : ptree;convtyp : tconverttype);
  1458. begin
  1459. maybe_rangechecking(p,hp^.resulttype,p^.resulttype);
  1460. end;
  1461. procedure second_bigger(p,hp : ptree;convtyp : tconverttype);
  1462. var
  1463. hregister : tregister;
  1464. opsize : topsize;
  1465. op : tasmop;
  1466. is_register : boolean;
  1467. begin
  1468. is_register:=p^.left^.location.loc=LOC_REGISTER;
  1469. if not(is_register) and (p^.left^.location.loc<>LOC_CREGISTER) then
  1470. begin
  1471. del_reference(p^.left^.location.reference);
  1472. { we can do this here as we need no temp inside second_bigger }
  1473. ungetiftemp(p^.left^.location.reference);
  1474. end;
  1475. { this is wrong !!!
  1476. gives me movl (%eax),%eax
  1477. for the length(string !!!
  1478. use only for constant values }
  1479. {Constanst cannot be loaded into registers using MOVZX!}
  1480. if (p^.left^.location.loc<>LOC_MEM) or (not p^.left^.location.reference.isintvalue) then
  1481. case convtyp of
  1482. tc_u8bit_2_s32bit,
  1483. tc_u8bit_2_u32bit,
  1484. tc_s8bit_2_u32bit,
  1485. tc_s8bit_2_s16bit,
  1486. tc_s8bit_2_s32bit,
  1487. tc_u8bit_2_u16bit,
  1488. tc_s8bit_2_u16bit,
  1489. tc_u8bit_2_s16bit: begin
  1490. if is_register then
  1491. hregister := p^.left^.location.register
  1492. else
  1493. hregister := getregister32;
  1494. if is_register then
  1495. emit_reg_reg(A_MOVE,S_B,p^.left^.location.register, hregister)
  1496. else
  1497. begin
  1498. if p^.left^.location.loc = LOC_CREGISTER then
  1499. emit_reg_reg(A_MOVE,S_B,p^.left^.location.register,hregister)
  1500. else
  1501. exprasmlist^.concat(new(pai68k, op_ref_reg(A_MOVE,S_B,
  1502. newreference(P^.left^.location.reference), hregister)));
  1503. end;
  1504. case convtyp of
  1505. tc_u8bit_2_s32bit,
  1506. tc_u8bit_2_u32bit:
  1507. exprasmlist^.concat(new(pai68k, op_const_reg(
  1508. A_AND,S_L,$FF,hregister)));
  1509. tc_s8bit_2_u32bit,
  1510. tc_s8bit_2_s32bit:
  1511. begin
  1512. if aktoptprocessor = MC68020 then
  1513. exprasmlist^.concat(new(pai68k,op_reg
  1514. (A_EXTB,S_L,hregister)))
  1515. else { else if aktoptprocessor }
  1516. begin
  1517. { byte to word }
  1518. exprasmlist^.concat(new(pai68k,op_reg
  1519. (A_EXT,S_W,hregister)));
  1520. { word to long }
  1521. exprasmlist^.concat(new(pai68k,op_reg
  1522. (A_EXT,S_L,hregister)));
  1523. end;
  1524. end;
  1525. tc_s8bit_2_u16bit,
  1526. tc_u8bit_2_s16bit,
  1527. tc_u8bit_2_u16bit:
  1528. exprasmlist^.concat(new(pai68k, op_const_reg(
  1529. A_AND,S_W,$FF,hregister)));
  1530. tc_s8bit_2_s16bit:
  1531. exprasmlist^.concat(new(pai68k, op_reg(
  1532. A_EXT, S_W, hregister)));
  1533. end; { inner case }
  1534. end;
  1535. tc_u16bit_2_u32bit,
  1536. tc_u16bit_2_s32bit,
  1537. tc_s16bit_2_u32bit,
  1538. tc_s16bit_2_s32bit: begin
  1539. if is_register then
  1540. hregister := p^.left^.location.register
  1541. else
  1542. hregister := getregister32;
  1543. if is_register then
  1544. emit_reg_reg(A_MOVE,S_W,p^.left^.location.register, hregister)
  1545. else
  1546. begin
  1547. if p^.left^.location.loc = LOC_CREGISTER then
  1548. emit_reg_reg(A_MOVE,S_W,p^.left^.location.register,hregister)
  1549. else
  1550. exprasmlist^.concat(new(pai68k, op_ref_reg(A_MOVE,S_W,
  1551. newreference(P^.left^.location.reference), hregister)));
  1552. end;
  1553. if (convtyp = tc_u16bit_2_s32bit) or
  1554. (convtyp = tc_u16bit_2_u32bit) then
  1555. exprasmlist^.concat(new(pai68k, op_const_reg(
  1556. A_AND, S_L, $ffff, hregister)))
  1557. else { tc_s16bit_2_s32bit }
  1558. { tc_s16bit_2_u32bit }
  1559. exprasmlist^.concat(new(pai68k, op_reg(A_EXT,S_L,
  1560. hregister)));
  1561. end;
  1562. end { end case }
  1563. else
  1564. begin
  1565. case convtyp of
  1566. tc_u8bit_2_s32bit,
  1567. tc_s8bit_2_s32bit,
  1568. tc_u16bit_2_s32bit,
  1569. tc_s16bit_2_s32bit,
  1570. tc_u8bit_2_u32bit,
  1571. tc_s8bit_2_u32bit,
  1572. tc_u16bit_2_u32bit,
  1573. tc_s16bit_2_u32bit:
  1574. begin
  1575. hregister:=getregister32;
  1576. op:=A_MOVE;
  1577. opsize:=S_L;
  1578. end;
  1579. tc_s8bit_2_u16bit,
  1580. tc_s8bit_2_s16bit,
  1581. tc_u8bit_2_s16bit,
  1582. tc_u8bit_2_u16bit:
  1583. begin
  1584. hregister:=getregister32;
  1585. op:=A_MOVE;
  1586. opsize:=S_W;
  1587. end;
  1588. end;
  1589. if is_register then
  1590. begin
  1591. emit_reg_reg(op,opsize,p^.left^.location.register,hregister);
  1592. end
  1593. else
  1594. begin
  1595. if p^.left^.location.loc=LOC_CREGISTER then
  1596. emit_reg_reg(op,opsize,p^.left^.location.register,hregister)
  1597. else exprasmlist^.concat(new(pai68k,op_ref_reg(op,opsize,
  1598. newreference(p^.left^.location.reference),hregister)));
  1599. end;
  1600. end; { end elseif }
  1601. p^.location.loc:=LOC_REGISTER;
  1602. p^.location.register:=hregister;
  1603. maybe_rangechecking(p,p^.left^.resulttype,p^.resulttype);
  1604. end;
  1605. procedure second_string_string(p,hp : ptree;convtyp : tconverttype);
  1606. var
  1607. pushedregs : tpushed;
  1608. begin
  1609. stringdispose(p^.location.reference.symbol);
  1610. gettempofsizereference(p^.resulttype^.size,p^.location.reference);
  1611. del_reference(p^.left^.location.reference);
  1612. copystring(p^.location.reference,p^.left^.location.reference,pstringdef(p^.resulttype)^.len);
  1613. ungetiftemp(p^.left^.location.reference);
  1614. end;
  1615. procedure second_cstring_charpointer(p,hp : ptree;convtyp : tconverttype);
  1616. begin
  1617. p^.location.loc:=LOC_REGISTER;
  1618. p^.location.register:=getregister32;
  1619. inc(p^.left^.location.reference.offset);
  1620. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,newreference(p^.left^.location.reference),
  1621. R_A0)));
  1622. emit_reg_reg(A_MOVE, S_L, R_A0, p^.location.register);
  1623. end;
  1624. procedure second_cchar_charpointer(p,hp : ptree;convtyp : tconverttype);
  1625. begin
  1626. {!!!!}
  1627. p^.location.loc:=LOC_REGISTER;
  1628. p^.location.register:=getregister32;
  1629. inc(p^.left^.location.reference.offset);
  1630. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,newreference(p^.left^.location.reference),
  1631. R_A0)));
  1632. emit_reg_reg(A_MOVE, S_L, R_A0, p^.location.register);
  1633. end;
  1634. procedure second_string_chararray(p,hp : ptree;convtyp : tconverttype);
  1635. begin
  1636. inc(p^.location.reference.offset);
  1637. end;
  1638. procedure second_array_to_pointer(p,hp : ptree;convtyp : tconverttype);
  1639. begin
  1640. del_reference(p^.left^.location.reference);
  1641. p^.location.loc:=LOC_REGISTER;
  1642. p^.location.register:=getregister32;
  1643. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,newreference(p^.left^.location.reference),
  1644. R_A0)));
  1645. emit_reg_reg(A_MOVE,S_L,R_A0, P^.location.register);
  1646. end;
  1647. procedure second_pointer_to_array(p,hp : ptree;convtyp : tconverttype);
  1648. var
  1649. reg: tregister;
  1650. begin
  1651. p^.location.loc:=LOC_REFERENCE;
  1652. clear_reference(p^.location.reference);
  1653. { here, after doing some arithmetic on the pointer }
  1654. { we put it back in an address register }
  1655. if p^.left^.location.loc=LOC_REGISTER then
  1656. begin
  1657. reg := getaddressreg;
  1658. { move the pointer in a data register back into }
  1659. { an address register. }
  1660. emit_reg_reg(A_MOVE, S_L, p^.left^.location.register,reg);
  1661. p^.location.reference.base:=reg;
  1662. ungetregister32(p^.left^.location.register);
  1663. end
  1664. else
  1665. begin
  1666. if p^.left^.location.loc=LOC_CREGISTER then
  1667. begin
  1668. p^.location.reference.base:=getaddressreg;
  1669. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,
  1670. p^.location.reference.base);
  1671. end
  1672. else
  1673. begin
  1674. del_reference(p^.left^.location.reference);
  1675. p^.location.reference.base:=getaddressreg;
  1676. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  1677. p^.location.reference.base)));
  1678. end;
  1679. end;
  1680. end;
  1681. { generates the code for the type conversion from an array of char }
  1682. { to a string }
  1683. procedure second_chararray_to_string(p,hp : ptree;convtyp : tconverttype);
  1684. var
  1685. l : longint;
  1686. begin
  1687. { this is a type conversion which copies the data, so we can't }
  1688. { return a reference }
  1689. p^.location.loc:=LOC_MEM;
  1690. { first get the memory for the string }
  1691. stringdispose(p^.location.reference.symbol);
  1692. gettempofsizereference(256,p^.location.reference);
  1693. { calc the length of the array }
  1694. l:=parraydef(p^.left^.resulttype)^.highrange-
  1695. parraydef(p^.left^.resulttype)^.lowrange+1;
  1696. if l>255 then
  1697. Message(sym_e_type_mismatch);
  1698. { write the length }
  1699. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,S_B,l,
  1700. newreference(p^.location.reference))));
  1701. { copy to first char of string }
  1702. inc(p^.location.reference.offset);
  1703. { generates the copy code }
  1704. { and we need the source never }
  1705. concatcopy(p^.left^.location.reference,p^.location.reference,l,true);
  1706. { correct the string location }
  1707. dec(p^.location.reference.offset);
  1708. end;
  1709. (* procedure second_char_to_string(p,hp : ptree;convtyp : tconverttype);
  1710. begin
  1711. stringdispose(p^.location.reference.symbol);
  1712. gettempofsizereference(256,p^.location.reference);
  1713. { is it a char const ? }
  1714. if p^.left^.treetype=ordconstn then
  1715. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,S_W,p^.left^.value*256+1,newreference(p^.location.reference))))
  1716. else
  1717. begin
  1718. { not so elegant (goes better with extra register }
  1719. { Here the conversion is done in one shot }
  1720. { i.e we convert to a string with a single word which }
  1721. { will be stored, the length followed by the char }
  1722. { This is of course, endian specific. }
  1723. if (p^.left^.location.loc=LOC_REGISTER) or
  1724. (p^.left^.location.loc=LOC_CREGISTER) then
  1725. begin
  1726. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_B,p^.left^.location.register,R_D6)));
  1727. exprasmlist^.concat(new(pai68k, op_const_reg(A_AND, S_W, $FF, R_D6)));
  1728. ungetregister32(p^.left^.location.register);
  1729. end
  1730. else
  1731. begin
  1732. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,newreference(p^.left^.location.reference),R_D6)));
  1733. exprasmlist^.concat(new(pai68k, op_const_reg(A_AND, S_W, $FF, R_D6)));
  1734. del_reference(p^.left^.location.reference);
  1735. end;
  1736. if (aktoptprocessor = MC68020) then
  1737. { alignment is not a problem on the 68020 and higher processors }
  1738. Begin
  1739. { add length of string to word }
  1740. exprasmlist^.concat(new(pai68k,op_const_reg(A_OR,S_W,$0100,R_D6)));
  1741. { put back into mem ... }
  1742. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_W,R_D6,newreference(p^.location.reference))));
  1743. end
  1744. else
  1745. Begin
  1746. { alignment can cause problems }
  1747. { add length of string to ref }
  1748. exprasmlist^.concat(new(pai68k,op_const_ref(A_MOVE,S_B,1,newreference(p^.location.reference))));
  1749. if abs(p^.location.reference.offset) >= 1 then
  1750. Begin
  1751. { temporarily decrease offset }
  1752. Inc(p^.location.reference.offset);
  1753. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_B,R_D6,newreference(p^.location.reference))));
  1754. Dec(p^.location.reference.offset);
  1755. { restore offset }
  1756. end
  1757. else
  1758. Begin
  1759. Comment(V_Debug,'SecondChar2String() internal error.');
  1760. internalerror(34);
  1761. end;
  1762. end;
  1763. end;
  1764. end;*)
  1765. procedure second_char_to_string(p,hp : ptree;convtyp : tconverttype);
  1766. begin
  1767. stringdispose(p^.location.reference.symbol);
  1768. gettempofsizereference(256,p^.location.reference);
  1769. { call loadstring with correct left and right }
  1770. p^.right:=p^.left;
  1771. p^.left:=p;
  1772. loadstring(p);
  1773. p^.left:=nil; { reset left tree, which is empty }
  1774. end;
  1775. procedure second_int_real(p,hp : ptree;convtyp : tconverttype);
  1776. var
  1777. r : preference;
  1778. reg:tregister;
  1779. begin
  1780. emitloadord2reg(p^.left^.location, porddef(p^.left^.resulttype), R_D6, true);
  1781. ungetiftemp(p^.left^.location.reference);
  1782. if porddef(p^.left^.resulttype)^.typ=u32bit then
  1783. push_int(0);
  1784. emit_reg_reg(A_MOVE, S_L, R_D6, R_SPPUSH);
  1785. new(r);
  1786. reset_reference(r^);
  1787. r^.base := R_SP;
  1788. { no emulation }
  1789. { for u32bit a solution would be to push $0 and to load a
  1790. + comp
  1791. + if porddef(p^.left^.resulttype)^.typ=u32bit then
  1792. + exprasmlist^.concat(new(pai386,op_ref(A_FILD,S_IQ,r)))
  1793. + else}
  1794. p^.location.loc := LOC_FPU;
  1795. { get floating point register. }
  1796. if (cs_fp_emulation in aktmoduleswitches) then
  1797. begin
  1798. p^.location.fpureg := getregister32;
  1799. exprasmlist^.concat(new(pai68k, op_ref_reg(A_MOVE, S_L, r, R_D0)));
  1800. emitcall('LONG2SINGLE',true);
  1801. emit_reg_reg(A_MOVE,S_L,R_D0,p^.location.fpureg);
  1802. end
  1803. else
  1804. begin
  1805. p^.location.fpureg := getfloatreg;
  1806. exprasmlist^.concat(new(pai68k, op_ref_reg(A_FMOVE, S_L, r, p^.location.fpureg)))
  1807. end;
  1808. if porddef(p^.left^.resulttype)^.typ=u32bit then
  1809. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADD,S_L,8,R_SP)))
  1810. else
  1811. { restore the stack to the previous address }
  1812. exprasmlist^.concat(new(pai68k, op_const_reg(A_ADDQ, S_L, 4, R_SP)));
  1813. end;
  1814. procedure second_real_fix(p,hp : ptree;convtyp : tconverttype);
  1815. var
  1816. {hs : string;}
  1817. rreg : tregister;
  1818. ref : treference;
  1819. begin
  1820. rreg:=getregister32;
  1821. { Are we in a LOC_FPU, if not then use scratch registers }
  1822. { instead of allocating reserved registers. }
  1823. if (p^.left^.location.loc<>LOC_FPU) then
  1824. begin
  1825. if (cs_fp_emulation in aktmoduleswitches) then
  1826. begin
  1827. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),R_D0)));
  1828. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,65536,R_D1)));
  1829. emitcall('LONGMUL',true);
  1830. emit_reg_reg(A_MOVE,S_L,R_D0,rreg);
  1831. end
  1832. else
  1833. begin
  1834. exprasmlist^.concat(new(pai68k,op_ref_reg(A_FMOVE,S_L,newreference(p^.left^.location.reference),R_FP0)));
  1835. exprasmlist^.concat(new(pai68k,op_const_reg(A_FMUL,S_L,65536,R_FP0)));
  1836. exprasmlist^.concat(new(pai68k,op_reg_reg(A_FMOVE,S_L,R_FP0,rreg)));
  1837. end;
  1838. end
  1839. else
  1840. begin
  1841. if (cs_fp_emulation in aktmoduleswitches) then
  1842. begin
  1843. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,p^.left^.location.fpureg,R_D0)));
  1844. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,65536,R_D1)));
  1845. emitcall('LONGMUL',true);
  1846. emit_reg_reg(A_MOVE,S_L,R_D0,rreg);
  1847. end
  1848. else
  1849. begin
  1850. exprasmlist^.concat(new(pai68k,op_const_reg(A_FMUL,S_L,65536,p^.left^.location.fpureg)));
  1851. exprasmlist^.concat(new(pai68k,op_reg_reg(A_FMOVE,S_L,p^.left^.location.fpureg,rreg)));
  1852. end;
  1853. end;
  1854. p^.location.loc:=LOC_REGISTER;
  1855. p^.location.register:=rreg;
  1856. end;
  1857. procedure second_float_float(p,hp : ptree;convtyp : tconverttype);
  1858. begin
  1859. case p^.left^.location.loc of
  1860. LOC_FPU : begin
  1861. { reload }
  1862. p^.location.loc := LOC_FPU;
  1863. p^.location.fpureg := p^.left^.location.fpureg;
  1864. end;
  1865. LOC_MEM,
  1866. LOC_REFERENCE : floatload(pfloatdef(p^.left^.resulttype)^.typ,
  1867. p^.left^.location.reference,p^.location);
  1868. end;
  1869. { ALREADY HANDLED BY FLOATLOAD }
  1870. { p^.location.loc:=LOC_FPU; }
  1871. end;
  1872. procedure second_fix_real(p,hp : ptree;convtyp : tconverttype);
  1873. var
  1874. startreg : tregister;
  1875. hl : plabel;
  1876. r : treference;
  1877. reg1: tregister;
  1878. hl1,hl2,hl3,hl4,hl5,hl6,hl7,hl8,hl9: plabel;
  1879. begin
  1880. if (p^.left^.location.loc=LOC_REGISTER) or
  1881. (p^.left^.location.loc=LOC_CREGISTER) then
  1882. begin
  1883. startreg:=p^.left^.location.register;
  1884. ungetregister(startreg);
  1885. { move d0,d0 is removed by emit_reg_reg }
  1886. emit_reg_reg(A_MOVE,S_L,startreg,R_D0);
  1887. end
  1888. else
  1889. begin
  1890. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(
  1891. p^.left^.location.reference),R_D0)));
  1892. del_reference(p^.left^.location.reference);
  1893. startreg:=R_NO;
  1894. end;
  1895. reg1 := getregister32;
  1896. { Motorola 68000 equivalent of CDQ }
  1897. { we choose d1:d0 pair for quad word }
  1898. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_L,R_D0)));
  1899. getlabel(hl1);
  1900. emitl(A_BPL,hl1);
  1901. { we copy all bits (-ve number) }
  1902. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,$ffffffff,R_D1)));
  1903. getlabel(hl2);
  1904. emitl(A_BRA,hl2);
  1905. emitl(A_LABEL,hl1);
  1906. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,S_L,R_D0)));
  1907. emitl(A_LABEL,hl2);
  1908. { end CDQ }
  1909. exprasmlist^.concat(new(pai68k,op_reg_reg(A_EOR,S_L,R_D1,R_D0)));
  1910. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,reg1)));
  1911. getlabel(hl3);
  1912. emitl(A_BEQ,hl3);
  1913. { Motorola 68000 equivalent of RCL }
  1914. getlabel(hl4);
  1915. emitl(A_BCC,hl4);
  1916. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,reg1)));
  1917. exprasmlist^.concat(new(pai68k,op_const_reg(A_OR,S_L,1,reg1)));
  1918. getlabel(hl5);
  1919. emitl(A_BRA,hl5);
  1920. emitl(A_LABEL,hl4);
  1921. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,reg1)));
  1922. emitl(A_LABEL,hl5);
  1923. { end RCL }
  1924. { Motorola 68000 equivalent of BSR }
  1925. { save register }
  1926. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,R_D6)));
  1927. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_B,31,R_D0)));
  1928. getlabel(hl6);
  1929. emitl(A_LABEL,hl6);
  1930. exprasmlist^.concat(new(pai68k,op_reg_reg(A_BTST,S_L,R_D0,R_D1)));
  1931. getlabel(hl7);
  1932. emitl(A_BNE,hl7);
  1933. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,S_B,1,R_D0)));
  1934. emitl(A_BPL,hl6);
  1935. { restore register }
  1936. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D6,R_D0)));
  1937. emitl(A_LABEL,hl7);
  1938. { end BSR }
  1939. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_B,32,R_D6)));
  1940. exprasmlist^.concat(new(pai68k,op_reg_reg(A_SUB,S_B,R_D1,R_D6)));
  1941. exprasmlist^.concat(new(pai68k,op_reg_reg(A_LSL,S_L,R_D6,R_D0)));
  1942. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADD,S_W,1007,R_D1)));
  1943. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,5,R_D1)));
  1944. { Motorola 68000 equivalent of SHLD }
  1945. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_W,11,R_D6)));
  1946. { save register }
  1947. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D1,R_A0)));
  1948. getlabel(hl8);
  1949. emitl(A_LABEL,hl8);
  1950. exprasmlist^.concat(new(pai68k,op_const_reg(A_ROXL,S_W,1,R_D1)));
  1951. exprasmlist^.concat(new(pai68k,op_const_reg(A_ROXL,S_W,1,reg1)));
  1952. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,S_B,1,R_D6)));
  1953. emitl(A_BNE,hl8);
  1954. { restore register }
  1955. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A0,R_D1)));
  1956. { end Motorola equivalent of SHLD }
  1957. { Motorola 68000 equivalent of SHLD }
  1958. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_W,20,R_D6)));
  1959. { save register }
  1960. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,R_A0)));
  1961. getlabel(hl9);
  1962. emitl(A_LABEL,hl9);
  1963. exprasmlist^.concat(new(pai68k,op_const_reg(A_ROXL,S_W,1,R_D0)));
  1964. exprasmlist^.concat(new(pai68k,op_const_reg(A_ROXL,S_W,1,reg1)));
  1965. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,S_B,1,R_D6)));
  1966. emitl(A_BNE,hl9);
  1967. { restore register }
  1968. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A0,R_D0)));
  1969. { end Motorola equivalent of SHLD }
  1970. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_B,20,R_D6)));
  1971. exprasmlist^.concat(new(pai68k,op_reg_reg(A_SUB,S_L,R_D6,R_D0)));
  1972. emitl(A_LABEL, hl3);
  1973. { create temp values and put on stack }
  1974. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,reg1,R_SPPUSH)));
  1975. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,R_SPPUSH)));
  1976. reset_reference(r);
  1977. r.base:=R_SP;
  1978. if (cs_fp_emulation in aktmoduleswitches) then
  1979. begin
  1980. p^.location.loc:=LOC_FPU;
  1981. p^.location.fpureg := getregister32;
  1982. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(r),
  1983. p^.left^.location.fpureg)))
  1984. end
  1985. else
  1986. begin
  1987. p^.location.loc:=LOC_FPU;
  1988. p^.location.fpureg := getfloatreg;
  1989. exprasmlist^.concat(new(pai68k,op_ref_reg(A_FMOVE,S_L,newreference(r),
  1990. p^.left^.location.fpureg)))
  1991. end;
  1992. { clear temporary space }
  1993. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADDQ,S_L,8,R_SP)));
  1994. ungetregister32(reg1);
  1995. { Alreadu handled above... }
  1996. { p^.location.loc:=LOC_FPU; }
  1997. end;
  1998. procedure second_int_fix(p,hp : ptree;convtyp : tconverttype);
  1999. var
  2000. {hs : string;}
  2001. hregister : tregister;
  2002. begin
  2003. if (p^.left^.location.loc=LOC_REGISTER) then
  2004. hregister:=p^.left^.location.register
  2005. else if (p^.left^.location.loc=LOC_CREGISTER) then
  2006. hregister:=getregister32
  2007. else
  2008. begin
  2009. del_reference(p^.left^.location.reference);
  2010. hregister:=getregister32;
  2011. case porddef(p^.left^.resulttype)^.typ of
  2012. s8bit : begin
  2013. exprasmlist^.concat(new(pai68k, op_ref_reg(A_MOVE,S_B,
  2014. newreference(p^.left^.location.reference),hregister)));
  2015. if aktoptprocessor = MC68020 then
  2016. exprasmlist^.concat(new(pai68k, op_reg(A_EXTB,S_L,hregister)))
  2017. else
  2018. begin
  2019. exprasmlist^.concat(new(pai68k, op_reg(A_EXT,S_W,hregister)));
  2020. exprasmlist^.concat(new(pai68k, op_reg(A_EXT,S_L,hregister)));
  2021. end;
  2022. end;
  2023. u8bit : begin
  2024. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,newreference(p^.left^.location.reference),
  2025. hregister)));
  2026. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ff,hregister)));
  2027. end;
  2028. s16bit :begin
  2029. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.left^.location.reference),
  2030. hregister)));
  2031. exprasmlist^.concat(new(pai68k,op_reg(A_EXT,S_L,hregister)));
  2032. end;
  2033. u16bit : begin
  2034. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.left^.location.reference),
  2035. hregister)));
  2036. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ffff,hregister)));
  2037. end;
  2038. s32bit,u32bit : exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  2039. hregister)));
  2040. {!!!! u32bit }
  2041. end;
  2042. end;
  2043. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVEQ,S_L,16,R_D1)));
  2044. exprasmlist^.concat(new(pai68k,op_reg_reg(A_LSL,S_L,R_D1,hregister)));
  2045. p^.location.loc:=LOC_REGISTER;
  2046. p^.location.register:=hregister;
  2047. end;
  2048. procedure second_smaller(p,hp : ptree;convtyp : tconverttype);
  2049. var
  2050. hregister,destregister : tregister;
  2051. {opsize : topsize;}
  2052. ref : boolean;
  2053. hpp : preference;
  2054. begin
  2055. { !!!!!!!! Rangechecking }
  2056. ref:=false;
  2057. { problems with enums !! }
  2058. { with $R+ explicit type conversations in TP aren't range checked! }
  2059. if (p^.resulttype^.deftype=orddef) and
  2060. (hp^.resulttype^.deftype=orddef) and
  2061. ((porddef(p^.resulttype)^.low>porddef(hp^.resulttype)^.low) or
  2062. (porddef(p^.resulttype)^.high<porddef(hp^.resulttype)^.high)) then
  2063. begin
  2064. if (cs_check_range in aktlocalswitches) and
  2065. (not(p^.explizit) or not(cs_tp_compatible in aktmoduleswitches)) then
  2066. porddef(p^.resulttype)^.genrangecheck;
  2067. if porddef(hp^.resulttype)^.typ=s32bit then
  2068. begin
  2069. if (p^.location.loc=LOC_REGISTER) or
  2070. (p^.location.loc=LOC_CREGISTER) then
  2071. hregister:=p^.location.register
  2072. else
  2073. begin
  2074. hregister:=getregister32;
  2075. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.location.reference),hregister)));
  2076. end;
  2077. end
  2078. { rangechecking for u32bit ?? !!!!!!}
  2079. else if porddef(hp^.resulttype)^.typ=u16bit then
  2080. begin
  2081. hregister:=getregister32;
  2082. if (p^.location.loc=LOC_REGISTER) or
  2083. (p^.location.loc=LOC_CREGISTER) then
  2084. begin
  2085. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,p^.location.register,hregister)));
  2086. end
  2087. else
  2088. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.location.reference),hregister)));
  2089. { clear unused bits i.e unsigned extend}
  2090. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L, $FFFF, hregister)));
  2091. end
  2092. else if porddef(hp^.resulttype)^.typ=s16bit then
  2093. begin
  2094. hregister:=getregister32;
  2095. if (p^.location.loc=LOC_REGISTER) or
  2096. (p^.location.loc=LOC_CREGISTER) then
  2097. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,p^.location.register,hregister)))
  2098. else
  2099. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,newreference(p^.location.reference),hregister)));
  2100. { sign extend }
  2101. exprasmlist^.concat(new(pai68k,op_reg(A_EXT, S_L, hregister)));
  2102. end
  2103. else internalerror(6);
  2104. if (cs_check_range in aktlocalswitches) and
  2105. (not(p^.explizit) or not(cs_tp_compatible in aktmoduleswitches)) then
  2106. Begin
  2107. new(hpp);
  2108. reset_reference(hpp^);
  2109. hpp^.symbol:=stringdup('R_'+tostr(porddef(p^.resulttype)^.rangenr));
  2110. emit_bounds_check(hpp^, hregister);
  2111. end;
  2112. p^.location.loc:=LOC_REGISTER;
  2113. p^.location.register:=hregister;
  2114. exit;
  2115. end
  2116. { -------------- endian problems once again --------------------}
  2117. { If RIGHT enumdef (32-bit) and we do a typecase to a smaller }
  2118. { type we must absolutely load it into a register first. }
  2119. { --------------------------------------------------------------}
  2120. { ------------ supposing enumdef is always 32-bit --------------}
  2121. { --------------------------------------------------------------}
  2122. else
  2123. if (hp^.resulttype^.deftype = enumdef) and (p^.resulttype^.deftype = orddef) then
  2124. begin
  2125. if (hp^.location.loc=LOC_REGISTER) or (hp^.location.loc=LOC_CREGISTER) then
  2126. hregister:=hp^.location.register
  2127. else
  2128. begin
  2129. hregister:=getregister32;
  2130. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(hp^.location.reference),hregister)));
  2131. end;
  2132. p^.location.loc:=LOC_REGISTER;
  2133. p^.location.register:=hregister;
  2134. exit;
  2135. end;
  2136. if (p^.left^.location.loc=LOC_REGISTER) or
  2137. (p^.left^.location.loc=LOC_CREGISTER) then
  2138. begin
  2139. { handled by secondpas by called routine ??? }
  2140. p^.location.register:=p^.left^.location.register;
  2141. end;
  2142. end;
  2143. procedure second_proc_to_procvar(p,hp : ptree;convtyp : tconverttype);far;
  2144. begin
  2145. secondpass(hp);
  2146. p^.location.loc:=LOC_REGISTER;
  2147. del_reference(hp^.location.reference);
  2148. p^.location.register:=getregister32;
  2149. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  2150. newreference(hp^.location.reference),R_A0)));
  2151. emit_reg_reg(A_MOVE, S_L, R_A0, P^.location.register);
  2152. end;
  2153. procedure second_bool_to_int(p,hp : ptree;convtyp : tconverttype);
  2154. var
  2155. oldtruelabel,oldfalselabel,hlabel : plabel;
  2156. hregister : tregister;
  2157. newsize,
  2158. opsize : topsize;
  2159. op : tasmop;
  2160. begin
  2161. oldtruelabel:=truelabel;
  2162. oldfalselabel:=falselabel;
  2163. getlabel(truelabel);
  2164. getlabel(falselabel);
  2165. secondpass(hp);
  2166. p^.location.loc:=LOC_REGISTER;
  2167. del_reference(hp^.location.reference);
  2168. hregister:=getregister32;
  2169. case porddef(hp^.resulttype)^.typ of
  2170. bool8bit : begin
  2171. case porddef(p^.resulttype)^.typ of
  2172. u8bit,s8bit,
  2173. bool8bit : opsize:=S_B;
  2174. u16bit,s16bit,
  2175. bool16bit : opsize:=S_BW;
  2176. u32bit,s32bit,
  2177. bool32bit : opsize:=S_BL;
  2178. end;
  2179. end;
  2180. bool16bit : begin
  2181. case porddef(p^.resulttype)^.typ of
  2182. u8bit,s8bit,
  2183. bool8bit : opsize:=S_B;
  2184. u16bit,s16bit,
  2185. bool16bit : opsize:=S_W;
  2186. u32bit,s32bit,
  2187. bool32bit : opsize:=S_WL;
  2188. end;
  2189. end;
  2190. bool32bit : begin
  2191. case porddef(p^.resulttype)^.typ of
  2192. u8bit,s8bit,
  2193. bool8bit : opsize:=S_B;
  2194. u16bit,s16bit,
  2195. bool16bit : opsize:=S_W;
  2196. u32bit,s32bit,
  2197. bool32bit : opsize:=S_L;
  2198. end;
  2199. end;
  2200. end;
  2201. op:=A_MOVE;
  2202. { if opsize in [S_B,S_W,S_L] then
  2203. op:=A_MOVE
  2204. else
  2205. if (porddef(p^.resulttype)^.typ in [s8bit,s16bit,s32bit]) then
  2206. op:=A_MOVSX
  2207. else
  2208. op:=A_MOVZX; }
  2209. case porddef(p^.resulttype)^.typ of
  2210. bool8bit,u8bit,s8bit : begin
  2211. p^.location.register:=hregister;
  2212. newsize:=S_B;
  2213. end;
  2214. bool16bit,u16bit,s16bit : begin
  2215. p^.location.register:=hregister;
  2216. newsize:=S_W;
  2217. end;
  2218. bool32bit,u32bit,s32bit : begin
  2219. p^.location.register:=hregister;
  2220. newsize:=S_L;
  2221. end;
  2222. else
  2223. internalerror(10060);
  2224. end;
  2225. case hp^.location.loc of
  2226. LOC_MEM,
  2227. LOC_REFERENCE : exprasmlist^.concat(new(pai68k,op_ref_reg(op,opsize,
  2228. newreference(hp^.location.reference),p^.location.register)));
  2229. LOC_REGISTER,
  2230. LOC_CREGISTER : exprasmlist^.concat(new(pai68k,op_reg_reg(op,opsize,
  2231. hp^.location.register,p^.location.register)));
  2232. LOC_FLAGS : begin
  2233. { hregister:=reg32toreg8(hregister); }
  2234. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[hp^.location.resflags],S_B,hregister)));
  2235. { !!!!!!!!
  2236. case porddef(p^.resulttype)^.typ of
  2237. bool16bit,
  2238. u16bit,s16bit : exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BW,hregister,p^.location.register)));
  2239. bool32bit,
  2240. u32bit,s32bit : exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BL,hregister,p^.location.register)));
  2241. end; }
  2242. end;
  2243. LOC_JUMP : begin
  2244. getlabel(hlabel);
  2245. emitl(A_LABEL,truelabel);
  2246. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,newsize,1,hregister)));
  2247. emitl(A_JMP,hlabel);
  2248. emitl(A_LABEL,falselabel);
  2249. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,newsize,hregister)));
  2250. emitl(A_LABEL,hlabel);
  2251. end;
  2252. else
  2253. internalerror(10061);
  2254. end;
  2255. truelabel:=oldtruelabel;
  2256. falselabel:=oldfalselabel;
  2257. end;
  2258. procedure second_int_to_bool(p,hp : ptree;convtyp : tconverttype);
  2259. var
  2260. hregister : tregister;
  2261. begin
  2262. p^.location.loc:=LOC_REGISTER;
  2263. del_reference(hp^.location.reference);
  2264. case hp^.location.loc of
  2265. LOC_MEM,LOC_REFERENCE :
  2266. begin
  2267. hregister:=getregister32;
  2268. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  2269. newreference(hp^.location.reference),hregister)));
  2270. end;
  2271. LOC_REGISTER,LOC_CREGISTER :
  2272. begin
  2273. hregister:=hp^.location.register;
  2274. end;
  2275. else
  2276. internalerror(10062);
  2277. end;
  2278. exprasmlist^.concat(new(pai68k,op_reg_reg(A_OR,S_L,hregister,hregister)));
  2279. { hregister:=reg32toreg8(hregister); }
  2280. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[hp^.location.resflags],S_B,hregister)));
  2281. case porddef(p^.resulttype)^.typ of
  2282. bool8bit : p^.location.register:=hregister;
  2283. { !!!!!!!!!!!
  2284. bool16bit : begin
  2285. p^.location.register:=reg8toreg16(hregister);
  2286. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BW,hregister,p^.location.register)));
  2287. end;
  2288. bool32bit : begin
  2289. p^.location.register:=reg16toreg32(hregister);
  2290. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BL,hregister,p^.location.register)));
  2291. end; }
  2292. else
  2293. internalerror(10064);
  2294. end;
  2295. end;
  2296. procedure secondtypeconv(var p : ptree);
  2297. const
  2298. secondconvert : array[tc_u8bit_2_s32bit..tc_cchar_charpointer] of
  2299. tsecondconvproc = (second_bigger,second_only_rangecheck,
  2300. second_bigger,second_bigger,second_bigger,
  2301. second_smaller,second_smaller,
  2302. second_smaller,second_string_string,
  2303. second_cstring_charpointer,second_string_chararray,
  2304. second_array_to_pointer,second_pointer_to_array,
  2305. second_char_to_string,second_bigger,
  2306. second_bigger,second_bigger,
  2307. second_smaller,second_smaller,
  2308. second_smaller,second_smaller,
  2309. second_bigger,second_smaller,
  2310. second_only_rangecheck,second_bigger,
  2311. second_bigger,second_bigger,
  2312. second_bigger,second_only_rangecheck,
  2313. second_smaller,second_smaller,
  2314. second_smaller,second_smaller,
  2315. second_bool_to_int,second_int_to_bool,
  2316. second_int_real,second_real_fix,
  2317. second_fix_real,second_int_fix,second_float_float,
  2318. second_chararray_to_string,
  2319. second_proc_to_procvar,
  2320. { is constant char to pchar, is done by firstpass }
  2321. second_nothing);
  2322. begin
  2323. { this isn't good coding, I think tc_bool_2_int, shouldn't be }
  2324. { type conversion (FK) }
  2325. { this is necessary, because second_bool_byte, have to change }
  2326. { true- and false label before calling secondpass }
  2327. if p^.convtyp<>tc_bool_2_int then
  2328. begin
  2329. secondpass(p^.left);
  2330. set_location(p^.location,p^.left^.location);
  2331. end;
  2332. if (p^.convtyp<>tc_equal) and (p^.convtyp<>tc_not_possible) then
  2333. {the second argument only is for maybe_range_checking !}
  2334. secondconvert[p^.convtyp](p,p^.left,p^.convtyp)
  2335. end;
  2336. { save the size of pushed parameter }
  2337. var
  2338. pushedparasize : longint;
  2339. procedure secondcallparan(var p : ptree;defcoll : pdefcoll;
  2340. push_from_left_to_right : boolean);
  2341. var
  2342. size : longint;
  2343. stackref : treference;
  2344. otlabel,hlabel,oflabel : plabel;
  2345. { temporary variables: }
  2346. tempdeftype : tdeftype;
  2347. tempreference : treference;
  2348. r : preference;
  2349. s : topsize;
  2350. op : tasmop;
  2351. reg: tregister;
  2352. begin
  2353. { push from left to right if specified }
  2354. if push_from_left_to_right and assigned(p^.right) then
  2355. secondcallparan(p^.right,defcoll^.next,push_from_left_to_right);
  2356. otlabel:=truelabel;
  2357. oflabel:=falselabel;
  2358. getlabel(truelabel);
  2359. getlabel(falselabel);
  2360. secondpass(p^.left);
  2361. { in codegen.handleread.. defcoll^.data is set to nil }
  2362. if assigned(defcoll^.data) and
  2363. (defcoll^.data^.deftype=formaldef) then
  2364. begin
  2365. { allow @var }
  2366. if p^.left^.treetype=addrn then
  2367. begin
  2368. { allways a register }
  2369. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,p^.left^.location.register,R_SPPUSH)));
  2370. ungetregister32(p^.left^.location.register);
  2371. end
  2372. else
  2373. begin
  2374. if (p^.left^.location.loc<>LOC_REFERENCE) and
  2375. (p^.left^.location.loc<>LOC_MEM) then
  2376. Message(sym_e_type_mismatch)
  2377. else
  2378. begin
  2379. emitpushreferenceaddr(p^.left^.location.reference);
  2380. del_reference(p^.left^.location.reference);
  2381. end;
  2382. end;
  2383. inc(pushedparasize,4);
  2384. end
  2385. { handle call by reference parameter }
  2386. else if (defcoll^.paratyp=vs_var) then
  2387. begin
  2388. if (p^.left^.location.loc<>LOC_REFERENCE) then
  2389. Message(cg_e_var_must_be_reference);
  2390. { open array ? }
  2391. { defcoll^.data can be nil for read/write }
  2392. if assigned(defcoll^.data) and
  2393. is_open_array(defcoll^.data) then
  2394. begin
  2395. { push high }
  2396. if is_open_array(p^.left^.resulttype) then
  2397. begin
  2398. new(r);
  2399. reset_reference(r^);
  2400. r^.base:=highframepointer;
  2401. r^.offset:=highoffset+4;
  2402. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_SPPUSH)));
  2403. end
  2404. else
  2405. push_int(parraydef(p^.left^.resulttype)^.highrange-
  2406. parraydef(p^.left^.resulttype)^.lowrange);
  2407. inc(pushedparasize,4);
  2408. end;
  2409. emitpushreferenceaddr(p^.left^.location.reference);
  2410. del_reference(p^.left^.location.reference);
  2411. inc(pushedparasize,4);
  2412. end
  2413. else
  2414. begin
  2415. tempdeftype:=p^.resulttype^.deftype;
  2416. if tempdeftype=filedef then
  2417. Message(cg_e_file_must_call_by_reference);
  2418. if (defcoll^.paratyp=vs_const) and
  2419. dont_copy_const_param(p^.resulttype) then
  2420. begin
  2421. emitpushreferenceaddr(p^.left^.location.reference);
  2422. del_reference(p^.left^.location.reference);
  2423. inc(pushedparasize,4);
  2424. end
  2425. else
  2426. case p^.left^.location.loc of
  2427. LOC_REGISTER,
  2428. LOC_CREGISTER : begin
  2429. { HERE IS A BIG PROBLEM }
  2430. { --> We *MUST* know the data size to push }
  2431. { for the moment, we can say that the savesize }
  2432. { indicates the parameter size to push, but }
  2433. { that is CERTAINLY NOT TRUE! }
  2434. { CAN WE USE LIKE LOC_MEM OR LOC_REFERENCE?? }
  2435. case integer(p^.left^.resulttype^.savesize) of
  2436. 1 : Begin
  2437. { A byte sized value normally increments }
  2438. { the SP by 2, BUT because how memory has }
  2439. { been setup OR because of GAS, a byte sized }
  2440. { push CRASHES the Amiga, therefore, we do it }
  2441. { by hand instead. }
  2442. { PUSH A WORD SHIFTED LEFT 8 }
  2443. reg := getregister32;
  2444. emit_reg_reg(A_MOVE, S_B, p^.left^.location.register, reg);
  2445. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_W,
  2446. 8, reg)));
  2447. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,
  2448. reg,R_SPPUSH)));
  2449. { offset will be TWO greater }
  2450. inc(pushedparasize,2);
  2451. ungetregister32(reg);
  2452. ungetregister32(p^.left^.location.register);
  2453. end;
  2454. 2 :
  2455. Begin
  2456. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,
  2457. p^.left^.location.register,R_SPPUSH)));
  2458. inc(pushedparasize,2);
  2459. ungetregister32(p^.left^.location.register);
  2460. end;
  2461. 4 : Begin
  2462. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  2463. p^.left^.location.register,R_SPPUSH)));
  2464. inc(pushedparasize,4);
  2465. ungetregister32(p^.left^.location.register);
  2466. end;
  2467. else
  2468. Begin
  2469. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  2470. p^.left^.location.register,R_SPPUSH)));
  2471. inc(pushedparasize,4);
  2472. ungetregister32(p^.left^.location.register);
  2473. end;
  2474. end; { end case }
  2475. end;
  2476. LOC_FPU : begin
  2477. size:=pfloatdef(p^.left^.resulttype)^.size;
  2478. inc(pushedparasize,size);
  2479. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,S_L,size,R_SP)));
  2480. new(r);
  2481. reset_reference(r^);
  2482. r^.base:=R_SP;
  2483. s:=getfloatsize(pfloatdef(p^.left^.resulttype)^.typ);
  2484. if (cs_fp_emulation in aktmoduleswitches) or (s=S_FS) then
  2485. begin
  2486. { when in emulation mode... }
  2487. { only single supported!!! }
  2488. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,
  2489. p^.left^.location.fpureg,r)));
  2490. end
  2491. else
  2492. { convert back from extended to normal type }
  2493. exprasmlist^.concat(new(pai68k,op_reg_ref(A_FMOVE,s,
  2494. p^.left^.location.fpureg,r)));
  2495. end;
  2496. LOC_REFERENCE,LOC_MEM :
  2497. begin
  2498. tempreference:=p^.left^.location.reference;
  2499. del_reference(p^.left^.location.reference);
  2500. case p^.resulttype^.deftype of
  2501. orddef : begin
  2502. case porddef(p^.resulttype)^.typ of
  2503. s32bit,u32bit :
  2504. begin
  2505. emit_push_mem(tempreference);
  2506. inc(pushedparasize,4);
  2507. end;
  2508. s8bit,u8bit,uchar,bool8bit:
  2509. Begin
  2510. { We push a BUT, the SP is incremented by 2 }
  2511. { as specified in the Motorola Prog's Ref Manual }
  2512. { Therefore offet increments BY 2!!! }
  2513. { BUG??? ... }
  2514. { SWAP OPERANDS: }
  2515. if tempreference.isintvalue then
  2516. Begin
  2517. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_W,
  2518. tempreference.offset shl 8,R_SPPUSH)));
  2519. end
  2520. else
  2521. Begin
  2522. { A byte sized value normally increments }
  2523. { the SP by 2, BUT because how memory has }
  2524. { been setup OR because of GAS, a byte sized }
  2525. { push CRASHES the Amiga, therefore, we do it }
  2526. { by hand instead. }
  2527. { PUSH A WORD SHIFTED LEFT 8 }
  2528. reg:=getregister32;
  2529. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,
  2530. newreference(tempreference),reg)));
  2531. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_W,
  2532. 8, reg)));
  2533. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,
  2534. reg,R_SPPUSH)));
  2535. ungetregister32(reg);
  2536. { exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,
  2537. newreference(tempreference),R_SPPUSH))); }
  2538. end;
  2539. inc(pushedparasize,2);
  2540. end;
  2541. s16bit,u16bit : begin
  2542. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,
  2543. newreference(tempreference),R_SPPUSH)));
  2544. inc(pushedparasize,2);
  2545. end;
  2546. end;
  2547. end;
  2548. floatdef : begin
  2549. case pfloatdef(p^.resulttype)^.typ of
  2550. f32bit,
  2551. s32real :
  2552. begin
  2553. emit_push_mem(tempreference);
  2554. inc(pushedparasize,4);
  2555. end;
  2556. s64real:
  2557. {s64bit }
  2558. begin
  2559. inc(tempreference.offset,4);
  2560. emit_push_mem(tempreference);
  2561. dec(tempreference.offset,4);
  2562. emit_push_mem(tempreference);
  2563. inc(pushedparasize,8);
  2564. end;
  2565. {$ifdef use48}
  2566. s48real : begin
  2567. end;
  2568. {$endif}
  2569. s80real : begin
  2570. Message(cg_f_extended_cg68k_not_supported);
  2571. { inc(tempreference.offset,6);
  2572. emit_push_mem(tempreference);
  2573. dec(tempreference.offset,4);
  2574. emit_push_mem(tempreference);
  2575. dec(tempreference.offset,2);
  2576. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,
  2577. newreference(tempreference),R_SPPUSH)));
  2578. inc(pushedparasize,extended_size);}
  2579. end;
  2580. end;
  2581. end;
  2582. pointerdef,procvardef,
  2583. enumdef,classrefdef: begin
  2584. emit_push_mem(tempreference);
  2585. inc(pushedparasize,4);
  2586. end;
  2587. arraydef,recorddef,stringdef,setdef,objectdef :
  2588. begin
  2589. if ((p^.resulttype^.deftype=setdef) and
  2590. (psetdef(p^.resulttype)^.settype=smallset)) then
  2591. begin
  2592. emit_push_mem(tempreference);
  2593. inc(pushedparasize,4);
  2594. end
  2595. else
  2596. begin
  2597. size:=p^.resulttype^.size;
  2598. { Alignment }
  2599. {
  2600. if (size>=4) and ((size and 3)<>0) then
  2601. inc(size,4-(size and 3))
  2602. else if (size>=2) and ((size and 1)<>0) then
  2603. inc(size,2-(size and 1))
  2604. else
  2605. if size=1 then size:=2;
  2606. }
  2607. { create stack space }
  2608. if (size > 0) and (size < 9) then
  2609. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,S_L,size,R_SP)))
  2610. else
  2611. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBA,
  2612. S_L,size,R_SP)));
  2613. inc(pushedparasize,size);
  2614. { create stack reference }
  2615. stackref.symbol := nil;
  2616. clear_reference(stackref);
  2617. stackref.base:=R_SP;
  2618. { produce copy }
  2619. if p^.resulttype^.deftype=stringdef then
  2620. begin
  2621. copystring(stackref,p^.left^.location.reference,
  2622. pstringdef(p^.resulttype)^.len);
  2623. end
  2624. else
  2625. begin
  2626. concatcopy(p^.left^.location.reference,
  2627. stackref,p^.resulttype^.size,true);
  2628. end;
  2629. end;
  2630. end;
  2631. else Message(cg_e_illegal_expression);
  2632. end;
  2633. end;
  2634. LOC_JUMP : begin
  2635. getlabel(hlabel);
  2636. inc(pushedparasize,2);
  2637. emitl(A_LABEL,truelabel);
  2638. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_W,1 shl 8,R_SPPUSH)));
  2639. emitl(A_JMP,hlabel);
  2640. emitl(A_LABEL,falselabel);
  2641. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_W,0,R_SPPUSH)));
  2642. emitl(A_LABEL,hlabel);
  2643. end;
  2644. LOC_FLAGS : begin
  2645. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.left^.location.resflags],S_B,
  2646. R_D0)));
  2647. exprasmlist^.concat(new(pai68k,op_reg(A_NEG, S_B, R_D0)));
  2648. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_W,$ff, R_D0)));
  2649. inc(pushedparasize,2);
  2650. { ----------------- HACK ----------------------- }
  2651. { HERE IS THE BYTE SIZED PUSH HACK ONCE AGAIN }
  2652. { SHIFT LEFT THE BYTE TO MAKE IT WORK! }
  2653. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_W,8, R_D0)));
  2654. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_W,R_D0,R_SPPUSH)));
  2655. end;
  2656. end;
  2657. end;
  2658. truelabel:=otlabel;
  2659. falselabel:=oflabel;
  2660. { push from right to left }
  2661. if not push_from_left_to_right and assigned(p^.right) then
  2662. secondcallparan(p^.right,defcoll^.next,push_from_left_to_right);
  2663. end;
  2664. procedure secondcalln(var p : ptree);
  2665. var
  2666. unusedregisters : tregisterset;
  2667. pushed : tpushed;
  2668. funcretref : treference;
  2669. hregister : tregister;
  2670. oldpushedparasize : longint;
  2671. { true if a5 must be loaded again after the subroutine }
  2672. loada5 : boolean;
  2673. { true if a virtual method must be called directly }
  2674. no_virtual_call : boolean;
  2675. { true if we produce a con- or destrutor in a call }
  2676. is_con_or_destructor : boolean;
  2677. { true if a constructor is called again }
  2678. extended_new : boolean;
  2679. { adress returned from an I/O-error }
  2680. iolabel : plabel;
  2681. { lexlevel count }
  2682. i : longint;
  2683. { help reference pointer }
  2684. r : preference;
  2685. pp,params : ptree;
  2686. { temp register allocation }
  2687. reg: tregister;
  2688. { help reference pointer }
  2689. ref: preference;
  2690. label
  2691. dont_call;
  2692. begin
  2693. extended_new:=false;
  2694. iolabel:=nil;
  2695. loada5:=true;
  2696. no_virtual_call:=false;
  2697. unusedregisters:=unused;
  2698. if not assigned(p^.procdefinition) then
  2699. exit;
  2700. { only if no proc var }
  2701. if not(assigned(p^.right)) then
  2702. is_con_or_destructor:=((p^.procdefinition^.options and poconstructor)<>0)
  2703. or ((p^.procdefinition^.options and podestructor)<>0);
  2704. { proc variables destroy all registers }
  2705. if (p^.right=nil) and
  2706. { virtual methods too }
  2707. ((p^.procdefinition^.options and povirtualmethod)=0) then
  2708. begin
  2709. if ((p^.procdefinition^.options and poiocheck)<>0)
  2710. and (cs_check_io in aktlocalswitches) then
  2711. begin
  2712. getlabel(iolabel);
  2713. emitl(A_LABEL,iolabel);
  2714. end
  2715. else iolabel:=nil;
  2716. { save all used registers }
  2717. pushusedregisters(pushed,p^.procdefinition^.usedregisters);
  2718. { give used registers through }
  2719. usedinproc:=usedinproc or p^.procdefinition^.usedregisters;
  2720. end
  2721. else
  2722. begin
  2723. pushusedregisters(pushed,$ffff);
  2724. usedinproc:=$ffff;
  2725. { no IO check for methods and procedure variables }
  2726. iolabel:=nil;
  2727. end;
  2728. { generate the code for the parameter and push them }
  2729. oldpushedparasize:=pushedparasize;
  2730. pushedparasize:=0;
  2731. if (p^.resulttype<>pdef(voiddef)) and
  2732. ret_in_param(p^.resulttype) then
  2733. begin
  2734. funcretref.symbol:=nil;
  2735. {$ifdef test_dest_loc}
  2736. if dest_loc_known and (dest_loc_tree=p) and
  2737. (dest_loc.loc in [LOC_REFERENCE,LOC_MEM]) then
  2738. begin
  2739. funcretref:=dest_loc.reference;
  2740. if assigned(dest_loc.reference.symbol) then
  2741. funcretref.symbol:=stringdup(dest_loc.reference.symbol^);
  2742. in_dest_loc:=true;
  2743. end
  2744. else
  2745. {$endif test_dest_loc}
  2746. gettempofsizereference(p^.procdefinition^.retdef^.size,funcretref);
  2747. end;
  2748. if assigned(p^.left) then
  2749. begin
  2750. pushedparasize:=0;
  2751. { be found elsewhere }
  2752. if assigned(p^.right) then
  2753. secondcallparan(p^.left,pprocvardef(p^.right^.resulttype)^.para1,
  2754. (p^.procdefinition^.options and poleftright)<>0)
  2755. else
  2756. secondcallparan(p^.left,p^.procdefinition^.para1,
  2757. (p^.procdefinition^.options and poleftright)<>0);
  2758. end;
  2759. params:=p^.left;
  2760. p^.left:=nil;
  2761. if ret_in_param(p^.resulttype) then
  2762. begin
  2763. emitpushreferenceaddr(funcretref);
  2764. inc(pushedparasize,4);
  2765. end;
  2766. { overloaded operator have no symtable }
  2767. if (p^.right=nil) then
  2768. begin
  2769. { push self }
  2770. if assigned(p^.symtable) and
  2771. (p^.symtable^.symtabletype=withsymtable) then
  2772. begin
  2773. { dirty trick to avoid the secondcall below }
  2774. p^.methodpointer:=genzeronode(callparan);
  2775. p^.methodpointer^.location.loc:=LOC_REGISTER;
  2776. p^.methodpointer^.location.register:=R_A5;
  2777. { make a reference }
  2778. new(r);
  2779. reset_reference(r^);
  2780. r^.offset:=p^.symtable^.datasize;
  2781. r^.base:=procinfo.framepointer;
  2782. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_A5)));
  2783. end;
  2784. { push self }
  2785. if assigned(p^.symtable) and
  2786. ((p^.symtable^.symtabletype=objectsymtable) or
  2787. (p^.symtable^.symtabletype=withsymtable)) then
  2788. begin
  2789. if assigned(p^.methodpointer) then
  2790. begin
  2791. case p^.methodpointer^.treetype of
  2792. typen : begin
  2793. { direct call to inherited method }
  2794. if (p^.procdefinition^.options and poabstractmethod)<>0 then
  2795. begin
  2796. Message(cg_e_cant_call_abstract_method);
  2797. goto dont_call;
  2798. end;
  2799. { generate no virtual call }
  2800. no_virtual_call:=true;
  2801. if (p^.symtableprocentry^.properties and sp_static)<>0 then
  2802. begin
  2803. { well lets put the VMT address directly into a5 }
  2804. { it is kind of dirty but that is the simplest }
  2805. { way to accept virtual static functions (PM) }
  2806. loada5:=true;
  2807. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_MOVE,S_L,
  2808. newcsymbol(pobjectdef(p^.methodpointer^.resulttype)^.vmt_mangledname,0),R_A5)));
  2809. concat_external(pobjectdef(p^.methodpointer^.resulttype)^.vmt_mangledname,EXT_NEAR);
  2810. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A5,R_SPPUSH)));
  2811. end
  2812. else
  2813. { this is a member call, so A5 isn't modfied }
  2814. loada5:=false;
  2815. if not(is_con_or_destructor and
  2816. pobjectdef(p^.methodpointer^.resulttype)^.isclass and
  2817. assigned(aktprocsym) and
  2818. ((aktprocsym^.definition^.options and
  2819. (poconstructor or podestructor))<>0)) then
  2820. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A5,R_SPPUSH)));
  2821. { if an inherited con- or destructor should be }
  2822. { called in a con- or destructor then a warning }
  2823. { will be made }
  2824. { con- and destructors need a pointer to the vmt }
  2825. if is_con_or_destructor and
  2826. ((pobjectdef(p^.methodpointer^.resulttype)^.options and oois_class)=0) and
  2827. assigned(aktprocsym) then
  2828. begin
  2829. if not ((aktprocsym^.definition^.options
  2830. and (poconstructor or podestructor))<>0) then
  2831. Message(cg_w_member_cd_call_from_method);
  2832. end;
  2833. { con- and destructors need a pointer to the vmt }
  2834. if is_con_or_destructor then
  2835. begin
  2836. { classes need the mem ! }
  2837. if ((pobjectdef(p^.methodpointer^.resulttype)^.options and
  2838. oois_class)=0) then
  2839. push_int(0)
  2840. else
  2841. begin
  2842. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,
  2843. S_L,newcsymbol(pobjectdef(p^.methodpointer^.
  2844. resulttype)^.vmt_mangledname,0))));
  2845. concat_external(pobjectdef(p^.methodpointer^.resulttype)^.
  2846. vmt_mangledname,EXT_NEAR);
  2847. end;
  2848. end;
  2849. end;
  2850. hnewn : begin
  2851. { extended syntax of new }
  2852. { A5 must be zero }
  2853. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,0,R_A5)));
  2854. emit_reg_reg(A_MOVE,S_L,R_A5, R_SPPUSH);
  2855. { insert the vmt }
  2856. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,S_L,
  2857. newcsymbol(pobjectdef(p^.methodpointer^.resulttype)^.vmt_mangledname,0))));
  2858. concat_external(pobjectdef(p^.methodpointer^.resulttype)^.vmt_mangledname,EXT_NEAR);
  2859. extended_new:=true;
  2860. end;
  2861. hdisposen : begin
  2862. secondpass(p^.methodpointer);
  2863. { destructor with extended syntax called from dispose }
  2864. { hdisposen always deliver LOC_REFRENZ }
  2865. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  2866. newreference(p^.methodpointer^.location.reference),R_A5)));
  2867. del_reference(p^.methodpointer^.location.reference);
  2868. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A5,R_SPPUSH)));
  2869. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,S_L,
  2870. newcsymbol(pobjectdef
  2871. (p^.methodpointer^.resulttype)^.vmt_mangledname,0))));
  2872. concat_external(pobjectdef(p^.methodpointer^.resulttype)^.vmt_mangledname,EXT_NEAR);
  2873. end;
  2874. else
  2875. begin
  2876. { call to a instance member }
  2877. if (p^.symtable^.symtabletype<>withsymtable) then
  2878. begin
  2879. secondpass(p^.methodpointer);
  2880. case p^.methodpointer^.location.loc of
  2881. LOC_REGISTER :
  2882. begin
  2883. ungetregister32(p^.methodpointer^.location.register);
  2884. emit_reg_reg(A_MOVE,S_L,p^.methodpointer^.location.register,R_A5);
  2885. end;
  2886. else
  2887. begin
  2888. if (p^.methodpointer^.resulttype^.deftype=objectdef) and
  2889. pobjectdef(p^.methodpointer^.resulttype)^.isclass then
  2890. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  2891. newreference(p^.methodpointer^.location.reference),R_A5)))
  2892. else
  2893. Begin
  2894. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  2895. newreference(p^.methodpointer^.location.reference),R_A5)));
  2896. end;
  2897. del_reference(p^.methodpointer^.location.reference);
  2898. end;
  2899. end;
  2900. end;
  2901. { when calling a class method, we have
  2902. to load ESI with the VMT !
  2903. But that's wrong, if we call a class method via self
  2904. }
  2905. if ((p^.procdefinition^.options and poclassmethod)<>0)
  2906. and not(p^.methodpointer^.treetype=selfn) then
  2907. begin
  2908. { class method needs current VMT }
  2909. new(r);
  2910. reset_reference(r^);
  2911. r^.base:=R_A5;
  2912. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_A5)));
  2913. end;
  2914. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A5,R_SPPUSH)));
  2915. if is_con_or_destructor then
  2916. begin
  2917. { classes don't get a VMT pointer pushed }
  2918. if (p^.methodpointer^.resulttype^.deftype=objectdef) and
  2919. not(pobjectdef(p^.methodpointer^.resulttype)^.isclass) then
  2920. begin
  2921. if ((p^.procdefinition^.options and poconstructor)<>0) then
  2922. begin
  2923. { it's no bad idea, to insert the VMT }
  2924. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,S_L,
  2925. newcsymbol(pobjectdef(
  2926. p^.methodpointer^.resulttype)^.vmt_mangledname,0))));
  2927. concat_external(pobjectdef(
  2928. p^.methodpointer^.resulttype)^.vmt_mangledname,EXT_NEAR);
  2929. end
  2930. { destructors haven't to dispose the instance, if this is }
  2931. { a direct call }
  2932. else
  2933. push_int(0);
  2934. end;
  2935. end;
  2936. end;
  2937. end;
  2938. end
  2939. else
  2940. begin
  2941. if ((p^.procdefinition^.options and poclassmethod)<>0) and
  2942. not(
  2943. assigned(aktprocsym) and
  2944. ((aktprocsym^.definition^.options and poclassmethod)<>0)
  2945. ) then
  2946. begin
  2947. { class method needs current VMT }
  2948. new(r);
  2949. reset_reference(r^);
  2950. r^.base:=R_A5;
  2951. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_A5)));
  2952. end
  2953. else
  2954. begin
  2955. { member call, A5 isn't modified }
  2956. loada5:=false;
  2957. end;
  2958. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_A5,R_SPPUSH)));
  2959. { but a con- or destructor here would probably almost }
  2960. { always be placed wrong }
  2961. if is_con_or_destructor then
  2962. begin
  2963. Message(cg_w_member_cd_call_from_method);
  2964. { not insert VMT pointer } { VMT-Zeiger nicht eintragen }
  2965. push_int(0);
  2966. end;
  2967. end;
  2968. end;
  2969. { push base pointer ?}
  2970. if (lexlevel>1) and assigned(pprocdef(p^.procdefinition)^.parast) and
  2971. ((p^.procdefinition^.parast^.symtablelevel)>2) then
  2972. begin
  2973. { if we call a nested function in a method, we must }
  2974. { push also SELF! }
  2975. { THAT'S NOT TRUE, we have to load ESI via frame pointer }
  2976. { access }
  2977. {
  2978. begin
  2979. loadesi:=false;
  2980. exprasmlist^.concat(new(pai68k,op_reg(A_PUSH,S_L,R_ESI)));
  2981. end;
  2982. }
  2983. if lexlevel=(p^.procdefinition^.parast^.symtablelevel) then
  2984. begin
  2985. new(r);
  2986. reset_reference(r^);
  2987. r^.offset:=procinfo.framepointer_offset;
  2988. r^.base:=procinfo.framepointer;
  2989. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_SPPUSH)))
  2990. end
  2991. { this is only true if the difference is one !!
  2992. but it cannot be more !! }
  2993. else if lexlevel=(p^.procdefinition^.parast^.symtablelevel)-1 then
  2994. begin
  2995. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,procinfo.framepointer,R_SPPUSH)))
  2996. end
  2997. else if lexlevel>(p^.procdefinition^.parast^.symtablelevel) then
  2998. begin
  2999. hregister:=getaddressreg;
  3000. new(r);
  3001. reset_reference(r^);
  3002. r^.offset:=procinfo.framepointer_offset;
  3003. r^.base:=procinfo.framepointer;
  3004. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,hregister)));
  3005. for i:=(p^.procdefinition^.parast^.symtablelevel) to lexlevel-1 do
  3006. begin
  3007. new(r);
  3008. reset_reference(r^);
  3009. {we should get the correct frame_pointer_offset at each level
  3010. how can we do this !!! }
  3011. r^.offset:=procinfo.framepointer_offset;
  3012. r^.base:=hregister;
  3013. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,hregister)));
  3014. end;
  3015. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,hregister,R_SPPUSH)));
  3016. ungetregister32(hregister);
  3017. end
  3018. else
  3019. internalerror(25000);
  3020. end;
  3021. { exported methods should be never called direct }
  3022. if (p^.procdefinition^.options and poexports)<>0 then
  3023. Message(cg_e_dont_call_exported_direct);
  3024. if ((p^.procdefinition^.options and povirtualmethod)<>0) and
  3025. not(no_virtual_call) then
  3026. begin
  3027. { static functions contain the vmt_address in ESI }
  3028. { also class methods }
  3029. if assigned(aktprocsym) then
  3030. begin
  3031. if ((aktprocsym^.properties and sp_static)<>0) or
  3032. ((aktprocsym^.definition^.options and poclassmethod)<>0) or
  3033. ((p^.procdefinition^.options and postaticmethod)<>0) or
  3034. { A5 is already loaded }
  3035. ((p^.procdefinition^.options and poclassmethod)<>0)then
  3036. begin
  3037. new(r);
  3038. reset_reference(r^);
  3039. r^.base:=R_a5;
  3040. end
  3041. else
  3042. begin
  3043. new(r);
  3044. reset_reference(r^);
  3045. r^.base:=R_a5;
  3046. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_a0)));
  3047. new(r);
  3048. reset_reference(r^);
  3049. r^.base:=R_a0;
  3050. end;
  3051. end
  3052. else
  3053. begin
  3054. new(r);
  3055. reset_reference(r^);
  3056. r^.base:=R_a5;
  3057. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,R_a0)));
  3058. new(r);
  3059. reset_reference(r^);
  3060. r^.base:=R_a0;
  3061. end;
  3062. if p^.procdefinition^.extnumber=-1 then
  3063. internalerror($Da);
  3064. r^.offset:=p^.procdefinition^.extnumber*4+12;
  3065. if (cs_check_range in aktlocalswitches) then
  3066. begin
  3067. { If the base is already A0, the no instruction will }
  3068. { be emitted! }
  3069. emit_reg_reg(A_MOVE,S_L,r^.base,R_A0);
  3070. emitcall('CHECK_OBJECT',true);
  3071. end;
  3072. { This was wrong we must then load the address into the }
  3073. { register a0 and/or a5 }
  3074. { Because doing an indirect call with offset is NOT }
  3075. { allowed on the m68k! }
  3076. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(r^),R_A0)));
  3077. { clear the reference }
  3078. reset_reference(r^);
  3079. r^.base := R_A0;
  3080. exprasmlist^.concat(new(pai68k,op_ref(A_JSR,S_NO,r)));
  3081. end
  3082. else if (p^.procdefinition^.options and popalmossyscall)<>0 then
  3083. begin
  3084. exprasmlist^.concat(new(pai68k,op_const(A_TRAP,S_NO,15)));
  3085. exprasmlist^.concat(new(pai_const,init_16bit(p^.procdefinition^.extnumber)));
  3086. end
  3087. else
  3088. emitcall(p^.procdefinition^.mangledname,
  3089. p^.symtableproc^.symtabletype=unitsymtable);
  3090. if ((p^.procdefinition^.options and poclearstack)<>0) then
  3091. begin
  3092. if (pushedparasize > 0) and (pushedparasize < 9) then
  3093. { restore the stack, to its initial value }
  3094. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADDQ,S_L,pushedparasize,R_SP)))
  3095. else
  3096. { restore the stack, to its initial value }
  3097. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADDA,S_L,pushedparasize,R_SP)));
  3098. end;
  3099. end
  3100. else
  3101. begin
  3102. secondpass(p^.right);
  3103. case p^.right^.location.loc of
  3104. LOC_REGISTER,
  3105. LOC_CREGISTER : begin
  3106. if p^.right^.location.register in [R_D0..R_D7] then
  3107. begin
  3108. reg := getaddressreg;
  3109. emit_reg_reg(A_MOVE,S_L,p^.right^.location.register,reg);
  3110. new(ref);
  3111. reset_reference(ref^);
  3112. ref^.base := reg;
  3113. exprasmlist^.concat(new(pai68k,op_ref(A_JSR,S_NO,ref)));
  3114. ungetregister(reg);
  3115. end
  3116. else
  3117. begin
  3118. new(ref);
  3119. reset_reference(ref^);
  3120. ref^.base := p^.right^.location.register;
  3121. exprasmlist^.concat(new(pai68k,op_ref(A_JSR,S_NO,ref)));
  3122. end;
  3123. ungetregister32(p^.right^.location.register);
  3124. end
  3125. else
  3126. begin
  3127. if assigned(p^.right^.location.reference.symbol) then
  3128. { Here we have a symbolic name to the routine, so solve }
  3129. { problem by loading the address first, and then emitting }
  3130. { the call. }
  3131. begin
  3132. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3133. newreference(p^.right^.location.reference),R_A1)));
  3134. new(ref);
  3135. reset_reference(ref^);
  3136. ref^.base := R_A1;
  3137. exprasmlist^.concat(new(pai68k,op_ref(A_JSR,S_NO,newreference(ref^))));
  3138. end
  3139. else
  3140. begin
  3141. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3142. newreference(p^.right^.location.reference),R_A1)));
  3143. new(ref);
  3144. reset_reference(ref^);
  3145. ref^.base := R_A1;
  3146. exprasmlist^.concat(new(pai68k,op_ref(A_JSR,S_NO,newreference(ref^))));
  3147. end;
  3148. del_reference(p^.right^.location.reference);
  3149. end;
  3150. end;
  3151. end;
  3152. dont_call:
  3153. pushedparasize:=oldpushedparasize;
  3154. unused:=unusedregisters;
  3155. { handle function results }
  3156. if p^.resulttype<>pdef(voiddef) then
  3157. begin
  3158. { a contructor could be a function with boolean result }
  3159. if (p^.right=nil) and
  3160. ((p^.procdefinition^.options and poconstructor)<>0) and
  3161. { quick'n'dirty check if it is a class or an object }
  3162. (p^.resulttype^.deftype=orddef) then
  3163. begin
  3164. p^.location.loc:=LOC_FLAGS;
  3165. p^.location.resflags:=F_NE;
  3166. if extended_new then
  3167. begin
  3168. {$ifdef test_dest_loc}
  3169. if dest_loc_known and (dest_loc_tree=p) then
  3170. mov_reg_to_dest(p,S_L,R_EAX)
  3171. else
  3172. {$endif test_dest_loc}
  3173. hregister:=getregister32;
  3174. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3175. p^.location.register:=hregister;
  3176. end;
  3177. end
  3178. { structed results are easy to handle.... }
  3179. else if ret_in_param(p^.resulttype) then
  3180. begin
  3181. p^.location.loc:=LOC_MEM;
  3182. stringdispose(p^.location.reference.symbol);
  3183. p^.location.reference:=funcretref;
  3184. end
  3185. else
  3186. begin
  3187. if (p^.resulttype^.deftype=orddef) then
  3188. begin
  3189. p^.location.loc:=LOC_REGISTER;
  3190. case porddef(p^.resulttype)^.typ of
  3191. s32bit,u32bit :
  3192. begin
  3193. hregister:=getregister32;
  3194. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3195. p^.location.register:=hregister;
  3196. end;
  3197. uchar,u8bit,bool8bit,s8bit :
  3198. begin
  3199. hregister:=getregister32;
  3200. emit_reg_reg(A_MOVE,S_B,R_D0,hregister);
  3201. p^.location.register:=hregister;
  3202. end;
  3203. s16bit,u16bit :
  3204. begin
  3205. hregister:=getregister32;
  3206. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3207. p^.location.register:=hregister;
  3208. end;
  3209. else internalerror(7);
  3210. end
  3211. end
  3212. else if (p^.resulttype^.deftype=floatdef) then
  3213. case pfloatdef(p^.resulttype)^.typ of
  3214. f32bit :
  3215. begin
  3216. p^.location.loc:=LOC_REGISTER;
  3217. hregister:=getregister32;
  3218. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3219. p^.location.register:=hregister;
  3220. end;
  3221. s32real : Begin
  3222. p^.location.loc:=LOC_FPU;
  3223. hregister:=getregister32;
  3224. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3225. p^.location.fpureg:=hregister;
  3226. end;
  3227. s64bit,s64real,s80real: begin
  3228. if cs_fp_emulation in aktmoduleswitches then
  3229. begin
  3230. p^.location.loc:=LOC_FPU;
  3231. hregister:=getregister32;
  3232. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3233. p^.location.fpureg:=hregister;
  3234. end
  3235. else
  3236. begin
  3237. { TRUE FPU mode }
  3238. p^.location.loc:=LOC_FPU;
  3239. { on exit of function result in R_FP0 }
  3240. p^.location.fpureg:=R_FP0;
  3241. end;
  3242. end;
  3243. else
  3244. begin
  3245. p^.location.loc:=LOC_FPU;
  3246. p^.location.fpureg:=R_FP0;
  3247. end;
  3248. end {end case }
  3249. else
  3250. begin
  3251. p^.location.loc:=LOC_REGISTER;
  3252. hregister:=getregister32;
  3253. emit_reg_reg(A_MOVE,S_L,R_D0,hregister);
  3254. p^.location.register:=hregister;
  3255. end;
  3256. end;
  3257. end;
  3258. { perhaps i/o check ? }
  3259. if iolabel<>nil then
  3260. begin
  3261. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,S_L,newcsymbol(lab2str(iolabel),0))));
  3262. { this was wrong, probably an error due to diff3
  3263. emitcall(p^.procdefinition^.mangledname);}
  3264. emitcall('IOCHECK',true);
  3265. end;
  3266. { restore registers }
  3267. popusedregisters(pushed);
  3268. { at last, restore instance pointer (SELF) }
  3269. if loada5 then
  3270. maybe_loada5;
  3271. pp:=params;
  3272. while assigned(pp) do
  3273. begin
  3274. if assigned(pp^.left) then
  3275. if (pp^.left^.location.loc=LOC_REFERENCE) or
  3276. (pp^.left^.location.loc=LOC_MEM) then
  3277. ungetiftemp(pp^.left^.location.reference);
  3278. pp:=pp^.right;
  3279. end;
  3280. disposetree(params);
  3281. end;
  3282. { reverts the parameter list }
  3283. var nb_para : integer;
  3284. function reversparameter(p : ptree) : ptree;
  3285. var
  3286. hp1,hp2 : ptree;
  3287. begin
  3288. hp1:=nil;
  3289. nb_para := 0;
  3290. while assigned(p) do
  3291. begin
  3292. { pull out }
  3293. hp2:=p;
  3294. p:=p^.right;
  3295. inc(nb_para);
  3296. { pull in }
  3297. hp2^.right:=hp1;
  3298. hp1:=hp2;
  3299. end;
  3300. reversparameter:=hp1;
  3301. end;
  3302. procedure secondloadvmt(var p : ptree);
  3303. begin
  3304. p^.location.loc:=LOC_REGISTER;
  3305. p^.location.register:=getregister32;
  3306. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_MOVE,
  3307. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  3308. p^.location.register)));
  3309. end;
  3310. procedure secondinline(var p : ptree);
  3311. const
  3312. {$ifdef OLDINC}
  3313. in2size:array[in_inc_byte..in_dec_dword] of Topsize=
  3314. (S_B,S_W,S_L,S_B,S_W,S_L);
  3315. in2instr:array[in_inc_byte..in_dec_dword] of Tasmop=
  3316. (A_ADDQ,A_ADDQ,A_ADDQ,A_SUBQ,A_SUBQ,A_SUBQ);
  3317. {$endif}
  3318. { tfloattype = (f32bit,s32real,s64real,s80real,s64bit); }
  3319. float_name: array[tfloattype] of string[8]=
  3320. { ('FIXED','SINGLE','REAL','EXTENDED','COMP','FIXED'); }
  3321. { Since we only support the REAL (SINGLE IEEE) FLOAT }
  3322. { type, here is what we do... }
  3323. ('FIXED','REAL','REAL','REAL','COMP','FIXED');
  3324. addsubop:array[in_inc_x..in_dec_x] of tasmop=(A_ADDQ,A_SUBQ);
  3325. var
  3326. opsize: topsize;
  3327. asmop: tasmop;
  3328. aktfile : treference;
  3329. ft : tfiletype;
  3330. pushed : tpushed;
  3331. dummycoll : tdefcoll;
  3332. procedure handlereadwrite(doread,doln : boolean);
  3333. { produces code for READ(LN) and WRITE(LN) }
  3334. procedure loadstream;
  3335. const io:array[0..1] of string[7]=('_OUTPUT','_INPUT');
  3336. var r : preference;
  3337. begin
  3338. new(r);
  3339. reset_reference(r^);
  3340. r^.symbol:=stringdup('U_'+upper(target_info.system_unit)+io[byte(doread)]);
  3341. if not (cs_compilesystem in aktmoduleswitches) then
  3342. concat_external(r^.symbol^,EXT_NEAR);
  3343. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,r,R_A0)))
  3344. end;
  3345. var
  3346. node,hp : ptree;
  3347. typedtyp,pararesult : pdef;
  3348. has_length : boolean;
  3349. dummycoll : tdefcoll;
  3350. iolabel : plabel;
  3351. npara : longint;
  3352. begin
  3353. { I/O check }
  3354. if cs_check_io in aktlocalswitches then
  3355. begin
  3356. getlabel(iolabel);
  3357. emitl(A_LABEL,iolabel);
  3358. end
  3359. else iolabel:=nil;
  3360. { for write of real with the length specified }
  3361. has_length:=false;
  3362. hp:=nil;
  3363. { reserve temporary pointer to data variable }
  3364. aktfile.symbol:=nil;
  3365. gettempofsizereference(4,aktfile);
  3366. { first state text data }
  3367. ft:=ft_text;
  3368. { and state a parameter ? }
  3369. if p^.left=nil then
  3370. begin
  3371. { the following instructions are for "writeln;" }
  3372. loadstream;
  3373. { save @Dateivarible in temporary variable }
  3374. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,R_A0,newreference(aktfile))));
  3375. end
  3376. else
  3377. begin
  3378. { revers paramters }
  3379. node:=reversparameter(p^.left);
  3380. p^.left := node;
  3381. npara := nb_para;
  3382. { calculate data variable }
  3383. { is first parameter a file type ? }
  3384. if node^.left^.resulttype^.deftype=filedef then
  3385. begin
  3386. ft:=pfiledef(node^.left^.resulttype)^.filetype;
  3387. if ft=ft_typed then
  3388. typedtyp:=pfiledef(node^.left^.resulttype)^.typed_as;
  3389. secondpass(node^.left);
  3390. if codegenerror then
  3391. exit;
  3392. { save reference in temporary variables } { reference in tempor„re Variable retten }
  3393. if node^.left^.location.loc<>LOC_REFERENCE then
  3394. begin
  3395. Message(cg_e_illegal_expression);
  3396. exit;
  3397. end;
  3398. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,newreference(node^.left^.location.reference),R_A0)));
  3399. { skip to the next parameter }
  3400. node:=node^.right;
  3401. end
  3402. else
  3403. begin
  3404. { load stdin/stdout stream }
  3405. loadstream;
  3406. end;
  3407. { save @Dateivarible in temporary variable }
  3408. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,R_A0,newreference(aktfile))));
  3409. if doread then
  3410. { parameter by READ gives call by reference }
  3411. dummycoll.paratyp:=vs_var
  3412. else
  3413. { an WRITE Call by "Const" }
  3414. dummycoll.paratyp:=vs_const;
  3415. { because of secondcallparan, which otherwise attaches }
  3416. if ft=ft_typed then
  3417. begin
  3418. { this is to avoid copy of simple const parameters }
  3419. dummycoll.data:=new(pformaldef,init);
  3420. { use var for write also }
  3421. { avoids problems with const passed by value }
  3422. { but will not accept untyped const }
  3423. { dummycoll.paratyp:=vs_var; }
  3424. end
  3425. else
  3426. { I think, this isn't a good solution (FK) }
  3427. dummycoll.data:=nil;
  3428. while assigned(node) do
  3429. begin
  3430. pushusedregisters(pushed,$ffff);
  3431. hp:=node;
  3432. node:=node^.right;
  3433. hp^.right:=nil;
  3434. if hp^.is_colon_para then
  3435. Message(parser_e_illegal_colon_qualifier);
  3436. if hp^.is_colon_para then
  3437. Message(parser_e_illegal_colon_qualifier);
  3438. if ft=ft_typed then
  3439. never_copy_const_param:=true;
  3440. secondcallparan(hp,@dummycoll,false);
  3441. if ft=ft_typed then
  3442. never_copy_const_param:=false;
  3443. hp^.right:=node;
  3444. if codegenerror then
  3445. exit;
  3446. emit_push_mem(aktfile);
  3447. if (ft=ft_typed) then
  3448. begin
  3449. { OK let's try this }
  3450. { first we must only allow the right type }
  3451. { we have to call blockread or blockwrite }
  3452. { but the real problem is that }
  3453. { reset and rewrite should have set }
  3454. { the type size }
  3455. { as recordsize for that file !!!! }
  3456. { how can we make that }
  3457. { I think that is only possible by adding }
  3458. { reset and rewrite to the inline list a call }
  3459. { allways read only one record by element }
  3460. push_int(typedtyp^.size);
  3461. if doread then
  3462. emitcall('TYPED_READ',true)
  3463. else
  3464. emitcall('TYPED_WRITE',true)
  3465. {!!!!!!!}
  3466. end
  3467. else
  3468. begin
  3469. { save current position }
  3470. pararesult:=hp^.left^.resulttype;
  3471. { handle possible field width }
  3472. { of course only for write(ln) }
  3473. if not doread then
  3474. begin
  3475. { handle total width parameter }
  3476. if assigned(node) and node^.is_colon_para then
  3477. begin
  3478. hp:=node;
  3479. node:=node^.right;
  3480. hp^.right:=nil;
  3481. secondcallparan(hp,@dummycoll,false);
  3482. hp^.right:=node;
  3483. if codegenerror then
  3484. exit;
  3485. has_length:=true;
  3486. end
  3487. else
  3488. if pararesult^.deftype<>floatdef then
  3489. push_int(0)
  3490. else
  3491. push_int(-32767);
  3492. { a second colon para for a float ? }
  3493. if assigned(node) and node^.is_colon_para then
  3494. begin
  3495. hp:=node;
  3496. node:=node^.right;
  3497. hp^.right:=nil;
  3498. secondcallparan(hp,@dummycoll,false);
  3499. hp^.right:=node;
  3500. if pararesult^.deftype<>floatdef then
  3501. Message(parser_e_illegal_colon_qualifier);
  3502. if codegenerror then
  3503. exit;
  3504. end
  3505. else
  3506. begin
  3507. if hp^.left^.resulttype^.deftype=floatdef then
  3508. push_int(-1);
  3509. end;
  3510. end;
  3511. case pararesult^.deftype of
  3512. stringdef : begin
  3513. if doread then
  3514. begin
  3515. { push maximum string length }
  3516. push_int(pstringdef(pararesult)^.len);
  3517. case pstringdef(pararesult)^.string_typ of
  3518. st_shortstring: emitcall ('READ_TEXT_STRING',true);
  3519. st_ansistring : emitcall ('READ_TEXT_ANSISTRING',true);
  3520. st_longstring : emitcall ('READ_TEXT_LONGSTRING',true);
  3521. st_widestring : emitcall ('READ_TEXT_ANSISTRING',true);
  3522. end
  3523. end
  3524. else
  3525. Case pstringdef(Pararesult)^.string_typ of
  3526. st_shortstring: emitcall ('WRITE_TEXT_STRING',true);
  3527. st_ansistring : emitcall ('WRITE_TEXT_ANSISTRING',true);
  3528. st_longstring : emitcall ('WRITE_TEXT_LONGSTRING',true);
  3529. st_widestring : emitcall ('WRITE_TEXT_ANSISTRING',true);
  3530. end;
  3531. end;
  3532. pointerdef : begin
  3533. if is_equal(ppointerdef(pararesult)^.definition,cchardef) then
  3534. begin
  3535. if doread then
  3536. emitcall('READ_TEXT_PCHAR_AS_POINTER',true)
  3537. else
  3538. emitcall('WRITE_TEXT_PCHAR_AS_POINTER',true);
  3539. end
  3540. else
  3541. Message(parser_e_illegal_parameter_list);
  3542. end;
  3543. arraydef : begin
  3544. if (parraydef(pararesult)^.lowrange=0) and
  3545. is_equal(parraydef(pararesult)^.definition,cchardef) then
  3546. begin
  3547. if doread then
  3548. emitcall('READ_TEXT_PCHAR_AS_ARRAY',true)
  3549. else
  3550. emitcall('WRITE_TEXT_PCHAR_AS_ARRAY',true);
  3551. end
  3552. else
  3553. Message(parser_e_illegal_parameter_list);
  3554. end;
  3555. floatdef : begin
  3556. if doread then
  3557. emitcall('READ_TEXT_'+float_name[pfloatdef(pararesult)^.typ],true)
  3558. else
  3559. emitcall('WRITE_TEXT_'+float_name[pfloatdef(pararesult)^.typ],true);
  3560. end;
  3561. orddef : begin
  3562. case porddef(pararesult)^.typ of
  3563. u8bit : if doread then
  3564. emitcall('READ_TEXT_BYTE',true);
  3565. s8bit : if doread then
  3566. emitcall('READ_TEXT_SHORTINT',true);
  3567. u16bit : if doread then
  3568. emitcall('READ_TEXT_WORD',true);
  3569. s16bit : if doread then
  3570. emitcall('READ_TEXT_INTEGER',true);
  3571. s32bit : if doread then
  3572. emitcall('READ_TEXT_LONGINT',true)
  3573. else
  3574. emitcall('WRITE_TEXT_LONGINT',true);
  3575. u32bit : if doread then
  3576. emitcall('READ_TEXT_CARDINAL',true)
  3577. else
  3578. emitcall('WRITE_TEXT_CARDINAL',true);
  3579. uchar : if doread then
  3580. emitcall('READ_TEXT_CHAR',true)
  3581. else
  3582. emitcall('WRITE_TEXT_CHAR',true);
  3583. bool8bit,
  3584. bool16bit,
  3585. bool32bit : if doread then
  3586. { emitcall('READ_TEXT_BOOLEAN',true) }
  3587. Message(parser_e_illegal_parameter_list)
  3588. else
  3589. emitcall('WRITE_TEXT_BOOLEAN',true);
  3590. else
  3591. Message(parser_e_illegal_parameter_list);
  3592. end;
  3593. end;
  3594. else
  3595. Message(parser_e_illegal_parameter_list);
  3596. end;
  3597. end;
  3598. { load A5 in methods again }
  3599. popusedregisters(pushed);
  3600. maybe_loada5;
  3601. end;
  3602. end;
  3603. { Insert end of writing for textfiles }
  3604. if ft=ft_text then
  3605. begin
  3606. pushusedregisters(pushed,$ffff);
  3607. emit_push_mem(aktfile);
  3608. if doread then
  3609. begin
  3610. if doln then
  3611. emitcall('READLN_END',true)
  3612. else
  3613. emitcall('READ_END',true);
  3614. end
  3615. else
  3616. begin
  3617. if doln then
  3618. emitcall('WRITELN_END',true)
  3619. else
  3620. emitcall('WRITE_END',true);
  3621. end;
  3622. popusedregisters(pushed);
  3623. maybe_loada5;
  3624. end;
  3625. { Insert IOCheck if set }
  3626. if iolabel<>nil then
  3627. begin
  3628. { registers are saved in the procedure }
  3629. exprasmlist^.concat(new(pai68k,op_csymbol(A_PEA,S_L,newcsymbol(lab2str(iolabel),0))));
  3630. emitcall('IOCHECK',true);
  3631. end;
  3632. { Freeup all used temps }
  3633. ungetiftemp(aktfile);
  3634. if assigned(p^.left) then
  3635. begin
  3636. p^.left:=reversparameter(p^.left);
  3637. if npara<>nb_para then
  3638. Message(cg_f_internal_error_in_secondinline);
  3639. hp:=p^.left;
  3640. while assigned(hp) do
  3641. begin
  3642. if assigned(hp^.left) then
  3643. if (hp^.left^.location.loc=LOC_REFERENCE) or
  3644. (hp^.left^.location.loc=LOC_MEM) then
  3645. ungetiftemp(hp^.left^.location.reference);
  3646. hp:=hp^.right;
  3647. end;
  3648. end;
  3649. end;
  3650. procedure handle_str;
  3651. var
  3652. hp,node,lentree,paratree : ptree;
  3653. dummycoll : tdefcoll;
  3654. is_real,has_length : boolean;
  3655. real_type : byte;
  3656. begin
  3657. pushusedregisters(pushed,$ffff);
  3658. node:=p^.left;
  3659. is_real:=false;
  3660. has_length:=false;
  3661. while assigned(node^.right) do node:=node^.right;
  3662. { if a real parameter somewhere then call REALSTR }
  3663. if (node^.left^.resulttype^.deftype=floatdef) then
  3664. is_real:=true;
  3665. node:=p^.left;
  3666. { we have at least two args }
  3667. { with at max 2 colon_para in between }
  3668. { first arg longint or float }
  3669. hp:=node;
  3670. node:=node^.right;
  3671. hp^.right:=nil;
  3672. dummycoll.data:=hp^.resulttype;
  3673. { string arg }
  3674. dummycoll.paratyp:=vs_var;
  3675. secondcallparan(hp,@dummycoll,false);
  3676. if codegenerror then
  3677. exit;
  3678. dummycoll.paratyp:=vs_const;
  3679. { second arg }
  3680. hp:=node;
  3681. node:=node^.right;
  3682. hp^.right:=nil;
  3683. { frac para }
  3684. if hp^.is_colon_para and assigned(node) and
  3685. node^.is_colon_para then
  3686. begin
  3687. dummycoll.data:=hp^.resulttype;
  3688. secondcallparan(hp,@dummycoll,false);
  3689. if codegenerror then
  3690. exit;
  3691. hp:=node;
  3692. node:=node^.right;
  3693. hp^.right:=nil;
  3694. has_length:=true;
  3695. end
  3696. else
  3697. if is_real then
  3698. push_int(-1);
  3699. { third arg, length only if is_real }
  3700. if hp^.is_colon_para then
  3701. begin
  3702. dummycoll.data:=hp^.resulttype;
  3703. secondcallparan(hp,@dummycoll,false);
  3704. if codegenerror then
  3705. exit;
  3706. hp:=node;
  3707. node:=node^.right;
  3708. hp^.right:=nil;
  3709. end
  3710. else
  3711. if is_real then
  3712. push_int(-32767)
  3713. else
  3714. push_int(-1);
  3715. { last arg longint or real }
  3716. secondcallparan(hp,@dummycoll,false);
  3717. if codegenerror then
  3718. exit;
  3719. if is_real then
  3720. emitcall('STR_'+float_name[pfloatdef(hp^.resulttype)^.typ],true)
  3721. else if porddef(hp^.resulttype)^.typ=u32bit then
  3722. emitcall('STR_CARDINAL',true)
  3723. else
  3724. emitcall('STR_LONGINT',true);
  3725. popusedregisters(pushed);
  3726. end;
  3727. var
  3728. r : preference;
  3729. {inc/dec}
  3730. addconstant : boolean;
  3731. addvalue : longint;
  3732. hregister : tregister;
  3733. begin
  3734. case p^.inlinenumber of
  3735. in_lo_word,
  3736. in_hi_word : begin
  3737. secondpass(p^.left);
  3738. p^.location.loc:=LOC_REGISTER;
  3739. if p^.left^.location.loc<>LOC_REGISTER then
  3740. begin
  3741. if p^.left^.location.loc=LOC_CREGISTER then
  3742. begin
  3743. p^.location.register:=getregister32;
  3744. emit_reg_reg(A_MOVE,S_W,p^.left^.location.register,
  3745. p^.location.register);
  3746. end
  3747. else
  3748. begin
  3749. del_reference(p^.left^.location.reference);
  3750. p^.location.register:=getregister32;
  3751. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,
  3752. newreference(p^.left^.location.reference),
  3753. p^.location.register)));
  3754. end;
  3755. end
  3756. else p^.location.register:=p^.left^.location.register;
  3757. if p^.inlinenumber=in_hi_word then
  3758. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSR,S_W,8,p^.location.register)));
  3759. p^.location.register:=p^.location.register;
  3760. end;
  3761. in_high_x :
  3762. begin
  3763. if is_open_array(p^.left^.resulttype) then
  3764. begin
  3765. secondpass(p^.left);
  3766. del_reference(p^.left^.location.reference);
  3767. p^.location.register:=getregister32;
  3768. new(r);
  3769. reset_reference(r^);
  3770. r^.base:=highframepointer;
  3771. r^.offset:=highoffset+4;
  3772. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3773. r,p^.location.register)));
  3774. end
  3775. end;
  3776. in_sizeof_x,
  3777. in_typeof_x:
  3778. begin
  3779. { load vmt }
  3780. if p^.left^.treetype=typen then
  3781. begin
  3782. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_LEA,
  3783. S_L,newcsymbol(pobjectdef(p^.left^.resulttype)^.vmt_mangledname,0),
  3784. R_A0)));
  3785. p^.location.register:=getregister32;
  3786. emit_reg_reg(A_MOVE,S_L,R_A0,p^.location.register);
  3787. end
  3788. else
  3789. begin
  3790. secondpass(p^.left);
  3791. del_reference(p^.left^.location.reference);
  3792. p^.location.loc:=LOC_REGISTER;
  3793. p^.location.register:=getregister32;
  3794. { load VMT pointer }
  3795. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3796. newreference(p^.left^.location.reference),
  3797. p^.location.register)));
  3798. end;
  3799. { in sizeof load size }
  3800. if p^.inlinenumber=in_sizeof_x then
  3801. begin
  3802. new(r);
  3803. reset_reference(r^);
  3804. { load the address in A0 }
  3805. { because now supposedly p^.location.register is an }
  3806. { address. }
  3807. emit_reg_reg(A_MOVE, S_L, p^.location.register, R_A0);
  3808. r^.base:=R_A0;
  3809. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,r,
  3810. p^.location.register)));
  3811. end;
  3812. end;
  3813. in_lo_long,
  3814. in_hi_long : begin
  3815. secondpass(p^.left);
  3816. p^.location.loc:=LOC_REGISTER;
  3817. if p^.left^.location.loc<>LOC_REGISTER then
  3818. begin
  3819. if p^.left^.location.loc=LOC_CREGISTER then
  3820. begin
  3821. p^.location.register:=getregister32;
  3822. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,
  3823. p^.location.register);
  3824. end
  3825. else
  3826. begin
  3827. del_reference(p^.left^.location.reference);
  3828. p^.location.register:=getregister32;
  3829. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3830. newreference(p^.left^.location.reference),
  3831. p^.location.register)));
  3832. end;
  3833. end
  3834. else p^.location.register:=p^.left^.location.register;
  3835. if p^.inlinenumber=in_hi_long then
  3836. begin
  3837. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVEQ, S_L, 16, R_D1)));
  3838. exprasmlist^.concat(new(pai68k,op_reg_reg(A_LSR,S_L,R_D1,p^.location.register)));
  3839. end;
  3840. p^.location.register:=p^.location.register;
  3841. end;
  3842. in_length_string :
  3843. begin
  3844. secondpass(p^.left);
  3845. set_location(p^.location,p^.left^.location);
  3846. end;
  3847. in_dec_x,
  3848. in_inc_x :
  3849. begin
  3850. { set defaults }
  3851. addvalue:=1;
  3852. addconstant:=true;
  3853. { load first parameter, must be a reference }
  3854. secondpass(p^.left^.left);
  3855. case p^.left^.left^.resulttype^.deftype of
  3856. orddef,
  3857. enumdef : begin
  3858. case p^.left^.left^.resulttype^.size of
  3859. 1 : opsize:=S_B;
  3860. 2 : opsize:=S_W;
  3861. 4 : opsize:=S_L;
  3862. end;
  3863. end;
  3864. pointerdef : begin
  3865. opsize:=S_L;
  3866. addvalue:=ppointerdef(p^.left^.left^.resulttype)^.definition^.savesize;
  3867. end;
  3868. else
  3869. internalerror(10081);
  3870. end;
  3871. { second argument specified?, must be a s32bit in register }
  3872. if assigned(p^.left^.right) then
  3873. begin
  3874. secondpass(p^.left^.right^.left);
  3875. { when constant, just multiply the addvalue }
  3876. if is_constintnode(p^.left^.right^.left) then
  3877. addvalue:=addvalue*get_ordinal_value(p^.left^.right^.left)
  3878. else
  3879. begin
  3880. case p^.left^.right^.left^.location.loc of
  3881. LOC_REGISTER,
  3882. LOC_CREGISTER : hregister:=p^.left^.right^.left^.location.register;
  3883. LOC_MEM,
  3884. LOC_REFERENCE : begin
  3885. hregister:=getregister32;
  3886. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  3887. newreference(p^.left^.right^.left^.location.reference),hregister)));
  3888. end;
  3889. else
  3890. internalerror(10082);
  3891. end;
  3892. { insert multiply with addvalue if its >1 }
  3893. if addvalue>1 then
  3894. exprasmlist^.concat(new(pai68k,op_const_reg(A_MULS,opsize,
  3895. addvalue,hregister)));
  3896. addconstant:=false;
  3897. end;
  3898. end;
  3899. { write the add instruction }
  3900. if addconstant then
  3901. begin
  3902. exprasmlist^.concat(new(pai68k,op_const_ref(addsubop[p^.inlinenumber],opsize,
  3903. addvalue,newreference(p^.left^.left^.location.reference))));
  3904. end
  3905. else
  3906. begin
  3907. exprasmlist^.concat(new(pai68k,op_reg_ref(addsubop[p^.inlinenumber],opsize,
  3908. hregister,newreference(p^.left^.left^.location.reference))));
  3909. ungetregister32(hregister);
  3910. end;
  3911. emitoverflowcheck(p^.left^.left);
  3912. end;
  3913. {$ifdef OLDINC}
  3914. in_inc_byte..in_dec_dword:
  3915. begin
  3916. secondpass(p^.left);
  3917. exprasmlist^.concat(new(pai68k,op_const_ref(in2instr[p^.inlinenumber],
  3918. in2size[p^.inlinenumber],1,newreference(p^.left^.location.reference))));
  3919. emitoverflowcheck(p^.left);
  3920. end;
  3921. {$endif}
  3922. in_pred_x,
  3923. in_succ_x:
  3924. begin
  3925. secondpass(p^.left);
  3926. if p^.inlinenumber=in_pred_x then
  3927. asmop:=A_SUB
  3928. else
  3929. asmop:=A_ADD;
  3930. case p^.resulttype^.size of
  3931. 4 : opsize:=S_L;
  3932. 2 : opsize:=S_W;
  3933. 1 : opsize:=S_B;
  3934. else
  3935. internalerror(10080);
  3936. end;
  3937. p^.location.loc:=LOC_REGISTER;
  3938. if p^.left^.location.loc<>LOC_REGISTER then
  3939. begin
  3940. p^.location.register:=getregister32;
  3941. if p^.left^.location.loc=LOC_CREGISTER then
  3942. emit_reg_reg(A_MOVE,opsize,p^.left^.location.register,
  3943. p^.location.register)
  3944. else
  3945. if p^.left^.location.loc=LOC_FLAGS then
  3946. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.left^.location.resflags],S_NO,
  3947. p^.location.register)))
  3948. else
  3949. begin
  3950. del_reference(p^.left^.location.reference);
  3951. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,opsize,newreference(p^.left^.location.reference),
  3952. p^.location.register)));
  3953. end;
  3954. end
  3955. else p^.location.register:=p^.left^.location.register;
  3956. exprasmlist^.concat(new(pai68k,op_const_reg(asmop,opsize,1,
  3957. p^.location.register)))
  3958. { here we should insert bounds check ? }
  3959. { and direct call to bounds will crash the program }
  3960. { if we are at the limit }
  3961. { we could also simply say that pred(first)=first and succ(last)=last }
  3962. { could this be usefull I don't think so (PM)
  3963. emitoverflowcheck;}
  3964. end;
  3965. in_assigned_x:
  3966. begin
  3967. secondpass(p^.left^.left);
  3968. p^.location.loc:=LOC_FLAGS;
  3969. if (p^.left^.left^.location.loc=LOC_REGISTER) or
  3970. (p^.left^.left^.location.loc=LOC_CREGISTER) then
  3971. begin
  3972. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_L,
  3973. p^.left^.left^.location.register)));
  3974. ungetregister32(p^.left^.left^.location.register);
  3975. end
  3976. else
  3977. begin
  3978. exprasmlist^.concat(new(pai68k,op_ref(A_TST,S_L,
  3979. newreference(p^.left^.left^.location.reference))));
  3980. del_reference(p^.left^.left^.location.reference);
  3981. end;
  3982. p^.location.resflags:=F_NE;
  3983. end;
  3984. in_reset_typedfile,in_rewrite_typedfile :
  3985. begin
  3986. pushusedregisters(pushed,$ffff);
  3987. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,
  3988. pfiledef(p^.left^.resulttype)^.typed_as^.size,R_SPPUSH)));
  3989. secondload(p^.left);
  3990. emitpushreferenceaddr(p^.left^.location.reference);
  3991. if p^.inlinenumber=in_reset_typedfile then
  3992. emitcall('RESET_TYPED',true)
  3993. else
  3994. emitcall('REWRITE_TYPED',true);
  3995. popusedregisters(pushed);
  3996. end;
  3997. in_write_x :
  3998. handlereadwrite(false,false);
  3999. in_writeln_x :
  4000. handlereadwrite(false,true);
  4001. in_read_x :
  4002. handlereadwrite(true,false);
  4003. in_readln_x :
  4004. handlereadwrite(true,true);
  4005. in_str_x_string : begin
  4006. handle_str;
  4007. maybe_loada5;
  4008. end;
  4009. else internalerror(9);
  4010. end;
  4011. end;
  4012. procedure secondsubscriptn(var p : ptree);
  4013. var
  4014. hr: tregister;
  4015. begin
  4016. secondpass(p^.left);
  4017. if codegenerror then
  4018. exit;
  4019. { classes must be dereferenced implicit }
  4020. if (p^.left^.resulttype^.deftype=objectdef) and
  4021. pobjectdef(p^.left^.resulttype)^.isclass then
  4022. begin
  4023. clear_reference(p^.location.reference);
  4024. case p^.left^.location.loc of
  4025. LOC_REGISTER:
  4026. begin
  4027. { move it to an address register...}
  4028. hr:=getaddressreg;
  4029. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  4030. p^.location.reference.base:=hr;
  4031. { free register }
  4032. ungetregister(p^.left^.location.register);
  4033. end;
  4034. LOC_CREGISTER:
  4035. begin
  4036. { ... and reserve one for the pointer }
  4037. hr:=getaddressreg;
  4038. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  4039. p^.location.reference.base:=hr;
  4040. end;
  4041. else
  4042. begin
  4043. { free register }
  4044. del_reference(p^.left^.location.reference);
  4045. { ... and reserve one for the pointer }
  4046. hr:=getaddressreg;
  4047. exprasmlist^.concat(new(pai68k,op_ref_reg(
  4048. A_MOVE,S_L,newreference(p^.left^.location.reference),
  4049. hr)));
  4050. p^.location.reference.base:=hr;
  4051. end;
  4052. end;
  4053. end
  4054. else
  4055. set_location(p^.location,p^.left^.location);
  4056. inc(p^.location.reference.offset,p^.vs^.address);
  4057. end;
  4058. procedure secondselfn(var p : ptree);
  4059. begin
  4060. clear_reference(p^.location.reference);
  4061. p^.location.reference.base:=R_A5;
  4062. end;
  4063. procedure secondhdisposen(var p : ptree);
  4064. begin
  4065. secondpass(p^.left);
  4066. if codegenerror then
  4067. exit;
  4068. clear_reference(p^.location.reference);
  4069. case p^.left^.location.loc of
  4070. LOC_REGISTER,
  4071. LOC_CREGISTER : begin
  4072. p^.location.reference.base:=getaddressreg;
  4073. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  4074. p^.left^.location.register,
  4075. p^.location.reference.base)));
  4076. end;
  4077. LOC_MEM,LOC_REFERENCE :
  4078. begin
  4079. del_reference(p^.left^.location.reference);
  4080. p^.location.reference.base:=getaddressreg;
  4081. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  4082. p^.location.reference.base)));
  4083. end;
  4084. end;
  4085. end;
  4086. procedure secondhnewn(var p : ptree);
  4087. begin
  4088. end;
  4089. procedure secondnewn(var p : ptree);
  4090. begin
  4091. secondpass(p^.left);
  4092. if codegenerror then
  4093. exit;
  4094. p^.location.register:=p^.left^.location.register;
  4095. end;
  4096. procedure secondsimplenewdispose(var p : ptree);
  4097. var
  4098. pushed : tpushed;
  4099. begin
  4100. secondpass(p^.left);
  4101. if codegenerror then
  4102. exit;
  4103. pushusedregisters(pushed,$ffff);
  4104. { determines the size of the mem block }
  4105. push_int(ppointerdef(p^.left^.resulttype)^.definition^.size);
  4106. { push pointer adress }
  4107. case p^.left^.location.loc of
  4108. LOC_CREGISTER : exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  4109. p^.left^.location.register,R_SPPUSH)));
  4110. LOC_REFERENCE : emitpushreferenceaddr(p^.left^.location.reference);
  4111. end;
  4112. { call the mem handling procedures }
  4113. case p^.treetype of
  4114. simpledisposen :
  4115. emitcall('FREEMEM',true);
  4116. simplenewn :
  4117. emitcall('GETMEM',true);
  4118. end;
  4119. popusedregisters(pushed);
  4120. { may be load ESI }
  4121. maybe_loada5;
  4122. end;
  4123. procedure secondsetcons(var p : ptree);
  4124. var
  4125. l : plabel;
  4126. i,smallsetvalue : longint;
  4127. hp : ptree;
  4128. href,sref : treference;
  4129. hl1,hl2: plabel;
  4130. j: byte;
  4131. begin
  4132. { this should be reimplemented for smallsets }
  4133. { differently (PM) }
  4134. { produce constant part }
  4135. j:=0;
  4136. href.symbol := Nil;
  4137. clear_reference(href);
  4138. getlabel(l);
  4139. href.symbol:=stringdup(lab2str(l));
  4140. stringdispose(p^.location.reference.symbol);
  4141. datasegment^.concat(new(pai_label,init(l)));
  4142. {if psetdef(p^.resulttype)=smallset then
  4143. begin
  4144. smallsetvalue:=(p^.constset^[3]*256)+p^.constset^[2];
  4145. smallsetvalue:=((smallset*256+p^.constset^[1])*256+p^.constset^[1];
  4146. datasegment^.concat(new(pai_const,init_32bit(smallsetvalue)));
  4147. hp:=p^.left;
  4148. if assigned(hp) then
  4149. begin
  4150. sref.symbol:=nil;
  4151. gettempofsizereference(32,sref);
  4152. concatcopy(href,sref,32,false);
  4153. while assigned(hp) do
  4154. begin
  4155. secondpass(hp^.left);
  4156. if codegenerror then
  4157. exit;
  4158. pushsetelement(hp^.left);
  4159. emitpushreferenceaddr(sref);
  4160. register is save in subroutine
  4161. emitcall('SET_SET_BYTE',true);
  4162. hp:=hp^.right;
  4163. end;
  4164. p^.location.reference:=sref;
  4165. end
  4166. else p^.location.reference:=href;
  4167. end
  4168. else }
  4169. begin
  4170. for i:=0 to (31 div 4) do
  4171. Begin
  4172. { This is required because of the ENDIAN of m68k machines }
  4173. datasegment^.concat(new(pai_const,init_8bit(p^.constset^[j+3])));
  4174. datasegment^.concat(new(pai_const,init_8bit(p^.constset^[j+2])));
  4175. datasegment^.concat(new(pai_const,init_8bit(p^.constset^[j+1])));
  4176. datasegment^.concat(new(pai_const,init_8bit(p^.constset^[j])));
  4177. Inc(j,4);
  4178. { datasegment^.concat(new(pai_const,init_8bit(p^.constset^[i])));}
  4179. end;
  4180. hp:=p^.left;
  4181. if assigned(hp) then
  4182. begin
  4183. sref.symbol:=nil;
  4184. gettempofsizereference(32,sref);
  4185. concatcopy(href,sref,32,false);
  4186. while assigned(hp) do
  4187. begin
  4188. secondpass(hp^.left);
  4189. if codegenerror then
  4190. exit;
  4191. loadsetelement(hp^.left);
  4192. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  4193. newreference(sref),R_A0)));;
  4194. { emitpushreferenceaddr(sref); }
  4195. { register is save in subroutine }
  4196. emitcall('SET_SET_BYTE',true);
  4197. hp:=hp^.right;
  4198. end;
  4199. p^.location.reference:=sref;
  4200. end
  4201. else
  4202. p^.location.reference:=href;
  4203. end;
  4204. end;
  4205. procedure secondcontinuen(var p : ptree);
  4206. begin
  4207. if aktcontinuelabel<>nil then
  4208. emitl(A_JMP,aktcontinuelabel)
  4209. else
  4210. Message(cg_e_continue_not_allowed);
  4211. end;
  4212. { var
  4213. hs : string; }
  4214. procedure secondexitn(var p : ptree);
  4215. var
  4216. is_mem : boolean;
  4217. {op : tasmop;
  4218. s : topsize;}
  4219. otlabel,oflabel : plabel;
  4220. label
  4221. do_jmp;
  4222. begin
  4223. if assigned(p^.left) then
  4224. begin
  4225. otlabel:=truelabel;
  4226. oflabel:=falselabel;
  4227. getlabel(truelabel);
  4228. getlabel(falselabel);
  4229. secondpass(p^.left);
  4230. case p^.left^.location.loc of
  4231. LOC_FPU : goto do_jmp;
  4232. LOC_MEM,LOC_REFERENCE : is_mem:=true;
  4233. LOC_CREGISTER,
  4234. LOC_REGISTER : is_mem:=false;
  4235. LOC_FLAGS : begin
  4236. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.right^.location.resflags],S_B,R_D0)));
  4237. exprasmlist^.concat(new(pai68k,op_reg(A_NEG, S_B, R_D0)));
  4238. goto do_jmp;
  4239. end;
  4240. LOC_JUMP : begin
  4241. emitl(A_LABEL,truelabel);
  4242. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_B,1,R_D0)));
  4243. emitl(A_JMP,aktexit2label);
  4244. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,S_B,R_D0)));
  4245. goto do_jmp;
  4246. end;
  4247. else internalerror(2001);
  4248. end;
  4249. if (procinfo.retdef^.deftype=orddef) then
  4250. begin
  4251. case porddef(procinfo.retdef)^.typ of
  4252. s32bit,u32bit : if is_mem then
  4253. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  4254. newreference(p^.left^.location.reference),R_D0)))
  4255. else
  4256. emit_reg_reg(A_MOVE,S_L,
  4257. p^.left^.location.register,R_D0);
  4258. u8bit,s8bit,uchar,bool8bit : if is_mem then
  4259. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_B,
  4260. newreference(p^.left^.location.reference),R_D0)))
  4261. else
  4262. emit_reg_reg(A_MOVE,S_B,
  4263. p^.left^.location.register,R_D0);
  4264. s16bit,u16bit : if is_mem then
  4265. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_W,
  4266. newreference(p^.left^.location.reference),R_D0)))
  4267. else
  4268. emit_reg_reg(A_MOVE,S_W,
  4269. p^.left^.location.register,R_D0);
  4270. end;
  4271. end
  4272. else
  4273. if (procinfo.retdef^.deftype in
  4274. [pointerdef,enumdef,procvardef]) then
  4275. begin
  4276. if is_mem then
  4277. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  4278. newreference(p^.left^.location.reference),R_D0)))
  4279. else
  4280. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  4281. p^.left^.location.register,R_D0)));
  4282. end
  4283. else
  4284. if (procinfo.retdef^.deftype=floatdef) then
  4285. { floating point return values .... }
  4286. { single are returned in d0 }
  4287. begin
  4288. if (pfloatdef(procinfo.retdef)^.typ=f32bit) or
  4289. (pfloatdef(procinfo.retdef)^.typ=s32real) then
  4290. begin
  4291. if is_mem then
  4292. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  4293. newreference(p^.left^.location.reference),R_D0)))
  4294. else
  4295. begin
  4296. if pfloatdef(procinfo.retdef)^.typ=f32bit then
  4297. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,R_D0)
  4298. else
  4299. begin
  4300. { single values are in the floating point registers }
  4301. if cs_fp_emulation in aktmoduleswitches then
  4302. emit_reg_reg(A_MOVE,S_L,p^.left^.location.fpureg,R_D0)
  4303. else
  4304. exprasmlist^.concat(new(pai68k,op_reg_reg(A_FMOVE,S_FS,
  4305. p^.left^.location.fpureg,R_D0)));
  4306. end;
  4307. end;
  4308. end
  4309. else
  4310. Begin
  4311. { this is only possible in real non emulation mode }
  4312. { LOC_MEM,LOC_REFERENCE }
  4313. if is_mem then
  4314. begin
  4315. exprasmlist^.concat(new(pai68k,op_ref_reg(A_FMOVE,
  4316. getfloatsize(pfloatdef(procinfo.retdef)^.typ),
  4317. newreference(p^.left^.location.reference),R_FP0)));
  4318. end
  4319. else
  4320. { LOC_FPU }
  4321. begin
  4322. { convert from extended to correct type }
  4323. { when storing }
  4324. exprasmlist^.concat(new(pai68k,op_reg_reg(A_FMOVE,
  4325. getfloatsize(pfloatdef(procinfo.retdef)^.typ),p^.left^.location.fpureg,R_FP0)));
  4326. end;
  4327. end;
  4328. end;
  4329. do_jmp:
  4330. truelabel:=otlabel;
  4331. falselabel:=oflabel;
  4332. emitl(A_JMP,aktexit2label);
  4333. end
  4334. else
  4335. begin
  4336. emitl(A_JMP,aktexitlabel);
  4337. end;
  4338. end;
  4339. procedure secondgoto(var p : ptree);
  4340. begin
  4341. emitl(A_JMP,p^.labelnr);
  4342. end;
  4343. procedure secondlabel(var p : ptree);
  4344. begin
  4345. emitl(A_LABEL,p^.labelnr);
  4346. cleartempgen;
  4347. secondpass(p^.left);
  4348. end;
  4349. procedure secondasm(var p : ptree);
  4350. begin
  4351. exprasmlist^.concatlist(p^.p_asm);
  4352. end;
  4353. procedure secondcase(var p : ptree);
  4354. var
  4355. with_sign : boolean;
  4356. opsize : topsize;
  4357. jmp_gt,jmp_le,jmp_lee : tasmop;
  4358. hp : ptree;
  4359. { register with case expression }
  4360. hregister : tregister;
  4361. endlabel,elselabel : plabel;
  4362. { true, if we can omit the range check of the jump table }
  4363. jumptable_no_range : boolean;
  4364. procedure gentreejmp(p : pcaserecord);
  4365. var
  4366. lesslabel,greaterlabel : plabel;
  4367. begin
  4368. emitl(A_LABEL,p^._at);
  4369. { calculate labels for left and right }
  4370. if (p^.less=nil) then
  4371. lesslabel:=elselabel
  4372. else
  4373. lesslabel:=p^.less^._at;
  4374. if (p^.greater=nil) then
  4375. greaterlabel:=elselabel
  4376. else
  4377. greaterlabel:=p^.greater^._at;
  4378. { calculate labels for left and right }
  4379. { no range label: }
  4380. if p^._low=p^._high then
  4381. begin
  4382. exprasmlist^.concat(new(pai68k,op_const_reg(A_CMP,opsize,p^._low,hregister)));
  4383. if greaterlabel=lesslabel then
  4384. begin
  4385. emitl(A_BNE,lesslabel);
  4386. end
  4387. else
  4388. begin
  4389. emitl(jmp_le,lesslabel);
  4390. emitl(jmp_gt,greaterlabel);
  4391. end;
  4392. emitl(A_JMP,p^.statement);
  4393. end
  4394. else
  4395. begin
  4396. exprasmlist^.concat(new(pai68k,op_const_reg(A_CMP,opsize,p^._low,hregister)));
  4397. emitl(jmp_le,lesslabel);
  4398. exprasmlist^.concat(new(pai68k,op_const_reg(A_CMP,opsize,p^._high,hregister)));
  4399. emitl(jmp_gt,greaterlabel);
  4400. emitl(A_JMP,p^.statement);
  4401. end;
  4402. if assigned(p^.less) then
  4403. gentreejmp(p^.less);
  4404. if assigned(p^.greater) then
  4405. gentreejmp(p^.greater);
  4406. end;
  4407. procedure genlinearlist(hp : pcaserecord);
  4408. var
  4409. first : boolean;
  4410. last : longint;
  4411. procedure genitem(t : pcaserecord);
  4412. begin
  4413. if assigned(t^.less) then
  4414. genitem(t^.less);
  4415. if t^._low=t^._high then
  4416. begin
  4417. if (t^._low-last > 0) and (t^._low-last < 9) then
  4418. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,opsize,t^._low-last,hregister)))
  4419. else
  4420. if (t^._low-last = 0) then
  4421. exprasmlist^.concat(new(pai68k,op_reg(A_TST,opsize,hregister)))
  4422. else
  4423. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,opsize,t^._low-last,hregister)));
  4424. last:=t^._low;
  4425. emitl(A_BEQ,t^.statement);
  4426. end
  4427. else
  4428. begin
  4429. { it begins with the smallest label, if the value }
  4430. { is even smaller then jump immediately to the }
  4431. { ELSE-label }
  4432. if first then
  4433. begin
  4434. if (t^._low-1 > 0) and (t^._low < 9) then
  4435. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,opsize,t^._low-1,hregister)))
  4436. else
  4437. if t^._low-1=0 then
  4438. exprasmlist^.concat(new(pai68k,op_reg(A_TST,opsize,hregister)))
  4439. else
  4440. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,opsize,t^._low-1,hregister)));
  4441. if t^._low = 0 then
  4442. emitl(A_BLE,elselabel)
  4443. else
  4444. emitl(jmp_lee,elselabel);
  4445. end
  4446. { if there is no unused label between the last and the }
  4447. { present label then the lower limit can be checked }
  4448. { immediately. else check the range in between: }
  4449. else if (t^._low-last>1)then
  4450. begin
  4451. if ((t^._low-last-1) > 0) and ((t^._low-last-1) < 9) then
  4452. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUBQ,opsize,t^._low-last-1,hregister)))
  4453. else
  4454. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,opsize,t^._low-last-1,hregister)));
  4455. emitl(jmp_lee,elselabel);
  4456. end;
  4457. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,opsize,t^._high-t^._low+1,hregister)));
  4458. emitl(jmp_lee,t^.statement);
  4459. last:=t^._high;
  4460. end;
  4461. first:=false;
  4462. if assigned(t^.greater) then
  4463. genitem(t^.greater);
  4464. end;
  4465. var
  4466. hr : tregister;
  4467. begin
  4468. { case register is modified by the list evalution }
  4469. if (p^.left^.location.loc=LOC_CREGISTER) then
  4470. begin
  4471. hr:=getregister32;
  4472. end;
  4473. last:=0;
  4474. first:=true;
  4475. genitem(hp);
  4476. emitl(A_JMP,elselabel);
  4477. end;
  4478. procedure genjumptable(hp : pcaserecord;min_,max_ : longint);
  4479. var
  4480. table : plabel;
  4481. last : longint;
  4482. hr : preference;
  4483. procedure genitem(t : pcaserecord);
  4484. var
  4485. i : longint;
  4486. begin
  4487. if assigned(t^.less) then
  4488. genitem(t^.less);
  4489. { fill possible hole }
  4490. for i:=last+1 to t^._low-1 do
  4491. datasegment^.concat(new(pai_const,init_symbol(strpnew(lab2str
  4492. (elselabel)))));
  4493. for i:=t^._low to t^._high do
  4494. datasegment^.concat(new(pai_const,init_symbol(strpnew(lab2str
  4495. (t^.statement)))));
  4496. last:=t^._high;
  4497. if assigned(t^.greater) then
  4498. genitem(t^.greater);
  4499. end;
  4500. begin
  4501. if not(jumptable_no_range) then
  4502. begin
  4503. exprasmlist^.concat(new(pai68k,op_const_reg(A_CMP,opsize,min_,hregister)));
  4504. { case expr less than min_ => goto elselabel }
  4505. emitl(jmp_le,elselabel);
  4506. exprasmlist^.concat(new(pai68k,op_const_reg(A_CMP,opsize,max_,hregister)));
  4507. emitl(jmp_gt,elselabel);
  4508. end;
  4509. getlabel(table);
  4510. { extend with sign }
  4511. if opsize=S_W then
  4512. begin
  4513. { word to long - unsigned }
  4514. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ffff,hregister)));
  4515. end
  4516. else if opsize=S_B then
  4517. begin
  4518. { byte to long - unsigned }
  4519. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ff,hregister)));
  4520. end;
  4521. new(hr);
  4522. reset_reference(hr^);
  4523. hr^.symbol:=stringdup(lab2str(table));
  4524. hr^.offset:=(-min_)*4;
  4525. { add scalefactor *4 to index }
  4526. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,2,hregister)));
  4527. { hr^.scalefactor:=4; }
  4528. hr^.base:=getaddressreg;
  4529. emit_reg_reg(A_MOVE,S_L,hregister,hr^.base);
  4530. exprasmlist^.concat(new(pai68k,op_ref(A_JMP,S_NO,hr)));
  4531. { if not(cs_littlesize in aktglobalswitches^ ) then
  4532. datasegment^.concat(new(pai68k,op_const(A_ALIGN,S_NO,4))); }
  4533. datasegment^.concat(new(pai_label,init(table)));
  4534. last:=min_;
  4535. genitem(hp);
  4536. if hr^.base <> R_NO then ungetregister(hr^.base);
  4537. { !!!!!!!
  4538. if not(cs_littlesize in aktglobalswitches^ ) then
  4539. exprasmlist^.concat(new(pai68k,op_const(A_ALIGN,S_NO,4)));
  4540. }
  4541. end;
  4542. var
  4543. lv,hv,min_label,max_label,labels : longint;
  4544. max_linear_list : longint;
  4545. begin
  4546. getlabel(endlabel);
  4547. getlabel(elselabel);
  4548. with_sign:=is_signed(p^.left^.resulttype);
  4549. if with_sign then
  4550. begin
  4551. jmp_gt:=A_BGT;
  4552. jmp_le:=A_BLT;
  4553. jmp_lee:=A_BLE;
  4554. end
  4555. else
  4556. begin
  4557. jmp_gt:=A_BHI;
  4558. jmp_le:=A_BCS;
  4559. jmp_lee:=A_BLS;
  4560. end;
  4561. cleartempgen;
  4562. secondpass(p^.left);
  4563. { determines the size of the operand }
  4564. { determines the size of the operand }
  4565. opsize:=bytes2Sxx[p^.left^.resulttype^.size];
  4566. { copy the case expression to a register }
  4567. { copy the case expression to a register }
  4568. case p^.left^.location.loc of
  4569. LOC_REGISTER,
  4570. LOC_CREGISTER : hregister:=p^.left^.location.register;
  4571. LOC_MEM,LOC_REFERENCE : begin
  4572. del_reference(p^.left^.location.reference);
  4573. hregister:=getregister32;
  4574. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,opsize,newreference(
  4575. p^.left^.location.reference),hregister)));
  4576. end;
  4577. else internalerror(2002);
  4578. end;
  4579. { now generate the jumps }
  4580. if cs_optimize in aktglobalswitches then
  4581. begin
  4582. { procedures are empirically passed on }
  4583. { consumption can also be calculated }
  4584. { but does it pay on the different }
  4585. { processors? }
  4586. { moreover can the size only be appro- }
  4587. { ximated as it is not known if rel8, }
  4588. { rel16 or rel32 jumps are used }
  4589. min_label:=case_get_min(p^.nodes);
  4590. max_label:=case_get_max(p^.nodes);
  4591. labels:=case_count_labels(p^.nodes);
  4592. { can we omit the range check of the jump table }
  4593. getrange(p^.left^.resulttype,lv,hv);
  4594. jumptable_no_range:=(lv=min_label) and (hv=max_label);
  4595. { optimize for size ? }
  4596. if cs_littlesize in aktglobalswitches then
  4597. begin
  4598. if (labels<=2) or ((max_label-min_label)>3*labels) then
  4599. { a linear list is always smaller than a jump tree }
  4600. genlinearlist(p^.nodes)
  4601. else
  4602. { if the labels less or more a continuum then }
  4603. genjumptable(p^.nodes,min_label,max_label);
  4604. end
  4605. else
  4606. begin
  4607. if jumptable_no_range then
  4608. max_linear_list:=4
  4609. else
  4610. max_linear_list:=2;
  4611. if (labels<=max_linear_list) then
  4612. genlinearlist(p^.nodes)
  4613. else
  4614. begin
  4615. if ((max_label-min_label)>4*labels) then
  4616. begin
  4617. if labels>16 then
  4618. gentreejmp(p^.nodes)
  4619. else
  4620. genlinearlist(p^.nodes);
  4621. end
  4622. else
  4623. genjumptable(p^.nodes,min_label,max_label);
  4624. end;
  4625. end;
  4626. end
  4627. else
  4628. { it's always not bad }
  4629. genlinearlist(p^.nodes);
  4630. { now generate the instructions }
  4631. hp:=p^.right;
  4632. while assigned(hp) do
  4633. begin
  4634. cleartempgen;
  4635. secondpass(hp^.right);
  4636. emitl(A_JMP,endlabel);
  4637. hp:=hp^.left;
  4638. end;
  4639. emitl(A_LABEL,elselabel);
  4640. { ... and the else block }
  4641. if assigned(p^.elseblock) then
  4642. begin
  4643. cleartempgen;
  4644. secondpass(p^.elseblock);
  4645. end;
  4646. emitl(A_LABEL,endlabel);
  4647. end;
  4648. procedure secondtryexcept(var p : ptree);
  4649. begin
  4650. end;
  4651. procedure secondtryfinally(var p : ptree);
  4652. begin
  4653. end;
  4654. procedure secondfail(var p : ptree);
  4655. var hp : preference;
  4656. begin
  4657. {if procinfo.exceptions then
  4658. aktproccode.concat(gennasmrec(CALL,S_NO,'HELP_DESTRUCTOR_E'))
  4659. else }
  4660. { we should know if the constructor is called with a new or not,
  4661. how can we do that ???
  4662. exprasmlist^.concat(new(pai68k,op_csymbol(A_CALL,S_NO,newcsymbol('HELP_DESTRUCTOR',0))));
  4663. }
  4664. exprasmlist^.concat(new(pai68k,op_reg(A_CLR,S_L,R_A5)));
  4665. { also reset to zero in the stack }
  4666. new(hp);
  4667. reset_reference(hp^);
  4668. hp^.offset:=procinfo.ESI_offset;
  4669. hp^.base:=procinfo.framepointer;
  4670. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,R_A5,hp)));
  4671. exprasmlist^.concat(new(pai_labeled,init(A_JMP,quickexitlabel)));
  4672. end;
  4673. procedure secondon(var p : ptree);
  4674. var
  4675. nextonlabel,myendexceptlabel : plabel;
  4676. ref : treference;
  4677. begin
  4678. { !!!!!!!!!!!!!!! }
  4679. (* getlabel(nextonlabel);
  4680. { push the vmt }
  4681. exprasmlist^.concat(new(pai386,op_csymbol(A_PUSH,S_L,
  4682. newcsymbol(p^.excepttype^.vmt_mangledname,0))));
  4683. maybe_concat_external(p^.excepttype^.owner,
  4684. p^.excepttype^.vmt_mangledname);
  4685. emitcall('FPC_CATCHES',true);
  4686. exprasmlist^.concat(new(pai386,
  4687. op_reg_reg(A_TEST,S_L,R_EAX,R_EAX)));
  4688. emitl(A_JE,nextonlabel);
  4689. ref.symbol:=nil;
  4690. gettempofsizereference(4,ref);
  4691. { what a hack ! }
  4692. if assigned(p^.exceptsymtable) then
  4693. pvarsym(p^.exceptsymtable^.root)^.address:=ref.offset;
  4694. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,
  4695. R_EAX,newreference(ref))));
  4696. if assigned(p^.right) then
  4697. secondpass(p^.right);
  4698. { clear some stuff }
  4699. ungetiftemp(ref);
  4700. emitl(A_JMP,endexceptlabel);
  4701. emitl(A_LABEL,nextonlabel);
  4702. { next on node }
  4703. if assigned(p^.left) then
  4704. secondpass(p^.left); *)
  4705. end;
  4706. procedure secondas(var p : ptree);
  4707. var
  4708. pushed : tpushed;
  4709. begin
  4710. set_location(p^.location,p^.left^.location);
  4711. { save all used registers }
  4712. pushusedregisters(pushed,$ffff);
  4713. { push the vmt of the class }
  4714. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_MOVE,
  4715. S_L,newcsymbol(pobjectdef(p^.right^.resulttype)^.vmt_mangledname,0),R_SPPUSH)));
  4716. concat_external(pobjectdef(p^.right^.resulttype)^.vmt_mangledname,EXT_NEAR);
  4717. emitpushreferenceaddr(p^.location.reference);
  4718. emitcall('DO_AS',true);
  4719. popusedregisters(pushed);
  4720. end;
  4721. procedure secondis(var p : ptree);
  4722. var
  4723. pushed : tpushed;
  4724. begin
  4725. { save all used registers }
  4726. pushusedregisters(pushed,$ffff);
  4727. secondpass(p^.left);
  4728. p^.location.loc:=LOC_FLAGS;
  4729. p^.location.resflags:=F_NE;
  4730. { push instance to check: }
  4731. case p^.left^.location.loc of
  4732. LOC_REGISTER,LOC_CREGISTER:
  4733. begin
  4734. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,
  4735. S_L,p^.left^.location.register,R_SPPUSH)));
  4736. ungetregister32(p^.left^.location.register);
  4737. end;
  4738. LOC_MEM,LOC_REFERENCE:
  4739. begin
  4740. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,
  4741. S_L,newreference(p^.left^.location.reference),R_SPPUSH)));
  4742. del_reference(p^.left^.location.reference);
  4743. end;
  4744. else internalerror(100);
  4745. end;
  4746. { generate type checking }
  4747. secondpass(p^.right);
  4748. case p^.right^.location.loc of
  4749. LOC_REGISTER,LOC_CREGISTER:
  4750. begin
  4751. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,
  4752. S_L,p^.right^.location.register,R_SPPUSH)));
  4753. ungetregister32(p^.right^.location.register);
  4754. end;
  4755. LOC_MEM,LOC_REFERENCE:
  4756. begin
  4757. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,
  4758. S_L,newreference(p^.right^.location.reference),R_SPPUSH)));
  4759. del_reference(p^.right^.location.reference);
  4760. end;
  4761. else internalerror(100);
  4762. end;
  4763. emitcall('DO_IS',true);
  4764. exprasmlist^.concat(new(pai68k,op_reg(A_TST,S_B,R_D0)));
  4765. popusedregisters(pushed);
  4766. end;
  4767. procedure secondwith(var p : ptree);
  4768. var
  4769. ref : treference;
  4770. symtable : psymtable;
  4771. i : longint;
  4772. begin
  4773. if assigned(p^.left) then
  4774. begin
  4775. secondpass(p^.left);
  4776. ref.symbol:=nil;
  4777. gettempofsizereference(4,ref);
  4778. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  4779. newreference(p^.left^.location.reference),R_A0)));
  4780. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,
  4781. R_A0,newreference(ref))));
  4782. del_reference(p^.left^.location.reference);
  4783. { the offset relative to (%ebp) is only needed here! }
  4784. symtable:=p^.withsymtable;
  4785. for i:=1 to p^.tablecount do
  4786. begin
  4787. symtable^.datasize:=ref.offset;
  4788. symtable:=symtable^.next;
  4789. end;
  4790. { p^.right can be optimize out !!! }
  4791. if p^.right<>nil then
  4792. secondpass(p^.right);
  4793. { clear some stuff }
  4794. ungetiftemp(ref);
  4795. end;
  4796. end;
  4797. procedure secondprocinline(var p:ptree);
  4798. begin
  4799. end;
  4800. procedure secondpass(var p : ptree);
  4801. const
  4802. procedures : array[ttreetyp] of secondpassproc =
  4803. (secondadd,secondadd,secondadd,secondmoddiv,secondadd,
  4804. secondmoddiv,secondassignment,secondload,secondnothing,
  4805. secondadd,secondadd,secondadd,secondadd,
  4806. secondadd,secondadd,secondin,secondadd,
  4807. secondadd,secondshlshr,secondshlshr,secondadd,
  4808. secondadd,secondsubscriptn,secondderef,secondaddr,
  4809. seconddoubleaddr,
  4810. secondordconst,secondtypeconv,secondcalln,secondnothing,
  4811. secondrealconst,secondfixconst,secondumminus,
  4812. secondasm,secondvecn,
  4813. secondstringconst,secondfuncret,secondselfn,
  4814. secondnot,secondinline,secondniln,seconderror,
  4815. secondnothing,secondhnewn,secondhdisposen,secondnewn,
  4816. secondsimplenewdispose,secondnothing,secondsetcons,secondblockn,
  4817. secondstatement,secondnothing,secondifn,secondbreakn,
  4818. secondcontinuen,second_while_repeatn,second_while_repeatn,secondfor,
  4819. secondexitn,secondwith,secondcase,secondlabel,
  4820. secondgoto,secondsimplenewdispose,secondtryexcept,
  4821. secondraise,
  4822. secondnothing,secondtryfinally,secondon,secondis,
  4823. secondas,seconderror,
  4824. secondfail,secondadd,secondprocinline,
  4825. secondnothing,secondloadvmt);
  4826. var
  4827. oldcodegenerror : boolean;
  4828. oldlocalswitches : tlocalswitches;
  4829. oldpos : tfileposinfo;
  4830. begin
  4831. oldcodegenerror:=codegenerror;
  4832. oldlocalswitches:=aktlocalswitches;
  4833. oldpos:=aktfilepos;
  4834. aktfilepos:=p^.fileinfo;
  4835. aktlocalswitches:=p^.localswitches;
  4836. if not(p^.error) then
  4837. begin
  4838. codegenerror:=false;
  4839. procedures[p^.treetype](p);
  4840. p^.error:=codegenerror;
  4841. codegenerror:=codegenerror or oldcodegenerror;
  4842. end
  4843. else
  4844. codegenerror:=true;
  4845. aktlocalswitches:=oldlocalswitches;
  4846. aktfilepos:=oldpos;
  4847. end;
  4848. function do_secondpass(var p : ptree) : boolean;
  4849. begin
  4850. codegenerror:=false;
  4851. if not(p^.error) then
  4852. secondpass(p);
  4853. do_secondpass:=codegenerror;
  4854. end;
  4855. var
  4856. regvars : array[1..maxvarregs] of pvarsym;
  4857. regvars_para : array[1..maxvarregs] of boolean;
  4858. regvars_refs : array[1..maxvarregs] of longint;
  4859. parasym : boolean;
  4860. procedure searchregvars(p : psym);
  4861. var
  4862. i,j,k : longint;
  4863. begin
  4864. if (p^.typ=varsym) and ((pvarsym(p)^.var_options and vo_regable)<>0) then
  4865. begin
  4866. { walk through all momentary register variables }
  4867. for i:=1 to maxvarregs do
  4868. begin
  4869. { free register ? }
  4870. if regvars[i]=nil then
  4871. begin
  4872. regvars[i]:=pvarsym(p);
  4873. regvars_para[i]:=parasym;
  4874. break;
  4875. end;
  4876. { else throw out a variable ? }
  4877. j:=pvarsym(p)^.refs;
  4878. { parameter get a less value }
  4879. if parasym then
  4880. begin
  4881. if cs_littlesize in aktglobalswitches then
  4882. dec(j,1)
  4883. else
  4884. dec(j,100);
  4885. end;
  4886. if (j>regvars_refs[i]) and (j>0) then
  4887. begin
  4888. for k:=maxvarregs-1 downto i do
  4889. begin
  4890. regvars[k+1]:=regvars[k];
  4891. regvars_para[k+1]:=regvars_para[k];
  4892. end;
  4893. { calc the new refs
  4894. pvarsym(p)^.refs:=j; }
  4895. regvars[i]:=pvarsym(p);
  4896. regvars_para[i]:=parasym;
  4897. regvars_refs[i]:=j;
  4898. break;
  4899. end;
  4900. end;
  4901. end;
  4902. end;
  4903. procedure generatecode(var p : ptree);
  4904. var
  4905. i : longint;
  4906. regsize : topsize;
  4907. regi : tregister;
  4908. hr : preference;
  4909. label
  4910. nextreg;
  4911. begin
  4912. cleartempgen;
  4913. { when size optimization only count occurrence }
  4914. if cs_littlesize in aktglobalswitches then
  4915. t_times:=1
  4916. else
  4917. { reference for repetition is 100 }
  4918. t_times:=100;
  4919. { clear register count }
  4920. for regi:=R_D0 to R_A6 do
  4921. begin
  4922. reg_pushes[regi]:=0;
  4923. is_reg_var[regi]:=false;
  4924. end;
  4925. use_esp_stackframe:=false;
  4926. if not(do_firstpass(p)) then
  4927. begin
  4928. { max. optimizations }
  4929. { only if no asm is used }
  4930. if (cs_regalloc in aktglobalswitches) and
  4931. ((procinfo.flags and pi_uses_asm)=0) then
  4932. begin
  4933. { can we omit the stack frame ? }
  4934. { conditions:
  4935. 1. procedure (not main block)
  4936. 2. no constructor or destructor
  4937. 3. no call to other procedures
  4938. 4. no interrupt handler
  4939. }
  4940. if assigned(aktprocsym) then
  4941. begin
  4942. if (aktprocsym^.definition^.options and (poconstructor+podestructor+poinline+pointerrupt)=0) and
  4943. ((procinfo.flags and pi_do_call)=0) and (lexlevel>1) then
  4944. begin
  4945. { use ESP as frame pointer }
  4946. procinfo.framepointer:=R_SP;
  4947. use_esp_stackframe:=true;
  4948. { calc parameter distance new }
  4949. dec(procinfo.framepointer_offset,4);
  4950. dec(procinfo.ESI_offset,4);
  4951. dec(procinfo.retoffset,4);
  4952. dec(procinfo.call_offset,4);
  4953. aktprocsym^.definition^.parast^.call_offset:=procinfo.call_offset;
  4954. end;
  4955. end; { endif assigned }
  4956. if (p^.registers32<4) then
  4957. begin
  4958. for i:=1 to maxvarregs do
  4959. regvars[i]:=nil;
  4960. parasym:=false;
  4961. {$ifdef tp}
  4962. symtablestack^.foreach(searchregvars);
  4963. {$else}
  4964. symtablestack^.foreach(@searchregvars);
  4965. {$endif}
  4966. { copy parameter into a register ? }
  4967. parasym:=true;
  4968. {$ifdef tp}
  4969. symtablestack^.next^.foreach(searchregvars);
  4970. {$else}
  4971. symtablestack^.next^.foreach(@searchregvars);
  4972. {$endif}
  4973. { hold needed registers free }
  4974. for i:=maxvarregs downto maxvarregs-p^.registers32+1 do
  4975. regvars[i]:=nil;
  4976. { now assign register }
  4977. for i:=1 to maxvarregs do
  4978. begin
  4979. if assigned(regvars[i]) then
  4980. begin
  4981. { it is nonsens, to copy the variable to }
  4982. { a register because we need then much }
  4983. { pushes ? }
  4984. if reg_pushes[varregs[i]]>=regvars[i]^.refs then
  4985. begin
  4986. regvars[i]:=nil;
  4987. goto nextreg;
  4988. end;
  4989. { register is no longer available for }
  4990. { expressions }
  4991. { search the register which is the most }
  4992. { unused }
  4993. usableregs:=usableregs-[varregs[i]];
  4994. is_reg_var[varregs[i]]:=true;
  4995. dec(c_usableregs);
  4996. { possibly no 32 bit register are needed }
  4997. if (regvars[i]^.definition^.deftype=orddef) and
  4998. (
  4999. (porddef(regvars[i]^.definition)^.typ=bool8bit) or
  5000. (porddef(regvars[i]^.definition)^.typ=uchar) or
  5001. (porddef(regvars[i]^.definition)^.typ=u8bit) or
  5002. (porddef(regvars[i]^.definition)^.typ=s8bit)
  5003. ) then
  5004. begin
  5005. regvars[i]^.reg:=varregs[i];
  5006. regsize:=S_B;
  5007. end
  5008. else if (regvars[i]^.definition^.deftype=orddef) and
  5009. (
  5010. (porddef(regvars[i]^.definition)^.typ=u16bit) or
  5011. (porddef(regvars[i]^.definition)^.typ=s16bit)
  5012. ) then
  5013. begin
  5014. regvars[i]^.reg:=varregs[i];
  5015. regsize:=S_W;
  5016. end
  5017. else
  5018. begin
  5019. regvars[i]^.reg:=varregs[i];
  5020. regsize:=S_L;
  5021. end;
  5022. { parameter must be load }
  5023. if regvars_para[i] then
  5024. begin
  5025. { procinfo is there actual, }
  5026. { because we can't never be in a }
  5027. { nested procedure }
  5028. { when loading parameter to reg }
  5029. new(hr);
  5030. reset_reference(hr^);
  5031. hr^.offset:=pvarsym(regvars[i])^.address+procinfo.call_offset;
  5032. hr^.base:=procinfo.framepointer;
  5033. procinfo.aktentrycode^.concat(new(pai68k,op_ref_reg(A_MOVE,regsize,
  5034. hr,regvars[i]^.reg)));
  5035. unused:=unused - [regvars[i]^.reg];
  5036. end;
  5037. { procedure uses this register }
  5038. usedinproc:=usedinproc or ($800 shr word(varregs[i]));
  5039. end;
  5040. nextreg:
  5041. { dummy }
  5042. regsize:=S_W;
  5043. end;
  5044. if (status.verbosity and v_debug)=v_debug then
  5045. begin
  5046. for i:=1 to maxvarregs do
  5047. begin
  5048. if assigned(regvars[i]) then
  5049. Message3(cg_d_register_weight,reg2str(regvars[i]^.reg),
  5050. tostr(regvars[i]^.refs),regvars[i]^.name);
  5051. end;
  5052. end;
  5053. end;
  5054. end;
  5055. do_secondpass(p);
  5056. { all registers can be used again }
  5057. { contains both information on Address registers and data registers }
  5058. { even if they are allocated separately. }
  5059. usableregs:=[R_D0,R_D1,R_D2,R_D3,R_D4,R_D5,R_D6,R_D7,R_A0,R_A1,R_A2,R_A3,R_A4,
  5060. R_FP0,R_FP1,R_FP2,R_FP3,R_FP4,R_FP5,R_FP6,R_FP7];
  5061. c_usableregs:=4;
  5062. usableaddress:=3;
  5063. end;
  5064. procinfo.aktproccode^.concatlist(exprasmlist);
  5065. end;
  5066. end.
  5067. {
  5068. $Log$
  5069. Revision 1.15 1998-08-31 12:26:21 peter
  5070. * m68k and palmos updates from surebugfixes
  5071. Revision 1.14 1998/08/19 16:07:39 jonas
  5072. * changed optimizer switches + cleanup of DestroyRefs in daopt386.pas
  5073. Revision 1.13 1998/08/10 14:43:14 peter
  5074. * string type st_ fixed
  5075. Revision 1.12 1998/07/15 16:41:01 jonas
  5076. * fixed bug that caused the stackframe never to be omitted
  5077. Revision 1.11 1998/07/14 14:46:43 peter
  5078. * released NEWINPUT
  5079. Revision 1.10 1998/07/10 10:50:57 peter
  5080. * m68k updates
  5081. Revision 1.9 1998/07/06 15:51:16 michael
  5082. Added length checking for string reading
  5083. Revision 1.8 1998/06/12 10:32:22 pierre
  5084. * column problem hopefully solved
  5085. + C vars declaration changed
  5086. Revision 1.7 1998/06/09 16:01:36 pierre
  5087. + added procedure directive parsing for procvars
  5088. (accepted are popstack cdecl and pascal)
  5089. + added C vars with the following syntax
  5090. var C calias 'true_c_name';(can be followed by external)
  5091. reason is that you must add the Cprefix
  5092. which is target dependent
  5093. Revision 1.6 1998/06/08 13:13:36 pierre
  5094. + temporary variables now in temp_gen.pas unit
  5095. because it is processor independent
  5096. * mppc68k.bat modified to undefine i386 and support_mmx
  5097. (which are defaults for i386)
  5098. Revision 1.5 1998/06/04 23:51:34 peter
  5099. * m68k compiles
  5100. + .def file creation moved to gendef.pas so it could also be used
  5101. for win32
  5102. Revision 1.4 1998/04/29 10:33:44 pierre
  5103. + added some code for ansistring (not complete nor working yet)
  5104. * corrected operator overloading
  5105. * corrected nasm output
  5106. + started inline procedures
  5107. + added starstarn : use ** for exponentiation (^ gave problems)
  5108. + started UseTokenInfo cond to get accurate positions
  5109. Revision 1.3 1998/04/07 22:45:03 florian
  5110. * bug0092, bug0115 and bug0121 fixed
  5111. + packed object/class/array
  5112. }