FoxIntermediateBackend.Mod 516 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, ActiveCells := FoxActiveCells;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. TYPE
  78. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  79. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  80. Operand = RECORD
  81. mode: SHORTINT;
  82. op: IntermediateCode.Operand;
  83. tag: IntermediateCode.Operand;
  84. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  85. dimOffset: LONGINT;
  86. END;
  87. Fixup= POINTER TO RECORD
  88. pc: LONGINT;
  89. nextFixup: Fixup;
  90. END;
  91. WriteBackCall = POINTER TO RECORD
  92. call: SyntaxTree.ProcedureCallDesignator;
  93. next: WriteBackCall;
  94. END;
  95. Label= OBJECT
  96. VAR
  97. fixups: Fixup;
  98. section: IntermediateCode.Section;
  99. pc: LONGINT;
  100. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  101. BEGIN
  102. SELF.section := section; pc := -1;
  103. END InitLabel;
  104. PROCEDURE Resolve(pc: LONGINT);
  105. VAR at: LONGINT;
  106. BEGIN
  107. SELF.pc := pc;
  108. WHILE(fixups # NIL) DO
  109. at := fixups.pc;
  110. section.PatchAddress(at,pc);
  111. fixups := fixups.nextFixup;
  112. END;
  113. END Resolve;
  114. PROCEDURE AddFixup(at: LONGINT);
  115. VAR fixup: Fixup;
  116. BEGIN
  117. ASSERT(pc=-1);
  118. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  119. END AddFixup;
  120. END Label;
  121. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  122. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  123. VAR
  124. backend: IntermediateBackend;
  125. implementationVisitor: ImplementationVisitor;
  126. meta: MetaDataGenerator;
  127. system: Global.System;
  128. currentScope: SyntaxTree.Scope;
  129. module: Sections.Module;
  130. moduleSelf: SyntaxTree.Variable;
  131. dump: BOOLEAN;
  132. forceModuleBody: BOOLEAN;
  133. addressType: IntermediateCode.Type;
  134. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  135. BEGIN
  136. currentScope := NIL; module := NIL; moduleSelf := NIL;
  137. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  138. SELF.dump := dump;
  139. SELF.backend := backend;
  140. SELF.forceModuleBody := forceModuleBody;
  141. addressType := IntermediateCode.GetType(system,system.addressType)
  142. END Init;
  143. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  144. BEGIN
  145. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  146. END Error;
  147. PROCEDURE Type(x: SyntaxTree.Type);
  148. BEGIN
  149. x.Accept(SELF);
  150. END Type;
  151. (** types **)
  152. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  153. BEGIN (* no code emission *) END VisitBasicType;
  154. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  155. BEGIN (* no code emission *) END VisitCharacterType;
  156. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  157. BEGIN (* no code emission *) END VisitIntegerType;
  158. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  159. BEGIN (* no code emission *) END VisitFloatType;
  160. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  161. BEGIN (* no code emission *) END VisitComplexType;
  162. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  163. VAR type: SyntaxTree.Type;
  164. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  165. type := x.resolved;
  166. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  167. meta.CheckTypeDeclaration(type);
  168. END;
  169. END VisitQualifiedType;
  170. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  171. BEGIN (* no code emission *) END VisitStringType;
  172. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  173. BEGIN (* no code emission *)
  174. END VisitArrayRangeType;
  175. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  176. BEGIN (* no code emission *) END VisitArrayType;
  177. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  178. BEGIN
  179. meta.CheckTypeDeclaration(x);
  180. END VisitMathArrayType;
  181. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  182. BEGIN
  183. meta.CheckTypeDeclaration(x);
  184. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  185. END VisitPointerType;
  186. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  187. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  188. BEGIN (* no code emission *)
  189. meta.CheckTypeDeclaration(x);
  190. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  191. IF x.pointerType.typeDeclaration # NIL THEN
  192. td := x.pointerType.typeDeclaration
  193. ELSE
  194. td := x.typeDeclaration
  195. END;
  196. Global.GetSymbolName(td,name);
  197. (* code section for object *)
  198. END;
  199. Scope(x.recordScope);
  200. END VisitRecordType;
  201. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  202. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  203. BEGIN
  204. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  205. WHILE (this # NIL) & (this.identifier# id) DO
  206. this := this.nextModifier;
  207. END;
  208. RETURN this # NIL
  209. END HasFlag;
  210. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  211. VAR name:Basic.SegmentedName; td: SyntaxTree.TypeDeclaration; type: SyntaxTree.Type; len,port,adr: LONGINT;
  212. parameter: SyntaxTree.Parameter; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  213. PROCEDURE CreatePortArray(type: SyntaxTree.Type; len: LONGINT);
  214. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  215. BEGIN
  216. FOR i := 0 TO len-1 DO
  217. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  218. CreatePortArray(baseType, len2);
  219. ELSE
  220. IF backend.cellsAreObjects THEN
  221. adr := port
  222. ELSE
  223. (*! add check from ActiveCells2 *)
  224. adr := backend.activeCellsSpecification.GetPortAddress(port);
  225. END;
  226. IntermediateCode.InitImmediate(op,addressType,adr);
  227. symbol.Emit(Data(-1,op));
  228. INC(port);
  229. END;
  230. END;
  231. END CreatePortArray;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. IF (x.cellScope.ownerModule = module.module) THEN
  235. td := x.typeDeclaration;
  236. Global.GetSymbolSegmentedName(td,name);
  237. (* code section for object *)
  238. END;
  239. port := 0;
  240. parameter := x.firstParameter;
  241. WHILE parameter # NIL DO
  242. type := parameter.type.resolved;
  243. IF type IS SyntaxTree.PortType THEN
  244. len := 1;
  245. INC(port);
  246. ELSIF SemanticChecker.IsStaticArray(type,type,len) OR SemanticChecker.IsDynamicArray(type, type) THEN
  247. IF backend.cellsAreObjects THEN
  248. IF IsStaticArray(parameter.type.resolved) THEN
  249. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  250. END;
  251. (* do nothing *)
  252. ELSE
  253. Global.GetSymbolSegmentedName(parameter,name);
  254. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,parameter,dump);
  255. CreatePortArray(type, len);
  256. (*
  257. WHILE len > 0 DO
  258. adr := backend.activeCellsSpecification.GetPortAddress(port);
  259. IntermediateCode.InitImmediate(op,addressType,adr);
  260. symbol.Emit(Data(-1,op));
  261. DEC(len); INC(port);
  262. END;
  263. *)
  264. END;
  265. ELSE
  266. Error(parameter.position,"should never happen, check semantic checker!");
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. capabilities := {};
  271. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  272. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  273. backend.SetCapabilities(capabilities);
  274. Scope(x.cellScope);
  275. END VisitCellType;
  276. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  277. BEGIN (* no code emission *) END VisitProcedureType;
  278. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  279. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  280. END VisitEnumerationType;
  281. (* symbols *)
  282. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  283. BEGIN
  284. Procedure(x);
  285. END VisitProcedure;
  286. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  287. BEGIN
  288. Procedure(x);
  289. END VisitOperator;
  290. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  291. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section;
  292. BEGIN
  293. IF x.externalName # NIL THEN RETURN END;
  294. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  295. (* code section for variable *)
  296. Global.GetSymbolSegmentedName(x,name);
  297. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  298. irv.SetExported(IsExported(x));
  299. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  302. meta.CheckTypeDeclaration(x.type);
  303. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  304. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  305. END;
  306. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  307. END VisitVariable;
  308. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  309. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  310. BEGIN
  311. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  312. (* code section for variable *)
  313. Global.GetSymbolSegmentedName(x,name);
  314. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  315. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  316. (*
  317. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  318. *)
  319. IF x.defaultValue = NIL THEN
  320. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  321. ELSE
  322. implementationVisitor.inData := TRUE;
  323. implementationVisitor.Evaluate(x.defaultValue, op);
  324. irv.Emit(Data(x.position,op.op));
  325. implementationVisitor.inData := FALSE;
  326. END;
  327. meta.CheckTypeDeclaration(x.type);
  328. END VisitParameter;
  329. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  330. BEGIN
  331. Type(x.declaredType); (* => code in objects *)
  332. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  333. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  334. END;
  335. END VisitTypeDeclaration;
  336. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  337. BEGIN
  338. IF (SyntaxTree.Public * x.access # {}) THEN
  339. implementationVisitor.VisitConstant(x);
  340. END;
  341. END VisitConstant;
  342. PROCEDURE Scope(x: SyntaxTree.Scope);
  343. VAR procedure: SyntaxTree.Procedure;
  344. constant: SyntaxTree.Constant;
  345. variable: SyntaxTree.Variable;
  346. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  347. BEGIN
  348. prevScope := currentScope;
  349. currentScope := x;
  350. (* constants treated in implementation visitor *)
  351. typeDeclaration := x.firstTypeDeclaration;
  352. WHILE typeDeclaration # NIL DO
  353. VisitTypeDeclaration(typeDeclaration);
  354. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  355. END;
  356. variable := x.firstVariable;
  357. WHILE variable # NIL DO
  358. VisitVariable(variable);
  359. variable := variable.nextVariable;
  360. END;
  361. procedure := x.firstProcedure;
  362. WHILE procedure # NIL DO
  363. VisitProcedure(procedure);
  364. procedure := procedure.nextProcedure;
  365. END;
  366. constant := x.firstConstant;
  367. WHILE constant # NIL DO
  368. VisitConstant(constant);
  369. constant := constant.nextConstant;
  370. END;
  371. currentScope := prevScope;
  372. END Scope;
  373. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  374. VAR parameter: SyntaxTree.Parameter;
  375. BEGIN
  376. parameter := first;
  377. WHILE parameter # NIL DO
  378. VisitParameter(parameter);
  379. parameter := parameter.nextParameter;
  380. END;
  381. END Parameters;
  382. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  383. VAR scope: SyntaxTree.ProcedureScope;
  384. prevScope: SyntaxTree.Scope;
  385. inline, finalizer: BOOLEAN;
  386. procedureType: SyntaxTree.ProcedureType;
  387. pc: LONGINT;
  388. stackSize: LONGINT;
  389. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  390. null,size,src,dest,fp,res: IntermediateCode.Operand;
  391. cc: LONGINT;
  392. cellType: SyntaxTree.CellType;
  393. registerNumber: LONGINT;
  394. registerClass: IntermediateCode.RegisterClass;
  395. type: IntermediateCode.Type;
  396. formalParameter: SyntaxTree.Parameter;
  397. recordType: SyntaxTree.RecordType;
  398. isModuleBody: BOOLEAN;
  399. PROCEDURE Signature;
  400. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  401. BEGIN
  402. procedureType := x.type(SyntaxTree.ProcedureType);
  403. returnType := procedureType.returnType;
  404. IF returnType # NIL THEN
  405. meta.CheckTypeDeclaration(returnType)
  406. END;
  407. parameter := procedureType.firstParameter;
  408. WHILE parameter # NIL DO
  409. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  410. parameter := parameter.nextParameter;
  411. END;
  412. END Signature;
  413. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  414. VAR result: BOOLEAN;
  415. BEGIN
  416. result := FALSE;
  417. IF x = SyntaxTree.invalidExpression THEN
  418. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  419. result := TRUE;
  420. value := x.resolved(SyntaxTree.IntegerValue).value;
  421. ELSE
  422. Error(x.position,"expression is not an integer constant");
  423. END;
  424. RETURN result;
  425. END CheckIntegerValue;
  426. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  427. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  428. BEGIN
  429. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  430. WHILE (this # NIL) & (this.identifier # id) DO
  431. this := this.nextModifier;
  432. END;
  433. IF this # NIL THEN
  434. IF this.expression = NIL THEN
  435. Error(this.position,"expected expression value");
  436. ELSIF CheckIntegerValue(this.expression,value) THEN
  437. END;
  438. RETURN TRUE
  439. ELSE RETURN FALSE
  440. END;
  441. END HasValue;
  442. BEGIN
  443. IF x.externalName # NIL THEN RETURN END;
  444. (*
  445. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  446. *)
  447. (* code section for this procedure *)
  448. scope := x.procedureScope;
  449. prevScope := currentScope;
  450. currentScope := scope;
  451. procedureType := x.type(SyntaxTree.ProcedureType);
  452. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  453. implementationVisitor.temporaries.Init;
  454. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  455. IF (scope.body # NIL) & (x.isInline) THEN
  456. inline := TRUE;
  457. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  458. ir.SetExported(IsExported(x));
  459. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  460. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  461. IF backend.cellsAreObjects THEN
  462. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  463. ir.SetExported(IsExported(x));
  464. ELSE
  465. RETURN; (* cellnet cannot be compiled for final static hardware *)
  466. END;
  467. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  468. inline := FALSE;
  469. AddBodyCallStub(x);
  470. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  471. ir.SetExported(IsExported(x));
  472. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  473. inline := FALSE;
  474. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  475. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := ActiveCells.defaultDataMemorySize END;
  476. AddBodyCallStub(x);
  477. AddStackAllocation(x,stackSize);
  478. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  479. ir.SetExported(IsExported(x));
  480. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  481. inline := FALSE;
  482. Parameters(procedureType.firstParameter);
  483. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  484. ir.SetExported(IsExported(x));
  485. ELSE
  486. inline := FALSE;
  487. IF x.isEntry OR x.isExit THEN
  488. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  489. ir.SetExported(TRUE);
  490. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  491. ELSE
  492. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  493. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  494. END;
  495. END;
  496. cc := procedureType.callingConvention;
  497. IF scope.body # NIL THEN
  498. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  499. registerNumber := 0;
  500. IF ~inline THEN
  501. IF scope.lastVariable = NIL THEN
  502. stackSize := 0
  503. ELSE
  504. stackSize := scope.lastVariable.offsetInBits;
  505. IF stackSize <0 THEN stackSize := -stackSize END;
  506. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  507. END;
  508. (*
  509. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  510. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  511. *)
  512. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  513. pc := ir.pc-1;
  514. (*
  515. ir.Emit(Nop(position)); (* placeholder for fill *)
  516. *)
  517. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  518. formalParameter := procedureType.lastParameter;
  519. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  520. IF ~PassInRegister(formalParameter) THEN
  521. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  522. ELSE
  523. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  524. type := GetType(system, formalParameter.type);
  525. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  526. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  527. ir.Emit(Mov(-1,dest, src));
  528. implementationVisitor.ReleaseIntermediateOperand(src);
  529. INC(registerNumber);
  530. formalParameter := formalParameter.prevParameter;
  531. END;
  532. END;
  533. END;
  534. ir.EnterValidPAF;
  535. END;
  536. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  537. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  538. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  539. IF scope.lastVariable # NIL THEN
  540. stackSize := scope.lastVariable.offsetInBits;
  541. IF stackSize <0 THEN stackSize := -stackSize END;
  542. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  543. END;
  544. END;
  545. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  546. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  547. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  548. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  549. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  550. ir.EmitAt(pc,Push(size));
  551. implementationVisitor.StaticCallOperand(result,procedure);
  552. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  553. END;
  554. *)
  555. END;
  556. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  557. IF stackSize > 0 THEN
  558. IF (stackSize MOD system.addressSize = 0) THEN
  559. null := IntermediateCode.Immediate(addressType,0);
  560. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  561. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  562. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  563. ELSE
  564. null := IntermediateCode.Immediate(int8,0);
  565. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  566. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  567. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  568. END;
  569. (*! should potentially be called by backend -- enter might initialize
  570. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  571. *)
  572. END;
  573. ir.ExitValidPAF;
  574. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  575. finalizer := FALSE;
  576. IF backend.cooperative & x.isFinalizer THEN
  577. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  578. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  579. GetRecordTypeName(recordType,name);
  580. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  581. END;
  582. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  583. IF backend.cooperative THEN
  584. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  585. IF implementationVisitor.profile & ~isModuleBody THEN
  586. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  587. END;
  588. END;
  589. implementationVisitor.EmitLeave(ir, x.position,cc);
  590. IF finalizer THEN
  591. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  592. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  593. ir.Emit(Br(x.position,dest));
  594. ELSE
  595. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  596. END;
  597. ELSE
  598. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  599. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  600. END;
  601. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  602. IF backend.cooperative THEN
  603. IF HasPointers (scope) THEN
  604. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  605. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  606. ir.Emit(Result(x.position, res));
  607. ir.Emit(Push(x.position, res));
  608. implementationVisitor.ResetVariables(scope);
  609. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  610. ir.Emit(Pop(x.position, res));
  611. ir.Emit(Return(x.position, res));
  612. ELSE
  613. implementationVisitor.ResetVariables(scope);
  614. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  615. END;
  616. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  617. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  618. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  619. ir.Emit(Result(x.position, res));
  620. ir.Emit(Push(x.position, res));
  621. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  622. ir.Emit(Pop(x.position, res));
  623. ir.Emit(Return(x.position, res));
  624. ELSE
  625. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  626. END;
  627. END;
  628. implementationVisitor.EmitLeave(ir,x.position,cc);
  629. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  630. ELSE
  631. ir.Emit(Nop(x.position));
  632. END;
  633. END
  634. END;
  635. ELSE (* force body for procedures *)
  636. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  637. ir.EnterValidPAF;
  638. implementationVisitor.usedRegisters := NIL;
  639. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  640. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  641. ir.ExitValidPAF;
  642. implementationVisitor.EmitLeave(ir,x.position,cc);
  643. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  644. END;
  645. Scope(scope);
  646. Signature;
  647. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  648. currentScope := prevScope;
  649. END Procedure;
  650. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  651. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  652. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  653. BEGIN
  654. ASSERT (bodyProcedure # NIL);
  655. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  656. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  657. procedure.SetScope(bodyProcedure.scope);
  658. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  659. procedure.SetAccess(SyntaxTree.Hidden);
  660. Global.GetSymbolSegmentedName (procedure,name);
  661. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  662. ir.SetExported(TRUE);
  663. ir.SetPriority(InitPriority);
  664. Global.GetSymbolSegmentedName (bodyProcedure,name);
  665. IF backend.newObjectFile OR backend.cooperative THEN
  666. implementationVisitor.currentScope := module.module.moduleScope;
  667. implementationVisitor.section := ir;
  668. implementationVisitor.PushSelfPointer();
  669. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  670. ELSIF backend.preregisterStatic THEN
  671. implementationVisitor.currentScope := module.module.moduleScope;
  672. implementationVisitor.section := ir;
  673. implementationVisitor.PushSelfPointer();
  674. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  675. ELSE
  676. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  677. ir.Emit(Call(bodyProcedure.position,op, 0));
  678. END;
  679. END AddBodyCallStub;
  680. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  681. VAR name: Basic.SegmentedName;
  682. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  683. BEGIN
  684. Global.GetSymbolSegmentedName (symbol,name);
  685. Basic.RemoveSuffix(name);
  686. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  687. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  688. ir.SetExported(TRUE);
  689. ir.SetPriority(FirstPriority);
  690. IntermediateCode.InitImmediate(op,addressType,initStack);
  691. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  692. END AddStackAllocation;
  693. (** entry function to visit a complete module *)
  694. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  695. VAR
  696. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  697. hasDynamicOperatorDeclarations: BOOLEAN;
  698. operator: SyntaxTree.Operator;
  699. import: SyntaxTree.Import;
  700. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  701. BEGIN
  702. type := type.resolved;
  703. IF type IS SyntaxTree.RecordType THEN
  704. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  705. ELSIF (type IS SyntaxTree.ArrayType) THEN
  706. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  707. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  708. END;
  709. ELSIF type IS SyntaxTree.MathArrayType THEN
  710. WITH type: SyntaxTree.MathArrayType DO
  711. IF type.form = SyntaxTree.Open THEN
  712. RETURN TRUE
  713. ELSIF type.form = SyntaxTree.Static THEN
  714. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  715. END;
  716. END;
  717. END;
  718. RETURN FALSE
  719. END TypeNeedsInitialization;
  720. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  721. VAR variable: SyntaxTree.Variable;
  722. BEGIN
  723. variable := scope.firstVariable;
  724. WHILE variable # NIL DO
  725. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  726. IF variable.initializer # NIL THEN RETURN TRUE END;
  727. variable := variable.nextVariable;
  728. END;
  729. RETURN FALSE
  730. END ScopeNeedsInitialization;
  731. BEGIN
  732. ASSERT(x # NIL); ASSERT(module # NIL);
  733. SELF.module := module;
  734. (* add import names to the generated Sections.Module *)
  735. import := x.moduleScope.firstImport;
  736. WHILE import # NIL DO
  737. import.module.GetName(idstr);
  738. module.imports.AddName(idstr);
  739. import := import.nextImport
  740. END;
  741. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  742. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  743. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  744. moduleSelf.SetType(system.anyType);
  745. moduleSelf.SetScope(x.moduleScope);
  746. moduleSelf.SetUntraced(TRUE);
  747. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  748. ir.SetExported(TRUE);
  749. IntermediateCode.InitImmediate(op,addressType,0);
  750. ir.Emit(Data(-1,op));
  751. END;
  752. implementationVisitor.module := module;
  753. implementationVisitor.moduleScope := x.moduleScope;
  754. implementationVisitor.moduleSelf := moduleSelf;
  755. implementationVisitor.canBeLoaded := TRUE;
  756. meta.SetModule(module);
  757. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  758. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  759. END;
  760. IF backend.profile THEN
  761. EnsureBodyProcedure(x.moduleScope);
  762. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  763. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  764. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  765. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  766. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  767. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  768. Global.GetModuleName(module.module,idstr);
  769. implementationVisitor.ProfilerAddModule(idstr);
  770. implementationVisitor.numberProcedures := 0;
  771. END;
  772. implementationVisitor.profile := backend.profile;
  773. (* check if there is at least one dynamic operator locally defined *)
  774. hasDynamicOperatorDeclarations := FALSE;
  775. operator := x.moduleScope.firstOperator;
  776. WHILE operator # NIL DO
  777. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  778. operator := operator.nextOperator
  779. END;
  780. (* add operator initialization code section *)
  781. IF hasDynamicOperatorDeclarations THEN
  782. EnsureBodyProcedure(x.moduleScope);
  783. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  784. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  785. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  786. END;
  787. Scope(x.moduleScope);
  788. IF hasDynamicOperatorDeclarations THEN
  789. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  790. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  791. END;
  792. IF backend.profile THEN
  793. implementationVisitor.ProfilerPatchInit;
  794. END;
  795. END Module;
  796. END DeclarationVisitor;
  797. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  798. RegisterUsageCount*=OBJECT
  799. VAR used: UsedArray; count: LONGINT;
  800. PROCEDURE &Init;
  801. VAR i: LONGINT;
  802. BEGIN
  803. count := 0;
  804. IF used = NIL THEN NEW(used,64); END;
  805. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  806. END Init;
  807. PROCEDURE Grow;
  808. VAR new: UsedArray; size,i: LONGINT;
  809. BEGIN
  810. size := LEN(used)*2;
  811. NEW(new,size);
  812. FOR i := 0 TO LEN(used)-1 DO
  813. new[i].count := used[i].count;
  814. new[i].type := used[i].type;
  815. new[i].map := used[i].map
  816. END;
  817. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  818. used := new
  819. END Grow;
  820. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  821. BEGIN
  822. INC(count);
  823. IF count = LEN(used) THEN Grow END;
  824. used[count].type := type;
  825. used[count].class := class;
  826. used[count].map := count;
  827. RETURN count;
  828. END Next;
  829. PROCEDURE IncUse(register: LONGINT);
  830. BEGIN
  831. INC(used[register].count);
  832. (*
  833. IF (register = 1) & (count > 30) THEN
  834. D.TraceBack;
  835. END;
  836. *)
  837. END IncUse;
  838. PROCEDURE DecUse(register: LONGINT);
  839. BEGIN
  840. DEC(used[register].count);
  841. END DecUse;
  842. PROCEDURE Map(register: LONGINT): LONGINT;
  843. VAR map : LONGINT;
  844. BEGIN
  845. IF register > 0 THEN
  846. map := used[register].map;
  847. WHILE register # map DO register := map; map := used[register].map END;
  848. END;
  849. RETURN register
  850. END Map;
  851. PROCEDURE Remap(register: LONGINT; to: LONGINT);
  852. BEGIN
  853. used[register].map:= to;
  854. used[to].count := used[register].count;
  855. used[register].count := 0;
  856. END Remap;
  857. PROCEDURE Use(register: LONGINT): LONGINT;
  858. BEGIN
  859. IF register< LEN(used) THEN
  860. RETURN used[register].count
  861. ELSE
  862. RETURN 0
  863. END
  864. END Use;
  865. END RegisterUsageCount;
  866. RegisterEntry = POINTER TO RECORD
  867. prev,next: RegisterEntry;
  868. register: LONGINT;
  869. registerClass: IntermediateCode.RegisterClass;
  870. type: IntermediateCode.Type;
  871. END;
  872. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  873. Variables = OBJECT (Basic.List)
  874. VAR
  875. inUse: VariableUse;
  876. registerIndex: LONGINT;
  877. PROCEDURE & Init;
  878. VAR i: LONGINT;
  879. BEGIN
  880. InitList(16);
  881. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  882. registerIndex := 1024;
  883. END Init;
  884. PROCEDURE GetUsage(VAR use: VariableUse);
  885. BEGIN
  886. use := inUse;
  887. END GetUsage;
  888. PROCEDURE SetUsage(CONST use: VariableUse);
  889. BEGIN
  890. inUse := use;
  891. END SetUsage;
  892. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  893. VAR any: ANY;
  894. BEGIN
  895. any := Get(i);;
  896. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  897. END GetVariable;
  898. PROCEDURE Occupy(pos: LONGINT);
  899. BEGIN
  900. INCL(inUse[pos DIV 32], pos MOD 32);
  901. END Occupy;
  902. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  903. BEGIN
  904. Occupy(Length());
  905. Add(v);
  906. END AddVariable;
  907. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  908. VAR var : SyntaxTree.Variable;
  909. BEGIN
  910. FOR pos := 0 TO Length()-1 DO
  911. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  912. var := GetVariable(pos);
  913. IF type.SameType(var.type) THEN
  914. Occupy(pos); RETURN var
  915. END;
  916. END;
  917. END;
  918. pos := Length();
  919. RETURN NIL
  920. END GetFreeVariable;
  921. END Variables;
  922. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  923. SymbolMapper = OBJECT
  924. VAR
  925. first: SymbolMap;
  926. PROCEDURE & Init;
  927. BEGIN
  928. first := NIL;
  929. END Init;
  930. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  931. VAR new: SymbolMap;
  932. BEGIN
  933. NEW(new); new.this := this; new.to := to; new.tag := tag;
  934. new.next := first; first := new;
  935. END Add;
  936. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  937. VAR s: SymbolMap;
  938. BEGIN
  939. s := first;
  940. WHILE (s # NIL) & (s.this # this) DO
  941. s := s.next
  942. END;
  943. RETURN s
  944. END Get;
  945. END SymbolMapper;
  946. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  947. VAR
  948. system: Global.System;
  949. section: IntermediateCode.Section;
  950. module: Sections.Module;
  951. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  952. awaitProcCounter, labelId, constId, caseId: LONGINT;
  953. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  954. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  955. checker: SemanticChecker.Checker;
  956. backend: IntermediateBackend;
  957. meta: MetaDataGenerator;
  958. position: LONGINT;
  959. moduleSelf: SyntaxTree.Variable;
  960. (* variables for hand over of variables / temporary state *)
  961. currentScope: SyntaxTree.Scope;
  962. constantDeclaration : SyntaxTree.Symbol;
  963. result: Operand; (* result of the most recent expression / statement *)
  964. destination: IntermediateCode.Operand;
  965. arrayDestinationTag: IntermediateCode.Operand;
  966. arrayDestinationDimension:LONGINT;
  967. currentLoop: Label; (* variable to hand over loop exit jump list *)
  968. conditional: BOOLEAN;
  969. trueLabel, falseLabel, exitLabel: Label;
  970. locked: BOOLEAN;
  971. (*
  972. usedRegisters: Registers;
  973. *)
  974. registerUsageCount: RegisterUsageCount;
  975. usedRegisters: RegisterEntry;
  976. (* useful operands and types *)
  977. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  978. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  979. commentPrintout: Printout.Printer;
  980. dump: Streams.Writer;
  981. tagsAvailable : BOOLEAN;
  982. supportedInstruction: SupportedInstructionProcedure;
  983. supportedImmediate: SupportedImmediateProcedure;
  984. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  985. emitLabels: BOOLEAN;
  986. runtimeModuleName : SyntaxTree.IdentifierString;
  987. newObjectFile: BOOLEAN;
  988. indexCounter: LONGINT;
  989. profile: BOOLEAN;
  990. profileId, profileInit: IntermediateCode.Section;
  991. profileInitPatchPosition: LONGINT;
  992. numberProcedures: LONGINT;
  993. procedureResultDesignator : SyntaxTree.Designator;
  994. operatorInitializationCodeSection: IntermediateCode.Section;
  995. fingerPrinter: FingerPrinter.FingerPrinter;
  996. temporaries: Variables;
  997. canBeLoaded : BOOLEAN;
  998. currentIsInline: BOOLEAN;
  999. currentMapper: SymbolMapper;
  1000. currentInlineExit: Label;
  1001. moduleBodySection: IntermediateCode.Section;
  1002. NeedDescriptor : BOOLEAN;
  1003. cooperativeSwitches: BOOLEAN;
  1004. lastSwitchPC: LONGINT;
  1005. isUnchecked: BOOLEAN;
  1006. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1007. newObjectFile: BOOLEAN);
  1008. BEGIN
  1009. SELF.system := system;
  1010. SELF.runtimeModuleName := runtime;
  1011. currentScope := NIL;
  1012. hiddenPointerType := NIL;
  1013. delegatePointerType := NIL;
  1014. awaitProcCounter := 0;
  1015. labelId := 0; constId := 0; labelId := 0;
  1016. SELF.checker := checker;
  1017. SELF.backend := backend;
  1018. position := Diagnostics.Invalid;
  1019. conditional := FALSE;
  1020. locked := FALSE;
  1021. InitOperand(result,ModeUndefined);
  1022. addressType := IntermediateCode.GetType(system,system.addressType);
  1023. setType := IntermediateCode.GetType(system,system.setType);
  1024. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1025. byteType := IntermediateCode.GetType(system, system.byteType);
  1026. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1027. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1028. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1029. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1030. nil := IntermediateCode.Immediate(addressType,0);
  1031. IntermediateCode.InitOperand(destination);
  1032. tagsAvailable := TRUE;
  1033. supportedInstruction := supportedInstructionProcedure;
  1034. supportedImmediate := supportedImmediateProcedure;
  1035. inData := FALSE;
  1036. SELF.emitLabels := emitLabels;
  1037. IntermediateCode.InitOperand(arrayDestinationTag);
  1038. bool := IntermediateCode.GetType(system,system.booleanType);
  1039. IntermediateCode.InitImmediate(false,bool,0);
  1040. IntermediateCode.InitImmediate(true,bool,1);
  1041. SELF.newObjectFile := newObjectFile;
  1042. indexCounter := 0;
  1043. NEW(registerUsageCount);
  1044. usedRegisters := NIL;
  1045. procedureResultDesignator := NIL;
  1046. NEW(fingerPrinter, system);
  1047. NEW(temporaries);
  1048. currentIsInline := FALSE;
  1049. NeedDescriptor := FALSE;
  1050. isUnchecked := backend.noRuntimeChecks;
  1051. END Init;
  1052. TYPE Context = RECORD
  1053. section: IntermediateCode.Section;
  1054. registerUsageCount: RegisterUsageCount;
  1055. usedRegisters: RegisterEntry;
  1056. END;
  1057. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1058. VAR context: Context;
  1059. BEGIN
  1060. context.section := section;
  1061. context.registerUsageCount := registerUsageCount;
  1062. context.usedRegisters := usedRegisters;
  1063. section := new;
  1064. NEW(registerUsageCount);
  1065. usedRegisters := NIL;
  1066. RETURN context;
  1067. END SwitchContext;
  1068. PROCEDURE ReturnToContext(context: Context);
  1069. BEGIN
  1070. section := context.section;
  1071. registerUsageCount := context.registerUsageCount;
  1072. usedRegisters := context.usedRegisters;
  1073. END ReturnToContext;
  1074. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1075. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1076. BEGIN
  1077. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1078. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1079. END;
  1080. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1081. section.SetExported(IsExported(syntaxTreeSymbol));
  1082. RETURN section
  1083. END NewSection;
  1084. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1085. VAR new: LONGINT;
  1086. BEGIN
  1087. new := registerUsageCount.Next(type,class);
  1088. UseRegister(new);
  1089. RETURN new
  1090. END AcquireRegister;
  1091. (** get the name for the code section that represens a certain symbol
  1092. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1093. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1094. VAR
  1095. operatorFingerPrint: SyntaxTree.FingerPrint;
  1096. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1097. BEGIN
  1098. Global.GetSymbolSegmentedName(symbol, name);
  1099. (* if the symbol is an operator, then append the fingerprint to the name *)
  1100. IF symbol IS SyntaxTree.Operator THEN
  1101. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1102. string := "[";
  1103. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1104. Strings.Append(string, operatorFingerPrintString);
  1105. Strings.Append(string, "]");
  1106. Basic.AppendToSegmentedName(name,string);
  1107. END
  1108. END GetCodeSectionNameForSymbol;
  1109. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1110. BEGIN
  1111. IF dump # NIL THEN
  1112. dump.String("enter "); dump.String(s); dump.Ln;
  1113. END;
  1114. END TraceEnter;
  1115. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1116. BEGIN
  1117. IF dump # NIL THEN
  1118. dump.String("exit "); dump.String(s); dump.Ln;
  1119. END;
  1120. END TraceExit;
  1121. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1122. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1123. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1124. VAR i: LONGINT;
  1125. BEGIN
  1126. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1127. IF op.rule # NIL THEN
  1128. FOR i := 0 TO LEN(op.rule)-1 DO
  1129. CheckRegister(op.rule[i])
  1130. END;
  1131. END;
  1132. END CheckRegister;
  1133. BEGIN
  1134. CheckRegister(instruction.op1);
  1135. CheckRegister(instruction.op2);
  1136. CheckRegister(instruction.op3);
  1137. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1138. ELSE section.Emit(instruction);
  1139. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1140. END;
  1141. END Emit;
  1142. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1143. BEGIN
  1144. IF backend.cooperative THEN
  1145. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1146. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1147. ELSE
  1148. Emit(Trap(position,trapNo));
  1149. END;
  1150. END EmitTrap;
  1151. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1152. VAR name: Basic.SegmentedName;
  1153. VAR op1, op2, reg: IntermediateCode.Operand;
  1154. VAR call, nocall: Label;
  1155. VAR parametersSize: LONGINT;
  1156. VAR prevSection: IntermediateCode.Section;
  1157. BEGIN
  1158. prevSection := SELF.section;
  1159. SELF.section := section;
  1160. IF backend.hasLinkRegister THEN
  1161. Emit(Push(-1, lr));
  1162. END;
  1163. Emit(Push(-1,fp));
  1164. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1165. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1166. GetCodeSectionNameForSymbol(procedure, name);
  1167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1168. ELSE
  1169. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1170. END;
  1171. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1172. Emit(Push(-1,op1));
  1173. Emit(Mov(-1,fp, sp));
  1174. NEW(call, section);
  1175. NEW(nocall, section);
  1176. reg := NewRegisterOperand(addressType);
  1177. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1178. Emit(Sub(-1,reg, sp, op1));
  1179. BrltL(call, sp, reg);
  1180. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1181. BrgeL(nocall, sp, op2);
  1182. call.Resolve(section.pc);
  1183. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1184. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1185. Emit(Push(-1, op2));
  1186. Emit(Push(-1, reg));
  1187. ReleaseIntermediateOperand(reg);
  1188. CallThis(position, "Activities","ExpandStack",0);
  1189. Emit(Result(-1, sp));
  1190. ReleaseIntermediateOperand(reg);
  1191. nocall.Resolve(section.pc);
  1192. ELSE
  1193. Emit(Mov(-1, fp, sp));
  1194. END;
  1195. Emit(Enter(-1, callconv, varSize));
  1196. SELF.section := prevSection;
  1197. END EmitEnter;
  1198. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1199. VAR op1,op2: IntermediateCode.Operand;
  1200. VAR instruction: IntermediateCode.Instruction;
  1201. BEGIN
  1202. IntermediateCode.InitNumber(op1,callconv);
  1203. IntermediateCode.InitNumber(op2,varSize);
  1204. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1205. RETURN instruction
  1206. END Enter;
  1207. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1208. VAR op1: IntermediateCode.Operand;
  1209. VAR instruction: IntermediateCode.Instruction;
  1210. BEGIN
  1211. IntermediateCode.InitNumber(op1,callconv);
  1212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1213. RETURN instruction
  1214. END Leave;
  1215. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1216. VAR prevSection: IntermediateCode.Section;
  1217. VAR op2: IntermediateCode.Operand;
  1218. BEGIN
  1219. prevSection := SELF.section;
  1220. SELF.section := section;
  1221. Emit(Leave(position, callconv));
  1222. IF backend.cooperative THEN
  1223. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1224. Emit(Add(position, sp, fp, op2));
  1225. ELSE
  1226. Emit(Mov(position, sp, fp));
  1227. END;
  1228. Emit(Pop(position, fp));
  1229. SELF.section := prevSection;
  1230. END EmitLeave;
  1231. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1232. VAR m: SymbolMap;
  1233. BEGIN
  1234. position := x.position;
  1235. IF currentIsInline THEN
  1236. m := currentMapper.Get(x);
  1237. IF m # NIL THEN
  1238. (*
  1239. Printout.Info("mapping from", x);
  1240. Printout.Info("mapping to ", m.to);
  1241. *)
  1242. m.to.Accept(SELF);
  1243. op := result;
  1244. IF m.tag # NIL THEN
  1245. ReleaseIntermediateOperand(result.tag);
  1246. m.tag.Accept(SELF);
  1247. op.tag := result.op;
  1248. ReleaseIntermediateOperand(result.tag);
  1249. END;
  1250. RETURN
  1251. END;
  1252. END;
  1253. x.Accept(SELF);
  1254. op := result;
  1255. END Symbol;
  1256. PROCEDURE Expression(x: SyntaxTree.Expression);
  1257. BEGIN
  1258. position := x.position;
  1259. constantDeclaration := NIL;
  1260. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1261. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1262. END;
  1263. IF x.resolved # NIL THEN
  1264. x.resolved.Accept(SELF)
  1265. ELSE
  1266. x.Accept(SELF)
  1267. END;
  1268. (* check this, was commented out in ActiveCells3 *)
  1269. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1270. Error(x.position, "unsupported modifier");
  1271. END;
  1272. END Expression;
  1273. (*
  1274. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1275. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1276. BEGIN
  1277. temporaries.GetUsage(current);
  1278. FOR i := 0 TO LEN(current)-1 DO
  1279. set := current[i] - previous[i];
  1280. IF set # {} THEN
  1281. FOR j := 0 TO MAX(SET)-1 DO
  1282. IF j IN set THEN
  1283. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1284. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1285. Symbol(variable, op);
  1286. MakeMemory(tmp,op.op,addressType,0);
  1287. ReleaseOperand(op);
  1288. Emit(Mov(position,tmp, nil ) );
  1289. ReleaseIntermediateOperand(tmp);
  1290. END;
  1291. END;
  1292. END;
  1293. END;
  1294. END;
  1295. END ResetUsedTemporaries;
  1296. *)
  1297. PROCEDURE Statement(x: SyntaxTree.Statement);
  1298. VAR use: VariableUse;
  1299. BEGIN
  1300. temporaries.GetUsage(use);
  1301. position := x.position;
  1302. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1303. IF commentPrintout # NIL THEN
  1304. commentPrintout.Statement(x);
  1305. dump.Ln;
  1306. (*dump.Update;*)
  1307. END;
  1308. x.Accept(SELF);
  1309. (*
  1310. CheckRegistersFree();
  1311. *)
  1312. (*ResetUsedTemporaries(use);*)
  1313. temporaries.SetUsage(use);
  1314. END Statement;
  1315. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1316. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1317. *)
  1318. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1319. BEGIN
  1320. IF op.mode = IntermediateCode.ModeMemory THEN
  1321. ReuseCopy(res,op);
  1322. ELSE
  1323. res := op;
  1324. UseIntermediateOperand(res);
  1325. END;
  1326. IntermediateCode.AddOffset(res,offset);
  1327. IntermediateCode.MakeMemory(res,type);
  1328. END MakeMemory;
  1329. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1330. VAR mem: IntermediateCode.Operand;
  1331. BEGIN
  1332. MakeMemory(mem,res,type,offset);
  1333. ReleaseIntermediateOperand(res);
  1334. res := mem;
  1335. END ToMemory;
  1336. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1337. VAR mem: IntermediateCode.Operand;
  1338. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1339. componentType: SyntaxTree.Type;
  1340. BEGIN
  1341. type := type.resolved;
  1342. IF operand.mode = ModeReference THEN
  1343. IF type IS SyntaxTree.RangeType THEN
  1344. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1345. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1346. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1347. ReleaseOperand(operand);
  1348. operand.op := firstOp;
  1349. operand.tag := lastOp;
  1350. operand.extra := stepOp;
  1351. ELSIF type IS SyntaxTree.ComplexType THEN
  1352. componentType := type(SyntaxTree.ComplexType).componentType;
  1353. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1354. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1355. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1356. ReleaseOperand(operand);
  1357. operand.op := firstOp;
  1358. operand.tag := lastOp
  1359. ELSE
  1360. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1361. ReleaseIntermediateOperand(operand.op);
  1362. operand.op := mem;
  1363. END;
  1364. operand.mode := ModeValue;
  1365. END;
  1366. ASSERT(operand.mode = ModeValue);
  1367. END LoadValue;
  1368. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1369. VAR prevConditional: BOOLEAN;
  1370. BEGIN
  1371. prevConditional := conditional;
  1372. conditional := FALSE;
  1373. InitOperand(result, ModeUndefined);
  1374. Expression(x);
  1375. op := result;
  1376. LoadValue(op,x.type.resolved);
  1377. conditional := prevConditional;
  1378. END Evaluate;
  1379. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1380. VAR prevConditional: BOOLEAN;
  1381. BEGIN
  1382. prevConditional := conditional;
  1383. conditional := FALSE;
  1384. InitOperand(result,ModeUndefined);
  1385. Expression(x);
  1386. op := result;
  1387. (*
  1388. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1389. *)
  1390. conditional := prevConditional;
  1391. END Designate;
  1392. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1393. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1394. BEGIN
  1395. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1396. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1397. conditional := TRUE;
  1398. trueLabel := trueL; falseLabel := falseL;
  1399. Expression(x);
  1400. trueL := trueLabel; falseL := falseLabel;
  1401. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1402. END Condition;
  1403. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1404. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1405. BEGIN
  1406. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1407. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1408. RETURN op
  1409. END NewRegisterOperand;
  1410. PROCEDURE UnuseRegister(register: LONGINT);
  1411. BEGIN
  1412. IF (register > 0) THEN
  1413. register := registerUsageCount.Map(register);
  1414. registerUsageCount.DecUse(register);
  1415. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1416. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1417. END;
  1418. IF registerUsageCount.Use(register)=0 THEN
  1419. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1420. Warning(position, "register cannot be removed");
  1421. END;
  1422. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1423. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1424. END;
  1425. ELSIF registerUsageCount.Use(register)<0 THEN
  1426. Warning(position, "register removed too often");
  1427. D.TraceBack;
  1428. END;
  1429. END;
  1430. END UnuseRegister;
  1431. PROCEDURE UseRegister(register: LONGINT);
  1432. BEGIN
  1433. IF (register > 0) THEN
  1434. register := registerUsageCount.Map(register);
  1435. registerUsageCount.IncUse(register);
  1436. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1437. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1438. END;
  1439. IF registerUsageCount.Use(register)=1 THEN
  1440. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1441. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1442. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1443. END;
  1444. END;
  1445. END;
  1446. END UseRegister;
  1447. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1448. BEGIN
  1449. UnuseRegister(op.register)
  1450. END ReleaseIntermediateOperand;
  1451. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1452. BEGIN
  1453. UseRegister(op.register)
  1454. END UseIntermediateOperand;
  1455. PROCEDURE ReleaseOperand(CONST op: Operand);
  1456. BEGIN
  1457. UnuseRegister(op.op.register);
  1458. UnuseRegister(op.tag.register);
  1459. UnuseRegister(op.extra.register);
  1460. END ReleaseOperand;
  1461. (* save registers marked in array "markedRegisters" to the stack
  1462. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1463. *)
  1464. PROCEDURE SaveRegisters();
  1465. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1466. BEGIN
  1467. entry := usedRegisters;
  1468. WHILE entry # NIL DO
  1469. type := registerUsageCount.used[entry.register].type;
  1470. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1471. Emit(Push(position,op));
  1472. entry := entry.next;
  1473. END;
  1474. END SaveRegisters;
  1475. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1476. BEGIN
  1477. saved := usedRegisters;
  1478. usedRegisters := NIL;
  1479. END ReleaseUsedRegisters;
  1480. (** remove parameter registers from used queue *)
  1481. PROCEDURE ReleaseParameterRegisters;
  1482. VAR entry,prev,next: RegisterEntry;
  1483. BEGIN
  1484. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1485. WHILE entry # NIL DO
  1486. next := entry.next;
  1487. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1488. registerUsageCount.DecUse(entry.register);
  1489. ASSERT(registerUsageCount.Use(entry.register)=0);
  1490. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1491. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1492. END;
  1493. ELSIF prev = NIL THEN
  1494. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1495. ELSE
  1496. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1497. END;
  1498. entry := next;
  1499. END;
  1500. END ReleaseParameterRegisters;
  1501. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1502. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1503. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1504. BEGIN
  1505. entry := saved;
  1506. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1507. entry := prev;
  1508. WHILE entry # NIL DO
  1509. prev := entry.prev;
  1510. type := entry.type;
  1511. class := entry.registerClass;
  1512. IntermediateCode.InitRegister(op,type,class,entry.register);
  1513. (*
  1514. new := registerUsageCount.Next(type,class);
  1515. registerUsageCount.Remap(entry.register,new);
  1516. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1517. dump.String("remap register "); dump.Int(entry.register,1);
  1518. dump.String("to "); dump.Int(new,1);
  1519. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1520. END;
  1521. entry.register := new;
  1522. *)
  1523. Emit(Pop(position,op));
  1524. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1525. entry := prev;
  1526. END;
  1527. (*
  1528. usedRegisters := saved;
  1529. *)
  1530. END RestoreRegisters;
  1531. PROCEDURE CheckRegistersFree;
  1532. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1533. BEGIN
  1534. IF usedRegisters # NIL THEN
  1535. r := usedRegisters;
  1536. WHILE r # NIL DO
  1537. warning := "register ";
  1538. Strings.AppendInt(warning, r.register);
  1539. Strings.Append(warning, " not released.");
  1540. Warning(position,warning);
  1541. r := r .next;
  1542. END;
  1543. END;
  1544. FOR i := 0 TO registerUsageCount.count-1 DO
  1545. IF registerUsageCount.used[i].count < 0 THEN
  1546. warning := "register ";
  1547. Strings.AppendInt(warning, i);
  1548. Strings.Append(warning, " unused too often.");
  1549. Warning(position,warning);
  1550. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1551. warning := "register ";
  1552. Strings.AppendInt(warning, i);
  1553. Strings.Append(warning, " not unused often enough.");
  1554. Warning(position,warning);
  1555. END;
  1556. END;
  1557. END CheckRegistersFree;
  1558. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1559. Otherwise allocate a new register.
  1560. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1561. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1562. BEGIN
  1563. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1564. UseIntermediateOperand(result);
  1565. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1566. UseIntermediateOperand(result);
  1567. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1568. END;
  1569. END Reuse2;
  1570. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1571. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1572. If not then allocate a new register.
  1573. Does NOT necessarily keep the content of src1 or src2 in result!
  1574. *)
  1575. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1576. BEGIN
  1577. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1578. UseIntermediateOperand(result);
  1579. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1580. UseIntermediateOperand(result);
  1581. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1582. result := alternative; alternative := emptyOperand;
  1583. UseIntermediateOperand(result);
  1584. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1585. END;
  1586. END Reuse2a;
  1587. (* like reuse2 but only one source *)
  1588. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1589. BEGIN
  1590. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1591. UseIntermediateOperand(result);
  1592. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1593. END;
  1594. END Reuse1;
  1595. (* like reuse2a but only one source *)
  1596. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1597. BEGIN
  1598. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1599. UseIntermediateOperand(result);
  1600. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1601. UseIntermediateOperand(result);
  1602. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1603. END;
  1604. END Reuse1a;
  1605. (* like reuse1 but guarantees that content of src1 is in result *)
  1606. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1607. BEGIN
  1608. IF ReusableRegister(src1) THEN
  1609. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1610. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1611. UseIntermediateOperand(result);
  1612. ELSE
  1613. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1614. Emit(Mov(position,result,src1));
  1615. END
  1616. END ReuseCopy;
  1617. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1618. BEGIN
  1619. IF ReusableRegister(src) THEN
  1620. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1621. ELSE
  1622. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1623. Emit(Mov(position,result,src));
  1624. ReleaseIntermediateOperand(src);
  1625. END
  1626. END TransferToRegister;
  1627. (** labels and branches **)
  1628. PROCEDURE NewLabel(): Label;
  1629. VAR label: Label;
  1630. BEGIN
  1631. NEW(label,section); RETURN label;
  1632. END NewLabel;
  1633. PROCEDURE SetLabel(label: Label);
  1634. BEGIN label.Resolve(section.pc);
  1635. END SetLabel;
  1636. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1637. BEGIN
  1638. ASSERT(label # NIL);
  1639. IF label.pc < 0 THEN (* label not yet set *)
  1640. label.AddFixup(section.pc);
  1641. END;
  1642. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1643. END LabelOperand;
  1644. PROCEDURE BrL(label: Label);
  1645. BEGIN
  1646. Emit(Br(position,LabelOperand(label)));
  1647. END BrL;
  1648. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1649. BEGIN
  1650. Emit(Brge(position,LabelOperand(label),left,right));
  1651. END BrgeL;
  1652. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1653. BEGIN
  1654. Emit(Brlt(position,LabelOperand(label),left,right));
  1655. END BrltL;
  1656. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1657. BEGIN
  1658. Emit(Breq(position,LabelOperand(label),left,right));
  1659. END BreqL;
  1660. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1661. BEGIN
  1662. Emit(Brne(position,LabelOperand(label),left,right));
  1663. END BrneL;
  1664. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1665. VAR new: IntermediateCode.Operand;
  1666. BEGIN
  1667. IF Trace THEN TraceEnter("Convert") END;
  1668. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1669. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1670. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1671. & (operand.offset = 0)
  1672. THEN
  1673. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1674. Emit(Conv(position,new,operand));
  1675. ELSE
  1676. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1677. Emit(Conv(position,new,operand));
  1678. ReleaseIntermediateOperand(operand);
  1679. END;
  1680. operand := new;
  1681. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1682. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1683. ELSE
  1684. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1685. Emit(Conv(position,new,operand));
  1686. ReleaseIntermediateOperand(operand);
  1687. operand := new;
  1688. END;
  1689. IF Trace THEN TraceExit("Convert") END;
  1690. END Convert;
  1691. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1692. VAR exit: Label;
  1693. BEGIN
  1694. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1695. exit := NewLabel();
  1696. br(exit,left,right);
  1697. EmitTrap(position,trapNo);
  1698. SetLabel(exit);
  1699. END TrapC;
  1700. (** expressions *)
  1701. (** emit necessary runtime check for set elements **)
  1702. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1703. VAR max: IntermediateCode.Operand;
  1704. BEGIN
  1705. IF isUnchecked THEN RETURN END;
  1706. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1707. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1708. TrapC(BrgeL, max, o, SetElementTrap);
  1709. END;
  1710. END CheckSetElement;
  1711. (** the set that a range represents **)
  1712. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1713. VAR
  1714. operand: Operand;
  1715. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1716. BEGIN
  1717. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1718. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1719. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1720. one := IntermediateCode.Immediate(setType, 1);
  1721. Evaluate(x, operand);
  1722. Convert(operand.op, setType);
  1723. Convert(operand.tag, setType);
  1724. CheckSetElement(operand.op);
  1725. CheckSetElement(operand.tag);
  1726. (* create mask for lower bound
  1727. i.e. shift 11111111 to the left by the value of the lower bound
  1728. *)
  1729. Reuse1(temp, operand.op);
  1730. Emit(Shl(position,temp, allBits, operand.op));
  1731. ReleaseIntermediateOperand(operand.op);
  1732. operand.op := temp;
  1733. (* create mask for upper bound
  1734. i.e. shift 11111111 to the right by the difference between the
  1735. upper bound and the maximum number of set elements
  1736. *)
  1737. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1738. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1739. Reuse1(temp, operand.tag);
  1740. ELSE
  1741. Reuse1(temp, operand.tag);
  1742. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1743. Emit(Sub(position,temp, size, operand.tag));
  1744. END;
  1745. Emit(Shr(position,temp, allBits, operand.tag));
  1746. ReleaseIntermediateOperand(operand.tag);
  1747. operand.tag := temp;
  1748. Reuse2(resultingSet, operand.op, operand.tag);
  1749. (* intersect the two masks *)
  1750. Emit(And(position,resultingSet, operand.op, operand.tag));
  1751. ReleaseOperand(operand);
  1752. RETURN resultingSet
  1753. END SetFromRange;
  1754. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1755. VAR
  1756. res, operand: Operand;
  1757. temp, one, noBits, dest: IntermediateCode.Operand;
  1758. expression: SyntaxTree.Expression;
  1759. i: LONGINT;
  1760. BEGIN
  1761. IF Trace THEN TraceEnter("VisitSet") END;
  1762. dest := destination;
  1763. destination := emptyOperand;
  1764. noBits := IntermediateCode.Immediate(setType, 0);
  1765. one := IntermediateCode.Immediate(setType, 1);
  1766. (* start off with the empty set *)
  1767. InitOperand(res, ModeValue);
  1768. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1769. Emit(Mov(position,res.op, noBits));
  1770. FOR i := 0 TO x.elements.Length() - 1 DO
  1771. expression := x.elements.GetExpression(i);
  1772. IF expression IS SyntaxTree.RangeExpression THEN
  1773. (* range of set elements *)
  1774. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1775. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1776. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1777. ReleaseIntermediateOperand(temp)
  1778. ELSE
  1779. (* singelton element *)
  1780. Evaluate(expression, operand);
  1781. Convert(operand.op, setType);
  1782. CheckSetElement(operand.op);
  1783. (* create subset containing single element *)
  1784. Reuse1(temp, operand.op);
  1785. Emit(Shl(position,temp, one, operand.op));
  1786. ReleaseOperand(operand);
  1787. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1788. ReleaseIntermediateOperand(temp);
  1789. END
  1790. END;
  1791. result := res;
  1792. destination := dest;
  1793. IF Trace THEN TraceExit("VisitSet") END;
  1794. END VisitSet;
  1795. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1796. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1797. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1798. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1799. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1800. element: SyntaxTree.IntegerValue;
  1801. BEGIN
  1802. numberElements := x.elements.Length();
  1803. expression := index.parameters.GetExpression(dim);
  1804. element := expression(SyntaxTree.IntegerValue);
  1805. FOR i := 0 TO numberElements-1 DO
  1806. expression := x.elements.GetExpression(i);
  1807. element.SetValue(i);
  1808. IF expression IS SyntaxTree.MathArrayExpression THEN
  1809. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1810. ELSE
  1811. Assign(index,expression);
  1812. END;
  1813. END;
  1814. END RecursiveAssignment;
  1815. BEGIN
  1816. variable := GetTemporaryVariable(x.type, FALSE);
  1817. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1818. designator.SetType(variable.type);
  1819. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1820. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1821. FOR i := 0 TO dim-1 DO
  1822. element := SyntaxTree.NewIntegerValue(x.position,0);
  1823. element.SetType(system.longintType);
  1824. index.parameters.AddExpression(element);
  1825. END;
  1826. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1827. RecursiveAssignment(x,0);
  1828. Expression(designator);
  1829. END VisitMathArrayExpression;
  1830. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1831. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1832. BEGIN
  1833. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1834. dest := destination; destination := emptyOperand;
  1835. IF x.operator = Scanner.Not THEN
  1836. IF conditional THEN
  1837. Condition(x.left,falseLabel,trueLabel)
  1838. ELSE
  1839. Evaluate(x.left,operand);
  1840. InitOperand(result,ModeValue);
  1841. Reuse1a(result.op,operand.op,dest);
  1842. Emit(Xor(position,result.op,operand.op,true));
  1843. ReleaseOperand(operand);
  1844. END;
  1845. ELSIF x.operator = Scanner.Minus THEN
  1846. Evaluate(x.left,operand);
  1847. InitOperand(result,ModeValue);
  1848. Reuse1a(result.op,operand.op,dest);
  1849. type := x.left.type.resolved;
  1850. IF type IS SyntaxTree.SetType THEN
  1851. Emit(Not(position,result.op,operand.op));
  1852. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1853. Reuse1(result.tag,operand.tag);
  1854. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1855. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1856. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1857. Emit(Neg(position,result.op,operand.op));
  1858. ELSE HALT(200)
  1859. END;
  1860. ReleaseOperand(operand);
  1861. ELSIF x.operator = Scanner.Address THEN
  1862. Designate(x.left,operand);
  1863. operand.mode := ModeValue;
  1864. t0 := x.left.type.resolved;
  1865. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1866. ReleaseIntermediateOperand(operand.op);
  1867. operand.op := operand.tag;
  1868. IntermediateCode.InitOperand(operand.tag);
  1869. END;
  1870. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1871. result := operand;
  1872. ELSE HALT(100)
  1873. END;
  1874. destination := dest;
  1875. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1876. END VisitUnaryExpression;
  1877. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1878. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1879. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1880. BEGIN
  1881. type := type.resolved;
  1882. originalType := type;
  1883. IF type IS SyntaxTree.PointerType THEN
  1884. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1885. END;
  1886. IF type IS SyntaxTree.ObjectType THEN
  1887. BrL(trueL);
  1888. ELSE
  1889. ASSERT(type IS SyntaxTree.RecordType);
  1890. (*
  1891. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1892. *)
  1893. ReuseCopy(left,tag);
  1894. right := TypeDescriptorAdr(type);
  1895. IF ~newObjectFile THEN
  1896. IntermediateCode.MakeMemory(right,addressType);
  1897. END;
  1898. IF backend.cooperative THEN
  1899. repeatL := NewLabel();
  1900. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1901. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1902. END;
  1903. SetLabel(repeatL);
  1904. BreqL(trueL,left,right);
  1905. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1906. BrneL(repeatL,left,nil);
  1907. ELSE
  1908. level := type(SyntaxTree.RecordType).Level();
  1909. (* get type desc tag of level relative to base tag *)
  1910. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1911. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1912. IntermediateCode.MakeMemory(left,addressType);
  1913. BreqL(trueL,left,right);
  1914. END;
  1915. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1916. BrL(falseL);
  1917. END;
  1918. END TypeTest;
  1919. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1920. BEGIN
  1921. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1922. IF dump # NIL THEN
  1923. dump.String(s); dump.Ln;
  1924. END;
  1925. END Error;
  1926. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1927. BEGIN
  1928. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1929. IF dump # NIL THEN
  1930. dump.String(s); dump.Ln; dump.Update;
  1931. END;
  1932. END Warning;
  1933. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1934. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1935. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1936. operand:Operand;
  1937. BEGIN
  1938. previousSection := section;
  1939. Global.GetModuleName(mod,name);
  1940. Strings.Append(name,".@Trace");
  1941. Basic.ToSegmentedName(name, pooledName);
  1942. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1943. IF dump # NIL THEN dump := section.comments END;
  1944. variable := mod.moduleScope.firstVariable;
  1945. WHILE variable # NIL DO
  1946. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1947. Symbol(variable, operand);
  1948. register := operand.op;
  1949. CallTraceMethod(register, variable.type);
  1950. ReleaseIntermediateOperand(register);
  1951. END;
  1952. variable := variable.nextVariable;
  1953. END;
  1954. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1955. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1956. Emit(Br(position,op));
  1957. INC(statCoopTraceModule, section.pc);
  1958. section := previousSection;
  1959. IF dump # NIL THEN dump := section.comments END;
  1960. END CreateTraceModuleMethod;
  1961. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  1962. BEGIN
  1963. Emit (Push(position, dst));
  1964. Emit (Push(position, src));
  1965. CallThis(position,"GarbageCollector","Assign", 2);
  1966. END CallAssignPointer;
  1967. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  1968. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  1969. BEGIN
  1970. IF SemanticChecker.IsPointerType (type) THEN
  1971. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  1972. ELSIF type.IsRecordType() THEN
  1973. Emit (Push(position,dst));
  1974. Emit (Push(position,src));
  1975. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  1976. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1977. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1978. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  1979. ELSIF IsStaticArray(type) THEN
  1980. size := StaticArrayNumElements(type);
  1981. base := StaticArrayBaseType(type);
  1982. IF base.IsRecordType() THEN
  1983. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1984. Emit (Push(position, dst));
  1985. Emit (Push(position, src));
  1986. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  1987. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  1988. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1989. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1990. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  1991. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  1992. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1993. Emit (Push(position, dst));
  1994. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1995. Emit (Push(position, src));
  1996. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  1997. ELSE
  1998. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1999. Emit (Push(position, dst));
  2000. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2001. Emit (Push(position, src));
  2002. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2003. ASSERT(StaticArrayBaseType(type).IsPointer());
  2004. END;
  2005. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2006. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2007. Emit (Push(position, dst));
  2008. Emit (Push(position, src));
  2009. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2010. ELSE HALT(100); (* missing ? *)
  2011. END;
  2012. END CallAssignMethod;
  2013. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2014. VAR name: Basic.SegmentedName;
  2015. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2016. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2017. context: Context;
  2018. BEGIN
  2019. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2020. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2021. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2022. GetRecordTypeName (recordType,name);
  2023. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2024. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2025. IF dump # NIL THEN dump := section.comments END;
  2026. variable := recordType.recordScope.firstVariable;
  2027. WHILE variable # NIL DO
  2028. IF variable.NeedsTrace() THEN
  2029. dst := NewRegisterOperand (addressType);
  2030. src := NewRegisterOperand (addressType);
  2031. Emit (Mov(position, dst, parameter1));
  2032. Emit (Mov(position, src, parameter2));
  2033. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2034. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2035. CallAssignMethod(dst, src, variable.type);
  2036. ReleaseIntermediateOperand(src);
  2037. ReleaseIntermediateOperand(dst);
  2038. END;
  2039. variable := variable.nextVariable;
  2040. END;
  2041. recordBase := recordType.GetBaseRecord();
  2042. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2043. GetRecordTypeName (recordBase,name);
  2044. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2045. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2046. Emit(Br(position,op));
  2047. ELSE
  2048. Emit(Exit(position,0,0));
  2049. END;
  2050. IF ~recordType.isObject THEN
  2051. GetRecordTypeName (recordType,name);
  2052. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2053. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2054. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2055. NEW(registerUsageCount);
  2056. usedRegisters := NIL;
  2057. dst := NewRegisterOperand (addressType);
  2058. src := NewRegisterOperand (addressType);
  2059. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2060. Emit(Mov(position, dst, parameter1));
  2061. Emit(Mov(position, src, parameter2));
  2062. label := NewLabel();
  2063. SetLabel(label);
  2064. Emit(Push(position, dst));
  2065. Emit(Push(position, src));
  2066. GetRecordTypeName (recordType,name);
  2067. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2068. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2069. Emit(Call(position, op, 0));
  2070. Emit(Pop(position, src));
  2071. Emit(Pop(position, dst));
  2072. Emit(Add(position, dst, dst, ofs));
  2073. Emit(Add(position, src, src, ofs));
  2074. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2075. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2076. Emit(Exit(position,0,0));
  2077. END;
  2078. INC(statCoopAssignProcedure, section.pc);
  2079. ReturnToContext(context);
  2080. IF dump # NIL THEN dump := section.comments END;
  2081. END CreateAssignProcedure;
  2082. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2083. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2084. BEGIN
  2085. IF IsUnsafePointer (type) THEN
  2086. skip := NewLabel();
  2087. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2088. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2089. BreqL (skip, op, nil);
  2090. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2091. SetLabel (skip);
  2092. ELSIF SemanticChecker.IsPointerType (type) THEN
  2093. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2094. CallThis(position,"GarbageCollector","Mark", 1);
  2095. ELSIF type.IsRecordType() THEN
  2096. Emit (Push(position,register));
  2097. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2098. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2099. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2100. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2101. ELSIF IsStaticArray(type) THEN
  2102. size := StaticArrayNumElements(type);
  2103. base := StaticArrayBaseType(type);
  2104. IF base.IsRecordType() THEN
  2105. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2106. Emit (Push(position, register));
  2107. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2108. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2110. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2111. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2112. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2113. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2114. Emit (Push(position, register));
  2115. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2116. ELSE
  2117. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2118. Emit (Push(position, register));
  2119. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2120. ASSERT(base.IsPointer());
  2121. END;
  2122. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2123. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2124. CallThis(position,"GarbageCollector","Mark", 1);
  2125. ELSE HALT(100); (* missing ? *)
  2126. END;
  2127. END CallTraceMethod;
  2128. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2129. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2130. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2131. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2132. BEGIN
  2133. previousSection := section;
  2134. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2135. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2136. GetRecordTypeName (recordType,name);
  2137. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2138. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2139. IF dump # NIL THEN dump := section.comments END;
  2140. variable := recordType.recordScope.firstVariable;
  2141. WHILE variable # NIL DO
  2142. IF variable.NeedsTrace() THEN
  2143. register := NewRegisterOperand (addressType);
  2144. Emit (Mov(position,register,parameter1));
  2145. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2146. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2147. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2148. END;
  2149. CallTraceMethod(register, variable.type);
  2150. ReleaseIntermediateOperand(register);
  2151. END;
  2152. variable := variable.nextVariable;
  2153. END;
  2154. recordBase := recordType.GetBaseRecord();
  2155. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2156. recordBase := recordBase.GetBaseRecord();
  2157. END;
  2158. IF recordBase # NIL THEN
  2159. GetRecordTypeName (recordBase,name);
  2160. IF HasExplicitTraceMethod (recordBase) THEN
  2161. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2162. ELSE
  2163. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2164. END;
  2165. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2166. Emit(Br(position,op));
  2167. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2168. Emit(Exit(position,0,0));
  2169. ELSE
  2170. IF recordType.isObject THEN
  2171. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2172. ELSE
  2173. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2174. END;
  2175. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2176. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2177. Emit(Br(position,op));
  2178. END;
  2179. IF ~recordType.isObject THEN
  2180. GetRecordTypeName (recordType,name);
  2181. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2182. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2183. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2184. NEW(registerUsageCount);
  2185. usedRegisters := NIL;
  2186. IF dump # NIL THEN dump := section.comments END;
  2187. register := NewRegisterOperand (addressType);
  2188. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2189. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2190. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2191. END;
  2192. Emit (Push(position,register));
  2193. GetRecordTypeName (recordType,name);
  2194. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2195. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2196. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2197. ReleaseIntermediateOperand(register);
  2198. Emit(Exit(position,0,0));
  2199. GetRecordTypeName (recordType,name);
  2200. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2201. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2202. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2203. NEW(registerUsageCount);
  2204. usedRegisters := NIL;
  2205. register := NewRegisterOperand (addressType);
  2206. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2207. Emit(Mov(position, register, parameter1));
  2208. label := NewLabel();
  2209. SetLabel(label);
  2210. Emit(Push(position, register));
  2211. GetRecordTypeName (recordType,name);
  2212. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2213. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2214. Emit(Call(position, op, 0));
  2215. Emit(Pop(position, register));
  2216. Emit(Add(position, register, register, ofs));
  2217. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2218. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2219. Emit(Exit(position,0,0));
  2220. END;
  2221. INC(statCoopTraceMethod, section.pc);
  2222. ReturnToContext(context);
  2223. IF dump # NIL THEN dump := section.comments END;
  2224. END CreateTraceMethod;
  2225. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2226. VAR name: Basic.SegmentedName;
  2227. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2228. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2229. context: Context;
  2230. BEGIN
  2231. IF recordType.isObject THEN RETURN END;
  2232. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2233. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2234. GetRecordTypeName (recordType,name);
  2235. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2236. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2237. IF dump # NIL THEN dump := section.comments END;
  2238. variable := recordType.recordScope.firstVariable;
  2239. WHILE variable # NIL DO
  2240. IF variable.NeedsTrace() THEN
  2241. dst := NewRegisterOperand (addressType);
  2242. Emit (Mov(position, dst, parameter1));
  2243. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2244. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2245. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2246. END;
  2247. CallResetProcedure(dst, nil, variable.type);
  2248. ReleaseIntermediateOperand(dst);
  2249. END;
  2250. variable := variable.nextVariable;
  2251. END;
  2252. recordBase := recordType.GetBaseRecord();
  2253. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2254. GetRecordTypeName (recordBase,name);
  2255. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2256. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2257. Emit(Br(position,op));
  2258. ELSE
  2259. Emit(Exit(position,0,0));
  2260. END;
  2261. GetRecordTypeName (recordType,name);
  2262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2263. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2264. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2265. NEW(registerUsageCount);
  2266. usedRegisters := NIL;
  2267. dst := NewRegisterOperand (addressType);
  2268. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2269. Emit(Mov(position, dst, parameter1));
  2270. label := NewLabel();
  2271. SetLabel(label);
  2272. Emit(Push(position, dst));
  2273. GetRecordTypeName (recordType,name);
  2274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2275. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2276. Emit(Call(position, op, 0));
  2277. Emit(Pop(position, dst));
  2278. Emit(Add(position, dst, dst, ofs));
  2279. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2280. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2281. Emit(Exit(position,0,0));
  2282. INC(statCoopResetProcedure, section.pc);
  2283. ReturnToContext(context);
  2284. IF dump # NIL THEN dump := section.comments END;
  2285. END CreateResetProcedure;
  2286. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2287. VAR name: Basic.SegmentedName; context: Context;
  2288. BEGIN
  2289. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2290. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2291. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2292. IF dump # NIL THEN dump := section.comments END;
  2293. Emit(Push(position,fp));
  2294. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2295. ResetVariables(scope);
  2296. Emit(Pop(position,fp));
  2297. Emit(Exit(position,0,0));
  2298. ReturnToContext(context);
  2299. IF dump # NIL THEN dump := section.comments END;
  2300. END CreateResetMethod;
  2301. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2302. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2303. BEGIN
  2304. IF SemanticChecker.IsPointerType (type) THEN
  2305. Emit (Push(position, dest));
  2306. CallThis(position,"GarbageCollector","Reset", 1);
  2307. ELSIF type.IsRecordType() THEN
  2308. Emit (Push(position, dest));
  2309. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2310. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2311. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2312. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2313. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2314. size := GetArrayLength(type, tag);
  2315. base := ArrayBaseType(type);
  2316. IF base.IsRecordType() THEN
  2317. Emit (Push(position, size));
  2318. Emit (Push(position, dest));
  2319. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2321. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2322. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2323. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2324. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2325. Emit (Push(position, size));
  2326. Emit (Push(position, dest));
  2327. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2328. ELSE
  2329. Emit (Push(position, size));
  2330. Emit (Push(position, dest));
  2331. CallThis(position,"GarbageCollector","ResetArray", 2);
  2332. ASSERT(ArrayBaseType(type).IsPointer());
  2333. END;
  2334. ReleaseIntermediateOperand(size);
  2335. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2336. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2337. Emit (Push(position, dest));
  2338. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2339. ELSE HALT(100); (* missing ? *)
  2340. END;
  2341. END CallResetProcedure;
  2342. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2343. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2344. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2345. VAR operand: Operand;
  2346. BEGIN
  2347. Symbol (symbol, operand);
  2348. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2349. ReleaseOperand(operand);
  2350. END Reset;
  2351. BEGIN
  2352. previousScope := currentScope;
  2353. currentScope := scope;
  2354. pc := section.pc;
  2355. variable := scope.firstVariable;
  2356. WHILE variable # NIL DO
  2357. IF variable.NeedsTrace() THEN
  2358. Reset (variable);
  2359. END;
  2360. variable := variable.nextVariable;
  2361. END;
  2362. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2363. WHILE parameter # NIL DO
  2364. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2365. Reset (parameter);
  2366. END;
  2367. parameter := parameter.nextParameter;
  2368. END;
  2369. INC(statCoopResetVariables, section.pc - pc);
  2370. currentScope := previousScope;
  2371. END ResetVariables;
  2372. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2373. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2374. VAR op: IntermediateCode.Operand; context: Context;
  2375. BEGIN
  2376. previousSection := section;
  2377. GetCodeSectionNameForSymbol(procedure, name);
  2378. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2379. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2380. IF dump # NIL THEN dump := section.comments END;
  2381. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2382. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2383. Emit(Data(position,op));
  2384. Emit(Data(position,nil));
  2385. IF HasPointers (procedure.procedureScope) THEN
  2386. GetCodeSectionNameForSymbol(procedure, name);
  2387. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2388. ELSE
  2389. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2390. END;
  2391. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2392. Emit(Data(position,op));
  2393. ReturnToContext(context);
  2394. IF dump # NIL THEN dump := section.comments END;
  2395. END CreateProcedureDescriptor;
  2396. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2397. VAR import: SyntaxTree.Import;
  2398. s: Basic.MessageString;
  2399. selfName: SyntaxTree.IdentifierString;
  2400. BEGIN
  2401. moduleScope.ownerModule.GetName(selfName);
  2402. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2403. module := moduleScope.ownerModule
  2404. ELSE
  2405. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2406. IF import = NIL THEN
  2407. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),TRUE);
  2408. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2409. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2410. s := "Module ";
  2411. Strings.Append(s,moduleName);
  2412. Strings.Append(s," cannot be imported.");
  2413. IF force THEN
  2414. Error(position,s);
  2415. ELSIF canBeLoaded THEN
  2416. Strings.Append(s, "=> no dynamic linking.");
  2417. Warning(position, s);
  2418. canBeLoaded := FALSE;
  2419. END;
  2420. RETURN FALSE
  2421. ELSE
  2422. SELF.module.imports.AddName(moduleName)
  2423. END;
  2424. ELSIF import.module = NIL THEN (* already tried *)
  2425. RETURN FALSE
  2426. END;
  2427. module := import.module;
  2428. END;
  2429. RETURN TRUE
  2430. END AddImport;
  2431. (* needed for old binary object file format*)
  2432. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2433. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2434. BEGIN
  2435. IF AddImport(moduleName,module,TRUE) THEN
  2436. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2437. IF procedure = NIL THEN
  2438. s := "Instruction not supported on target, emulation procedure ";
  2439. Strings.Append(s,moduleName);
  2440. Strings.Append(s,".");
  2441. Strings.Append(s,procedureName);
  2442. Strings.Append(s," not present");
  2443. Error(position,s);
  2444. ELSE
  2445. StaticCallOperand(r,procedure);
  2446. ReleaseOperand(r);
  2447. fp := GetFingerprint(procedure);
  2448. END;
  2449. END;
  2450. END EnsureSymbol;
  2451. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2452. VAR exit: Label; trueL,falseL: Label;
  2453. BEGIN
  2454. trueL := NewLabel();
  2455. falseL := NewLabel();
  2456. exit := NewLabel();
  2457. Condition(x,trueL,falseL);
  2458. InitOperand(result,ModeValue);
  2459. SetLabel(trueL);
  2460. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2461. Emit(Mov(position,result.op,true));
  2462. BrL(exit);
  2463. SetLabel(falseL);
  2464. Emit(MovReplace(position,result.op,false));
  2465. SetLabel(exit);
  2466. END ConditionToValue;
  2467. PROCEDURE ValueToCondition(VAR op: Operand);
  2468. BEGIN
  2469. LoadValue(op,system.booleanType);
  2470. BrneL(trueLabel,op.op, false);
  2471. ReleaseOperand(op);
  2472. BrL(falseLabel);
  2473. END ValueToCondition;
  2474. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2475. VAR size: LONGINT;
  2476. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2477. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2478. BEGIN
  2479. ASSERT(type.form = SyntaxTree.Open);
  2480. baseType := type.arrayBase.resolved;
  2481. IF IsOpenArray(baseType) THEN
  2482. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2483. ELSE
  2484. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2485. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2486. END;
  2487. len := tag;
  2488. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2489. IntermediateCode.MakeMemory(len,addressType);
  2490. UseIntermediateOperand(len);
  2491. Reuse2(res,sizeOperand,len);
  2492. Emit(Mul(position,res,sizeOperand,len));
  2493. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2494. RETURN res
  2495. END GetArraySize;
  2496. BEGIN
  2497. type := type.resolved;
  2498. IF IsOpenArray(type) THEN
  2499. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2500. RETURN tag
  2501. ELSE
  2502. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2503. END;
  2504. ELSE
  2505. size := ToMemoryUnits(system,system.SizeOf(type));
  2506. RETURN IntermediateCode.Immediate(addressType,size)
  2507. END;
  2508. END GetDynamicSize;
  2509. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2510. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2511. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2512. BEGIN
  2513. ASSERT(type.form = SyntaxTree.Open);
  2514. baseType := type.arrayBase.resolved;
  2515. IF IsOpenArray(baseType) THEN
  2516. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2517. ELSE
  2518. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2519. END;
  2520. len := tag;
  2521. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2522. IntermediateCode.MakeMemory(len,addressType);
  2523. UseIntermediateOperand(len);
  2524. Reuse2(res,sizeOperand,len);
  2525. Emit(Mul(position,res,sizeOperand,len));
  2526. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2527. RETURN res
  2528. END GetLength;
  2529. BEGIN
  2530. type := type.resolved;
  2531. IF IsOpenArray(type) THEN
  2532. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2533. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2534. ELSE
  2535. RETURN IntermediateCode.Immediate(addressType,1)
  2536. END;
  2537. END GetArrayLength;
  2538. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2539. VAR result: IntermediateCode.Operand;
  2540. BEGIN
  2541. IF backend.cooperative THEN
  2542. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2543. ELSE
  2544. MakeMemory(result, tag, addressType, 0);
  2545. END;
  2546. RETURN result
  2547. END GetSizeFromTag;
  2548. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2549. VAR parameter: SyntaxTree.Parameter;
  2550. BEGIN
  2551. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2552. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2553. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2554. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2555. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2556. END;
  2557. RETURN GetDynamicSize(e.type, tag);
  2558. END GetArrayOfBytesSize;
  2559. (*
  2560. to find imported symbol. not needed ?
  2561. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2562. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2563. BEGIN
  2564. IF AddImport(moduleName,importedModule,FALSE) THEN
  2565. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2566. RETURN symbol
  2567. ELSE
  2568. RETURN NIL
  2569. END
  2570. END SymbolByName;
  2571. *)
  2572. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2573. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2574. BEGIN
  2575. IF AddImport(moduleName,runtimeModule,force) THEN
  2576. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2577. IF procedure = NIL THEN
  2578. s := "Procedure ";
  2579. Strings.Append(s,moduleName);
  2580. Strings.Append(s,".");
  2581. Strings.Append(s,procedureName);
  2582. Strings.Append(s," not present");
  2583. Error(position,s);
  2584. RETURN FALSE
  2585. ELSE
  2586. RETURN TRUE
  2587. END;
  2588. ELSE RETURN FALSE
  2589. END;
  2590. END GetRuntimeProcedure;
  2591. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2592. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2593. s: Basic.MessageString;
  2594. BEGIN
  2595. Basic.InitSegmentedName(name);
  2596. name[0] := Basic.MakeString(moduleName);
  2597. name[1] := Basic.MakeString(typeName);
  2598. name[2] := -1;
  2599. IF AddImport(moduleName,importedModule, FALSE) THEN
  2600. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2601. IF symbol = NIL THEN
  2602. s := "type ";
  2603. Strings.Append(s,moduleName);
  2604. Strings.Append(s,".");
  2605. Strings.Append(s,typeName);
  2606. Strings.Append(s," not present");
  2607. Error(position,s);
  2608. END;
  2609. ELSE symbol := NIL;
  2610. END;
  2611. IF importedModule = moduleScope.ownerModule THEN
  2612. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2613. ELSE
  2614. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2615. END;
  2616. RETURN symbol
  2617. END GetTypeDescriptor;
  2618. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2619. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2620. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2621. pooledName: Basic.SegmentedName; size: LONGINT;
  2622. BEGIN
  2623. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2624. StaticCallOperand(result,procedure);
  2625. IF numberParameters < 0 THEN
  2626. size := ProcedureParametersSize(system,procedure);
  2627. ELSE
  2628. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2629. IF size # ProcedureParametersSize(system,procedure) THEN
  2630. Error(position,"runtime call parameter count mismatch");
  2631. END;
  2632. END;
  2633. Emit(Call(position, result.op, size));
  2634. ReleaseOperand(result);
  2635. ELSE (* only static linking possible *)
  2636. Basic.InitSegmentedName(pooledName);
  2637. pooledName[0] := Basic.MakeString(moduleName);
  2638. pooledName[1] := Basic.MakeString(procedureName);
  2639. pooledName[2] := -1;
  2640. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2641. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2642. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2643. END;
  2644. END CallThis;
  2645. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2646. VAR
  2647. left,right: Operand;
  2648. leftSize, rightSize: IntermediateCode.Operand;
  2649. saved: RegisterEntry;
  2650. reg: IntermediateCode.Operand;
  2651. procedureName: SyntaxTree.IdentifierString;
  2652. BEGIN
  2653. procedureName := "CompareString";
  2654. SaveRegisters();ReleaseUsedRegisters(saved);
  2655. Designate(leftExpression,left);
  2656. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2657. Emit(Push(position,leftSize));
  2658. ReleaseIntermediateOperand(leftSize);
  2659. Emit(Push(position,left.op));
  2660. ReleaseOperand(left);
  2661. Designate(rightExpression,right);
  2662. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2663. Emit(Push(position,rightSize));
  2664. ReleaseIntermediateOperand(rightSize);
  2665. Emit(Push(position,right.op));
  2666. ReleaseOperand(right);
  2667. IF backend.cooperative THEN
  2668. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2669. ELSE
  2670. CallThis(position,runtimeModuleName,procedureName, 4);
  2671. END;
  2672. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2673. Emit(Result(position,reg));
  2674. (*
  2675. AcquireThisRegister(int8,IntermediateCode.Result);
  2676. *)
  2677. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2678. (*
  2679. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2680. *)
  2681. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2682. ReleaseIntermediateOperand(reg);
  2683. BrL(falseLabel);
  2684. END CompareString;
  2685. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2686. VAR
  2687. left,right: Operand;
  2688. leftSize, rightSize: IntermediateCode.Operand;
  2689. saved: RegisterEntry;
  2690. procedureName: SyntaxTree.IdentifierString;
  2691. BEGIN
  2692. procedureName := "CopyString";
  2693. SaveRegisters();ReleaseUsedRegisters(saved);
  2694. Designate(leftExpression,left);
  2695. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2696. Emit(Push(position,leftSize));
  2697. ReleaseIntermediateOperand(leftSize);
  2698. Emit(Push(position,left.op));
  2699. ReleaseOperand(left);
  2700. Designate(rightExpression,right);
  2701. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2702. Emit(Push(position,rightSize));
  2703. ReleaseIntermediateOperand(rightSize);
  2704. Emit(Push(position,right.op));
  2705. ReleaseOperand(right);
  2706. IF backend.cooperative THEN
  2707. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2708. ELSE
  2709. CallThis(position,runtimeModuleName,procedureName,4);
  2710. END;
  2711. RestoreRegisters(saved);
  2712. END CopyString;
  2713. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2714. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2715. leftType,rightType: SyntaxTree.Type;
  2716. leftExpression,rightExpression : SyntaxTree.Expression;
  2717. componentType: IntermediateCode.Type;
  2718. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2719. size: LONGINT;
  2720. BEGIN
  2721. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2722. dest := destination; destination := emptyOperand;
  2723. leftType := x.left.type.resolved;
  2724. rightType := x.right.type.resolved;
  2725. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2726. CASE x.operator OF
  2727. Scanner.Or:
  2728. (* shortcut evaluation of left OR right *)
  2729. IF ~conditional THEN ConditionToValue(x);
  2730. ELSE
  2731. next := NewLabel();
  2732. Condition(x.left,trueLabel,next);
  2733. SetLabel(next);
  2734. Condition(x.right,trueLabel,falseLabel);
  2735. END;
  2736. |Scanner.And:
  2737. (* shortcut evaluation of left & right *)
  2738. IF ~conditional THEN ConditionToValue(x);
  2739. ELSE
  2740. next := NewLabel();
  2741. Condition(x.left,next,falseLabel);
  2742. SetLabel(next);
  2743. Condition(x.right,trueLabel,falseLabel);
  2744. END;
  2745. |Scanner.Is:
  2746. IF ~conditional THEN ConditionToValue(x);
  2747. ELSE
  2748. (* get type desc tag *)
  2749. IF IsPointerToRecord(leftType,recordType) THEN
  2750. Evaluate(x.left,left);
  2751. Dereference(left,recordType,IsUnsafePointer(leftType))
  2752. ELSE
  2753. Designate(x.left,left);
  2754. END;
  2755. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2756. ReleaseOperand(left);
  2757. END;
  2758. |Scanner.Plus:
  2759. Evaluate(x.left,left);
  2760. Evaluate(x.right,right);
  2761. IF leftType IS SyntaxTree.SetType THEN
  2762. InitOperand(result,ModeValue);
  2763. Reuse2a(result.op,left.op,right.op,dest);
  2764. Emit(Or(position,result.op,left.op,right.op));
  2765. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2766. InitOperand(result,ModeValue);
  2767. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2768. Reuse2(result.tag,left.tag,right.tag);
  2769. Emit(Add(position,result.op,left.op,right.op));
  2770. Emit(Add(position,result.tag,left.tag,right.tag))
  2771. ELSE
  2772. InitOperand(result,ModeValue);
  2773. Reuse2a(result.op,left.op,right.op,dest);
  2774. Emit(Add(position,result.op,left.op,right.op));
  2775. END;
  2776. ReleaseOperand(left); ReleaseOperand(right);
  2777. |Scanner.Minus:
  2778. Evaluate(x.left,left);
  2779. Evaluate(x.right,right);
  2780. IF leftType IS SyntaxTree.SetType THEN
  2781. InitOperand(result,ModeValue);
  2782. Reuse1(result.op,right.op);
  2783. Emit(Not(position,result.op,right.op));
  2784. ReleaseOperand(right);
  2785. Emit(And(position,result.op,result.op,left.op));
  2786. ReleaseOperand(left);
  2787. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2788. InitOperand(result,ModeValue);
  2789. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2790. Reuse2(result.tag,left.tag,right.tag);
  2791. Emit(Sub(position,result.op,left.op,right.op));
  2792. Emit(Sub(position,result.tag,left.tag,right.tag));
  2793. ReleaseOperand(left); ReleaseOperand(right)
  2794. ELSE
  2795. InitOperand(result,ModeValue);
  2796. Reuse2a(result.op,left.op,right.op,dest);
  2797. Emit(Sub(position,result.op,left.op,right.op));
  2798. ReleaseOperand(left); ReleaseOperand(right);
  2799. END;
  2800. |Scanner.Times:
  2801. Evaluate(x.left,left);
  2802. Evaluate(x.right,right);
  2803. IF leftType IS SyntaxTree.SetType THEN
  2804. InitOperand(result,ModeValue);
  2805. Reuse2a(result.op,left.op,right.op,dest);
  2806. Emit(And(position,result.op,left.op,right.op));
  2807. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2808. InitOperand(result,ModeValue);
  2809. Reuse1a(result.op,left.op,dest);
  2810. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2811. Emit(Shl(position,result.op,left.op,right.op));
  2812. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2813. InitOperand(result, ModeValue);
  2814. componentType := left.op.type;
  2815. (* TODO: review this *)
  2816. (*
  2817. result.op = left.op * right.op - left.tag * right.tag
  2818. result.tag = left.tag * right.op + left.op * right.tag
  2819. *)
  2820. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2821. Emit(Mul(position,result.op, left.op, right.op));
  2822. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2823. Emit(Mul(position,tempReg, left.tag, right.tag));
  2824. Emit(Sub(position,result.op, result.op, tempReg));
  2825. Reuse2(result.tag, left.tag, right.op);
  2826. Emit(Mul(position,result.tag, left.tag, right.op));
  2827. Emit(Mul(position,tempReg, left.op, right.tag));
  2828. Emit(Add(position,result.tag, result.tag, tempReg));
  2829. ReleaseIntermediateOperand(tempReg)
  2830. ELSE
  2831. InitOperand(result,ModeValue);
  2832. Reuse2a(result.op,left.op,right.op,dest);
  2833. Emit(Mul(position,result.op,left.op,right.op));
  2834. END;
  2835. ReleaseOperand(left); ReleaseOperand(right);
  2836. |Scanner.Div:
  2837. Evaluate(x.left,left);
  2838. Evaluate(x.right,right);
  2839. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2840. InitOperand(result,ModeValue);
  2841. Reuse1a(result.op,left.op,dest);
  2842. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2843. Emit(Shr(position,result.op,left.op,right.op));
  2844. ELSE
  2845. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2846. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2847. IF ~isUnchecked THEN
  2848. exit := NewLabel();
  2849. BrltL(exit,zero,right.op);
  2850. EmitTrap(position,NegativeDivisorTrap);
  2851. SetLabel(exit);
  2852. END;
  2853. END;
  2854. InitOperand(result,ModeValue);
  2855. Reuse2a(result.op,left.op,right.op,dest);
  2856. Emit(Div(position,result.op,left.op,right.op));
  2857. END;
  2858. ReleaseOperand(left); ReleaseOperand(right);
  2859. |Scanner.Mod:
  2860. Evaluate(x.left,left);
  2861. Evaluate(x.right,right);
  2862. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2863. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2864. InitOperand(result,ModeValue);
  2865. Reuse1a(result.op,left.op,dest);
  2866. Emit(And(position,result.op,left.op,right.op));
  2867. ELSE
  2868. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2869. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2870. IF ~isUnchecked THEN
  2871. exit := NewLabel();
  2872. BrltL(exit,zero,right.op);
  2873. EmitTrap(position,NegativeDivisorTrap);
  2874. SetLabel(exit);
  2875. END;
  2876. END;
  2877. InitOperand(result,ModeValue);
  2878. Reuse2a(result.op,left.op,right.op,dest);
  2879. Emit(Mod(position,result.op,left.op,right.op));
  2880. END;
  2881. ReleaseOperand(left); ReleaseOperand(right);
  2882. |Scanner.Slash:
  2883. Evaluate(x.left,left);
  2884. Evaluate(x.right,right);
  2885. IF leftType IS SyntaxTree.SetType THEN
  2886. InitOperand(result,ModeValue);
  2887. Reuse2a(result.op,left.op,right.op,dest);
  2888. Emit(Xor(position,result.op,left.op,right.op));
  2889. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2890. InitOperand(result,ModeValue);
  2891. componentType := left.op.type;
  2892. (* review this *)
  2893. (*
  2894. divisor = right.op * right.op + right.tag * right.tag
  2895. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2896. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2897. *)
  2898. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2899. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2900. Emit(Mul(position,tempReg, right.op, right.op));
  2901. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2902. Emit(Add(position,tempReg, tempReg, tempReg2));
  2903. result.op := tempReg2;
  2904. Emit(Mul(position,result.op, left.op, right.op));
  2905. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2906. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2907. Emit(Add(position,result.op, result.op, tempReg2));
  2908. Emit(Div(position,result.op, result.op, tempReg));
  2909. Reuse2(result.tag, left.tag, right.op);
  2910. Emit(Mul(position,result.tag, left.tag, right.op));
  2911. Emit(Mul(position,tempReg2, left.op, right.tag));
  2912. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2913. Emit(Div(position,result.tag, result.tag, tempReg));
  2914. ReleaseIntermediateOperand(tempReg);
  2915. ReleaseIntermediateOperand(tempReg2)
  2916. ELSE
  2917. InitOperand(result,ModeValue);
  2918. Reuse2a(result.op,left.op,right.op,dest);
  2919. Emit(Div(position,result.op,left.op,right.op));
  2920. END;
  2921. ReleaseOperand(left); ReleaseOperand(right);
  2922. |Scanner.Equal:
  2923. IF ~conditional THEN ConditionToValue(x);
  2924. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2925. CompareString(BreqL,x.left,x.right);
  2926. ELSE
  2927. Evaluate(x.left,left);
  2928. Evaluate(x.right,right);
  2929. IF leftType IS SyntaxTree.RangeType THEN
  2930. ASSERT(rightType IS SyntaxTree.RangeType);
  2931. BrneL(falseLabel, left.op, right.op); (* first *)
  2932. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2933. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2934. ReleaseOperand(left); ReleaseOperand(right);
  2935. BrL(trueLabel)
  2936. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2937. BrneL(falseLabel, left.op, right.op); (* first *)
  2938. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2939. ReleaseOperand(left); ReleaseOperand(right);
  2940. BrL(trueLabel)
  2941. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2942. (* TODO: review this *)
  2943. BrneL(falseLabel, left.op, right.op); (* real part *)
  2944. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2945. ReleaseOperand(left); ReleaseOperand(right);
  2946. BrL(trueLabel)
  2947. ELSE
  2948. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2949. ReleaseOperand(left); ReleaseOperand(right);
  2950. BrL(trueLabel);
  2951. END;
  2952. END;
  2953. |Scanner.LessEqual:
  2954. IF ~conditional THEN ConditionToValue(x);
  2955. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2956. CompareString(BrgeL,x.right,x.left);
  2957. ELSE
  2958. Evaluate(x.left,left);
  2959. Evaluate(x.right,right);
  2960. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  2961. Reuse1(temp.op,right.op);
  2962. Emit(And(position,temp.op,left.op,right.op));
  2963. ReleaseOperand(right);
  2964. BreqL(trueLabel,temp.op,left.op);
  2965. BrL(falseLabel);
  2966. ReleaseOperand(temp);ReleaseOperand(left);
  2967. ELSE
  2968. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2969. ReleaseOperand(left); ReleaseOperand(right);
  2970. BrL(trueLabel);
  2971. END;
  2972. END;
  2973. |Scanner.Less:
  2974. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  2975. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  2976. leftExpression.SetType(system.booleanType);
  2977. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2978. rightExpression.SetType(system.booleanType);
  2979. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2980. leftExpression.SetType(system.booleanType);
  2981. Expression(leftExpression);
  2982. ELSIF ~conditional THEN ConditionToValue(x);
  2983. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2984. CompareString(BrltL,x.left,x.right);
  2985. ELSE
  2986. Evaluate(x.left,left);
  2987. Evaluate(x.right,right);
  2988. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2989. ReleaseOperand(left); ReleaseOperand(right);
  2990. BrL(trueLabel);
  2991. END;
  2992. |Scanner.Greater:
  2993. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  2994. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  2995. leftExpression.SetType(system.booleanType);
  2996. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2997. rightExpression.SetType(system.booleanType);
  2998. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2999. leftExpression.SetType(system.booleanType);
  3000. Expression(leftExpression);
  3001. ELSIF ~conditional THEN ConditionToValue(x);
  3002. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3003. CompareString(BrltL,x.right,x.left);
  3004. ELSE
  3005. Evaluate(x.left,left);
  3006. Evaluate(x.right,right);
  3007. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3008. ReleaseOperand(left); ReleaseOperand(right);
  3009. BrL(trueLabel);
  3010. END;
  3011. |Scanner.GreaterEqual:
  3012. IF ~conditional THEN ConditionToValue(x);
  3013. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3014. CompareString(BrgeL,x.left,x.right);
  3015. ELSE
  3016. Evaluate(x.left,left);
  3017. Evaluate(x.right,right);
  3018. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3019. Reuse1(temp.op,left.op);
  3020. Emit(And(position,temp.op,left.op,right.op));
  3021. ReleaseOperand(left);
  3022. BreqL(trueLabel, temp.op,right.op);
  3023. ReleaseOperand(temp); ReleaseOperand(right);
  3024. BrL(falseLabel);
  3025. ELSE
  3026. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3027. ReleaseOperand(left); ReleaseOperand(right);
  3028. BrL(trueLabel);
  3029. END;
  3030. END;
  3031. |Scanner.Unequal:
  3032. IF ~conditional THEN ConditionToValue(x);
  3033. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3034. CompareString(BrneL,x.left,x.right);
  3035. ELSE
  3036. Evaluate(x.left,left);
  3037. Evaluate(x.right,right);
  3038. IF leftType IS SyntaxTree.RangeType THEN
  3039. ASSERT(rightType IS SyntaxTree.RangeType);
  3040. BrneL(trueLabel, left.op, right.op); (* first *)
  3041. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3042. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3043. ReleaseOperand(left); ReleaseOperand(right);
  3044. BrL(falseLabel)
  3045. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3046. BrneL(trueLabel, left.op, right.op); (* first *)
  3047. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3048. ReleaseOperand(left); ReleaseOperand(right);
  3049. BrL(falseLabel)
  3050. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3051. (* TODO: review this *)
  3052. BrneL(trueLabel, left.op, right.op); (* real part *)
  3053. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3054. ReleaseOperand(left); ReleaseOperand(right);
  3055. BrL(falseLabel)
  3056. ELSE
  3057. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3058. ReleaseOperand(left); ReleaseOperand(right);
  3059. BrL(trueLabel);
  3060. END;
  3061. END;
  3062. |Scanner.In:
  3063. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3064. Evaluate(x.left,left);
  3065. Evaluate(x.right,right);
  3066. Convert(left.op,setType);
  3067. ReuseCopy(temp.op,right.op);
  3068. Emit(Shr(position,temp.op,temp.op,left.op));
  3069. ReleaseOperand(right); ReleaseOperand(left);
  3070. IntermediateCode.InitImmediate(one,setType,1);
  3071. Emit(And(position,temp.op,temp.op,one));
  3072. IF conditional THEN
  3073. IntermediateCode.InitImmediate(zero,setType,0);
  3074. BrneL(trueLabel,temp.op,zero);
  3075. ReleaseOperand(temp);
  3076. BrL(falseLabel);
  3077. ELSE
  3078. Convert(temp.op,bool);
  3079. result.mode := ModeValue;
  3080. result.op := temp.op;
  3081. result.tag := nil; (* may be left over from calls to evaluate *)
  3082. END;
  3083. |Scanner.Questionmarks:
  3084. Evaluate(x.left, left);
  3085. Emit(Push(position,left.op));
  3086. ReleaseOperand(left);
  3087. Designate(x.right, right);
  3088. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3089. IF ~backend.cellsAreObjects THEN
  3090. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3091. END;
  3092. Emit(Push(position,right.op));
  3093. ReleaseOperand(right);
  3094. IF backend.cellsAreObjects THEN
  3095. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3096. ELSE
  3097. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3098. END;
  3099. InitOperand(result, ModeValue);
  3100. result.op := NewRegisterOperand(bool);
  3101. Emit(Result(position,result.op));
  3102. IF conditional THEN
  3103. IntermediateCode.InitImmediate(zero,setType,0);
  3104. BrneL(trueLabel,result.op,zero);
  3105. ReleaseOperand(result);
  3106. BrL(falseLabel);
  3107. END;
  3108. ELSE
  3109. HALT(100);
  3110. END;
  3111. destination := dest;
  3112. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3113. END VisitBinaryExpression;
  3114. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3115. VAR localResult, operand: Operand;
  3116. BEGIN
  3117. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3118. InitOperand(localResult, ModeValue);
  3119. ASSERT(x.first # NIL);
  3120. Evaluate(x.first, operand);
  3121. localResult.op := operand.op;
  3122. ReleaseOperand(operand);
  3123. UseIntermediateOperand(localResult.op);
  3124. ASSERT(x.last # NIL);
  3125. Evaluate(x.last, operand);
  3126. localResult.tag := operand.op;
  3127. ReleaseOperand(operand);
  3128. UseIntermediateOperand(localResult.tag);
  3129. IF x.step # NIL THEN
  3130. Evaluate(x.step, operand);
  3131. localResult.extra := operand.op;
  3132. ReleaseOperand(operand);
  3133. UseIntermediateOperand(localResult.extra);
  3134. END;
  3135. result := localResult;
  3136. IF Trace THEN TraceExit("VisitRangeExpression") END
  3137. END VisitRangeExpression;
  3138. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3139. BEGIN
  3140. HALT(100); (* should never be evaluated *)
  3141. END VisitTensorRangeExpression;
  3142. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3143. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3144. BEGIN
  3145. IF Trace THEN TraceEnter("VisitConversion") END;
  3146. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3147. dest := destination; destination := emptyOperand;
  3148. Evaluate(x.expression,old);
  3149. InitOperand(result,ModeValue);
  3150. result.op := old.op;
  3151. ASSERT(result.op.mode # 0);
  3152. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3153. (* convert TO a complex number *)
  3154. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3155. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3156. ASSERT(result.op.mode # 0);
  3157. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3158. (* convert FROM a complex number TO a complex number*)
  3159. result.tag := old.tag;
  3160. ASSERT(result.tag.mode # 0);
  3161. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3162. ASSERT(result.tag.mode # 0)
  3163. ELSE
  3164. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3165. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3166. END
  3167. ELSE
  3168. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3169. ASSERT(result.op.mode # 0);
  3170. result.tag := old.tag; (*! probably never used *)
  3171. END;
  3172. destination := dest;
  3173. IF Trace THEN TraceExit("VisitConversion") END;
  3174. END VisitConversion;
  3175. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3176. BEGIN
  3177. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3178. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3179. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3180. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3181. END VisitTypeDeclaration;
  3182. (** designators (expressions) *)
  3183. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3184. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3185. BEGIN
  3186. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3187. IF x.left # NIL THEN Expression(x.left) END;
  3188. Symbol(x.symbol,result);
  3189. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3190. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3191. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3192. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3193. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3194. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3195. END;
  3196. END;
  3197. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3198. END VisitSymbolDesignator;
  3199. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3200. BEGIN
  3201. IF isUnchecked THEN RETURN END;
  3202. IF tagsAvailable THEN
  3203. TrapC(BrltL,index,length,IndexCheckTrap);
  3204. END;
  3205. END BoundCheck;
  3206. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3207. VAR d: IntermediateCode.Operand;
  3208. BEGIN
  3209. IF isUnchecked THEN RETURN END;
  3210. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3211. TrapC(op,dim,d,ArraySizeTrap);
  3212. ReleaseIntermediateOperand(d);
  3213. END DimensionCheck;
  3214. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3215. VAR
  3216. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3217. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3218. expression: SyntaxTree.Expression;
  3219. resultingType, leftType, baseType: SyntaxTree.Type;
  3220. skipLabel1: Label;
  3221. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3222. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3223. variableOp: Operand;
  3224. variable: SyntaxTree.Variable;
  3225. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3226. VAR expression: SyntaxTree.Expression;
  3227. BEGIN
  3228. (* count the number of indices, ranges and tensorRanges in the index list *)
  3229. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3230. FOR i := 0 TO parameters.Length() - 1 DO
  3231. expression := parameters.GetExpression(i);
  3232. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3233. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3234. ELSE INC(indexCount)
  3235. END
  3236. END;
  3237. END CountIndices;
  3238. BEGIN
  3239. ASSERT(tagsAvailable);
  3240. resultingType := x.type.resolved; (* resulting type *)
  3241. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3242. InitOperand(localResult, ModeReference);
  3243. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3244. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3245. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3246. (* a globally defined array destination tag is available -> use and invalidate it*)
  3247. localResult.tag := arrayDestinationTag;
  3248. IntermediateCode.InitOperand(arrayDestinationTag)
  3249. ELSE
  3250. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3251. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3252. Symbol(variable, variableOp);
  3253. ReuseCopy(localResult.tag, variableOp.op);
  3254. ReleaseOperand(variableOp);
  3255. END
  3256. END;
  3257. indexListSize := x.parameters.Length();
  3258. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3259. ASSERT(tensorRangeCount <= 1);
  3260. (* designate the array to be indexed over, perform tensor range check if known *)
  3261. Designate(x.left, array);
  3262. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3263. Dereference(array, leftType,FALSE);
  3264. IF tensorRangeCount=0 THEN
  3265. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3266. END
  3267. END;
  3268. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3269. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3270. srcDimOffset := -indexListSize;
  3271. destDimOffset := -rangeCount
  3272. ELSE
  3273. srcDimOffset := 0;
  3274. destDimOffset := 0
  3275. END;
  3276. indexDim := 0;
  3277. (* use address of source array as basis *)
  3278. (*
  3279. ReuseCopy(localResult.op, array.op);
  3280. *)
  3281. localResult.op := array.op;
  3282. UseIntermediateOperand(localResult.op);
  3283. (* go through the index list *)
  3284. FOR i := 0 TO indexListSize - 1 DO
  3285. expression := x.parameters.GetExpression(i);
  3286. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3287. (* nothing to do *)
  3288. ELSE
  3289. (* determine which dimension of source array is currently looked at *)
  3290. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3291. (* get the memory operand pointing to array descriptor dimension *)
  3292. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3293. (* make a reusable register from it *)
  3294. ReuseCopy(srcDim, tmp);
  3295. ReleaseIntermediateOperand(tmp);
  3296. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3297. ELSE
  3298. srcDim := IntermediateCode.Immediate(int32, i)
  3299. END;
  3300. (* get length and increment of source array for current dimension *)
  3301. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3302. Convert(sourceLength.op, sizeType);
  3303. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3304. Convert(sourceIncrement.op, sizeType);
  3305. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3306. ReleaseIntermediateOperand(srcDim);
  3307. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3308. (* SINGLE INDEX *)
  3309. Evaluate(expression, index);
  3310. ReleaseIntermediateOperand(index.tag);
  3311. index.tag := emptyOperand;
  3312. Convert(index.op, sizeType);
  3313. (* lower bound check *)
  3314. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3315. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3316. ELSIF isUnchecked THEN (* do nothing *)
  3317. ELSE
  3318. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3319. END;
  3320. (* upper bound check *)
  3321. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3322. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3323. ELSIF isUnchecked THEN (* do nothing *)
  3324. ELSE
  3325. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3326. END;
  3327. ReleaseOperand(sourceLength);
  3328. Convert(index.op, addressType);
  3329. summand := index.op;
  3330. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3331. (* RANGE OF INDICES *)
  3332. Evaluate(expression, range);
  3333. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3334. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3335. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3336. ReleaseOperand(range);
  3337. Convert(firstIndex, sizeType);
  3338. Convert(lastIndex, sizeType);
  3339. Convert(stepSize, sizeType);
  3340. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3341. if it is 'MAX(LONGINT)' *)
  3342. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3343. TransferToRegister(lastIndex, lastIndex);
  3344. skipLabel1 := NewLabel();
  3345. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3346. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3347. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3348. SetLabel(skipLabel1)
  3349. END;
  3350. (* check if step size is valid *)
  3351. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3352. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3353. ELSIF isUnchecked THEN (* do nothing *)
  3354. ELSE
  3355. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3356. END;
  3357. (* check lower bound check *)
  3358. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3359. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3360. ELSIF isUnchecked THEN (* do nothing *)
  3361. ELSE
  3362. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3363. END;
  3364. (* check upper bound check *)
  3365. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3366. (* statically open range: nothing to do *)
  3367. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3368. ASSERT(staticLastIndex < staticSourceLength)
  3369. ELSIF isUnchecked THEN (* do nothing *)
  3370. ELSE
  3371. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3372. END;
  3373. (* determine length of target array for current dimension *)
  3374. (* 1. incorporate last index: *)
  3375. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3376. (* last index is static *)
  3377. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3378. targetLength := sourceLength.op
  3379. ELSE
  3380. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3381. END;
  3382. UseIntermediateOperand(targetLength);
  3383. ELSE
  3384. (* targetLength := lastIndex + 1
  3385. Reuse1(targetLength, lastIndex);
  3386. *)
  3387. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3388. END;
  3389. ReleaseOperand(sourceLength);
  3390. ReleaseIntermediateOperand(lastIndex);
  3391. (* 2. incorporate first index: *)
  3392. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3393. (* first index and current target length are static *)
  3394. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3395. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3396. (* first index = 0: nothing to do *)
  3397. ELSE
  3398. (* targetLength := targetLength - firstIndex *)
  3399. TransferToRegister(targetLength, targetLength);
  3400. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3401. END;
  3402. (* clip negative lengths to 0 *)
  3403. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3404. IF staticTargetLength < 0 THEN
  3405. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3406. END
  3407. ELSE
  3408. skipLabel1 := NewLabel();
  3409. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3410. TransferToRegister(targetLength, targetLength);
  3411. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3412. SetLabel(skipLabel1)
  3413. END;
  3414. (* 3. incorporate index step size: *)
  3415. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3416. (*step size and current target length are static *)
  3417. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3418. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3419. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3420. (* step size = 1: nothing to do *)
  3421. ELSE
  3422. (* emit code for this:
  3423. targetLength := (targetLength-1) DIV stepSize +1;
  3424. *)
  3425. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3426. DivInt(targetLength, targetLength, stepSize);
  3427. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3428. END;
  3429. (* determine increment of target array for current dimension *)
  3430. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3431. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3432. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3433. (* step size = 1 *)
  3434. targetIncrement := sourceIncrement.op;
  3435. UseIntermediateOperand(targetIncrement)
  3436. ELSE
  3437. (* targetIncrement := sourceIncrement * stepSize *)
  3438. Reuse1(targetIncrement, stepSize);
  3439. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3440. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3441. END;
  3442. ReleaseIntermediateOperand(stepSize);
  3443. (* write length and increment of target array to descriptor *)
  3444. IF destDimOffset < 0 THEN
  3445. (* determine which dimension of target array is currently looked at *)
  3446. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3447. TransferToRegister(destDim, tmp);
  3448. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3449. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3450. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3451. ReleaseIntermediateOperand(destDim)
  3452. ELSE
  3453. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3454. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3455. END;
  3456. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3457. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3458. INC(indexDim);
  3459. Convert(firstIndex, addressType);
  3460. TransferToRegister(summand, firstIndex);
  3461. ELSE HALT(100);
  3462. END;
  3463. (*
  3464. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3465. *)
  3466. Convert(sourceIncrement.op, addressType);
  3467. Convert(summand, addressType);
  3468. MulInt(summand, summand, sourceIncrement.op);
  3469. ReleaseIntermediateOperand(sourceIncrement.op);
  3470. AddInt(localResult.op, localResult.op, summand);
  3471. ReleaseIntermediateOperand(summand);
  3472. END
  3473. END;
  3474. result := localResult;
  3475. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3476. ReleaseIntermediateOperand(result.tag);
  3477. result.tag := TypeDescriptorAdr(resultingType);
  3478. IF ~newObjectFile THEN
  3479. IntermediateCode.MakeMemory(result.tag,addressType);
  3480. END;
  3481. ELSIF IsDelegate(resultingType) THEN
  3482. ReleaseIntermediateOperand(result.tag);
  3483. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3484. UseIntermediateOperand(result.tag);
  3485. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3486. ReleaseIntermediateOperand(result.tag);
  3487. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3488. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3489. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3490. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3491. (* finalize target array descriptor *)
  3492. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3493. (* write lengths and increments of target array for remaining dimensions *)
  3494. i := indexListSize;
  3495. WHILE indexDim < targetArrayDimensionality DO
  3496. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3497. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3498. ReleaseOperand(sourceLength);
  3499. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3500. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3501. ReleaseOperand(sourceIncrement);
  3502. INC(i); INC(indexDim);
  3503. END;
  3504. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3505. tmp := nil;
  3506. ELSE
  3507. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3508. END;
  3509. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3510. ReleaseIntermediateOperand(tmp);
  3511. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3512. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3513. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3514. ELSE
  3515. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3516. END;
  3517. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3518. ReleaseIntermediateOperand(tmp);
  3519. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3520. (* write dimensionality *)
  3521. IF targetArrayDimensionality # 0 THEN
  3522. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3523. END;
  3524. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3525. END;
  3526. ReleaseOperand(array);
  3527. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3528. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3529. END;
  3530. END MathIndexDesignator;
  3531. (* TENTATIVE *)
  3532. PROCEDURE DumpOperand(operand: Operand);
  3533. BEGIN
  3534. D.Log.String(" op = ");
  3535. IntermediateCode.DumpOperand(D.Log, operand.op );
  3536. D.Log.Ln;
  3537. D.Log.String(" tag = ");
  3538. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3539. D.Log.Ln;
  3540. D.Log.String(" extra = ");
  3541. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3542. D.Log.Ln;
  3543. D.Log.Update
  3544. END DumpOperand;
  3545. (* get the length of an array , trying to make use of static information *)
  3546. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3547. VAR res: IntermediateCode.Operand; size: LONGINT;
  3548. BEGIN
  3549. type := type.resolved;
  3550. IF type IS SyntaxTree.ArrayType THEN
  3551. WITH type: SyntaxTree.ArrayType DO
  3552. IF type.form = SyntaxTree.Static THEN
  3553. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3554. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3555. Evaluate(type.length, op);
  3556. ReleaseIntermediateOperand(op.tag);
  3557. RETURN op.op;*)
  3558. ELSE
  3559. res := tag;
  3560. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3561. IntermediateCode.MakeMemory(res,addressType);
  3562. UseIntermediateOperand(res);
  3563. RETURN res
  3564. END
  3565. END;
  3566. ELSE
  3567. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3568. RETURN IntermediateCode.Immediate(addressType,size);
  3569. END;
  3570. END ArrayLength;
  3571. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3572. BEGIN
  3573. ReleaseIntermediateOperand(res);
  3574. IF IsImmediate(x) & IsImmediate(y) THEN
  3575. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3576. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3577. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3578. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3579. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3580. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3581. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3582. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3583. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3584. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3585. UseIntermediateOperand(res);
  3586. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3587. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3588. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3589. UseIntermediateOperand(res);
  3590. ELSE
  3591. IF ~ReusableRegister(res) THEN
  3592. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3593. ELSE
  3594. UseIntermediateOperand(res);
  3595. END;
  3596. IF IsImmediate(x) & (x.intValue = 0) THEN
  3597. Emit(Mov(position,res,y))
  3598. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3599. Emit(Mov(position,res,x))
  3600. ELSE
  3601. Emit(Add(position,res, x, y));
  3602. END;
  3603. END;
  3604. END AddInt;
  3605. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3606. BEGIN
  3607. ReleaseIntermediateOperand(res);
  3608. IF IsImmediate(x) & IsImmediate(y) THEN
  3609. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3610. ELSE
  3611. IF ~ReusableRegister(res) THEN
  3612. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3613. ELSE UseIntermediateOperand(res);
  3614. END;
  3615. IF IsImmediate(x) & (x.intValue = 1) THEN
  3616. Emit(Mov(position,res,y))
  3617. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3618. Emit(Mov(position,res,x))
  3619. ELSE
  3620. Emit(Mul(position,res, x, y));
  3621. END;
  3622. END;
  3623. END MulInt;
  3624. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3625. BEGIN
  3626. ReleaseIntermediateOperand(res);
  3627. IF IsImmediate(x) & IsImmediate(y) THEN
  3628. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3629. ELSE
  3630. IF ~ReusableRegister(res) THEN
  3631. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3632. ELSE UseIntermediateOperand(res);
  3633. END;
  3634. IF IsImmediate(x) & (x.intValue = 1) THEN
  3635. Emit(Mov(position,res,y))
  3636. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3637. Emit(Mov(position,res,x))
  3638. ELSE
  3639. Emit(Div(position,res, x, y));
  3640. END;
  3641. END;
  3642. END DivInt;
  3643. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3644. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3645. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3646. BEGIN
  3647. type := x.left.type.resolved;
  3648. IF type IS SyntaxTree.StringType THEN
  3649. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3650. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3651. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3652. type := atype;
  3653. x.left.SetType(type);
  3654. END;
  3655. IntermediateCode.InitImmediate(res,addressType,0);
  3656. maxDim := x.parameters.Length()-1;
  3657. FOR i := 0 TO maxDim DO
  3658. e := x.parameters.GetExpression(i);
  3659. Evaluate(e,index);
  3660. Convert(index.op,addressType);
  3661. AddInt(res, res, index.op);
  3662. IF i = 0 THEN
  3663. (*
  3664. ReuseCopy(res, index.op);
  3665. *)
  3666. Designate(x.left,array);
  3667. type := x.left.type.resolved;
  3668. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3669. Dereference(array, type, FALSE);
  3670. END;
  3671. (*
  3672. ELSE AddInt(res, res, index.op);
  3673. *)
  3674. END;
  3675. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3676. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3677. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3678. BoundCheck(index.op, length);
  3679. END;
  3680. ReleaseIntermediateOperand(length);
  3681. END;
  3682. ReleaseOperand(index);
  3683. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3684. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3685. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3686. MulInt(res,res,length);
  3687. END;
  3688. ReleaseIntermediateOperand(length);
  3689. END;
  3690. IF (type IS SyntaxTree.ArrayType) THEN
  3691. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3692. size := StaticSize(system, type);
  3693. IF size # 1 THEN
  3694. length := IntermediateCode.Immediate(addressType,size);
  3695. MulInt(res,res,length);
  3696. END;
  3697. ELSE
  3698. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3699. IF size # 1 THEN
  3700. length := IntermediateCode.Immediate(addressType,size);
  3701. MulInt(res,res,length);
  3702. END;
  3703. END;
  3704. END;
  3705. AddInt(res,res,array.op);
  3706. InitOperand(result,ModeReference);
  3707. result.op := res;
  3708. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3709. ReleaseIntermediateOperand(result.tag);
  3710. result.tag := TypeDescriptorAdr(type);
  3711. IF ~newObjectFile THEN
  3712. IntermediateCode.MakeMemory(result.tag,addressType);
  3713. END
  3714. ELSIF IsDelegate(type) THEN
  3715. ReleaseIntermediateOperand(result.tag);
  3716. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3717. UseIntermediateOperand(result.tag);
  3718. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3719. ReleaseIntermediateOperand(result.tag);
  3720. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3721. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3722. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3723. END;
  3724. ReleaseOperand(array);
  3725. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3726. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3727. END;
  3728. END IndexDesignator;
  3729. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3730. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3731. BEGIN
  3732. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3733. dest := destination; destination := emptyOperand;
  3734. type := x.left.type.resolved;
  3735. IF type IS SyntaxTree.MathArrayType THEN
  3736. MathIndexDesignator(x);
  3737. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3738. IndexDesignator(x);
  3739. END;
  3740. destination := dest;
  3741. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3742. END VisitIndexDesignator;
  3743. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3744. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3745. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3746. procedure: SyntaxTree.Procedure;
  3747. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3748. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3749. BEGIN
  3750. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3751. parameters := expression.parameters;
  3752. moduleName := "FoxArrayBase";
  3753. procedureName := "CopyDescriptor";
  3754. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3755. SaveRegisters();ReleaseUsedRegisters(saved);
  3756. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3757. IF procedure = NIL THEN
  3758. s := "procedure ";
  3759. Strings.Append(s,moduleName);
  3760. Strings.Append(s,".");
  3761. Strings.Append(s,procedureName);
  3762. Strings.Append(s," not present");
  3763. Error(position,s);
  3764. ELSE
  3765. (* push address of temporary variable *)
  3766. Symbol(variable,destOperand);
  3767. Emit(Push(position,destOperand.op));
  3768. ReleaseOperand(destOperand);
  3769. (* push src *)
  3770. Evaluate(expression.left,srcOperand);
  3771. (*
  3772. Dereference(srcOperand,expression.type.resolved);
  3773. Emit(Push(position,srcOperand.tag));
  3774. *)
  3775. Emit(Push(position,srcOperand.op));
  3776. ReleaseOperand(srcOperand);
  3777. tensorFound := FALSE;
  3778. FOR i := 0 TO parameters.Length()-1 DO
  3779. e := parameters.GetExpression(i);
  3780. IF e IS SyntaxTree.TensorRangeExpression THEN
  3781. tensorFound := TRUE;
  3782. ELSIF e IS SyntaxTree.RangeExpression THEN
  3783. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3784. ELSE
  3785. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3786. END;
  3787. END;
  3788. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3789. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3790. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3791. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3792. StaticCallOperand(procOp,procedure);
  3793. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3794. ReleaseOperand(procOp);
  3795. END;
  3796. RestoreRegisters(saved);
  3797. END;
  3798. RETURN variable
  3799. END PrepareTensorDescriptor;
  3800. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3801. VAR
  3802. type, descriptorType, baseType: SyntaxTree.Type;
  3803. operand, tmpOperand, variableOp, variable2Op: Operand;
  3804. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3805. variable, variable2: SyntaxTree.Variable;
  3806. dim, i, size: LONGINT;
  3807. (* TODO: needed? *)
  3808. oldArrayDestinationTag: IntermediateCode.Operand;
  3809. oldArrayDestinationDimension: LONGINT;
  3810. position: LONGINT;
  3811. saved: RegisterEntry;
  3812. PROCEDURE Pass(op: IntermediateCode.Operand);
  3813. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3814. BEGIN
  3815. IF numberRegister >= 0 THEN
  3816. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3817. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3818. Emit(Mov(position,parameterRegister, op));
  3819. ELSE
  3820. Emit(Push(position,op))
  3821. END
  3822. END Pass;
  3823. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3824. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3825. BEGIN
  3826. formalType := formalType.resolved; actualType := actualType.resolved;
  3827. IF IsOpenArray(formalType)THEN
  3828. IF actualType IS SyntaxTree.StringType THEN
  3829. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3830. RETURN;
  3831. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3832. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3833. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3834. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3835. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3836. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3837. ELSE
  3838. tmp := baseReg;
  3839. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3840. IntermediateCode.MakeMemory(tmp,addressType);
  3841. Pass((tmp));
  3842. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3843. END;
  3844. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3845. END;
  3846. END PushArrayLens;
  3847. BEGIN
  3848. IF Trace THEN TraceEnter("PushParameter") END;
  3849. position := expression.position;
  3850. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3851. type := expression.type.resolved;
  3852. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3853. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3854. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3855. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3856. );
  3857. (* TODO: needed? *)
  3858. oldArrayDestinationTag := arrayDestinationTag;
  3859. oldArrayDestinationDimension := arrayDestinationDimension;
  3860. IF IsArrayOfSystemByte(parameter.type) THEN
  3861. Designate(expression,operand);
  3862. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3863. ReleaseIntermediateOperand(operand.tag);
  3864. operand.tag := tmp;
  3865. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3866. Pass((operand.tag));
  3867. END;
  3868. Pass((operand.op));
  3869. ELSIF IsOpenArray(parameter.type) THEN
  3870. Designate(expression,operand);
  3871. baseReg := operand.tag;
  3872. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3873. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3874. END;
  3875. Pass((operand.op)); (* address of the array *)
  3876. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3877. (* case 1 *)
  3878. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3879. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3880. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3881. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3882. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3883. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3884. arrayDestinationTag := sp;
  3885. (* case 1b *)
  3886. IF expression IS SyntaxTree.IndexDesignator THEN
  3887. (*
  3888. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3889. descriptorType := GetMathArrayDescriptorType(dim);
  3890. variable := GetTemporaryVariable(descriptorType,expression.position);
  3891. Symbol(variable,variableOp);
  3892. arrayDestinationTag := variableOp.op;
  3893. *)
  3894. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3895. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3896. arrayDestinationDimension := dim;
  3897. Designate(expression,operand);
  3898. (* case 1a *)
  3899. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3900. Designate(expression,operand);
  3901. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  3902. i := 0;
  3903. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3904. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3905. INC(i);
  3906. END;
  3907. type := expression.type.resolved;
  3908. WHILE (i<dim) DO (* remaining static dimensions *)
  3909. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3910. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3911. ReleaseOperand(tmpOperand);
  3912. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3913. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3914. ReleaseOperand(tmpOperand);
  3915. INC(i);
  3916. END;
  3917. dimOp := IntermediateCode.Immediate(addressType,dim);
  3918. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3919. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3920. (* case 1d *)
  3921. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3922. Designate(expression,operand);
  3923. Dereference(operand,type.resolved,FALSE);
  3924. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  3925. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  3926. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3927. (* case 1f *)
  3928. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3929. Designate(expression,operand);
  3930. FOR i := 0 TO dim-1 DO
  3931. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3932. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3933. ReleaseOperand(tmpOperand);
  3934. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3935. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3936. ReleaseOperand(tmpOperand);
  3937. END;
  3938. dimOp := IntermediateCode.Immediate(addressType,dim);
  3939. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3940. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3941. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3942. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3943. baseType := SemanticChecker.ArrayBase(type,dim);
  3944. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3945. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3946. ELSE HALT(100);
  3947. END;
  3948. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  3949. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3950. (* case 2b *)
  3951. IF expression IS SyntaxTree.IndexDesignator THEN
  3952. descriptorType := GetMathArrayDescriptorType(dim);
  3953. variable := GetTemporaryVariable(descriptorType, FALSE);
  3954. Symbol(variable,variableOp);
  3955. arrayDestinationTag := variableOp.op;
  3956. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3957. arrayDestinationDimension := dim;
  3958. NeedDescriptor := TRUE;
  3959. Designate(expression,operand);
  3960. Pass((operand.tag));
  3961. NeedDescriptor := FALSE;
  3962. (* case 2a *)
  3963. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3964. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3965. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3966. INC(i);
  3967. END;
  3968. IF i = dim THEN
  3969. Designate(expression,operand);
  3970. Pass((operand.tag));
  3971. ELSE (* open-static *)
  3972. type := expression.type.resolved;
  3973. descriptorType := GetMathArrayDescriptorType(dim);
  3974. variable := GetTemporaryVariable(descriptorType, FALSE);
  3975. Symbol(variable,variableOp);
  3976. arrayDestinationTag := variableOp.op;
  3977. Designate(expression,operand);
  3978. FOR i := 0 TO dim-1 DO
  3979. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3980. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3981. ReleaseOperand(tmpOperand);
  3982. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3983. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3984. ReleaseOperand(tmpOperand);
  3985. END;
  3986. dimOp := IntermediateCode.Immediate(addressType,dim);
  3987. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3988. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3989. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3990. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3991. baseType := SemanticChecker.ArrayBase(type,dim);
  3992. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3993. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3994. Pass((arrayDestinationTag));
  3995. END;
  3996. (* case 2d *)
  3997. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3998. Designate(expression,operand);
  3999. Dereference(operand,type.resolved,FALSE);
  4000. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4001. Pass((operand.tag));
  4002. (* case 2f *)
  4003. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4004. descriptorType := GetMathArrayDescriptorType(dim);
  4005. variable := GetTemporaryVariable(descriptorType, FALSE);
  4006. Symbol(variable,variableOp);
  4007. arrayDestinationTag := variableOp.op;
  4008. Designate(expression,operand);
  4009. FOR i := 0 TO dim-1 DO
  4010. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4011. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4012. ReleaseOperand(tmpOperand);
  4013. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4014. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4015. ReleaseOperand(tmpOperand);
  4016. END;
  4017. dimOp := IntermediateCode.Immediate(addressType,dim);
  4018. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4019. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4020. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4021. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4022. baseType := SemanticChecker.ArrayBase(type,dim);
  4023. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4024. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4025. Pass((arrayDestinationTag));
  4026. ELSE HALT(100);
  4027. END;
  4028. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4029. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4030. (* case 3b *)
  4031. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4032. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4033. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4034. Symbol(variable,variableOp);
  4035. LoadValue(variableOp,system.addressType);
  4036. ELSE
  4037. descriptorType := GetMathArrayDescriptorType(dim);
  4038. variable := GetTemporaryVariable(descriptorType, FALSE);
  4039. Symbol(variable,variableOp);
  4040. END;
  4041. arrayDestinationTag := variableOp.op;
  4042. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4043. arrayDestinationDimension := 0;
  4044. Designate(expression,operand);
  4045. Pass((operand.tag));
  4046. (* case 3a *)
  4047. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4048. i := 0;
  4049. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4050. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4051. INC(i);
  4052. END;
  4053. IF i = dim THEN
  4054. Designate(expression,operand);
  4055. Pass((operand.tag));
  4056. ELSE (* open-static *)
  4057. type := expression.type.resolved;
  4058. descriptorType := GetMathArrayDescriptorType(dim);
  4059. variable := GetTemporaryVariable(descriptorType, FALSE);
  4060. Symbol(variable,variableOp);
  4061. arrayDestinationTag := variableOp.op;
  4062. Designate(expression,operand);
  4063. FOR i := 0 TO dim-1 DO
  4064. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4065. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4066. ReleaseOperand(tmpOperand);
  4067. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4068. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4069. ReleaseOperand(tmpOperand);
  4070. END;
  4071. dimOp := IntermediateCode.Immediate(addressType,dim);
  4072. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4073. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4074. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4075. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4076. baseType := SemanticChecker.ArrayBase(type,dim);
  4077. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4078. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4079. Pass((arrayDestinationTag));
  4080. END;
  4081. (* case 3d *)
  4082. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4083. Designate(expression,operand);
  4084. Dereference(operand,type.resolved,FALSE);
  4085. (*
  4086. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4087. *)
  4088. Pass((operand.tag));
  4089. (* case 3f *)
  4090. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4091. descriptorType := GetMathArrayDescriptorType(dim);
  4092. variable := GetTemporaryVariable(descriptorType, FALSE);
  4093. Symbol(variable,variableOp);
  4094. arrayDestinationTag := variableOp.op;
  4095. Designate(expression,operand);
  4096. IF operand.op.type.length >1 THEN (* vector register *)
  4097. variable2 := GetTemporaryVariable(type, FALSE);
  4098. Symbol(variable2, variable2Op);
  4099. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4100. Emit(Mov(position,tmp, operand.op));
  4101. ReleaseOperand(operand);
  4102. Symbol(variable2, operand);
  4103. END;
  4104. FOR i := 0 TO dim-1 DO
  4105. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4106. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4107. ReleaseOperand(tmpOperand);
  4108. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4109. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4110. ReleaseOperand(tmpOperand);
  4111. END;
  4112. dimOp := IntermediateCode.Immediate(addressType,dim);
  4113. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4114. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4115. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4116. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4117. baseType := SemanticChecker.ArrayBase(type,dim);
  4118. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4119. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4120. Pass((arrayDestinationTag));
  4121. ELSE HALT(100);
  4122. END;
  4123. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4124. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4125. (* case 4b *)
  4126. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4127. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4128. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4129. Symbol(variable,variableOp);
  4130. LoadValue(variableOp,system.addressType);
  4131. ELSE
  4132. descriptorType := GetMathArrayDescriptorType(dim);
  4133. variable := GetTemporaryVariable(descriptorType, FALSE);
  4134. Symbol(variable,variableOp);
  4135. END;
  4136. arrayDestinationTag := variableOp.op;
  4137. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4138. arrayDestinationDimension := 0;
  4139. Designate(expression,operand);
  4140. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4141. Symbol(variable,variableOp);
  4142. ELSE
  4143. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4144. Symbol(variable,variableOp);
  4145. MakeMemory(tmp,variableOp.op,addressType,0);
  4146. Emit(Mov(position,tmp,operand.tag));
  4147. ReleaseIntermediateOperand(tmp);
  4148. END;
  4149. Pass((variableOp.op));
  4150. ReleaseOperand(variableOp);
  4151. (* case 4a *)
  4152. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4153. i := 0;
  4154. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4155. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4156. INC(i);
  4157. END;
  4158. IF i = dim THEN
  4159. Designate(expression,operand);
  4160. arrayDestinationTag := operand.tag;
  4161. ELSE (* open-static *)
  4162. type := expression.type.resolved;
  4163. descriptorType := GetMathArrayDescriptorType(dim);
  4164. variable := GetTemporaryVariable(descriptorType, FALSE);
  4165. Symbol(variable,variableOp);
  4166. arrayDestinationTag := variableOp.op;
  4167. Designate(expression,operand);
  4168. FOR i := 0 TO dim-1 DO
  4169. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4170. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4171. ReleaseOperand(tmpOperand);
  4172. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4173. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4174. ReleaseOperand(tmpOperand);
  4175. END;
  4176. dimOp := IntermediateCode.Immediate(addressType,dim);
  4177. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4178. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4179. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4180. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4181. baseType := SemanticChecker.ArrayBase(type,dim);
  4182. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4183. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4184. END;
  4185. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4186. Symbol(variable,variableOp);
  4187. MakeMemory(tmp,variableOp.op,addressType,0);
  4188. Emit(Mov(position,tmp,arrayDestinationTag));
  4189. ReleaseIntermediateOperand(tmp);
  4190. Pass((variableOp.op));
  4191. ReleaseOperand(variableOp);
  4192. (* case 4d *)
  4193. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4194. Designate(expression,operand);
  4195. (*
  4196. Dereference(operand,type.resolved,FALSE);
  4197. *)
  4198. (*
  4199. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4200. *)
  4201. Pass((operand.op));
  4202. (* case 4f *)
  4203. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4204. descriptorType := GetMathArrayDescriptorType(dim);
  4205. variable := GetTemporaryVariable(descriptorType, FALSE);
  4206. Symbol(variable,variableOp);
  4207. arrayDestinationTag := variableOp.op;
  4208. Designate(expression,operand);
  4209. FOR i := 0 TO dim-1 DO
  4210. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4211. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4212. ReleaseOperand(tmpOperand);
  4213. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4214. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4215. ReleaseOperand(tmpOperand);
  4216. END;
  4217. dimOp := IntermediateCode.Immediate(addressType,dim);
  4218. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4219. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4220. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4221. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4222. baseType := SemanticChecker.ArrayBase(type,dim);
  4223. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4224. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4225. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4226. Symbol(variable,variableOp);
  4227. MakeMemory(tmp,variableOp.op,addressType,0);
  4228. Emit(Mov(position,tmp,arrayDestinationTag));
  4229. ReleaseIntermediateOperand(tmp);
  4230. Pass((variableOp.op));
  4231. ReleaseOperand(variableOp);
  4232. ELSE HALT(100);
  4233. END;
  4234. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4235. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4236. Designate(expression,operand);
  4237. IF operand.op.type.length > 1 THEN
  4238. Emit(Push(position, operand.op));
  4239. ReleaseOperand(operand);
  4240. ELSE
  4241. size := system.SizeOf(type);
  4242. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4243. size := ToMemoryUnits(system,size);
  4244. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4245. arrayDestinationTag := sp;
  4246. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4247. END;
  4248. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4249. Designate(expression,operand);
  4250. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4251. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4252. Symbol(variable,variableOp);
  4253. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4254. Emit(Mov(position,tmp,operand.op));
  4255. Emit(Push(position,variableOp.op));
  4256. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4257. Pass((operand.op));
  4258. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4259. END;
  4260. ELSE HALT(200)
  4261. END;
  4262. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4263. IF parameter.kind = SyntaxTree.VarParameter THEN
  4264. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4265. Designate(expression, operand);
  4266. Pass((operand.op));
  4267. ELSE
  4268. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4269. Evaluate(expression, operand);
  4270. Pass((operand.extra)); (* step *)
  4271. Pass((operand.tag)); (* last *)
  4272. Pass((operand.op)) (* first *)
  4273. END
  4274. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4275. IF parameter.kind = SyntaxTree.VarParameter THEN
  4276. Designate(expression, operand);
  4277. Pass((operand.op));
  4278. ELSE
  4279. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4280. Evaluate(expression, operand);
  4281. Pass((operand.tag)); (* real part *)
  4282. Pass((operand.op)) (* imaginary part *)
  4283. END
  4284. ELSE
  4285. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4286. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4287. Designate(expression,operand);
  4288. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4289. (* stack allocation *)
  4290. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4291. (*! parameter alignment to be discussed ... *)
  4292. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4293. size := type(SyntaxTree.StringType).length;
  4294. END;
  4295. IF backend.cooperative & parameter.NeedsTrace() THEN
  4296. dst := NewRegisterOperand (addressType);
  4297. Emit(Mov(position,dst, sp));
  4298. IntermediateCode.InitImmediate(null, byteType, 0);
  4299. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4300. ReleaseIntermediateOperand(dst);
  4301. SaveRegisters();ReleaseUsedRegisters(saved);
  4302. (* register dst has been freed before SaveRegisters already *)
  4303. CallAssignMethod(dst, operand.op, parameter.type);
  4304. RestoreRegisters(saved);
  4305. END;
  4306. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4307. ELSIF IsOpenArray(parameter.type) THEN
  4308. Designate(expression,operand);
  4309. baseReg := operand.tag;
  4310. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4311. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4312. END;
  4313. Pass((operand.op)); (* address of the array *)
  4314. ELSIF IsDelegate(parameter.type) THEN
  4315. Evaluate(expression,operand);
  4316. IF backend.cooperative & parameter.NeedsTrace() THEN
  4317. Emit(Push(position, nil));
  4318. dst := NewRegisterOperand (addressType);
  4319. Emit(Mov(position,dst, sp));
  4320. ReleaseIntermediateOperand(dst);
  4321. SaveRegisters();ReleaseUsedRegisters(saved);
  4322. Emit(Push(position, dst));
  4323. (* register dst has been freed before SaveRegisters already *)
  4324. Emit(Push(position, operand.tag));
  4325. CallThis(position,"GarbageCollector","Assign",2);
  4326. RestoreRegisters(saved);
  4327. ELSE
  4328. Pass((operand.tag));
  4329. END;
  4330. Pass((operand.op));
  4331. ELSE
  4332. Evaluate(expression,operand);
  4333. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4334. Emit(Push(position, nil));
  4335. dst := NewRegisterOperand (addressType);
  4336. Emit(Mov(position,dst, sp));
  4337. ReleaseIntermediateOperand(dst);
  4338. SaveRegisters();ReleaseUsedRegisters(saved);
  4339. Emit(Push(position, dst));
  4340. (* register dst has been freed before SaveRegisters already *)
  4341. Emit(Push(position, operand.op));
  4342. CallThis(position,"GarbageCollector","Assign",2);
  4343. RestoreRegisters(saved);
  4344. ELSE
  4345. Pass((operand.op));
  4346. END;
  4347. END;
  4348. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4349. Evaluate(expression,operand);
  4350. Pass((operand.op));
  4351. ELSE (* var parameter *)
  4352. Designate(expression,operand);
  4353. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4354. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4355. Pass((operand.tag));
  4356. END;
  4357. END;
  4358. Pass((operand.op));
  4359. END;
  4360. END;
  4361. (* TODO: needed? *)
  4362. arrayDestinationTag := oldArrayDestinationTag;
  4363. arrayDestinationDimension := oldArrayDestinationDimension;
  4364. IF needsParameterBackup THEN
  4365. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4366. ReuseCopy(parameterBackup, operand.op)
  4367. END;
  4368. ReleaseOperand(operand);
  4369. IF Trace THEN TraceExit("PushParameter") END;
  4370. END PushParameter;
  4371. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4372. VAR prevConditional: BOOLEAN;
  4373. BEGIN
  4374. prevConditional := conditional;
  4375. conditional := FALSE;
  4376. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4377. Expression(x.result); (* use register *)
  4378. END;
  4379. Statement(x.statement);
  4380. conditional := prevConditional;
  4381. IF x.result # NIL THEN Expression(x.result) END;
  4382. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4383. ReleaseIntermediateOperand(result.op);
  4384. END;
  4385. END VisitStatementDesignator;
  4386. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4387. VAR
  4388. procedure: SyntaxTree.Procedure;
  4389. procedureType: SyntaxTree.ProcedureType;
  4390. wasInline: BOOLEAN;
  4391. actualParameters: SyntaxTree.ExpressionList;
  4392. formalParameter: SyntaxTree.Parameter;
  4393. actualParameter: SyntaxTree.Expression;
  4394. i: LONGINT;
  4395. localVariable: SyntaxTree.Variable;
  4396. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4397. src, dest: Operand;
  4398. prevInlineExit : Label;
  4399. prevMapper: SymbolMapper;
  4400. tooComplex: BOOLEAN;
  4401. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4402. BEGIN
  4403. IF e = NIL THEN RETURN TRUE
  4404. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4405. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4406. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4407. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4408. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4409. ELSE RETURN FALSE
  4410. END;
  4411. END SimpleExpression;
  4412. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4413. BEGIN
  4414. RETURN checker.CanPassInRegister(type)
  4415. END FitsInRegister;
  4416. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4417. VAR
  4418. variable: SyntaxTree.Variable;
  4419. variableDesignator: SyntaxTree.Designator;
  4420. BEGIN
  4421. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4422. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4423. variableDesignator.SetType(type);
  4424. RETURN variableDesignator
  4425. END GetTemp;
  4426. BEGIN
  4427. wasInline := currentIsInline;
  4428. prevInlineExit := currentInlineExit;
  4429. prevMapper := currentMapper;
  4430. currentInlineExit := NewLabel();
  4431. tooComplex := FALSE;
  4432. NEW(currentMapper);
  4433. currentIsInline := TRUE;
  4434. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4435. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4436. formalParameter := procedureType.firstParameter;
  4437. actualParameters := x.parameters;
  4438. i := 0;
  4439. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4440. actualParameter := actualParameters.GetExpression(i);
  4441. IF actualParameter.resolved # NIL THEN
  4442. actualParameter := actualParameter.resolved
  4443. END;
  4444. (*
  4445. if expression is simple and can be passed immediately
  4446. or if type fits in register then we can proceed
  4447. otherwise we escape to ordinary procedure call.
  4448. *)
  4449. (* cases where the expression can be mapped identically *)
  4450. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4451. currentMapper.Add(formalParameter, actualParameter, NIL);
  4452. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4453. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4454. (*
  4455. Assign(variableDesignator, actualParameter);
  4456. *)
  4457. Evaluate(actualParameter, src);
  4458. Designate(variableDesignator, dest);
  4459. Emit(Mov(x.position, dest.op, src.op));
  4460. ReleaseOperand(dest);
  4461. ReleaseOperand(src);
  4462. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4463. ELSE tooComplex := TRUE
  4464. END;
  4465. (*
  4466. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4467. currentMapper.Add(formalParameter, actualParameter, NIL);
  4468. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4469. variableDesignator := GetTemp(system.addressType, FALSE);
  4470. Designate(actualParameter, src);
  4471. Designate(variableDesignator, dest);
  4472. IntermediateCode.MakeMemory(dest.op,addressType);
  4473. Emit(Mov(x.position, dest.op, src.op));
  4474. ReleaseOperand(dest);
  4475. IF src.tag.mode # IntermediateCode.Undefined THEN
  4476. tagDesignator := GetTemp(system.addressType, FALSE);
  4477. Designate(tagDesignator, dest);
  4478. IntermediateCode.MakeMemory(dest.op,addressType);
  4479. Emit(Mov(x.position, dest.op, src.op));
  4480. END;
  4481. ReleaseOperand(dest); ReleaseOperand(src);
  4482. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4483. END;
  4484. *)
  4485. formalParameter := formalParameter.nextParameter;
  4486. INC(i);
  4487. END;
  4488. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4489. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4490. currentMapper.Add(NIL, returnDesignator, NIL);
  4491. END;
  4492. localVariable := procedure.procedureScope.firstVariable;
  4493. WHILE ~tooComplex & (localVariable # NIL) DO
  4494. variableDesignator := GetTemp(localVariable.type, FALSE);
  4495. currentMapper.Add(localVariable, variableDesignator, NIL);
  4496. localVariable := localVariable.nextVariable;
  4497. END;
  4498. IF ~tooComplex THEN
  4499. VisitStatementBlock(procedure.procedureScope.body);
  4500. SetLabel(currentInlineExit);
  4501. IF procedureType.returnType # NIL THEN
  4502. Designate(returnDesignator, result);
  4503. IF conditional THEN
  4504. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4505. ValueToCondition(result)
  4506. END;
  4507. END;
  4508. END;
  4509. currentMapper := prevMapper;
  4510. currentInlineExit := prevInlineExit;
  4511. currentIsInline := wasInline;
  4512. RETURN ~tooComplex
  4513. END InlineProcedureCall;
  4514. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4515. VAR
  4516. parameters: SyntaxTree.ExpressionList;
  4517. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4518. designator: SyntaxTree.Designator;
  4519. procedureType: SyntaxTree.ProcedureType;
  4520. formalParameter: SyntaxTree.Parameter;
  4521. operand, returnValue: Operand;
  4522. reg, size, mask, dest: IntermediateCode.Operand;
  4523. saved: RegisterEntry;
  4524. symbol: SyntaxTree.Symbol;
  4525. variable: SyntaxTree.Variable;
  4526. i, parametersSize, returnTypeSize : LONGINT;
  4527. structuredReturnType: BOOLEAN;
  4528. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4529. tempVariableDesignator: SyntaxTree.Designator;
  4530. gap, alignment: LONGINT; (*fld*)
  4531. (* TODO: remove unnecessary backup variables *)
  4532. oldResult: Operand;
  4533. oldCurrentScope: SyntaxTree.Scope;
  4534. oldArrayDestinationTag: IntermediateCode.Operand;
  4535. oldArrayDestinationDimension: LONGINT;
  4536. oldConstantDeclaration: SyntaxTree.Symbol;
  4537. oldDestination: IntermediateCode.Operand;
  4538. oldCurrentLoop: Label;
  4539. oldConditional: BOOLEAN;
  4540. oldTrueLabel, oldFalseLabel: Label;
  4541. oldLocked: BOOLEAN;
  4542. usedRegisters,oldUsedRegisters: RegisterEntry;
  4543. return: IntermediateCode.Operand;
  4544. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4545. arg: IntermediateCode.Operand;
  4546. dummy: IntermediateCode.Operand;
  4547. recordType: SyntaxTree.RecordType;
  4548. operatorSelectionProcedureOperand: Operand;
  4549. operatorSelectionProcedure: SyntaxTree.Procedure;
  4550. fingerPrint: SyntaxTree.FingerPrint;
  4551. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4552. identifierNumber: LONGINT;
  4553. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4554. procedure: SyntaxTree.Procedure;
  4555. PROCEDURE BackupGlobalState;
  4556. BEGIN
  4557. oldResult := result;
  4558. oldCurrentScope := currentScope;
  4559. oldArrayDestinationTag := arrayDestinationTag;
  4560. oldArrayDestinationDimension := arrayDestinationDimension;
  4561. oldConstantDeclaration := constantDeclaration;
  4562. oldDestination := destination;
  4563. oldCurrentLoop := currentLoop;
  4564. oldConditional := conditional;
  4565. oldTrueLabel := trueLabel;
  4566. oldFalseLabel := falseLabel;
  4567. oldLocked := locked;
  4568. oldUsedRegisters := usedRegisters
  4569. END BackupGlobalState;
  4570. PROCEDURE RestoreGlobalState;
  4571. BEGIN
  4572. result := oldResult;
  4573. currentScope := oldCurrentScope;
  4574. arrayDestinationTag := oldArrayDestinationTag;
  4575. arrayDestinationDimension := oldArrayDestinationDimension;
  4576. constantDeclaration := oldConstantDeclaration;
  4577. destination := oldDestination;
  4578. currentLoop := oldCurrentLoop;
  4579. conditional := oldConditional;
  4580. trueLabel := oldTrueLabel;
  4581. falseLabel := oldFalseLabel;
  4582. locked := oldLocked;
  4583. usedRegisters := oldUsedRegisters
  4584. END RestoreGlobalState;
  4585. (** do preparations before parameter push for array-structured object types (ASOTs):
  4586. if ASOT is passed as VAR parameter:
  4587. - allocate temporary variable of math array type
  4588. - copy contents of ASOT to be passed to temporary variable
  4589. - use temporary variable as the actual parameter instead
  4590. - create and store a write-back call in a list (an index operator call that writes the contents of the temp. variable back into the ASOT)
  4591. **)
  4592. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4593. VAR
  4594. expression: SyntaxTree.Expression;
  4595. BEGIN
  4596. IF actualParameter IS SyntaxTree.Designator THEN
  4597. designator := actualParameter(SyntaxTree.Designator);
  4598. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4599. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4600. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4601. ASSERT(checker # NIL);
  4602. checker.SetCurrentScope(currentScope);
  4603. (* allocate temporary variable *)
  4604. ASSERT(actualParameter.type # NIL);
  4605. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4606. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4607. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4608. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4609. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4610. ASSERT(tempVariableDesignator.type # NIL);
  4611. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4612. (* copy math array stored in actual parameter to temporary variable *)
  4613. BackupGlobalState;
  4614. AssignMathArray(tempVariableDesignator, actualParameter);
  4615. RestoreGlobalState;
  4616. (* use temporary variable as actual parameter instead of the original one *)
  4617. actualParameter := tempVariableDesignator;
  4618. (* create write-back call and store it in linked list *)
  4619. (* create new list entry *)
  4620. IF firstWriteBackCall = NIL THEN
  4621. NEW(firstWriteBackCall);
  4622. currentWriteBackCall := firstWriteBackCall
  4623. ELSE
  4624. ASSERT(currentWriteBackCall # NIL);
  4625. NEW(currentWriteBackCall.next);
  4626. currentWriteBackCall := currentWriteBackCall.next
  4627. END;
  4628. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4629. ASSERT(expression.type = NIL);
  4630. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4631. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4632. (* prepare writeback for any other "normal" indexer *)
  4633. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4634. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4635. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4636. Assign(tempVariableDesignator, actualParameter);
  4637. actualParameter := tempVariableDesignator;
  4638. IF firstWriteBackCall = NIL THEN
  4639. NEW(firstWriteBackCall);
  4640. currentWriteBackCall := firstWriteBackCall
  4641. ELSE
  4642. ASSERT(currentWriteBackCall # NIL);
  4643. NEW(currentWriteBackCall.next);
  4644. currentWriteBackCall := currentWriteBackCall.next
  4645. END;
  4646. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4647. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4648. END
  4649. END
  4650. END PrepareParameter;
  4651. BEGIN
  4652. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4653. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4654. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4655. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4656. IF InlineProcedureCall(x) THEN
  4657. RETURN
  4658. ELSE
  4659. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4660. END
  4661. END;
  4662. END;
  4663. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4664. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4665. dest := destination; destination := emptyOperand;
  4666. SaveRegisters();ReleaseUsedRegisters(saved);
  4667. parameters := x.parameters;
  4668. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4669. (* an operator is called *)
  4670. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4671. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4672. (* check if a dynamic operator call should be performed *)
  4673. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4674. ELSE
  4675. isCallOfDynamicOperator := FALSE
  4676. END;
  4677. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4678. Emit(Push(position, ap));
  4679. END;
  4680. alignment := procedureType.stackAlignment;
  4681. IF alignment > 1 THEN
  4682. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4683. Emit(Mov(position,reg, sp));
  4684. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4685. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4686. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4687. Emit(And(position,sp, sp, mask));
  4688. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4689. Emit(Push(position,reg));
  4690. (*
  4691. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4692. Emit(Mov(position,mem,reg));
  4693. *)
  4694. ReleaseIntermediateOperand(reg);
  4695. END;
  4696. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4697. IntermediateCode.InitImmediate(mask,addressType,-16);
  4698. Emit(And(position,sp, sp, mask));
  4699. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4700. IF gap # 0 THEN
  4701. IntermediateCode.InitImmediate(size,addressType,gap);
  4702. Emit(Sub(position,sp,sp,size))
  4703. END;
  4704. END;
  4705. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4706. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4707. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4708. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4709. ELSE
  4710. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4711. END;
  4712. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4713. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4714. (* push ID *)
  4715. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4716. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4717. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4718. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4719. formalParameter := procedureType.firstParameter;
  4720. FOR i := 0 TO parameters.Length() - 1 DO
  4721. IF formalParameter.access # SyntaxTree.Hidden THEN
  4722. ASSERT(i < 2);
  4723. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4724. (* push pointer *)
  4725. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4726. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4727. (* add dereference *)
  4728. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4729. ReleaseIntermediateOperand(parameterBackups[i]);
  4730. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4731. END;
  4732. Emit(Push(position,parameterBackups[i]));
  4733. ReleaseIntermediateOperand(parameterBackups[i]);
  4734. (* push typetag *)
  4735. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4736. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4737. arg := TypeDescriptorAdr(recordType);
  4738. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4739. Emit(Push(position,arg));
  4740. ELSE
  4741. (* push 'NonPointer' *)
  4742. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4743. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4744. (* push fingerprint *)
  4745. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4746. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4747. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4748. END
  4749. END;
  4750. formalParameter := formalParameter.nextParameter
  4751. END;
  4752. (* for unary operators: complete the information for the second parameter *)
  4753. IF procedureType.numberParameters < 2 THEN
  4754. (* push 'NonPointer' *)
  4755. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4756. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4757. (* push 'NoType' *)
  4758. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4759. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4760. END;
  4761. (* call operator selection procedure *)
  4762. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4763. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4764. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4765. ReleaseOperand(operatorSelectionProcedureOperand);
  4766. (* use the address that the operator selection procedure returned as the target address of the call *)
  4767. InitOperand(operand, ModeValue);
  4768. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4769. Emit(Result(position,operand.op))
  4770. END
  4771. ELSE
  4772. Evaluate(x.left, operand)
  4773. END;
  4774. IF symbol IS SyntaxTree.Procedure THEN
  4775. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4776. Emit(Push(position,operand.tag));
  4777. ELSIF (procedureType.isDelegate) THEN
  4778. Emit(Push(position,operand.tag));
  4779. END;
  4780. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4781. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4782. Emit(Push(position,operand.tag));
  4783. END;
  4784. ELSE HALT(200);
  4785. END;
  4786. ReleaseIntermediateOperand(operand.tag);
  4787. operand.tag := emptyOperand;
  4788. (* determine if a structured return type is needed *)
  4789. structuredReturnType := StructuredReturnType(procedureType);
  4790. IF structuredReturnType THEN
  4791. IF resultDesignator # NIL THEN
  4792. d := resultDesignator;
  4793. ELSE
  4794. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4795. variable.SetUntraced(procedureType.hasUntracedReturn);
  4796. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4797. d.SetType(variable.type);
  4798. END;
  4799. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4800. Designate(d,returnValue);
  4801. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4802. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4803. Emit(Push(position,size));
  4804. Emit(Push(position,returnValue.op));
  4805. ReleaseOperand(returnValue);
  4806. ELSE
  4807. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4808. END;
  4809. END;
  4810. firstWriteBackCall := NIL; (* reset write-back call list *)
  4811. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4812. passByRegister := system.registerParameters > 0;
  4813. registerNumber := 0;
  4814. formalParameter := procedureType.lastParameter;
  4815. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4816. actualParameter := parameters.GetExpression(i);
  4817. PrepareParameter(actualParameter, formalParameter);
  4818. IF passByRegister & (i < system.registerParameters) THEN
  4819. IF ~PassInRegister(formalParameter) THEN
  4820. Error(actualParameter.position,"cannot be passed by register")
  4821. ELSE
  4822. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4823. END;
  4824. INC(registerNumber);
  4825. ELSE
  4826. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4827. END;
  4828. formalParameter := formalParameter.prevParameter;
  4829. END;
  4830. IF passByRegister & (registerNumber > 0) THEN
  4831. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4832. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4833. END;
  4834. ELSE
  4835. hasDynamicOperands := FALSE;
  4836. formalParameter := procedureType.firstParameter;
  4837. FOR i := 0 TO parameters.Length() - 1 DO
  4838. actualParameter := parameters.GetExpression(i);
  4839. IF formalParameter # NIL THEN (* TENTATIVE *)
  4840. PrepareParameter(actualParameter, formalParameter);
  4841. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4842. ASSERT(i < 2);
  4843. hasDynamicOperands := TRUE;
  4844. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4845. ELSE
  4846. IF passByRegister & (registerNumber > 0) THEN
  4847. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4848. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4849. END;
  4850. passByRegister := FALSE;
  4851. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4852. END;
  4853. formalParameter := formalParameter.nextParameter;
  4854. END;
  4855. END;
  4856. END;
  4857. IF symbol IS SyntaxTree.Procedure THEN
  4858. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  4859. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  4860. Emit(Push(position,reg));
  4861. ReleaseIntermediateOperand(reg);
  4862. END;
  4863. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  4864. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4865. parametersSize := ParametersSize(system,procedureType,FALSE);
  4866. END;
  4867. ReleaseParameterRegisters();
  4868. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  4869. Emit(Call(position,operand.op,0));
  4870. ELSE
  4871. Emit(Call(position,operand.op,parametersSize));
  4872. END;
  4873. ReleaseOperand(operand);
  4874. IF procedureType.noReturn THEN
  4875. EmitTrap(position,NoReturnTrap);
  4876. END;
  4877. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  4878. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  4879. Emit(Result(position,return));
  4880. END;
  4881. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  4882. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  4883. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4884. END;
  4885. size := IntermediateCode.Immediate(addressType,parametersSize);
  4886. Emit(Add(position,sp,sp,size));
  4887. END;
  4888. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  4889. IF structuredReturnType THEN
  4890. (* stack pointer rewinding done by callee
  4891. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  4892. Emit(Add(position,sp,sp,size));
  4893. *)
  4894. RestoreRegisters(saved);
  4895. InitOperand(result,ModeReference);
  4896. Symbol(variable,result);
  4897. ELSE
  4898. RestoreRegisters(saved);
  4899. InitOperand(result,ModeValue);
  4900. result.op := return;
  4901. END;
  4902. END;
  4903. IF alignment > 1 THEN
  4904. Emit(Pop(position,sp));
  4905. END;
  4906. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4907. Emit(Pop(position, ap));
  4908. END;
  4909. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  4910. ValueToCondition(result);
  4911. END;
  4912. destination := dest;
  4913. (* perform all write-back calls in the list *)
  4914. BackupGlobalState;
  4915. currentWriteBackCall := firstWriteBackCall;
  4916. WHILE currentWriteBackCall # NIL DO
  4917. VisitProcedureCallDesignator(currentWriteBackCall.call);
  4918. currentWriteBackCall := currentWriteBackCall.next
  4919. END;
  4920. RestoreGlobalState;
  4921. (* TENATIVE *)
  4922. (*
  4923. IF isOperatorCall THEN
  4924. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  4925. END;
  4926. *)
  4927. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  4928. END VisitProcedureCallDesignator;
  4929. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  4930. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  4931. td: SyntaxTree.Symbol;
  4932. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  4933. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4934. BEGIN
  4935. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4936. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4937. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4938. variable.SetType(system.anyType);
  4939. scope.AddVariable(variable);
  4940. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4941. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  4942. typeDeclaration.SetDeclaredType(hiddenPointerType);
  4943. typeDeclaration.SetScope(module.module.moduleScope);
  4944. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  4945. hiddenPointerType.SetState(SyntaxTree.Resolved);
  4946. END;
  4947. RETURN hiddenPointerType;
  4948. END GetHiddenPointerType;
  4949. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  4950. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4951. BEGIN
  4952. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4953. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4954. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  4955. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  4956. scope.AddVariable(variable);
  4957. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4958. variable.SetType(system.anyType);
  4959. scope.AddVariable(variable);
  4960. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4961. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  4962. typeDeclaration.SetDeclaredType(delegatePointerType);
  4963. typeDeclaration.SetScope(module.module.moduleScope);
  4964. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  4965. delegatePointerType.SetState(SyntaxTree.Resolved);
  4966. END;
  4967. RETURN delegatePointerType
  4968. END GetDelegateType;
  4969. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  4970. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  4971. such as in VAR a: RECORD ... END;
  4972. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  4973. and variables, constants and procedures the same mechanism can be used for fixups etc.
  4974. *)
  4975. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  4976. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  4977. BEGIN (* no code emission *)
  4978. source := NIL;
  4979. x := x.resolved;
  4980. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  4981. x := GetHiddenPointerType();
  4982. ELSIF IsDelegate(x) THEN
  4983. x := GetDelegateType();
  4984. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  4985. ELSE HALT(200);
  4986. END;
  4987. td := x.typeDeclaration;
  4988. IF td = NIL THEN
  4989. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  4990. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  4991. ASSERT(td # NIL);
  4992. END;
  4993. IF newObjectFile THEN
  4994. GetCodeSectionNameForSymbol(td,name);
  4995. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  4996. meta.CheckTypeDeclaration(x);
  4997. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  4998. ELSE
  4999. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5000. END;
  5001. IF backend.cooperative THEN
  5002. offset := 0;
  5003. ELSE
  5004. IF x IS SyntaxTree.CellType THEN
  5005. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5006. IF baseRecord = NIL THEN
  5007. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5008. ELSE
  5009. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5010. END;
  5011. ELSE
  5012. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5013. END;
  5014. END;
  5015. ELSE
  5016. offset := 0;
  5017. source := module.allSections.FindBySymbol(td); (*TODO*)
  5018. IF source = NIL THEN
  5019. null := 0;
  5020. GetCodeSectionNameForSymbol(td,name);
  5021. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5022. IntermediateCode.InitImmediate(op,addressType,0);
  5023. source(IntermediateCode.Section).Emit(Data(position,op));
  5024. source.SetReferenced(FALSE)
  5025. ELSE
  5026. name := source.name;
  5027. END;
  5028. END;
  5029. RETURN td
  5030. END GetBackendType;
  5031. BEGIN
  5032. (*td := t.typeDeclaration;*)
  5033. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5034. (*
  5035. IF t IS SyntaxTree.PointerType THEN
  5036. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5037. ELSE
  5038. source := GetBackendType(t);
  5039. END;
  5040. *)
  5041. IF newObjectFile THEN
  5042. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5043. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5044. IntermediateCode.SetOffset(res,offset);
  5045. ELSE
  5046. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5047. END;
  5048. (*
  5049. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5050. make memory should be used when tag is used, not earlier
  5051. *)
  5052. RETURN res
  5053. END TypeDescriptorAdr;
  5054. (*
  5055. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5056. VAR result: IntermediateCode.Operand;
  5057. BEGIN
  5058. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5059. operand.tag := TypeDescriptorAdr(operand.type);
  5060. IntermediateCode.MakeMemory(operand.tag,addressType);
  5061. UseIntermediateOperand(operand.tag);
  5062. END;
  5063. END MakeTypeTag;
  5064. *)
  5065. PROCEDURE ProfilerInit;
  5066. VAR reg: IntermediateCode.Operand;
  5067. BEGIN
  5068. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5069. Emit(Call(position,reg,0));
  5070. END ProfilerInit;
  5071. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5072. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5073. BEGIN
  5074. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5075. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5076. THEN
  5077. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5078. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5079. Emit(Push(position,reg));
  5080. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5081. Emit(Push(position,reg));
  5082. StaticCallOperand(result,procedure);
  5083. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5084. ReleaseOperand(result);
  5085. END;
  5086. END ProfilerEnterExit;
  5087. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5088. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5089. BEGIN
  5090. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5091. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5092. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5093. profileInit.Emit(Push(position,reg));
  5094. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5095. profileInit.Emit(Push(position,reg));
  5096. NEW(string, LEN(name)); COPY(name, string^);
  5097. sv := SyntaxTree.NewStringValue(-1,string);
  5098. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5099. sv.SetType(type);
  5100. Designate(sv,result);
  5101. profileInit.Emit(Push(position,result.tag));
  5102. profileInit.Emit(Push(position,result.op));
  5103. StaticCallOperand(result,procedure);
  5104. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5105. ReleaseOperand(result);
  5106. END;
  5107. END ProfilerAddProcedure;
  5108. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5109. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5110. BEGIN
  5111. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5112. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5113. profileInit.Emit(Push(position,reg));
  5114. profileInitPatchPosition := profileInit.pc;
  5115. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5116. NEW(string, LEN(name)); COPY(name, string^);
  5117. sv := SyntaxTree.NewStringValue(-1,string);
  5118. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5119. sv.SetType(type);
  5120. Designate(sv,result);
  5121. profileInit.Emit(Push(position,result.tag));
  5122. profileInit.Emit(Push(position,result.op));
  5123. StaticCallOperand(result,procedure);
  5124. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5125. ReleaseOperand(result);
  5126. END;
  5127. END ProfilerAddModule;
  5128. PROCEDURE ProfilerPatchInit;
  5129. VAR reg: IntermediateCode.Operand;
  5130. BEGIN
  5131. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5132. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5133. EmitLeave(profileInit,position,0);
  5134. profileInit.Emit(Exit(position,0,0));
  5135. END ProfilerPatchInit;
  5136. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5137. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5138. VAR
  5139. id: LONGINT;
  5140. leftType, rightType: SyntaxTree.Type;
  5141. procedureType: SyntaxTree.ProcedureType;
  5142. runtimeProcedure: SyntaxTree.Procedure;
  5143. runtimeProcedureOperand, operatorOperand: Operand;
  5144. kind: SET;
  5145. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5146. VAR
  5147. arg: IntermediateCode.Operand;
  5148. recordType: SyntaxTree.RecordType;
  5149. fingerPrint: SyntaxTree.FingerPrint;
  5150. BEGIN
  5151. IF type = NIL THEN
  5152. (* no type: push 'NoType' *)
  5153. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5154. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5155. ELSIF IsStrictlyPointerToRecord(type) THEN
  5156. (* pointer to record type: push typetag *)
  5157. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5158. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5159. arg := TypeDescriptorAdr(recordType);
  5160. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5161. ELSE
  5162. (* non-pointer to record type: push fingerprint *)
  5163. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5164. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5165. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5166. END;
  5167. operatorInitializationCodeSection.Emit(Push(position,arg))
  5168. END PushTypeInfo;
  5169. BEGIN
  5170. ASSERT(operatorInitializationCodeSection # NIL);
  5171. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5172. procedureType := operator.type(SyntaxTree.ProcedureType);
  5173. (* determine types *)
  5174. leftType := procedureType.firstParameter.type;
  5175. IF procedureType.numberParameters = 2 THEN
  5176. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5177. rightType := procedureType.firstParameter.nextParameter.type;
  5178. ELSE
  5179. rightType := NIL
  5180. END;
  5181. (* determine operator kind *)
  5182. IF IsStrictlyPointerToRecord(leftType) THEN
  5183. kind := {LhsIsPointer}
  5184. ELSE
  5185. kind := {}
  5186. END;
  5187. IF IsStrictlyPointerToRecord(rightType) THEN
  5188. kind := kind + {RhsIsPointer}
  5189. END;
  5190. IF kind # {} THEN (* TODO: to be removed later on *)
  5191. (* at least one of the types is a pointer to record *)
  5192. (* emit a code that registers this specific operator in the runtime *)
  5193. dump := operatorInitializationCodeSection.comments;
  5194. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5195. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5196. (* push ID *)
  5197. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5198. id := Global.GetSymbol(module.module.case, operator.name);
  5199. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5200. (* push kind *)
  5201. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5202. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5203. (* push type infos *)
  5204. PushTypeInfo(leftType);
  5205. PushTypeInfo(rightType);
  5206. (* push operator address *)
  5207. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5208. StaticCallOperand(operatorOperand, operator);
  5209. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5210. ReleaseOperand(operatorOperand);
  5211. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5212. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5213. ReleaseOperand(runtimeProcedureOperand)
  5214. END
  5215. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5216. END
  5217. END RegisterDynamicOperator;
  5218. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5219. VAR
  5220. traceModule: SyntaxTree.Module;
  5221. procedure: SyntaxTree.Procedure;
  5222. procedureVariable: SyntaxTree.Variable;
  5223. s,msg: Basic.MessageString;
  5224. res: Operand;
  5225. i: LONGINT;
  5226. sv: SyntaxTree.StringValue;
  5227. type: SyntaxTree.Type;
  5228. recordType: SyntaxTree.RecordType;
  5229. printout: Printout.Printer;
  5230. stringWriter: Streams.StringWriter;
  5231. expression: SyntaxTree.Expression;
  5232. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5233. BEGIN
  5234. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5235. IF procedure = NIL THEN
  5236. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5237. END;
  5238. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5239. s := "procedure ";
  5240. Strings.Append(s,backend.traceModuleName);
  5241. Strings.Append(s,".");
  5242. Strings.Append(s,procedureName);
  5243. Strings.Append(s," not present");
  5244. Error(position,s);
  5245. RETURN FALSE
  5246. ELSE
  5247. RETURN TRUE
  5248. END;
  5249. END GetProcedure;
  5250. PROCEDURE CallProcedure;
  5251. VAR size: LONGINT;
  5252. BEGIN
  5253. IF procedure # NIL THEN
  5254. StaticCallOperand(result,procedure);
  5255. size := ProcedureParametersSize(system,procedure);
  5256. ELSE
  5257. Symbol(procedureVariable, result);
  5258. LoadValue(result, procedureVariable.type.resolved);
  5259. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5260. END;
  5261. Emit(Call(position,result.op,size));
  5262. END CallProcedure;
  5263. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5264. VAR res: Operand; string: SyntaxTree.String;
  5265. BEGIN
  5266. IF GetProcedure("String") THEN
  5267. NEW(string, LEN(s)); COPY(s, string^);
  5268. sv := SyntaxTree.NewStringValue(-1,string);
  5269. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5270. sv.SetType(type);
  5271. Designate(sv,res);
  5272. Emit(Push(position,res.tag));
  5273. Emit(Push(position,res.op));
  5274. ReleaseOperand(res);
  5275. CallProcedure;
  5276. END;
  5277. END String;
  5278. PROCEDURE Integer(op: IntermediateCode.Operand);
  5279. BEGIN
  5280. IF GetProcedure("Int") THEN
  5281. Emit(Push(position,op));
  5282. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5283. CallProcedure;
  5284. END;
  5285. END Integer;
  5286. PROCEDURE Float(op: IntermediateCode.Operand);
  5287. BEGIN
  5288. IF GetProcedure("HIntHex") THEN
  5289. Emit(Push(position,op));
  5290. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5291. CallProcedure;
  5292. END;
  5293. END Float;
  5294. PROCEDURE Set(op: IntermediateCode.Operand);
  5295. BEGIN
  5296. IF GetProcedure("Set") THEN
  5297. Emit(Push(position,op));
  5298. (*
  5299. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5300. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5301. *)
  5302. CallProcedure;
  5303. END;
  5304. END Set;
  5305. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5306. BEGIN
  5307. IF GetProcedure("Boolean") THEN
  5308. Emit(Push(position,op));
  5309. CallProcedure;
  5310. END;
  5311. END Boolean;
  5312. PROCEDURE Char(op: IntermediateCode.Operand);
  5313. BEGIN
  5314. IF GetProcedure("Char") THEN
  5315. Emit(Push(position,op));
  5316. CallProcedure;
  5317. END;
  5318. END Char;
  5319. PROCEDURE Address(op: IntermediateCode.Operand);
  5320. BEGIN
  5321. IF GetProcedure("Address") THEN
  5322. Emit(Push(position,op));
  5323. CallProcedure;
  5324. END;
  5325. END Address;
  5326. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5327. BEGIN
  5328. IF GetProcedure("String") THEN
  5329. Emit(Push(position,tag));
  5330. Emit(Push(position,op));
  5331. CallProcedure;
  5332. END;
  5333. END StringOperand;
  5334. PROCEDURE Ln;
  5335. BEGIN
  5336. IF GetProcedure("Ln") THEN
  5337. CallProcedure;
  5338. END;
  5339. END Ln;
  5340. BEGIN
  5341. IF backend.traceModuleName = "" THEN RETURN END;
  5342. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5343. IF GetProcedure("Enter") THEN
  5344. CallProcedure
  5345. END;
  5346. NEW(stringWriter,LEN(s));
  5347. FOR i := 0 TO x.Length()-1 DO
  5348. msg := "";
  5349. expression := x.GetExpression(i);
  5350. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5351. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5352. ELSE
  5353. Global.GetModuleName(module.module, s);
  5354. END;
  5355. IF i = 0 THEN
  5356. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5357. stringWriter.String(":");
  5358. END;
  5359. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5360. IF ~(expression IS SyntaxTree.StringValue) THEN
  5361. printout.Expression(expression);
  5362. stringWriter.Get(s);
  5363. Strings.Append(msg,s);
  5364. Strings.Append(msg,"= ");
  5365. ELSE stringWriter.Get(s); (* remove from string writer *)
  5366. Strings.Append(msg, s);
  5367. END;
  5368. String(msg);
  5369. IF SemanticChecker.IsStringType(expression.type) THEN
  5370. Designate(expression,res);
  5371. StringOperand(res.op,res.tag);
  5372. ELSE
  5373. Evaluate(expression,res);
  5374. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5375. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5376. Convert(res.op,int64);
  5377. END;
  5378. Integer(res.op);
  5379. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5380. Boolean(res.op);
  5381. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5382. Set(res.op);
  5383. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5384. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5385. Convert(res.op,float64);
  5386. END;
  5387. Float(res.op);
  5388. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5389. Char(res.op);
  5390. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5391. Address(res.op);String("H");
  5392. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5393. Address(res.op);String("H");
  5394. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5395. Address(res.op);String("H");
  5396. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5397. Address(res.op);String("H");
  5398. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5399. String("NIL");
  5400. ELSE HALT(200);
  5401. END;
  5402. END;
  5403. ReleaseOperand(res);
  5404. String("; ");
  5405. END;
  5406. IF GetProcedure("Exit") THEN
  5407. CallProcedure
  5408. ELSE
  5409. Ln;
  5410. END;
  5411. END;
  5412. END SystemTrace;
  5413. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5414. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5415. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5416. BEGIN
  5417. type := type.resolved;
  5418. IF type IS SyntaxTree.RecordType THEN
  5419. WITH type: SyntaxTree.RecordType DO
  5420. baseType := type.baseType;
  5421. IF baseType # NIL THEN
  5422. baseType := baseType.resolved;
  5423. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5424. InitFields(baseType,adr,offset);
  5425. END;
  5426. variable := type.recordScope.firstVariable;
  5427. WHILE variable # NIL DO
  5428. IF variable.initializer # NIL THEN
  5429. Evaluate(variable.initializer,initializerOp);
  5430. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5431. Emit(Mov(position,mem,initializerOp.op));
  5432. ReleaseOperand(initializerOp);
  5433. ReleaseIntermediateOperand(mem);
  5434. END;
  5435. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5436. variable := variable.nextVariable
  5437. END;
  5438. END;
  5439. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5440. WITH type: SyntaxTree.ArrayType DO
  5441. IF type.form = SyntaxTree.Static THEN
  5442. baseType := type.arrayBase;
  5443. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5444. FOR i := 0 TO type.staticLength-1 DO
  5445. InitFields(baseType,adr,offset+i*size);
  5446. END;
  5447. END;
  5448. END;
  5449. ELSIF type IS SyntaxTree.MathArrayType THEN
  5450. WITH type: SyntaxTree.MathArrayType DO
  5451. IF type.form = SyntaxTree.Open THEN
  5452. dim := DynamicDim(type);
  5453. imm := IntermediateCode.Immediate(addressType,dim);
  5454. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5455. baseType := SemanticChecker.ArrayBase(type,dim);
  5456. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5457. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5458. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5459. ReleaseIntermediateOperand(imm);
  5460. (* flags remain empty (=0) for open array *)
  5461. ELSIF type.form = SyntaxTree.Static THEN
  5462. baseType := type.arrayBase;
  5463. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5464. FOR i := 0 TO type.staticLength-1 DO
  5465. InitFields(baseType,adr,offset+i*size);
  5466. END;
  5467. END;
  5468. END;
  5469. END;
  5470. END InitFields;
  5471. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5472. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5473. BEGIN
  5474. type := variable.type.resolved;
  5475. IF (type IS SyntaxTree.MathArrayType) THEN
  5476. WITH type: SyntaxTree.MathArrayType DO
  5477. IF type.form = SyntaxTree.Open THEN
  5478. Symbol(variable,operand);
  5479. InitFields(type, operand.tag,0);
  5480. ELSIF type.form = SyntaxTree.Tensor THEN
  5481. Symbol(variable, operand);
  5482. MakeMemory(tmp,operand.op,addressType,0);
  5483. ReleaseOperand(operand);
  5484. Emit(Mov(position,tmp, nil ) );
  5485. ReleaseIntermediateOperand(tmp);
  5486. END;
  5487. END;
  5488. ELSE
  5489. Symbol(variable,operand);
  5490. IF variable.initializer # NIL THEN
  5491. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5492. reference.SetType(variable.type.resolved);
  5493. reference.SetAssignable(TRUE);
  5494. Assign(reference,variable.initializer);
  5495. END;
  5496. InitFields(type, operand.op,0);
  5497. ReleaseOperand(operand);
  5498. END;
  5499. END InitVariable;
  5500. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5501. VAR end: Label;
  5502. BEGIN
  5503. IF type.form = SyntaxTree.Tensor THEN
  5504. InitOperand(result,ModeValue);
  5505. ReuseCopy(result.op,base);
  5506. end := NewLabel();
  5507. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5508. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5509. SetLabel(end);
  5510. Convert(result.op,int32);
  5511. ELSE
  5512. InitOperand(result,ModeValue);
  5513. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5514. END
  5515. END MathArrayDim;
  5516. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5517. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5518. BEGIN
  5519. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5520. MakeMemory(mem,base,addressType,offset);
  5521. Emit(Mov(position,mem,value));
  5522. ReleaseIntermediateOperand(mem);
  5523. END PutMathArrayField;
  5524. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5525. VAR mem: IntermediateCode.Operand;
  5526. BEGIN
  5527. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5528. MakeMemory(mem,base,addressType,offset);
  5529. Emit(Mov(position,mem,value));
  5530. ReleaseIntermediateOperand(mem);
  5531. END PutMathArrayFieldOffset;
  5532. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5533. BEGIN
  5534. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5535. MakeMemory(value,base,addressType,offset);
  5536. END GetMathArrayField;
  5537. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5538. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5539. BEGIN
  5540. IF incr THEN
  5541. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5542. ELSE
  5543. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5544. END;
  5545. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5546. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5547. ELSE
  5548. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5549. Emit(Mov(position,reg,dim));
  5550. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5551. Emit(Add(position,reg,reg,base));
  5552. MakeMemory(mem, reg, addressType, offset);
  5553. ReleaseIntermediateOperand(reg);
  5554. Emit(Mov(position,mem,value));
  5555. ReleaseIntermediateOperand(mem);
  5556. END;
  5557. END PutMathArrayLenOrIncr;
  5558. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5559. BEGIN
  5560. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5561. END PutMathArrayLength;
  5562. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5563. BEGIN
  5564. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5565. END PutMathArrayIncrement;
  5566. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5567. BEGIN
  5568. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5569. END GetMathArrayIncrement;
  5570. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5571. BEGIN
  5572. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5573. END GetMathArrayLength;
  5574. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5575. VAR dimOp: IntermediateCode.Operand;
  5576. BEGIN
  5577. dimOp := IntermediateCode.Immediate(int32, dim);
  5578. GetMathArrayLength(type, operand, dimOp, check, result);
  5579. END GetMathArrayLengthAt;
  5580. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5581. VAR dimOp: IntermediateCode.Operand;
  5582. BEGIN
  5583. dimOp := IntermediateCode.Immediate(int32, dim);
  5584. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5585. END GetMathArrayIncrementAt;
  5586. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5587. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5588. offset: LONGINT;
  5589. BEGIN
  5590. IF increment THEN
  5591. offset := MathIncrOffset;
  5592. ELSE
  5593. offset := MathLenOffset;
  5594. END;
  5595. INC(offset,operand.dimOffset*2);
  5596. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5597. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5598. END;
  5599. (* static dimension *)
  5600. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5601. IF check & (type.form = SyntaxTree.Tensor) THEN
  5602. DimensionCheck(operand.tag,dim,BrltL);
  5603. END;
  5604. val := SHORT(dim.intValue);
  5605. IF type.form # SyntaxTree.Tensor THEN
  5606. t := SemanticChecker.ArrayBase(type,val);
  5607. type := t.resolved(SyntaxTree.MathArrayType);
  5608. IF type.form = SyntaxTree.Static THEN
  5609. IF increment THEN
  5610. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5611. ELSE
  5612. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5613. END;
  5614. InitOperand(result,ModeValue);
  5615. result.op := res;
  5616. RETURN;
  5617. END;
  5618. END;
  5619. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5620. MakeMemory(res,operand.tag,addressType,offset);
  5621. (*
  5622. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5623. *)
  5624. InitOperand(result,ModeValue);
  5625. result.op := res;
  5626. ELSE
  5627. Convert(dim,addressType);
  5628. IF check THEN
  5629. IF type.form = SyntaxTree.Tensor THEN
  5630. DimensionCheck(operand.tag,dim,BrltL);
  5631. ELSIF isUnchecked THEN (* do nothing *)
  5632. ELSE
  5633. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5634. END;
  5635. END;
  5636. end := NewLabel(); next := NIL;
  5637. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5638. Emit(Mov(position,res,dim));
  5639. Convert(res,int32);
  5640. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5641. WHILE t IS SyntaxTree.MathArrayType DO
  5642. type := t(SyntaxTree.MathArrayType);
  5643. IF type.form = SyntaxTree.Static THEN
  5644. imm := IntermediateCode.Immediate(int32,val);
  5645. next := NewLabel();
  5646. BrneL(next,imm,res);
  5647. IF increment THEN
  5648. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5649. ELSE
  5650. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5651. END;
  5652. Emit(MovReplace(position,res,imm));
  5653. BrL(end);
  5654. ELSE hasDynamicPart := TRUE;
  5655. END;
  5656. t := type.arrayBase.resolved;
  5657. val := val + 1;
  5658. IF next # NIL THEN SetLabel(next) END;
  5659. END;
  5660. IF hasDynamicPart THEN
  5661. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5662. Emit(Mov(position,res2,dim));
  5663. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5664. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5665. Emit(Add(position,res2,res2,imm));
  5666. Emit(Add(position,res2,res2,operand.tag));
  5667. IntermediateCode.MakeMemory(res2,int32);
  5668. Emit(MovReplace(position,res,res2));
  5669. ReleaseIntermediateOperand(res2);
  5670. END;
  5671. SetLabel(end);
  5672. Convert(res,int32);
  5673. InitOperand(result,ModeValue);
  5674. result.op := res;
  5675. END;
  5676. END MathArrayLenOrIncr;
  5677. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5678. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5679. offset: LONGINT;
  5680. BEGIN
  5681. offset := operand.dimOffset+DynamicDim(type)-1;
  5682. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5683. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5684. val := SHORT(dim.intValue);
  5685. t := SemanticChecker.ArrayBase(type,val);
  5686. type := t.resolved(SyntaxTree.ArrayType);
  5687. IF type.form = SyntaxTree.Static THEN
  5688. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5689. ELSE
  5690. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5691. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5692. END;
  5693. UseIntermediateOperand(res);
  5694. InitOperand(result,ModeValue);
  5695. result.op := res;
  5696. ELSE
  5697. Convert(dim,addressType);
  5698. IF ~isUnchecked THEN
  5699. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5700. END;
  5701. end := NewLabel(); next := NIL;
  5702. (* ReuseCopy(dim,res); *)
  5703. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5704. Emit(Mov(position,res,dim));
  5705. Convert(res,int32);
  5706. Convert(res,int32);
  5707. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5708. WHILE t IS SyntaxTree.ArrayType DO
  5709. type := t(SyntaxTree.ArrayType);
  5710. IF type.form = SyntaxTree.Static THEN
  5711. imm := IntermediateCode.Immediate(int32,val);
  5712. next := NewLabel();
  5713. BrneL(next,imm,res);
  5714. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5715. Emit(MovReplace(position,res,imm));
  5716. BrL(end);
  5717. ELSE hasDynamicPart := TRUE;
  5718. END;
  5719. t := type.arrayBase.resolved;
  5720. val := val + 1;
  5721. IF next # NIL THEN SetLabel(next) END;
  5722. END;
  5723. IF hasDynamicPart THEN
  5724. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5725. Convert(res2,addressType);
  5726. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5727. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5728. Emit(Sub(position,res2,imm,res2));
  5729. Emit(Add(position,res2,res2,operand.tag));
  5730. IntermediateCode.MakeMemory(res2,int32);
  5731. Emit(MovReplace(position,res,res2));
  5732. ReleaseIntermediateOperand(res2);
  5733. END;
  5734. SetLabel(end);
  5735. Convert(res,int32);
  5736. InitOperand(result,ModeValue);
  5737. result.op := res;
  5738. END;
  5739. END ArrayLen;
  5740. (**
  5741. create a temporary variable in current scope
  5742. **)
  5743. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5744. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5745. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5746. BEGIN
  5747. IF ~register THEN
  5748. variable := temporaries.GetFreeVariable(type, index);
  5749. ELSE
  5750. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5751. END;
  5752. scope := currentScope;
  5753. IF variable = NIL THEN
  5754. COPY("@hiddenIRVar",string);
  5755. Basic.AppendNumber(string,index);
  5756. name := SyntaxTree.NewIdentifier(string);
  5757. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5758. variable.SetType(type);
  5759. variable.SetAccess(SyntaxTree.Hidden);
  5760. IF ~register THEN
  5761. temporaries.AddVariable(variable);
  5762. IF scope.lastVariable # NIL THEN
  5763. offset := scope.lastVariable.offsetInBits;
  5764. ELSE
  5765. offset := 0;
  5766. END;
  5767. DEC(offset,system.SizeOf(variable.type));
  5768. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5769. variable(SyntaxTree.Variable).SetOffset(offset);
  5770. scope.AddVariable(variable(SyntaxTree.Variable));
  5771. scope.EnterSymbol(variable, duplicate);
  5772. ASSERT(~duplicate);
  5773. InitVariable(variable(SyntaxTree.Variable));
  5774. ELSE
  5775. variable.SetUseRegister(TRUE);
  5776. variable(SyntaxTree.Variable).SetOffset(0);
  5777. END;
  5778. ELSE
  5779. InitVariable(variable(SyntaxTree.Variable));
  5780. (*
  5781. ASSERT(variable.type.resolved = type.resolved)
  5782. *)
  5783. END;
  5784. RETURN variable(SyntaxTree.Variable)
  5785. END GetTemporaryVariable;
  5786. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5787. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5788. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5789. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5790. i: LONGINT; duplicate: BOOLEAN;
  5791. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5792. VAR variable: SyntaxTree.Variable;
  5793. BEGIN
  5794. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5795. variable.SetType(type);
  5796. recordScope.AddVariable(variable);
  5797. END AddVariable;
  5798. BEGIN
  5799. name := "@ArrayDescriptor";
  5800. Basic.AppendNumber(name,dimensions);
  5801. identifier := SyntaxTree.NewIdentifier(name);
  5802. parentScope := module.module.moduleScope;
  5803. symbol := parentScope.FindSymbol(identifier);
  5804. IF symbol # NIL THEN
  5805. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5806. type := typeDeclaration.declaredType;
  5807. ELSE
  5808. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5809. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5810. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5811. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5812. recordType.SetTypeDeclaration(typeDeclaration);
  5813. recordType.SetState(SyntaxTree.Resolved);
  5814. typeDeclaration.SetDeclaredType(recordType);
  5815. AddVariable("@ptr",system.anyType);
  5816. AddVariable("@adr",system.addressType);
  5817. AddVariable("@flags",system.addressType);
  5818. AddVariable("@dim",system.addressType);
  5819. AddVariable("@elementSize",system.addressType);
  5820. FOR i := 0 TO dimensions-1 DO
  5821. name := "@len";
  5822. Basic.AppendNumber(name,i);
  5823. AddVariable(name,system.addressType);
  5824. name := "@incr";
  5825. Basic.AppendNumber(name,i);
  5826. AddVariable(name,system.addressType);
  5827. END;
  5828. parentScope.AddTypeDeclaration(typeDeclaration);
  5829. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5830. ASSERT(~duplicate);
  5831. type := recordType;
  5832. END;
  5833. RETURN type
  5834. END GetMathArrayDescriptorType;
  5835. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5836. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5837. BEGIN
  5838. type := GetMathArrayDescriptorType(dimensions);
  5839. Emit(Push(position,op.op));
  5840. (* push type descriptor *)
  5841. reg := TypeDescriptorAdr(type);
  5842. IF ~newObjectFile THEN
  5843. IntermediateCode.MakeMemory(reg,addressType);
  5844. END;
  5845. Emit(Push(position,reg));
  5846. ReleaseIntermediateOperand(reg);
  5847. (* push realtime flag: false by default *)
  5848. Emit(Push(position,false));
  5849. CallThis(position,"Heaps","NewRec",3);
  5850. END NewMathArrayDescriptor;
  5851. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  5852. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5853. BEGIN
  5854. NEW(string, LEN(s)); COPY(s, string^);
  5855. sv := SyntaxTree.NewStringValue(-1,string);
  5856. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5857. sv.SetType(type);
  5858. Designate(sv,res);
  5859. Emit(Push(position,res.tag));
  5860. Emit(Push(position,res.op));
  5861. ReleaseOperand(res);
  5862. END PushConstString;
  5863. PROCEDURE PushConstBoolean(b: BOOLEAN);
  5864. BEGIN
  5865. IF b THEN
  5866. Emit(Push(-1, true));
  5867. ELSE
  5868. Emit(Push(-1, false));
  5869. END;
  5870. END PushConstBoolean;
  5871. PROCEDURE PushConstSet(v: SET);
  5872. VAR value: SyntaxTree.Value; op: Operand;
  5873. BEGIN
  5874. value := SyntaxTree.NewSetValue(-1, v);
  5875. value.SetType(system.setType);
  5876. Evaluate(value, op);
  5877. Emit(Push(-1, op.op));
  5878. ReleaseOperand(op);
  5879. END PushConstSet;
  5880. PROCEDURE PushConstInteger(v: LONGINT);
  5881. VAR value: SyntaxTree.Value; op: Operand;
  5882. BEGIN
  5883. value := SyntaxTree.NewIntegerValue(-1, v);
  5884. value.SetType(system.longintType);
  5885. Evaluate(value, op);
  5886. Emit(Push(-1, op.op));
  5887. ReleaseOperand(op);
  5888. END PushConstInteger;
  5889. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  5890. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  5891. section: IntermediateCode.Section;
  5892. BEGIN
  5893. procedureScope := SyntaxTree.NewProcedureScope(scope);
  5894. Global.GetSymbolSegmentedName(symbol, name);
  5895. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  5896. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  5897. procedure.SetScope(moduleScope);
  5898. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  5899. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  5900. procedure.SetAccess(SyntaxTree.Hidden);
  5901. currentScope := procedureScope;
  5902. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  5903. EmitEnter(section, -1,NIL,0,0,0);
  5904. RETURN section;
  5905. END OpenInitializer;
  5906. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  5907. BEGIN
  5908. EmitLeave(section, 0, 0 );
  5909. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  5910. section := prev;
  5911. END CloseInitializer;
  5912. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  5913. VAR name: SyntaxTree.IdentifierString;
  5914. variable: SyntaxTree.Variable;
  5915. type: SyntaxTree.Type;
  5916. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  5917. BEGIN
  5918. InitOperand(op,ModeReference);
  5919. op.op := fp;
  5920. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  5921. Dereference(op, x, FALSE);
  5922. result := op;
  5923. Symbol(symbol, op);
  5924. END Field;
  5925. PROCEDURE Direction(direction: LONGINT): SET;
  5926. BEGIN
  5927. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  5928. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  5929. ELSE HALT(100);
  5930. END;
  5931. END Direction;
  5932. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  5933. VAR name: ARRAY 256 OF CHAR; op: Operand;
  5934. BEGIN
  5935. Field(port, op);
  5936. ToMemory(op.op,addressType,0);
  5937. Emit(Push(-1, op.op));
  5938. ReleaseOperand(op);
  5939. Basic.GetString(modifier.identifier, name);
  5940. PushConstString(name);
  5941. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  5942. ASSERT(SemanticChecker.IsStringType(value.type));
  5943. Designate(value, op);
  5944. Emit(Push(modifier.position, op.tag));
  5945. Emit(Push(modifier.position, op.op));
  5946. ReleaseOperand(op);
  5947. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  5948. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  5949. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  5950. Evaluate(value, op);
  5951. Emit(Push(modifier.position, op.op));
  5952. ReleaseOperand(op);
  5953. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  5954. ELSE
  5955. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  5956. END;
  5957. END AddPortProperty;
  5958. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  5959. VAR modifier: SyntaxTree.Modifier;
  5960. BEGIN
  5961. modifier := variable.modifiers;
  5962. WHILE modifier # NIL DO
  5963. AddPortProperty(variable,modifier, modifier.expression);
  5964. modifier := modifier.nextModifier;
  5965. END;
  5966. END AddPortProperties;
  5967. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  5968. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  5969. size, reg: IntermediateCode.Operand; dim: LONGINT;
  5970. PROCEDURE PushLens(type: SyntaxTree.Type);
  5971. BEGIN
  5972. IF type IS SyntaxTree.ArrayType THEN
  5973. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  5974. Evaluate(type(SyntaxTree.ArrayType).length, op);
  5975. Emit(Push(-1, op.op));
  5976. ReleaseOperand(op);
  5977. INC(dim);
  5978. ELSE
  5979. baseType := type;
  5980. END;
  5981. END PushLens;
  5982. BEGIN
  5983. (* cell *)
  5984. IF variable.type IS SyntaxTree.ArrayType THEN
  5985. type := variable.type;
  5986. dim := 0;
  5987. PushLens(type);
  5988. portType := baseType.resolved(SyntaxTree.PortType);
  5989. ELSE
  5990. portType := variable.type(SyntaxTree.PortType);
  5991. END;
  5992. PushSelfPointer();
  5993. (* port *)
  5994. Field(variable, op);
  5995. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  5996. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  5997. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  5998. Designate(d, op);*)
  5999. Emit(Push(-1, op.op));
  6000. ReleaseOperand(op);
  6001. (* name *)
  6002. PushConstString(name);
  6003. (* inout *)
  6004. PushConstSet(Direction(portType.direction));
  6005. (* width *)
  6006. PushConstInteger(portType.sizeInBits);
  6007. IF variable.type IS SyntaxTree.PortType THEN
  6008. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6009. AddPortProperties(variable);
  6010. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  6011. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6012. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6013. Emit(Add(position,reg, sp, size));
  6014. (* dim *)
  6015. PushConstInteger(dim);
  6016. (* len array *)
  6017. Emit(Push(position, reg));
  6018. ReleaseIntermediateOperand(reg);
  6019. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6020. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6021. Emit(Add(position, sp,sp, size));
  6022. END;
  6023. END Variable;
  6024. BEGIN
  6025. IF backend.cellsAreObjects THEN
  6026. variable := x.cellScope.firstVariable;
  6027. WHILE (variable # NIL) DO
  6028. type := variable.type.resolved;
  6029. WHILE (type IS SyntaxTree.ArrayType) DO
  6030. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6031. END;
  6032. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6033. (*!!! check port arrays !! *)
  6034. Global.GetSymbolName(variable,name);
  6035. Variable(name,variable);
  6036. END;
  6037. variable := variable.nextVariable;
  6038. END;
  6039. ELSE HALT(200)
  6040. END;
  6041. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6042. (*
  6043. x.typeDeclaration.GetName(componentName);
  6044. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6045. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6046. instanceType.SetDataMemorySize(dataMemorySize);
  6047. END;
  6048. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6049. instanceType.SetInstructionMemorySize(codeMemorySize)
  6050. END;
  6051. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6052. instanceType.AddCapability(ActiveCells.VectorCapability)
  6053. END;
  6054. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6055. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6056. END;
  6057. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6058. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6059. END;
  6060. AddDevices(instanceType, x);
  6061. *)
  6062. (*
  6063. IF x.isCellNet THEN
  6064. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6065. END;
  6066. *)
  6067. (*currentActiveCellsScope := instanceType;*)
  6068. (*
  6069. parameter := x.firstParameter;
  6070. portIndex := 0;
  6071. WHILE parameter # NIL DO
  6072. parameter.GetName(parameterName);
  6073. parameterType := parameter.type.resolved;
  6074. Parameter(parameterName, parameterType);
  6075. (*
  6076. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6077. ParameterArray(parameterType);
  6078. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6079. FOR i := 0 TO len-1 DO
  6080. COPY(parameterName,name);
  6081. AppendIndex(name,i);
  6082. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6083. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6084. INC(portIndex);
  6085. END;
  6086. ELSE
  6087. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6088. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6089. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6090. INC(portIndex);
  6091. END;
  6092. *)
  6093. parameter := parameter.nextParameter;
  6094. END;
  6095. *)
  6096. (*
  6097. Scope(x.cellScope);
  6098. currentActiveCellsScope := prevActiveCellsScope;
  6099. AddModules(instanceType,x.cellScope);
  6100. *)
  6101. END AddPorts;
  6102. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6103. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6104. BEGIN
  6105. Symbol(cell,op);
  6106. ToMemory(op.op,addressType,0);
  6107. Emit(Push(position,op.op));
  6108. ReleaseOperand(op);
  6109. Basic.GetString(property.name, name);
  6110. PushConstString(name);
  6111. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6112. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6113. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6114. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6115. Designate(d, op);
  6116. IF SemanticChecker.IsStringType(property.type) THEN
  6117. Emit(Push(-1, op.tag))
  6118. END;
  6119. Emit(Push(-1, op.op));
  6120. ReleaseOperand(op);
  6121. END;
  6122. IF SemanticChecker.IsStringType(property.type) THEN
  6123. ASSERT(SemanticChecker.IsStringType(value.type));
  6124. Designate(value, op);
  6125. Emit(Push(property.position, op.tag));
  6126. Emit(Push(property.position, op.op));
  6127. ReleaseOperand(op);
  6128. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6129. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6130. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6131. Evaluate(value, op);
  6132. Emit(Push(property.position, op.op));
  6133. ReleaseOperand(op);
  6134. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6135. ELSE
  6136. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6137. END;
  6138. END AddProperty;
  6139. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6140. VAR symbol: SyntaxTree.Symbol;
  6141. BEGIN
  6142. WHILE modifier # NIL DO
  6143. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6144. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6145. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6146. ELSE
  6147. (*! move this check to checker *)
  6148. Error(modifier.position, "undefined property");
  6149. END;
  6150. modifier := modifier.nextModifier;
  6151. END;
  6152. END AddModifiers;
  6153. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6154. VAR last: SyntaxTree.Modifier;
  6155. BEGIN
  6156. IF to = NIL THEN
  6157. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6158. ELSE
  6159. last := to;
  6160. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6161. last := last.nextModifier;
  6162. END;
  6163. IF last.identifier # this.identifier THEN
  6164. ASSERT(last.nextModifier = NIL);
  6165. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6166. END;
  6167. END;
  6168. END AppendModifier;
  6169. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6170. BEGIN
  6171. WHILE this # NIL DO
  6172. AppendModifier(to, this);
  6173. this := this.nextModifier;
  6174. END;
  6175. END AppendModifiers;
  6176. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6177. VAR op: Operand;
  6178. BEGIN
  6179. Evaluate(p, op);
  6180. Emit(Push(p.position, op.op));
  6181. ReleaseOperand(op);
  6182. (*
  6183. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6184. p := p(SyntaxTree.Designator).left;
  6185. END;
  6186. IF p # NIL THEN
  6187. Evaluate(p, op);
  6188. Emit(Push(p.position, op.op));
  6189. ReleaseOperand(op);
  6190. ELSE
  6191. Emit(Push(-1, nil));
  6192. END;
  6193. *)
  6194. END PushPort;
  6195. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6196. VAR
  6197. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6198. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6199. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6200. tmp:IntermediateCode.Operand;
  6201. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6202. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6203. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6204. dest: IntermediateCode.Operand;
  6205. staticLength: LONGINT; itype: IntermediateCode.Type;
  6206. convert,isTensor: BOOLEAN;
  6207. recordType: SyntaxTree.RecordType;
  6208. baseType: SyntaxTree.Type;
  6209. flags: SET;
  6210. left: SyntaxTree.Expression;
  6211. call: SyntaxTree.Designator;
  6212. procedure: SyntaxTree.Procedure;
  6213. temporaryVariable: SyntaxTree.Variable;
  6214. dummy: IntermediateCode.Operand;
  6215. customBuiltin: SyntaxTree.CustomBuiltin;
  6216. isVarPar: ARRAY 3 OF BOOLEAN;
  6217. callsection: Sections.Section;
  6218. segmentedName: Basic.SegmentedName;
  6219. needsTrace: BOOLEAN;
  6220. n: ARRAY 256 OF CHAR;
  6221. modifier: SyntaxTree.Modifier;
  6222. previous, init: IntermediateCode.Section;
  6223. prevScope: SyntaxTree.Scope;
  6224. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6225. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6226. priority: IntermediateCode.Operand;
  6227. op,callop: Operand;
  6228. BEGIN
  6229. IF type = NIL THEN RETURN END;
  6230. type := type.resolved;
  6231. IF type IS SyntaxTree.PointerType THEN
  6232. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6233. END;
  6234. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6235. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6236. recordScope := type(SyntaxTree.RecordType).recordScope;
  6237. IF recordScope.bodyProcedure # NIL THEN
  6238. procedure := recordScope.bodyProcedure;
  6239. body := procedure.procedureScope.body;
  6240. Emit(Push(position,self));
  6241. IF body.isActive THEN
  6242. StaticCallOperand(callop,procedure);
  6243. Emit(Push(position,callop.op));
  6244. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6245. Convert(priority,sizeType);
  6246. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6247. END;
  6248. Emit(Push(position,priority));
  6249. ReleaseIntermediateOperand(priority);
  6250. IF backend.cooperative THEN
  6251. Emit(Push(position,self));
  6252. CallThis(position,"Activities","Create",3)
  6253. ELSE
  6254. flags := 0;
  6255. IF body.isSafe THEN
  6256. flags := 1;
  6257. END;
  6258. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6259. Emit(Push(position,self));
  6260. CallThis(position,"Objects","CreateProcess",4)
  6261. END;
  6262. ELSE
  6263. Emit(Push(position,self));
  6264. StaticCallOperand(callop,procedure);
  6265. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6266. END;
  6267. Emit(Pop(position,self));
  6268. END;
  6269. END CallBodies;
  6270. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6271. BEGIN
  6272. actualType := actualType.resolved;
  6273. IF actualType IS SyntaxTree.StringType THEN
  6274. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6275. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6276. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6277. ELSE
  6278. tmp := op.tag;
  6279. IntermediateCode.MakeMemory(tmp,addressType);
  6280. Emit(Push(position,tmp));
  6281. END;
  6282. Emit(Push(position,op.op))
  6283. END PushString;
  6284. PROCEDURE PushTD(type: SyntaxTree.Type);
  6285. VAR op: IntermediateCode.Operand;
  6286. BEGIN
  6287. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6288. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6289. ELSE
  6290. IF type.resolved IS SyntaxTree.PointerType THEN
  6291. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6292. END;
  6293. op := TypeDescriptorAdr(type.resolved);
  6294. IF ~newObjectFile THEN
  6295. IntermediateCode.MakeMemory(op,addressType);
  6296. END;
  6297. Emit(Push(position,op));
  6298. END
  6299. END PushTD;
  6300. BEGIN
  6301. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6302. dest := destination; destination := emptyOperand;
  6303. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6304. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6305. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6306. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6307. CASE x.id OF
  6308. (* ---- COPY ----- *)
  6309. |Global.Copy:
  6310. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6311. (* ---- EXCL, INCL----- *)
  6312. |Global.Excl,Global.Incl:
  6313. Evaluate(p0,s0);
  6314. Evaluate(p1,s1);
  6315. Convert(s1.op,setType);
  6316. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6317. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6318. END;
  6319. ReuseCopy(res,s0.op);
  6320. ReleaseOperand(s0);
  6321. Reuse1(tmp,s1.op);
  6322. ReleaseOperand(s1);
  6323. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6324. IF x.id = Global.Excl THEN
  6325. Emit(Not(position,tmp,tmp));
  6326. Emit(And(position,res,res,tmp));
  6327. ELSE
  6328. Emit(Or(position,res,res,tmp));
  6329. END;
  6330. ReleaseIntermediateOperand(tmp);
  6331. Designate(p0,s0);
  6332. ToMemory(s0.op,setType,0);
  6333. Emit(Mov(position,s0.op,res));
  6334. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6335. (* ---- DISPOSE ----- *)
  6336. |Global.Dispose:
  6337. Designate(p0,s0);
  6338. Emit(Push(position,s0.op));
  6339. ReleaseOperand(s0);
  6340. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6341. (* ---- GETPROCEDURE ----- *)
  6342. |Global.GetProcedure:
  6343. Designate(p0,s0);
  6344. PushString(s0,p0.type);
  6345. Designate(p1,s1);
  6346. PushString(s1,p1.type);
  6347. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6348. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6349. ELSE PushTD(procedureType.firstParameter.type)
  6350. END;
  6351. PushTD(procedureType.returnType);
  6352. Designate(p2,s2);
  6353. Emit(Push(position,s2.op));
  6354. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6355. CallThis(position,"Modules","GetProcedure", 7);
  6356. (* ---- ASH, LSH, ROT ----- *)
  6357. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6358. Evaluate(p0,s0);
  6359. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6360. (* make unsigned arguments in order to produced a logical shift *)
  6361. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6362. convert:= TRUE;
  6363. itype := s0.op.type;
  6364. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6365. Convert(s0.op,itype);
  6366. ELSE
  6367. convert := FALSE;
  6368. END;
  6369. END;
  6370. Evaluate(p1,s1);
  6371. IF IsIntegerConstant(p1,hint) THEN
  6372. ReuseCopy(reg,s0.op);
  6373. IF hint > 0 THEN
  6374. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6375. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6376. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6377. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6378. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6379. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6380. END;
  6381. ELSIF hint < 0 THEN
  6382. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6383. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6384. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6385. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6386. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6387. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6388. END;
  6389. END;
  6390. ReleaseOperand(s0); ReleaseOperand(s1);
  6391. ELSE
  6392. exit := NewLabel();
  6393. end := NewLabel();
  6394. ReuseCopy(reg,s0.op);
  6395. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6396. Reuse1(tmp,s1.op);
  6397. Emit(Neg(position,tmp,s1.op));
  6398. Convert(tmp,s1.op.type);
  6399. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6400. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6401. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6402. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6403. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6404. END;
  6405. ReleaseIntermediateOperand(tmp);
  6406. BrL(end);
  6407. SetLabel(exit);
  6408. ReuseCopy(tmp,s1.op);
  6409. Convert(tmp,s1.op.type);
  6410. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6411. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6412. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6413. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6414. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6415. END;
  6416. ReleaseIntermediateOperand(tmp);
  6417. SetLabel(end);
  6418. ReleaseOperand(s0); ReleaseOperand(s1);
  6419. END;
  6420. InitOperand(result,ModeValue);
  6421. IF convert THEN
  6422. itype := reg.type;
  6423. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6424. Convert(reg,itype);
  6425. END;
  6426. result.op := reg;
  6427. (* ---- CAP ----- *)
  6428. |Global.Cap:
  6429. Evaluate(p0,result);
  6430. ReuseCopy(reg,result.op);
  6431. ReleaseIntermediateOperand(result.op);
  6432. ignore := NewLabel();
  6433. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6434. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6435. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6436. SetLabel(ignore);
  6437. result.op := reg;
  6438. (* ---- CHR ----- *)
  6439. |Global.Chr, Global.Chr32:
  6440. Evaluate(p0,result);
  6441. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6442. |Global.Entier, Global.EntierH:
  6443. Evaluate(p0,result);
  6444. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6445. (* ---- MIN and MAX ----- *)
  6446. |Global.Max,Global.Min:
  6447. Evaluate(p0,s0);
  6448. Evaluate(p1,s1);
  6449. Reuse2(res,s0.op,s1.op);
  6450. else := NewLabel();
  6451. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6452. ELSE BrltL(else,s1.op,s0.op) END;
  6453. Emit(Mov(position,res,s0.op));
  6454. ReleaseOperand(s0);
  6455. end := NewLabel();
  6456. BrL(end);
  6457. SetLabel(else);
  6458. Emit(MovReplace(position,res,s1.op));
  6459. SetLabel(end);
  6460. ReleaseOperand(s1);
  6461. InitOperand(result,ModeValue);
  6462. result.op := res;
  6463. (* ---- ODD ----- *)
  6464. |Global.Odd:
  6465. IF ~conditional THEN
  6466. ConditionToValue(x)
  6467. ELSE
  6468. Evaluate(p0,result);
  6469. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6470. Reuse1(res,result.op);
  6471. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6472. ReleaseIntermediateOperand(result.op);
  6473. result.op := res;
  6474. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6475. ReleaseOperand(result);
  6476. BrL(falseLabel);
  6477. END;
  6478. (* ---- ORD ----- *)
  6479. |Global.Ord, Global.Ord32:
  6480. Evaluate(p0,result);
  6481. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6482. (* ---- SHORT, LONG ----- *)
  6483. |Global.Short, Global.Long:
  6484. Evaluate(p0,result);
  6485. IF x.type IS SyntaxTree.ComplexType THEN
  6486. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6487. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6488. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6489. ELSE
  6490. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6491. END
  6492. (* ---- HALT, SYSTEM.HALT----- *)
  6493. |Global.Halt, Global.systemHalt:
  6494. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6495. EmitTrap (position, val);
  6496. (* ---- ASSERT ----- *)
  6497. |Global.Assert:
  6498. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6499. trueL := NewLabel();
  6500. falseL := NewLabel();
  6501. Condition(p0,trueL,falseL);
  6502. IF p1 = NIL THEN val := AssertTrap
  6503. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6504. END;
  6505. SetLabel(falseL);
  6506. EmitTrap(position,val);
  6507. SetLabel(trueL);
  6508. END;
  6509. (*
  6510. Emit(TrapC(result.op,val);
  6511. *)
  6512. (* ---- INC, DEC----- *)
  6513. |Global.Inc,Global.Dec:
  6514. Expression(p0); adr := result.op;
  6515. LoadValue(result,p0.type); l := result;
  6516. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6517. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6518. END;
  6519. IF x.id = Global.Inc THEN
  6520. Emit(Add(position,l.op,l.op,r.op));
  6521. ELSE
  6522. Emit(Sub(position,l.op,l.op,r.op));
  6523. END;
  6524. ReleaseOperand(l); ReleaseOperand(r);
  6525. (* ---- LEN ----- *)
  6526. |Global.Len: (* dynamic length, static length done by checker *)
  6527. Designate(p0,operand);
  6528. IF p1 = NIL THEN
  6529. InitOperand(l,ModeValue);
  6530. l.op := IntermediateCode.Immediate(int32,0);
  6531. ELSE
  6532. Evaluate(p1,l);
  6533. END;
  6534. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6535. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6536. Dereference(operand, p0.type.resolved, FALSE);
  6537. END;
  6538. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6539. ReleaseOperand(operand); ReleaseOperand(l);
  6540. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6541. ASSERT(p1 # NIL);
  6542. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6543. Dereference(operand,p0.type.resolved,FALSE);
  6544. END;
  6545. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6546. ReleaseOperand(operand); ReleaseOperand(l);
  6547. ELSE HALT(100);
  6548. END;
  6549. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6550. (* ---- FIRST ---- *)
  6551. |Global.First:
  6552. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6553. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6554. ELSE
  6555. Designate(p0, result)
  6556. END
  6557. (* ---- LAST ---- *)
  6558. |Global.Last:
  6559. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6560. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6561. ELSE
  6562. Designate(p0, result);
  6563. (* make sure result.op is a register *)
  6564. tmp := result.op;
  6565. ReuseCopy(result.op, result.op);
  6566. ReleaseIntermediateOperand(tmp);
  6567. (* add offset to result.op *)
  6568. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6569. END
  6570. (* ---- STEP ---- *)
  6571. |Global.Step:
  6572. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6573. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6574. ELSE
  6575. Designate(p0, result);
  6576. (* make sure result.op is a register *)
  6577. tmp := result.op;
  6578. ReuseCopy(result.op, result.op);
  6579. ReleaseIntermediateOperand(tmp);
  6580. (* add offset to result.op *)
  6581. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6582. END
  6583. (* ---- RE ---- *)
  6584. |Global.Re:
  6585. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6586. Designate(p0, result)
  6587. ELSE
  6588. Evaluate(p0, result)
  6589. END
  6590. (* ---- IM ---- *)
  6591. |Global.Im:
  6592. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6593. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6594. Designate(p0, result);
  6595. (* make sure result.op is a register *)
  6596. tmp := result.op;
  6597. ReuseCopy(result.op, result.op);
  6598. ReleaseIntermediateOperand(tmp);
  6599. (* add offset to result.op *)
  6600. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6601. (* ---- ABS ----- *)
  6602. |Global.Abs:
  6603. Evaluate(p0,operand);
  6604. type := p0.type.resolved;
  6605. InitOperand(result,ModeValue);
  6606. Reuse1a(result.op,operand.op,dest);
  6607. Emit(Abs(position,result.op,operand.op));
  6608. ReleaseOperand(operand);
  6609. (* ---- WAIT ----- *)
  6610. |Global.Wait:
  6611. Evaluate(p0,operand);
  6612. Emit(Push(position,operand.op));
  6613. ReleaseOperand(operand);
  6614. CallThis(position,"Activities","Wait", 1);
  6615. (* ---- NEW ----- *)
  6616. |Global.New:
  6617. (*! the following code is only correct for "standard" Oberon calling convention *)
  6618. type := p0.type.resolved;
  6619. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6620. THEN
  6621. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6622. IF backend.cooperative THEN
  6623. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6624. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6625. IF recordType.isObject THEN
  6626. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6627. IF recordType.IsActive() THEN
  6628. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6629. END;
  6630. IF recordType.IsProtected() THEN
  6631. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6632. END;
  6633. ELSE
  6634. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6635. END;
  6636. END;
  6637. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6638. CallThis(position,"Runtime","New", 1);
  6639. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6640. Emit(Result(position, pointer));
  6641. exit := NewLabel();
  6642. BreqL(exit,pointer,nil);
  6643. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6644. GetRecordTypeName (recordType,name);
  6645. IF ~recordType.isObject THEN
  6646. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6647. END;
  6648. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6649. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6650. IF recordType.isObject THEN
  6651. IF recordType.IsProtected() THEN
  6652. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6653. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6654. END;
  6655. IF recordType.IsActive() THEN
  6656. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6657. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6658. END;
  6659. END;
  6660. END;
  6661. (* initialize fields *)
  6662. IF type(SyntaxTree.PointerType).isPlain THEN
  6663. size := 0;
  6664. ELSIF recordType.isObject THEN
  6665. size := BaseObjectTypeSize;
  6666. ELSE
  6667. size := BaseRecordTypeSize;
  6668. END;
  6669. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6670. (* call initializer *)
  6671. constructor := GetConstructor(recordType);
  6672. IF constructor # NIL THEN
  6673. (*! should be unified with ProcedureCallDesignator *)
  6674. Emit(Push(position,pointer));
  6675. ReleaseIntermediateOperand(pointer);
  6676. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6677. FOR i := 1 TO x.parameters.Length()-1 DO
  6678. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6679. formalParameter := formalParameter.nextParameter;
  6680. END;
  6681. (* static call of the constructor *)
  6682. GetCodeSectionNameForSymbol(constructor,name);
  6683. ASSERT(~constructor.isInline);
  6684. IF constructor.scope.ownerModule # module.module THEN
  6685. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6686. ELSE
  6687. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6688. END;
  6689. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6690. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6691. Emit(Pop(position,pointer));
  6692. END;
  6693. (* call bodies *)
  6694. CallBodies(pointer,p0.type);
  6695. SetLabel(exit);
  6696. needsTrace := p0.NeedsTrace();
  6697. IF needsTrace THEN ModifyAssignments(true) END;
  6698. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6699. Emit(Push(position, pointer));
  6700. CallThis(position,"GarbageCollector","Watch",0);
  6701. Emit(Pop(position, pointer));
  6702. END;
  6703. Designate(p0,l);
  6704. IF needsTrace THEN
  6705. CallAssignPointer(l.op, pointer);
  6706. ELSE
  6707. ToMemory(l.op,addressType,0);
  6708. Emit(Mov(position,l.op,pointer));
  6709. END;
  6710. ReleaseIntermediateOperand(pointer);
  6711. ReleaseOperand(l);
  6712. IF needsTrace THEN ModifyAssignments(false) END;
  6713. ELSE
  6714. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6715. IF temporaryVariable # NIL THEN
  6716. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6717. ELSE
  6718. Designate(p0,l);
  6719. END;
  6720. (* l.op contains address of pointer to record *)
  6721. Emit(Push(position,l.op)); (* address for use after syscall *)
  6722. Emit(Push(position,l.op));
  6723. ReleaseOperand(l);
  6724. (* push type descriptor *)
  6725. reg := TypeDescriptorAdr(recordType);
  6726. IF ~newObjectFile THEN
  6727. IntermediateCode.MakeMemory(reg,addressType);
  6728. END;
  6729. Emit(Push(position,reg));
  6730. ReleaseIntermediateOperand(reg);
  6731. (* push realtime flag *)
  6732. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6733. ELSE Emit(Push(position,false));
  6734. END;
  6735. CallThis(position,"Heaps","NewRec", 3);
  6736. (* check allocation success, if not successful then do not call initializers and bodies *)
  6737. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6738. Emit(Pop(position,pointer));
  6739. MakeMemory(reg,pointer,addressType,0);
  6740. ReleaseIntermediateOperand(pointer);
  6741. pointer := reg;
  6742. exit := NewLabel();
  6743. BreqL(exit,pointer,nil);
  6744. Emit(Push(position,pointer));
  6745. (* initialize fields *)
  6746. InitFields(recordType, pointer,0);
  6747. (* call initializer *)
  6748. constructor := GetConstructor(recordType);
  6749. IF constructor # NIL THEN
  6750. (*! should be unified with ProcedureCallDesignator *)
  6751. Emit(Push(position,pointer));
  6752. ReleaseIntermediateOperand(pointer);
  6753. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6754. FOR i := 1 TO x.parameters.Length()-1 DO
  6755. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6756. formalParameter := formalParameter.nextParameter;
  6757. END;
  6758. (* static call of the constructor *)
  6759. GetCodeSectionNameForSymbol(constructor,name);
  6760. ASSERT(~constructor.isInline);
  6761. IF constructor.scope.ownerModule # module.module THEN
  6762. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6763. ELSE
  6764. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6765. END;
  6766. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6767. ELSE
  6768. ReleaseIntermediateOperand(pointer);
  6769. END;
  6770. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6771. Emit(Pop(position,pointer));
  6772. IF temporaryVariable # NIL THEN
  6773. Designate(p0,l);
  6774. ToMemory(l.op,addressType,0);
  6775. Emit(Mov(position,l.op,pointer));
  6776. ReleaseOperand(l);
  6777. result.tag := emptyOperand;
  6778. END;
  6779. (* call bodies *)
  6780. CallBodies(pointer,p0.type);
  6781. ReleaseIntermediateOperand(pointer);
  6782. IF temporaryVariable # NIL THEN
  6783. end := NewLabel();
  6784. BrL(end);
  6785. SetLabel(exit);
  6786. Designate(p0,l);
  6787. ToMemory(l.op,addressType,0);
  6788. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6789. ReleaseOperand(l);
  6790. SetLabel(end);
  6791. ELSE
  6792. SetLabel(exit);
  6793. END;
  6794. END;
  6795. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6796. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6797. dim := 0;
  6798. IF p1 # NIL THEN
  6799. FOR i := 1 TO x.parameters.Length()-1 DO
  6800. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6801. parameter := x.parameters.GetExpression(i);
  6802. Evaluate(parameter,r);
  6803. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6804. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6805. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6806. END;
  6807. Emit(Push(position,r.op));
  6808. IF i=1 THEN
  6809. ReuseCopy(reg,r.op);
  6810. ELSE
  6811. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6812. END;
  6813. ReleaseOperand(r);
  6814. INC(dim);
  6815. END;
  6816. Convert(reg,addressType);
  6817. ELSE
  6818. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6819. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6820. END;
  6821. openDim := dim;
  6822. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6823. IF backend.cooperative THEN
  6824. size := ToMemoryUnits(system,system.SizeOf(type));
  6825. WHILE type IS SyntaxTree.ArrayType DO
  6826. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6827. END;
  6828. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6829. IF (size # 1) THEN
  6830. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6831. END;
  6832. Emit(Push(position,reg));
  6833. size := ToMemoryUnits(system,system.SizeOf(type));
  6834. IF (size # 1) THEN
  6835. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6836. END;
  6837. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6838. Emit(Push(position,reg));
  6839. ReleaseIntermediateOperand(reg);
  6840. CallThis(position,"Runtime","New", 1);
  6841. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6842. Emit(Result(position, pointer));
  6843. exit := NewLabel();
  6844. else := NewLabel();
  6845. BreqL(else,pointer,nil);
  6846. IF ~type.hasPointers THEN
  6847. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6848. ELSIF type IS SyntaxTree.RecordType THEN
  6849. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6850. ELSIF type IS SyntaxTree.ProcedureType THEN
  6851. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  6852. ELSE
  6853. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  6854. END;
  6855. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  6856. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  6857. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DataOffset * system.addressSize)),IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6858. IF type IS SyntaxTree.RecordType THEN
  6859. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  6860. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  6861. ELSE
  6862. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  6863. END;
  6864. i := openDim;
  6865. WHILE i > 0 DO
  6866. DEC (i);
  6867. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  6868. END;
  6869. needsTrace := p0.NeedsTrace();
  6870. IF needsTrace THEN ModifyAssignments(true) END;
  6871. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  6872. Emit(Push(position, pointer));
  6873. CallThis(position,"GarbageCollector","Watch",0);
  6874. Emit(Pop(position, pointer));
  6875. END;
  6876. Designate(p0,l);
  6877. IF needsTrace THEN
  6878. CallAssignPointer(l.op, pointer);
  6879. ModifyAssignments(false);
  6880. ELSE
  6881. ToMemory(l.op,addressType,0);
  6882. Emit(Mov(position,l.op,pointer));
  6883. END;
  6884. ReleaseIntermediateOperand(pointer);
  6885. ReleaseOperand(l);
  6886. BrL(exit);
  6887. SetLabel(else);
  6888. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  6889. Designate(p0,l);
  6890. IF needsTrace THEN
  6891. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  6892. ELSE
  6893. ToMemory(l.op,addressType,0);
  6894. Emit(Mov(position,l.op,pointer));
  6895. END;
  6896. ReleaseOperand(l);
  6897. SetLabel(exit);
  6898. ELSE
  6899. (*! the following code is only correct for "standard" Oberon calling convention *)
  6900. IF SemanticChecker.ContainsPointer(type) THEN
  6901. IF type IS SyntaxTree.ArrayType THEN
  6902. staticLength := 1;
  6903. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  6904. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  6905. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6906. END;
  6907. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  6908. Emit(Mul(position,reg,reg,tmp));
  6909. END;
  6910. Designate(p0,l);
  6911. IF openDim > 0 THEN
  6912. Emit(Push(position,l.op)); (* address for use after syscall *)
  6913. END;
  6914. Emit(Push(position,l.op)); (* address *)
  6915. ReleaseOperand(l);
  6916. tmp := TypeDescriptorAdr(type);
  6917. IF ~newObjectFile THEN
  6918. IntermediateCode.MakeMemory(tmp,addressType);
  6919. END;
  6920. Emit(Push(position,tmp)); (* type descriptor *)
  6921. ReleaseIntermediateOperand(tmp);
  6922. Emit(Push(position,reg)); (* number Elements *)
  6923. ReleaseIntermediateOperand(reg);
  6924. tmp := IntermediateCode.Immediate(addressType,dim);
  6925. Emit(Push(position,tmp)); (* dimensions *)
  6926. (* push realtime flag *)
  6927. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6928. ELSE Emit(Push(position,false));
  6929. END;
  6930. CallThis(position,"Heaps","NewArr",5)
  6931. ELSE
  6932. size := ToMemoryUnits(system,system.SizeOf(type));
  6933. IF (size # 1) THEN
  6934. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6935. END;
  6936. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  6937. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  6938. Emit(Add(position,reg,reg,tmp));
  6939. Designate(p0,l);
  6940. IF openDim >0 THEN
  6941. Emit(Push(position,l.op)); (* address for use after syscall *)
  6942. END;
  6943. Emit(Push(position,l.op)); (* address for syscall *)
  6944. ReleaseOperand(l); (* pointer address *)
  6945. Emit(Push(position,reg)); (* size *)
  6946. ReleaseIntermediateOperand(reg);
  6947. (* push realtime flag *)
  6948. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6949. ELSE Emit(Push(position,false));
  6950. END;
  6951. CallThis(position,"Heaps","NewSys", 3)
  6952. END;
  6953. IF openDim > 0 THEN
  6954. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6955. Emit(Pop(position,adr));
  6956. ToMemory(adr,addressType,0);
  6957. ReuseCopy(tmp,adr);
  6958. ReleaseIntermediateOperand(adr);
  6959. adr := tmp;
  6960. else := NewLabel();
  6961. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  6962. i := openDim-1;
  6963. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6964. WHILE (i >= 0) DO
  6965. Emit(Pop(position,reg));
  6966. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  6967. Emit(Mov(position,res,reg));
  6968. DEC(i);
  6969. END;
  6970. ReleaseIntermediateOperand(adr);
  6971. ReleaseIntermediateOperand(reg);
  6972. exit := NewLabel();
  6973. BrL(exit);
  6974. SetLabel(else);
  6975. (* else part: array could not be allocated *)
  6976. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  6977. Emit(Add(position,sp,sp,tmp));
  6978. SetLabel(exit);
  6979. END;
  6980. END;
  6981. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  6982. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  6983. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  6984. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  6985. procedureType := procedure.type(SyntaxTree.ProcedureType);
  6986. left.SetType(procedure.type);
  6987. formalParameter := procedureType.firstParameter;
  6988. (* push array to allocate *)
  6989. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  6990. formalParameter :=formalParameter.nextParameter;
  6991. (* push length array *)
  6992. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  6993. (* push size *)
  6994. type := t0;
  6995. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  6996. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  6997. END;
  6998. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  6999. Emit(Push(position,tmp));
  7000. (* *)
  7001. IF SemanticChecker.ContainsPointer(type) THEN
  7002. tmp := TypeDescriptorAdr(type);
  7003. IF ~newObjectFile THEN
  7004. IntermediateCode.MakeMemory(tmp,addressType);
  7005. END;
  7006. ELSE
  7007. tmp := IntermediateCode.Immediate(addressType, 0);
  7008. END;
  7009. Emit(Push(position,tmp)); (* type descriptor *)
  7010. StaticCallOperand(result,procedure);
  7011. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7012. ReleaseOperand(result);
  7013. END;
  7014. (*
  7015. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7016. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7017. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7018. *)
  7019. ELSE
  7020. dim := 0;
  7021. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7022. (* generate geometry descriptor *)
  7023. Designate(p0,l);
  7024. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7025. ReleaseOperand(l);
  7026. isTensor := TRUE;
  7027. ELSE
  7028. isTensor := FALSE;
  7029. END;
  7030. FOR i := 1 TO x.parameters.Length()-1 DO
  7031. IF ~isTensor THEN
  7032. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7033. END;
  7034. parameter := x.parameters.GetExpression(i);
  7035. Evaluate(parameter,r);
  7036. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7037. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7038. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7039. END;
  7040. Emit(Push(position,r.op));
  7041. IF i=1 THEN
  7042. ReuseCopy(reg,r.op);
  7043. ELSE
  7044. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7045. END;
  7046. ReleaseOperand(r);
  7047. INC(dim);
  7048. END;
  7049. Convert(reg,addressType);
  7050. openDim := dim;
  7051. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7052. (*! the following code is only correct for "standard" Oberon calling convention *)
  7053. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7054. t := type;
  7055. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7056. staticLength := 1;
  7057. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7058. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7059. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7060. END;
  7061. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7062. Emit(Mul(position,reg,reg,tmp));
  7063. END;
  7064. Designate(p0,l);
  7065. IF isTensor THEN
  7066. Dereference(l,type,FALSE);
  7067. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7068. END;
  7069. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7070. Emit(Push(position,l.tag)); (* address *)
  7071. ReleaseOperand(l);
  7072. tmp := TypeDescriptorAdr(t);
  7073. IF ~newObjectFile THEN
  7074. IntermediateCode.MakeMemory(tmp,addressType);
  7075. END;
  7076. Emit(Push(position,tmp)); (* type descriptor *)
  7077. ReleaseIntermediateOperand(tmp);
  7078. Emit(Push(position,reg)); (* number Elements *)
  7079. ReleaseIntermediateOperand(reg);
  7080. tmp := IntermediateCode.Immediate(addressType,0);
  7081. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7082. (* push realtime flag: false by default *)
  7083. Emit(Push(position,false));
  7084. CallThis(position,"Heaps","NewArr",5);
  7085. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7086. Emit(Pop(position,adr));
  7087. GetMathArrayField(tmp,adr,MathPtrOffset);
  7088. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7089. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7090. PutMathArrayField(adr,reg,MathAdrOffset);
  7091. ReleaseIntermediateOperand(tmp);
  7092. ReleaseIntermediateOperand(reg);
  7093. ELSE
  7094. IF isTensor THEN
  7095. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7096. ELSE
  7097. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7098. END;
  7099. IF (size # 1) THEN
  7100. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7101. END;
  7102. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7103. Emit(Add(position,reg,reg,tmp));
  7104. Designate(p0,l);
  7105. IF isTensor THEN
  7106. Dereference(l,type,FALSE);
  7107. END;
  7108. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7109. Emit(Push(position,l.tag)); (* address for syscall *)
  7110. ReleaseOperand(l); (* pointer address *)
  7111. Emit(Push(position,reg)); (* size *)
  7112. ReleaseIntermediateOperand(reg);
  7113. (* push realtime flag: false by default *)
  7114. Emit(Push(position,false));
  7115. CallThis(position,"Heaps","NewSys",3);
  7116. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7117. Emit(Pop(position,adr));
  7118. GetMathArrayField(tmp,adr,MathPtrOffset);
  7119. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7120. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7121. PutMathArrayField(adr,reg,MathAdrOffset);
  7122. ReleaseIntermediateOperand(tmp);
  7123. ReleaseIntermediateOperand(reg);
  7124. END;
  7125. flags := {};
  7126. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7127. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7128. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7129. PutMathArrayField(adr,tmp,MathDimOffset);
  7130. else := NewLabel();
  7131. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7132. i := openDim-1;
  7133. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7134. IF isTensor THEN
  7135. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7136. ELSE
  7137. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7138. END;
  7139. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7140. WHILE (i >= 0) DO
  7141. Emit(Pop(position,reg));
  7142. PutMathArrayLength(adr,reg,i);
  7143. PutMathArrayIncrement(adr,tmp,i);
  7144. IF i > 0 THEN
  7145. IF i=openDim-1 THEN
  7146. ReuseCopy(tmp,tmp);
  7147. END;
  7148. Emit(Mul(position,tmp,tmp,reg));
  7149. END;
  7150. DEC(i);
  7151. END;
  7152. ReleaseIntermediateOperand(adr);
  7153. ReleaseIntermediateOperand(reg);
  7154. ReleaseIntermediateOperand(tmp);
  7155. exit := NewLabel();
  7156. BrL(exit);
  7157. SetLabel(else);
  7158. (* else part: array could not be allocated *)
  7159. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7160. Emit(Add(position,sp,sp,tmp));
  7161. SetLabel(exit);
  7162. END;
  7163. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7164. THEN
  7165. IF ~backend.cellsAreObjects THEN RETURN END;
  7166. IF InCellScope(currentScope) THEN
  7167. PushSelfPointer()
  7168. ELSE
  7169. Emit(Push(position, nil));
  7170. END;
  7171. (* push temp address *)
  7172. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7173. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7174. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7175. (* l.op contains address of pointer to record *)
  7176. Emit(Push(position,l.op)); (* address for use after syscall *)
  7177. ReleaseOperand(l);
  7178. (* push type descriptor *)
  7179. reg := TypeDescriptorAdr(baseType);
  7180. IF ~newObjectFile THEN
  7181. IntermediateCode.MakeMemory(reg,addressType);
  7182. END;
  7183. Emit(Push(position,reg));
  7184. ReleaseIntermediateOperand(reg);
  7185. (* push name *)
  7186. (*Global.GetSymbolName(p0, n);*)
  7187. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7188. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7189. ELSE
  7190. Global.GetModuleName(module.module, n);
  7191. END;
  7192. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7193. (*type.typeDeclaration.GetName(n);*)
  7194. PushConstString(n);
  7195. (* push cellnet boolean *)
  7196. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7197. (* push engine boolean *)
  7198. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7199. (* allocate *)
  7200. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7201. (* add capabilities *)
  7202. modifier := p0(SyntaxTree.Designator).modifiers;
  7203. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7204. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7205. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7206. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7207. END;
  7208. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7209. (*
  7210. modifier := baseType(SyntaxTree.CellType).modifiers;
  7211. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7212. modifier := p0(SyntaxTree.Designator).modifiers;
  7213. *)
  7214. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7215. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7216. (* l.op contains address of pointer to record *)
  7217. ToMemory(l.op,addressType,0);
  7218. (* l.op contains value of pointer to record *)
  7219. Emit(Push(position,l.op)); (* address for use after syscall *)
  7220. ReleaseOperand(l);
  7221. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7222. prevScope := currentScope;
  7223. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7224. previous := section;
  7225. section := init;
  7226. (* add ports *)
  7227. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7228. CloseInitializer(previous);
  7229. currentScope := prevScope;
  7230. Symbol(temporaryVariable,l);
  7231. ToMemory(l.op,addressType,0);
  7232. Emit(Push(position,l.op));
  7233. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7234. (*
  7235. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7236. IF constructor # NIL THEN
  7237. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7238. FOR i := 1 TO x.parameters.Length()-1 DO
  7239. p := x.parameters.GetExpression(i);
  7240. Global.GetSymbolName(parameter,name);
  7241. Evaluate(p, value);
  7242. ASSERT(value.type # NIL);
  7243. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7244. par := instance.AddParameter(name);
  7245. par.SetInteger(value.integer);
  7246. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7247. par := instance.AddParameter(name);
  7248. par.SetBoolean(value.boolean);
  7249. ELSE Error(x.position,NotYetImplemented)
  7250. END;
  7251. parameter := parameter.nextParameter
  7252. END;
  7253. END;
  7254. *)
  7255. (* call initializer *)
  7256. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7257. IF constructor # NIL THEN
  7258. (*! should be unified with ProcedureCallDesignator *)
  7259. IF backend.cellsAreObjects THEN
  7260. Symbol(temporaryVariable,l);
  7261. ToMemory(l.op,addressType,0);
  7262. Emit(Push(position,l.op));
  7263. ReleaseOperand(l);
  7264. END;
  7265. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7266. FOR i := 1 TO x.parameters.Length()-1 DO
  7267. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7268. formalParameter := formalParameter.nextParameter;
  7269. END;
  7270. (* static call of the constructor *)
  7271. Global.GetSymbolSegmentedName(constructor,name);
  7272. ASSERT(~constructor.isInline);
  7273. IF constructor.scope.ownerModule # module.module THEN
  7274. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7275. ELSE
  7276. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7277. END;
  7278. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7279. (*ELSE
  7280. ReleaseIntermediateOperand(pointer);*)
  7281. END;
  7282. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7283. ToMemory(l.op, addressType, 0);
  7284. Designate(p0,s0);
  7285. ToMemory(s0.op,addressType,0);
  7286. Emit(Mov(position,s0.op,l.op));
  7287. ReleaseOperand(l);
  7288. ReleaseOperand(s0);
  7289. result.tag := emptyOperand;
  7290. (* start *)
  7291. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7292. (* push cell *)
  7293. Symbol(temporaryVariable, l);
  7294. ToMemory(l.op,addressType,0);
  7295. Emit(Push(-1,l.op));
  7296. (* push delegate *)
  7297. Emit(Push(-1,l.op));
  7298. ReleaseOperand(l);
  7299. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7300. Emit(Push(position, s1.op));
  7301. ReleaseOperand(s1);
  7302. CallThis(position,"ActiveCellsRuntime","Start",3);
  7303. END;
  7304. (*IF temporaryVariable # NIL THEN
  7305. end := NewLabel();
  7306. BrL(end);
  7307. SetLabel(exit);
  7308. Designate(p0,l);
  7309. ToMemory(l.op,addressType,0);
  7310. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7311. ReleaseOperand(l);
  7312. SetLabel(end);
  7313. ELSE
  7314. SetLabel(exit);
  7315. END;
  7316. *)
  7317. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7318. ELSE (* no pointer to record, no pointer to array *)
  7319. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7320. (* ignore new statement *)
  7321. Warning(p0.position, "cannot run on final hardware");
  7322. ELSE
  7323. HALT(200);
  7324. END;
  7325. END;
  7326. (* ---- ADDRESSOF----- *)
  7327. |Global.systemAdr:
  7328. Designate(p0,s0);
  7329. s0.mode := ModeValue;
  7330. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7331. ReleaseIntermediateOperand(s0.op);
  7332. s0.op := s0.tag;
  7333. IntermediateCode.InitOperand(s0.tag);
  7334. END;
  7335. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7336. result := s0;
  7337. (* ---- BIT ----- *)
  7338. |Global.systemBit:
  7339. Evaluate(p0,s0);
  7340. ToMemory(s0.op,addressType,0);
  7341. ReuseCopy(res,s0.op);
  7342. ReleaseOperand(s0);
  7343. Evaluate(p1,s1);
  7344. Emit(Ror(position,res,res,s1.op));
  7345. ReleaseOperand(s1);
  7346. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7347. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7348. IF ~conditional THEN
  7349. InitOperand(result,ModeValue); result.op := res;
  7350. ELSE
  7351. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7352. BrL(falseLabel);
  7353. ReleaseIntermediateOperand(res);
  7354. END;
  7355. (* --- MSK ----*)
  7356. |Global.systemMsk:
  7357. Evaluate(p0,s0);
  7358. Evaluate(p1,s1);
  7359. ReuseCopy(res,s0.op);
  7360. ReleaseOperand(s0);
  7361. Emit(And(position,res,res,s1.op));
  7362. ReleaseOperand(s1);
  7363. InitOperand(result,ModeValue);
  7364. result.op := res;
  7365. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7366. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7367. Evaluate(p0,s0);
  7368. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7369. ReleaseOperand(s0);
  7370. InitOperand(result,ModeValue);
  7371. result.op := res;
  7372. (* ---- SYSTEM.GetStackPointer ----- *)
  7373. |Global.systemGetStackPointer:
  7374. InitOperand(result,ModeValue);
  7375. result.op := sp;
  7376. (* ---- SYSTEM.GetFramePointer ----- *)
  7377. |Global.systemGetFramePointer:
  7378. InitOperand(result,ModeValue);
  7379. result.op := fp;
  7380. (* ---- SYSTEM.GetActivity ----- *)
  7381. |Global.systemGetActivity:
  7382. ASSERT(backend.cooperative);
  7383. InitOperand(result,ModeValue);
  7384. result.op := ap;
  7385. (* ---- SYSTEM.SetStackPointer ----- *)
  7386. |Global.systemSetStackPointer:
  7387. Evaluate(p0,s0); (* *)
  7388. Emit(Mov(position,sp,s0.op));
  7389. ReleaseOperand(s0);
  7390. (* ---- SYSTEM.SetFramePointer ----- *)
  7391. |Global.systemSetFramePointer:
  7392. Evaluate(p0,s0); (* *)
  7393. Emit(Mov(position,fp,s0.op));
  7394. ReleaseOperand(s0);
  7395. (* ---- SYSTEM.Activity ----- *)
  7396. |Global.systemSetActivity:
  7397. ASSERT(backend.cooperative);
  7398. Evaluate(p0,s0); (* *)
  7399. Emit(Mov(position,ap,s0.op));
  7400. ReleaseOperand(s0);
  7401. (* ---- SYSTEM.VAL ----- *)
  7402. |Global.systemVal:
  7403. Expression(p1);
  7404. s1 := result;
  7405. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7406. IF s1.mode = ModeReference THEN
  7407. (* nothing to be done if not record type, just take over new type *)
  7408. IF (type IS SyntaxTree.RecordType) THEN
  7409. ReleaseIntermediateOperand(s1.tag);
  7410. s1.tag := TypeDescriptorAdr(type);
  7411. IF ~newObjectFile THEN
  7412. IntermediateCode.MakeMemory(s1.tag,addressType);
  7413. END;
  7414. UseIntermediateOperand(s1.tag);
  7415. END;
  7416. result := s1;
  7417. ELSE (* copy over result to different type, may not use convert *)
  7418. itype := IntermediateCode.GetType(system,type);
  7419. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7420. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7421. Emit(Mov(position,s0.op,s1.op));
  7422. ReleaseOperand(s1);
  7423. InitOperand(result,ModeValue);
  7424. result.op := s0.op;
  7425. ELSE (* different size, must convert *)
  7426. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7427. Convert(s1.op, IntermediateCode.GetType(system,type));
  7428. result := s1;
  7429. END;
  7430. END;
  7431. (* ---- SYSTEM.GET ----- *)
  7432. |Global.systemGet:
  7433. Evaluate(p0,s0); (* adr *)
  7434. Designate(p1,s1); (* variable *)
  7435. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7436. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7437. Emit(Mov(position,s1.op,s0.op));
  7438. ReleaseOperand(s1);
  7439. ReleaseOperand(s0);
  7440. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7441. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7442. Evaluate(p0,s0); (* *)
  7443. Evaluate(p1,s1); (* variable *)
  7444. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7445. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7446. (* real part *)
  7447. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7448. Emit(Mov(position,res, s1.op));
  7449. ReleaseIntermediateOperand(res);
  7450. (* imaginary part *)
  7451. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7452. Emit(Mov(position,res, s1.tag));
  7453. ReleaseIntermediateOperand(res);
  7454. ReleaseOperand(s1);
  7455. ReleaseOperand(s0);
  7456. ELSE
  7457. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7458. ReleaseOperand(s0);
  7459. Emit(Mov(position,res,s1.op));
  7460. ReleaseIntermediateOperand(res);
  7461. ReleaseOperand(s1);
  7462. END;
  7463. (* ---- SYSTEM.MOVE ----- *)
  7464. |Global.systemMove:
  7465. Evaluate(p0,s0);
  7466. Evaluate(p1,s1);
  7467. Evaluate(p2,s2);
  7468. Emit(Copy(position,s1.op,s0.op,s2.op));
  7469. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7470. (* ---- SYSTEM.NEW ----- *)
  7471. |Global.systemNew:
  7472. Designate(p0,s0);
  7473. Emit(Push(position,s0.op));
  7474. ReleaseOperand(s0);
  7475. Evaluate(p1,s1);
  7476. Emit(Push(position,s1.op));
  7477. ReleaseOperand(s1);
  7478. (* push realtime flag: false by default *)
  7479. Emit(Push(position,false));
  7480. CallThis(position,"Heaps","NewSys",3);
  7481. (* ---- SYSTEM.CALL ----- *)
  7482. |Global.systemRef:
  7483. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7484. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7485. s0.mode := ModeValue;
  7486. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7487. result := s0
  7488. (* ---- INCR ----- *)
  7489. |Global.Incr:
  7490. Designate(p0,operand);
  7491. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7492. Dereference(operand,p0.type.resolved,FALSE);
  7493. END;
  7494. ASSERT(p1 # NIL);
  7495. Evaluate(p1,l);
  7496. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7497. ReleaseOperand(operand); ReleaseOperand(l);
  7498. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7499. (* ---- SUM ----- *)
  7500. |Global.Sum: HALT(200);
  7501. (* ---- CAS ----- *)
  7502. |Global.Cas:
  7503. needsTrace := p0.NeedsTrace();
  7504. IF needsTrace THEN ModifyAssignments(true) END;
  7505. Designate(p0,s0);
  7506. Evaluate(p1,s1);
  7507. Evaluate(p2,s2);
  7508. IF needsTrace THEN
  7509. Emit(Push(position, s0.op));
  7510. Emit(Push(position, s1.op));
  7511. Emit(Push(position, s2.op));
  7512. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7513. ELSE
  7514. Emit(Cas(position,s0.op,s1.op,s2.op));
  7515. END;
  7516. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7517. IF needsTrace THEN ModifyAssignments(false) END;
  7518. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7519. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7520. IF conditional THEN
  7521. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7522. BrL(falseLabel);
  7523. ReleaseIntermediateOperand(res);
  7524. END;
  7525. (* ---- DIM ----- *)
  7526. |Global.Dim:
  7527. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7528. Designate(p0,s0);
  7529. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7530. Dereference(s0,p0.type.resolved,FALSE);
  7531. END;
  7532. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7533. ReleaseOperand(s0);
  7534. (* ---- RESHAPE ----- *)
  7535. |Global.Reshape:
  7536. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7537. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7538. left.SetType(procedure.type);
  7539. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7540. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7541. END;
  7542. (* ---- SYSTEM.TYPECODE ----- *)
  7543. |Global.systemTypeCode:
  7544. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7545. IF type.resolved IS SyntaxTree.PointerType THEN
  7546. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7547. END;
  7548. result.op := TypeDescriptorAdr(type);
  7549. IF ~newObjectFile THEN
  7550. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7551. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7552. END;
  7553. result.mode := ModeValue;
  7554. (* ---- SYSTEM.TRACE ----- *)
  7555. |Global.systemTrace:
  7556. SystemTrace(x.parameters, x.position);
  7557. (* ----- CONNECT ------*)
  7558. |Global.Connect:
  7559. IF backend.cellsAreObjects THEN
  7560. PushPort(p0);
  7561. PushPort(p1);
  7562. IF p2 # NIL THEN
  7563. Evaluate(p2, s2);
  7564. Emit(Push(p2.position, s2.op));
  7565. ReleaseOperand(s2);
  7566. ELSE
  7567. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7568. END;
  7569. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7570. ELSE
  7571. Warning(x.position, "cannot run on final hardware");
  7572. END;
  7573. (* ----- DELEGATE ------*)
  7574. |Global.Delegate:
  7575. IF backend.cellsAreObjects THEN
  7576. PushPort(p0);
  7577. PushPort(p1);
  7578. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7579. ELSE
  7580. Warning(x.position, "cannot run on final hardware");
  7581. END;
  7582. (* ----- SEND ------*)
  7583. |Global.Send:
  7584. Evaluate(p0,s0);
  7585. Evaluate(p1,s1);
  7586. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7587. Emit(Push(position,s0.op));
  7588. Emit(Push(position,s1.op));
  7589. (*
  7590. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7591. *)
  7592. IF ~backend.cellsAreObjects THEN
  7593. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7594. END;
  7595. ReleaseOperand(s0);
  7596. ReleaseOperand(s1);
  7597. IF backend.cellsAreObjects THEN
  7598. CallThis(position,"ActiveCellsRuntime","Send",2);
  7599. ELSE
  7600. CallThis(position,ChannelModuleName,"Send",2);
  7601. END;
  7602. (* ----- RECEIVE ------*)
  7603. |Global.Receive:
  7604. Evaluate(p0,s0);
  7605. Emit(Push(position,s0.op));
  7606. Designate(p1,s1);
  7607. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7608. Emit(Push(position,s1.op));
  7609. IF p2 # NIL THEN
  7610. Designate(p2,s2);
  7611. Emit(Push(position,s2.op));
  7612. END;
  7613. (*
  7614. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7615. *)
  7616. IF ~backend.cellsAreObjects THEN
  7617. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7618. END;
  7619. ReleaseOperand(s0);
  7620. ReleaseOperand(s1);
  7621. ReleaseOperand(s2);
  7622. IF backend.cellsAreObjects THEN
  7623. IF p2 = NIL THEN
  7624. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7625. ELSE
  7626. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7627. END;
  7628. ELSE
  7629. IF p2 = NIL THEN
  7630. CallThis(position,ChannelModuleName,"Receive",2)
  7631. ELSE
  7632. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7633. END;
  7634. END;
  7635. | Global.systemSpecial:
  7636. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7637. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7638. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7639. (* determine if parameters are of the VAR kind *)
  7640. ASSERT(x.parameters.Length() <= 3);
  7641. formalParameter := procedureType.firstParameter;
  7642. FOR i := 0 TO x.parameters.Length() - 1 DO
  7643. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7644. formalParameter := formalParameter.nextParameter
  7645. END;
  7646. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7647. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7648. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7649. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7650. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7651. IF procedureType.returnType # NIL THEN
  7652. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7653. Emit(Result(position, res));
  7654. (*InitOperand(result,ModeValue);
  7655. result.op := res;
  7656. *)
  7657. IF ~conditional THEN
  7658. InitOperand(result,ModeValue); result.op := res;
  7659. ELSE
  7660. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7661. BrL(falseLabel);
  7662. ReleaseIntermediateOperand(res);
  7663. END;
  7664. END
  7665. ELSE (* function not yet implemented *)
  7666. Error(position,"not yet implemented");
  7667. END;
  7668. destination := dest;
  7669. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7670. END VisitBuiltinCallDesignator;
  7671. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7672. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7673. BEGIN
  7674. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7675. dest := destination; destination := emptyOperand;
  7676. Expression(x.left);
  7677. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7678. ELSIF isUnchecked THEN (* no check *)
  7679. ELSE
  7680. trueL := NewLabel();
  7681. falseL := NewLabel();
  7682. IF IsPointerToRecord(x.left.type,recordType) THEN
  7683. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7684. Emit(Mov(position,tag, result.op));
  7685. IF result.mode # ModeValue THEN
  7686. ptr := tag;
  7687. IntermediateCode.MakeMemory(ptr,addressType);
  7688. Emit(Mov(position,tag, ptr));
  7689. END;
  7690. IF ~backend.cooperative THEN
  7691. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7692. END;
  7693. IntermediateCode.MakeMemory(tag,addressType);
  7694. ELSE
  7695. tag := result.tag;
  7696. END;
  7697. TypeTest(tag,x.type,trueL,falseL);
  7698. ReleaseIntermediateOperand(tag);
  7699. SetLabel(falseL);
  7700. EmitTrap(position,TypeCheckTrap);
  7701. SetLabel(trueL);
  7702. END;
  7703. destination := dest;
  7704. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7705. END VisitTypeGuardDesignator;
  7706. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7707. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7708. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7709. VAR label: Label; pc: LONGINT;
  7710. BEGIN
  7711. IF backend.cooperative & ~isUnchecked THEN
  7712. pc := section.pc;
  7713. label := NewLabel();
  7714. BrneL(label, operand.op, nil);
  7715. EmitTrap(position, NilPointerTrap);
  7716. SetLabel(label);
  7717. INC(statCoopNilCheck, section.pc - pc);
  7718. END;
  7719. END NilCheck;
  7720. BEGIN
  7721. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7722. ReuseCopy(dereferenced,operand.op);
  7723. ReleaseOperand(operand);
  7724. operand.mode := ModeReference;
  7725. operand.op := dereferenced;
  7726. operand.tag := dereferenced;
  7727. UseIntermediateOperand(operand.tag);
  7728. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7729. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7730. ReleaseIntermediateOperand(operand.tag);
  7731. operand.tag := TypeDescriptorAdr(type);
  7732. IF ~newObjectFile THEN
  7733. IntermediateCode.MakeMemory(operand.tag,addressType);
  7734. END;
  7735. ELSE
  7736. IF ~backend.cooperative THEN
  7737. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7738. END;
  7739. IntermediateCode.MakeMemory(operand.tag,addressType);
  7740. END;
  7741. NilCheck(operand.op);
  7742. ELSIF type IS SyntaxTree.ArrayType THEN
  7743. IF isUnsafe THEN
  7744. NilCheck(operand.op);
  7745. ReleaseIntermediateOperand(operand.tag);
  7746. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7747. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7748. ELSE
  7749. operand.tag := emptyOperand;
  7750. END;
  7751. ELSE
  7752. NilCheck(operand.op);
  7753. IF backend.cooperative THEN
  7754. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7755. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7756. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7757. ELSE
  7758. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7759. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7760. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7761. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7762. END;
  7763. END;
  7764. ELSIF type IS SyntaxTree.MathArrayType THEN
  7765. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7766. IntermediateCode.MakeMemory(operand.op,addressType);
  7767. ELSE HALT(100);
  7768. END;
  7769. END Dereference;
  7770. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7771. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7772. BEGIN
  7773. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7774. dest := destination; destination := emptyOperand;
  7775. Evaluate(x.left,d);
  7776. type := x.type.resolved;
  7777. prevIsUnchecked := isUnchecked;
  7778. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7779. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7780. END;
  7781. Dereference(d,type,IsUnsafePointer(x.left.type));
  7782. isUnchecked := prevIsUnchecked;
  7783. result := d;
  7784. IF backend.cooperative & (x.left.type.resolved IS SyntaxTree.PointerType) & ~x.left.type.resolved(SyntaxTree.PointerType).isPlain & ~x.left.type.resolved(SyntaxTree.PointerType).isUnsafe THEN
  7785. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7786. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7787. END;
  7788. END;
  7789. destination := dest;
  7790. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7791. END VisitDereferenceDesignator;
  7792. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7793. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7794. BEGIN
  7795. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7796. dest := destination; destination := emptyOperand;
  7797. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7798. tag := result.op;
  7799. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7800. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7801. StaticCallOperand(result,procedure.super);
  7802. ReleaseIntermediateOperand(result.tag);
  7803. UseIntermediateOperand(tag); (* necessary ? *)
  7804. result.tag := tag;
  7805. destination := dest;
  7806. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7807. END VisitSupercallDesignator;
  7808. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7809. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7810. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7811. name: Basic.SegmentedName;
  7812. BEGIN
  7813. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7814. dest := destination; destination := emptyOperand;
  7815. scope := currentScope;
  7816. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7817. scope := scope.outerScope;
  7818. END;
  7819. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7820. IF newObjectFile THEN
  7821. moduleSection := meta.ModuleSection();
  7822. IF backend.cooperative THEN
  7823. moduleOffset := 0;
  7824. ELSE
  7825. moduleOffset := moduleSection.pc;
  7826. END;
  7827. result.mode := ModeValue;
  7828. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7829. ELSE
  7830. Symbol(moduleSelf,result);
  7831. IntermediateCode.MakeMemory(result.op,addressType);
  7832. END
  7833. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7834. result.mode := ModeValue;
  7835. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7836. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7837. ELSE
  7838. GetBaseRegister(basereg,currentScope,scope);
  7839. InitOperand(result,ModeReference);
  7840. result.op := basereg;
  7841. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7842. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7843. IF backend.cooperative THEN
  7844. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7845. END;
  7846. (* tag must be loaded when dereferencing SELF pointer *)
  7847. END;
  7848. destination := dest;
  7849. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  7850. END VisitSelfDesignator;
  7851. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  7852. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  7853. BEGIN
  7854. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  7855. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  7856. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7857. parameter := procedureType.returnParameter;
  7858. VisitParameter(parameter);
  7859. IF Trace THEN TraceExit("VisitResultDesignator") END;
  7860. END VisitResultDesignator;
  7861. (** values *)
  7862. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  7863. BEGIN
  7864. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  7865. IF conditional THEN
  7866. IF x.value THEN BrL(trueLabel)
  7867. ELSE BrL(falseLabel)
  7868. END;
  7869. ELSE
  7870. InitOperand(result,ModeValue);
  7871. IF x.value THEN result.op := true ELSE result.op := false END;
  7872. END;
  7873. END VisitBooleanValue;
  7874. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  7875. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  7876. BEGIN
  7877. Global.GetModuleSegmentedName(module.module, name);
  7878. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  7879. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  7880. RETURN section
  7881. END GetDataSection;
  7882. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  7883. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  7884. BEGIN
  7885. type := vop.type;
  7886. data := GetDataSection();
  7887. pc := EnterImmediate(data,vop);
  7888. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  7889. IntermediateCode.MakeMemory(vop, type);
  7890. END GetImmediateMem;
  7891. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  7892. BEGIN
  7893. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  7894. InitOperand(result,ModeValue);
  7895. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  7896. IF ~supportedImmediate(result.op) &~inData THEN
  7897. GetImmediateMem(result.op)
  7898. END;
  7899. END VisitIntegerValue;
  7900. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  7901. BEGIN
  7902. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  7903. InitOperand(result,ModeValue);
  7904. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  7905. END VisitCharacterValue;
  7906. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  7907. BEGIN
  7908. IF Trace THEN TraceEnter("VisitSetValue") END;
  7909. InitOperand(result,ModeValue);
  7910. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  7911. END VisitSetValue;
  7912. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  7913. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  7914. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  7915. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  7916. BEGIN
  7917. numberElements := x.elements.Length();
  7918. FOR i := 0 TO numberElements-1 DO
  7919. expression := x.elements.GetExpression(i);
  7920. IF expression IS SyntaxTree.MathArrayExpression THEN
  7921. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  7922. ELSE
  7923. inData := TRUE;
  7924. Evaluate(expression,op);
  7925. irv.Emit(Data(position,op.op));
  7926. inData := FALSE;
  7927. ReleaseOperand(op);
  7928. END;
  7929. END;
  7930. END RecursiveData;
  7931. BEGIN
  7932. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  7933. IF ~TryConstantDeclaration() THEN
  7934. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  7935. GetCodeSectionNameForSymbol(constantDeclaration,name);
  7936. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  7937. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  7938. ELSE
  7939. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7940. END;
  7941. RecursiveData(x.array);
  7942. InitOperand(result,ModeReference);
  7943. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  7944. END
  7945. END VisitMathArrayValue;
  7946. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  7947. VAR constant: Sections.Section;
  7948. BEGIN
  7949. IF constantDeclaration = NIL THEN
  7950. RETURN FALSE
  7951. ELSE
  7952. (* Is a constant in this module: did we generate it already? *)
  7953. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  7954. IF constant # NIL THEN
  7955. InitOperand(result,ModeReference);
  7956. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  7957. RETURN TRUE;
  7958. END;
  7959. END;
  7960. RETURN FALSE
  7961. END TryConstantDeclaration;
  7962. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  7963. BEGIN
  7964. constantDeclaration := x;
  7965. x.value.resolved.Accept(SELF);
  7966. END VisitConstant;
  7967. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  7968. BEGIN
  7969. IF Trace THEN TraceEnter("VisitRealValue") END;
  7970. InitOperand(result,ModeValue);
  7971. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  7972. END VisitRealValue;
  7973. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  7974. VAR
  7975. componentType: SyntaxTree.Type;
  7976. BEGIN
  7977. IF Trace THEN TraceEnter("VisitComplexValue") END;
  7978. ASSERT(x.type IS SyntaxTree.ComplexType);
  7979. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7980. InitOperand(result,ModeValue);
  7981. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  7982. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  7983. END VisitComplexValue;
  7984. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  7985. VAR i: LONGINT; name: Basic.SegmentedName;
  7986. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  7987. BEGIN
  7988. IF Trace THEN TraceEnter("VisitStringValue") END;
  7989. IF ~TryConstantDeclaration() THEN
  7990. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  7991. GetCodeSectionNameForSymbol(constantDeclaration,name);
  7992. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  7993. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7994. ELSE
  7995. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7996. END;
  7997. FOR i := 0 TO x.length-1 DO
  7998. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  7999. irv.Emit(Data(position,op));
  8000. END;
  8001. InitOperand(result,ModeReference);
  8002. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8003. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8004. END
  8005. END VisitStringValue;
  8006. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8007. BEGIN
  8008. IF Trace THEN TraceEnter("VisitNilValue") END;
  8009. InitOperand(result,ModeValue);
  8010. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8011. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8012. END VisitNilValue;
  8013. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8014. BEGIN
  8015. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8016. InitOperand(result,ModeValue);
  8017. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8018. END VisitEnumerationValue;
  8019. (** symbols *)
  8020. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8021. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8022. END VisitImport;
  8023. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8024. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8025. BEGIN
  8026. IF scope # baseScope THEN
  8027. (* left := [fp+8] *)
  8028. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8029. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8030. ReuseCopy(left,right);
  8031. ReleaseIntermediateOperand(right);
  8032. scope := scope.outerScope; DEC(level);
  8033. (* { left := [left+8] } *)
  8034. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8035. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8036. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8037. Emit(Mov(position,left,right));
  8038. scope := scope.outerScope; DEC(level);
  8039. END;
  8040. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8041. result := left;
  8042. ELSE
  8043. result := fp;
  8044. END;
  8045. END GetBaseRegister;
  8046. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8047. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8048. BEGIN
  8049. IF Trace THEN TraceEnter("VisitVariable"); END;
  8050. type := x.type.resolved;
  8051. IF (x.useRegister) THEN
  8052. InitOperand(result, ModeValue);
  8053. IF x.registerNumber < 0 THEN
  8054. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8055. reg := x.registerNumber;
  8056. ELSE
  8057. reg := registerUsageCount.Map(x.registerNumber);
  8058. UseRegister(reg);
  8059. END;
  8060. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8061. ELSIF x.externalName # NIL THEN
  8062. InitOperand(result,ModeReference);
  8063. Basic.ToSegmentedName(x.externalName^, name);
  8064. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8065. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8066. InitOperand(result,ModeReference);
  8067. GetBaseRegister(result.op,currentScope,x.scope);
  8068. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8069. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8070. InitOperand(result,ModeReference);
  8071. GetCodeSectionNameForSymbol(x,name);
  8072. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8073. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8074. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8075. InitOperand(result,ModeReference);
  8076. GetCodeSectionNameForSymbol(x,name);
  8077. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8078. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8079. ELSE (* field, left designator must have been emitted *)
  8080. ASSERT(result.mode = ModeReference);
  8081. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8082. ReuseCopy(temp,result.op);
  8083. ReleaseIntermediateOperand(result.op);
  8084. result.op := temp;
  8085. END;
  8086. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8087. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8088. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8089. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8090. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8091. END;
  8092. END;
  8093. END;
  8094. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8095. ValueToCondition(result);
  8096. ELSIF type IS SyntaxTree.ProcedureType THEN
  8097. ReleaseIntermediateOperand(result.tag);
  8098. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8099. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8100. UseIntermediateOperand(result.tag);
  8101. ELSE
  8102. result.tag := nil; (* nil *)
  8103. END;
  8104. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8105. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8106. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8107. ReleaseIntermediateOperand(result.tag);
  8108. Global.GetSymbolSegmentedName(x,name);
  8109. Basic.AppendToSegmentedName(name,"@len");
  8110. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8111. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8112. ELSE
  8113. END;
  8114. ELSE
  8115. ReleaseIntermediateOperand(result.tag);
  8116. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8117. END;
  8118. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8119. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8120. ReleaseIntermediateOperand(result.tag);
  8121. result.tag := result.op;
  8122. UseIntermediateOperand(result.tag);
  8123. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8124. IntermediateCode.MakeMemory(result.op,addressType);
  8125. END;
  8126. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8127. ReleaseIntermediateOperand(result.tag);
  8128. result.tag := TypeDescriptorAdr(type);
  8129. IF ~newObjectFile THEN
  8130. IntermediateCode.MakeMemory(result.tag,addressType);
  8131. END;
  8132. UseIntermediateOperand(result.tag);
  8133. (* tag for pointer type computed not here but during dereferencing *)
  8134. END;
  8135. IF Trace THEN TraceExit("VisitVariable") END;
  8136. END VisitVariable;
  8137. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8138. BEGIN
  8139. VisitVariable(property);
  8140. END VisitProperty;
  8141. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8142. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8143. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8144. BEGIN
  8145. type := x.type.resolved;
  8146. IF Trace THEN TraceEnter("VisitParameter") END;
  8147. IF x.ownerType IS SyntaxTree.CellType THEN
  8148. ptype := x.type.resolved;
  8149. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8150. IF ~(ptype IS SyntaxTree.PortType) THEN
  8151. InitOperand(result,ModeReference);
  8152. GetCodeSectionNameForSymbol(x,name);
  8153. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8154. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8155. RETURN
  8156. ELSE
  8157. InitOperand(result, ModeValue);
  8158. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8159. adr := 0;
  8160. WHILE parameter # x DO
  8161. parameterType := parameter.type;
  8162. inc := 1;
  8163. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8164. INC(adr, inc);
  8165. parameter := parameter.nextParameter
  8166. END;
  8167. adr := backend.activeCellsSpecification.GetPortAddress(adr);
  8168. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8169. RETURN
  8170. END;
  8171. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8172. InitOperand(result,ModeReference);
  8173. GetCodeSectionNameForSymbol(x,name);
  8174. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8175. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8176. RETURN
  8177. ELSE
  8178. GetBaseRegister(basereg,currentScope,x.scope);
  8179. InitOperand(result,ModeReference);
  8180. result.op := basereg;
  8181. END;
  8182. IF IsOpenArray(type) THEN
  8183. result.tag := basereg;
  8184. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8185. IntermediateCode.MakeMemory(result.op,addressType);
  8186. IF Global.IsOberonProcedure(x.ownerType) THEN
  8187. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8188. UseIntermediateOperand(result.tag);
  8189. ELSE
  8190. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8191. END;
  8192. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8193. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8194. ELSIF IsStaticArray(type) THEN
  8195. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8196. IntermediateCode.MakeMemory(result.op,addressType);
  8197. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8198. ELSIF type IS SyntaxTree.MathArrayType THEN
  8199. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8200. WITH type: SyntaxTree.MathArrayType DO
  8201. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8202. IF type.form = SyntaxTree.Tensor THEN
  8203. ELSIF type.form = SyntaxTree.Open THEN
  8204. result.tag := result.op;
  8205. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8206. IntermediateCode.MakeMemory(result.op,addressType);
  8207. UseIntermediateOperand(result.tag);
  8208. ELSIF type.form = SyntaxTree.Static THEN
  8209. IF x.kind = SyntaxTree.ConstParameter THEN
  8210. IntermediateCode.MakeMemory(result.op,addressType);
  8211. END;
  8212. ELSE HALT(100)
  8213. END;
  8214. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8215. IF type.form = SyntaxTree.Tensor THEN
  8216. ToMemory(result.op,addressType,0);
  8217. ELSIF type.form = SyntaxTree.Open THEN
  8218. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8219. ReuseCopy(result.tag, mem);
  8220. ReleaseIntermediateOperand(mem);
  8221. ReleaseIntermediateOperand(result.op);
  8222. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8223. ELSIF type.form = SyntaxTree.Static THEN
  8224. IntermediateCode.MakeMemory(result.op,addressType);
  8225. ELSE HALT(100)
  8226. END;
  8227. ELSE HALT(100)
  8228. END;
  8229. END;
  8230. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8231. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8232. IntermediateCode.MakeMemory(result.op,addressType);
  8233. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8234. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8235. END;
  8236. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8237. ValueToCondition(result);
  8238. ELSIF type IS SyntaxTree.ProcedureType THEN
  8239. ReleaseIntermediateOperand(result.tag);
  8240. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8241. IF x.kind = SyntaxTree.VarParameter THEN
  8242. ReuseCopy(result.tag,result.op);
  8243. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8244. IntermediateCode.MakeMemory(result.tag,addressType);
  8245. ELSE
  8246. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8247. UseIntermediateOperand(result.tag);
  8248. END;
  8249. ELSE
  8250. result.tag := nil;
  8251. END;
  8252. (* tag for pointer type computed not here but during dereferencing *)
  8253. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8254. ReleaseIntermediateOperand(result.tag);
  8255. result.tag := basereg;
  8256. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8257. IntermediateCode.MakeMemory(result.tag,addressType);
  8258. UseIntermediateOperand(result.tag);
  8259. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8260. ReleaseIntermediateOperand(result.tag);
  8261. result.tag := TypeDescriptorAdr(type);
  8262. IF ~newObjectFile THEN
  8263. IntermediateCode.MakeMemory(result.tag,addressType);
  8264. END;
  8265. UseIntermediateOperand(result.tag);
  8266. END;
  8267. IF Trace THEN TraceExit("VisitParameter") END;
  8268. END VisitParameter;
  8269. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8270. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8271. BEGIN
  8272. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8273. (* left.p: left already emitted *)
  8274. tag := result.op; (* value of pointer to left *)
  8275. (* get type desc *)
  8276. tmp := result.tag;
  8277. IntermediateCode.MakeMemory(tmp,addressType);
  8278. (* get method adr *)
  8279. Reuse1(reg,tmp);
  8280. ReleaseIntermediateOperand(tmp);
  8281. IF backend.cooperative THEN
  8282. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8283. WHILE recordType.baseType # NIL DO
  8284. recordType := recordType.GetBaseRecord ();
  8285. END;
  8286. GetRecordTypeName (recordType,name);
  8287. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8288. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8289. offset := 0;
  8290. ELSE
  8291. offset := 2;
  8292. END;
  8293. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8294. ELSE
  8295. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8296. END;
  8297. InitOperand(operand,ModeReference);
  8298. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8299. operand.op := reg;
  8300. operand.tag := tag;
  8301. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8302. END DynamicCallOperand;
  8303. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8304. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8305. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8306. BEGIN
  8307. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8308. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8309. tag := operand.op;
  8310. ReleaseIntermediateOperand(operand.tag);
  8311. ELSE tag := nil
  8312. END;
  8313. IF x.isInline THEN
  8314. sectionType := Sections.InlineCodeSection;
  8315. ELSE
  8316. sectionType := Sections.CodeSection;
  8317. END;
  8318. IF x.externalName # NIL THEN
  8319. Basic.ToSegmentedName(x.externalName^, name);
  8320. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8321. ELSE
  8322. GetCodeSectionNameForSymbol(x, name);
  8323. IF (x.scope.ownerModule = module.module) THEN
  8324. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8325. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8326. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8327. IF source.pc = 0 THEN (* no code yet *)
  8328. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8329. END;
  8330. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8331. bits := x.procedureScope.body.code.inlineCode;
  8332. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8333. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8334. binary.CopyBits(bits, 0, bits.GetSize());
  8335. source.SetResolved(binary);
  8336. ELSE
  8337. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8338. END;
  8339. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8340. END;
  8341. InitOperand(operand,ModeValue);
  8342. operand.op := reg;
  8343. operand.tag := tag;
  8344. IF Trace THEN TraceExit("StaticCallOperand") END;
  8345. END StaticCallOperand;
  8346. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8347. (* handle expressions of the form designator.procedure or procedure *)
  8348. BEGIN
  8349. IF Trace THEN TraceEnter("VisitProcedure") END;
  8350. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8351. DynamicCallOperand(result,x);
  8352. ELSIF x.isInline THEN
  8353. StaticCallOperand(result,x);
  8354. ELSE
  8355. StaticCallOperand(result,x);
  8356. END;
  8357. IF Trace THEN TraceExit("VisitProcedure") END;
  8358. END VisitProcedure;
  8359. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8360. BEGIN
  8361. VisitProcedure(x);
  8362. END VisitOperator;
  8363. (** statements *)
  8364. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8365. BEGIN
  8366. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8367. Expression(x.call);
  8368. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8369. ReleaseOperand(result)
  8370. END;
  8371. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8372. END VisitProcedureCallStatement;
  8373. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8374. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8375. leftBase, rightBase: SyntaxTree.Type;
  8376. procedureName,s: SyntaxTree.IdentifierString;
  8377. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8378. size: LONGINT; rightKind: LONGINT;
  8379. dummy: IntermediateCode.Operand;
  8380. CONST moduleName = "FoxArrayBase";
  8381. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8382. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8383. BEGIN
  8384. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8385. IF base IS SyntaxTree.MathArrayType THEN
  8386. base := OpenArray(base(SyntaxTree.MathArrayType));
  8387. END;
  8388. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8389. result.SetArrayBase(base);
  8390. RETURN result
  8391. END OpenArray;
  8392. BEGIN
  8393. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8394. SaveRegisters();ReleaseUsedRegisters(saved);
  8395. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8396. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8397. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8398. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8399. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8400. IF leftType.form = SyntaxTree.Tensor THEN
  8401. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8402. ELSIF leftType.form = SyntaxTree.Open THEN
  8403. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8404. ELSIF leftType.form = SyntaxTree.Static THEN
  8405. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8406. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8407. END;
  8408. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8409. IF procedure = NIL THEN
  8410. s := "Instruction not supported on target, emulation procedure ";
  8411. Strings.Append(s,moduleName);
  8412. Strings.Append(s,".");
  8413. Strings.Append(s,procedureName);
  8414. Strings.Append(s," not present");
  8415. Error(position,s);
  8416. ELSE
  8417. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8418. parameter.SetType(leftType);
  8419. parameter.SetAccess(SyntaxTree.Internal);
  8420. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8421. parameter.SetKind(rightKind);
  8422. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8423. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8424. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8425. StaticCallOperand(result,procedure);
  8426. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8427. ReleaseOperand(result);
  8428. END;
  8429. RestoreRegisters(saved);
  8430. END;
  8431. END AssignMathArray;
  8432. VAR modifyAssignmentCounter := 0: LONGINT;
  8433. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8434. VAR processor,mem,dst: IntermediateCode.Operand;
  8435. BEGIN
  8436. IF value.intValue = true.intValue THEN
  8437. INC(modifyAssignmentCounter);
  8438. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8439. modifyAssignmentsPC := section.pc;
  8440. ELSE
  8441. DEC(modifyAssignmentCounter);
  8442. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8443. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8444. END;
  8445. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8446. dst := NewRegisterOperand (addressType);
  8447. Emit(Mov(position,dst, processor));
  8448. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8449. Emit(Mov(position,mem, value));
  8450. ReleaseIntermediateOperand(dst);
  8451. END ModifyAssignments;
  8452. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8453. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8454. BEGIN
  8455. type := left.type.resolved;
  8456. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8457. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8458. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8459. IF procedureType.returnParameter = parameter THEN
  8460. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8461. END;
  8462. END;
  8463. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8464. END CopySize;
  8465. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8466. VAR
  8467. leftO, rightO: Operand;
  8468. mem, sizeOp: IntermediateCode.Operand;
  8469. leftType, rightType, componentType: SyntaxTree.Type;
  8470. size: LONGINT;
  8471. parameters: SyntaxTree.ExpressionList;
  8472. procedure: SyntaxTree.Procedure;
  8473. call: SyntaxTree.ProcedureCallDesignator;
  8474. designator: SyntaxTree.Designator;
  8475. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8476. VAR procedureType: SyntaxTree.ProcedureType;
  8477. BEGIN
  8478. IF ReturnedAsParameter(right.type) THEN
  8479. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8480. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8481. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8482. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8483. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8484. IF right.id = Global.Reshape THEN RETURN TRUE
  8485. END;
  8486. END;
  8487. END;
  8488. END;
  8489. RETURN FALSE
  8490. END CanPassAsResultParameter;
  8491. BEGIN
  8492. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8493. leftType := left.type.resolved; rightType:= right.type.resolved;
  8494. IF backend.cooperative & left.NeedsTrace() THEN
  8495. ModifyAssignments(true);
  8496. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8497. Designate(right, rightO);
  8498. Designate(left, leftO);
  8499. ASSERT(leftO.mode = ModeReference);
  8500. TransferToRegister(leftO.op, leftO.op);
  8501. TransferToRegister(rightO.op, rightO.op);
  8502. Emit(Push(position, leftO.op));
  8503. Emit(Push(position, rightO.op));
  8504. CallAssignMethod(leftO.op, rightO.op, left.type);
  8505. Emit(Pop(position, rightO.op));
  8506. Emit(Pop(position, leftO.op));
  8507. sizeOp := CopySize(left);
  8508. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8509. ReleaseOperand(leftO);
  8510. ReleaseOperand(rightO);
  8511. ELSE
  8512. Evaluate(right,rightO);
  8513. Designate(left,leftO);
  8514. ASSERT(leftO.mode = ModeReference);
  8515. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8516. (* copy procedure address first *)
  8517. MakeMemory(mem,leftO.op,addressType,0);
  8518. Emit(Mov(position,mem,rightO.op));
  8519. ReleaseIntermediateOperand(mem);
  8520. (* copy pointer address *)
  8521. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8522. CallAssignPointer(leftO.tag, rightO.tag);
  8523. ELSE
  8524. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8525. CallAssignPointer(leftO.op, rightO.op);
  8526. END;
  8527. ReleaseOperand(leftO);
  8528. ReleaseOperand(rightO);
  8529. END;
  8530. ModifyAssignments(false);
  8531. RETURN;
  8532. END;
  8533. IF CanPassAsResultParameter(right) THEN
  8534. procedureResultDesignator := left(SyntaxTree.Designator);
  8535. Expression(right);
  8536. procedureResultDesignator := NIL;
  8537. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8538. (* left <-- ALIAS OF right: zerocopy *)
  8539. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8540. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8541. designator.SetType(procedure.type);
  8542. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8543. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8544. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8545. END;
  8546. ELSIF leftType IS SyntaxTree.RangeType THEN
  8547. (* LHS is of array range type *)
  8548. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8549. Evaluate(right, rightO);
  8550. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8551. (* first *)
  8552. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8553. Emit(Mov(position,mem, rightO.op));
  8554. ReleaseIntermediateOperand(mem);
  8555. (* last *)
  8556. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8557. Emit(Mov(position,mem, rightO.tag));
  8558. ReleaseIntermediateOperand(mem);
  8559. (* step *)
  8560. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8561. Emit(Mov(position,mem, rightO.extra));
  8562. ReleaseIntermediateOperand(mem);
  8563. ReleaseOperand(rightO);
  8564. ReleaseOperand(leftO)
  8565. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8566. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8567. Evaluate(right, rightO);
  8568. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8569. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8570. (* real part *)
  8571. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8572. Emit(Mov(position,mem, rightO.op));
  8573. ReleaseIntermediateOperand(mem);
  8574. (* imaginary part *)
  8575. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8576. Emit(Mov(position,mem, rightO.tag));
  8577. ReleaseIntermediateOperand(mem);
  8578. ReleaseOperand(rightO);
  8579. ReleaseOperand(leftO)
  8580. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8581. OR (leftType IS SyntaxTree.PortType) THEN
  8582. (* rightO := leftO;*)
  8583. Evaluate(right,rightO);
  8584. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8585. Designate(left,leftO);
  8586. IF leftO.mode = ModeReference THEN
  8587. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8588. destination := mem;
  8589. ELSE
  8590. destination := leftO.op;
  8591. END;
  8592. ReleaseOperand(leftO);
  8593. IF destination.mode # IntermediateCode.Undefined THEN
  8594. Emit(Mov(position,destination,rightO.op));
  8595. END;
  8596. ReleaseOperand(rightO);
  8597. ReleaseIntermediateOperand(mem);
  8598. IntermediateCode.InitOperand(destination);
  8599. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8600. Evaluate(right,rightO);
  8601. Designate(left,leftO);
  8602. MakeMemory(mem,leftO.op,addressType,0);
  8603. Emit(Mov(position,mem,rightO.op));
  8604. ReleaseIntermediateOperand(mem);
  8605. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8606. (* delegate *)
  8607. (*
  8608. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8609. *)
  8610. Emit(Mov(position,leftO.tag,rightO.tag));
  8611. END;
  8612. ReleaseOperand(leftO);
  8613. ReleaseOperand(rightO);
  8614. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8615. Designate(right,rightO);
  8616. Designate(left,leftO);
  8617. sizeOp := CopySize(left);
  8618. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8619. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8620. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8621. IF (rightType IS SyntaxTree.StringType) THEN
  8622. CopyString(left,right);
  8623. ELSIF ((rightType IS SyntaxTree.ArrayType) & (rightType(SyntaxTree.ArrayType).staticLength # 0) OR (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0)) & (leftType(SyntaxTree.ArrayType).staticLength # 0) THEN
  8624. Designate(right,rightO);
  8625. Designate(left,leftO);
  8626. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8627. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8628. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8629. ELSE
  8630. HALT(201)
  8631. END;
  8632. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8633. AssignMathArray(left,right);
  8634. ELSE
  8635. HALT(200);
  8636. END;
  8637. END Assign;
  8638. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8639. BEGIN
  8640. IF Trace THEN TraceEnter("VisitAssignment") END;
  8641. Assign(x.left,x.right);
  8642. IF Trace THEN TraceExit("VisitAssignment") END;
  8643. END VisitAssignment;
  8644. PROCEDURE EmitCooperativeSwitch;
  8645. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8646. BEGIN
  8647. ASSERT (cooperativeSwitches);
  8648. pc := section.pc;
  8649. IF lastSwitchPC = section.pc THEN RETURN END;
  8650. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8651. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8652. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8653. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8654. INC(statCoopSwitch, section.pc - pc);
  8655. END EmitCooperativeSwitch;
  8656. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8657. VAR p0,p1: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8658. BEGIN
  8659. p0 := communication.left; p1 := communication.right;
  8660. IF communication.send THEN
  8661. Evaluate(p0,s0);
  8662. Evaluate(p1,s1);
  8663. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8664. Emit(Push(position,s0.op));
  8665. Emit(Push(position,s1.op));
  8666. (*
  8667. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8668. *)
  8669. IF ~backend.cellsAreObjects THEN
  8670. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8671. END;
  8672. ReleaseOperand(s0);
  8673. ReleaseOperand(s1);
  8674. IF backend.cellsAreObjects THEN
  8675. CallThis(position,"ActiveCellsRuntime","Send",2);
  8676. ELSE
  8677. CallThis(position,ChannelModuleName,"Send",2);
  8678. END;
  8679. (* ----- RECEIVE ------*)
  8680. ELSE
  8681. Evaluate(p0,s0);
  8682. Emit(Push(position,s0.op));
  8683. Designate(p1,s1);
  8684. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8685. Emit(Push(position,s1.op));
  8686. (*
  8687. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8688. *)
  8689. IF ~backend.cellsAreObjects THEN
  8690. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8691. END;
  8692. ReleaseOperand(s0);
  8693. ReleaseOperand(s1);
  8694. IF backend.cellsAreObjects THEN
  8695. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8696. ELSE
  8697. CallThis(position,ChannelModuleName,"Receive",2)
  8698. END;
  8699. END;
  8700. END VisitCommunicationStatement;
  8701. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8702. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8703. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8704. VAR true, false: Label; condition, value: BOOLEAN;
  8705. BEGIN
  8706. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8707. IF condition THEN
  8708. true := NewLabel();
  8709. false := NewLabel();
  8710. Condition(if.condition,true,false);
  8711. SetLabel(true);
  8712. StatementSequence(if.statements);
  8713. BrL(end);
  8714. SetLabel(false);
  8715. ELSE
  8716. IF value THEN (* always true *)
  8717. escape := TRUE;
  8718. StatementSequence(if.statements);
  8719. (* no branch necessary -- rest skipped *)
  8720. END;
  8721. END;
  8722. END IfPart;
  8723. BEGIN
  8724. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8725. end := NewLabel();
  8726. elsifs := x.ElsifParts();
  8727. IfPart(x.ifPart);
  8728. FOR i := 0 TO elsifs-1 DO
  8729. IF ~escape THEN
  8730. elsif := x.GetElsifPart(i);
  8731. IfPart(elsif);
  8732. END;
  8733. END;
  8734. IF (x.elsePart # NIL) & ~escape THEN
  8735. StatementSequence(x.elsePart);
  8736. END;
  8737. SetLabel(end);
  8738. IF Trace THEN TraceExit("VisitIfStatement") END;
  8739. END VisitIfStatement;
  8740. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8741. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8742. BEGIN
  8743. (*IF x.variable.type.resolved = x.type.resolved THEN
  8744. (* always true, do nothing *)
  8745. ELSE*)
  8746. Designate(x.variable,res);
  8747. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8748. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8749. END;
  8750. trueL := NewLabel();
  8751. TypeTest(res.tag,x.type,trueL,falseL);
  8752. ReleaseOperand(res);
  8753. SetLabel(trueL);
  8754. StatementSequence(x.statements);
  8755. BrL(endL);
  8756. END WithPart;
  8757. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8758. VAR endL,falseL: Label;i: LONGINT;
  8759. BEGIN
  8760. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8761. endL := NewLabel();
  8762. FOR i := 0 TO x.WithParts()-1 DO
  8763. falseL := NewLabel();
  8764. WithPart(x.GetWithPart(i),falseL,endL);
  8765. SetLabel(falseL);
  8766. END;
  8767. IF x.elsePart = NIL THEN
  8768. IF ~isUnchecked THEN
  8769. EmitTrap(position,WithTrap);
  8770. END;
  8771. ELSE
  8772. StatementSequence(x.elsePart)
  8773. END;
  8774. SetLabel(endL);
  8775. IF Trace THEN TraceExit("VisitWithStatement") END;
  8776. END VisitWithStatement;
  8777. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8778. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8779. out,else: Label; label: Label;
  8780. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8781. symbol: SyntaxTree.Symbol;
  8782. BEGIN
  8783. (*! split case statement into if-elsif statements for large case label lists *)
  8784. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8785. size := x.max-x.min+1;
  8786. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8787. END;
  8788. Evaluate(x.variable,var);
  8789. ReuseCopy(tmp,var.op);
  8790. ReleaseIntermediateOperand(var.op);
  8791. var.op := tmp;
  8792. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8793. Convert(var.op,addressType);
  8794. size := x.max-x.min+1;
  8795. else := NewLabel();
  8796. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8797. (*
  8798. UniqueId(name,module.module,"case",caseId);
  8799. *)
  8800. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8801. Global.GetModuleSegmentedName(module.module, name);
  8802. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8803. symbol := SyntaxTree.NewSymbol(name[1]);
  8804. symbol.SetScope(moduleScope);
  8805. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8806. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8807. section.isCaseTable := TRUE;
  8808. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8809. ReuseCopy(res,var.op);
  8810. ReleaseOperand(var);
  8811. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8812. Emit(Add(position,res,res,jmp));
  8813. IntermediateCode.MakeMemory(res,addressType);
  8814. Emit(Br(position,res));
  8815. ReleaseIntermediateOperand(res);
  8816. out := NewLabel();
  8817. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8818. part := x.GetCasePart(i);
  8819. constant := part.firstConstant;
  8820. label := NewLabel();
  8821. SetLabel(label);
  8822. WHILE(constant # NIL) DO (* case labels for this case part *)
  8823. FOR j := constant.min TO constant.max DO
  8824. fixups[j-x.min] := label;
  8825. END;
  8826. constant := constant.next;
  8827. END;
  8828. StatementSequence(part.statements);
  8829. BrL(out);
  8830. END;
  8831. SetLabel(else);
  8832. FOR i := 0 TO size-1 DO
  8833. IF fixups[i] = NIL THEN
  8834. fixups[i] := else;
  8835. END;
  8836. END;
  8837. IF x.elsePart # NIL THEN
  8838. StatementSequence(x.elsePart);
  8839. ELSIF ~isUnchecked THEN
  8840. EmitTrap(position,CaseTrap);
  8841. END;
  8842. SetLabel(out);
  8843. FOR i := 0 TO size-1 DO
  8844. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8845. section.Emit(Data(position,op));
  8846. END;
  8847. IF Trace THEN TraceExit("VisitCaseStatement") END;
  8848. END VisitCaseStatement;
  8849. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  8850. VAR start: Label; true,false: Label;
  8851. BEGIN
  8852. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  8853. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8854. start := NewLabel();
  8855. true := NewLabel();
  8856. false := NewLabel();
  8857. SetLabel(start);
  8858. Condition(x.condition,true,false);
  8859. SetLabel(true);
  8860. StatementSequence(x.statements);
  8861. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8862. BrL(start);
  8863. SetLabel(false);
  8864. IF Trace THEN TraceExit("VisitWhileStatement") END;
  8865. END VisitWhileStatement;
  8866. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  8867. VAR false,true: Label;
  8868. BEGIN
  8869. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  8870. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8871. true := NewLabel();
  8872. false := NewLabel();
  8873. SetLabel(false);
  8874. StatementSequence(x.statements);
  8875. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8876. Condition(x.condition,true,false);
  8877. SetLabel(true);
  8878. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  8879. END VisitRepeatStatement;
  8880. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  8881. VAR
  8882. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  8883. temporaryVariable: SyntaxTree.Variable;
  8884. temporaryVariableDesignator : SyntaxTree.Designator;
  8885. BEGIN
  8886. IF Trace THEN TraceEnter("VisitForStatement") END;
  8887. true := NewLabel();
  8888. false := NewLabel();
  8889. start := NewLabel();
  8890. Assign(x.variable,x.from);
  8891. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  8892. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  8893. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  8894. Assign(temporaryVariableDesignator,x.to);
  8895. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  8896. IF by > 0 THEN
  8897. cmp := Scanner.LessEqual
  8898. ELSE
  8899. cmp := Scanner.GreaterEqual
  8900. END;
  8901. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  8902. binary.SetType(system.booleanType);
  8903. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8904. SetLabel(start);
  8905. Condition(binary,true,false);
  8906. SetLabel(true);
  8907. StatementSequence(x.statements);
  8908. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  8909. binary.SetType(x.variable.type);
  8910. Assign(x.variable,binary);
  8911. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8912. BrL(start);
  8913. SetLabel(false);
  8914. IF Trace THEN TraceExit("VisitForStatement") END;
  8915. END VisitForStatement;
  8916. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  8917. VAR prevLoop: Label;
  8918. BEGIN
  8919. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  8920. prevLoop := currentLoop;
  8921. currentLoop := NewLabel();
  8922. StatementSequence(x.statements);
  8923. SetLabel(currentLoop);
  8924. currentLoop := prevLoop;
  8925. IF Trace THEN TraceExit("VisitExitableBlock") END;
  8926. END VisitExitableBlock;
  8927. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  8928. VAR prevLoop,start: Label;
  8929. BEGIN
  8930. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  8931. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8932. start := NewLabel();
  8933. prevLoop := currentLoop;
  8934. SetLabel(start);
  8935. currentLoop := NewLabel();
  8936. StatementSequence(x.statements);
  8937. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8938. BrL(start);
  8939. SetLabel(currentLoop);
  8940. currentLoop := prevLoop;
  8941. IF Trace THEN TraceExit("VisitLoopStatement") END;
  8942. END VisitLoopStatement;
  8943. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  8944. VAR outer: SyntaxTree.Statement;
  8945. BEGIN
  8946. IF Trace THEN TraceEnter("VisitExitStatement") END;
  8947. IF locked THEN (* r if we jump out of an exclusive block *)
  8948. outer := x.outer;
  8949. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  8950. outer := outer.outer;
  8951. END;
  8952. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  8953. Lock(FALSE);
  8954. END;
  8955. END;
  8956. BrL(currentLoop);
  8957. IF Trace THEN TraceExit("VisitExitStatement") END;
  8958. END VisitExitStatement;
  8959. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  8960. VAR
  8961. expression, parameterDesignator: SyntaxTree.Expression;
  8962. type, componentType: SyntaxTree.Type;
  8963. res, right: Operand;
  8964. left, mem, reg: IntermediateCode.Operand;
  8965. parameter: SyntaxTree.Parameter;
  8966. procedure: SyntaxTree.Procedure;
  8967. procedureType: SyntaxTree.ProcedureType;
  8968. returnTypeOffset: LONGINT;
  8969. delegate: BOOLEAN;
  8970. map: SymbolMap;
  8971. BEGIN
  8972. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  8973. expression := x.returnValue;
  8974. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8975. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8976. IF currentIsInline THEN
  8977. IF expression # NIL THEN
  8978. map := currentMapper.Get(NIL);
  8979. IF map # NIL THEN
  8980. Assign(map.to, expression);
  8981. END;
  8982. END;
  8983. BrL(currentInlineExit);
  8984. RETURN;
  8985. END;
  8986. IF expression # NIL THEN
  8987. type := expression.type.resolved;
  8988. IF (expression IS SyntaxTree.ResultDesignator) THEN
  8989. IF locked THEN Lock(FALSE) END;
  8990. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8991. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  8992. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  8993. (* return without structured return parameter *)
  8994. Evaluate(expression,res);
  8995. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  8996. IF locked OR profile THEN
  8997. Emit(Push(position,res.op));
  8998. IF delegate THEN HALT(200) END;
  8999. ReleaseOperand(res);
  9000. IF locked THEN Lock(FALSE) END;
  9001. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9002. reg := NewRegisterOperand(res.op.type);
  9003. Emit(Pop(position,reg));
  9004. Emit(Return(position,reg));
  9005. ReleaseIntermediateOperand(reg);
  9006. ELSE
  9007. Emit(Return(position,res.op));
  9008. ReleaseOperand(res);
  9009. END;
  9010. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9011. THEN
  9012. (* return using structured return parameter *)
  9013. ASSERT((type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static)
  9014. OR SemanticChecker.IsPointerType(type));
  9015. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9016. parameter :=procedureType.returnParameter;
  9017. ASSERT(parameter # NIL);
  9018. returnTypeOffset := parameter.offsetInBits;
  9019. (*
  9020. IF parameter# NIL THEN
  9021. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9022. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9023. ELSE
  9024. returnTypeOffset := system.offsetFirstParameter
  9025. END;
  9026. *)
  9027. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9028. IF type IS SyntaxTree.RangeType THEN
  9029. (* array range type *)
  9030. Evaluate(expression, right);
  9031. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9032. Emit(Mov(position,mem, right.op)); (* first *)
  9033. ReleaseIntermediateOperand(mem);
  9034. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9035. Emit(Mov(position,mem, right.tag)); (* last *)
  9036. ReleaseIntermediateOperand(mem);
  9037. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9038. Emit(Mov(position,mem, right.extra)); (* step *)
  9039. ReleaseIntermediateOperand(mem);
  9040. ReleaseOperand(right);
  9041. ELSIF type IS SyntaxTree.ComplexType THEN
  9042. Evaluate(expression, right);
  9043. componentType := type(SyntaxTree.ComplexType).componentType;
  9044. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9045. Emit(Mov(position,mem, right.op)); (* real part *)
  9046. ReleaseIntermediateOperand(mem);
  9047. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9048. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9049. ReleaseIntermediateOperand(mem);
  9050. ReleaseOperand(right);
  9051. ELSE (* covers cases: pointer / record / array *)
  9052. parameter := procedureType.returnParameter;
  9053. checker.SetCurrentScope(currentScope);
  9054. ASSERT(parameter # NIL);
  9055. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9056. Assign(parameterDesignator,expression);
  9057. END;
  9058. ReleaseIntermediateOperand(left);
  9059. IF locked THEN Lock(FALSE) END;
  9060. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9061. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9062. parameter := procedureType.returnParameter;
  9063. checker.SetCurrentScope(currentScope);
  9064. IF parameter = NIL THEN
  9065. Error(procedure.position, "structured return of parameter of procedure not found");
  9066. ELSE
  9067. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9068. Assign(parameterDesignator,expression);
  9069. END;
  9070. IF locked THEN Lock(FALSE) END;
  9071. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9072. ELSE
  9073. HALT(200);
  9074. END;
  9075. ELSE
  9076. IF locked THEN Lock(FALSE) END;
  9077. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9078. END;
  9079. IF backend.cooperative THEN
  9080. BrL(exitLabel);
  9081. ELSE
  9082. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9083. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9084. END;
  9085. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9086. END VisitReturnStatement;
  9087. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9088. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9089. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9090. statements: SyntaxTree.StatementSequence;
  9091. name, suffix: SyntaxTree.IdentifierString;
  9092. BEGIN
  9093. Strings.IntToStr(awaitProcCounter,suffix);
  9094. Strings.Concat("@AwaitProcedure",suffix,name);
  9095. identifier := SyntaxTree.NewIdentifier(name);
  9096. INC(awaitProcCounter);
  9097. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9098. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9099. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9100. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9101. procedure.SetAccess(SyntaxTree.Hidden);
  9102. procedure.SetScope(currentScope);
  9103. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9104. procedureType.SetReturnType(system.booleanType);
  9105. procedure.SetType(procedureType);
  9106. body := SyntaxTree.NewBody(x.position,procedureScope);
  9107. procedureScope.SetBody(body);
  9108. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9109. returnStatement.SetReturnValue(x.condition);
  9110. statements := SyntaxTree.NewStatementSequence();
  9111. statements.AddStatement(returnStatement);
  9112. body.SetStatementSequence(statements);
  9113. currentScope.AddProcedure(procedure);
  9114. RETURN procedure
  9115. END MakeAwaitProcedure;
  9116. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9117. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9118. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9119. BEGIN
  9120. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9121. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9122. IF backend.cooperative THEN
  9123. start := NewLabel();
  9124. true := NewLabel();
  9125. false := NewLabel();
  9126. SetLabel(start);
  9127. Condition(x.condition,true,false);
  9128. SetLabel(false);
  9129. PushSelfPointer();
  9130. CallThis(position,"ExclusiveBlocks","Await",1);
  9131. BrL(start);
  9132. SetLabel(true);
  9133. PushSelfPointer();
  9134. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9135. ELSE
  9136. proc := MakeAwaitProcedure(x);
  9137. Emit(Push(position,fp));
  9138. GetCodeSectionNameForSymbol(proc,name);
  9139. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9140. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9141. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9142. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9143. Emit(Result(position,res));
  9144. (*
  9145. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9146. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9147. *)
  9148. InitOperand(result,ModeValue);
  9149. result.op := res;
  9150. label := NewLabel();
  9151. BreqL(label, result.op, SELF.true);
  9152. ReleaseOperand(result);
  9153. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9154. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9155. Emit(Push(position,res));
  9156. Emit(Push(position,fp));
  9157. PushSelfPointer();
  9158. Emit(Push(position,nil));
  9159. CallThis(position,"Objects","Await",4);
  9160. SetLabel(label);
  9161. END;
  9162. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9163. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9164. END VisitAwaitStatement;
  9165. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9166. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9167. BEGIN
  9168. FOR i := 0 TO x.Length() - 1 DO
  9169. statement := x.GetStatement( i );
  9170. Statement(statement);
  9171. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9172. END;
  9173. END StatementSequence;
  9174. PROCEDURE PushSelfPointer;
  9175. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9176. BEGIN
  9177. scope := currentScope;
  9178. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9179. scope := scope.outerScope;
  9180. END;
  9181. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9182. IF ~newObjectFile THEN
  9183. Symbol(moduleSelf,op);
  9184. IntermediateCode.MakeMemory(op.op,addressType);
  9185. ELSE
  9186. moduleSection := meta.ModuleSection();
  9187. IF backend.cooperative THEN
  9188. moduleOffset := 0;
  9189. ELSE
  9190. moduleOffset := moduleSection.pc;
  9191. END;
  9192. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9193. END;
  9194. ELSE
  9195. GetBaseRegister(op.op,currentScope,scope);
  9196. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9197. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9198. IF backend.cooperative THEN
  9199. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9200. END;
  9201. IntermediateCode.MakeMemory(op.op,addressType);
  9202. END;
  9203. Emit(Push(position,op.op));
  9204. ReleaseOperand(op);
  9205. END PushSelfPointer;
  9206. PROCEDURE Lock(lock: BOOLEAN);
  9207. BEGIN
  9208. IF Trace THEN TraceEnter("Lock") END;
  9209. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9210. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9211. ASSERT(modifyAssignmentCounter = 0);
  9212. IF dump # NIL THEN
  9213. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9214. dump.Ln;dump.Update;
  9215. END;
  9216. PushSelfPointer;
  9217. IF backend.cooperative THEN
  9218. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9219. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9220. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9221. END;
  9222. ELSE
  9223. Emit(Push(position,true));
  9224. IF lock THEN CallThis(position,"Objects","Lock",2)
  9225. ELSE CallThis(position,"Objects","Unlock",2);
  9226. END;
  9227. END;
  9228. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9229. IF Trace THEN TraceExit("Lock") END;
  9230. END Lock;
  9231. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9232. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9233. BEGIN
  9234. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9235. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9236. previouslyUnchecked := isUnchecked;
  9237. isUnchecked := isUnchecked OR x.isUnchecked;
  9238. previouslyCooperativeSwitches := cooperativeSwitches;
  9239. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9240. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9241. IF x.statements # NIL THEN
  9242. StatementSequence(x.statements);
  9243. END;
  9244. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9245. isUnchecked := previouslyUnchecked;
  9246. cooperativeSwitches := previouslyCooperativeSwitches;
  9247. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9248. END VisitStatementBlock;
  9249. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9250. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9251. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9252. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9253. procedure: SyntaxTree.Procedure;
  9254. map: SymbolMap;
  9255. BEGIN
  9256. scope := currentScope;
  9257. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9258. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9259. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9260. return := emptyOperand;
  9261. IF Trace THEN TraceEnter("VisitCode") END;
  9262. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9263. NEW(in, x.inRules.Length());
  9264. FOR i := 0 TO LEN(in)-1 DO
  9265. statement := x.inRules.GetStatement(i);
  9266. WITH statement: SyntaxTree.Assignment DO
  9267. Evaluate(statement.right, operand);
  9268. result := operand.op;
  9269. NEW(str, 64);
  9270. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9271. in[i] := result; IntermediateCode.SetString(in[i], str);
  9272. ReleaseIntermediateOperand(operand.tag);
  9273. END;
  9274. END;
  9275. ELSE in := NIL
  9276. END;
  9277. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9278. NEW(out, x.outRules.Length());
  9279. FOR i := 0 TO LEN(out)-1 DO
  9280. statement := x.outRules.GetStatement(i);
  9281. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9282. WITH statement: SyntaxTree.Assignment DO
  9283. Evaluate(statement.left, operand); (*?? or designate *)
  9284. result := operand.op;
  9285. NEW(str, 64);
  9286. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9287. out[i] := result; IntermediateCode.SetString(out[i], str);
  9288. ReleaseIntermediateOperand(operand.tag);
  9289. |statement: SyntaxTree.ReturnStatement DO
  9290. NEW(str, 64);
  9291. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9292. IF currentIsInline THEN
  9293. map := currentMapper.Get(NIL);
  9294. Evaluate(map.to, operand);
  9295. out[i] := operand.op;
  9296. ELSE
  9297. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9298. END;
  9299. IntermediateCode.SetString(out[i], str);
  9300. ReleaseIntermediateOperand(operand.tag);
  9301. return := out[i];
  9302. ELSE
  9303. END;
  9304. END;
  9305. ELSE out := NIL
  9306. END;
  9307. Emit(Asm(x.position,x.sourceCode, in, out));
  9308. IF in # NIL THEN
  9309. FOR i := 0 TO LEN(in)-1 DO
  9310. ReleaseIntermediateOperand(in[i]);
  9311. END;
  9312. END;
  9313. IF out # NIL THEN
  9314. FOR i := 0 TO LEN(out)-1 DO
  9315. WITH statement: SyntaxTree.Assignment DO
  9316. ReleaseIntermediateOperand(out[i]);
  9317. ELSE
  9318. IF currentIsInline THEN
  9319. ReleaseIntermediateOperand(out[i]);
  9320. END;
  9321. END;
  9322. statement := x.outRules.GetStatement(i);
  9323. END;
  9324. END;
  9325. IF return.mode # IntermediateCode.Undefined THEN
  9326. IF currentIsInline THEN
  9327. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9328. Symbol(procedureType.returnParameter, par);
  9329. MakeMemory(mem, par.op, return.type, 0);
  9330. ReleaseOperand(par);
  9331. Emit(Mov(position, mem, return));
  9332. ReleaseIntermediateOperand(mem);
  9333. ELSE
  9334. Emit(Return(position,return));
  9335. END;
  9336. IF currentIsInline THEN RETURN END;
  9337. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9338. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9339. ReleaseIntermediateOperand(return);
  9340. END;
  9341. IF Trace THEN TraceExit("VisitCode") END;
  9342. END VisitCode;
  9343. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9344. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9345. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9346. const, call: IntermediateCode.Operand;
  9347. parameterDesignator: SyntaxTree.Expression;
  9348. saved: RegisterEntry;
  9349. name: Basic.SegmentedName;
  9350. BEGIN
  9351. IF Trace THEN TraceEnter("ParameterCopies") END;
  9352. parameter := x.firstParameter;
  9353. WHILE parameter # NIL DO
  9354. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9355. type := parameter.type.resolved;
  9356. IF IsOpenArray(type) THEN
  9357. VisitParameter(parameter);
  9358. op := result;
  9359. IF backend.cooperative & parameter.NeedsTrace() THEN
  9360. length := GetArrayLength(type, op.tag);
  9361. size := NewRegisterOperand(addressType);
  9362. base := ArrayBaseType(type);
  9363. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9364. Emit(Mul(position, size, length, const));
  9365. dst := NewRegisterOperand (addressType);
  9366. Emit(Mov(position, dst, size));
  9367. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9368. Emit(Sub(position,dst,sp,dst));
  9369. Emit(And(position,dst,dst,const));
  9370. Emit(Mov(position,sp,dst));
  9371. par := fp;
  9372. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9373. IntermediateCode.InitImmediate(null, byteType, 0);
  9374. Emit(Fill(position, dst, size, null));
  9375. ReleaseIntermediateOperand(dst);
  9376. ReleaseIntermediateOperand(length);
  9377. SaveRegisters();ReleaseUsedRegisters(saved);
  9378. (* register dst has been freed before SaveRegisters already *)
  9379. base := ArrayBaseType(type);
  9380. (* assign method of open array *)
  9381. IF base.IsRecordType() THEN
  9382. Emit (Push(position, length));
  9383. Emit (Push(position, dst));
  9384. Emit (Push(position, op.op));
  9385. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9386. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9387. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9388. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9389. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9390. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9391. Emit (Push(position,length));
  9392. Emit (Push(position, dst));
  9393. Emit (Push(position, length));
  9394. Emit (Push(position, op.op));
  9395. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9396. ELSE
  9397. Emit (Push(position, length));
  9398. Emit (Push(position, dst));
  9399. Emit (Push(position, length));
  9400. Emit (Push(position, op.op));
  9401. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9402. ASSERT(ArrayBaseType(type).IsPointer());
  9403. END;
  9404. RestoreRegisters(saved);
  9405. ELSE
  9406. temp := GetDynamicSize(type,op.tag);
  9407. ReuseCopy(size,temp);
  9408. ReleaseIntermediateOperand(temp);
  9409. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9410. Emit(Sub(position,size,sp,size));
  9411. Emit(And(position,size,size,const));
  9412. Emit(Mov(position,sp,size));
  9413. par := fp;
  9414. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9415. ReleaseIntermediateOperand(size);
  9416. size := GetDynamicSize(type,op.tag);
  9417. END;
  9418. Emit(Copy(position,sp,op.op,size));
  9419. ReleaseIntermediateOperand(size);
  9420. ReleaseOperand(op);
  9421. IntermediateCode.MakeMemory(par,addressType);
  9422. Emit(Mov(position,par,sp));
  9423. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9424. checker.SetCurrentScope(currentScope);
  9425. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9426. Assign(parameterDesignator,parameterDesignator);
  9427. END;
  9428. END;
  9429. parameter := parameter.nextParameter;
  9430. END;
  9431. IF Trace THEN TraceExit("ParameterCopies") END;
  9432. END ParameterCopies;
  9433. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9434. VAR x: SyntaxTree.Variable;
  9435. BEGIN
  9436. x := scope.firstVariable;
  9437. WHILE x # NIL DO
  9438. InitVariable(x);
  9439. x := x.nextVariable;
  9440. END;
  9441. END InitVariables;
  9442. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9443. BEGIN
  9444. IF (symbol # NIL) THEN
  9445. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9446. ELSE
  9447. RETURN 0
  9448. END;
  9449. END GetFingerprint;
  9450. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9451. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9452. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9453. saved: RegisterEntry;
  9454. BEGIN
  9455. IF Trace THEN TraceEnter("Body") END;
  9456. ReleaseUsedRegisters(saved); (* just in case ... *)
  9457. section := ir;
  9458. exitLabel := NewLabel ();
  9459. IF moduleBody THEN moduleBodySection := section END;
  9460. IF ir.comments # NIL THEN
  9461. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9462. commentPrintout.SingleStatement(TRUE);
  9463. dump := ir.comments;
  9464. ELSE
  9465. commentPrintout := NIL;
  9466. dump := NIL;
  9467. END;
  9468. registerUsageCount.Init;
  9469. prevScope := currentScope;
  9470. currentScope := scope;
  9471. lastSwitchPC := 0;
  9472. cooperativeSwitches := backend.cooperative;
  9473. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9474. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9475. IF x # NIL THEN
  9476. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9477. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9478. IF moduleBody THEN
  9479. ProfilerInit();
  9480. ELSE
  9481. Basic.SegmentedNameToString(ir.name, string);
  9482. ProfilerAddProcedure(numberProcedures,string);
  9483. ProfilerEnterExit(numberProcedures,TRUE);
  9484. END;
  9485. END;
  9486. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9487. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9488. END;
  9489. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9490. IF moduleBody THEN
  9491. InitVariables(moduleScope)
  9492. END;
  9493. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9494. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9495. IF procedure = cellScope.bodyProcedure THEN
  9496. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9497. StaticCallOperand(op, cellScope.constructor);
  9498. Emit(Call(position,op.op,0));
  9499. END;
  9500. END;
  9501. END;
  9502. ParameterCopies(procedureType);
  9503. InitVariables(scope);
  9504. IF x.code = NIL THEN
  9505. VisitStatementBlock(x);
  9506. ELSE
  9507. VisitCode(x.code)
  9508. END;
  9509. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9510. ir.SetFinally(ir.pc);
  9511. StatementSequence(x.finally)
  9512. END;
  9513. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9514. IF ~backend.cooperative THEN
  9515. ProfilerEnterExit(numberProcedures,FALSE);
  9516. END;
  9517. INC(numberProcedures);
  9518. END;
  9519. END;
  9520. IF backend.cooperative THEN
  9521. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9522. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9523. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9524. (*! not required any more? check and delete!
  9525. PushSelfPointer();
  9526. CallThis(position,"Modules","SetInitialized",1);
  9527. *)
  9528. (*
  9529. SetLabel(end);
  9530. *)
  9531. END;
  9532. IF x # NIL THEN
  9533. SELF.position := x.position;
  9534. END;
  9535. CheckRegistersFree();
  9536. ASSERT(modifyAssignmentCounter = 0);
  9537. currentScope := prevScope;
  9538. IF Trace THEN TraceExit("Body") END;
  9539. END Body;
  9540. END ImplementationVisitor;
  9541. MetaDataGenerator=OBJECT
  9542. VAR
  9543. implementationVisitor: ImplementationVisitor;
  9544. declarationVisitor: DeclarationVisitor;
  9545. module: Sections.Module;
  9546. moduleName: ARRAY 128 OF CHAR;
  9547. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9548. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9549. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9550. TypeTags: LONGINT; (* type extension level support *)
  9551. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9552. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9553. BEGIN
  9554. IF implementationVisitor.backend.cooperative THEN
  9555. TypeTags := MAX(LONGINT); (* only 3 extensions allowed *)
  9556. BaseTypesTableOffset := 0;
  9557. MethodTableOffset := 2;
  9558. TypeRecordBaseOffset := 0;
  9559. ELSIF simple THEN
  9560. TypeTags := 3; (* only 3 extensions allowed *)
  9561. BaseTypesTableOffset := -1;
  9562. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9563. TypeRecordBaseOffset := TypeTags;
  9564. ELSE
  9565. TypeTags := 16;
  9566. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9567. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9568. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9569. END;
  9570. SELF.simple := simple;
  9571. SELF.implementationVisitor := implementationVisitor;
  9572. SELF.declarationVisitor := declarationVisitor;
  9573. implementationVisitor.meta := SELF;
  9574. declarationVisitor.meta := SELF;
  9575. END InitMetaDataGenerator;
  9576. PROCEDURE SetModule(module: Sections.Module);
  9577. BEGIN
  9578. SELF.module := module
  9579. END SetModule;
  9580. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9581. BEGIN
  9582. IF implementationVisitor.backend.cooperative THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9583. END GetTypeRecordBaseOffset;
  9584. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9585. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9586. BEGIN
  9587. INC(dataAdrOffset,6);
  9588. Info(section,"headerAdr");
  9589. Address(section,0);
  9590. Info(section,"typeDesc");
  9591. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9592. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9593. NamedSymbol(section, name, symbol, 0, offset);
  9594. Info(section,"mark: LONGINT;");
  9595. Longint(section,-1);
  9596. Info(section,"dataAdr-: ADDRESS");
  9597. Symbol(section,section, dataAdrOffset,0);
  9598. Info(section,"size-: SIZE");
  9599. Address(section,0);
  9600. Info(section,"nextRealtime: HeapBlock;");
  9601. Address(section,0);
  9602. END HeapBlock;
  9603. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9604. VAR i: LONGINT;
  9605. BEGIN
  9606. INC(dataAdrOffset,14);
  9607. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9608. Info(section,"count*: LONGINT");
  9609. Longint(section,0);
  9610. Info(section,"locked*: BOOLEAN");
  9611. Longint(section,0);
  9612. Info(section,"awaitingLock*: ProcessQueue");
  9613. Address(section,0);
  9614. Address(section,0);
  9615. Info(section,"awaitingCond*: ProcessQueue");
  9616. Address(section,0);
  9617. Address(section,0);
  9618. Info(section,"lockedBy*: ANY");
  9619. Address(section,0);
  9620. Info(section,"lock*: ANY");
  9621. Address(section,0);
  9622. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9623. Longint(section,1);
  9624. FOR i := 2 TO 6 DO
  9625. Longint(section,0);
  9626. END;
  9627. END ProtectedHeapBlock;
  9628. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9629. BEGIN
  9630. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9631. END Info;
  9632. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9633. VAR op: IntermediateCode.Operand;
  9634. BEGIN
  9635. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9636. section.Emit(Data(-11,op));
  9637. END Address;
  9638. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9639. VAR op: IntermediateCode.Operand;
  9640. BEGIN
  9641. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9642. section.Emit(Data(-12,op));
  9643. END Size;
  9644. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9645. VAR op: IntermediateCode.Operand;
  9646. BEGIN
  9647. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9648. section.Emit(Data(-1,op));
  9649. END Set;
  9650. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9651. VAR op: IntermediateCode.Operand;
  9652. BEGIN
  9653. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9654. section.Emit(Data(-1,op));
  9655. END Longint;
  9656. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9657. VAR op,noOperand: IntermediateCode.Operand;
  9658. BEGIN
  9659. IntermediateCode.InitOperand(noOperand);
  9660. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9661. section.PatchOperands(pc,op,noOperand,noOperand);
  9662. END PatchLongint;
  9663. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9664. VAR op, noOperand: IntermediateCode.Operand;
  9665. BEGIN
  9666. IntermediateCode.InitOperand(noOperand);
  9667. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9668. section.PatchOperands(pc,op,noOperand,noOperand);
  9669. END PatchSymbol;
  9670. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9671. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9672. BEGIN
  9673. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9674. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9675. section.Emit(Data(-1,op));
  9676. END Boolean;
  9677. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9678. VAR op: IntermediateCode.Operand;
  9679. BEGIN
  9680. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9681. section.Emit(Data(-1,op));
  9682. END Char;
  9683. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9684. VAR i: LONGINT;
  9685. BEGIN
  9686. Info(section,str);
  9687. i := 0;
  9688. WHILE(str[i] # 0X) DO
  9689. Char(section,str[i]);
  9690. INC(i);
  9691. END;
  9692. Char(section,0X);
  9693. END String;
  9694. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9695. VAR op: IntermediateCode.Operand;
  9696. BEGIN
  9697. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9698. IntermediateCode.SetOffset(op,realOffset);
  9699. section.Emit(Data(-1,op));
  9700. END NamedSymbol;
  9701. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9702. BEGIN
  9703. IF symbol= NIL THEN
  9704. Address( section, realOffset);
  9705. ASSERT(virtualOffset = 0);
  9706. ELSE
  9707. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9708. END;
  9709. END Symbol;
  9710. (* OutPointers delivers
  9711. {pointerOffset}
  9712. *)
  9713. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9714. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9715. BEGIN
  9716. type := type.resolved;
  9717. IF type IS SyntaxTree.AnyType THEN
  9718. Symbol(section, symbol, 0, (offset ));
  9719. INC(numberPointers);
  9720. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9721. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9722. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9723. ELSIF type IS SyntaxTree.PointerType THEN
  9724. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9725. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9726. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9727. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9728. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9729. ELSIF (type IS SyntaxTree.RecordType) THEN
  9730. (* never treat a record like a pointer, even if the pointer field is set! *)
  9731. WITH type: SyntaxTree.RecordType DO
  9732. base := type.GetBaseRecord();
  9733. IF base # NIL THEN
  9734. Pointers(offset,symbol,section, base,numberPointers);
  9735. END;
  9736. variable := type.recordScope.firstVariable;
  9737. WHILE(variable # NIL) DO
  9738. IF ~(variable.untraced) THEN
  9739. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9740. END;
  9741. variable := variable.nextVariable;
  9742. END;
  9743. END;
  9744. ELSIF (type IS SyntaxTree.CellType) THEN
  9745. WITH type: SyntaxTree.CellType DO
  9746. base := type.GetBaseRecord();
  9747. IF base # NIL THEN
  9748. Pointers(offset,symbol,section, base,numberPointers);
  9749. END;
  9750. variable := type.cellScope.firstVariable;
  9751. WHILE(variable # NIL) DO
  9752. IF ~(variable.untraced) THEN
  9753. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9754. END;
  9755. variable := variable.nextVariable;
  9756. END;
  9757. END;
  9758. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9759. WITH type: SyntaxTree.ArrayType DO
  9760. IF type.form= SyntaxTree.Static THEN
  9761. n := type.staticLength;
  9762. base := type.arrayBase.resolved;
  9763. WHILE(base IS SyntaxTree.ArrayType) DO
  9764. type := base(SyntaxTree.ArrayType);
  9765. n := n* type.staticLength;
  9766. base := type.arrayBase.resolved;
  9767. END;
  9768. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9769. IF SemanticChecker.ContainsPointer(base) THEN
  9770. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9771. FOR i := 0 TO n-1 DO
  9772. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9773. END;
  9774. END;
  9775. ELSE
  9776. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9777. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9778. END;
  9779. END;
  9780. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9781. WITH type: SyntaxTree.MathArrayType DO
  9782. IF type.form = SyntaxTree.Static THEN
  9783. n := type.staticLength;
  9784. base := type.arrayBase.resolved;
  9785. WHILE(base IS SyntaxTree.MathArrayType) DO
  9786. type := base(SyntaxTree.MathArrayType);
  9787. n := n* type.staticLength;
  9788. base := type.arrayBase.resolved;
  9789. END;
  9790. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9791. IF SemanticChecker.ContainsPointer(base) THEN
  9792. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9793. FOR i := 0 TO n-1 DO
  9794. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9795. END;
  9796. END;
  9797. ELSE
  9798. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9799. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9800. END
  9801. END;
  9802. (* ELSE no pointers in type *)
  9803. END;
  9804. END Pointers;
  9805. PROCEDURE DynamicName(source: IntermediateCode.Section; name: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9806. VAR s: Basic.SectionName; i: LONGINT; ch: CHAR; position: LONGINT;
  9807. BEGIN
  9808. IF pool.Has(name) THEN
  9809. RETURN pool.GetInt(name)
  9810. ELSE
  9811. position := source.pc;
  9812. pool.PutInt(name, position);
  9813. StringPool.GetString(name, s);
  9814. Info(source, s);
  9815. i := 0;
  9816. REPEAT
  9817. ch := s[i]; INC(i);
  9818. Char( source, ch);
  9819. UNTIL ch = 0X;
  9820. END;
  9821. RETURN position;
  9822. END DynamicName;
  9823. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9824. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  9825. BEGIN
  9826. COPY(moduleName,name);
  9827. Strings.Append(name,suffix);
  9828. Basic.ToSegmentedName(name, pooledName);
  9829. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  9830. IF implementationVisitor.backend.cooperative THEN
  9831. Info(section, "TypeDescriptor");
  9832. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  9833. NamedSymbol(section, pooledName,NIL, 0, 0);
  9834. BasePointer(section);
  9835. offset := 0;
  9836. ELSE
  9837. HeapBlock(mName,typeName,section,2);
  9838. Info(section, "HeapBlock");
  9839. (*
  9840. Symbol(section,section,2,0);
  9841. *)
  9842. Address(section,0); (* empty such that GC does not go on traversing *)
  9843. Info(section, "TypeDescriptor");
  9844. Address(section,0);
  9845. offset := section.pc;
  9846. END;
  9847. RETURN section
  9848. END Block;
  9849. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  9850. VAR name: Basic.SegmentedName;
  9851. BEGIN
  9852. Info(source,"ArrayHeader");
  9853. IF implementationVisitor.backend.cooperative THEN
  9854. sizePC := source.pc;
  9855. Address(source,0);
  9856. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  9857. IF baseType # "" THEN
  9858. Basic.ToSegmentedName(baseType, name);
  9859. NamedSymbol(source, name,NIL, 0, 0);
  9860. ELSE
  9861. Address(source,0);
  9862. END;
  9863. Address(source,0);
  9864. ELSE
  9865. Address(source,0);
  9866. Address(source,0);
  9867. Address(source,0);
  9868. sizePC := source.pc;
  9869. Address(source,0);
  9870. Info(source,"array data");
  9871. END;
  9872. END Array;
  9873. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  9874. BEGIN
  9875. IF implementationVisitor.backend.cooperative THEN
  9876. PatchLongint(section, pc, size);
  9877. PatchLongint(section, pc + 3, size);
  9878. ELSE
  9879. PatchLongint(section, pc, size);
  9880. END;
  9881. END PatchArray;
  9882. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  9883. VAR
  9884. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  9885. sectionArray: POINTER TO ARRAY OF Sections.Section;
  9886. poolMap: Basic.HashTableInt;
  9887. namePool: IntermediateCode.Section;
  9888. namePoolOffset: LONGINT;
  9889. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  9890. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  9891. BEGIN
  9892. Basic.SegmentedNameToString(s1.name,n1);
  9893. Basic.SegmentedNameToString(s2.name,n2);
  9894. index := 0;
  9895. ch1 := n1[index];
  9896. ch2 := n2[index];
  9897. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  9898. INC(index);
  9899. ch1 := n1[index];
  9900. ch2 := n2[index];
  9901. END;
  9902. RETURN ch1 < ch2;
  9903. END Compare;
  9904. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  9905. VAR
  9906. i, j: LONGINT;
  9907. x, t: Sections.Section;
  9908. BEGIN
  9909. IF lo < hi THEN
  9910. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  9911. WHILE i <= j DO
  9912. WHILE Compare(list[i], x) DO INC(i) END;
  9913. WHILE Compare(x, list[j]) DO DEC(j) END;
  9914. IF i <= j THEN
  9915. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  9916. INC(i); DEC(j)
  9917. END
  9918. END;
  9919. IF lo < j THEN QuickSort(list, lo, j) END;
  9920. IF i < hi THEN QuickSort(list, i, hi) END
  9921. END;
  9922. END QuickSort;
  9923. (*
  9924. ExportDesc* = RECORD
  9925. fp*: ADDRESS;
  9926. name* {UNTRACED}: DynamicName;
  9927. adr*: ADDRESS;
  9928. exports*: LONGINT;
  9929. dsc* {UNTRACED}: ExportArray
  9930. END;
  9931. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  9932. *)
  9933. PROCEDURE ExportDesc2(
  9934. source: IntermediateCode.Section;
  9935. namePool: IntermediateCode.Section;
  9936. fingerPrinter: FingerPrinter.FingerPrinter;
  9937. symbol: Sections.Section;
  9938. name: StringPool.Index;
  9939. VAR patchAdr: LONGINT
  9940. ): BOOLEAN;
  9941. VAR fingerPrint: SyntaxTree.FingerPrint;
  9942. BEGIN
  9943. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9944. & (symbol.type # Sections.InlineCodeSection)
  9945. THEN
  9946. *)
  9947. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9948. & (symbol.type # Sections.InlineCodeSection))
  9949. THEN
  9950. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  9951. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  9952. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  9953. Longint(source,fingerPrint.shallow);
  9954. ELSE
  9955. Longint(source, 0);
  9956. END;
  9957. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  9958. Symbol(source, symbol,0,0);
  9959. patchAdr := source.pc;
  9960. Address(source,0);
  9961. Address(source,0);
  9962. END;
  9963. RETURN TRUE
  9964. ELSE
  9965. RETURN FALSE
  9966. END;
  9967. END ExportDesc2;
  9968. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  9969. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  9970. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  9971. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  9972. TYPE
  9973. Scope = RECORD
  9974. elements: LONGINT;
  9975. gelements: LONGINT;
  9976. section: IntermediateCode.Section;
  9977. patchAdr: LONGINT;
  9978. arraySizePC: LONGINT;
  9979. beginPC: LONGINT; (* current scope start pc *)
  9980. END;
  9981. BEGIN
  9982. Basic.InitSegmentedName(prev);
  9983. olevel := -1;
  9984. scopes[0].section := source;
  9985. FOR s := 0 TO LEN(sections)-1 DO
  9986. symbol := sections[s];
  9987. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  9988. this := sections[s].name;
  9989. level := 0;
  9990. WHILE (this[level] > 0) DO
  9991. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  9992. INC(level);
  9993. END;
  9994. WHILE level < olevel DO
  9995. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  9996. IF olevel > 0 THEN
  9997. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  9998. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  9999. END;
  10000. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10001. DEC(olevel);
  10002. END;
  10003. IF (this[level] > 0) THEN
  10004. IF level > olevel THEN
  10005. (*TRACE("opening",level); *)
  10006. IF scopes[level].section = NIL THEN
  10007. arrayName := ".@ExportArray";
  10008. Strings.AppendInt(arrayName, level);
  10009. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10010. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10011. END;
  10012. scopes[level].beginPC := scopes[level].section.pc;
  10013. olevel := level;
  10014. scopes[olevel].elements := 0;
  10015. END;
  10016. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10017. sym := sections[s];
  10018. ELSE
  10019. sym := NIL;
  10020. END;
  10021. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10022. THEN
  10023. INC(scopes[olevel].elements);
  10024. END;
  10025. (*StringPool.GetString(this[level], name);*)
  10026. (*TRACE(level, name);*)
  10027. (* enter string in scope *)
  10028. INC(level);
  10029. END;
  10030. END;
  10031. Basic.SegmentedNameToString(this, name);
  10032. (*TRACE(level, "enter", name);*)
  10033. prev := this;
  10034. END;
  10035. END;
  10036. WHILE 0 <= olevel DO
  10037. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10038. IF olevel > 0 THEN
  10039. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10040. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10041. END;
  10042. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10043. DEC(olevel);
  10044. END;
  10045. level := 0;
  10046. WHILE (level < LEN(scopes)) DO
  10047. IF scopes[level].section # NIL THEN
  10048. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10049. END;
  10050. INC(level);
  10051. END;
  10052. END Export;
  10053. BEGIN
  10054. NEW(fingerPrinter, module.system);
  10055. NEW(poolMap, 64);
  10056. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10057. NEW(sectionArray, module.allSections.Length());
  10058. FOR i := 0 TO module.allSections.Length() - 1 DO
  10059. section := module.allSections.GetSection(i);
  10060. sectionArray[i] := section;
  10061. END;
  10062. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10063. Export(sectionArray^);
  10064. END ExportDesc;
  10065. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10066. VAR
  10067. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10068. BEGIN
  10069. Info(source, "exception table offsets array descriptor");
  10070. size := 0;
  10071. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10072. Info(source, "exception table content");
  10073. FOR i := 0 TO module.allSections.Length() - 1 DO
  10074. p := module.allSections.GetSection(i);
  10075. IF p.type = Sections.CodeSection THEN
  10076. finallyPC := p(IntermediateCode.Section).finally;
  10077. IF finallyPC>=0 THEN
  10078. Symbol( source, p, 0,0);
  10079. Symbol( source, p, finallyPC, 0);
  10080. Symbol( source, p, finallyPC,0);
  10081. INC(size);
  10082. END;
  10083. END
  10084. END;
  10085. PatchArray(source,sizePC,size);
  10086. END ExceptionArray;
  10087. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10088. VAR i: LONGINT; ch: CHAR;
  10089. BEGIN
  10090. i := 0;
  10091. REPEAT
  10092. ch := name[i]; INC(i);
  10093. Char( section, ch);
  10094. UNTIL ch = 0X;
  10095. WHILE i < 32 DO
  10096. Char( section, 0X); INC(i);
  10097. END;
  10098. END Name;
  10099. PROCEDURE LongName(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10100. VAR i: LONGINT; ch: CHAR;
  10101. BEGIN
  10102. i := 0;
  10103. REPEAT
  10104. ch := name[i]; INC(i);
  10105. Char( section, ch);
  10106. UNTIL ch = 0X;
  10107. WHILE i < 128 DO
  10108. Char( section, 0X); INC(i);
  10109. END;
  10110. END LongName;
  10111. PROCEDURE References(section: IntermediateCode.Section);
  10112. CONST
  10113. rfDirect = 1X; rfIndirect = 3X;
  10114. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10115. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10116. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10117. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfRecordPointer=1DX;
  10118. rfArrayFlag = 80X;
  10119. VAR
  10120. size: LONGINT; s: Sections.Section; sizePC, i: LONGINT;
  10121. PROCEDURE BaseType(arrayOf: BOOLEAN; type: SyntaxTree.Type);
  10122. VAR char: CHAR;
  10123. BEGIN
  10124. IF type = NIL THEN char := rfLongint
  10125. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10126. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10127. ELSIF type IS SyntaxTree.CharacterType THEN
  10128. IF type.sizeInBits = 8 THEN char := rfChar8
  10129. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10130. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10131. END;
  10132. ELSIF type IS SyntaxTree.IntegerType THEN
  10133. IF type.sizeInBits = 8 THEN char := rfShortint
  10134. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10135. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10136. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10137. END;
  10138. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10139. ELSIF type IS SyntaxTree.AddressType THEN char := rfLongint
  10140. ELSIF type IS SyntaxTree.FloatType THEN
  10141. IF type.sizeInBits = 32 THEN char := rfReal
  10142. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10143. END;
  10144. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10145. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10146. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10147. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10148. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10149. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10150. END;
  10151. IF arrayOf THEN
  10152. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10153. ELSE
  10154. Char(section,char)
  10155. END;
  10156. INC(size);
  10157. END BaseType;
  10158. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10159. VAR destination: Sections.Section; name: SyntaxTree.IdentifierString;
  10160. BEGIN
  10161. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10162. IF destination = NIL THEN
  10163. (* imported unused record type *)
  10164. Char(section,0X); (* nil type *)
  10165. INC(size);
  10166. type.typeDeclaration.GetName(name);
  10167. (*
  10168. this happens when a symbol from a different module is used but the type desciptor is not necessary to be present in the current module
  10169. D.Str("Warning: Unreferenced record type encountered: "); D.String(name); D.String(" unused? "); D.Ln;
  10170. *)
  10171. ELSE
  10172. IF type.pointerType # NIL THEN
  10173. Char(section,rfRecordPointer)
  10174. ELSE
  10175. Char(section,rfRecord);
  10176. END;
  10177. INC(size);
  10178. Longint(section,(destination.offset ));
  10179. INC(size,4);
  10180. END;
  10181. END RecordType;
  10182. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10183. BEGIN
  10184. IF type.arrayBase.resolved IS SyntaxTree.ArrayType THEN
  10185. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10186. INC(size);
  10187. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10188. END;
  10189. IF type.form = SyntaxTree.Static THEN
  10190. Longint(section,type.staticLength)
  10191. ELSE
  10192. Longint(section,0)
  10193. END;
  10194. INC(size,4);
  10195. END ArrayType;
  10196. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10197. BEGIN
  10198. IF type.arrayBase = NIL THEN BaseType(TRUE,NIL)
  10199. ELSIF type.arrayBase.resolved IS SyntaxTree.MathArrayType THEN
  10200. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10201. INC(size);
  10202. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10203. END;
  10204. IF type.form = SyntaxTree.Static THEN
  10205. Longint(section,type.staticLength)
  10206. ELSE
  10207. Longint(section,0)
  10208. END;
  10209. INC(size,4);
  10210. END MathArrayType;
  10211. PROCEDURE Type(type: SyntaxTree.Type);
  10212. BEGIN
  10213. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10214. IF type IS SyntaxTree.BasicType THEN
  10215. BaseType(FALSE,type)
  10216. ELSIF type IS SyntaxTree.RecordType THEN
  10217. RecordType(type(SyntaxTree.RecordType));
  10218. ELSIF type IS SyntaxTree.ArrayType THEN
  10219. ArrayType(type(SyntaxTree.ArrayType))
  10220. ELSIF type IS SyntaxTree.EnumerationType THEN
  10221. BaseType(FALSE,module.system.longintType)
  10222. ELSIF type IS SyntaxTree.PointerType THEN
  10223. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10224. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10225. ELSE
  10226. BaseType(FALSE,type)
  10227. END;
  10228. ELSIF type IS SyntaxTree.ProcedureType THEN
  10229. BaseType(FALSE,type);
  10230. ELSIF type IS SyntaxTree.MathArrayType THEN
  10231. MathArrayType(type(SyntaxTree.MathArrayType));
  10232. ELSIF type IS SyntaxTree.CellType THEN
  10233. BaseType(FALSE,module.system.anyType);
  10234. ELSE HALT(200)
  10235. END;
  10236. END Type;
  10237. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10238. VAR name: ARRAY 256 OF CHAR;
  10239. BEGIN
  10240. IF variable.externalName # NIL THEN RETURN END;
  10241. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10242. INC(size);
  10243. variable.GetName(name);
  10244. Type(variable.type);
  10245. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10246. INC(size,4);
  10247. String(section,name);
  10248. INC(size,Strings.Length(name)+1);
  10249. END WriteVariable;
  10250. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10251. VAR name: ARRAY 256 OF CHAR;
  10252. BEGIN
  10253. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10254. INC(size);
  10255. variable.GetName(name);
  10256. Type(variable.type);
  10257. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10258. INC(size,4);
  10259. variable.GetName(name);
  10260. String(section,name);
  10261. INC(size,Strings.Length(name)+1);
  10262. END WriteParameter;
  10263. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10264. BEGIN
  10265. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10266. IF type IS SyntaxTree.ArrayType THEN
  10267. WITH type: SyntaxTree.ArrayType DO
  10268. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10269. ELSE Char(section,rfOpenArray)
  10270. END;
  10271. INC(size);
  10272. END
  10273. ELSIF type IS SyntaxTree.MathArrayType THEN
  10274. WITH type: SyntaxTree.MathArrayType DO
  10275. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10276. ELSE Char(section,rfOpenArray)
  10277. END;
  10278. INC(size);
  10279. END
  10280. ELSIF type IS SyntaxTree.RecordType THEN
  10281. Char(section,rfRecord);
  10282. INC(size);
  10283. ELSE
  10284. BaseType(FALSE,type);
  10285. END;
  10286. END ReturnType;
  10287. PROCEDURE Procedure(s: Sections.Section);
  10288. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10289. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10290. name: ARRAY 256 OF CHAR;
  10291. BEGIN
  10292. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10293. procedure.GetName(name);
  10294. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10295. Char(section,0F9X);
  10296. INC(size);
  10297. Symbol(section,s,0,0);
  10298. INC(size,4);
  10299. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10300. INC(size,4);
  10301. Longint(section,procedureType.numberParameters);
  10302. INC(size,4);
  10303. ReturnType(procedureType.returnType);
  10304. Longint(section,0); (*! level *)
  10305. INC(size,4);
  10306. Longint(section,0);
  10307. INC(size,4);
  10308. Global.GetSymbolNameInScope(procedure, module.module.moduleScope, name);
  10309. (*
  10310. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10311. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10312. recordName := "";
  10313. IF record.pointerType # NIL THEN
  10314. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10315. ELSE
  10316. DeclarationName(record.typeDeclaration,recordName);
  10317. END;
  10318. i := 0;
  10319. Info(section,recordName);
  10320. WHILE recordName[i] # 0X DO
  10321. Char(section,recordName[i]); INC(i);
  10322. INC(size);
  10323. END;
  10324. Char(section,".");
  10325. INC(size);
  10326. END;
  10327. *)
  10328. String(section,name);
  10329. INC(size,Strings.Length(name)+1);
  10330. parameter := procedureType.firstParameter;
  10331. WHILE(parameter # NIL) DO
  10332. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10333. parameter := parameter.nextParameter;
  10334. END;
  10335. variable := procedure.procedureScope.firstVariable;
  10336. WHILE(variable # NIL) DO
  10337. WriteVariable(variable,FALSE);
  10338. variable := variable.nextVariable;
  10339. END;
  10340. END Procedure;
  10341. PROCEDURE Scope(s: Sections.Section);
  10342. BEGIN
  10343. Char(section,0F8X);
  10344. INC(size);
  10345. Symbol(section,s,0,0); (* start *)
  10346. INC(size,4);
  10347. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10348. INC(size,4);
  10349. String(section,"$$");
  10350. INC(size,3);
  10351. (* removed variables -- wrongly interpreted by Reflection
  10352. variable := module.module.moduleScope.firstVariable;
  10353. WHILE(variable # NIL) DO
  10354. WriteVariable(variable,FALSE);
  10355. variable := variable.nextVariable;
  10356. END;
  10357. *)
  10358. END Scope;
  10359. BEGIN
  10360. Array(section,sizePC,"");
  10361. size := 0;
  10362. Char(section,0FFX); (* sign for trap writer *)
  10363. INC(size);
  10364. FOR i := 0 TO module.allSections.Length() - 1 DO
  10365. s := module.allSections.GetSection(i);
  10366. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10367. Scope(s) (*! must be first procedure in ref section *)
  10368. END
  10369. END;
  10370. FOR i := 0 TO module.allSections.Length() - 1 DO
  10371. s := module.allSections.GetSection(i);
  10372. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10373. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10374. Procedure(s)
  10375. END
  10376. END;
  10377. PatchArray(section,sizePC,size);
  10378. END References;
  10379. (*
  10380. Command* = RECORD
  10381. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10382. name*: Name; (* name of the procedure *)
  10383. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10384. entryAdr* : ADDRESS; (* entry address of procedure *)
  10385. END;
  10386. *)
  10387. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10388. VAR
  10389. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10390. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10391. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10392. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10393. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10394. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10395. BEGIN
  10396. RETURN
  10397. (type = NIL) OR
  10398. (type.resolved IS SyntaxTree.RecordType) OR
  10399. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10400. (type.resolved IS SyntaxTree.AnyType);
  10401. END TypeAllowed;
  10402. BEGIN
  10403. numberParameters := procedureType.numberParameters;
  10404. RETURN
  10405. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10406. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10407. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10408. END GetProcedureAllowed;
  10409. PROCEDURE WriteType(type : SyntaxTree.Type);
  10410. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10411. name: Basic.SegmentedName; offset: LONGINT;
  10412. BEGIN
  10413. IF type = NIL THEN
  10414. Address(source,0);
  10415. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10416. Address(source,1);
  10417. ELSE
  10418. type := type.resolved;
  10419. IF type IS SyntaxTree.PointerType THEN
  10420. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10421. END;
  10422. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10423. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10424. name[0] := typeDeclaration.name; name[1] := -1;
  10425. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10426. ASSERT(section # NIL);
  10427. ELSE
  10428. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10429. (* TODO *)
  10430. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10431. END;
  10432. IF implementationVisitor.backend.cooperative THEN
  10433. offset := 0;
  10434. ELSE
  10435. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10436. END;
  10437. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10438. END;
  10439. END WriteType;
  10440. BEGIN
  10441. Info(source, "command array descriptor");
  10442. Array(source,sizePC,"Modules.Command");
  10443. numberCommands := 0;
  10444. Info(source, "command array content");
  10445. FOR i := 0 TO module.allSections.Length() - 1 DO
  10446. p := module.allSections.GetSection(i);
  10447. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10448. procedure := p.symbol(SyntaxTree.Procedure);
  10449. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10450. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10451. procedure.GetName(name);
  10452. Name(source,name);
  10453. numberParameters := procedureType.numberParameters;
  10454. (* offset of type of first parameter *)
  10455. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10456. ELSE WriteType(procedureType.firstParameter.type)
  10457. END;
  10458. (* offset of type of return parameter *)
  10459. WriteType(procedureType.returnType);
  10460. (* command name *)
  10461. (* command code offset *)
  10462. Symbol(source,p,0,0);
  10463. INC(numberCommands);
  10464. IF Trace THEN
  10465. D.Ln;
  10466. END;
  10467. END;
  10468. END
  10469. END;
  10470. PatchArray(source,sizePC,numberCommands);
  10471. END CommandArray;
  10472. (* to prevent from double import of different module aliases *)
  10473. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10474. VAR i: SyntaxTree.Import;
  10475. BEGIN
  10476. i := module.module.moduleScope.firstImport;
  10477. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10478. i := i.nextImport;
  10479. END;
  10480. RETURN i = import
  10481. END IsFirstDirectOccurence;
  10482. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10483. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10484. BEGIN
  10485. Array(source,pc,"");
  10486. Info(source, "import module array data");
  10487. IF implementationVisitor.backend.cooperative THEN
  10488. offset := 0;
  10489. ELSE
  10490. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10491. END;
  10492. import := module.module.moduleScope.firstImport;
  10493. numberImports := 0;
  10494. WHILE import # NIL DO
  10495. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10496. Global.GetModuleSegmentedName(import.module,name);
  10497. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10498. NamedSymbol(source, name, NIL, 0, offset);
  10499. INC(numberImports);
  10500. END;
  10501. import := import.nextImport
  10502. END;
  10503. PatchArray(source,pc,numberImports);
  10504. END ImportsArray;
  10505. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10506. VAR
  10507. p: Sections.Section; sizePC, size, i: LONGINT;
  10508. BEGIN
  10509. Info(source, "Type info section");
  10510. size := 0;
  10511. Array(source,sizePC,"Modules.TypeDesc");
  10512. FOR i := 0 TO module.allSections.Length() - 1 DO
  10513. p := module.allSections.GetSection(i);
  10514. WITH p: IntermediateCode.Section DO
  10515. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10516. Symbol(source,p,0,0);
  10517. INC(size);
  10518. END;
  10519. END
  10520. END;
  10521. PatchArray(source,sizePC,size);
  10522. END TypeInfoSection;
  10523. (*
  10524. ProcTableEntry* = RECORD
  10525. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10526. noPtr*: LONGINT;
  10527. END;
  10528. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10529. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10530. *)
  10531. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10532. VAR
  10533. destination: Sections.Section;
  10534. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10535. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10536. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10537. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10538. BEGIN
  10539. Info(procArray,"pcFrom");
  10540. Symbol(procArray,destination,0,0);
  10541. Info(procArray,"pcTo");
  10542. Symbol(procArray,destination,destination.pc,0);
  10543. Info(procArray,"pcStatementBegin");
  10544. Symbol(procArray,destination,destination.validPAFEnter,0);
  10545. Info(procArray,"pcStatementEnd");
  10546. Symbol(procArray,destination,destination.validPAFExit,0);
  10547. IF ~implementationVisitor.backend.cooperative THEN
  10548. Basic.SegmentedNameToString(destination.name, string);
  10549. Info(pointerArray,string);
  10550. procedure := destination.symbol(SyntaxTree.Procedure);
  10551. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10552. variable := procedure.procedureScope.firstVariable;
  10553. WHILE(variable # NIL) DO
  10554. IF ~(variable.untraced) THEN
  10555. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10556. END;
  10557. variable := variable.nextVariable
  10558. END;
  10559. parameter := procedureType.firstParameter;
  10560. WHILE(parameter # NIL) DO
  10561. IF ~(parameter.untraced) THEN
  10562. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10563. END;
  10564. parameter := parameter.nextParameter;
  10565. END;
  10566. END;
  10567. Info(procArray,"numberPointers");
  10568. Longint(procArray,numberPointers);
  10569. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10570. INC(pointerArraySize, numberPointers);
  10571. END PointerOffsets;
  10572. BEGIN
  10573. maxPointers := 0;
  10574. Info(procArray, "proc array descriptor");
  10575. Address(procArray,0);
  10576. Address(procArray,0);
  10577. Address(procArray,0);
  10578. procArraySizePC := procArray.pc;
  10579. Address(procArray,0);
  10580. procArraySize := 0;
  10581. IF ~implementationVisitor.backend.cooperative THEN
  10582. Info(pointerArray, "pointer array descriptor");
  10583. Address(pointerArray,0);
  10584. Address(pointerArray,0);
  10585. Address(pointerArray,0);
  10586. pointerArraySizePC := pointerArray.pc;
  10587. Address(pointerArray,0);
  10588. pointerArraySize := 0;
  10589. END;
  10590. procArraySize := 0;
  10591. FOR i := 0 TO module.allSections.Length() - 1 DO
  10592. destination := module.allSections.GetSection(i);
  10593. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10594. PointerOffsets(destination(IntermediateCode.Section));
  10595. INC(procArraySize);
  10596. END
  10597. END;
  10598. PatchLongint(procArray,procArraySizePC,procArraySize);
  10599. IF ~implementationVisitor.backend.cooperative THEN
  10600. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10601. END;
  10602. END PointersInProcTables;
  10603. (*
  10604. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10605. VAR
  10606. next*: Module; (** once a module is published, all fields are read-only *)
  10607. name*: Name;
  10608. init, published: BOOLEAN;
  10609. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10610. sb*: ADDRESS; <- set to beginning of data section by loader
  10611. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10612. command*: POINTER TO ARRAY OF Command;
  10613. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10614. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10615. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10616. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10617. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10618. data*, code*: Bytes;
  10619. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10620. export*: ExportDesc;
  10621. term*: TerminationHandler;
  10622. exTable*: ExceptionTable;
  10623. noProcs*: LONGINT;
  10624. firstProc*: ADDRESS; <- done by loader
  10625. maxPtrs*: LONGINT;
  10626. crc*: LONGINT;
  10627. *)
  10628. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10629. BEGIN
  10630. Info(section, "cycle");
  10631. Size(section,0);
  10632. Info(section, "references");
  10633. Size(section,0);
  10634. Info(section, "nextMarked");
  10635. Address(section,0);
  10636. Info(section, "nextWatched");
  10637. Address(section,0);
  10638. END BasePointer;
  10639. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10640. BEGIN
  10641. BasePointer(section);
  10642. Info(section, "action");
  10643. Address(section,0);
  10644. Info(section, "monitor");
  10645. Address(section,0);
  10646. END BaseObject;
  10647. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10648. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10649. pooledName: Basic.SegmentedName;
  10650. symbol: SyntaxTree.Symbol;
  10651. BEGIN
  10652. Global.GetModuleName(module.module,name);
  10653. Strings.Append(name,".@Module.@Descriptor");
  10654. Basic.ToSegmentedName(name, pooledName);
  10655. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10656. Symbol(section,descriptorSection,0,0);
  10657. Info(descriptorSection, "descriptor");
  10658. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10659. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10660. Address(descriptorSection,0);
  10661. Global.GetModuleName(module.module,name);
  10662. Strings.Append(name,".@Trace");
  10663. Basic.ToSegmentedName(name, pooledName);
  10664. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10665. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10666. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10667. END ModuleDescriptor;
  10668. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10669. VAR name: ARRAY 128 OF CHAR;
  10670. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10671. symbol: SyntaxTree.Symbol;
  10672. BEGIN
  10673. Global.GetModuleName(module.module,name);
  10674. Strings.Append(name,".@Module");
  10675. Basic.ToSegmentedName(name, pooledName);
  10676. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10677. moduleSection.SetExported(TRUE);
  10678. IF moduleSection.pc = 0 THEN
  10679. IF implementationVisitor.backend.cooperative THEN
  10680. Info(moduleSection, "descriptor");
  10681. ModuleDescriptor(moduleSection);
  10682. BaseObject(moduleSection);
  10683. implementationVisitor.CreateTraceModuleMethod(module.module);
  10684. ELSE
  10685. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10686. Info(moduleSection, "HeapBlock");
  10687. Symbol(moduleSection,moduleSection,2,0);
  10688. Info(moduleSection, "TypeDescriptor");
  10689. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10690. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10691. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10692. END;
  10693. END;
  10694. RETURN moduleSection;
  10695. END ModuleSection;
  10696. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10697. VAR
  10698. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10699. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10700. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10701. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10702. referenceSectionOffset : LONGINT;
  10703. BEGIN
  10704. Global.GetModuleName(module.module,moduleName);
  10705. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10706. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10707. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10708. ImportsArray(importSection);
  10709. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10710. CommandArray(commandsSection);
  10711. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10712. ExceptionArray(exceptionSection);
  10713. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10714. TypeInfoSection(typeInfoSection);
  10715. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10716. References(referenceSection);
  10717. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10718. IF ~implementationVisitor.backend.cooperative THEN
  10719. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10720. ELSE
  10721. ptrTableSection := NIL;
  10722. END;
  10723. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10724. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10725. Array(emptyArraySection,temp,"");
  10726. moduleSection := ModuleSection();
  10727. Info(moduleSection, "nextRoot*: RootObject");
  10728. Address(moduleSection,0);
  10729. Info(moduleSection, "next*: Module");
  10730. Address(moduleSection,0);
  10731. Info(moduleSection, "name*: Name");
  10732. Name(moduleSection,moduleName);
  10733. Info(moduleSection, "init, published: BOOLEAN");
  10734. Boolean(moduleSection,FALSE);
  10735. Boolean(moduleSection,FALSE);
  10736. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10737. Boolean(moduleSection,FALSE);
  10738. Boolean(moduleSection,FALSE);
  10739. Info(moduleSection, "refcnt*: LONGINT");
  10740. Longint(moduleSection,0);
  10741. Info(moduleSection, "sb*: ADDRESS");
  10742. Address(moduleSection,0);
  10743. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10744. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10745. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10746. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10747. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10748. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10749. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10750. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10751. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10752. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10753. Info(moduleSection, "procTable*: ProcTable");
  10754. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10755. Info(moduleSection, "ptrTable*: PtrTable");
  10756. IF ~implementationVisitor.backend.cooperative THEN
  10757. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10758. ELSE
  10759. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10760. END;
  10761. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10762. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10763. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10764. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10765. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10766. Info(moduleSection, "export*: ExportDesc");
  10767. ExportDesc(moduleSection);
  10768. Info(moduleSection, "term*: TerminationHandler");
  10769. Address(moduleSection,0);
  10770. Info(moduleSection, "exTable*: ExceptionTable");
  10771. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10772. Info(moduleSection, "noProcs*: LONGINT");
  10773. Longint(moduleSection,numberProcs);
  10774. Info(moduleSection, "firstProc*: ADDRESS");
  10775. Address(moduleSection,0);
  10776. Info(moduleSection, "maxPtrs*: LONGINT");
  10777. Longint(moduleSection,maxPointers);
  10778. Info(moduleSection, "crc*: LONGINT");
  10779. Longint(moduleSection, 0); (*! must be implemented *)
  10780. Info(moduleSection, "body*: ADDRESS");
  10781. Symbol(moduleSection, bodyProc, 0,0);
  10782. IF implementationVisitor.backend.cooperative THEN
  10783. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10784. Info(moduleSection, "monitor.owner");
  10785. Address(moduleSection,0);
  10786. Info(moduleSection, "monitor.nestingLevel");
  10787. Address(moduleSection,0);
  10788. Info(moduleSection, "monitor.blockedQueue");
  10789. Address(moduleSection,0); Address(moduleSection,0);
  10790. Info(moduleSection, "monitor.waitingQueue");
  10791. Address(moduleSection,0); Address(moduleSection,0);
  10792. Info(moduleSection, "monitor.waitingSentinel");
  10793. Address(moduleSection,0);
  10794. END;
  10795. END Module;
  10796. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10797. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10798. BEGIN
  10799. Array(source,pc,"");
  10800. Info(source, "pointer offsets array data");
  10801. IF scope IS SyntaxTree.RecordScope THEN
  10802. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10803. ELSIF scope IS SyntaxTree.CellScope THEN
  10804. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10805. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10806. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10807. WHILE variable # NIL DO
  10808. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10809. symbol := module.allSections.FindBySymbol(variable);
  10810. ASSERT(symbol # NIL);
  10811. Pointers(0,symbol, source,variable.type,numberPointers);
  10812. END;
  10813. variable := variable.nextVariable;
  10814. END;
  10815. END;
  10816. PatchArray(source,pc,numberPointers);
  10817. END PointerArray;
  10818. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  10819. VAR recordType: SyntaxTree.RecordType;
  10820. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  10821. section: Sections.Section; type: SyntaxTree.Type; cellType: SyntaxTree.CellType;
  10822. PROCEDURE FieldArray(source: IntermediateCode.Section);
  10823. VAR variable: SyntaxTree.Variable; pc, offset: LONGINT; tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  10824. segmentedName: Basic.SegmentedName;
  10825. td: SyntaxTree.TypeDeclaration;
  10826. BEGIN
  10827. Array(source,pc,"Modules.FieldEntry");
  10828. Info(source, "FieldArray");
  10829. IF x IS SyntaxTree.RecordType THEN
  10830. variable := x(SyntaxTree.RecordType).recordScope.firstVariable
  10831. ELSE
  10832. variable := NIL;
  10833. END;
  10834. size :=0;
  10835. WHILE variable # NIL DO
  10836. type := variable.type.resolved;
  10837. Info(source,"offset");
  10838. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  10839. Info(source,"type class");
  10840. IF type IS SyntaxTree.PointerType THEN
  10841. Size(source, 1);
  10842. ELSIF type IS SyntaxTree.RecordType THEN
  10843. Size(source, 2);
  10844. ELSIF type IS SyntaxTree.NumberType THEN
  10845. Size(source, 3);
  10846. ELSE
  10847. Size(source, 0);
  10848. END;
  10849. Info(source, "type desc");
  10850. IF type IS SyntaxTree.RecordType THEN
  10851. td := type(SyntaxTree.RecordType).typeDeclaration;
  10852. Global.GetSymbolSegmentedName(td,segmentedName);
  10853. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  10854. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  10855. ELSE
  10856. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  10857. END;
  10858. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  10859. Symbol(source, tir, 0, offset);
  10860. ELSE
  10861. Address(source, 0);
  10862. END;
  10863. Info(source,"flags");
  10864. Set(source, {});
  10865. Info(source,"name");
  10866. variable.GetName(name);
  10867. LongName(source, name);
  10868. variable := variable.nextVariable;
  10869. INC(size);
  10870. END;
  10871. PatchArray(source,pc,size);
  10872. END FieldArray;
  10873. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  10874. VAR name: Basic.SegmentedName;source, fieldSection: IntermediateCode.Section;
  10875. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  10876. sectionName: Basic.SectionName;
  10877. CONST MPO=-40000000H;
  10878. BEGIN
  10879. (*
  10880. TypeDesc* = POINTER TO RECORD
  10881. descSize: LONGINT;
  10882. sentinel: LONGINT; (* = MPO-4 *)
  10883. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  10884. flags*: SET;
  10885. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  10886. name*: Name;
  10887. END;
  10888. *)
  10889. (* source := module.sections.FindByName(...) *)
  10890. Global.GetSymbolSegmentedName(td,name);
  10891. Basic.AppendToSegmentedName(name,"@Info");
  10892. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  10893. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  10894. Address(source,MPO-4);
  10895. Info(source, "type tag pointer");
  10896. Symbol( source, tag, offset, 0);
  10897. Info(source, "type flags");
  10898. flags := {};
  10899. IF isProtected THEN INCL(flags,31) END;
  10900. Set( source, flags);
  10901. Info(source, "pointer to module");
  10902. moduleSection := ModuleSection();
  10903. Symbol( source, moduleSection, moduleSection.pc,0);
  10904. Info(source, "type name");
  10905. i := 0;
  10906. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  10907. (*
  10908. Global.GetSymbolSegmentedName(td,name);
  10909. Basic.SegmentedNameToString(name, sectionName);
  10910. *)
  10911. Name(source,sectionName);
  10912. source.SetReferenced(FALSE);
  10913. Global.GetSymbolSegmentedName(td,name);
  10914. Basic.AppendToSegmentedName(name,"@Fields");
  10915. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  10916. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  10917. Info(fieldSection, "HeapBlock");
  10918. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  10919. Info(fieldSection, "TypeDescriptor");
  10920. Address(fieldSection,0);
  10921. Info(source, "FieldArray ref");
  10922. Symbol(source, fieldSection, fieldSection.pc, 0);
  10923. FieldArray(fieldSection);
  10924. RETURN source;
  10925. END NewTypeDescriptorInfo;
  10926. PROCEDURE NewTypeDescriptor;
  10927. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  10928. procedure: SyntaxTree.Procedure;
  10929. baseRecord: SyntaxTree.RecordType; baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  10930. numberPointers: LONGINT; padding,offset, i: LONGINT;
  10931. CONST MPO=-40000000H;
  10932. PROCEDURE TdTable(size: LONGINT);
  10933. VAR i: LONGINT;
  10934. BEGIN
  10935. Info(source, "tag table");
  10936. baseRecord := recordType;
  10937. i := 0;
  10938. WHILE baseRecord # NIL DO
  10939. INC(i);
  10940. baseRecord := baseRecord.GetBaseRecord();
  10941. END;
  10942. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  10943. WHILE i < size DO
  10944. Address(source,0);
  10945. INC(i);
  10946. END;
  10947. baseRecord := recordType;
  10948. WHILE baseRecord # NIL DO
  10949. baseTD := baseRecord.typeDeclaration;
  10950. Global.GetSymbolSegmentedName(baseTD,name);
  10951. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  10952. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  10953. ELSE
  10954. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  10955. END;
  10956. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*module.system.addressSize);
  10957. Symbol(source, tir, 0, offset);
  10958. baseRecord := baseRecord.GetBaseRecord();
  10959. END;
  10960. END TdTable;
  10961. PROCEDURE MethodTable;
  10962. VAR i,methods: LONGINT;
  10963. BEGIN
  10964. Info(source, "method table");
  10965. IF recordType # NIL THEN
  10966. methods := recordType.recordScope.numberMethods;
  10967. FOR i := methods-1 TO 0 BY -1 DO
  10968. procedure := recordType.recordScope.FindMethod(i);
  10969. Global.GetSymbolSegmentedName(procedure, name);
  10970. NamedSymbol(source, name,procedure, 0,0);
  10971. END;
  10972. END;
  10973. END MethodTable;
  10974. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  10975. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  10976. BEGIN
  10977. Info(source, "method table");
  10978. baseRecord := recordType;
  10979. WHILE baseRecord.baseType # NIL DO
  10980. baseRecord := baseRecord.GetBaseRecord ();
  10981. END;
  10982. GetRecordTypeName (baseRecord, name);
  10983. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  10984. IF name = stackFrame THEN
  10985. start := 0;
  10986. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  10987. baseRecord := recordType;
  10988. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  10989. baseRecord := baseRecord.GetBaseRecord ();
  10990. END;
  10991. IF baseRecord # NIL THEN
  10992. GetRecordTypeName (baseRecord, name);
  10993. IF pointer & ~baseRecord.isObject THEN
  10994. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  10995. END;
  10996. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  10997. ELSIF recordType.isObject THEN
  10998. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  10999. ELSIF pointer THEN
  11000. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11001. ELSE
  11002. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11003. END;
  11004. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11005. Symbol(source, tir, 0, 0);
  11006. start := 0;
  11007. baseRecord := recordType;
  11008. WHILE (baseRecord # NIL) DO
  11009. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11010. baseRecord := baseRecord.GetBaseRecord ();
  11011. END;
  11012. ELSE
  11013. (* explicit trace method: *)
  11014. procedure := recordType.recordScope.FindMethod(0);
  11015. IF ~procedure.isFinalizer THEN
  11016. Global.GetSymbolSegmentedName(procedure, name);
  11017. NamedSymbol(source, name,procedure, 0,0);
  11018. END;
  11019. start := 1;
  11020. END;
  11021. IF (name # stackFrame) & recordType.isObject THEN
  11022. baseRecord := recordType;
  11023. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11024. baseRecord := baseRecord.GetBaseRecord ();
  11025. END;
  11026. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11027. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11028. ELSE
  11029. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11030. END;
  11031. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11032. Symbol(source, tir, 0, 0);
  11033. END;
  11034. methods := recordType.recordScope.numberMethods;
  11035. FOR i := start TO methods-1 DO
  11036. procedure := recordType.recordScope.FindMethod(i);
  11037. IF ~procedure.isFinalizer THEN
  11038. Global.GetSymbolSegmentedName(procedure, name);
  11039. NamedSymbol(source, name,procedure, 0,0);
  11040. END;
  11041. END;
  11042. END CooperativeMethodTable;
  11043. BEGIN
  11044. Global.GetSymbolSegmentedName(td,name);
  11045. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11046. source.SetExported(IsExported(td));
  11047. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11048. IF implementationVisitor.backend.cooperative THEN
  11049. base := NIL;
  11050. baseRecord := recordType.GetBaseRecord();
  11051. IF baseRecord # NIL THEN
  11052. baseTD := baseRecord.typeDeclaration;
  11053. END;
  11054. IF ~recordType.isObject THEN
  11055. Info(source, "parent");
  11056. IF baseRecord # NIL THEN
  11057. Global.GetSymbolSegmentedName(baseTD,name);
  11058. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11059. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11060. ELSE
  11061. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11062. END;
  11063. Symbol(source, tir, 0, 0);
  11064. ELSE
  11065. Address(source,0);
  11066. END;
  11067. Info(source, "record size");
  11068. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11069. source.SetReferenced(FALSE);
  11070. CooperativeMethodTable(FALSE);
  11071. base := source;
  11072. Global.GetSymbolSegmentedName(td,name);
  11073. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11074. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11075. source.SetExported(IsExported(td));
  11076. source.SetReferenced(FALSE);
  11077. END;
  11078. Info(source, "parent");
  11079. IF baseRecord # NIL THEN
  11080. Global.GetSymbolSegmentedName(baseTD,name);
  11081. sym := baseTD;
  11082. IF ~recordType.isObject THEN
  11083. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11084. sym := NIL;
  11085. END;
  11086. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11087. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11088. ELSE
  11089. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11090. END;
  11091. Symbol(source, tir, 0, 0);
  11092. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11093. Address(source,0);
  11094. ELSE
  11095. IF recordType.isObject THEN
  11096. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11097. ELSE
  11098. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11099. END;
  11100. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11101. Symbol(source, tir, 0, 0);
  11102. END;
  11103. Info(source, "base record descriptor");
  11104. Symbol(source, base, 0, 0);
  11105. CooperativeMethodTable(TRUE);
  11106. source.SetReferenced(FALSE);
  11107. IF recordType.hasPointers THEN
  11108. IF ~HasExplicitTraceMethod (recordType) THEN
  11109. implementationVisitor.CreateTraceMethod(recordType);
  11110. END;
  11111. implementationVisitor.CreateResetProcedure(recordType);
  11112. implementationVisitor.CreateAssignProcedure(recordType);
  11113. END;
  11114. ELSIF ~simple THEN
  11115. (*
  11116. MethodEnd = MPO
  11117. ---
  11118. methods (# methods)
  11119. ---
  11120. tags (16)
  11121. ---
  11122. TypeDesc = TypeInfoAdr
  11123. ---
  11124. td adr ---> rec size
  11125. ----
  11126. pointer offsets
  11127. ----
  11128. (padding)
  11129. -----
  11130. empty [2 addresses aligned]
  11131. empty
  11132. empty
  11133. numPtrs
  11134. ---
  11135. pointer offsets
  11136. ---
  11137. *)
  11138. Info(source, "MethodEnd = MPO");
  11139. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11140. source(IntermediateCode.Section).Emit(Data(-1,op));
  11141. MethodTable;
  11142. TdTable(TypeTags);
  11143. Info(source, "type descriptor info pointer");
  11144. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11145. IF (cellType # NIL) THEN
  11146. IF cellType.sizeInBits < 0 THEN
  11147. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11148. END;
  11149. Info(source, "cell size");
  11150. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11151. ELSE
  11152. Info(source, "record size");
  11153. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11154. END;
  11155. Info(source, "pointer offsets pointer");
  11156. padding := 1- source.pc MOD 2;
  11157. Symbol(source, source, source.pc+1+padding,0);
  11158. IF padding >0 THEN
  11159. Info(source, "padding");
  11160. FOR i := 1 TO padding DO Address(source,0) END;
  11161. END;
  11162. IF cellType # NIL THEN
  11163. PointerArray(source, cellType.cellScope, numberPointers);
  11164. ELSE
  11165. PointerArray(source, recordType.recordScope, numberPointers);
  11166. END;
  11167. ELSE
  11168. (*
  11169. simple:
  11170. methods
  11171. tag(2)
  11172. tag(1)
  11173. td adr ---> tag(0)
  11174. td adr ---> size
  11175. *)
  11176. MethodTable;
  11177. TdTable(TypeTags);
  11178. Info(source, "record size");
  11179. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11180. source.SetReferenced(FALSE);
  11181. END;
  11182. END NewTypeDescriptor;
  11183. BEGIN
  11184. x := x.resolved;
  11185. IF (x IS SyntaxTree.PointerType) THEN
  11186. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11187. END;
  11188. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11189. recordType := x(SyntaxTree.RecordType);
  11190. td := x.typeDeclaration;
  11191. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11192. ASSERT(td # NIL);
  11193. section := module.allSections.FindBySymbol(td); (* TODO *)
  11194. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11195. IF implementationVisitor.newObjectFile THEN
  11196. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11197. NewTypeDescriptor
  11198. END;
  11199. ELSE
  11200. (* data section in intermediate code *)
  11201. Global.GetSymbolSegmentedName(td,name);
  11202. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11203. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11204. tir.Emit(Data(-1,op));
  11205. END;
  11206. END;
  11207. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11208. cellType := x(SyntaxTree.CellType);
  11209. td := x.typeDeclaration;
  11210. section := module.allSections.FindBySymbol(td); (* TODO *)
  11211. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11212. IF implementationVisitor.newObjectFile THEN
  11213. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11214. NewTypeDescriptor
  11215. END;
  11216. END;
  11217. END;
  11218. END
  11219. END CheckTypeDeclaration
  11220. END MetaDataGenerator;
  11221. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11222. VAR
  11223. trace-: BOOLEAN;
  11224. traceString-: SyntaxTree.IdentifierString;
  11225. traceModuleName-: SyntaxTree.IdentifierString;
  11226. newObjectFile-: BOOLEAN;
  11227. profile-: BOOLEAN;
  11228. noRuntimeChecks: BOOLEAN;
  11229. simpleMetaData-: BOOLEAN;
  11230. noAsserts: BOOLEAN;
  11231. optimize-: BOOLEAN;
  11232. cooperative-: BOOLEAN;
  11233. preregisterStatic-: BOOLEAN;
  11234. dump-: Basic.Writer;
  11235. cellsAreObjects: BOOLEAN;
  11236. PROCEDURE &InitIntermediateBackend*;
  11237. BEGIN
  11238. simpleMetaData := FALSE;
  11239. newObjectFile := FALSE;
  11240. InitBackend;
  11241. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11242. SetTraceModuleName(DefaultTraceModuleName);
  11243. END InitIntermediateBackend;
  11244. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11245. VAR
  11246. declarationVisitor: DeclarationVisitor;
  11247. implementationVisitor: ImplementationVisitor;
  11248. module: Sections.Module;
  11249. name, instructionSet, platformName: SyntaxTree.IdentifierString;
  11250. meta: MetaDataGenerator;
  11251. BEGIN
  11252. ResetError;
  11253. Global.GetSymbolName(x,name);
  11254. IF activeCellsSpecification # NIL THEN
  11255. GetDescription(instructionSet);
  11256. activeCellsSpecification.SetInstructionSet(instructionSet)
  11257. END;
  11258. NEW(module,x,system); (* backend structures *)
  11259. Global.GetModuleName(x, name);
  11260. module.SetModuleName(name);
  11261. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11262. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11263. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11264. declarationVisitor.Module(x,module);
  11265. IF newObjectFile & ~meta.simple THEN
  11266. meta.Module(implementationVisitor.moduleBodySection);
  11267. END;
  11268. GetDescription(platformName);
  11269. module.SetPlatformName(platformName);
  11270. RETURN module
  11271. END GenerateIntermediate;
  11272. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11273. BEGIN RETURN TRUE
  11274. END SupportedImmediate;
  11275. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11276. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11277. END ProcessSyntaxTreeModule;
  11278. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11279. VAR
  11280. result: Sections.Module;
  11281. traceName: Basic.MessageString;
  11282. BEGIN
  11283. ASSERT(intermediateCodeModule IS Sections.Module);
  11284. result := intermediateCodeModule(Sections.Module);
  11285. IF trace THEN
  11286. traceName := "intermediate code trace: ";
  11287. Strings.Append(traceName,traceString);
  11288. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11289. IF (traceString="") OR (traceString="*") THEN
  11290. result.Dump(dump);
  11291. dump.Update
  11292. ELSE
  11293. Sections.DumpFiltered(dump, result, traceString);
  11294. END
  11295. END;
  11296. RETURN result
  11297. END ProcessIntermediateCodeModule;
  11298. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11299. BEGIN instructionSet := "Intermediate";
  11300. END GetDescription;
  11301. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11302. BEGIN
  11303. SELF.newObjectFile := newObjectFile;
  11304. SELF.simpleMetaData := simpleMetaData;
  11305. END SetNewObjectFile;
  11306. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11307. BEGIN COPY(name, traceModuleName)
  11308. END SetTraceModuleName;
  11309. PROCEDURE DefineOptions(options: Options.Options);
  11310. BEGIN
  11311. DefineOptions^(options);
  11312. options.Add(0X,"trace",Options.String);
  11313. options.Add(0X,"runtime",Options.String);
  11314. options.Add(0X,"newObjectFile",Options.Flag);
  11315. options.Add(0X,"traceModule",Options.String);
  11316. options.Add(0X,"profile",Options.Flag);
  11317. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11318. options.Add(0X,"noAsserts",Options.Flag);
  11319. options.Add(0X,"metaData",Options.String);
  11320. options.Add('o',"optimize", Options.Flag);
  11321. options.Add(0X,"preregisterStatic", Options.Flag);
  11322. options.Add(0X,"cellsAreObjects", Options.Flag);
  11323. END DefineOptions;
  11324. PROCEDURE GetOptions(options: Options.Options);
  11325. VAR name,string: SyntaxTree.IdentifierString;
  11326. BEGIN
  11327. GetOptions^(options);
  11328. trace := options.GetString("trace",traceString);
  11329. profile := options.GetFlag("profile");
  11330. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11331. noAsserts := options.GetFlag("noAsserts");
  11332. cooperative := options.GetFlag("cooperative");
  11333. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11334. IF cooperative THEN
  11335. SetRuntimeModuleName("CPU") END
  11336. END;
  11337. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11338. simpleMetaData := TRUE
  11339. END;
  11340. IF options.GetString("metaData",string) THEN
  11341. IF string = "simple" THEN simpleMetaData := TRUE
  11342. ELSIF string ="full" THEN simpleMetaData := FALSE
  11343. END;
  11344. END;
  11345. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11346. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11347. optimize := options.GetFlag("optimize");
  11348. preregisterStatic := options.GetFlag("preregisterStatic");
  11349. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11350. END GetOptions;
  11351. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11352. BEGIN RETURN SymbolFileFormat.Get()
  11353. END DefaultSymbolFileFormat;
  11354. END IntermediateBackend;
  11355. (* ----------------------------------- register allocation ------------------------------------- *)
  11356. (* register mapping scheme
  11357. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11358. spill offset
  11359. part(n) --> ticket <--> physical register
  11360. spill offset
  11361. *)
  11362. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11363. emptyOperand: IntermediateCode.Operand;
  11364. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11365. statCoopResetVariables: LONGINT;
  11366. statCoopModifyAssignments: LONGINT;
  11367. modifyAssignmentsPC : LONGINT;
  11368. statCoopNilCheck: LONGINT;
  11369. statCoopSwitch: LONGINT;
  11370. statCoopAssignProcedure: LONGINT;
  11371. statCoopTraceMethod: LONGINT;
  11372. statCoopResetProcedure: LONGINT;
  11373. statCoopTraceModule: LONGINT;
  11374. PROCEDURE ResetStatistics*;
  11375. BEGIN
  11376. statCoopResetVariables := 0;
  11377. statCoopModifyAssignments := 0;
  11378. statCoopNilCheck:= 0;
  11379. statCoopSwitch:= 0;
  11380. statCoopAssignProcedure:= 0;
  11381. statCoopTraceMethod:= 0;
  11382. statCoopResetProcedure:= 0;
  11383. statCoopTraceModule:= 0;
  11384. END ResetStatistics;
  11385. PROCEDURE Statistics*;
  11386. BEGIN
  11387. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11388. TRACE(statCoopNilCheck, statCoopSwitch);
  11389. TRACE(statCoopAssignProcedure,
  11390. statCoopTraceMethod,
  11391. statCoopResetProcedure,
  11392. statCoopTraceModule)
  11393. END Statistics;
  11394. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11395. BEGIN
  11396. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11397. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11398. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11399. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11400. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11401. END
  11402. END PassBySingleReference;
  11403. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11404. BEGIN
  11405. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11406. END PassInRegister;
  11407. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11408. VAR new: RegisterEntry;
  11409. BEGIN
  11410. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11411. IF queue = NIL THEN
  11412. queue := new
  11413. ELSE
  11414. new.next := queue;
  11415. IF queue#NIL THEN queue.prev := new END;
  11416. queue := new
  11417. END;
  11418. END AddRegisterEntry;
  11419. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11420. VAR this: RegisterEntry;
  11421. BEGIN
  11422. this := queue;
  11423. WHILE (this # NIL) & (this.register # register) DO
  11424. this := this.next;
  11425. END;
  11426. IF this = NIL THEN
  11427. RETURN FALSE
  11428. END;
  11429. ASSERT(this # NIL);
  11430. IF this = queue THEN queue := queue.next END;
  11431. IF this.prev # NIL THEN this.prev.next := this.next END;
  11432. IF this.next # NIL THEN this.next.prev := this.prev END;
  11433. RETURN TRUE
  11434. END RemoveRegisterEntry;
  11435. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11436. BEGIN ASSERT(cond);
  11437. END Assert;
  11438. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11439. BEGIN
  11440. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11441. END ReusableRegister;
  11442. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11443. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11444. BEGIN
  11445. procedure := moduleScope.bodyProcedure;
  11446. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11447. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11448. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11449. procedure.SetScope(moduleScope);
  11450. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11451. procedure.SetAccess(SyntaxTree.Hidden);
  11452. moduleScope.SetBodyProcedure(procedure);
  11453. moduleScope.AddProcedure(procedure);
  11454. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11455. END;
  11456. END EnsureBodyProcedure;
  11457. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11458. VAR import: SyntaxTree.Import;
  11459. s: Basic.MessageString;
  11460. selfName: SyntaxTree.IdentifierString;
  11461. module: SyntaxTree.Module;
  11462. BEGIN
  11463. scope.ownerModule.GetName(selfName);
  11464. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11465. module := scope.ownerModule
  11466. ELSE
  11467. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11468. IF import = NIL THEN
  11469. RETURN NIL
  11470. ELSIF import.module = NIL THEN
  11471. RETURN NIL
  11472. ELSE module := import.module
  11473. END;
  11474. END;
  11475. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11476. END GetSymbol;
  11477. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11478. BEGIN
  11479. op.mode := mode;
  11480. IntermediateCode.InitOperand(op.op);
  11481. IntermediateCode.InitOperand(op.tag);
  11482. IntermediateCode.InitOperand(op.extra);
  11483. op.dimOffset := 0;
  11484. END InitOperand;
  11485. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11486. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11487. BEGIN RETURN IntermediateCode.GetType(system, type)
  11488. END GetType;
  11489. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11490. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11491. BEGIN
  11492. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11493. (*
  11494. UniqueId(name,module,name,adr);
  11495. *)
  11496. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11497. constant.SetValue(value);
  11498. module.moduleScope.AddConstant(constant);
  11499. constant.SetScope(module.moduleScope);
  11500. RETURN constant
  11501. END BuildConstant;
  11502. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11503. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11504. BEGIN
  11505. variable := scope.firstVariable;
  11506. WHILE variable # NIL DO
  11507. IF variable.NeedsTrace() THEN
  11508. RETURN TRUE;
  11509. END;
  11510. variable := variable.nextVariable;
  11511. END;
  11512. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11513. WHILE parameter # NIL DO
  11514. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11515. RETURN TRUE;
  11516. END;
  11517. parameter := parameter.nextParameter;
  11518. END;
  11519. RETURN FALSE;
  11520. END HasPointers;
  11521. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11522. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11523. END IsVariableParameter;
  11524. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11525. VAR parameter: SyntaxTree.Parameter;
  11526. BEGIN
  11527. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11528. WHILE parameter # NIL DO
  11529. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11530. IF parameter.movable THEN RETURN TRUE END;
  11531. parameter := parameter.nextParameter;
  11532. END;
  11533. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11534. END HasVariableParameters;
  11535. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11536. BEGIN
  11537. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11538. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11539. END HasExplicitTraceMethod;
  11540. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11541. BEGIN
  11542. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11543. IF (expression IS SyntaxTree.IntegerValue) THEN
  11544. val := expression(SyntaxTree.IntegerValue).value;
  11545. RETURN TRUE
  11546. ELSE
  11547. RETURN FALSE
  11548. END;
  11549. END IsIntegerConstant;
  11550. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11551. BEGIN
  11552. IF val <= 0 THEN RETURN FALSE END;
  11553. exp := 0;
  11554. WHILE ~ODD(val) DO
  11555. val := val DIV 2;
  11556. INC(exp)
  11557. END;
  11558. RETURN val = 1
  11559. END PowerOf2;
  11560. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11561. VAR procedure: SyntaxTree.Procedure;
  11562. BEGIN
  11563. procedure := record.recordScope.constructor;
  11564. IF procedure = NIL THEN
  11565. record := record.GetBaseRecord();
  11566. IF record # NIL THEN
  11567. procedure := GetConstructor(record)
  11568. END;
  11569. END;
  11570. RETURN procedure;
  11571. END GetConstructor;
  11572. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11573. BEGIN
  11574. value := SHORT(op.intValue);
  11575. RETURN op.mode = IntermediateCode.ModeImmediate;
  11576. END IsIntegerImmediate;
  11577. (** whether a type strictily is a pointer to record or object type
  11578. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11579. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11580. BEGIN
  11581. IF type = NIL THEN
  11582. RETURN FALSE
  11583. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11584. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11585. ELSE
  11586. RETURN FALSE
  11587. END
  11588. END IsStrictlyPointerToRecord;
  11589. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11590. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11591. END IsUnsafePointer;
  11592. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11593. BEGIN type := type.resolved;
  11594. IF type IS SyntaxTree.PointerType THEN
  11595. type := type(SyntaxTree.PointerType).pointerBase;
  11596. type := type.resolved;
  11597. IF type IS SyntaxTree.RecordType THEN
  11598. recordType := type(SyntaxTree.RecordType);
  11599. RETURN TRUE
  11600. ELSE
  11601. RETURN FALSE
  11602. END
  11603. ELSIF type IS SyntaxTree.RecordType THEN
  11604. recordType := type(SyntaxTree.RecordType);
  11605. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11606. ELSIF type IS SyntaxTree.ObjectType THEN
  11607. RETURN TRUE
  11608. ELSIF type IS SyntaxTree.AnyType THEN
  11609. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11610. ELSE
  11611. RETURN FALSE
  11612. END;
  11613. END IsPointerToRecord;
  11614. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11615. BEGIN
  11616. type := type.resolved;
  11617. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11618. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11619. END IsArrayOfSystemByte;
  11620. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11621. BEGIN
  11622. IF type = NIL THEN RETURN FALSE END;
  11623. type := type.resolved;
  11624. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11625. END IsOpenArray;
  11626. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11627. BEGIN
  11628. IF type = NIL THEN RETURN FALSE END;
  11629. type := type.resolved;
  11630. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11631. END IsStaticArray;
  11632. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11633. VAR size: LONGINT;
  11634. BEGIN
  11635. size := 1;
  11636. WHILE (IsStaticArray(type)) DO
  11637. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11638. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11639. END;
  11640. RETURN size;
  11641. END StaticArrayNumElements;
  11642. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11643. BEGIN
  11644. WHILE (IsStaticArray(type)) DO
  11645. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11646. END;
  11647. RETURN type;
  11648. END StaticArrayBaseType;
  11649. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11650. BEGIN
  11651. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11652. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11653. END;
  11654. RETURN type;
  11655. END ArrayBaseType;
  11656. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11657. BEGIN
  11658. IF type = NIL THEN RETURN FALSE END;
  11659. type := type.resolved;
  11660. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11661. END IsDelegate;
  11662. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11663. VAR i: LONGINT;
  11664. BEGIN
  11665. i := 0; type := type.resolved;
  11666. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11667. INC(i);
  11668. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11669. END;
  11670. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11671. INC(i);
  11672. type := type(SyntaxTree.MathArrayType).arrayBase;
  11673. IF type # NIL THEN type := type.resolved END;
  11674. END;
  11675. RETURN i
  11676. END DynamicDim;
  11677. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  11678. BEGIN
  11679. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11680. type := type(SyntaxTree.ArrayType).arrayBase;
  11681. END;
  11682. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11683. type := type(SyntaxTree.MathArrayType).arrayBase;
  11684. END;
  11685. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  11686. END StaticSize;
  11687. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  11688. BEGIN
  11689. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  11690. END IsImmediate;
  11691. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  11692. BEGIN
  11693. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  11694. END IsAddress;
  11695. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  11696. BEGIN
  11697. RETURN (x.mode = IntermediateCode.ModeRegister);
  11698. END IsRegister;
  11699. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  11700. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  11701. BEGIN
  11702. typeDeclaration := recordType.typeDeclaration;
  11703. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11704. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11705. END GetRecordTypeName;
  11706. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  11707. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  11708. BEGIN
  11709. parSize := 0;
  11710. IF StructuredReturnType(procedureType) THEN
  11711. parameter := procedureType.returnParameter;
  11712. INC(parSize,system.SizeOfParameter(parameter));
  11713. parSize := parSize + (-parSize) MOD system.addressSize;
  11714. END;
  11715. parameter :=procedureType.lastParameter;
  11716. WHILE (parameter # NIL) DO
  11717. INC(parSize,system.SizeOfParameter(parameter));
  11718. parSize := parSize + (-parSize) MOD system.addressSize;
  11719. parameter := parameter.prevParameter;
  11720. END;
  11721. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  11722. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  11723. RETURN ToMemoryUnits(system,parSize)
  11724. END ParametersSize;
  11725. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  11726. BEGIN
  11727. IF type = NIL THEN RETURN FALSE
  11728. ELSE
  11729. type := type.resolved;
  11730. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  11731. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  11732. END
  11733. END ReturnedAsParameter;
  11734. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  11735. BEGIN
  11736. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  11737. END StructuredReturnType;
  11738. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  11739. BEGIN
  11740. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  11741. END IsNested;
  11742. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  11743. BEGIN
  11744. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  11745. scope := scope.outerScope;
  11746. END;
  11747. RETURN scope # NIL;
  11748. END InCellScope;
  11749. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  11750. BEGIN
  11751. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  11752. RETURN 0
  11753. ELSE
  11754. *)
  11755. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  11756. (*END;*)
  11757. END ProcedureParametersSize;
  11758. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  11759. VAR dataUnit: LONGINT;
  11760. BEGIN dataUnit := system.dataUnit;
  11761. ASSERT(size MOD system.dataUnit = 0);
  11762. RETURN size DIV system.dataUnit
  11763. END ToMemoryUnits;
  11764. PROCEDURE Get*(): Backend.Backend;
  11765. VAR backend: IntermediateBackend;
  11766. BEGIN NEW(backend); RETURN backend
  11767. END Get;
  11768. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  11769. VAR instruction: IntermediateCode.Instruction;
  11770. BEGIN
  11771. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  11772. RETURN instruction
  11773. END Nop;
  11774. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11775. VAR instruction: IntermediateCode.Instruction;
  11776. BEGIN
  11777. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  11778. RETURN instruction
  11779. END Mov;
  11780. (* like Mov but ensures that no new register will be allocated for dest *)
  11781. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11782. VAR instruction: IntermediateCode.Instruction;
  11783. BEGIN
  11784. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  11785. RETURN instruction
  11786. END MovReplace;
  11787. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11788. VAR instruction: IntermediateCode.Instruction;
  11789. BEGIN
  11790. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  11791. RETURN instruction
  11792. END Conv;
  11793. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  11794. VAR instruction: IntermediateCode.Instruction;
  11795. BEGIN
  11796. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  11797. RETURN instruction
  11798. END Call;
  11799. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  11800. VAR op1, op2: IntermediateCode.Operand;
  11801. VAR instruction: IntermediateCode.Instruction;
  11802. BEGIN
  11803. IntermediateCode.InitNumber(op1,pcOffset);
  11804. IntermediateCode.InitNumber(op2,callingConvention);
  11805. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  11806. RETURN instruction
  11807. END Exit;
  11808. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11809. VAR instruction: IntermediateCode.Instruction;
  11810. BEGIN
  11811. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  11812. RETURN instruction
  11813. END Return;
  11814. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11815. VAR instruction: IntermediateCode.Instruction;
  11816. BEGIN
  11817. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  11818. RETURN instruction
  11819. END Result;
  11820. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  11821. VAR op1: IntermediateCode.Operand;
  11822. VAR instruction: IntermediateCode.Instruction;
  11823. BEGIN
  11824. IntermediateCode.InitNumber(op1,nr);
  11825. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  11826. RETURN instruction
  11827. END Trap;
  11828. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  11829. VAR instruction: IntermediateCode.Instruction;
  11830. BEGIN
  11831. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  11832. RETURN instruction
  11833. END Br;
  11834. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11835. VAR instruction: IntermediateCode.Instruction;
  11836. BEGIN
  11837. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  11838. RETURN instruction
  11839. END Breq;
  11840. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11841. VAR instruction: IntermediateCode.Instruction;
  11842. BEGIN
  11843. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  11844. RETURN instruction
  11845. END Brne;
  11846. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11847. VAR instruction: IntermediateCode.Instruction;
  11848. BEGIN
  11849. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  11850. RETURN instruction
  11851. END Brge;
  11852. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11853. VAR instruction: IntermediateCode.Instruction;
  11854. BEGIN
  11855. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  11856. RETURN instruction
  11857. END Brlt;
  11858. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  11859. VAR instruction: IntermediateCode.Instruction;
  11860. BEGIN
  11861. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  11862. RETURN instruction
  11863. END Pop;
  11864. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  11865. VAR instruction: IntermediateCode.Instruction;
  11866. BEGIN
  11867. ASSERT(op.mode # IntermediateCode.Undefined);
  11868. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  11869. RETURN instruction
  11870. END Push;
  11871. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11872. VAR instruction: IntermediateCode.Instruction;
  11873. BEGIN
  11874. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  11875. RETURN instruction
  11876. END Neg;
  11877. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11878. VAR instruction: IntermediateCode.Instruction;
  11879. BEGIN
  11880. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  11881. RETURN instruction
  11882. END Not;
  11883. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11884. VAR instruction: IntermediateCode.Instruction;
  11885. BEGIN
  11886. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  11887. RETURN instruction
  11888. END Abs;
  11889. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11890. VAR instruction: IntermediateCode.Instruction;
  11891. BEGIN
  11892. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  11893. RETURN instruction
  11894. END Mul;
  11895. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11896. VAR instruction: IntermediateCode.Instruction;
  11897. BEGIN
  11898. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  11899. RETURN instruction
  11900. END Div;
  11901. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11902. VAR instruction: IntermediateCode.Instruction;
  11903. BEGIN
  11904. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  11905. RETURN instruction
  11906. END Mod;
  11907. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11908. VAR instruction: IntermediateCode.Instruction;
  11909. BEGIN
  11910. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  11911. RETURN instruction
  11912. END Sub;
  11913. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11914. VAR instruction: IntermediateCode.Instruction;
  11915. BEGIN
  11916. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  11917. RETURN instruction
  11918. END Add;
  11919. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11920. VAR instruction: IntermediateCode.Instruction;
  11921. BEGIN
  11922. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  11923. RETURN instruction
  11924. END And;
  11925. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11926. VAR instruction: IntermediateCode.Instruction;
  11927. BEGIN
  11928. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  11929. RETURN instruction
  11930. END Or;
  11931. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11932. VAR instruction: IntermediateCode.Instruction;
  11933. BEGIN
  11934. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  11935. RETURN instruction
  11936. END Xor;
  11937. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11938. VAR instruction: IntermediateCode.Instruction;
  11939. BEGIN
  11940. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  11941. RETURN instruction
  11942. END Shl;
  11943. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11944. VAR instruction: IntermediateCode.Instruction;
  11945. BEGIN
  11946. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  11947. RETURN instruction
  11948. END Shr;
  11949. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11950. VAR instruction: IntermediateCode.Instruction;
  11951. BEGIN
  11952. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  11953. RETURN instruction
  11954. END Rol;
  11955. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11956. VAR instruction: IntermediateCode.Instruction;
  11957. BEGIN
  11958. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  11959. RETURN instruction
  11960. END Ror;
  11961. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  11962. VAR instruction: IntermediateCode.Instruction;
  11963. BEGIN
  11964. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  11965. RETURN instruction
  11966. END Cas;
  11967. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  11968. VAR instruction: IntermediateCode.Instruction;
  11969. BEGIN
  11970. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  11971. RETURN instruction
  11972. END Copy;
  11973. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  11974. VAR instruction: IntermediateCode.Instruction;
  11975. BEGIN
  11976. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  11977. RETURN instruction
  11978. END Fill;
  11979. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  11980. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  11981. BEGIN
  11982. string := IntermediateCode.String(s);
  11983. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  11984. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  11985. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  11986. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  11987. RETURN instruction
  11988. END Asm;
  11989. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  11990. VAR instruction: IntermediateCode.Instruction;
  11991. BEGIN
  11992. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  11993. RETURN instruction
  11994. END Data;
  11995. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  11996. VAR instruction: IntermediateCode.Instruction;
  11997. BEGIN
  11998. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  11999. IntermediateCode.SetSubType(instruction, subtype);
  12000. RETURN instruction
  12001. END SpecialInstruction;
  12002. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12003. VAR op1: IntermediateCode.Operand;
  12004. VAR instruction: IntermediateCode.Instruction;
  12005. BEGIN
  12006. (*! generate a warning if size exceeds a certain limit *)
  12007. (*
  12008. ASSERT(bytes < 1000000); (* sanity check *)
  12009. *)
  12010. ASSERT(0 <= units); (* sanity check *)
  12011. IntermediateCode.InitNumber(op1,units);
  12012. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12013. RETURN instruction
  12014. END Reserve;
  12015. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12016. VAR op1: IntermediateCode.Operand;
  12017. VAR instruction: IntermediateCode.Instruction;
  12018. BEGIN
  12019. IntermediateCode.InitNumber(op1,position);
  12020. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12021. RETURN instruction
  12022. END LabelInstruction;
  12023. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12024. VAR pc: LONGINT;
  12025. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12026. BEGIN
  12027. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12028. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12029. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12030. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12031. IF instr.op1.type.form = IntermediateCode.Float THEN
  12032. RETURN instr.op1.floatValue = op.floatValue
  12033. ELSE
  12034. RETURN instr.op1.intValue = op.intValue
  12035. END;
  12036. END ProvidesValue;
  12037. BEGIN
  12038. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12039. pc := 0;
  12040. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12041. INC(pc);
  12042. END;
  12043. IF pc = data.pc THEN
  12044. data.Emit(Data(-1,vop));
  12045. END;
  12046. RETURN pc
  12047. END EnterImmediate;
  12048. PROCEDURE Init;
  12049. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12050. BEGIN
  12051. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12052. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12053. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12054. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12055. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12056. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12057. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12058. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12059. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12060. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12061. IntermediateCode.InitOperand(emptyOperand);
  12062. FOR i := 0 TO NumberSystemCalls-1 DO
  12063. name := "@SystemCall";
  12064. Basic.AppendNumber(name,i);
  12065. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12066. END;
  12067. END Init;
  12068. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12069. BEGIN
  12070. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12071. END IsExported;
  12072. BEGIN
  12073. Init;
  12074. END FoxIntermediateBackend.
  12075. Compiler.Compile FoxIntermediateBackend.Mod ~