FoxIntermediateBackend.Mod 532 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672
  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;
  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. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  293. BEGIN
  294. IF x.externalName # NIL THEN RETURN END;
  295. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  296. (* code section for variable *)
  297. Global.GetSymbolSegmentedName(x,name);
  298. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  299. irv.SetExported(IsExported(x));
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  302. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  304. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  305. FOR i := 0 TO DynamicDim(x.type)-1 DO
  306. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  307. END;
  308. ELSE
  309. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  310. IF ~x.fixed THEN
  311. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  312. ELSE
  313. align := x.alignment;
  314. END;
  315. irv.SetPositionOrAlignment(x.fixed, align);
  316. meta.CheckTypeDeclaration(x.type);
  317. END;
  318. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  319. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  320. END;
  321. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  322. END VisitVariable;
  323. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  324. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  325. BEGIN
  326. HALT(100);
  327. (*
  328. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  329. (* code section for variable *)
  330. Global.GetSymbolSegmentedName(x,name);
  331. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  332. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  333. (*
  334. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  335. *)
  336. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  337. HALT(100);
  338. irv.Emit(Reserve(x.position, system.addressSize));
  339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  340. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  341. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  342. ELSIF x.defaultValue = NIL THEN
  343. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  344. ELSE
  345. implementationVisitor.inData := TRUE;
  346. implementationVisitor.Evaluate(x.defaultValue, op);
  347. irv.Emit(Data(x.position,op.op));
  348. implementationVisitor.inData := FALSE;
  349. END;
  350. meta.CheckTypeDeclaration(x.type);
  351. *)
  352. END VisitParameter;
  353. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  354. BEGIN
  355. Type(x.declaredType); (* => code in objects *)
  356. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  357. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  358. END;
  359. END VisitTypeDeclaration;
  360. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  361. BEGIN
  362. IF (SyntaxTree.Public * x.access # {}) THEN
  363. implementationVisitor.VisitConstant(x);
  364. END;
  365. END VisitConstant;
  366. PROCEDURE Scope(x: SyntaxTree.Scope);
  367. VAR procedure: SyntaxTree.Procedure;
  368. constant: SyntaxTree.Constant;
  369. variable: SyntaxTree.Variable;
  370. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  371. BEGIN
  372. prevScope := currentScope;
  373. currentScope := x;
  374. (* constants treated in implementation visitor *)
  375. typeDeclaration := x.firstTypeDeclaration;
  376. WHILE typeDeclaration # NIL DO
  377. VisitTypeDeclaration(typeDeclaration);
  378. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  379. END;
  380. variable := x.firstVariable;
  381. WHILE variable # NIL DO
  382. VisitVariable(variable);
  383. variable := variable.nextVariable;
  384. END;
  385. procedure := x.firstProcedure;
  386. WHILE procedure # NIL DO
  387. VisitProcedure(procedure);
  388. procedure := procedure.nextProcedure;
  389. END;
  390. constant := x.firstConstant;
  391. WHILE constant # NIL DO
  392. VisitConstant(constant);
  393. constant := constant.nextConstant;
  394. END;
  395. currentScope := prevScope;
  396. END Scope;
  397. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  398. VAR parameter: SyntaxTree.Parameter;
  399. BEGIN
  400. parameter := first;
  401. WHILE parameter # NIL DO
  402. VisitParameter(parameter);
  403. parameter := parameter.nextParameter;
  404. END;
  405. END Parameters;
  406. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  407. VAR scope: SyntaxTree.ProcedureScope;
  408. prevScope: SyntaxTree.Scope;
  409. inline, finalizer: BOOLEAN;
  410. procedureType: SyntaxTree.ProcedureType;
  411. pc: LONGINT;
  412. stackSize: LONGINT;
  413. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  414. null,size,src,dest,fp,res: IntermediateCode.Operand;
  415. cc: LONGINT;
  416. cellType: SyntaxTree.CellType;
  417. registerNumber: LONGINT;
  418. registerClass: IntermediateCode.RegisterClass;
  419. type: IntermediateCode.Type;
  420. formalParameter: SyntaxTree.Parameter;
  421. recordType: SyntaxTree.RecordType;
  422. isModuleBody: BOOLEAN;
  423. PROCEDURE Signature;
  424. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  425. BEGIN
  426. procedureType := x.type(SyntaxTree.ProcedureType);
  427. returnType := procedureType.returnType;
  428. IF returnType # NIL THEN
  429. meta.CheckTypeDeclaration(returnType)
  430. END;
  431. parameter := procedureType.firstParameter;
  432. WHILE parameter # NIL DO
  433. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  434. parameter := parameter.nextParameter;
  435. END;
  436. END Signature;
  437. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  438. VAR result: BOOLEAN;
  439. BEGIN
  440. result := FALSE;
  441. IF x = SyntaxTree.invalidExpression THEN
  442. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  443. result := TRUE;
  444. value := x.resolved(SyntaxTree.IntegerValue).value;
  445. ELSE
  446. Error(x.position,"expression is not an integer constant");
  447. END;
  448. RETURN result;
  449. END CheckIntegerValue;
  450. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  451. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  452. BEGIN
  453. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  454. WHILE (this # NIL) & (this.identifier # id) DO
  455. this := this.nextModifier;
  456. END;
  457. IF this # NIL THEN
  458. IF this.expression = NIL THEN
  459. Error(this.position,"expected expression value");
  460. ELSIF CheckIntegerValue(this.expression,value) THEN
  461. END;
  462. RETURN TRUE
  463. ELSE RETURN FALSE
  464. END;
  465. END HasValue;
  466. CONST DefaultDataMemorySize=512;
  467. BEGIN
  468. IF x.externalName # NIL THEN RETURN END;
  469. (*
  470. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  471. *)
  472. (* code section for this procedure *)
  473. scope := x.procedureScope;
  474. prevScope := currentScope;
  475. currentScope := scope;
  476. procedureType := x.type(SyntaxTree.ProcedureType);
  477. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  478. implementationVisitor.temporaries.Init;
  479. implementationVisitor.usedRegisters := NIL;
  480. implementationVisitor.registerUsageCount.Init;
  481. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  482. IF (scope.body # NIL) & (x.isInline) THEN
  483. inline := TRUE;
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  485. ir.SetExported(IsExported(x));
  486. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  487. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  488. IF backend.cellsAreObjects THEN
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  490. ir.SetExported(IsExported(x));
  491. ELSE
  492. RETURN; (* cellnet cannot be compiled for final static hardware *)
  493. END;
  494. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  495. inline := FALSE;
  496. AddBodyCallStub(x);
  497. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  498. ir.SetExported(IsExported(x));
  499. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  500. inline := FALSE;
  501. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  502. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  503. AddBodyCallStub(x);
  504. AddStackAllocation(x,stackSize);
  505. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  506. ir.SetExported(IsExported(x));
  507. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  508. inline := FALSE;
  509. Parameters(procedureType.firstParameter);
  510. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  511. ir.SetExported(IsExported(x));
  512. ELSE
  513. inline := FALSE;
  514. IF x.isEntry OR x.isExit THEN
  515. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  516. ir.SetExported(TRUE);
  517. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  518. ELSE
  519. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  520. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  521. END;
  522. END;
  523. cc := procedureType.callingConvention;
  524. IF scope.body # NIL THEN
  525. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  526. registerNumber := 0;
  527. IF ~inline THEN
  528. IF scope.lastVariable = NIL THEN
  529. stackSize := 0
  530. ELSE
  531. stackSize := scope.lastVariable.offsetInBits;
  532. IF stackSize <0 THEN stackSize := -stackSize END;
  533. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  534. END;
  535. (*
  536. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  537. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  538. *)
  539. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  540. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  541. END;
  542. pc := ir.pc-1;
  543. (*
  544. ir.Emit(Nop(position)); (* placeholder for fill *)
  545. *)
  546. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  547. formalParameter := procedureType.lastParameter;
  548. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  549. IF ~PassInRegister(formalParameter) THEN
  550. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  551. ELSE
  552. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  553. type := GetType(system, formalParameter.type);
  554. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  555. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  556. ir.Emit(Mov(-1,dest, src));
  557. implementationVisitor.ReleaseIntermediateOperand(src);
  558. INC(registerNumber);
  559. formalParameter := formalParameter.prevParameter;
  560. END;
  561. END;
  562. END;
  563. ir.EnterValidPAF;
  564. END;
  565. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  566. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  567. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  568. IF scope.lastVariable # NIL THEN
  569. stackSize := scope.lastVariable.offsetInBits;
  570. IF stackSize <0 THEN stackSize := -stackSize END;
  571. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  572. END;
  573. END;
  574. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  575. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  576. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  577. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  578. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  579. ir.EmitAt(pc,Push(size));
  580. implementationVisitor.StaticCallOperand(result,procedure);
  581. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  582. END;
  583. *)
  584. END;
  585. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  586. IF stackSize > 0 THEN
  587. IF (stackSize MOD system.addressSize = 0) THEN
  588. null := IntermediateCode.Immediate(addressType,0);
  589. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  590. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  591. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  592. ELSE
  593. null := IntermediateCode.Immediate(int8,0);
  594. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  595. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  596. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  597. END;
  598. (*! should potentially be called by backend -- enter might initialize
  599. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  600. *)
  601. END;
  602. ir.ExitValidPAF;
  603. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  604. finalizer := FALSE;
  605. IF backend.cooperative & x.isFinalizer THEN
  606. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  607. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  608. GetRecordTypeName(recordType,name);
  609. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  610. END;
  611. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  612. IF backend.cooperative THEN
  613. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  614. IF implementationVisitor.profile & ~isModuleBody THEN
  615. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  616. END;
  617. END;
  618. implementationVisitor.EmitLeave(ir, x.position,cc);
  619. IF finalizer THEN
  620. IF backend.hasLinkRegister THEN
  621. ir.Emit(Pop(-1, implementationVisitor.lr));
  622. END;
  623. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  624. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  625. ir.Emit(Br(x.position,dest));
  626. ELSE
  627. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  628. END;
  629. ELSE
  630. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  631. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  632. END;
  633. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  634. IF backend.cooperative THEN
  635. IF HasPointers (scope) THEN
  636. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  637. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  638. ir.Emit(Result(x.position, res));
  639. ir.Emit(Push(x.position, res));
  640. implementationVisitor.ResetVariables(scope);
  641. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  642. ir.Emit(Pop(x.position, res));
  643. ir.Emit(Return(x.position, res));
  644. ELSE
  645. implementationVisitor.ResetVariables(scope);
  646. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  647. END;
  648. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  649. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  650. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  651. ir.Emit(Result(x.position, res));
  652. ir.Emit(Push(x.position, res));
  653. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  654. ir.Emit(Pop(x.position, res));
  655. ir.Emit(Return(x.position, res));
  656. ELSE
  657. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  658. END;
  659. END;
  660. implementationVisitor.EmitLeave(ir,x.position,cc);
  661. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  662. ELSE
  663. ir.Emit(Nop(x.position));
  664. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  665. implementationVisitor.EmitLeave(ir,x.position,cc);
  666. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  667. END;
  668. END;
  669. END
  670. END;
  671. ELSE (* force body for procedures *)
  672. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  673. ir.EnterValidPAF;
  674. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  675. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  676. ir.ExitValidPAF;
  677. implementationVisitor.EmitLeave(ir,x.position,cc);
  678. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  679. END;
  680. Scope(scope);
  681. Signature;
  682. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  683. currentScope := prevScope;
  684. END Procedure;
  685. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  686. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  687. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  688. BEGIN
  689. ASSERT (bodyProcedure # NIL);
  690. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  691. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  692. procedure.SetScope(bodyProcedure.scope);
  693. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  694. procedure.SetAccess(SyntaxTree.Hidden);
  695. Global.GetSymbolSegmentedName (procedure,name);
  696. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  697. ir.SetExported(TRUE);
  698. ir.SetPriority(InitPriority);
  699. Global.GetSymbolSegmentedName (bodyProcedure,name);
  700. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  701. implementationVisitor.currentScope := module.module.moduleScope;
  702. implementationVisitor.section := ir;
  703. implementationVisitor.PushSelfPointer();
  704. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  705. ELSIF backend.preregisterStatic THEN
  706. implementationVisitor.currentScope := module.module.moduleScope;
  707. implementationVisitor.section := ir;
  708. implementationVisitor.PushSelfPointer();
  709. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  710. ELSE
  711. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  712. ir.Emit(Call(bodyProcedure.position,op, 0));
  713. END;
  714. END AddBodyCallStub;
  715. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  716. VAR name: Basic.SegmentedName;
  717. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  718. BEGIN
  719. Global.GetSymbolSegmentedName (symbol,name);
  720. Basic.RemoveSuffix(name);
  721. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  722. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  723. ir.SetExported(TRUE);
  724. ir.SetPriority(FirstPriority);
  725. IntermediateCode.InitImmediate(op,addressType,initStack);
  726. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  727. END AddStackAllocation;
  728. (** entry function to visit a complete module *)
  729. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  730. VAR
  731. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  732. hasDynamicOperatorDeclarations: BOOLEAN;
  733. operator: SyntaxTree.Operator;
  734. import: SyntaxTree.Import;
  735. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  736. BEGIN
  737. type := type.resolved;
  738. IF type IS SyntaxTree.RecordType THEN
  739. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  740. ELSIF (type IS SyntaxTree.ArrayType) THEN
  741. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  742. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  743. END;
  744. ELSIF type IS SyntaxTree.MathArrayType THEN
  745. WITH type: SyntaxTree.MathArrayType DO
  746. IF type.form = SyntaxTree.Open THEN
  747. RETURN TRUE
  748. ELSIF type.form = SyntaxTree.Static THEN
  749. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  750. END;
  751. END;
  752. END;
  753. RETURN FALSE
  754. END TypeNeedsInitialization;
  755. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  756. VAR variable: SyntaxTree.Variable;
  757. BEGIN
  758. variable := scope.firstVariable;
  759. WHILE variable # NIL DO
  760. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  761. IF variable.initializer # NIL THEN RETURN TRUE END;
  762. variable := variable.nextVariable;
  763. END;
  764. RETURN FALSE
  765. END ScopeNeedsInitialization;
  766. BEGIN
  767. ASSERT(x # NIL); ASSERT(module # NIL);
  768. SELF.module := module;
  769. (* add import names to the generated Sections.Module *)
  770. import := x.moduleScope.firstImport;
  771. WHILE import # NIL DO
  772. import.module.GetName(idstr);
  773. module.imports.AddName(idstr);
  774. import := import.nextImport
  775. END;
  776. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  777. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  778. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  779. moduleSelf.SetType(system.anyType);
  780. moduleSelf.SetScope(x.moduleScope);
  781. moduleSelf.SetUntraced(TRUE);
  782. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  783. ir.SetExported(TRUE);
  784. IntermediateCode.InitImmediate(op,addressType,0);
  785. ir.Emit(Data(-1,op));
  786. END;
  787. implementationVisitor.module := module;
  788. implementationVisitor.moduleScope := x.moduleScope;
  789. implementationVisitor.moduleSelf := moduleSelf;
  790. implementationVisitor.canBeLoaded := TRUE;
  791. meta.SetModule(module);
  792. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  793. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  794. END;
  795. IF backend.profile THEN
  796. EnsureBodyProcedure(x.moduleScope);
  797. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  798. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  799. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  800. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  801. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  802. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  803. Global.GetModuleName(module.module,idstr);
  804. implementationVisitor.ProfilerAddModule(idstr);
  805. implementationVisitor.numberProcedures := 0;
  806. END;
  807. implementationVisitor.profile := backend.profile;
  808. (* check if there is at least one dynamic operator locally defined *)
  809. hasDynamicOperatorDeclarations := FALSE;
  810. operator := x.moduleScope.firstOperator;
  811. WHILE operator # NIL DO
  812. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  813. operator := operator.nextOperator
  814. END;
  815. (* add operator initialization code section *)
  816. IF hasDynamicOperatorDeclarations THEN
  817. EnsureBodyProcedure(x.moduleScope);
  818. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  819. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  820. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  821. END;
  822. Scope(x.moduleScope);
  823. IF hasDynamicOperatorDeclarations THEN
  824. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  825. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  826. END;
  827. IF backend.profile THEN
  828. implementationVisitor.ProfilerPatchInit;
  829. END;
  830. END Module;
  831. END DeclarationVisitor;
  832. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  833. RegisterUsageCount*=OBJECT
  834. VAR used: UsedArray; count: LONGINT;
  835. PROCEDURE &Init;
  836. VAR i: LONGINT;
  837. BEGIN
  838. count := 0;
  839. IF used = NIL THEN NEW(used,64); END;
  840. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  841. END Init;
  842. PROCEDURE Grow;
  843. VAR new: UsedArray; size,i: LONGINT;
  844. BEGIN
  845. size := LEN(used)*2;
  846. NEW(new,size);
  847. FOR i := 0 TO LEN(used)-1 DO
  848. new[i].count := used[i].count;
  849. new[i].type := used[i].type;
  850. new[i].map := used[i].map
  851. END;
  852. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  853. used := new
  854. END Grow;
  855. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  856. BEGIN
  857. INC(count);
  858. IF count = LEN(used) THEN Grow END;
  859. used[count].type := type;
  860. used[count].class := class;
  861. used[count].map := count;
  862. RETURN count;
  863. END Next;
  864. PROCEDURE IncUse(register: LONGINT);
  865. BEGIN
  866. INC(used[register].count);
  867. (*
  868. IF (register = 1) & (count > 30) THEN
  869. D.TraceBack;
  870. END;
  871. *)
  872. END IncUse;
  873. PROCEDURE DecUse(register: LONGINT);
  874. BEGIN
  875. DEC(used[register].count);
  876. END DecUse;
  877. PROCEDURE Map(register: LONGINT): LONGINT;
  878. VAR map : LONGINT;
  879. BEGIN
  880. IF register > 0 THEN
  881. map := used[register].map;
  882. WHILE register # map DO register := map; map := used[register].map END;
  883. END;
  884. RETURN register
  885. END Map;
  886. PROCEDURE Use(register: LONGINT): LONGINT;
  887. BEGIN
  888. IF register< LEN(used) THEN
  889. RETURN used[register].count
  890. ELSE
  891. RETURN 0
  892. END
  893. END Use;
  894. END RegisterUsageCount;
  895. RegisterEntry = POINTER TO RECORD
  896. prev,next: RegisterEntry;
  897. register: LONGINT;
  898. registerClass: IntermediateCode.RegisterClass;
  899. type: IntermediateCode.Type;
  900. END;
  901. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  902. Variables = OBJECT (Basic.List)
  903. VAR
  904. inUse: VariableUse;
  905. registerIndex: LONGINT;
  906. PROCEDURE & Init;
  907. VAR i: LONGINT;
  908. BEGIN
  909. InitList(16);
  910. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  911. registerIndex := 1024;
  912. END Init;
  913. PROCEDURE GetUsage(VAR use: VariableUse);
  914. BEGIN
  915. use := inUse;
  916. END GetUsage;
  917. PROCEDURE SetUsage(CONST use: VariableUse);
  918. BEGIN
  919. inUse := use;
  920. END SetUsage;
  921. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  922. VAR any: ANY;
  923. BEGIN
  924. any := Get(i);;
  925. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  926. END GetVariable;
  927. PROCEDURE Occupy(pos: LONGINT);
  928. BEGIN
  929. INCL(inUse[pos DIV 32], pos MOD 32);
  930. END Occupy;
  931. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  932. BEGIN
  933. Occupy(Length());
  934. Add(v);
  935. END AddVariable;
  936. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  937. VAR var : SyntaxTree.Variable;
  938. BEGIN
  939. FOR pos := 0 TO Length()-1 DO
  940. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  941. var := GetVariable(pos);
  942. IF type.SameType(var.type) THEN
  943. Occupy(pos); RETURN var
  944. END;
  945. END;
  946. END;
  947. pos := Length();
  948. RETURN NIL
  949. END GetFreeVariable;
  950. END Variables;
  951. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  952. SymbolMapper = OBJECT
  953. VAR
  954. first: SymbolMap;
  955. PROCEDURE & Init;
  956. BEGIN
  957. first := NIL;
  958. END Init;
  959. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  960. VAR new: SymbolMap;
  961. BEGIN
  962. NEW(new); new.this := this; new.to := to; new.tag := tag;
  963. new.next := first; first := new;
  964. END Add;
  965. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  966. VAR s: SymbolMap;
  967. BEGIN
  968. s := first;
  969. WHILE (s # NIL) & (s.this # this) DO
  970. s := s.next
  971. END;
  972. RETURN s
  973. END Get;
  974. END SymbolMapper;
  975. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  976. VAR
  977. system: Global.System;
  978. section: IntermediateCode.Section;
  979. module: Sections.Module;
  980. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  981. awaitProcCounter, labelId, constId, caseId: LONGINT;
  982. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  983. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  984. checker: SemanticChecker.Checker;
  985. backend: IntermediateBackend;
  986. meta: MetaDataGenerator;
  987. position: LONGINT;
  988. moduleSelf: SyntaxTree.Variable;
  989. (* variables for hand over of variables / temporary state *)
  990. currentScope: SyntaxTree.Scope;
  991. constantDeclaration : SyntaxTree.Symbol;
  992. result: Operand; (* result of the most recent expression / statement *)
  993. destination: IntermediateCode.Operand;
  994. arrayDestinationTag: IntermediateCode.Operand;
  995. arrayDestinationDimension:LONGINT;
  996. currentLoop: Label; (* variable to hand over loop exit jump list *)
  997. conditional: BOOLEAN;
  998. trueLabel, falseLabel, exitLabel: Label;
  999. locked: BOOLEAN;
  1000. (*
  1001. usedRegisters: Registers;
  1002. *)
  1003. registerUsageCount: RegisterUsageCount;
  1004. usedRegisters: RegisterEntry;
  1005. (* useful operands and types *)
  1006. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1007. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1008. commentPrintout: Printout.Printer;
  1009. dump: Streams.Writer;
  1010. tagsAvailable : BOOLEAN;
  1011. supportedInstruction: SupportedInstructionProcedure;
  1012. supportedImmediate: SupportedImmediateProcedure;
  1013. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1014. emitLabels: BOOLEAN;
  1015. runtimeModuleName : SyntaxTree.IdentifierString;
  1016. newObjectFile: BOOLEAN;
  1017. indexCounter: LONGINT;
  1018. profile: BOOLEAN;
  1019. profileId, profileInit: IntermediateCode.Section;
  1020. profileInitPatchPosition: LONGINT;
  1021. numberProcedures: LONGINT;
  1022. procedureResultDesignator : SyntaxTree.Designator;
  1023. operatorInitializationCodeSection: IntermediateCode.Section;
  1024. fingerPrinter: FingerPrinter.FingerPrinter;
  1025. temporaries: Variables;
  1026. canBeLoaded : BOOLEAN;
  1027. currentIsInline: BOOLEAN;
  1028. currentMapper: SymbolMapper;
  1029. currentInlineExit: Label;
  1030. moduleBodySection: IntermediateCode.Section;
  1031. NeedDescriptor : BOOLEAN;
  1032. cooperativeSwitches: BOOLEAN;
  1033. lastSwitchPC: LONGINT;
  1034. isUnchecked: BOOLEAN;
  1035. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1036. newObjectFile: BOOLEAN);
  1037. BEGIN
  1038. SELF.system := system;
  1039. SELF.runtimeModuleName := runtime;
  1040. currentScope := NIL;
  1041. hiddenPointerType := NIL;
  1042. delegatePointerType := NIL;
  1043. awaitProcCounter := 0;
  1044. labelId := 0; constId := 0; labelId := 0;
  1045. SELF.checker := checker;
  1046. SELF.backend := backend;
  1047. position := Diagnostics.Invalid;
  1048. conditional := FALSE;
  1049. locked := FALSE;
  1050. InitOperand(result,ModeUndefined);
  1051. addressType := IntermediateCode.GetType(system,system.addressType);
  1052. setType := IntermediateCode.GetType(system,system.setType);
  1053. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1054. byteType := IntermediateCode.GetType(system, system.byteType);
  1055. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1056. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1057. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1058. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1059. nil := IntermediateCode.Immediate(addressType,0);
  1060. IntermediateCode.InitOperand(destination);
  1061. tagsAvailable := TRUE;
  1062. supportedInstruction := supportedInstructionProcedure;
  1063. supportedImmediate := supportedImmediateProcedure;
  1064. inData := FALSE;
  1065. SELF.emitLabels := emitLabels;
  1066. IntermediateCode.InitOperand(arrayDestinationTag);
  1067. bool := IntermediateCode.GetType(system,system.booleanType);
  1068. IntermediateCode.InitImmediate(false,bool,0);
  1069. IntermediateCode.InitImmediate(true,bool,1);
  1070. SELF.newObjectFile := newObjectFile;
  1071. indexCounter := 0;
  1072. NEW(registerUsageCount);
  1073. usedRegisters := NIL;
  1074. procedureResultDesignator := NIL;
  1075. NEW(fingerPrinter, system);
  1076. NEW(temporaries);
  1077. currentIsInline := FALSE;
  1078. NeedDescriptor := FALSE;
  1079. isUnchecked := backend.noRuntimeChecks;
  1080. END Init;
  1081. TYPE Context = RECORD
  1082. section: IntermediateCode.Section;
  1083. registerUsageCount: RegisterUsageCount;
  1084. usedRegisters: RegisterEntry;
  1085. END;
  1086. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1087. VAR context: Context;
  1088. BEGIN
  1089. context.section := section;
  1090. context.registerUsageCount := registerUsageCount;
  1091. context.usedRegisters := usedRegisters;
  1092. section := new;
  1093. NEW(registerUsageCount);
  1094. usedRegisters := NIL;
  1095. RETURN context;
  1096. END SwitchContext;
  1097. PROCEDURE ReturnToContext(context: Context);
  1098. BEGIN
  1099. section := context.section;
  1100. registerUsageCount := context.registerUsageCount;
  1101. usedRegisters := context.usedRegisters;
  1102. END ReturnToContext;
  1103. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1104. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1105. BEGIN
  1106. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1107. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1108. END;
  1109. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1110. section.SetExported(IsExported(syntaxTreeSymbol));
  1111. RETURN section
  1112. END NewSection;
  1113. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1114. VAR new: LONGINT;
  1115. BEGIN
  1116. new := registerUsageCount.Next(type,class);
  1117. UseRegister(new);
  1118. RETURN new
  1119. END AcquireRegister;
  1120. (** get the name for the code section that represens a certain symbol
  1121. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1122. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1123. VAR
  1124. operatorFingerPrint: SyntaxTree.FingerPrint;
  1125. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1126. BEGIN
  1127. Global.GetSymbolSegmentedName(symbol, name);
  1128. (* if the symbol is an operator, then append the fingerprint to the name *)
  1129. IF symbol IS SyntaxTree.Operator THEN
  1130. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1131. string := "[";
  1132. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1133. Strings.Append(string, operatorFingerPrintString);
  1134. Strings.Append(string, "]");
  1135. Basic.AppendToSegmentedName(name,string);
  1136. END
  1137. END GetCodeSectionNameForSymbol;
  1138. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1139. BEGIN
  1140. IF dump # NIL THEN
  1141. dump.String("enter "); dump.String(s); dump.Ln;
  1142. END;
  1143. END TraceEnter;
  1144. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1145. BEGIN
  1146. IF dump # NIL THEN
  1147. dump.String("exit "); dump.String(s); dump.Ln;
  1148. END;
  1149. END TraceExit;
  1150. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1151. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1152. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1153. VAR i: LONGINT;
  1154. BEGIN
  1155. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1156. IF op.rule # NIL THEN
  1157. FOR i := 0 TO LEN(op.rule)-1 DO
  1158. CheckRegister(op.rule[i])
  1159. END;
  1160. END;
  1161. END CheckRegister;
  1162. BEGIN
  1163. CheckRegister(instruction.op1);
  1164. CheckRegister(instruction.op2);
  1165. CheckRegister(instruction.op3);
  1166. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1167. ELSE section.Emit(instruction);
  1168. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1169. END;
  1170. END Emit;
  1171. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1172. BEGIN
  1173. IF backend.cooperative THEN
  1174. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1175. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1176. ELSE
  1177. Emit(Trap(position,trapNo));
  1178. END;
  1179. END EmitTrap;
  1180. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1181. VAR name: Basic.SegmentedName;
  1182. VAR op1, op2, reg: IntermediateCode.Operand;
  1183. VAR call, nocall: Label;
  1184. VAR parametersSize: LONGINT;
  1185. VAR prevSection: IntermediateCode.Section;
  1186. VAR prevDump: Streams.Writer;
  1187. VAR body: SyntaxTree.Body;
  1188. BEGIN
  1189. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1190. prevSection := SELF.section;
  1191. SELF.section := section;
  1192. prevDump := dump;
  1193. dump := section.comments;
  1194. IF backend.hasLinkRegister THEN
  1195. Emit(Push(-1, lr));
  1196. END;
  1197. Emit(Push(-1,fp));
  1198. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1199. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1200. GetCodeSectionNameForSymbol(procedure, name);
  1201. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1202. ELSE
  1203. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1204. END;
  1205. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1206. Emit(Push(-1,op1));
  1207. Emit(Mov(-1,fp, sp));
  1208. body := procedure.procedureScope.body;
  1209. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1210. NEW(call, section);
  1211. NEW(nocall, section);
  1212. reg := NewRegisterOperand(addressType);
  1213. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1214. Emit(Sub(-1,reg, sp, op1));
  1215. BrltL(call, sp, reg);
  1216. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1217. BrgeL(nocall, sp, op2);
  1218. call.Resolve(section.pc);
  1219. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1220. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1221. Emit(Push(-1, op2));
  1222. Emit(Push(-1, reg));
  1223. ReleaseIntermediateOperand(reg);
  1224. CallThis(position, "Activities","ExpandStack",2);
  1225. Emit(Result(-1, sp));
  1226. nocall.Resolve(section.pc);
  1227. END;
  1228. ELSE
  1229. Emit(Mov(-1, fp, sp));
  1230. END;
  1231. Emit(Enter(-1, callconv, varSize));
  1232. SELF.section := prevSection;
  1233. dump := prevDump;
  1234. END EmitEnter;
  1235. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1236. VAR op1,op2: IntermediateCode.Operand;
  1237. VAR instruction: IntermediateCode.Instruction;
  1238. BEGIN
  1239. IntermediateCode.InitNumber(op1,callconv);
  1240. IntermediateCode.InitNumber(op2,varSize);
  1241. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1242. RETURN instruction
  1243. END Enter;
  1244. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1245. VAR op1: IntermediateCode.Operand;
  1246. VAR instruction: IntermediateCode.Instruction;
  1247. BEGIN
  1248. IntermediateCode.InitNumber(op1,callconv);
  1249. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1250. RETURN instruction
  1251. END Leave;
  1252. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1253. VAR prevSection: IntermediateCode.Section;
  1254. VAR op2: IntermediateCode.Operand;
  1255. BEGIN
  1256. prevSection := SELF.section;
  1257. SELF.section := section;
  1258. Emit(Leave(position, callconv));
  1259. IF backend.cooperative THEN
  1260. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1261. Emit(Add(position, sp, fp, op2));
  1262. ELSE
  1263. Emit(Mov(position, sp, fp));
  1264. END;
  1265. Emit(Pop(position, fp));
  1266. SELF.section := prevSection;
  1267. END EmitLeave;
  1268. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1269. VAR m: SymbolMap;
  1270. BEGIN
  1271. position := x.position;
  1272. IF currentIsInline THEN
  1273. m := currentMapper.Get(x);
  1274. IF m # NIL THEN
  1275. (*
  1276. Printout.Info("mapping from", x);
  1277. Printout.Info("mapping to ", m.to);
  1278. *)
  1279. m.to.Accept(SELF);
  1280. op := result;
  1281. IF m.tag # NIL THEN
  1282. ReleaseIntermediateOperand(result.tag);
  1283. m.tag.Accept(SELF);
  1284. op.tag := result.op;
  1285. ReleaseIntermediateOperand(result.tag);
  1286. END;
  1287. RETURN
  1288. END;
  1289. END;
  1290. x.Accept(SELF);
  1291. op := result;
  1292. END Symbol;
  1293. PROCEDURE Expression(x: SyntaxTree.Expression);
  1294. BEGIN
  1295. position := x.position;
  1296. constantDeclaration := NIL;
  1297. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1298. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1299. END;
  1300. IF x.resolved # NIL THEN
  1301. x.resolved.Accept(SELF)
  1302. ELSE
  1303. x.Accept(SELF)
  1304. END;
  1305. (* check this, was commented out in ActiveCells3 *)
  1306. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1307. Error(x.position, "unsupported modifier");
  1308. END;
  1309. END Expression;
  1310. (*
  1311. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1312. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1313. BEGIN
  1314. temporaries.GetUsage(current);
  1315. FOR i := 0 TO LEN(current)-1 DO
  1316. set := current[i] - previous[i];
  1317. IF set # {} THEN
  1318. FOR j := 0 TO MAX(SET)-1 DO
  1319. IF j IN set THEN
  1320. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1321. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1322. Symbol(variable, op);
  1323. MakeMemory(tmp,op.op,addressType,0);
  1324. ReleaseOperand(op);
  1325. Emit(Mov(position,tmp, nil ) );
  1326. ReleaseIntermediateOperand(tmp);
  1327. END;
  1328. END;
  1329. END;
  1330. END;
  1331. END;
  1332. END ResetUsedTemporaries;
  1333. *)
  1334. PROCEDURE Statement(x: SyntaxTree.Statement);
  1335. VAR use: VariableUse;
  1336. BEGIN
  1337. temporaries.GetUsage(use);
  1338. position := x.position;
  1339. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1340. IF commentPrintout # NIL THEN
  1341. commentPrintout.Statement(x);
  1342. dump.Ln;
  1343. (*dump.Update;*)
  1344. END;
  1345. x.Accept(SELF);
  1346. (*
  1347. CheckRegistersFree();
  1348. *)
  1349. (*ResetUsedTemporaries(use);*)
  1350. temporaries.SetUsage(use);
  1351. END Statement;
  1352. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1353. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1354. *)
  1355. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1356. BEGIN
  1357. IF op.mode = IntermediateCode.ModeMemory THEN
  1358. ReuseCopy(res,op);
  1359. ELSE
  1360. res := op;
  1361. UseIntermediateOperand(res);
  1362. END;
  1363. IntermediateCode.AddOffset(res,offset);
  1364. IntermediateCode.MakeMemory(res,type);
  1365. END MakeMemory;
  1366. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1367. VAR mem: IntermediateCode.Operand;
  1368. BEGIN
  1369. MakeMemory(mem,res,type,offset);
  1370. ReleaseIntermediateOperand(res);
  1371. res := mem;
  1372. END ToMemory;
  1373. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1374. VAR mem: IntermediateCode.Operand;
  1375. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1376. componentType: SyntaxTree.Type;
  1377. BEGIN
  1378. type := type.resolved;
  1379. IF operand.mode = ModeReference THEN
  1380. IF type IS SyntaxTree.RangeType THEN
  1381. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1382. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1383. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1384. ReleaseOperand(operand);
  1385. operand.op := firstOp;
  1386. operand.tag := lastOp;
  1387. operand.extra := stepOp;
  1388. ELSIF type IS SyntaxTree.ComplexType THEN
  1389. componentType := type(SyntaxTree.ComplexType).componentType;
  1390. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1391. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1392. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1393. ReleaseOperand(operand);
  1394. operand.op := firstOp;
  1395. operand.tag := lastOp
  1396. ELSE
  1397. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1398. ReleaseIntermediateOperand(operand.op);
  1399. operand.op := mem;
  1400. END;
  1401. operand.mode := ModeValue;
  1402. END;
  1403. ASSERT(operand.mode = ModeValue);
  1404. END LoadValue;
  1405. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1406. VAR prevConditional: BOOLEAN;
  1407. BEGIN
  1408. prevConditional := conditional;
  1409. conditional := FALSE;
  1410. InitOperand(result, ModeUndefined);
  1411. Expression(x);
  1412. op := result;
  1413. LoadValue(op,x.type.resolved);
  1414. conditional := prevConditional;
  1415. END Evaluate;
  1416. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1417. VAR prevConditional: BOOLEAN;
  1418. BEGIN
  1419. prevConditional := conditional;
  1420. conditional := FALSE;
  1421. InitOperand(result,ModeUndefined);
  1422. Expression(x);
  1423. op := result;
  1424. (*
  1425. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1426. *)
  1427. conditional := prevConditional;
  1428. END Designate;
  1429. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1430. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1431. BEGIN
  1432. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1433. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1434. conditional := TRUE;
  1435. trueLabel := trueL; falseLabel := falseL;
  1436. Expression(x);
  1437. trueL := trueLabel; falseL := falseLabel;
  1438. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1439. END Condition;
  1440. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1441. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1442. BEGIN
  1443. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1444. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1445. RETURN op
  1446. END NewRegisterOperand;
  1447. PROCEDURE UnuseRegister(register: LONGINT);
  1448. BEGIN
  1449. IF (register > 0) THEN
  1450. register := registerUsageCount.Map(register);
  1451. registerUsageCount.DecUse(register);
  1452. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1453. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1454. END;
  1455. IF registerUsageCount.Use(register)=0 THEN
  1456. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1457. Warning(position, "register cannot be removed");
  1458. END;
  1459. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1460. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1461. END;
  1462. ELSIF registerUsageCount.Use(register)<0 THEN
  1463. Warning(position, "register removed too often");
  1464. IF dump # NIL THEN
  1465. dump.String("register removed too often"); dump.Ln; dump.Update;
  1466. END;
  1467. D.TraceBack;
  1468. END;
  1469. END;
  1470. END UnuseRegister;
  1471. PROCEDURE UseRegister(register: LONGINT);
  1472. BEGIN
  1473. IF (register > 0) THEN
  1474. register := registerUsageCount.Map(register);
  1475. registerUsageCount.IncUse(register);
  1476. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1477. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1478. END;
  1479. IF registerUsageCount.Use(register)=1 THEN
  1480. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1481. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1482. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1483. END;
  1484. END;
  1485. END;
  1486. END UseRegister;
  1487. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1488. BEGIN
  1489. UnuseRegister(op.register)
  1490. END ReleaseIntermediateOperand;
  1491. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1492. BEGIN
  1493. UseRegister(op.register)
  1494. END UseIntermediateOperand;
  1495. PROCEDURE ReleaseOperand(CONST op: Operand);
  1496. BEGIN
  1497. UnuseRegister(op.op.register);
  1498. UnuseRegister(op.tag.register);
  1499. UnuseRegister(op.extra.register);
  1500. END ReleaseOperand;
  1501. (* save registers marked in array "markedRegisters" to the stack
  1502. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1503. *)
  1504. PROCEDURE SaveRegisters();
  1505. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1506. BEGIN
  1507. entry := usedRegisters;
  1508. WHILE entry # NIL DO
  1509. type := registerUsageCount.used[entry.register].type;
  1510. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1511. Emit(Push(position,op));
  1512. entry := entry.next;
  1513. END;
  1514. END SaveRegisters;
  1515. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1516. BEGIN
  1517. saved := usedRegisters;
  1518. usedRegisters := NIL;
  1519. END ReleaseUsedRegisters;
  1520. (** remove parameter registers from used queue *)
  1521. PROCEDURE ReleaseParameterRegisters;
  1522. VAR entry,prev,next: RegisterEntry;
  1523. BEGIN
  1524. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1525. WHILE entry # NIL DO
  1526. next := entry.next;
  1527. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1528. registerUsageCount.DecUse(entry.register);
  1529. ASSERT(registerUsageCount.Use(entry.register)=0);
  1530. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1531. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1532. END;
  1533. ELSIF prev = NIL THEN
  1534. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1535. ELSE
  1536. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1537. END;
  1538. entry := next;
  1539. END;
  1540. END ReleaseParameterRegisters;
  1541. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1542. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1543. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1544. BEGIN
  1545. entry := saved;
  1546. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1547. entry := prev;
  1548. WHILE entry # NIL DO
  1549. prev := entry.prev;
  1550. type := entry.type;
  1551. class := entry.registerClass;
  1552. IntermediateCode.InitRegister(op,type,class,entry.register);
  1553. (*
  1554. new := registerUsageCount.Next(type,class);
  1555. registerUsageCount.Remap(entry.register,new);
  1556. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1557. dump.String("remap register "); dump.Int(entry.register,1);
  1558. dump.String("to "); dump.Int(new,1);
  1559. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1560. END;
  1561. entry.register := new;
  1562. *)
  1563. Emit(Pop(position,op));
  1564. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1565. entry := prev;
  1566. END;
  1567. (*
  1568. usedRegisters := saved;
  1569. *)
  1570. END RestoreRegisters;
  1571. PROCEDURE CheckRegistersFree;
  1572. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1573. BEGIN
  1574. IF usedRegisters # NIL THEN
  1575. r := usedRegisters;
  1576. WHILE r # NIL DO
  1577. warning := "register ";
  1578. Strings.AppendInt(warning, r.register);
  1579. Strings.Append(warning, " not released.");
  1580. Warning(position,warning);
  1581. r := r .next;
  1582. END;
  1583. END;
  1584. FOR i := 0 TO registerUsageCount.count-1 DO
  1585. IF registerUsageCount.used[i].count < 0 THEN
  1586. warning := "register ";
  1587. Strings.AppendInt(warning, i);
  1588. Strings.Append(warning, " unused too often.");
  1589. Warning(position,warning);
  1590. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1591. warning := "register ";
  1592. Strings.AppendInt(warning, i);
  1593. Strings.Append(warning, " not unused often enough.");
  1594. Warning(position,warning);
  1595. END;
  1596. END;
  1597. END CheckRegistersFree;
  1598. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1599. Otherwise allocate a new register.
  1600. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1601. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1602. BEGIN
  1603. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1604. UseIntermediateOperand(result);
  1605. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1606. UseIntermediateOperand(result);
  1607. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1608. END;
  1609. END Reuse2;
  1610. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1611. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1612. If not then allocate a new register.
  1613. Does NOT necessarily keep the content of src1 or src2 in result!
  1614. *)
  1615. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1616. BEGIN
  1617. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1618. UseIntermediateOperand(result);
  1619. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1620. UseIntermediateOperand(result);
  1621. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1622. result := alternative; alternative := emptyOperand;
  1623. UseIntermediateOperand(result);
  1624. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1625. END;
  1626. END Reuse2a;
  1627. (* like reuse2 but only one source *)
  1628. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1629. BEGIN
  1630. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1631. UseIntermediateOperand(result);
  1632. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1633. END;
  1634. END Reuse1;
  1635. (* like reuse2a but only one source *)
  1636. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1637. BEGIN
  1638. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1639. UseIntermediateOperand(result);
  1640. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1641. UseIntermediateOperand(result);
  1642. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1643. END;
  1644. END Reuse1a;
  1645. (* like reuse1 but guarantees that content of src1 is in result *)
  1646. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1647. BEGIN
  1648. IF ReusableRegister(src1) THEN
  1649. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1650. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1651. UseIntermediateOperand(result);
  1652. ELSE
  1653. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1654. Emit(Mov(position,result,src1));
  1655. END
  1656. END ReuseCopy;
  1657. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1658. BEGIN
  1659. IF ReusableRegister(src) THEN
  1660. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1661. ELSE
  1662. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1663. Emit(Mov(position,result,src));
  1664. ReleaseIntermediateOperand(src);
  1665. END
  1666. END TransferToRegister;
  1667. (** labels and branches **)
  1668. PROCEDURE NewLabel(): Label;
  1669. VAR label: Label;
  1670. BEGIN
  1671. NEW(label,section); RETURN label;
  1672. END NewLabel;
  1673. PROCEDURE SetLabel(label: Label);
  1674. BEGIN label.Resolve(section.pc);
  1675. END SetLabel;
  1676. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1677. BEGIN
  1678. ASSERT(label # NIL);
  1679. IF label.pc < 0 THEN (* label not yet set *)
  1680. label.AddFixup(section.pc);
  1681. END;
  1682. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1683. END LabelOperand;
  1684. PROCEDURE BrL(label: Label);
  1685. BEGIN
  1686. Emit(Br(position,LabelOperand(label)));
  1687. END BrL;
  1688. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1689. BEGIN
  1690. Emit(Brge(position,LabelOperand(label),left,right));
  1691. END BrgeL;
  1692. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1693. BEGIN
  1694. Emit(Brlt(position,LabelOperand(label),left,right));
  1695. END BrltL;
  1696. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1697. BEGIN
  1698. Emit(Breq(position,LabelOperand(label),left,right));
  1699. END BreqL;
  1700. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1701. BEGIN
  1702. Emit(Brne(position,LabelOperand(label),left,right));
  1703. END BrneL;
  1704. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1705. VAR new: IntermediateCode.Operand;
  1706. BEGIN
  1707. IF Trace THEN TraceEnter("Convert") END;
  1708. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1709. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1710. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1711. & (operand.offset = 0)
  1712. THEN
  1713. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1714. Emit(Conv(position,new,operand));
  1715. ELSE
  1716. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1717. Emit(Conv(position,new,operand));
  1718. ReleaseIntermediateOperand(operand);
  1719. END;
  1720. operand := new;
  1721. 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
  1722. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1723. ELSE
  1724. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1725. Emit(Conv(position,new,operand));
  1726. ReleaseIntermediateOperand(operand);
  1727. operand := new;
  1728. END;
  1729. IF Trace THEN TraceExit("Convert") END;
  1730. END Convert;
  1731. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1732. VAR exit: Label;
  1733. BEGIN
  1734. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1735. exit := NewLabel();
  1736. br(exit,left,right);
  1737. EmitTrap(position,trapNo);
  1738. SetLabel(exit);
  1739. END TrapC;
  1740. (** expressions *)
  1741. (** emit necessary runtime check for set elements **)
  1742. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1743. VAR max: IntermediateCode.Operand;
  1744. BEGIN
  1745. IF isUnchecked THEN RETURN END;
  1746. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1747. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1748. TrapC(BrgeL, max, o, SetElementTrap);
  1749. END;
  1750. END CheckSetElement;
  1751. (** the set that a range represents **)
  1752. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1753. VAR
  1754. operand: Operand;
  1755. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1756. BEGIN
  1757. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1758. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1759. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1760. one := IntermediateCode.Immediate(setType, 1);
  1761. Evaluate(x, operand);
  1762. Convert(operand.op, setType);
  1763. Convert(operand.tag, setType);
  1764. CheckSetElement(operand.op);
  1765. CheckSetElement(operand.tag);
  1766. (* create mask for lower bound
  1767. i.e. shift 11111111 to the left by the value of the lower bound
  1768. *)
  1769. Reuse1(temp, operand.op);
  1770. Emit(Shl(position,temp, allBits, operand.op));
  1771. ReleaseIntermediateOperand(operand.op);
  1772. operand.op := temp;
  1773. (* create mask for upper bound
  1774. i.e. shift 11111111 to the right by the difference between the
  1775. upper bound and the maximum number of set elements
  1776. *)
  1777. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1778. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1779. Reuse1(temp, operand.tag);
  1780. ELSE
  1781. Reuse1(temp, operand.tag);
  1782. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1783. Emit(Sub(position,temp, size, operand.tag));
  1784. END;
  1785. Emit(Shr(position,temp, allBits, operand.tag));
  1786. ReleaseIntermediateOperand(operand.tag);
  1787. operand.tag := temp;
  1788. Reuse2(resultingSet, operand.op, operand.tag);
  1789. (* intersect the two masks *)
  1790. Emit(And(position,resultingSet, operand.op, operand.tag));
  1791. ReleaseOperand(operand);
  1792. RETURN resultingSet
  1793. END SetFromRange;
  1794. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1795. VAR
  1796. res, operand: Operand;
  1797. temp, one, noBits, dest: IntermediateCode.Operand;
  1798. expression: SyntaxTree.Expression;
  1799. i: LONGINT;
  1800. BEGIN
  1801. IF Trace THEN TraceEnter("VisitSet") END;
  1802. dest := destination;
  1803. destination := emptyOperand;
  1804. noBits := IntermediateCode.Immediate(setType, 0);
  1805. one := IntermediateCode.Immediate(setType, 1);
  1806. (* start off with the empty set *)
  1807. InitOperand(res, ModeValue);
  1808. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1809. Emit(Mov(position,res.op, noBits));
  1810. FOR i := 0 TO x.elements.Length() - 1 DO
  1811. expression := x.elements.GetExpression(i);
  1812. IF expression IS SyntaxTree.RangeExpression THEN
  1813. (* range of set elements *)
  1814. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1815. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1816. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1817. ReleaseIntermediateOperand(temp)
  1818. ELSE
  1819. (* singelton element *)
  1820. Evaluate(expression, operand);
  1821. Convert(operand.op, setType);
  1822. CheckSetElement(operand.op);
  1823. (* create subset containing single element *)
  1824. Reuse1(temp, operand.op);
  1825. Emit(Shl(position,temp, one, operand.op));
  1826. ReleaseOperand(operand);
  1827. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1828. ReleaseIntermediateOperand(temp);
  1829. END
  1830. END;
  1831. result := res;
  1832. destination := dest;
  1833. IF Trace THEN TraceExit("VisitSet") END;
  1834. END VisitSet;
  1835. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1836. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1837. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1838. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1839. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1840. element: SyntaxTree.IntegerValue;
  1841. BEGIN
  1842. numberElements := x.elements.Length();
  1843. expression := index.parameters.GetExpression(dim);
  1844. element := expression(SyntaxTree.IntegerValue);
  1845. FOR i := 0 TO numberElements-1 DO
  1846. expression := x.elements.GetExpression(i);
  1847. element.SetValue(i);
  1848. IF expression IS SyntaxTree.MathArrayExpression THEN
  1849. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1850. ELSE
  1851. Assign(index,expression);
  1852. END;
  1853. END;
  1854. END RecursiveAssignment;
  1855. BEGIN
  1856. variable := GetTemporaryVariable(x.type, FALSE);
  1857. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1858. designator.SetType(variable.type);
  1859. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1860. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1861. FOR i := 0 TO dim-1 DO
  1862. element := SyntaxTree.NewIntegerValue(x.position,0);
  1863. element.SetType(system.longintType);
  1864. index.parameters.AddExpression(element);
  1865. END;
  1866. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1867. RecursiveAssignment(x,0);
  1868. Expression(designator);
  1869. END VisitMathArrayExpression;
  1870. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1871. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1872. BEGIN
  1873. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1874. dest := destination; destination := emptyOperand;
  1875. IF x.operator = Scanner.Not THEN
  1876. IF conditional THEN
  1877. Condition(x.left,falseLabel,trueLabel)
  1878. ELSE
  1879. Evaluate(x.left,operand);
  1880. InitOperand(result,ModeValue);
  1881. Reuse1a(result.op,operand.op,dest);
  1882. Emit(Xor(position,result.op,operand.op,true));
  1883. ReleaseOperand(operand);
  1884. END;
  1885. ELSIF x.operator = Scanner.Minus THEN
  1886. Evaluate(x.left,operand);
  1887. InitOperand(result,ModeValue);
  1888. Reuse1a(result.op,operand.op,dest);
  1889. type := x.left.type.resolved;
  1890. IF type IS SyntaxTree.SetType THEN
  1891. Emit(Not(position,result.op,operand.op));
  1892. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1893. Reuse1(result.tag,operand.tag);
  1894. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1895. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1896. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1897. Emit(Neg(position,result.op,operand.op));
  1898. ELSE HALT(200)
  1899. END;
  1900. ReleaseOperand(operand);
  1901. ELSIF x.operator = Scanner.Address THEN
  1902. Designate(x.left,operand);
  1903. operand.mode := ModeValue;
  1904. t0 := x.left.type.resolved;
  1905. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1906. ReleaseIntermediateOperand(operand.op);
  1907. operand.op := operand.tag;
  1908. IntermediateCode.InitOperand(operand.tag);
  1909. END;
  1910. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1911. result := operand;
  1912. ELSE HALT(100)
  1913. END;
  1914. destination := dest;
  1915. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1916. END VisitUnaryExpression;
  1917. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1918. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1919. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1920. BEGIN
  1921. type := type.resolved;
  1922. originalType := type;
  1923. IF type IS SyntaxTree.PointerType THEN
  1924. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1925. END;
  1926. IF type IS SyntaxTree.ObjectType THEN
  1927. BrL(trueL);
  1928. ELSE
  1929. ASSERT(type IS SyntaxTree.RecordType);
  1930. (*
  1931. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1932. *)
  1933. ReuseCopy(left,tag);
  1934. right := TypeDescriptorAdr(type);
  1935. IF ~newObjectFile THEN
  1936. IntermediateCode.MakeMemory(right,addressType);
  1937. END;
  1938. IF backend.cooperative THEN
  1939. repeatL := NewLabel();
  1940. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1941. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1942. END;
  1943. SetLabel(repeatL);
  1944. BreqL(trueL,left,right);
  1945. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1946. BrneL(repeatL,left,nil);
  1947. ELSIF meta.simple THEN
  1948. level := type(SyntaxTree.RecordType).Level();
  1949. (* get type desc tag of level relative to base tag *)
  1950. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1951. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1952. IntermediateCode.MakeMemory(left,addressType);
  1953. BreqL(trueL,left,right);
  1954. ELSE
  1955. level := type(SyntaxTree.RecordType).Level();
  1956. (* get type desc tag of level relative to base tag *)
  1957. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1958. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1959. IntermediateCode.MakeMemory(left,addressType);
  1960. BreqL(trueL,left,right);
  1961. END;
  1962. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1963. BrL(falseL);
  1964. END;
  1965. END TypeTest;
  1966. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1967. BEGIN
  1968. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1969. IF dump # NIL THEN
  1970. dump.String(s); dump.Ln;
  1971. END;
  1972. END Error;
  1973. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1974. BEGIN
  1975. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1976. IF dump # NIL THEN
  1977. dump.String(s); dump.Ln; dump.Update;
  1978. END;
  1979. END Warning;
  1980. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1981. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1982. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1983. operand:Operand;
  1984. BEGIN
  1985. previousSection := section;
  1986. Global.GetModuleName(mod,name);
  1987. Strings.Append(name,".@Trace");
  1988. Basic.ToSegmentedName(name, pooledName);
  1989. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1990. IF dump # NIL THEN dump := section.comments END;
  1991. IF backend.hasLinkRegister THEN
  1992. Emit(Push(-1, lr));
  1993. END;
  1994. variable := mod.moduleScope.firstVariable;
  1995. WHILE variable # NIL DO
  1996. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1997. Symbol(variable, operand);
  1998. register := operand.op;
  1999. CallTraceMethod(register, variable.type);
  2000. ReleaseIntermediateOperand(register);
  2001. END;
  2002. variable := variable.nextVariable;
  2003. END;
  2004. IF backend.hasLinkRegister THEN
  2005. Emit(Pop(-1, lr));
  2006. END;
  2007. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2008. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2009. Emit(Br(position,op));
  2010. INC(statCoopTraceModule, section.pc);
  2011. section := previousSection;
  2012. IF dump # NIL THEN dump := section.comments END;
  2013. END CreateTraceModuleMethod;
  2014. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2015. BEGIN
  2016. Emit (Push(position, dst));
  2017. Emit (Push(position, src));
  2018. CallThis(position,"GarbageCollector","Assign", 2);
  2019. END CallAssignPointer;
  2020. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2021. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2022. BEGIN
  2023. IF SemanticChecker.IsPointerType (type) THEN
  2024. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2025. ELSIF type.IsRecordType() THEN
  2026. Emit (Push(position,dst));
  2027. Emit (Push(position,src));
  2028. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2029. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2030. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2031. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2032. ELSIF IsStaticArray(type) THEN
  2033. size := StaticArrayNumElements(type);
  2034. base := StaticArrayBaseType(type);
  2035. IF base.IsRecordType() THEN
  2036. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2037. Emit (Push(position, dst));
  2038. Emit (Push(position, src));
  2039. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2040. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2041. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2042. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2043. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2044. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2045. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2046. Emit (Push(position, dst));
  2047. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2048. Emit (Push(position, src));
  2049. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2050. ELSE
  2051. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2052. Emit (Push(position, dst));
  2053. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2054. Emit (Push(position, src));
  2055. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2056. ASSERT(StaticArrayBaseType(type).IsPointer());
  2057. END;
  2058. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2059. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2060. Emit (Push(position, dst));
  2061. Emit (Push(position, src));
  2062. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2063. ELSE HALT(100); (* missing ? *)
  2064. END;
  2065. END CallAssignMethod;
  2066. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2067. VAR name: Basic.SegmentedName;
  2068. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2069. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2070. context: Context;
  2071. BEGIN
  2072. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2073. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2074. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2075. GetRecordTypeName (recordType,name);
  2076. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2077. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2078. IF dump # NIL THEN dump := section.comments END;
  2079. IF backend.hasLinkRegister THEN
  2080. Emit(Push(-1, lr));
  2081. END;
  2082. variable := recordType.recordScope.firstVariable;
  2083. WHILE variable # NIL DO
  2084. IF variable.NeedsTrace() THEN
  2085. dst := NewRegisterOperand (addressType);
  2086. src := NewRegisterOperand (addressType);
  2087. Emit (Mov(position, dst, parameter1));
  2088. Emit (Mov(position, src, parameter2));
  2089. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2090. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2091. CallAssignMethod(dst, src, variable.type);
  2092. ReleaseIntermediateOperand(src);
  2093. ReleaseIntermediateOperand(dst);
  2094. END;
  2095. variable := variable.nextVariable;
  2096. END;
  2097. recordBase := recordType.GetBaseRecord();
  2098. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2099. IF backend.hasLinkRegister THEN
  2100. Emit(Pop(-1, lr));
  2101. END;
  2102. GetRecordTypeName (recordBase,name);
  2103. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2104. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2105. Emit(Br(position,op));
  2106. ELSE
  2107. Emit(Exit(position,0,0));
  2108. END;
  2109. IF ~recordType.isObject THEN
  2110. GetRecordTypeName (recordType,name);
  2111. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2112. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2113. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2114. NEW(registerUsageCount);
  2115. usedRegisters := NIL;
  2116. dst := NewRegisterOperand (addressType);
  2117. src := NewRegisterOperand (addressType);
  2118. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2119. Emit(Mov(position, dst, parameter1));
  2120. Emit(Mov(position, src, parameter2));
  2121. label := NewLabel();
  2122. SetLabel(label);
  2123. Emit(Push(position, dst));
  2124. Emit(Push(position, src));
  2125. GetRecordTypeName (recordType,name);
  2126. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2127. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2128. Emit(Call(position, op, 0));
  2129. Emit(Pop(position, src));
  2130. Emit(Pop(position, dst));
  2131. Emit(Add(position, dst, dst, ofs));
  2132. Emit(Add(position, src, src, ofs));
  2133. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2134. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2135. Emit(Exit(position,0,0));
  2136. END;
  2137. INC(statCoopAssignProcedure, section.pc);
  2138. ReturnToContext(context);
  2139. IF dump # NIL THEN dump := section.comments END;
  2140. END CreateAssignProcedure;
  2141. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2142. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2143. BEGIN
  2144. IF IsUnsafePointer (type) THEN
  2145. skip := NewLabel();
  2146. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2147. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2148. BreqL (skip, op, nil);
  2149. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2150. SetLabel (skip);
  2151. ELSIF SemanticChecker.IsPointerType (type) THEN
  2152. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2153. CallThis(position,"GarbageCollector","Mark", 1);
  2154. ELSIF type.IsRecordType() THEN
  2155. Emit (Push(position,register));
  2156. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2157. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2158. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2159. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2160. ELSIF IsStaticArray(type) THEN
  2161. size := StaticArrayNumElements(type);
  2162. base := StaticArrayBaseType(type);
  2163. IF base.IsRecordType() THEN
  2164. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2165. Emit (Push(position, register));
  2166. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2168. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2169. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2170. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2171. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2172. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2173. Emit (Push(position, register));
  2174. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2175. ELSE
  2176. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2177. Emit (Push(position, register));
  2178. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2179. ASSERT(base.IsPointer());
  2180. END;
  2181. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2182. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2183. CallThis(position,"GarbageCollector","Mark", 1);
  2184. ELSE HALT(100); (* missing ? *)
  2185. END;
  2186. END CallTraceMethod;
  2187. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2188. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2189. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2190. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2191. BEGIN
  2192. previousSection := section;
  2193. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2194. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2195. GetRecordTypeName (recordType,name);
  2196. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2197. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2198. IF dump # NIL THEN dump := section.comments END;
  2199. IF backend.hasLinkRegister THEN
  2200. Emit(Push(-1, lr));
  2201. END;
  2202. variable := recordType.recordScope.firstVariable;
  2203. WHILE variable # NIL DO
  2204. IF variable.NeedsTrace() THEN
  2205. register := NewRegisterOperand (addressType);
  2206. Emit (Mov(position,register,parameter1));
  2207. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2208. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2209. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2210. END;
  2211. CallTraceMethod(register, variable.type);
  2212. ReleaseIntermediateOperand(register);
  2213. END;
  2214. variable := variable.nextVariable;
  2215. END;
  2216. recordBase := recordType.GetBaseRecord();
  2217. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2218. recordBase := recordBase.GetBaseRecord();
  2219. END;
  2220. IF recordBase # NIL THEN
  2221. IF backend.hasLinkRegister THEN
  2222. Emit(Pop(-1, lr));
  2223. END;
  2224. GetRecordTypeName (recordBase,name);
  2225. IF HasExplicitTraceMethod (recordBase) THEN
  2226. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2227. ELSE
  2228. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2229. END;
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Br(position,op));
  2232. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2233. Emit(Exit(position,0,0));
  2234. ELSE
  2235. IF backend.hasLinkRegister THEN
  2236. Emit(Pop(-1, lr));
  2237. END;
  2238. IF recordType.isObject THEN
  2239. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2240. ELSE
  2241. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2242. END;
  2243. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2244. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2245. Emit(Br(position,op));
  2246. END;
  2247. IF ~recordType.isObject THEN
  2248. GetRecordTypeName (recordType,name);
  2249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2251. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2252. NEW(registerUsageCount);
  2253. usedRegisters := NIL;
  2254. IF dump # NIL THEN dump := section.comments END;
  2255. register := NewRegisterOperand (addressType);
  2256. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2257. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2258. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2259. END;
  2260. Emit (Push(position,register));
  2261. GetRecordTypeName (recordType,name);
  2262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2263. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2264. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2265. ReleaseIntermediateOperand(register);
  2266. Emit(Exit(position,0,0));
  2267. GetRecordTypeName (recordType,name);
  2268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2270. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2271. NEW(registerUsageCount);
  2272. usedRegisters := NIL;
  2273. register := NewRegisterOperand (addressType);
  2274. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2275. Emit(Mov(position, register, parameter1));
  2276. label := NewLabel();
  2277. SetLabel(label);
  2278. Emit(Push(position, register));
  2279. GetRecordTypeName (recordType,name);
  2280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2281. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2282. Emit(Call(position, op, 0));
  2283. Emit(Pop(position, register));
  2284. Emit(Add(position, register, register, ofs));
  2285. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2286. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2287. Emit(Exit(position,0,0));
  2288. END;
  2289. INC(statCoopTraceMethod, section.pc);
  2290. ReturnToContext(context);
  2291. IF dump # NIL THEN dump := section.comments END;
  2292. END CreateTraceMethod;
  2293. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2294. VAR name: Basic.SegmentedName;
  2295. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2296. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2297. context: Context;
  2298. BEGIN
  2299. IF recordType.isObject THEN RETURN END;
  2300. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2301. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2302. GetRecordTypeName (recordType,name);
  2303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2304. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2305. IF dump # NIL THEN dump := section.comments END;
  2306. IF backend.hasLinkRegister THEN
  2307. Emit(Push(-1, lr));
  2308. END;
  2309. variable := recordType.recordScope.firstVariable;
  2310. WHILE variable # NIL DO
  2311. IF variable.NeedsTrace() THEN
  2312. dst := NewRegisterOperand (addressType);
  2313. Emit (Mov(position, dst, parameter1));
  2314. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2315. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2316. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2317. END;
  2318. CallResetProcedure(dst, nil, variable.type);
  2319. ReleaseIntermediateOperand(dst);
  2320. END;
  2321. variable := variable.nextVariable;
  2322. END;
  2323. recordBase := recordType.GetBaseRecord();
  2324. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Pop(-1, lr));
  2327. END;
  2328. GetRecordTypeName (recordBase,name);
  2329. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2330. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2331. Emit(Br(position,op));
  2332. ELSE
  2333. Emit(Exit(position,0,0));
  2334. END;
  2335. GetRecordTypeName (recordType,name);
  2336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2338. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2339. NEW(registerUsageCount);
  2340. usedRegisters := NIL;
  2341. dst := NewRegisterOperand (addressType);
  2342. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2343. Emit(Mov(position, dst, parameter1));
  2344. label := NewLabel();
  2345. SetLabel(label);
  2346. Emit(Push(position, dst));
  2347. GetRecordTypeName (recordType,name);
  2348. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2349. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2350. Emit(Call(position, op, 0));
  2351. Emit(Pop(position, dst));
  2352. Emit(Add(position, dst, dst, ofs));
  2353. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2354. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2355. Emit(Exit(position,0,0));
  2356. INC(statCoopResetProcedure, section.pc);
  2357. ReturnToContext(context);
  2358. IF dump # NIL THEN dump := section.comments END;
  2359. END CreateResetProcedure;
  2360. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2361. VAR name: Basic.SegmentedName; context: Context;
  2362. BEGIN
  2363. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2365. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2366. IF dump # NIL THEN dump := section.comments END;
  2367. IF backend.hasLinkRegister THEN
  2368. Emit(Push(-1, lr));
  2369. END;
  2370. Emit(Push(position,fp));
  2371. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2372. ResetVariables(scope);
  2373. Emit(Pop(position,fp));
  2374. Emit(Exit(position,0,0));
  2375. ReturnToContext(context);
  2376. IF dump # NIL THEN dump := section.comments END;
  2377. END CreateResetMethod;
  2378. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2379. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2380. BEGIN
  2381. IF SemanticChecker.IsPointerType (type) THEN
  2382. Emit (Push(position, dest));
  2383. CallThis(position,"GarbageCollector","Reset", 1);
  2384. ELSIF type.IsRecordType() THEN
  2385. Emit (Push(position, dest));
  2386. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2387. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2388. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2389. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2390. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2391. size := GetArrayLength(type, tag);
  2392. base := ArrayBaseType(type);
  2393. IF base.IsRecordType() THEN
  2394. Emit (Push(position, size));
  2395. Emit (Push(position, dest));
  2396. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2398. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2399. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2400. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2401. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2402. Emit (Push(position, size));
  2403. Emit (Push(position, dest));
  2404. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2405. ELSE
  2406. Emit (Push(position, size));
  2407. Emit (Push(position, dest));
  2408. CallThis(position,"GarbageCollector","ResetArray", 2);
  2409. ASSERT(ArrayBaseType(type).IsPointer());
  2410. END;
  2411. ReleaseIntermediateOperand(size);
  2412. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2413. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2414. Emit (Push(position, dest));
  2415. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2416. ELSE HALT(100); (* missing ? *)
  2417. END;
  2418. END CallResetProcedure;
  2419. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2420. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2421. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2422. VAR operand: Operand;
  2423. BEGIN
  2424. Symbol (symbol, operand);
  2425. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2426. ReleaseOperand(operand);
  2427. END Reset;
  2428. BEGIN
  2429. previousScope := currentScope;
  2430. currentScope := scope;
  2431. pc := section.pc;
  2432. variable := scope.firstVariable;
  2433. WHILE variable # NIL DO
  2434. IF variable.NeedsTrace() THEN
  2435. Reset (variable);
  2436. END;
  2437. variable := variable.nextVariable;
  2438. END;
  2439. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2440. WHILE parameter # NIL DO
  2441. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2442. Reset (parameter);
  2443. END;
  2444. parameter := parameter.nextParameter;
  2445. END;
  2446. INC(statCoopResetVariables, section.pc - pc);
  2447. currentScope := previousScope;
  2448. END ResetVariables;
  2449. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2450. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2451. VAR op: IntermediateCode.Operand; context: Context;
  2452. BEGIN
  2453. previousSection := section;
  2454. GetCodeSectionNameForSymbol(procedure, name);
  2455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2456. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2457. IF dump # NIL THEN dump := section.comments END;
  2458. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2459. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2460. Emit(Data(position,op));
  2461. Emit(Data(position,nil));
  2462. IF HasPointers (procedure.procedureScope) THEN
  2463. GetCodeSectionNameForSymbol(procedure, name);
  2464. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2465. ELSE
  2466. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2467. END;
  2468. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2469. Emit(Data(position,op));
  2470. ReturnToContext(context);
  2471. IF dump # NIL THEN dump := section.comments END;
  2472. END CreateProcedureDescriptor;
  2473. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2474. VAR import: SyntaxTree.Import;
  2475. s: Basic.MessageString;
  2476. selfName: SyntaxTree.IdentifierString;
  2477. BEGIN
  2478. moduleScope.ownerModule.GetName(selfName);
  2479. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2480. module := moduleScope.ownerModule
  2481. ELSE
  2482. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2483. IF import = NIL THEN
  2484. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2485. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2486. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2487. s := "Module ";
  2488. Strings.Append(s,moduleName);
  2489. Strings.Append(s," cannot be imported.");
  2490. IF force THEN
  2491. Error(position,s);
  2492. ELSIF canBeLoaded THEN
  2493. Strings.Append(s, "=> no dynamic linking.");
  2494. Warning(position, s);
  2495. canBeLoaded := FALSE;
  2496. END;
  2497. RETURN FALSE
  2498. ELSE
  2499. SELF.module.imports.AddName(moduleName)
  2500. END;
  2501. ELSIF import.module = NIL THEN (* already tried *)
  2502. RETURN FALSE
  2503. END;
  2504. module := import.module;
  2505. END;
  2506. RETURN TRUE
  2507. END AddImport;
  2508. (* needed for old binary object file format*)
  2509. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2510. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2511. BEGIN
  2512. IF AddImport(moduleName,module,TRUE) THEN
  2513. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2514. IF procedure = NIL THEN
  2515. s := "Instruction not supported on target, emulation procedure ";
  2516. Strings.Append(s,moduleName);
  2517. Strings.Append(s,".");
  2518. Strings.Append(s,procedureName);
  2519. Strings.Append(s," not present");
  2520. Error(position,s);
  2521. ELSE
  2522. StaticCallOperand(r,procedure);
  2523. ReleaseOperand(r);
  2524. fp := GetFingerprint(procedure);
  2525. END;
  2526. END;
  2527. END EnsureSymbol;
  2528. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2529. VAR exit: Label; trueL,falseL: Label;
  2530. BEGIN
  2531. trueL := NewLabel();
  2532. falseL := NewLabel();
  2533. exit := NewLabel();
  2534. Condition(x,trueL,falseL);
  2535. InitOperand(result,ModeValue);
  2536. SetLabel(trueL);
  2537. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2538. Emit(Mov(position,result.op,true));
  2539. BrL(exit);
  2540. SetLabel(falseL);
  2541. Emit(MovReplace(position,result.op,false));
  2542. SetLabel(exit);
  2543. END ConditionToValue;
  2544. PROCEDURE ValueToCondition(VAR op: Operand);
  2545. BEGIN
  2546. LoadValue(op,system.booleanType);
  2547. BrneL(trueLabel,op.op, false);
  2548. ReleaseOperand(op);
  2549. BrL(falseLabel);
  2550. END ValueToCondition;
  2551. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2552. VAR size: LONGINT;
  2553. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2554. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2555. BEGIN
  2556. ASSERT(type.form = SyntaxTree.Open);
  2557. baseType := type.arrayBase.resolved;
  2558. IF IsOpenArray(baseType) THEN
  2559. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2560. ELSE
  2561. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2562. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2563. END;
  2564. len := tag;
  2565. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2566. IntermediateCode.MakeMemory(len,addressType);
  2567. UseIntermediateOperand(len);
  2568. Reuse2(res,sizeOperand,len);
  2569. Emit(Mul(position,res,sizeOperand,len));
  2570. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2571. RETURN res
  2572. END GetArraySize;
  2573. BEGIN
  2574. type := type.resolved;
  2575. IF IsOpenArray(type) THEN
  2576. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2577. RETURN tag
  2578. ELSE
  2579. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2580. END;
  2581. ELSE
  2582. size := ToMemoryUnits(system,system.SizeOf(type));
  2583. RETURN IntermediateCode.Immediate(addressType,size)
  2584. END;
  2585. END GetDynamicSize;
  2586. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2587. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2588. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2589. BEGIN
  2590. ASSERT(type.form = SyntaxTree.Open);
  2591. baseType := type.arrayBase.resolved;
  2592. IF IsOpenArray(baseType) THEN
  2593. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2594. ELSE
  2595. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2596. END;
  2597. len := tag;
  2598. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2599. IntermediateCode.MakeMemory(len,addressType);
  2600. UseIntermediateOperand(len);
  2601. Reuse2(res,sizeOperand,len);
  2602. Emit(Mul(position,res,sizeOperand,len));
  2603. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2604. RETURN res
  2605. END GetLength;
  2606. BEGIN
  2607. type := type.resolved;
  2608. IF IsOpenArray(type) THEN
  2609. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2610. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2611. ELSE
  2612. RETURN IntermediateCode.Immediate(addressType,1)
  2613. END;
  2614. END GetArrayLength;
  2615. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2616. VAR result: IntermediateCode.Operand;
  2617. BEGIN
  2618. IF backend.cooperative THEN
  2619. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2620. ELSE
  2621. MakeMemory(result, tag, addressType, 0);
  2622. END;
  2623. RETURN result
  2624. END GetSizeFromTag;
  2625. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2626. VAR parameter: SyntaxTree.Parameter;
  2627. BEGIN
  2628. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2629. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2630. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2631. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2632. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2633. END;
  2634. RETURN GetDynamicSize(e.type, tag);
  2635. END GetArrayOfBytesSize;
  2636. (*
  2637. to find imported symbol. not needed ?
  2638. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2639. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2640. BEGIN
  2641. IF AddImport(moduleName,importedModule,FALSE) THEN
  2642. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2643. RETURN symbol
  2644. ELSE
  2645. RETURN NIL
  2646. END
  2647. END SymbolByName;
  2648. *)
  2649. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2650. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2651. BEGIN
  2652. IF AddImport(moduleName,runtimeModule,force) THEN
  2653. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2654. IF procedure = NIL THEN
  2655. s := "Procedure ";
  2656. Strings.Append(s,moduleName);
  2657. Strings.Append(s,".");
  2658. Strings.Append(s,procedureName);
  2659. Strings.Append(s," not present");
  2660. Error(position,s);
  2661. RETURN FALSE
  2662. ELSE
  2663. RETURN TRUE
  2664. END;
  2665. ELSE RETURN FALSE
  2666. END;
  2667. END GetRuntimeProcedure;
  2668. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2669. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2670. s: Basic.MessageString;
  2671. BEGIN
  2672. Basic.InitSegmentedName(name);
  2673. name[0] := Basic.MakeString(moduleName);
  2674. name[1] := Basic.MakeString(typeName);
  2675. name[2] := -1;
  2676. IF AddImport(moduleName,importedModule, FALSE) THEN
  2677. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2678. IF symbol = NIL THEN
  2679. s := "type ";
  2680. Strings.Append(s,moduleName);
  2681. Strings.Append(s,".");
  2682. Strings.Append(s,typeName);
  2683. Strings.Append(s," not present");
  2684. Error(position,s);
  2685. END;
  2686. ELSE symbol := NIL;
  2687. END;
  2688. IF importedModule = moduleScope.ownerModule THEN
  2689. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2690. ELSE
  2691. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2692. END;
  2693. RETURN symbol
  2694. END GetTypeDescriptor;
  2695. (* 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. *)
  2696. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2697. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2698. pooledName: Basic.SegmentedName; size: LONGINT;
  2699. BEGIN
  2700. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2701. StaticCallOperand(result,procedure);
  2702. IF numberParameters < 0 THEN
  2703. size := ProcedureParametersSize(system,procedure);
  2704. ELSE
  2705. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2706. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2707. Error(position,"runtime call parameter count mismatch");
  2708. END;
  2709. END;
  2710. Emit(Call(position, result.op, size));
  2711. ReleaseOperand(result);
  2712. ELSE (* only static linking possible *)
  2713. ASSERT(numberParameters >= 0);
  2714. Basic.InitSegmentedName(pooledName);
  2715. pooledName[0] := Basic.MakeString(moduleName);
  2716. pooledName[1] := Basic.MakeString(procedureName);
  2717. pooledName[2] := -1;
  2718. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2719. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2720. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2721. END;
  2722. END CallThisChecked;
  2723. (* 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. *)
  2724. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2725. BEGIN
  2726. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2727. END CallThis;
  2728. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2729. VAR
  2730. left,right: Operand;
  2731. leftSize, rightSize: IntermediateCode.Operand;
  2732. saved: RegisterEntry;
  2733. reg: IntermediateCode.Operand;
  2734. procedureName: SyntaxTree.IdentifierString;
  2735. BEGIN
  2736. procedureName := "CompareString";
  2737. SaveRegisters();ReleaseUsedRegisters(saved);
  2738. Designate(leftExpression,left);
  2739. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2740. Emit(Push(position,leftSize));
  2741. ReleaseIntermediateOperand(leftSize);
  2742. Emit(Push(position,left.op));
  2743. ReleaseOperand(left);
  2744. Designate(rightExpression,right);
  2745. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2746. Emit(Push(position,rightSize));
  2747. ReleaseIntermediateOperand(rightSize);
  2748. Emit(Push(position,right.op));
  2749. ReleaseOperand(right);
  2750. IF backend.cooperative THEN
  2751. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2752. ELSE
  2753. CallThis(position,runtimeModuleName,procedureName, 4);
  2754. END;
  2755. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2756. Emit(Result(position,reg));
  2757. (*
  2758. AcquireThisRegister(int8,IntermediateCode.Result);
  2759. *)
  2760. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2761. (*
  2762. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2763. *)
  2764. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2765. ReleaseIntermediateOperand(reg);
  2766. BrL(falseLabel);
  2767. END CompareString;
  2768. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2769. VAR
  2770. left,right: Operand;
  2771. leftSize, rightSize: IntermediateCode.Operand;
  2772. saved: RegisterEntry;
  2773. procedureName: SyntaxTree.IdentifierString;
  2774. BEGIN
  2775. procedureName := "CopyString";
  2776. SaveRegisters();ReleaseUsedRegisters(saved);
  2777. Designate(leftExpression,left);
  2778. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2779. Emit(Push(position,leftSize));
  2780. ReleaseIntermediateOperand(leftSize);
  2781. Emit(Push(position,left.op));
  2782. ReleaseOperand(left);
  2783. Designate(rightExpression,right);
  2784. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2785. Emit(Push(position,rightSize));
  2786. ReleaseIntermediateOperand(rightSize);
  2787. Emit(Push(position,right.op));
  2788. ReleaseOperand(right);
  2789. IF backend.cooperative THEN
  2790. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2791. ELSE
  2792. CallThis(position,runtimeModuleName,procedureName,4);
  2793. END;
  2794. RestoreRegisters(saved);
  2795. END CopyString;
  2796. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2797. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2798. leftType,rightType: SyntaxTree.Type;
  2799. leftExpression,rightExpression : SyntaxTree.Expression;
  2800. componentType: IntermediateCode.Type;
  2801. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2802. size: LONGINT;
  2803. BEGIN
  2804. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2805. dest := destination; destination := emptyOperand;
  2806. leftType := x.left.type.resolved;
  2807. rightType := x.right.type.resolved;
  2808. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2809. CASE x.operator OF
  2810. Scanner.Or:
  2811. (* shortcut evaluation of left OR right *)
  2812. IF ~conditional THEN ConditionToValue(x);
  2813. ELSE
  2814. next := NewLabel();
  2815. Condition(x.left,trueLabel,next);
  2816. SetLabel(next);
  2817. Condition(x.right,trueLabel,falseLabel);
  2818. END;
  2819. |Scanner.And:
  2820. (* shortcut evaluation of left & right *)
  2821. IF ~conditional THEN ConditionToValue(x);
  2822. ELSE
  2823. next := NewLabel();
  2824. Condition(x.left,next,falseLabel);
  2825. SetLabel(next);
  2826. Condition(x.right,trueLabel,falseLabel);
  2827. END;
  2828. |Scanner.Is:
  2829. IF ~conditional THEN ConditionToValue(x);
  2830. ELSE
  2831. (* get type desc tag *)
  2832. IF IsPointerToRecord(leftType,recordType) THEN
  2833. Evaluate(x.left,left);
  2834. Dereference(left,recordType,IsUnsafePointer(leftType))
  2835. ELSE
  2836. Designate(x.left,left);
  2837. END;
  2838. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2839. ReleaseOperand(left);
  2840. END;
  2841. |Scanner.Plus:
  2842. Evaluate(x.left,left);
  2843. Evaluate(x.right,right);
  2844. IF leftType IS SyntaxTree.SetType THEN
  2845. InitOperand(result,ModeValue);
  2846. Reuse2a(result.op,left.op,right.op,dest);
  2847. Emit(Or(position,result.op,left.op,right.op));
  2848. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2849. InitOperand(result,ModeValue);
  2850. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2851. Reuse2(result.tag,left.tag,right.tag);
  2852. Emit(Add(position,result.op,left.op,right.op));
  2853. Emit(Add(position,result.tag,left.tag,right.tag))
  2854. ELSE
  2855. InitOperand(result,ModeValue);
  2856. Reuse2a(result.op,left.op,right.op,dest);
  2857. Emit(Add(position,result.op,left.op,right.op));
  2858. END;
  2859. ReleaseOperand(left); ReleaseOperand(right);
  2860. |Scanner.Minus:
  2861. Evaluate(x.left,left);
  2862. Evaluate(x.right,right);
  2863. IF leftType IS SyntaxTree.SetType THEN
  2864. InitOperand(result,ModeValue);
  2865. Reuse1(result.op,right.op);
  2866. Emit(Not(position,result.op,right.op));
  2867. ReleaseOperand(right);
  2868. Emit(And(position,result.op,result.op,left.op));
  2869. ReleaseOperand(left);
  2870. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2871. InitOperand(result,ModeValue);
  2872. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2873. Reuse2(result.tag,left.tag,right.tag);
  2874. Emit(Sub(position,result.op,left.op,right.op));
  2875. Emit(Sub(position,result.tag,left.tag,right.tag));
  2876. ReleaseOperand(left); ReleaseOperand(right)
  2877. ELSE
  2878. InitOperand(result,ModeValue);
  2879. Reuse2a(result.op,left.op,right.op,dest);
  2880. Emit(Sub(position,result.op,left.op,right.op));
  2881. ReleaseOperand(left); ReleaseOperand(right);
  2882. END;
  2883. |Scanner.Times:
  2884. Evaluate(x.left,left);
  2885. Evaluate(x.right,right);
  2886. IF leftType IS SyntaxTree.SetType THEN
  2887. InitOperand(result,ModeValue);
  2888. Reuse2a(result.op,left.op,right.op,dest);
  2889. Emit(And(position,result.op,left.op,right.op));
  2890. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2891. InitOperand(result,ModeValue);
  2892. Reuse1a(result.op,left.op,dest);
  2893. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2894. Emit(Shl(position,result.op,left.op,right.op));
  2895. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2896. InitOperand(result, ModeValue);
  2897. componentType := left.op.type;
  2898. (* TODO: review this *)
  2899. (*
  2900. result.op = left.op * right.op - left.tag * right.tag
  2901. result.tag = left.tag * right.op + left.op * right.tag
  2902. *)
  2903. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2904. Emit(Mul(position,result.op, left.op, right.op));
  2905. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2906. Emit(Mul(position,tempReg, left.tag, right.tag));
  2907. Emit(Sub(position,result.op, result.op, tempReg));
  2908. Reuse2(result.tag, left.tag, right.op);
  2909. Emit(Mul(position,result.tag, left.tag, right.op));
  2910. Emit(Mul(position,tempReg, left.op, right.tag));
  2911. Emit(Add(position,result.tag, result.tag, tempReg));
  2912. ReleaseIntermediateOperand(tempReg)
  2913. ELSE
  2914. InitOperand(result,ModeValue);
  2915. Reuse2a(result.op,left.op,right.op,dest);
  2916. Emit(Mul(position,result.op,left.op,right.op));
  2917. END;
  2918. ReleaseOperand(left); ReleaseOperand(right);
  2919. |Scanner.Div:
  2920. Evaluate(x.left,left);
  2921. Evaluate(x.right,right);
  2922. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2923. InitOperand(result,ModeValue);
  2924. Reuse1a(result.op,left.op,dest);
  2925. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2926. Emit(Shr(position,result.op,left.op,right.op));
  2927. ELSE
  2928. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2929. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2930. IF ~isUnchecked THEN
  2931. exit := NewLabel();
  2932. BrltL(exit,zero,right.op);
  2933. EmitTrap(position,NegativeDivisorTrap);
  2934. SetLabel(exit);
  2935. END;
  2936. END;
  2937. InitOperand(result,ModeValue);
  2938. Reuse2a(result.op,left.op,right.op,dest);
  2939. Emit(Div(position,result.op,left.op,right.op));
  2940. END;
  2941. ReleaseOperand(left); ReleaseOperand(right);
  2942. |Scanner.Mod:
  2943. Evaluate(x.left,left);
  2944. Evaluate(x.right,right);
  2945. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2946. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2947. InitOperand(result,ModeValue);
  2948. Reuse1a(result.op,left.op,dest);
  2949. Emit(And(position,result.op,left.op,right.op));
  2950. ELSE
  2951. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2952. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2953. IF ~isUnchecked THEN
  2954. exit := NewLabel();
  2955. BrltL(exit,zero,right.op);
  2956. EmitTrap(position,NegativeDivisorTrap);
  2957. SetLabel(exit);
  2958. END;
  2959. END;
  2960. InitOperand(result,ModeValue);
  2961. Reuse2a(result.op,left.op,right.op,dest);
  2962. Emit(Mod(position,result.op,left.op,right.op));
  2963. END;
  2964. ReleaseOperand(left); ReleaseOperand(right);
  2965. |Scanner.Slash:
  2966. Evaluate(x.left,left);
  2967. Evaluate(x.right,right);
  2968. IF leftType IS SyntaxTree.SetType THEN
  2969. InitOperand(result,ModeValue);
  2970. Reuse2a(result.op,left.op,right.op,dest);
  2971. Emit(Xor(position,result.op,left.op,right.op));
  2972. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2973. InitOperand(result,ModeValue);
  2974. componentType := left.op.type;
  2975. (* review this *)
  2976. (*
  2977. divisor = right.op * right.op + right.tag * right.tag
  2978. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2979. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2980. *)
  2981. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2982. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2983. Emit(Mul(position,tempReg, right.op, right.op));
  2984. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2985. Emit(Add(position,tempReg, tempReg, tempReg2));
  2986. result.op := tempReg2;
  2987. Emit(Mul(position,result.op, left.op, right.op));
  2988. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2989. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2990. Emit(Add(position,result.op, result.op, tempReg2));
  2991. Emit(Div(position,result.op, result.op, tempReg));
  2992. Reuse2(result.tag, left.tag, right.op);
  2993. Emit(Mul(position,result.tag, left.tag, right.op));
  2994. Emit(Mul(position,tempReg2, left.op, right.tag));
  2995. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2996. Emit(Div(position,result.tag, result.tag, tempReg));
  2997. ReleaseIntermediateOperand(tempReg);
  2998. ReleaseIntermediateOperand(tempReg2)
  2999. ELSE
  3000. InitOperand(result,ModeValue);
  3001. Reuse2a(result.op,left.op,right.op,dest);
  3002. Emit(Div(position,result.op,left.op,right.op));
  3003. END;
  3004. ReleaseOperand(left); ReleaseOperand(right);
  3005. |Scanner.Equal:
  3006. IF ~conditional THEN ConditionToValue(x);
  3007. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3008. CompareString(BreqL,x.left,x.right);
  3009. ELSE
  3010. Evaluate(x.left,left);
  3011. Evaluate(x.right,right);
  3012. IF leftType IS SyntaxTree.RangeType THEN
  3013. ASSERT(rightType IS SyntaxTree.RangeType);
  3014. BrneL(falseLabel, left.op, right.op); (* first *)
  3015. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3016. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3017. ReleaseOperand(left); ReleaseOperand(right);
  3018. BrL(trueLabel)
  3019. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3020. BrneL(falseLabel, left.op, right.op); (* first *)
  3021. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3022. ReleaseOperand(left); ReleaseOperand(right);
  3023. BrL(trueLabel)
  3024. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3025. (* TODO: review this *)
  3026. BrneL(falseLabel, left.op, right.op); (* real part *)
  3027. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3028. ReleaseOperand(left); ReleaseOperand(right);
  3029. BrL(trueLabel)
  3030. ELSE
  3031. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3032. ReleaseOperand(left); ReleaseOperand(right);
  3033. BrL(trueLabel);
  3034. END;
  3035. END;
  3036. |Scanner.LessEqual:
  3037. IF ~conditional THEN ConditionToValue(x);
  3038. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3039. CompareString(BrgeL,x.right,x.left);
  3040. ELSE
  3041. Evaluate(x.left,left);
  3042. Evaluate(x.right,right);
  3043. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3044. Reuse1(temp.op,right.op);
  3045. Emit(And(position,temp.op,left.op,right.op));
  3046. ReleaseOperand(right);
  3047. BreqL(trueLabel,temp.op,left.op);
  3048. BrL(falseLabel);
  3049. ReleaseOperand(temp);ReleaseOperand(left);
  3050. ELSE
  3051. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3052. ReleaseOperand(left); ReleaseOperand(right);
  3053. BrL(trueLabel);
  3054. END;
  3055. END;
  3056. |Scanner.Less:
  3057. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3058. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3059. leftExpression.SetType(system.booleanType);
  3060. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3061. rightExpression.SetType(system.booleanType);
  3062. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3063. leftExpression.SetType(system.booleanType);
  3064. Expression(leftExpression);
  3065. ELSIF ~conditional THEN ConditionToValue(x);
  3066. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3067. CompareString(BrltL,x.left,x.right);
  3068. ELSE
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3072. ReleaseOperand(left); ReleaseOperand(right);
  3073. BrL(trueLabel);
  3074. END;
  3075. |Scanner.Greater:
  3076. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3077. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3078. leftExpression.SetType(system.booleanType);
  3079. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3080. rightExpression.SetType(system.booleanType);
  3081. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3082. leftExpression.SetType(system.booleanType);
  3083. Expression(leftExpression);
  3084. ELSIF ~conditional THEN ConditionToValue(x);
  3085. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3086. CompareString(BrltL,x.right,x.left);
  3087. ELSE
  3088. Evaluate(x.left,left);
  3089. Evaluate(x.right,right);
  3090. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3091. ReleaseOperand(left); ReleaseOperand(right);
  3092. BrL(trueLabel);
  3093. END;
  3094. |Scanner.GreaterEqual:
  3095. IF ~conditional THEN ConditionToValue(x);
  3096. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3097. CompareString(BrgeL,x.left,x.right);
  3098. ELSE
  3099. Evaluate(x.left,left);
  3100. Evaluate(x.right,right);
  3101. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3102. Reuse1(temp.op,left.op);
  3103. Emit(And(position,temp.op,left.op,right.op));
  3104. ReleaseOperand(left);
  3105. BreqL(trueLabel, temp.op,right.op);
  3106. ReleaseOperand(temp); ReleaseOperand(right);
  3107. BrL(falseLabel);
  3108. ELSE
  3109. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3110. ReleaseOperand(left); ReleaseOperand(right);
  3111. BrL(trueLabel);
  3112. END;
  3113. END;
  3114. |Scanner.Unequal:
  3115. IF ~conditional THEN ConditionToValue(x);
  3116. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3117. CompareString(BrneL,x.left,x.right);
  3118. ELSE
  3119. Evaluate(x.left,left);
  3120. Evaluate(x.right,right);
  3121. IF leftType IS SyntaxTree.RangeType THEN
  3122. ASSERT(rightType IS SyntaxTree.RangeType);
  3123. BrneL(trueLabel, left.op, right.op); (* first *)
  3124. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3125. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3126. ReleaseOperand(left); ReleaseOperand(right);
  3127. BrL(falseLabel)
  3128. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3129. BrneL(trueLabel, left.op, right.op); (* first *)
  3130. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3131. ReleaseOperand(left); ReleaseOperand(right);
  3132. BrL(falseLabel)
  3133. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3134. (* TODO: review this *)
  3135. BrneL(trueLabel, left.op, right.op); (* real part *)
  3136. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3137. ReleaseOperand(left); ReleaseOperand(right);
  3138. BrL(falseLabel)
  3139. ELSE
  3140. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3141. ReleaseOperand(left); ReleaseOperand(right);
  3142. BrL(trueLabel);
  3143. END;
  3144. END;
  3145. |Scanner.In:
  3146. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3147. Evaluate(x.left,left);
  3148. Evaluate(x.right,right);
  3149. Convert(left.op,setType);
  3150. ReuseCopy(temp.op,right.op);
  3151. Emit(Shr(position,temp.op,temp.op,left.op));
  3152. ReleaseOperand(right); ReleaseOperand(left);
  3153. IntermediateCode.InitImmediate(one,setType,1);
  3154. Emit(And(position,temp.op,temp.op,one));
  3155. IF conditional THEN
  3156. IntermediateCode.InitImmediate(zero,setType,0);
  3157. BrneL(trueLabel,temp.op,zero);
  3158. ReleaseOperand(temp);
  3159. BrL(falseLabel);
  3160. ELSE
  3161. Convert(temp.op,bool);
  3162. result.mode := ModeValue;
  3163. result.op := temp.op;
  3164. result.tag := nil; (* may be left over from calls to evaluate *)
  3165. END;
  3166. ELSE
  3167. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3168. IF x.operator = Scanner.Questionmarks THEN
  3169. leftExpression := x.left;
  3170. rightExpression := x.right;
  3171. ELSE
  3172. leftExpression := x.right;
  3173. rightExpression := x.left;
  3174. END;
  3175. Evaluate(leftExpression, left);
  3176. Emit(Push(position,left.op));
  3177. ReleaseOperand(left);
  3178. Designate(rightExpression, right);
  3179. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3180. IF ~backend.cellsAreObjects THEN
  3181. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3182. END;
  3183. Emit(Push(position,right.op));
  3184. ReleaseOperand(right);
  3185. IF backend.cellsAreObjects THEN
  3186. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3187. ELSE
  3188. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3189. END;
  3190. InitOperand(result, ModeValue);
  3191. result.op := NewRegisterOperand(bool);
  3192. Emit(Result(position,result.op));
  3193. IF conditional THEN
  3194. IntermediateCode.InitImmediate(zero,setType,0);
  3195. BrneL(trueLabel,result.op,zero);
  3196. ReleaseOperand(result);
  3197. BrL(falseLabel);
  3198. END;
  3199. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3200. leftExpression := x.left;
  3201. rightExpression := x.right;
  3202. Evaluate(leftExpression, left);
  3203. Emit(Push(position,left.op));
  3204. ReleaseOperand(left);
  3205. Evaluate(rightExpression, right);
  3206. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3207. IF ~backend.cellsAreObjects THEN
  3208. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3209. END;
  3210. Emit(Push(position,right.op));
  3211. ReleaseOperand(right);
  3212. IF backend.cellsAreObjects THEN
  3213. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3214. ELSE
  3215. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3216. END;
  3217. InitOperand(result, ModeValue);
  3218. result.op := NewRegisterOperand(bool);
  3219. Emit(Result(position,result.op));
  3220. IF conditional THEN
  3221. IntermediateCode.InitImmediate(zero,setType,0);
  3222. BrneL(trueLabel,result.op,zero);
  3223. ReleaseOperand(result);
  3224. BrL(falseLabel);
  3225. END;
  3226. ELSE
  3227. HALT(100);
  3228. END;
  3229. END;
  3230. destination := dest;
  3231. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3232. END VisitBinaryExpression;
  3233. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3234. VAR localResult, operand: Operand;
  3235. BEGIN
  3236. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3237. InitOperand(localResult, ModeValue);
  3238. ASSERT(x.first # NIL);
  3239. Evaluate(x.first, operand);
  3240. localResult.op := operand.op;
  3241. ReleaseOperand(operand);
  3242. UseIntermediateOperand(localResult.op);
  3243. ASSERT(x.last # NIL);
  3244. Evaluate(x.last, operand);
  3245. localResult.tag := operand.op;
  3246. ReleaseOperand(operand);
  3247. UseIntermediateOperand(localResult.tag);
  3248. IF x.step # NIL THEN
  3249. Evaluate(x.step, operand);
  3250. localResult.extra := operand.op;
  3251. ReleaseOperand(operand);
  3252. UseIntermediateOperand(localResult.extra);
  3253. END;
  3254. result := localResult;
  3255. IF Trace THEN TraceExit("VisitRangeExpression") END
  3256. END VisitRangeExpression;
  3257. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3258. BEGIN
  3259. HALT(100); (* should never be evaluated *)
  3260. END VisitTensorRangeExpression;
  3261. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3262. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3263. BEGIN
  3264. IF Trace THEN TraceEnter("VisitConversion") END;
  3265. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3266. dest := destination; destination := emptyOperand;
  3267. Evaluate(x.expression,old);
  3268. InitOperand(result,ModeValue);
  3269. result.op := old.op;
  3270. ASSERT(result.op.mode # 0);
  3271. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3272. (* convert TO a complex number *)
  3273. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3274. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3275. ASSERT(result.op.mode # 0);
  3276. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3277. (* convert FROM a complex number TO a complex number*)
  3278. result.tag := old.tag;
  3279. ASSERT(result.tag.mode # 0);
  3280. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3281. ASSERT(result.tag.mode # 0)
  3282. ELSE
  3283. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3284. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3285. END
  3286. ELSE
  3287. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3288. ASSERT(result.op.mode # 0);
  3289. result.tag := old.tag; (*! probably never used *)
  3290. END;
  3291. destination := dest;
  3292. IF Trace THEN TraceExit("VisitConversion") END;
  3293. END VisitConversion;
  3294. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3295. BEGIN
  3296. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3297. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3298. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3299. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3300. END VisitTypeDeclaration;
  3301. (** designators (expressions) *)
  3302. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3303. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3304. BEGIN
  3305. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3306. IF x.left # NIL THEN Expression(x.left) END;
  3307. Symbol(x.symbol,result);
  3308. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3309. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3310. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3311. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3312. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3313. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3314. END;
  3315. END;
  3316. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3317. END VisitSymbolDesignator;
  3318. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3319. BEGIN
  3320. IF isUnchecked THEN RETURN END;
  3321. IF tagsAvailable THEN
  3322. TrapC(BrltL,index,length,IndexCheckTrap);
  3323. END;
  3324. END BoundCheck;
  3325. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3326. VAR d: IntermediateCode.Operand;
  3327. BEGIN
  3328. IF isUnchecked THEN RETURN END;
  3329. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3330. TrapC(op,dim,d,ArraySizeTrap);
  3331. ReleaseIntermediateOperand(d);
  3332. END DimensionCheck;
  3333. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3334. VAR
  3335. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3336. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3337. expression: SyntaxTree.Expression;
  3338. resultingType, leftType, baseType: SyntaxTree.Type;
  3339. skipLabel1: Label;
  3340. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3341. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3342. variableOp: Operand;
  3343. variable: SyntaxTree.Variable;
  3344. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3345. VAR expression: SyntaxTree.Expression;
  3346. BEGIN
  3347. (* count the number of indices, ranges and tensorRanges in the index list *)
  3348. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3349. FOR i := 0 TO parameters.Length() - 1 DO
  3350. expression := parameters.GetExpression(i);
  3351. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3352. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3353. ELSE INC(indexCount)
  3354. END
  3355. END;
  3356. END CountIndices;
  3357. BEGIN
  3358. ASSERT(tagsAvailable);
  3359. resultingType := x.type.resolved; (* resulting type *)
  3360. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3361. InitOperand(localResult, ModeReference);
  3362. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3363. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3364. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3365. (* a globally defined array destination tag is available -> use and invalidate it*)
  3366. localResult.tag := arrayDestinationTag;
  3367. IntermediateCode.InitOperand(arrayDestinationTag)
  3368. ELSE
  3369. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3370. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3371. Symbol(variable, variableOp);
  3372. ReuseCopy(localResult.tag, variableOp.op);
  3373. ReleaseOperand(variableOp);
  3374. END
  3375. END;
  3376. indexListSize := x.parameters.Length();
  3377. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3378. ASSERT(tensorRangeCount <= 1);
  3379. (* designate the array to be indexed over, perform tensor range check if known *)
  3380. Designate(x.left, array);
  3381. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3382. Dereference(array, leftType,FALSE);
  3383. IF tensorRangeCount=0 THEN
  3384. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3385. END
  3386. END;
  3387. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3388. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3389. srcDimOffset := -indexListSize;
  3390. destDimOffset := -rangeCount
  3391. ELSE
  3392. srcDimOffset := 0;
  3393. destDimOffset := 0
  3394. END;
  3395. indexDim := 0;
  3396. (* use address of source array as basis *)
  3397. (*
  3398. ReuseCopy(localResult.op, array.op);
  3399. *)
  3400. localResult.op := array.op;
  3401. UseIntermediateOperand(localResult.op);
  3402. (* go through the index list *)
  3403. FOR i := 0 TO indexListSize - 1 DO
  3404. expression := x.parameters.GetExpression(i);
  3405. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3406. (* nothing to do *)
  3407. ELSE
  3408. (* determine which dimension of source array is currently looked at *)
  3409. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3410. (* get the memory operand pointing to array descriptor dimension *)
  3411. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3412. (* make a reusable register from it *)
  3413. ReuseCopy(srcDim, tmp);
  3414. ReleaseIntermediateOperand(tmp);
  3415. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3416. ELSE
  3417. srcDim := IntermediateCode.Immediate(int32, i)
  3418. END;
  3419. (* get length and increment of source array for current dimension *)
  3420. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3421. Convert(sourceLength.op, sizeType);
  3422. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3423. Convert(sourceIncrement.op, sizeType);
  3424. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3425. ReleaseIntermediateOperand(srcDim);
  3426. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3427. (* SINGLE INDEX *)
  3428. Evaluate(expression, index);
  3429. ReleaseIntermediateOperand(index.tag);
  3430. index.tag := emptyOperand;
  3431. Convert(index.op, sizeType);
  3432. (* lower bound check *)
  3433. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3434. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3435. ELSIF isUnchecked THEN (* do nothing *)
  3436. ELSE
  3437. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3438. END;
  3439. (* upper bound check *)
  3440. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3441. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3442. ELSIF isUnchecked THEN (* do nothing *)
  3443. ELSE
  3444. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3445. END;
  3446. ReleaseOperand(sourceLength);
  3447. Convert(index.op, addressType);
  3448. summand := index.op;
  3449. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3450. (* RANGE OF INDICES *)
  3451. Evaluate(expression, range);
  3452. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3453. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3454. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3455. ReleaseOperand(range);
  3456. Convert(firstIndex, sizeType);
  3457. Convert(lastIndex, sizeType);
  3458. Convert(stepSize, sizeType);
  3459. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3460. if it is 'MAX(LONGINT)' *)
  3461. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3462. TransferToRegister(lastIndex, lastIndex);
  3463. skipLabel1 := NewLabel();
  3464. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3465. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3466. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3467. SetLabel(skipLabel1)
  3468. END;
  3469. (* check if step size is valid *)
  3470. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3471. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3472. ELSIF isUnchecked THEN (* do nothing *)
  3473. ELSE
  3474. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3475. END;
  3476. (* check lower bound check *)
  3477. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3478. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3479. ELSIF isUnchecked THEN (* do nothing *)
  3480. ELSE
  3481. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3482. END;
  3483. (* check upper bound check *)
  3484. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3485. (* statically open range: nothing to do *)
  3486. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3487. ASSERT(staticLastIndex < staticSourceLength)
  3488. ELSIF isUnchecked THEN (* do nothing *)
  3489. ELSE
  3490. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3491. END;
  3492. (* determine length of target array for current dimension *)
  3493. (* 1. incorporate last index: *)
  3494. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3495. (* last index is static *)
  3496. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3497. targetLength := sourceLength.op
  3498. ELSE
  3499. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3500. END;
  3501. UseIntermediateOperand(targetLength);
  3502. ELSE
  3503. (* targetLength := lastIndex + 1
  3504. Reuse1(targetLength, lastIndex);
  3505. *)
  3506. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3507. END;
  3508. ReleaseOperand(sourceLength);
  3509. ReleaseIntermediateOperand(lastIndex);
  3510. (* 2. incorporate first index: *)
  3511. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3512. (* first index and current target length are static *)
  3513. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3514. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3515. (* first index = 0: nothing to do *)
  3516. ELSE
  3517. (* targetLength := targetLength - firstIndex *)
  3518. TransferToRegister(targetLength, targetLength);
  3519. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3520. END;
  3521. (* clip negative lengths to 0 *)
  3522. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3523. IF staticTargetLength < 0 THEN
  3524. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3525. END
  3526. ELSE
  3527. skipLabel1 := NewLabel();
  3528. TransferToRegister(targetLength, targetLength);
  3529. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3530. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3531. SetLabel(skipLabel1)
  3532. END;
  3533. (* 3. incorporate index step size: *)
  3534. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3535. (*step size and current target length are static *)
  3536. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3537. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3538. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3539. (* step size = 1: nothing to do *)
  3540. ELSE
  3541. (* emit code for this:
  3542. targetLength := (targetLength-1) DIV stepSize +1;
  3543. *)
  3544. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3545. DivInt(targetLength, targetLength, stepSize);
  3546. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3547. END;
  3548. (* determine increment of target array for current dimension *)
  3549. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3550. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3551. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3552. (* step size = 1 *)
  3553. targetIncrement := sourceIncrement.op;
  3554. UseIntermediateOperand(targetIncrement)
  3555. ELSE
  3556. (* targetIncrement := sourceIncrement * stepSize *)
  3557. Reuse1(targetIncrement, stepSize);
  3558. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3559. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3560. END;
  3561. ReleaseIntermediateOperand(stepSize);
  3562. (* write length and increment of target array to descriptor *)
  3563. IF destDimOffset < 0 THEN
  3564. (* determine which dimension of target array is currently looked at *)
  3565. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3566. TransferToRegister(destDim, tmp);
  3567. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3568. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3569. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3570. ReleaseIntermediateOperand(destDim)
  3571. ELSE
  3572. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3573. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3574. END;
  3575. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3576. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3577. INC(indexDim);
  3578. Convert(firstIndex, addressType);
  3579. TransferToRegister(summand, firstIndex);
  3580. ELSE HALT(100);
  3581. END;
  3582. (*
  3583. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3584. *)
  3585. Convert(sourceIncrement.op, addressType);
  3586. Convert(summand, addressType);
  3587. MulInt(summand, summand, sourceIncrement.op);
  3588. ReleaseIntermediateOperand(sourceIncrement.op);
  3589. AddInt(localResult.op, localResult.op, summand);
  3590. ReleaseIntermediateOperand(summand);
  3591. END
  3592. END;
  3593. result := localResult;
  3594. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3595. ReleaseIntermediateOperand(result.tag);
  3596. result.tag := TypeDescriptorAdr(resultingType);
  3597. IF ~newObjectFile THEN
  3598. IntermediateCode.MakeMemory(result.tag,addressType);
  3599. END;
  3600. ELSIF IsDelegate(resultingType) THEN
  3601. ReleaseIntermediateOperand(result.tag);
  3602. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3603. UseIntermediateOperand(result.tag);
  3604. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3605. ReleaseIntermediateOperand(result.tag);
  3606. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3607. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3608. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3609. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3610. (* finalize target array descriptor *)
  3611. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3612. (* write lengths and increments of target array for remaining dimensions *)
  3613. i := indexListSize;
  3614. WHILE indexDim < targetArrayDimensionality DO
  3615. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3616. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3617. ReleaseOperand(sourceLength);
  3618. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3619. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3620. ReleaseOperand(sourceIncrement);
  3621. INC(i); INC(indexDim);
  3622. END;
  3623. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3624. tmp := nil;
  3625. ELSE
  3626. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3627. END;
  3628. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3629. ReleaseIntermediateOperand(tmp);
  3630. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3631. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3632. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3633. ELSE
  3634. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3635. END;
  3636. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3637. ReleaseIntermediateOperand(tmp);
  3638. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3639. (* write dimensionality *)
  3640. IF targetArrayDimensionality # 0 THEN
  3641. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3642. END;
  3643. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3644. END;
  3645. ReleaseOperand(array);
  3646. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3647. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3648. END;
  3649. END MathIndexDesignator;
  3650. (* TENTATIVE *)
  3651. PROCEDURE DumpOperand(operand: Operand);
  3652. BEGIN
  3653. D.Log.String(" op = ");
  3654. IntermediateCode.DumpOperand(D.Log, operand.op );
  3655. D.Log.Ln;
  3656. D.Log.String(" tag = ");
  3657. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3658. D.Log.Ln;
  3659. D.Log.String(" extra = ");
  3660. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3661. D.Log.Ln;
  3662. D.Log.Update
  3663. END DumpOperand;
  3664. (* get the length of an array , trying to make use of static information *)
  3665. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3666. VAR res: IntermediateCode.Operand; size: LONGINT;
  3667. BEGIN
  3668. type := type.resolved;
  3669. IF type IS SyntaxTree.ArrayType THEN
  3670. WITH type: SyntaxTree.ArrayType DO
  3671. IF type.form = SyntaxTree.Static THEN
  3672. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3673. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3674. Evaluate(type.length, op);
  3675. ReleaseIntermediateOperand(op.tag);
  3676. RETURN op.op;*)
  3677. ELSE
  3678. res := tag;
  3679. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3680. IntermediateCode.MakeMemory(res,addressType);
  3681. UseIntermediateOperand(res);
  3682. RETURN res
  3683. END
  3684. END;
  3685. ELSE
  3686. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3687. RETURN IntermediateCode.Immediate(addressType,size);
  3688. END;
  3689. END ArrayLength;
  3690. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3691. BEGIN
  3692. ReleaseIntermediateOperand(res);
  3693. IF IsImmediate(x) & IsImmediate(y) THEN
  3694. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3695. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3696. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3697. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3698. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3699. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3700. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3701. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3702. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3703. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3704. UseIntermediateOperand(res);
  3705. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3706. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3707. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3708. UseIntermediateOperand(res);
  3709. ELSE
  3710. IF ~ReusableRegister(res) THEN
  3711. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3712. ELSE
  3713. UseIntermediateOperand(res);
  3714. END;
  3715. IF IsImmediate(x) & (x.intValue = 0) THEN
  3716. Emit(Mov(position,res,y))
  3717. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3718. Emit(Mov(position,res,x))
  3719. ELSE
  3720. Emit(Add(position,res, x, y));
  3721. END;
  3722. END;
  3723. END AddInt;
  3724. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3725. BEGIN
  3726. ReleaseIntermediateOperand(res);
  3727. IF IsImmediate(x) & IsImmediate(y) THEN
  3728. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3729. ELSE
  3730. IF ~ReusableRegister(res) THEN
  3731. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3732. ELSE UseIntermediateOperand(res);
  3733. END;
  3734. IF IsImmediate(x) & (x.intValue = 1) THEN
  3735. Emit(Mov(position,res,y))
  3736. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3737. Emit(Mov(position,res,x))
  3738. ELSE
  3739. Emit(Mul(position,res, x, y));
  3740. END;
  3741. END;
  3742. END MulInt;
  3743. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3744. BEGIN
  3745. ReleaseIntermediateOperand(res);
  3746. IF IsImmediate(x) & IsImmediate(y) THEN
  3747. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3748. ELSE
  3749. IF ~ReusableRegister(res) THEN
  3750. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3751. ELSE UseIntermediateOperand(res);
  3752. END;
  3753. IF IsImmediate(x) & (x.intValue = 1) THEN
  3754. Emit(Mov(position,res,y))
  3755. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3756. Emit(Mov(position,res,x))
  3757. ELSE
  3758. Emit(Div(position,res, x, y));
  3759. END;
  3760. END;
  3761. END DivInt;
  3762. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3763. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3764. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3765. BEGIN
  3766. type := x.left.type.resolved;
  3767. IF type IS SyntaxTree.StringType THEN
  3768. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3769. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3770. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3771. type := atype;
  3772. x.left.SetType(type);
  3773. END;
  3774. IntermediateCode.InitImmediate(res,addressType,0);
  3775. maxDim := x.parameters.Length()-1;
  3776. FOR i := 0 TO maxDim DO
  3777. e := x.parameters.GetExpression(i);
  3778. Evaluate(e,index);
  3779. Convert(index.op,addressType);
  3780. AddInt(res, res, index.op);
  3781. IF i = 0 THEN
  3782. (*
  3783. ReuseCopy(res, index.op);
  3784. *)
  3785. Designate(x.left,array);
  3786. type := x.left.type.resolved;
  3787. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3788. Dereference(array, type, FALSE);
  3789. END;
  3790. (*
  3791. ELSE AddInt(res, res, index.op);
  3792. *)
  3793. END;
  3794. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3795. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3796. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3797. BoundCheck(index.op, length);
  3798. END;
  3799. ReleaseIntermediateOperand(length);
  3800. END;
  3801. ReleaseOperand(index);
  3802. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3803. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3804. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3805. MulInt(res,res,length);
  3806. END;
  3807. ReleaseIntermediateOperand(length);
  3808. END;
  3809. IF (type IS SyntaxTree.ArrayType) THEN
  3810. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3811. size := StaticSize(system, type);
  3812. IF size # 1 THEN
  3813. length := IntermediateCode.Immediate(addressType,size);
  3814. MulInt(res,res,length);
  3815. END;
  3816. ELSE
  3817. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3818. IF size # 1 THEN
  3819. length := IntermediateCode.Immediate(addressType,size);
  3820. MulInt(res,res,length);
  3821. END;
  3822. END;
  3823. END;
  3824. AddInt(res,res,array.op);
  3825. InitOperand(result,ModeReference);
  3826. result.op := res;
  3827. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3828. ReleaseIntermediateOperand(result.tag);
  3829. result.tag := TypeDescriptorAdr(type);
  3830. IF ~newObjectFile THEN
  3831. IntermediateCode.MakeMemory(result.tag,addressType);
  3832. END
  3833. ELSIF IsDelegate(type) THEN
  3834. ReleaseIntermediateOperand(result.tag);
  3835. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3836. UseIntermediateOperand(result.tag);
  3837. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3838. ReleaseIntermediateOperand(result.tag);
  3839. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3840. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3841. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3842. END;
  3843. ReleaseOperand(array);
  3844. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3845. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3846. END;
  3847. END IndexDesignator;
  3848. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3849. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3850. BEGIN
  3851. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3852. dest := destination; destination := emptyOperand;
  3853. type := x.left.type.resolved;
  3854. IF type IS SyntaxTree.MathArrayType THEN
  3855. MathIndexDesignator(x);
  3856. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3857. IndexDesignator(x);
  3858. END;
  3859. destination := dest;
  3860. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3861. END VisitIndexDesignator;
  3862. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3863. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3864. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3865. procedure: SyntaxTree.Procedure;
  3866. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3867. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3868. BEGIN
  3869. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3870. parameters := expression.parameters;
  3871. moduleName := "FoxArrayBase";
  3872. procedureName := "CopyDescriptor";
  3873. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3874. SaveRegisters();ReleaseUsedRegisters(saved);
  3875. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3876. IF procedure = NIL THEN
  3877. s := "procedure ";
  3878. Strings.Append(s,moduleName);
  3879. Strings.Append(s,".");
  3880. Strings.Append(s,procedureName);
  3881. Strings.Append(s," not present");
  3882. Error(position,s);
  3883. ELSE
  3884. (* push address of temporary variable *)
  3885. Symbol(variable,destOperand);
  3886. Emit(Push(position,destOperand.op));
  3887. ReleaseOperand(destOperand);
  3888. (* push src *)
  3889. Evaluate(expression.left,srcOperand);
  3890. (*
  3891. Dereference(srcOperand,expression.type.resolved);
  3892. Emit(Push(position,srcOperand.tag));
  3893. *)
  3894. Emit(Push(position,srcOperand.op));
  3895. ReleaseOperand(srcOperand);
  3896. tensorFound := FALSE;
  3897. FOR i := 0 TO parameters.Length()-1 DO
  3898. e := parameters.GetExpression(i);
  3899. IF e IS SyntaxTree.TensorRangeExpression THEN
  3900. tensorFound := TRUE;
  3901. ELSIF e IS SyntaxTree.RangeExpression THEN
  3902. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3903. ELSE
  3904. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3905. END;
  3906. END;
  3907. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3908. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3909. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3910. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3911. StaticCallOperand(procOp,procedure);
  3912. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3913. ReleaseOperand(procOp);
  3914. END;
  3915. RestoreRegisters(saved);
  3916. END;
  3917. RETURN variable
  3918. END PrepareTensorDescriptor;
  3919. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3920. VAR
  3921. type, descriptorType, baseType: SyntaxTree.Type;
  3922. operand, tmpOperand, variableOp, variable2Op: Operand;
  3923. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3924. variable, variable2: SyntaxTree.Variable;
  3925. dim, i, size: LONGINT;
  3926. (* TODO: needed? *)
  3927. oldArrayDestinationTag: IntermediateCode.Operand;
  3928. oldArrayDestinationDimension: LONGINT;
  3929. position: LONGINT;
  3930. saved: RegisterEntry;
  3931. arrayFlags: SET;
  3932. m, n: LONGINT;
  3933. PROCEDURE Pass(op: IntermediateCode.Operand);
  3934. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3935. BEGIN
  3936. IF numberRegister >= 0 THEN
  3937. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3938. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3939. Emit(Mov(position,parameterRegister, op));
  3940. ELSE
  3941. Emit(Push(position,op))
  3942. END
  3943. END Pass;
  3944. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3945. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3946. BEGIN
  3947. formalType := formalType.resolved; actualType := actualType.resolved;
  3948. IF IsOpenArray(formalType)THEN
  3949. IF actualType IS SyntaxTree.StringType THEN
  3950. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3951. RETURN;
  3952. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3953. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3954. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3955. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3956. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3957. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3958. ELSE
  3959. tmp := baseReg;
  3960. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3961. IntermediateCode.MakeMemory(tmp,addressType);
  3962. Pass((tmp));
  3963. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3964. END;
  3965. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3966. END;
  3967. END PushArrayLens;
  3968. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3969. BEGIN
  3970. CASE size OF
  3971. |2: INCL(flags,Size2Flag);
  3972. |3: INCL(flags,Size3Flag);
  3973. |4: INCL(flags,Size4Flag);
  3974. |5: INCL(flags,Size5Flag);
  3975. |6: INCL(flags,Size6Flag);
  3976. |7: INCL(flags,Size7Flag);
  3977. |8: INCL(flags,Size8Flag);
  3978. END;
  3979. END SetSmallArraySizeFlag;
  3980. BEGIN
  3981. IF Trace THEN TraceEnter("PushParameter") END;
  3982. position := expression.position;
  3983. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3984. type := expression.type.resolved;
  3985. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3986. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3987. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3988. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3989. );
  3990. (* TODO: needed? *)
  3991. oldArrayDestinationTag := arrayDestinationTag;
  3992. oldArrayDestinationDimension := arrayDestinationDimension;
  3993. IF IsArrayOfSystemByte(parameter.type) THEN
  3994. Designate(expression,operand);
  3995. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3996. ReleaseIntermediateOperand(operand.tag);
  3997. operand.tag := tmp;
  3998. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3999. Pass((operand.tag));
  4000. END;
  4001. Pass((operand.op));
  4002. ELSIF IsOpenArray(parameter.type) THEN
  4003. Designate(expression,operand);
  4004. baseReg := operand.tag;
  4005. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4006. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4007. END;
  4008. Pass((operand.op)); (* address of the array *)
  4009. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4010. (* case 1 *)
  4011. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4012. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4013. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4014. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4015. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4016. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4017. arrayDestinationTag := sp;
  4018. (* case 1b *)
  4019. IF expression IS SyntaxTree.IndexDesignator THEN
  4020. (*
  4021. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4022. descriptorType := GetMathArrayDescriptorType(dim);
  4023. variable := GetTemporaryVariable(descriptorType,expression.position);
  4024. Symbol(variable,variableOp);
  4025. arrayDestinationTag := variableOp.op;
  4026. *)
  4027. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4028. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4029. arrayDestinationDimension := dim;
  4030. Designate(expression,operand);
  4031. (* case 1a *)
  4032. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4033. Designate(expression,operand);
  4034. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4035. i := 0;
  4036. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4037. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4038. INC(i);
  4039. END;
  4040. type := expression.type.resolved;
  4041. WHILE (i<dim) DO (* remaining static dimensions *)
  4042. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4043. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4044. ReleaseOperand(tmpOperand);
  4045. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4046. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4047. ReleaseOperand(tmpOperand);
  4048. INC(i);
  4049. END;
  4050. dimOp := IntermediateCode.Immediate(addressType,dim);
  4051. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4052. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4053. (* case 1d *)
  4054. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4055. Designate(expression,operand);
  4056. Dereference(operand,type.resolved,FALSE);
  4057. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4058. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4059. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4060. (* case 1f *)
  4061. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  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. (*******
  4072. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4073. *)
  4074. arrayFlags := {StaticFlag};
  4075. IF dim = 1 THEN
  4076. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4077. ReleaseOperand(tmpOperand);
  4078. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4079. m := LONGINT(tmpOperand.op.intValue);
  4080. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4081. ELSIF dim = 2 THEN
  4082. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4083. ReleaseOperand(tmpOperand);
  4084. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4085. m := LONGINT(tmpOperand.op.intValue);
  4086. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4087. ReleaseOperand(tmpOperand);
  4088. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4089. n := LONGINT(tmpOperand.op.intValue);
  4090. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4091. INCL(arrayFlags,SmallMatrixFlag);
  4092. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4093. END;
  4094. END;
  4095. (*******)
  4096. dimOp := IntermediateCode.Immediate(addressType,dim);
  4097. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4098. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4099. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4100. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4101. baseType := SemanticChecker.ArrayBase(type,dim);
  4102. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4103. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4104. ELSE HALT(100);
  4105. END;
  4106. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4107. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4108. (* case 2b *)
  4109. IF expression IS SyntaxTree.IndexDesignator THEN
  4110. descriptorType := GetMathArrayDescriptorType(dim);
  4111. variable := GetTemporaryVariable(descriptorType, FALSE);
  4112. Symbol(variable,variableOp);
  4113. arrayDestinationTag := variableOp.op;
  4114. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4115. arrayDestinationDimension := dim;
  4116. NeedDescriptor := TRUE;
  4117. Designate(expression,operand);
  4118. Pass((operand.tag));
  4119. NeedDescriptor := FALSE;
  4120. (* case 2a *)
  4121. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4122. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4123. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4124. INC(i);
  4125. END;
  4126. IF i = dim THEN
  4127. Designate(expression,operand);
  4128. Pass((operand.tag));
  4129. ELSE (* open-static *)
  4130. type := expression.type.resolved;
  4131. descriptorType := GetMathArrayDescriptorType(dim);
  4132. variable := GetTemporaryVariable(descriptorType, FALSE);
  4133. Symbol(variable,variableOp);
  4134. arrayDestinationTag := variableOp.op;
  4135. Designate(expression,operand);
  4136. FOR i := 0 TO dim-1 DO
  4137. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4138. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4139. ReleaseOperand(tmpOperand);
  4140. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4141. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4142. ReleaseOperand(tmpOperand);
  4143. END;
  4144. dimOp := IntermediateCode.Immediate(addressType,dim);
  4145. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4146. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4147. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4148. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4149. baseType := SemanticChecker.ArrayBase(type,dim);
  4150. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4151. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4152. Pass((arrayDestinationTag));
  4153. END;
  4154. (* case 2d *)
  4155. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4156. Designate(expression,operand);
  4157. Dereference(operand,type.resolved,FALSE);
  4158. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4159. Pass((operand.tag));
  4160. (* case 2f *)
  4161. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4162. descriptorType := GetMathArrayDescriptorType(dim);
  4163. variable := GetTemporaryVariable(descriptorType, FALSE);
  4164. Symbol(variable,variableOp);
  4165. arrayDestinationTag := variableOp.op;
  4166. Designate(expression,operand);
  4167. FOR i := 0 TO dim-1 DO
  4168. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4169. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4170. ReleaseOperand(tmpOperand);
  4171. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4172. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4173. ReleaseOperand(tmpOperand);
  4174. END;
  4175. (*
  4176. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4177. *)
  4178. arrayFlags := {StaticFlag};
  4179. IF dim = 1 THEN
  4180. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4181. ReleaseOperand(tmpOperand);
  4182. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4183. m := LONGINT(tmpOperand.op.intValue);
  4184. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4185. ELSIF dim = 2 THEN
  4186. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4187. ReleaseOperand(tmpOperand);
  4188. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4189. m := LONGINT(tmpOperand.op.intValue);
  4190. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4191. ReleaseOperand(tmpOperand);
  4192. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4193. n := LONGINT(tmpOperand.op.intValue);
  4194. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4195. INCL(arrayFlags,SmallMatrixFlag);
  4196. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4197. END;
  4198. END;
  4199. (*******)
  4200. dimOp := IntermediateCode.Immediate(addressType,dim);
  4201. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4202. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4203. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4204. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4205. baseType := SemanticChecker.ArrayBase(type,dim);
  4206. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4207. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4208. Pass((arrayDestinationTag));
  4209. ELSE HALT(100);
  4210. END;
  4211. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4212. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4213. (* case 3b *)
  4214. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4215. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4216. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4217. Symbol(variable,variableOp);
  4218. LoadValue(variableOp,system.addressType);
  4219. ELSE
  4220. descriptorType := GetMathArrayDescriptorType(dim);
  4221. variable := GetTemporaryVariable(descriptorType, FALSE);
  4222. Symbol(variable,variableOp);
  4223. END;
  4224. arrayDestinationTag := variableOp.op;
  4225. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4226. arrayDestinationDimension := 0;
  4227. Designate(expression,operand);
  4228. Pass((operand.tag));
  4229. (* case 3a *)
  4230. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4231. i := 0;
  4232. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4233. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4234. INC(i);
  4235. END;
  4236. IF i = dim THEN
  4237. Designate(expression,operand);
  4238. Pass((operand.tag));
  4239. ELSE (* open-static *)
  4240. type := expression.type.resolved;
  4241. descriptorType := GetMathArrayDescriptorType(dim);
  4242. variable := GetTemporaryVariable(descriptorType, FALSE);
  4243. Symbol(variable,variableOp);
  4244. arrayDestinationTag := variableOp.op;
  4245. Designate(expression,operand);
  4246. FOR i := 0 TO dim-1 DO
  4247. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4248. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4249. ReleaseOperand(tmpOperand);
  4250. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4251. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4252. ReleaseOperand(tmpOperand);
  4253. END;
  4254. dimOp := IntermediateCode.Immediate(addressType,dim);
  4255. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4256. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4257. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4258. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4259. baseType := SemanticChecker.ArrayBase(type,dim);
  4260. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4261. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4262. Pass((arrayDestinationTag));
  4263. END;
  4264. (* case 3d *)
  4265. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4266. Designate(expression,operand);
  4267. Dereference(operand,type.resolved,FALSE);
  4268. (*
  4269. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4270. *)
  4271. Pass((operand.tag));
  4272. (* case 3f *)
  4273. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4274. descriptorType := GetMathArrayDescriptorType(dim);
  4275. variable := GetTemporaryVariable(descriptorType, FALSE);
  4276. Symbol(variable,variableOp);
  4277. arrayDestinationTag := variableOp.op;
  4278. Designate(expression,operand);
  4279. IF operand.op.type.length >1 THEN (* vector register *)
  4280. variable2 := GetTemporaryVariable(type, FALSE);
  4281. Symbol(variable2, variable2Op);
  4282. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4283. Emit(Mov(position,tmp, operand.op));
  4284. ReleaseOperand(operand);
  4285. Symbol(variable2, operand);
  4286. END;
  4287. FOR i := 0 TO dim-1 DO
  4288. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4289. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4290. ReleaseOperand(tmpOperand);
  4291. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4292. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4293. ReleaseOperand(tmpOperand);
  4294. END;
  4295. dimOp := IntermediateCode.Immediate(addressType,dim);
  4296. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4297. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4298. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4299. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4300. baseType := SemanticChecker.ArrayBase(type,dim);
  4301. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4302. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4303. Pass((arrayDestinationTag));
  4304. ELSE HALT(100);
  4305. END;
  4306. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4307. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4308. (* case 4b *)
  4309. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4310. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4311. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4312. Symbol(variable,variableOp);
  4313. LoadValue(variableOp,system.addressType);
  4314. ELSE
  4315. descriptorType := GetMathArrayDescriptorType(dim);
  4316. variable := GetTemporaryVariable(descriptorType, FALSE);
  4317. Symbol(variable,variableOp);
  4318. END;
  4319. arrayDestinationTag := variableOp.op;
  4320. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4321. arrayDestinationDimension := 0;
  4322. Designate(expression,operand);
  4323. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4324. Symbol(variable,variableOp);
  4325. ELSE
  4326. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4327. Symbol(variable,variableOp);
  4328. MakeMemory(tmp,variableOp.op,addressType,0);
  4329. Emit(Mov(position,tmp,operand.tag));
  4330. ReleaseIntermediateOperand(tmp);
  4331. END;
  4332. Pass((variableOp.op));
  4333. ReleaseOperand(variableOp);
  4334. (* case 4a *)
  4335. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4336. i := 0;
  4337. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4338. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4339. INC(i);
  4340. END;
  4341. IF i = dim THEN
  4342. Designate(expression,operand);
  4343. arrayDestinationTag := operand.tag;
  4344. ELSE (* open-static *)
  4345. type := expression.type.resolved;
  4346. descriptorType := GetMathArrayDescriptorType(dim);
  4347. variable := GetTemporaryVariable(descriptorType, FALSE);
  4348. Symbol(variable,variableOp);
  4349. arrayDestinationTag := variableOp.op;
  4350. Designate(expression,operand);
  4351. FOR i := 0 TO dim-1 DO
  4352. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4353. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4354. ReleaseOperand(tmpOperand);
  4355. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4356. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4357. ReleaseOperand(tmpOperand);
  4358. END;
  4359. dimOp := IntermediateCode.Immediate(addressType,dim);
  4360. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4361. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4362. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4363. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4364. baseType := SemanticChecker.ArrayBase(type,dim);
  4365. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4366. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4367. END;
  4368. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4369. Symbol(variable,variableOp);
  4370. MakeMemory(tmp,variableOp.op,addressType,0);
  4371. Emit(Mov(position,tmp,arrayDestinationTag));
  4372. ReleaseIntermediateOperand(tmp);
  4373. Pass((variableOp.op));
  4374. ReleaseOperand(variableOp);
  4375. (* case 4d *)
  4376. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4377. Designate(expression,operand);
  4378. (*
  4379. Dereference(operand,type.resolved,FALSE);
  4380. *)
  4381. (*
  4382. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4383. *)
  4384. Pass((operand.op));
  4385. (* case 4f *)
  4386. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4387. descriptorType := GetMathArrayDescriptorType(dim);
  4388. variable := GetTemporaryVariable(descriptorType, FALSE);
  4389. Symbol(variable,variableOp);
  4390. arrayDestinationTag := variableOp.op;
  4391. Designate(expression,operand);
  4392. FOR i := 0 TO dim-1 DO
  4393. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4394. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4395. ReleaseOperand(tmpOperand);
  4396. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4397. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4398. ReleaseOperand(tmpOperand);
  4399. END;
  4400. dimOp := IntermediateCode.Immediate(addressType,dim);
  4401. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4402. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4403. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4404. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4405. baseType := SemanticChecker.ArrayBase(type,dim);
  4406. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4407. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4408. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4409. Symbol(variable,variableOp);
  4410. MakeMemory(tmp,variableOp.op,addressType,0);
  4411. Emit(Mov(position,tmp,arrayDestinationTag));
  4412. ReleaseIntermediateOperand(tmp);
  4413. Pass((variableOp.op));
  4414. ReleaseOperand(variableOp);
  4415. ELSE HALT(100);
  4416. END;
  4417. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4418. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4419. Designate(expression,operand);
  4420. IF operand.op.type.length > 1 THEN
  4421. Emit(Push(position, operand.op));
  4422. ReleaseOperand(operand);
  4423. ELSE
  4424. size := system.SizeOf(type);
  4425. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4426. size := ToMemoryUnits(system,size);
  4427. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4428. arrayDestinationTag := sp;
  4429. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4430. END;
  4431. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4432. Designate(expression,operand);
  4433. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4434. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4435. Symbol(variable,variableOp);
  4436. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4437. Emit(Mov(position,tmp,operand.op));
  4438. Emit(Push(position,variableOp.op));
  4439. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4440. Pass((operand.op));
  4441. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4442. END;
  4443. ELSE HALT(200)
  4444. END;
  4445. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4446. IF parameter.kind = SyntaxTree.VarParameter THEN
  4447. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4448. Designate(expression, operand);
  4449. Pass((operand.op));
  4450. ELSE
  4451. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4452. Evaluate(expression, operand);
  4453. Pass((operand.extra)); (* step *)
  4454. Pass((operand.tag)); (* last *)
  4455. Pass((operand.op)) (* first *)
  4456. END
  4457. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4458. IF parameter.kind = SyntaxTree.VarParameter THEN
  4459. Designate(expression, operand);
  4460. Pass((operand.op));
  4461. ELSE
  4462. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4463. Evaluate(expression, operand);
  4464. Pass((operand.tag)); (* real part *)
  4465. Pass((operand.op)) (* imaginary part *)
  4466. END
  4467. ELSE
  4468. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4469. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4470. Designate(expression,operand);
  4471. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4472. (* stack allocation *)
  4473. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4474. (*! parameter alignment to be discussed ... *)
  4475. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4476. size := type(SyntaxTree.StringType).length;
  4477. END;
  4478. IF backend.cooperative & parameter.NeedsTrace() THEN
  4479. dst := NewRegisterOperand (addressType);
  4480. Emit(Mov(position,dst, sp));
  4481. IntermediateCode.InitImmediate(null, byteType, 0);
  4482. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4483. ReleaseIntermediateOperand(dst);
  4484. SaveRegisters();ReleaseUsedRegisters(saved);
  4485. (* register dst has been freed before SaveRegisters already *)
  4486. CallAssignMethod(dst, operand.op, parameter.type);
  4487. RestoreRegisters(saved);
  4488. END;
  4489. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4490. ELSIF IsOpenArray(parameter.type) THEN
  4491. Designate(expression,operand);
  4492. baseReg := operand.tag;
  4493. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4494. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4495. END;
  4496. Pass((operand.op)); (* address of the array *)
  4497. ELSIF IsDelegate(parameter.type) THEN
  4498. Evaluate(expression,operand);
  4499. IF backend.cooperative & parameter.NeedsTrace() THEN
  4500. Emit(Push(position, nil));
  4501. dst := NewRegisterOperand (addressType);
  4502. Emit(Mov(position,dst, sp));
  4503. ReleaseIntermediateOperand(dst);
  4504. SaveRegisters();ReleaseUsedRegisters(saved);
  4505. Emit(Push(position, dst));
  4506. (* register dst has been freed before SaveRegisters already *)
  4507. Emit(Push(position, operand.tag));
  4508. CallThis(position,"GarbageCollector","Assign",2);
  4509. RestoreRegisters(saved);
  4510. ELSE
  4511. Pass((operand.tag));
  4512. END;
  4513. Pass((operand.op));
  4514. ELSE
  4515. Evaluate(expression,operand);
  4516. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4517. Emit(Push(position, nil));
  4518. dst := NewRegisterOperand (addressType);
  4519. Emit(Mov(position,dst, sp));
  4520. ReleaseIntermediateOperand(dst);
  4521. SaveRegisters();ReleaseUsedRegisters(saved);
  4522. Emit(Push(position, dst));
  4523. (* register dst has been freed before SaveRegisters already *)
  4524. Emit(Push(position, operand.op));
  4525. CallThis(position,"GarbageCollector","Assign",2);
  4526. RestoreRegisters(saved);
  4527. ELSE
  4528. Pass((operand.op));
  4529. END;
  4530. END;
  4531. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4532. Evaluate(expression,operand);
  4533. Pass((operand.op));
  4534. ELSE (* var parameter *)
  4535. Designate(expression,operand);
  4536. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4537. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4538. Pass((operand.tag));
  4539. END;
  4540. END;
  4541. Pass((operand.op));
  4542. END;
  4543. END;
  4544. (* TODO: needed? *)
  4545. arrayDestinationTag := oldArrayDestinationTag;
  4546. arrayDestinationDimension := oldArrayDestinationDimension;
  4547. IF needsParameterBackup THEN
  4548. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4549. ReuseCopy(parameterBackup, operand.op)
  4550. END;
  4551. ReleaseOperand(operand);
  4552. IF Trace THEN TraceExit("PushParameter") END;
  4553. END PushParameter;
  4554. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4555. VAR prevConditional: BOOLEAN;
  4556. BEGIN
  4557. prevConditional := conditional;
  4558. conditional := FALSE;
  4559. 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
  4560. Expression(x.result); (* use register *)
  4561. END;
  4562. Statement(x.statement);
  4563. conditional := prevConditional;
  4564. IF x.result # NIL THEN Expression(x.result) END;
  4565. 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
  4566. ReleaseIntermediateOperand(result.op);
  4567. END;
  4568. END VisitStatementDesignator;
  4569. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4570. VAR
  4571. procedure: SyntaxTree.Procedure;
  4572. procedureType: SyntaxTree.ProcedureType;
  4573. wasInline: BOOLEAN;
  4574. actualParameters: SyntaxTree.ExpressionList;
  4575. formalParameter: SyntaxTree.Parameter;
  4576. actualParameter: SyntaxTree.Expression;
  4577. i: LONGINT;
  4578. localVariable: SyntaxTree.Variable;
  4579. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4580. src, dest: Operand;
  4581. prevInlineExit : Label;
  4582. prevMapper: SymbolMapper;
  4583. tooComplex: BOOLEAN;
  4584. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4585. BEGIN
  4586. IF e = NIL THEN RETURN TRUE
  4587. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4588. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4589. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4590. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4591. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4592. ELSE RETURN FALSE
  4593. END;
  4594. END SimpleExpression;
  4595. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4596. BEGIN
  4597. RETURN checker.CanPassInRegister(type)
  4598. END FitsInRegister;
  4599. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4600. VAR
  4601. variable: SyntaxTree.Variable;
  4602. variableDesignator: SyntaxTree.Designator;
  4603. BEGIN
  4604. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4605. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4606. variableDesignator.SetType(type);
  4607. RETURN variableDesignator
  4608. END GetTemp;
  4609. BEGIN
  4610. wasInline := currentIsInline;
  4611. prevInlineExit := currentInlineExit;
  4612. prevMapper := currentMapper;
  4613. currentInlineExit := NewLabel();
  4614. tooComplex := FALSE;
  4615. NEW(currentMapper);
  4616. currentIsInline := TRUE;
  4617. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4618. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4619. formalParameter := procedureType.firstParameter;
  4620. actualParameters := x.parameters;
  4621. i := 0;
  4622. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4623. actualParameter := actualParameters.GetExpression(i);
  4624. IF actualParameter.resolved # NIL THEN
  4625. actualParameter := actualParameter.resolved
  4626. END;
  4627. (*
  4628. if expression is simple and can be passed immediately
  4629. or if type fits in register then we can proceed
  4630. otherwise we escape to ordinary procedure call.
  4631. *)
  4632. (* cases where the expression can be mapped identically *)
  4633. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4634. currentMapper.Add(formalParameter, actualParameter, NIL);
  4635. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4636. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4637. (*
  4638. Assign(variableDesignator, actualParameter);
  4639. *)
  4640. Evaluate(actualParameter, src);
  4641. Designate(variableDesignator, dest);
  4642. Emit(Mov(x.position, dest.op, src.op));
  4643. ReleaseOperand(dest);
  4644. ReleaseOperand(src);
  4645. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4646. ELSE tooComplex := TRUE
  4647. END;
  4648. (*
  4649. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4650. currentMapper.Add(formalParameter, actualParameter, NIL);
  4651. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4652. variableDesignator := GetTemp(system.addressType, FALSE);
  4653. Designate(actualParameter, src);
  4654. Designate(variableDesignator, dest);
  4655. IntermediateCode.MakeMemory(dest.op,addressType);
  4656. Emit(Mov(x.position, dest.op, src.op));
  4657. ReleaseOperand(dest);
  4658. IF src.tag.mode # IntermediateCode.Undefined THEN
  4659. tagDesignator := GetTemp(system.addressType, FALSE);
  4660. Designate(tagDesignator, dest);
  4661. IntermediateCode.MakeMemory(dest.op,addressType);
  4662. Emit(Mov(x.position, dest.op, src.op));
  4663. END;
  4664. ReleaseOperand(dest); ReleaseOperand(src);
  4665. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4666. END;
  4667. *)
  4668. formalParameter := formalParameter.nextParameter;
  4669. INC(i);
  4670. END;
  4671. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4672. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4673. currentMapper.Add(NIL, returnDesignator, NIL);
  4674. END;
  4675. localVariable := procedure.procedureScope.firstVariable;
  4676. WHILE ~tooComplex & (localVariable # NIL) DO
  4677. variableDesignator := GetTemp(localVariable.type, FALSE);
  4678. currentMapper.Add(localVariable, variableDesignator, NIL);
  4679. localVariable := localVariable.nextVariable;
  4680. END;
  4681. IF ~tooComplex THEN
  4682. VisitStatementBlock(procedure.procedureScope.body);
  4683. SetLabel(currentInlineExit);
  4684. IF procedureType.returnType # NIL THEN
  4685. Designate(returnDesignator, result);
  4686. IF conditional THEN
  4687. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4688. ValueToCondition(result)
  4689. END;
  4690. END;
  4691. END;
  4692. currentMapper := prevMapper;
  4693. currentInlineExit := prevInlineExit;
  4694. currentIsInline := wasInline;
  4695. RETURN ~tooComplex
  4696. END InlineProcedureCall;
  4697. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4698. VAR
  4699. parameters: SyntaxTree.ExpressionList;
  4700. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4701. designator: SyntaxTree.Designator;
  4702. procedureType: SyntaxTree.ProcedureType;
  4703. formalParameter: SyntaxTree.Parameter;
  4704. operand, returnValue: Operand;
  4705. reg, size, mask, dest: IntermediateCode.Operand;
  4706. saved: RegisterEntry;
  4707. symbol: SyntaxTree.Symbol;
  4708. variable: SyntaxTree.Variable;
  4709. i, parametersSize, returnTypeSize : LONGINT;
  4710. structuredReturnType: BOOLEAN;
  4711. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4712. tempVariableDesignator: SyntaxTree.Designator;
  4713. gap, alignment: LONGINT; (*fld*)
  4714. (* TODO: remove unnecessary backup variables *)
  4715. oldResult: Operand;
  4716. oldCurrentScope: SyntaxTree.Scope;
  4717. oldArrayDestinationTag: IntermediateCode.Operand;
  4718. oldArrayDestinationDimension: LONGINT;
  4719. oldConstantDeclaration: SyntaxTree.Symbol;
  4720. oldDestination: IntermediateCode.Operand;
  4721. oldCurrentLoop: Label;
  4722. oldConditional: BOOLEAN;
  4723. oldTrueLabel, oldFalseLabel: Label;
  4724. oldLocked: BOOLEAN;
  4725. usedRegisters,oldUsedRegisters: RegisterEntry;
  4726. return: IntermediateCode.Operand;
  4727. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4728. arg: IntermediateCode.Operand;
  4729. dummy: IntermediateCode.Operand;
  4730. recordType: SyntaxTree.RecordType;
  4731. operatorSelectionProcedureOperand: Operand;
  4732. operatorSelectionProcedure: SyntaxTree.Procedure;
  4733. fingerPrint: SyntaxTree.FingerPrint;
  4734. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4735. identifierNumber: LONGINT;
  4736. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4737. procedure: SyntaxTree.Procedure;
  4738. PROCEDURE BackupGlobalState;
  4739. BEGIN
  4740. oldResult := result;
  4741. oldCurrentScope := currentScope;
  4742. oldArrayDestinationTag := arrayDestinationTag;
  4743. oldArrayDestinationDimension := arrayDestinationDimension;
  4744. oldConstantDeclaration := constantDeclaration;
  4745. oldDestination := destination;
  4746. oldCurrentLoop := currentLoop;
  4747. oldConditional := conditional;
  4748. oldTrueLabel := trueLabel;
  4749. oldFalseLabel := falseLabel;
  4750. oldLocked := locked;
  4751. oldUsedRegisters := usedRegisters
  4752. END BackupGlobalState;
  4753. PROCEDURE RestoreGlobalState;
  4754. BEGIN
  4755. result := oldResult;
  4756. currentScope := oldCurrentScope;
  4757. arrayDestinationTag := oldArrayDestinationTag;
  4758. arrayDestinationDimension := oldArrayDestinationDimension;
  4759. constantDeclaration := oldConstantDeclaration;
  4760. destination := oldDestination;
  4761. currentLoop := oldCurrentLoop;
  4762. conditional := oldConditional;
  4763. trueLabel := oldTrueLabel;
  4764. falseLabel := oldFalseLabel;
  4765. locked := oldLocked;
  4766. usedRegisters := oldUsedRegisters
  4767. END RestoreGlobalState;
  4768. (** do preparations before parameter push for array-structured object types (ASOTs):
  4769. if ASOT is passed as VAR parameter:
  4770. - allocate temporary variable of math array type
  4771. - copy contents of ASOT to be passed to temporary variable
  4772. - use temporary variable as the actual parameter instead
  4773. - 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)
  4774. **)
  4775. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4776. VAR
  4777. expression: SyntaxTree.Expression;
  4778. BEGIN
  4779. IF actualParameter IS SyntaxTree.Designator THEN
  4780. designator := actualParameter(SyntaxTree.Designator);
  4781. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4782. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4783. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4784. ASSERT(checker # NIL);
  4785. checker.SetCurrentScope(currentScope);
  4786. (* allocate temporary variable *)
  4787. ASSERT(actualParameter.type # NIL);
  4788. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4789. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4790. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4791. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4792. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4793. ASSERT(tempVariableDesignator.type # NIL);
  4794. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4795. (* copy math array stored in actual parameter to temporary variable *)
  4796. BackupGlobalState;
  4797. AssignMathArray(tempVariableDesignator, actualParameter);
  4798. RestoreGlobalState;
  4799. (* use temporary variable as actual parameter instead of the original one *)
  4800. actualParameter := tempVariableDesignator;
  4801. (* create write-back call and store it in linked list *)
  4802. (* create new list entry *)
  4803. IF firstWriteBackCall = NIL THEN
  4804. NEW(firstWriteBackCall);
  4805. currentWriteBackCall := firstWriteBackCall
  4806. ELSE
  4807. ASSERT(currentWriteBackCall # NIL);
  4808. NEW(currentWriteBackCall.next);
  4809. currentWriteBackCall := currentWriteBackCall.next
  4810. END;
  4811. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4812. ASSERT(expression.type = NIL);
  4813. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4814. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4815. (* prepare writeback for any other "normal" indexer *)
  4816. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4817. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4818. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4819. Assign(tempVariableDesignator, actualParameter);
  4820. actualParameter := tempVariableDesignator;
  4821. IF firstWriteBackCall = NIL THEN
  4822. NEW(firstWriteBackCall);
  4823. currentWriteBackCall := firstWriteBackCall
  4824. ELSE
  4825. ASSERT(currentWriteBackCall # NIL);
  4826. NEW(currentWriteBackCall.next);
  4827. currentWriteBackCall := currentWriteBackCall.next
  4828. END;
  4829. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4830. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4831. END
  4832. END
  4833. END PrepareParameter;
  4834. BEGIN
  4835. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4836. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4837. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4838. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4839. IF InlineProcedureCall(x) THEN
  4840. RETURN
  4841. ELSE
  4842. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4843. END
  4844. END;
  4845. END;
  4846. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4847. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4848. dest := destination; destination := emptyOperand;
  4849. SaveRegisters();ReleaseUsedRegisters(saved);
  4850. parameters := x.parameters;
  4851. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4852. (* an operator is called *)
  4853. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4854. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4855. (* check if a dynamic operator call should be performed *)
  4856. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4857. ELSE
  4858. isCallOfDynamicOperator := FALSE
  4859. END;
  4860. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4861. Emit(Push(position, ap));
  4862. END;
  4863. alignment := procedureType.stackAlignment;
  4864. IF alignment > 1 THEN
  4865. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4866. Emit(Mov(position,reg, sp));
  4867. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4868. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4869. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4870. Emit(And(position,sp, sp, mask));
  4871. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4872. Emit(Push(position,reg));
  4873. (*
  4874. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4875. Emit(Mov(position,mem,reg));
  4876. *)
  4877. ReleaseIntermediateOperand(reg);
  4878. END;
  4879. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4880. IntermediateCode.InitImmediate(mask,addressType,-16);
  4881. Emit(And(position,sp, sp, mask));
  4882. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4883. IF gap # 0 THEN
  4884. IntermediateCode.InitImmediate(size,addressType,gap);
  4885. Emit(Sub(position,sp,sp,size))
  4886. END;
  4887. END;
  4888. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4889. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4890. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4891. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4892. ELSE
  4893. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4894. END;
  4895. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4896. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4897. (* push ID *)
  4898. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4899. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4900. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4901. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4902. formalParameter := procedureType.firstParameter;
  4903. FOR i := 0 TO parameters.Length() - 1 DO
  4904. IF formalParameter.access # SyntaxTree.Hidden THEN
  4905. ASSERT(i < 2);
  4906. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4907. (* push pointer *)
  4908. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4909. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4910. (* add dereference *)
  4911. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4912. ReleaseIntermediateOperand(parameterBackups[i]);
  4913. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4914. END;
  4915. Emit(Push(position,parameterBackups[i]));
  4916. ReleaseIntermediateOperand(parameterBackups[i]);
  4917. (* push typetag *)
  4918. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4919. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4920. arg := TypeDescriptorAdr(recordType);
  4921. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4922. Emit(Push(position,arg));
  4923. ELSE
  4924. (* push 'NonPointer' *)
  4925. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4926. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4927. (* push fingerprint *)
  4928. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4929. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4930. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4931. END
  4932. END;
  4933. formalParameter := formalParameter.nextParameter
  4934. END;
  4935. (* for unary operators: complete the information for the second parameter *)
  4936. IF procedureType.numberParameters < 2 THEN
  4937. (* push 'NonPointer' *)
  4938. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4939. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4940. (* push 'NoType' *)
  4941. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4942. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4943. END;
  4944. (* call operator selection procedure *)
  4945. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4946. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4947. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4948. ReleaseOperand(operatorSelectionProcedureOperand);
  4949. (* use the address that the operator selection procedure returned as the target address of the call *)
  4950. InitOperand(operand, ModeValue);
  4951. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4952. Emit(Result(position,operand.op))
  4953. END
  4954. ELSE
  4955. Evaluate(x.left, operand)
  4956. END;
  4957. IF symbol IS SyntaxTree.Procedure THEN
  4958. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4959. Emit(Push(position,operand.tag));
  4960. ELSIF (procedureType.isDelegate) THEN
  4961. Emit(Push(position,operand.tag));
  4962. END;
  4963. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4964. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4965. Emit(Push(position,operand.tag));
  4966. END;
  4967. ELSE HALT(200);
  4968. END;
  4969. ReleaseIntermediateOperand(operand.tag);
  4970. operand.tag := emptyOperand;
  4971. (* determine if a structured return type is needed *)
  4972. structuredReturnType := StructuredReturnType(procedureType);
  4973. IF structuredReturnType THEN
  4974. IF resultDesignator # NIL THEN
  4975. d := resultDesignator;
  4976. ELSE
  4977. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4978. variable.SetUntraced(procedureType.hasUntracedReturn);
  4979. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4980. d.SetType(variable.type);
  4981. END;
  4982. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4983. Designate(d,returnValue);
  4984. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4985. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4986. Emit(Push(position,size));
  4987. Emit(Push(position,returnValue.op));
  4988. ReleaseOperand(returnValue);
  4989. ELSE
  4990. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4991. END;
  4992. END;
  4993. firstWriteBackCall := NIL; (* reset write-back call list *)
  4994. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4995. passByRegister := system.registerParameters > 0;
  4996. registerNumber := 0;
  4997. formalParameter := procedureType.lastParameter;
  4998. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4999. actualParameter := parameters.GetExpression(i);
  5000. PrepareParameter(actualParameter, formalParameter);
  5001. IF passByRegister & (i < system.registerParameters) THEN
  5002. IF ~PassInRegister(formalParameter) THEN
  5003. Error(actualParameter.position,"cannot be passed by register")
  5004. ELSE
  5005. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5006. END;
  5007. INC(registerNumber);
  5008. ELSE
  5009. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5010. END;
  5011. formalParameter := formalParameter.prevParameter;
  5012. END;
  5013. IF passByRegister & (registerNumber > 0) THEN
  5014. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5015. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5016. END;
  5017. ELSE
  5018. hasDynamicOperands := FALSE;
  5019. formalParameter := procedureType.firstParameter;
  5020. FOR i := 0 TO parameters.Length() - 1 DO
  5021. actualParameter := parameters.GetExpression(i);
  5022. IF formalParameter # NIL THEN (* TENTATIVE *)
  5023. PrepareParameter(actualParameter, formalParameter);
  5024. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5025. ASSERT(i < 2);
  5026. hasDynamicOperands := TRUE;
  5027. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5028. ELSE
  5029. IF passByRegister & (registerNumber > 0) THEN
  5030. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5031. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5032. END;
  5033. passByRegister := FALSE;
  5034. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5035. END;
  5036. formalParameter := formalParameter.nextParameter;
  5037. END;
  5038. END;
  5039. END;
  5040. IF symbol IS SyntaxTree.Procedure THEN
  5041. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5042. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5043. Emit(Push(position,reg));
  5044. ReleaseIntermediateOperand(reg);
  5045. END;
  5046. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5047. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5048. parametersSize := ParametersSize(system,procedureType,FALSE);
  5049. END;
  5050. ReleaseParameterRegisters();
  5051. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5052. Emit(Call(position,operand.op,0));
  5053. ELSE
  5054. Emit(Call(position,operand.op,parametersSize));
  5055. END;
  5056. ReleaseOperand(operand);
  5057. IF procedureType.noReturn THEN
  5058. EmitTrap(position,NoReturnTrap);
  5059. END;
  5060. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5061. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5062. Emit(Result(position,return));
  5063. END;
  5064. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5065. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5066. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5067. END;
  5068. size := IntermediateCode.Immediate(addressType,parametersSize);
  5069. Emit(Add(position,sp,sp,size));
  5070. END;
  5071. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5072. IF structuredReturnType THEN
  5073. (* stack pointer rewinding done by callee
  5074. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5075. Emit(Add(position,sp,sp,size));
  5076. *)
  5077. RestoreRegisters(saved);
  5078. InitOperand(result,ModeReference);
  5079. Symbol(variable,result);
  5080. ELSE
  5081. RestoreRegisters(saved);
  5082. InitOperand(result,ModeValue);
  5083. result.op := return;
  5084. END;
  5085. END;
  5086. IF alignment > 1 THEN
  5087. Emit(Pop(position,sp));
  5088. END;
  5089. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5090. Emit(Pop(position, ap));
  5091. END;
  5092. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5093. ValueToCondition(result);
  5094. END;
  5095. destination := dest;
  5096. (* perform all write-back calls in the list *)
  5097. BackupGlobalState;
  5098. currentWriteBackCall := firstWriteBackCall;
  5099. WHILE currentWriteBackCall # NIL DO
  5100. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5101. currentWriteBackCall := currentWriteBackCall.next
  5102. END;
  5103. RestoreGlobalState;
  5104. (* TENATIVE *)
  5105. (*
  5106. IF isOperatorCall THEN
  5107. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5108. END;
  5109. *)
  5110. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5111. END VisitProcedureCallDesignator;
  5112. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5113. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5114. td: SyntaxTree.Symbol;
  5115. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5116. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5117. BEGIN
  5118. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5119. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5120. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5121. variable.SetType(system.anyType);
  5122. scope.AddVariable(variable);
  5123. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5124. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5125. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5126. typeDeclaration.SetScope(module.module.moduleScope);
  5127. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5128. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5129. END;
  5130. RETURN hiddenPointerType;
  5131. END GetHiddenPointerType;
  5132. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5133. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5134. BEGIN
  5135. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5136. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5137. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5138. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5139. scope.AddVariable(variable);
  5140. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5141. variable.SetType(system.anyType);
  5142. scope.AddVariable(variable);
  5143. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5144. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5145. typeDeclaration.SetDeclaredType(delegatePointerType);
  5146. typeDeclaration.SetScope(module.module.moduleScope);
  5147. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5148. delegatePointerType.SetState(SyntaxTree.Resolved);
  5149. END;
  5150. RETURN delegatePointerType
  5151. END GetDelegateType;
  5152. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5153. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5154. such as in VAR a: RECORD ... END;
  5155. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5156. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5157. *)
  5158. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5159. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5160. BEGIN (* no code emission *)
  5161. source := NIL;
  5162. x := x.resolved;
  5163. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5164. x := GetHiddenPointerType();
  5165. ELSIF IsDelegate(x) THEN
  5166. x := GetDelegateType();
  5167. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5168. ELSE HALT(200);
  5169. END;
  5170. td := x.typeDeclaration;
  5171. IF td = NIL THEN
  5172. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5173. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5174. ASSERT(td # NIL);
  5175. END;
  5176. IF newObjectFile THEN
  5177. GetCodeSectionNameForSymbol(td,name);
  5178. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5179. meta.CheckTypeDeclaration(x);
  5180. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5181. ELSE
  5182. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5183. END;
  5184. IF backend.cooperative OR meta.simple THEN
  5185. offset := 0;
  5186. ELSE
  5187. IF x IS SyntaxTree.CellType THEN
  5188. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5189. IF baseRecord = NIL THEN
  5190. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5191. ELSE
  5192. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5193. END;
  5194. ELSE
  5195. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5196. END;
  5197. END;
  5198. ELSE
  5199. offset := 0;
  5200. source := module.allSections.FindBySymbol(td); (*TODO*)
  5201. IF source = NIL THEN
  5202. null := 0;
  5203. GetCodeSectionNameForSymbol(td,name);
  5204. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5205. IntermediateCode.InitImmediate(op,addressType,0);
  5206. source(IntermediateCode.Section).Emit(Data(position,op));
  5207. source.SetReferenced(FALSE)
  5208. ELSE
  5209. name := source.name;
  5210. END;
  5211. END;
  5212. RETURN td
  5213. END GetBackendType;
  5214. BEGIN
  5215. (*td := t.typeDeclaration;*)
  5216. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5217. (*
  5218. IF t IS SyntaxTree.PointerType THEN
  5219. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5220. ELSE
  5221. source := GetBackendType(t);
  5222. END;
  5223. *)
  5224. IF newObjectFile THEN
  5225. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5226. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5227. IntermediateCode.SetOffset(res,offset);
  5228. ELSE
  5229. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5230. END;
  5231. (*
  5232. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5233. make memory should be used when tag is used, not earlier
  5234. *)
  5235. RETURN res
  5236. END TypeDescriptorAdr;
  5237. (*
  5238. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5239. VAR result: IntermediateCode.Operand;
  5240. BEGIN
  5241. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5242. operand.tag := TypeDescriptorAdr(operand.type);
  5243. IntermediateCode.MakeMemory(operand.tag,addressType);
  5244. UseIntermediateOperand(operand.tag);
  5245. END;
  5246. END MakeTypeTag;
  5247. *)
  5248. PROCEDURE ProfilerInit;
  5249. VAR reg: IntermediateCode.Operand;
  5250. BEGIN
  5251. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5252. Emit(Call(position,reg,0));
  5253. END ProfilerInit;
  5254. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5255. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5256. BEGIN
  5257. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5258. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5259. THEN
  5260. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5261. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5262. Emit(Push(position,reg));
  5263. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5264. Emit(Push(position,reg));
  5265. StaticCallOperand(result,procedure);
  5266. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5267. ReleaseOperand(result);
  5268. END;
  5269. END ProfilerEnterExit;
  5270. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5271. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5272. BEGIN
  5273. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5274. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5275. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5276. profileInit.Emit(Push(position,reg));
  5277. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5278. profileInit.Emit(Push(position,reg));
  5279. NEW(string, LEN(name)); COPY(name, string^);
  5280. sv := SyntaxTree.NewStringValue(-1,string);
  5281. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5282. sv.SetType(type);
  5283. Designate(sv,result);
  5284. profileInit.Emit(Push(position,result.tag));
  5285. profileInit.Emit(Push(position,result.op));
  5286. StaticCallOperand(result,procedure);
  5287. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5288. ReleaseOperand(result);
  5289. END;
  5290. END ProfilerAddProcedure;
  5291. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5292. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5293. BEGIN
  5294. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5295. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5296. profileInit.Emit(Push(position,reg));
  5297. profileInitPatchPosition := profileInit.pc;
  5298. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5299. NEW(string, LEN(name)); COPY(name, string^);
  5300. sv := SyntaxTree.NewStringValue(-1,string);
  5301. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5302. sv.SetType(type);
  5303. Designate(sv,result);
  5304. profileInit.Emit(Push(position,result.tag));
  5305. profileInit.Emit(Push(position,result.op));
  5306. StaticCallOperand(result,procedure);
  5307. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5308. ReleaseOperand(result);
  5309. END;
  5310. END ProfilerAddModule;
  5311. PROCEDURE ProfilerPatchInit;
  5312. VAR reg: IntermediateCode.Operand;
  5313. BEGIN
  5314. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5315. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5316. EmitLeave(profileInit,position,0);
  5317. profileInit.Emit(Exit(position,0,0));
  5318. END ProfilerPatchInit;
  5319. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5320. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5321. VAR
  5322. id: LONGINT;
  5323. leftType, rightType: SyntaxTree.Type;
  5324. procedureType: SyntaxTree.ProcedureType;
  5325. runtimeProcedure: SyntaxTree.Procedure;
  5326. runtimeProcedureOperand, operatorOperand: Operand;
  5327. kind: SET;
  5328. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5329. VAR
  5330. arg: IntermediateCode.Operand;
  5331. recordType: SyntaxTree.RecordType;
  5332. fingerPrint: SyntaxTree.FingerPrint;
  5333. BEGIN
  5334. IF type = NIL THEN
  5335. (* no type: push 'NoType' *)
  5336. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5337. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5338. ELSIF IsStrictlyPointerToRecord(type) THEN
  5339. (* pointer to record type: push typetag *)
  5340. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5341. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5342. arg := TypeDescriptorAdr(recordType);
  5343. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5344. ELSE
  5345. (* non-pointer to record type: push fingerprint *)
  5346. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5347. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5348. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5349. END;
  5350. operatorInitializationCodeSection.Emit(Push(position,arg))
  5351. END PushTypeInfo;
  5352. BEGIN
  5353. ASSERT(operatorInitializationCodeSection # NIL);
  5354. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5355. procedureType := operator.type(SyntaxTree.ProcedureType);
  5356. (* determine types *)
  5357. leftType := procedureType.firstParameter.type;
  5358. IF procedureType.numberParameters = 2 THEN
  5359. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5360. rightType := procedureType.firstParameter.nextParameter.type;
  5361. ELSE
  5362. rightType := NIL
  5363. END;
  5364. (* determine operator kind *)
  5365. IF IsStrictlyPointerToRecord(leftType) THEN
  5366. kind := {LhsIsPointer}
  5367. ELSE
  5368. kind := {}
  5369. END;
  5370. IF IsStrictlyPointerToRecord(rightType) THEN
  5371. kind := kind + {RhsIsPointer}
  5372. END;
  5373. IF kind # {} THEN (* TODO: to be removed later on *)
  5374. (* at least one of the types is a pointer to record *)
  5375. (* emit a code that registers this specific operator in the runtime *)
  5376. dump := operatorInitializationCodeSection.comments;
  5377. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5378. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5379. (* push ID *)
  5380. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5381. id := Global.GetSymbol(module.module.case, operator.name);
  5382. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5383. (* push kind *)
  5384. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5385. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5386. (* push type infos *)
  5387. PushTypeInfo(leftType);
  5388. PushTypeInfo(rightType);
  5389. (* push operator address *)
  5390. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5391. StaticCallOperand(operatorOperand, operator);
  5392. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5393. ReleaseOperand(operatorOperand);
  5394. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5395. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5396. ReleaseOperand(runtimeProcedureOperand)
  5397. END
  5398. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5399. END
  5400. END RegisterDynamicOperator;
  5401. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5402. VAR
  5403. traceModule: SyntaxTree.Module;
  5404. procedure: SyntaxTree.Procedure;
  5405. procedureVariable: SyntaxTree.Variable;
  5406. s,msg: Basic.MessageString;
  5407. res: Operand;
  5408. i: LONGINT;
  5409. sv: SyntaxTree.StringValue;
  5410. type: SyntaxTree.Type;
  5411. recordType: SyntaxTree.RecordType;
  5412. printout: Printout.Printer;
  5413. stringWriter: Streams.StringWriter;
  5414. expression: SyntaxTree.Expression;
  5415. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5416. BEGIN
  5417. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5418. IF procedure = NIL THEN
  5419. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5420. END;
  5421. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5422. s := "procedure ";
  5423. Strings.Append(s,backend.traceModuleName);
  5424. Strings.Append(s,".");
  5425. Strings.Append(s,procedureName);
  5426. Strings.Append(s," not present");
  5427. Error(position,s);
  5428. RETURN FALSE
  5429. ELSE
  5430. RETURN TRUE
  5431. END;
  5432. END GetProcedure;
  5433. PROCEDURE CallProcedure;
  5434. VAR size: LONGINT;
  5435. BEGIN
  5436. IF procedure # NIL THEN
  5437. StaticCallOperand(result,procedure);
  5438. size := ProcedureParametersSize(system,procedure);
  5439. ELSE
  5440. Symbol(procedureVariable, result);
  5441. LoadValue(result, procedureVariable.type.resolved);
  5442. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5443. END;
  5444. Emit(Call(position,result.op,size));
  5445. END CallProcedure;
  5446. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5447. VAR res: Operand; string: SyntaxTree.String;
  5448. BEGIN
  5449. IF GetProcedure("String") THEN
  5450. NEW(string, LEN(s)); COPY(s, string^);
  5451. sv := SyntaxTree.NewStringValue(-1,string);
  5452. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5453. sv.SetType(type);
  5454. Designate(sv,res);
  5455. Emit(Push(position,res.tag));
  5456. Emit(Push(position,res.op));
  5457. ReleaseOperand(res);
  5458. CallProcedure;
  5459. END;
  5460. END String;
  5461. PROCEDURE Integer(op: IntermediateCode.Operand);
  5462. BEGIN
  5463. IF GetProcedure("Int") THEN
  5464. Emit(Push(position,op));
  5465. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5466. CallProcedure;
  5467. END;
  5468. END Integer;
  5469. PROCEDURE Float(op: IntermediateCode.Operand);
  5470. BEGIN
  5471. IF GetProcedure("HIntHex") THEN
  5472. Emit(Push(position,op));
  5473. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5474. CallProcedure;
  5475. END;
  5476. END Float;
  5477. PROCEDURE Set(op: IntermediateCode.Operand);
  5478. BEGIN
  5479. IF GetProcedure("Set") THEN
  5480. Emit(Push(position,op));
  5481. (*
  5482. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5483. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5484. *)
  5485. CallProcedure;
  5486. END;
  5487. END Set;
  5488. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5489. BEGIN
  5490. IF GetProcedure("Boolean") THEN
  5491. Emit(Push(position,op));
  5492. CallProcedure;
  5493. END;
  5494. END Boolean;
  5495. PROCEDURE Char(op: IntermediateCode.Operand);
  5496. BEGIN
  5497. IF GetProcedure("Char") THEN
  5498. Emit(Push(position,op));
  5499. CallProcedure;
  5500. END;
  5501. END Char;
  5502. PROCEDURE Address(op: IntermediateCode.Operand);
  5503. BEGIN
  5504. IF GetProcedure("Address") THEN
  5505. Emit(Push(position,op));
  5506. CallProcedure;
  5507. END;
  5508. END Address;
  5509. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5510. BEGIN
  5511. IF GetProcedure("String") THEN
  5512. Emit(Push(position,tag));
  5513. Emit(Push(position,op));
  5514. CallProcedure;
  5515. END;
  5516. END StringOperand;
  5517. PROCEDURE Ln;
  5518. BEGIN
  5519. IF GetProcedure("Ln") THEN
  5520. CallProcedure;
  5521. END;
  5522. END Ln;
  5523. BEGIN
  5524. IF backend.traceModuleName = "" THEN RETURN END;
  5525. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5526. IF GetProcedure("Enter") THEN
  5527. CallProcedure
  5528. END;
  5529. NEW(stringWriter,LEN(s));
  5530. FOR i := 0 TO x.Length()-1 DO
  5531. msg := "";
  5532. expression := x.GetExpression(i);
  5533. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5534. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5535. ELSE
  5536. Global.GetModuleName(module.module, s);
  5537. END;
  5538. IF i = 0 THEN
  5539. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5540. stringWriter.String(":");
  5541. END;
  5542. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5543. IF ~(expression IS SyntaxTree.StringValue) THEN
  5544. printout.Expression(expression);
  5545. stringWriter.Get(s);
  5546. Strings.Append(msg,s);
  5547. Strings.Append(msg,"= ");
  5548. ELSE stringWriter.Get(s); (* remove from string writer *)
  5549. Strings.Append(msg, s);
  5550. END;
  5551. String(msg);
  5552. IF SemanticChecker.IsStringType(expression.type) THEN
  5553. Designate(expression,res);
  5554. StringOperand(res.op,res.tag);
  5555. ELSE
  5556. Evaluate(expression,res);
  5557. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5558. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5559. Convert(res.op,int64);
  5560. END;
  5561. Integer(res.op);
  5562. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5563. Boolean(res.op);
  5564. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5565. Set(res.op);
  5566. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5567. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5568. Convert(res.op,float64);
  5569. END;
  5570. Float(res.op);
  5571. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5572. Char(res.op);
  5573. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5574. Address(res.op);String("H");
  5575. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5576. Address(res.op);String("H");
  5577. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5578. Address(res.op);String("H");
  5579. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5580. Address(res.op);String("H");
  5581. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5582. String("NIL");
  5583. ELSE HALT(200);
  5584. END;
  5585. END;
  5586. ReleaseOperand(res);
  5587. String("; ");
  5588. END;
  5589. IF GetProcedure("Exit") THEN
  5590. CallProcedure
  5591. ELSE
  5592. Ln;
  5593. END;
  5594. END;
  5595. END SystemTrace;
  5596. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5597. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5598. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5599. BEGIN
  5600. type := type.resolved;
  5601. IF type IS SyntaxTree.RecordType THEN
  5602. WITH type: SyntaxTree.RecordType DO
  5603. baseType := type.baseType;
  5604. IF baseType # NIL THEN
  5605. baseType := baseType.resolved;
  5606. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5607. InitFields(baseType,adr,offset);
  5608. END;
  5609. variable := type.recordScope.firstVariable;
  5610. WHILE variable # NIL DO
  5611. IF variable.initializer # NIL THEN
  5612. Evaluate(variable.initializer,initializerOp);
  5613. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5614. Emit(Mov(position,mem,initializerOp.op));
  5615. ReleaseOperand(initializerOp);
  5616. ReleaseIntermediateOperand(mem);
  5617. END;
  5618. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5619. variable := variable.nextVariable
  5620. END;
  5621. END;
  5622. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5623. WITH type: SyntaxTree.ArrayType DO
  5624. IF type.form = SyntaxTree.Static THEN
  5625. baseType := type.arrayBase;
  5626. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5627. FOR i := 0 TO type.staticLength-1 DO
  5628. InitFields(baseType,adr,offset+i*size);
  5629. END;
  5630. END;
  5631. END;
  5632. ELSIF type IS SyntaxTree.MathArrayType THEN
  5633. WITH type: SyntaxTree.MathArrayType DO
  5634. IF type.form = SyntaxTree.Open THEN
  5635. dim := DynamicDim(type);
  5636. imm := IntermediateCode.Immediate(addressType,dim);
  5637. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5638. baseType := SemanticChecker.ArrayBase(type,dim);
  5639. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5640. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5641. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5642. ReleaseIntermediateOperand(imm);
  5643. (* flags remain empty (=0) for open array *)
  5644. ELSIF type.form = SyntaxTree.Static THEN
  5645. baseType := type.arrayBase;
  5646. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5647. ASSERT(type.staticLength < 1024*1024*1024);
  5648. FOR i := 0 TO type.staticLength-1 DO
  5649. InitFields(baseType,adr,offset+i*size);
  5650. END;
  5651. END;
  5652. END;
  5653. END;
  5654. END InitFields;
  5655. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5656. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5657. BEGIN
  5658. type := variable.type.resolved;
  5659. IF (type IS SyntaxTree.MathArrayType) THEN
  5660. WITH type: SyntaxTree.MathArrayType DO
  5661. IF type.form = SyntaxTree.Open THEN
  5662. Symbol(variable,operand);
  5663. InitFields(type, operand.tag,0);
  5664. ELSIF type.form = SyntaxTree.Tensor THEN
  5665. Symbol(variable, operand);
  5666. MakeMemory(tmp,operand.op,addressType,0);
  5667. ReleaseOperand(operand);
  5668. Emit(Mov(position,tmp, nil ) );
  5669. ReleaseIntermediateOperand(tmp);
  5670. END;
  5671. END;
  5672. ELSE
  5673. Symbol(variable,operand);
  5674. IF variable.initializer # NIL THEN
  5675. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5676. reference.SetType(variable.type.resolved);
  5677. reference.SetAssignable(TRUE);
  5678. Assign(reference,variable.initializer);
  5679. END;
  5680. InitFields(type, operand.op,0);
  5681. ReleaseOperand(operand);
  5682. END;
  5683. END InitVariable;
  5684. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5685. VAR end: Label;
  5686. BEGIN
  5687. IF type.form = SyntaxTree.Tensor THEN
  5688. InitOperand(result,ModeValue);
  5689. ReuseCopy(result.op,base);
  5690. end := NewLabel();
  5691. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5692. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5693. SetLabel(end);
  5694. Convert(result.op,int32);
  5695. ELSE
  5696. InitOperand(result,ModeValue);
  5697. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5698. END
  5699. END MathArrayDim;
  5700. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5701. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5702. BEGIN
  5703. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5704. MakeMemory(mem,base,addressType,offset);
  5705. Emit(Mov(position,mem,value));
  5706. ReleaseIntermediateOperand(mem);
  5707. END PutMathArrayField;
  5708. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5709. VAR mem: IntermediateCode.Operand;
  5710. BEGIN
  5711. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5712. MakeMemory(mem,base,addressType,offset);
  5713. Emit(Mov(position,mem,value));
  5714. ReleaseIntermediateOperand(mem);
  5715. END PutMathArrayFieldOffset;
  5716. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5717. BEGIN
  5718. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5719. MakeMemory(value,base,addressType,offset);
  5720. END GetMathArrayField;
  5721. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5722. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5723. BEGIN
  5724. IF incr THEN
  5725. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5726. ELSE
  5727. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5728. END;
  5729. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5730. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5731. ELSE
  5732. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5733. Emit(Mov(position,reg,dim));
  5734. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5735. Emit(Add(position,reg,reg,base));
  5736. MakeMemory(mem, reg, addressType, offset);
  5737. ReleaseIntermediateOperand(reg);
  5738. Emit(Mov(position,mem,value));
  5739. ReleaseIntermediateOperand(mem);
  5740. END;
  5741. END PutMathArrayLenOrIncr;
  5742. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5743. BEGIN
  5744. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5745. END PutMathArrayLength;
  5746. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5747. BEGIN
  5748. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5749. END PutMathArrayIncrement;
  5750. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5751. BEGIN
  5752. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5753. END GetMathArrayIncrement;
  5754. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5755. BEGIN
  5756. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5757. END GetMathArrayLength;
  5758. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5759. VAR dimOp: IntermediateCode.Operand;
  5760. BEGIN
  5761. dimOp := IntermediateCode.Immediate(int32, dim);
  5762. GetMathArrayLength(type, operand, dimOp, check, result);
  5763. END GetMathArrayLengthAt;
  5764. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5765. VAR dimOp: IntermediateCode.Operand;
  5766. BEGIN
  5767. dimOp := IntermediateCode.Immediate(int32, dim);
  5768. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5769. END GetMathArrayIncrementAt;
  5770. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5771. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5772. offset: LONGINT;
  5773. BEGIN
  5774. IF increment THEN
  5775. offset := MathIncrOffset;
  5776. ELSE
  5777. offset := MathLenOffset;
  5778. END;
  5779. INC(offset,operand.dimOffset*2);
  5780. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5781. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5782. END;
  5783. (* static dimension *)
  5784. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5785. IF check & (type.form = SyntaxTree.Tensor) THEN
  5786. DimensionCheck(operand.tag,dim,BrltL);
  5787. END;
  5788. val := SHORT(dim.intValue);
  5789. IF type.form # SyntaxTree.Tensor THEN
  5790. t := SemanticChecker.ArrayBase(type,val);
  5791. type := t.resolved(SyntaxTree.MathArrayType);
  5792. IF type.form = SyntaxTree.Static THEN
  5793. IF increment THEN
  5794. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5795. ELSE
  5796. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5797. END;
  5798. InitOperand(result,ModeValue);
  5799. result.op := res;
  5800. RETURN;
  5801. END;
  5802. END;
  5803. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5804. MakeMemory(res,operand.tag,addressType,offset);
  5805. (*
  5806. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5807. *)
  5808. InitOperand(result,ModeValue);
  5809. result.op := res;
  5810. ELSE
  5811. Convert(dim,addressType);
  5812. IF check THEN
  5813. IF type.form = SyntaxTree.Tensor THEN
  5814. DimensionCheck(operand.tag,dim,BrltL);
  5815. ELSIF isUnchecked THEN (* do nothing *)
  5816. ELSE
  5817. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5818. END;
  5819. END;
  5820. end := NewLabel(); next := NIL;
  5821. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5822. Emit(Mov(position,res,dim));
  5823. Convert(res,int32);
  5824. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5825. WHILE t IS SyntaxTree.MathArrayType DO
  5826. type := t(SyntaxTree.MathArrayType);
  5827. IF type.form = SyntaxTree.Static THEN
  5828. imm := IntermediateCode.Immediate(int32,val);
  5829. next := NewLabel();
  5830. BrneL(next,imm,res);
  5831. IF increment THEN
  5832. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5833. ELSE
  5834. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5835. END;
  5836. Emit(MovReplace(position,res,imm));
  5837. BrL(end);
  5838. ELSE hasDynamicPart := TRUE;
  5839. END;
  5840. t := type.arrayBase.resolved;
  5841. val := val + 1;
  5842. IF next # NIL THEN SetLabel(next) END;
  5843. END;
  5844. IF hasDynamicPart THEN
  5845. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5846. Emit(Mov(position,res2,dim));
  5847. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5848. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5849. Emit(Add(position,res2,res2,imm));
  5850. Emit(Add(position,res2,res2,operand.tag));
  5851. IntermediateCode.MakeMemory(res2,int32);
  5852. Emit(MovReplace(position,res,res2));
  5853. ReleaseIntermediateOperand(res2);
  5854. END;
  5855. SetLabel(end);
  5856. Convert(res,int32);
  5857. InitOperand(result,ModeValue);
  5858. result.op := res;
  5859. END;
  5860. END MathArrayLenOrIncr;
  5861. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5862. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5863. offset: LONGINT;
  5864. BEGIN
  5865. offset := operand.dimOffset+DynamicDim(type)-1;
  5866. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5867. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5868. val := SHORT(dim.intValue);
  5869. t := SemanticChecker.ArrayBase(type,val);
  5870. type := t.resolved(SyntaxTree.ArrayType);
  5871. IF type.form = SyntaxTree.Static THEN
  5872. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5873. ELSE
  5874. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5875. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5876. END;
  5877. UseIntermediateOperand(res);
  5878. InitOperand(result,ModeValue);
  5879. result.op := res;
  5880. ELSE
  5881. Convert(dim,addressType);
  5882. IF ~isUnchecked THEN
  5883. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5884. END;
  5885. end := NewLabel(); next := NIL;
  5886. (* ReuseCopy(dim,res); *)
  5887. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5888. Emit(Mov(position,res,dim));
  5889. Convert(res,int32);
  5890. Convert(res,int32);
  5891. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5892. WHILE t IS SyntaxTree.ArrayType DO
  5893. type := t(SyntaxTree.ArrayType);
  5894. IF type.form = SyntaxTree.Static THEN
  5895. imm := IntermediateCode.Immediate(int32,val);
  5896. next := NewLabel();
  5897. BrneL(next,imm,res);
  5898. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5899. Emit(MovReplace(position,res,imm));
  5900. BrL(end);
  5901. ELSE hasDynamicPart := TRUE;
  5902. END;
  5903. t := type.arrayBase.resolved;
  5904. val := val + 1;
  5905. IF next # NIL THEN SetLabel(next) END;
  5906. END;
  5907. IF hasDynamicPart THEN
  5908. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5909. Convert(res2,addressType);
  5910. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5911. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5912. Emit(Sub(position,res2,imm,res2));
  5913. Emit(Add(position,res2,res2,operand.tag));
  5914. IntermediateCode.MakeMemory(res2,int32);
  5915. Emit(MovReplace(position,res,res2));
  5916. ReleaseIntermediateOperand(res2);
  5917. END;
  5918. SetLabel(end);
  5919. Convert(res,int32);
  5920. InitOperand(result,ModeValue);
  5921. result.op := res;
  5922. END;
  5923. END ArrayLen;
  5924. (**
  5925. create a temporary variable in current scope
  5926. **)
  5927. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5928. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5929. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5930. BEGIN
  5931. IF ~register THEN
  5932. variable := temporaries.GetFreeVariable(type, index);
  5933. ELSE
  5934. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5935. END;
  5936. scope := currentScope;
  5937. IF variable = NIL THEN
  5938. COPY("@hiddenIRVar",string);
  5939. Basic.AppendNumber(string,index);
  5940. name := SyntaxTree.NewIdentifier(string);
  5941. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5942. variable.SetType(type);
  5943. variable.SetAccess(SyntaxTree.Hidden);
  5944. IF ~register THEN
  5945. temporaries.AddVariable(variable);
  5946. IF scope.lastVariable # NIL THEN
  5947. offset := scope.lastVariable.offsetInBits;
  5948. ELSE
  5949. offset := 0;
  5950. END;
  5951. DEC(offset,system.SizeOf(variable.type));
  5952. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5953. variable(SyntaxTree.Variable).SetOffset(offset);
  5954. scope.AddVariable(variable(SyntaxTree.Variable));
  5955. scope.EnterSymbol(variable, duplicate);
  5956. ASSERT(~duplicate);
  5957. InitVariable(variable(SyntaxTree.Variable));
  5958. ELSE
  5959. variable.SetUseRegister(TRUE);
  5960. variable(SyntaxTree.Variable).SetOffset(0);
  5961. END;
  5962. ELSE
  5963. InitVariable(variable(SyntaxTree.Variable));
  5964. (*
  5965. ASSERT(variable.type.resolved = type.resolved)
  5966. *)
  5967. END;
  5968. RETURN variable(SyntaxTree.Variable)
  5969. END GetTemporaryVariable;
  5970. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5971. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5972. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5973. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5974. i: LONGINT; duplicate: BOOLEAN;
  5975. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5976. VAR variable: SyntaxTree.Variable;
  5977. BEGIN
  5978. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5979. variable.SetType(type);
  5980. recordScope.AddVariable(variable);
  5981. END AddVariable;
  5982. BEGIN
  5983. name := "@ArrayDescriptor";
  5984. Basic.AppendNumber(name,dimensions);
  5985. identifier := SyntaxTree.NewIdentifier(name);
  5986. parentScope := module.module.moduleScope;
  5987. symbol := parentScope.FindSymbol(identifier);
  5988. IF symbol # NIL THEN
  5989. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5990. type := typeDeclaration.declaredType;
  5991. ELSE
  5992. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5993. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5994. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5995. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5996. recordType.SetTypeDeclaration(typeDeclaration);
  5997. recordType.SetState(SyntaxTree.Resolved);
  5998. typeDeclaration.SetDeclaredType(recordType);
  5999. AddVariable("@ptr",system.anyType);
  6000. AddVariable("@adr",system.addressType);
  6001. AddVariable("@flags",system.addressType);
  6002. AddVariable("@dim",system.addressType);
  6003. AddVariable("@elementSize",system.addressType);
  6004. FOR i := 0 TO dimensions-1 DO
  6005. name := "@len";
  6006. Basic.AppendNumber(name,i);
  6007. AddVariable(name,system.addressType);
  6008. name := "@incr";
  6009. Basic.AppendNumber(name,i);
  6010. AddVariable(name,system.addressType);
  6011. END;
  6012. parentScope.AddTypeDeclaration(typeDeclaration);
  6013. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6014. ASSERT(~duplicate);
  6015. type := recordType;
  6016. END;
  6017. RETURN type
  6018. END GetMathArrayDescriptorType;
  6019. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6020. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6021. BEGIN
  6022. type := GetMathArrayDescriptorType(dimensions);
  6023. Emit(Push(position,op.op));
  6024. (* push type descriptor *)
  6025. reg := TypeDescriptorAdr(type);
  6026. IF ~newObjectFile THEN
  6027. IntermediateCode.MakeMemory(reg,addressType);
  6028. END;
  6029. Emit(Push(position,reg));
  6030. ReleaseIntermediateOperand(reg);
  6031. (* push realtime flag: false by default *)
  6032. Emit(Push(position,false));
  6033. CallThis(position,"Heaps","NewRec",3);
  6034. END NewMathArrayDescriptor;
  6035. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6036. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6037. BEGIN
  6038. NEW(string, LEN(s)); COPY(s, string^);
  6039. sv := SyntaxTree.NewStringValue(-1,string);
  6040. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6041. sv.SetType(type);
  6042. Designate(sv,res);
  6043. Emit(Push(position,res.tag));
  6044. Emit(Push(position,res.op));
  6045. ReleaseOperand(res);
  6046. END PushConstString;
  6047. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6048. BEGIN
  6049. IF b THEN
  6050. Emit(Push(-1, true));
  6051. ELSE
  6052. Emit(Push(-1, false));
  6053. END;
  6054. END PushConstBoolean;
  6055. PROCEDURE PushConstSet(v: SET);
  6056. VAR value: SyntaxTree.Value; op: Operand;
  6057. BEGIN
  6058. value := SyntaxTree.NewSetValue(-1, v);
  6059. value.SetType(system.setType);
  6060. Evaluate(value, op);
  6061. Emit(Push(-1, op.op));
  6062. ReleaseOperand(op);
  6063. END PushConstSet;
  6064. PROCEDURE PushConstInteger(v: LONGINT);
  6065. VAR value: SyntaxTree.Value; op: Operand;
  6066. BEGIN
  6067. value := SyntaxTree.NewIntegerValue(-1, v);
  6068. value.SetType(system.longintType);
  6069. Evaluate(value, op);
  6070. Emit(Push(-1, op.op));
  6071. ReleaseOperand(op);
  6072. END PushConstInteger;
  6073. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6074. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6075. section: IntermediateCode.Section;
  6076. BEGIN
  6077. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6078. Global.GetSymbolSegmentedName(symbol, name);
  6079. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6080. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6081. procedure.SetScope(moduleScope);
  6082. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6083. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6084. procedure.SetAccess(SyntaxTree.Hidden);
  6085. currentScope := procedureScope;
  6086. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6087. EmitEnter(section, -1,NIL,0,0,0);
  6088. RETURN section;
  6089. END OpenInitializer;
  6090. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6091. BEGIN
  6092. EmitLeave(section, 0, 0 );
  6093. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6094. section := prev;
  6095. END CloseInitializer;
  6096. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6097. VAR name: SyntaxTree.IdentifierString;
  6098. variable: SyntaxTree.Variable;
  6099. type: SyntaxTree.Type;
  6100. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6101. BEGIN
  6102. InitOperand(op,ModeReference);
  6103. op.op := fp;
  6104. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6105. Dereference(op, x, FALSE);
  6106. result := op;
  6107. Symbol(symbol, op);
  6108. END Field;
  6109. PROCEDURE Direction(direction: LONGINT): SET;
  6110. BEGIN
  6111. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6112. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6113. ELSE HALT(100);
  6114. END;
  6115. END Direction;
  6116. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6117. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6118. BEGIN
  6119. Field(port, op);
  6120. ToMemory(op.op,addressType,0);
  6121. Emit(Push(-1, op.op));
  6122. ReleaseOperand(op);
  6123. Basic.GetString(modifier.identifier, name);
  6124. PushConstString(name);
  6125. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6126. ASSERT(SemanticChecker.IsStringType(value.type));
  6127. Designate(value, op);
  6128. Emit(Push(modifier.position, op.tag));
  6129. Emit(Push(modifier.position, op.op));
  6130. ReleaseOperand(op);
  6131. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6132. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6133. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6134. Evaluate(value, op);
  6135. Emit(Push(modifier.position, op.op));
  6136. ReleaseOperand(op);
  6137. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6138. ELSE
  6139. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6140. END;
  6141. END AddPortProperty;
  6142. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6143. VAR modifier: SyntaxTree.Modifier;
  6144. BEGIN
  6145. modifier := variable.modifiers;
  6146. WHILE modifier # NIL DO
  6147. AddPortProperty(variable,modifier, modifier.expression);
  6148. modifier := modifier.nextModifier;
  6149. END;
  6150. END AddPortProperties;
  6151. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6152. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6153. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6154. PROCEDURE PushLens(type: SyntaxTree.Type);
  6155. BEGIN
  6156. IF IsSemiDynamicArray(type) THEN
  6157. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6158. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6159. Emit(Push(-1, op.op));
  6160. ReleaseOperand(op);
  6161. INC(dim);
  6162. ELSIF IsStaticArray(type) THEN
  6163. len := len * type(SyntaxTree.ArrayType).staticLength;
  6164. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6165. INC(dim);
  6166. ELSE
  6167. baseType := type;
  6168. END;
  6169. END PushLens;
  6170. BEGIN
  6171. (* cell *)
  6172. IF variable.type IS SyntaxTree.ArrayType THEN
  6173. type := variable.type;
  6174. dim := 0;
  6175. len := 1;
  6176. PushLens(type);
  6177. portType := baseType.resolved(SyntaxTree.PortType);
  6178. ELSE
  6179. portType := variable.type(SyntaxTree.PortType);
  6180. END;
  6181. PushSelfPointer();
  6182. (* port / array of ports *)
  6183. IF IsStaticArray(type) THEN
  6184. PushConstInteger(len);
  6185. END;
  6186. Field(variable, op);
  6187. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6188. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6189. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6190. Designate(d, op);*)
  6191. Emit(Push(-1, op.op));
  6192. ReleaseOperand(op);
  6193. (* name *)
  6194. PushConstString(name);
  6195. (* inout *)
  6196. PushConstSet(Direction(portType.direction));
  6197. (* width *)
  6198. PushConstInteger(portType.sizeInBits);
  6199. IF variable.type IS SyntaxTree.PortType THEN
  6200. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6201. AddPortProperties(variable);
  6202. ELSIF IsStaticArray(type)THEN
  6203. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6204. ELSIF IsSemiDynamicArray(type) THEN
  6205. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6206. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6207. Emit(Add(position,reg, sp, size));
  6208. (* dim *)
  6209. PushConstInteger(dim);
  6210. (* len array *)
  6211. Emit(Push(position, reg));
  6212. ReleaseIntermediateOperand(reg);
  6213. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6214. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6215. Emit(Add(position, sp,sp, size));
  6216. ELSE
  6217. HALT(100);
  6218. END;
  6219. END Variable;
  6220. BEGIN
  6221. IF backend.cellsAreObjects THEN
  6222. variable := x.cellScope.firstVariable;
  6223. WHILE (variable # NIL) DO
  6224. type := variable.type.resolved;
  6225. WHILE (type IS SyntaxTree.ArrayType) DO
  6226. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6227. END;
  6228. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6229. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6230. Variable(name,variable);
  6231. END;
  6232. variable := variable.nextVariable;
  6233. END;
  6234. ELSE HALT(200)
  6235. END;
  6236. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6237. (*
  6238. x.typeDeclaration.GetName(componentName);
  6239. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6240. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6241. instanceType.SetDataMemorySize(dataMemorySize);
  6242. END;
  6243. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6244. instanceType.SetInstructionMemorySize(codeMemorySize)
  6245. END;
  6246. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6247. instanceType.AddCapability(ActiveCells.VectorCapability)
  6248. END;
  6249. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6250. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6251. END;
  6252. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6253. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6254. END;
  6255. AddDevices(instanceType, x);
  6256. *)
  6257. (*
  6258. IF x.isCellNet THEN
  6259. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6260. END;
  6261. *)
  6262. (*currentActiveCellsScope := instanceType;*)
  6263. (*
  6264. parameter := x.firstParameter;
  6265. portIndex := 0;
  6266. WHILE parameter # NIL DO
  6267. parameter.GetName(parameterName);
  6268. parameterType := parameter.type.resolved;
  6269. Parameter(parameterName, parameterType);
  6270. (*
  6271. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6272. ParameterArray(parameterType);
  6273. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6274. FOR i := 0 TO len-1 DO
  6275. COPY(parameterName,name);
  6276. AppendIndex(name,i);
  6277. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6278. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6279. INC(portIndex);
  6280. END;
  6281. ELSE
  6282. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6283. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6284. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6285. INC(portIndex);
  6286. END;
  6287. *)
  6288. parameter := parameter.nextParameter;
  6289. END;
  6290. *)
  6291. (*
  6292. Scope(x.cellScope);
  6293. currentActiveCellsScope := prevActiveCellsScope;
  6294. AddModules(instanceType,x.cellScope);
  6295. *)
  6296. END AddPorts;
  6297. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6298. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6299. BEGIN
  6300. Symbol(cell,op);
  6301. ToMemory(op.op,addressType,0);
  6302. Emit(Push(position,op.op));
  6303. ReleaseOperand(op);
  6304. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6305. PushConstString(name);
  6306. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6307. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6308. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6309. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6310. Designate(d, op);
  6311. IF SemanticChecker.IsStringType(property.type) THEN
  6312. Emit(Push(-1, op.tag))
  6313. END;
  6314. Emit(Push(-1, op.op));
  6315. ReleaseOperand(op);
  6316. END;
  6317. IF SemanticChecker.IsStringType(property.type) THEN
  6318. ASSERT(SemanticChecker.IsStringType(value.type));
  6319. Designate(value, op);
  6320. Emit(Push(property.position, op.tag));
  6321. Emit(Push(property.position, op.op));
  6322. ReleaseOperand(op);
  6323. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6324. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6325. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6326. Evaluate(value, op);
  6327. Emit(Push(property.position, op.op));
  6328. ReleaseOperand(op);
  6329. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6330. ELSE
  6331. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6332. END;
  6333. END AddProperty;
  6334. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6335. VAR symbol: SyntaxTree.Symbol;
  6336. BEGIN
  6337. WHILE modifier # NIL DO
  6338. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6339. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6340. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6341. ELSE
  6342. (*! move this check to checker *)
  6343. Error(modifier.position, "undefined property");
  6344. END;
  6345. modifier := modifier.nextModifier;
  6346. END;
  6347. END AddModifiers;
  6348. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6349. VAR last: SyntaxTree.Modifier;
  6350. BEGIN
  6351. IF to = NIL THEN
  6352. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6353. ELSE
  6354. last := to;
  6355. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6356. last := last.nextModifier;
  6357. END;
  6358. IF last.identifier # this.identifier THEN
  6359. ASSERT(last.nextModifier = NIL);
  6360. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6361. END;
  6362. END;
  6363. END AppendModifier;
  6364. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6365. BEGIN
  6366. WHILE this # NIL DO
  6367. AppendModifier(to, this);
  6368. this := this.nextModifier;
  6369. END;
  6370. END AppendModifiers;
  6371. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6372. VAR op: Operand;
  6373. BEGIN
  6374. Evaluate(p, op);
  6375. Emit(Push(p.position, op.op));
  6376. ReleaseOperand(op);
  6377. (*
  6378. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6379. p := p(SyntaxTree.Designator).left;
  6380. END;
  6381. IF p # NIL THEN
  6382. Evaluate(p, op);
  6383. Emit(Push(p.position, op.op));
  6384. ReleaseOperand(op);
  6385. ELSE
  6386. Emit(Push(-1, nil));
  6387. END;
  6388. *)
  6389. END PushPort;
  6390. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6391. VAR
  6392. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6393. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6394. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6395. tmp:IntermediateCode.Operand;
  6396. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6397. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6398. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6399. dest: IntermediateCode.Operand;
  6400. staticLength: LONGINT; itype: IntermediateCode.Type;
  6401. convert,isTensor: BOOLEAN;
  6402. recordType: SyntaxTree.RecordType;
  6403. baseType: SyntaxTree.Type;
  6404. flags: SET;
  6405. left: SyntaxTree.Expression;
  6406. call: SyntaxTree.Designator;
  6407. procedure: SyntaxTree.Procedure;
  6408. temporaryVariable: SyntaxTree.Variable;
  6409. dummy: IntermediateCode.Operand;
  6410. customBuiltin: SyntaxTree.CustomBuiltin;
  6411. isVarPar: ARRAY 3 OF BOOLEAN;
  6412. callsection: Sections.Section;
  6413. segmentedName: Basic.SegmentedName;
  6414. needsTrace: BOOLEAN;
  6415. n: ARRAY 256 OF CHAR;
  6416. modifier: SyntaxTree.Modifier;
  6417. previous, init: IntermediateCode.Section;
  6418. prevScope: SyntaxTree.Scope;
  6419. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6420. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6421. priority: IntermediateCode.Operand;
  6422. op,callop: Operand;
  6423. BEGIN
  6424. IF type = NIL THEN RETURN END;
  6425. type := type.resolved;
  6426. IF type IS SyntaxTree.PointerType THEN
  6427. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6428. END;
  6429. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6430. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6431. recordScope := type(SyntaxTree.RecordType).recordScope;
  6432. IF recordScope.bodyProcedure # NIL THEN
  6433. procedure := recordScope.bodyProcedure;
  6434. body := procedure.procedureScope.body;
  6435. Emit(Push(position,self));
  6436. IF body.isActive THEN
  6437. StaticCallOperand(callop,procedure);
  6438. Emit(Push(position,callop.op));
  6439. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6440. Convert(priority,sizeType);
  6441. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6442. END;
  6443. Emit(Push(position,priority));
  6444. ReleaseIntermediateOperand(priority);
  6445. IF backend.cooperative THEN
  6446. Emit(Push(position,self));
  6447. CallThis(position,"Activities","Create",3)
  6448. ELSE
  6449. flags := 0;
  6450. IF body.isSafe THEN
  6451. flags := 1;
  6452. END;
  6453. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6454. Emit(Push(position,self));
  6455. CallThis(position,"Objects","CreateProcess",4)
  6456. END;
  6457. ELSE
  6458. Emit(Push(position,self));
  6459. StaticCallOperand(callop,procedure);
  6460. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6461. END;
  6462. Emit(Pop(position,self));
  6463. END;
  6464. END CallBodies;
  6465. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6466. BEGIN
  6467. actualType := actualType.resolved;
  6468. IF actualType IS SyntaxTree.StringType THEN
  6469. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6470. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6471. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6472. ELSE
  6473. tmp := op.tag;
  6474. IntermediateCode.MakeMemory(tmp,addressType);
  6475. Emit(Push(position,tmp));
  6476. END;
  6477. Emit(Push(position,op.op))
  6478. END PushString;
  6479. PROCEDURE PushTD(type: SyntaxTree.Type);
  6480. VAR op: IntermediateCode.Operand;
  6481. BEGIN
  6482. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6483. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6484. ELSE
  6485. IF type.resolved IS SyntaxTree.PointerType THEN
  6486. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6487. END;
  6488. op := TypeDescriptorAdr(type.resolved);
  6489. IF ~newObjectFile THEN
  6490. IntermediateCode.MakeMemory(op,addressType);
  6491. END;
  6492. Emit(Push(position,op));
  6493. END
  6494. END PushTD;
  6495. BEGIN
  6496. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6497. dest := destination; destination := emptyOperand;
  6498. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6499. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6500. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6501. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6502. CASE x.id OF
  6503. (* ---- COPY ----- *)
  6504. |Global.Copy:
  6505. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6506. (* ---- EXCL, INCL----- *)
  6507. |Global.Excl,Global.Incl:
  6508. Evaluate(p0,s0);
  6509. Evaluate(p1,s1);
  6510. Convert(s1.op,setType);
  6511. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6512. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6513. END;
  6514. ReuseCopy(res,s0.op);
  6515. ReleaseOperand(s0);
  6516. Reuse1(tmp,s1.op);
  6517. ReleaseOperand(s1);
  6518. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6519. IF x.id = Global.Excl THEN
  6520. Emit(Not(position,tmp,tmp));
  6521. Emit(And(position,res,res,tmp));
  6522. ELSE
  6523. Emit(Or(position,res,res,tmp));
  6524. END;
  6525. ReleaseIntermediateOperand(tmp);
  6526. Designate(p0,s0);
  6527. ToMemory(s0.op,setType,0);
  6528. Emit(Mov(position,s0.op,res));
  6529. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6530. (* ---- DISPOSE ----- *)
  6531. |Global.Dispose:
  6532. Designate(p0,s0);
  6533. Emit(Push(position,s0.op));
  6534. ReleaseOperand(s0);
  6535. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6536. (* ---- GETPROCEDURE ----- *)
  6537. |Global.GetProcedure:
  6538. Designate(p0,s0);
  6539. PushString(s0,p0.type);
  6540. Designate(p1,s1);
  6541. PushString(s1,p1.type);
  6542. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6543. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6544. ELSE PushTD(procedureType.firstParameter.type)
  6545. END;
  6546. PushTD(procedureType.returnType);
  6547. Designate(p2,s2);
  6548. Emit(Push(position,s2.op));
  6549. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6550. CallThis(position,"Modules","GetProcedure", 7);
  6551. (* ---- ASH, LSH, ROT ----- *)
  6552. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6553. Evaluate(p0,s0);
  6554. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6555. (* make unsigned arguments in order to produced a logical shift *)
  6556. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6557. convert:= TRUE;
  6558. itype := s0.op.type;
  6559. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6560. Convert(s0.op,itype);
  6561. ELSE
  6562. convert := FALSE;
  6563. END;
  6564. END;
  6565. Evaluate(p1,s1);
  6566. IF IsIntegerConstant(p1,hint) THEN
  6567. ReuseCopy(reg,s0.op);
  6568. IF hint > 0 THEN
  6569. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6570. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6571. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6572. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6573. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6574. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6575. END;
  6576. ELSIF hint < 0 THEN
  6577. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6578. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6579. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6580. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6581. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6582. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6583. END;
  6584. END;
  6585. ReleaseOperand(s0); ReleaseOperand(s1);
  6586. ELSE
  6587. exit := NewLabel();
  6588. end := NewLabel();
  6589. ReuseCopy(reg,s0.op);
  6590. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6591. Reuse1(tmp,s1.op);
  6592. Emit(Neg(position,tmp,s1.op));
  6593. Convert(tmp,s1.op.type);
  6594. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6595. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6596. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6597. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6598. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6599. END;
  6600. ReleaseIntermediateOperand(tmp);
  6601. BrL(end);
  6602. SetLabel(exit);
  6603. ReuseCopy(tmp,s1.op);
  6604. Convert(tmp,s1.op.type);
  6605. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6606. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6607. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6608. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6609. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6610. END;
  6611. ReleaseIntermediateOperand(tmp);
  6612. SetLabel(end);
  6613. ReleaseOperand(s0); ReleaseOperand(s1);
  6614. END;
  6615. InitOperand(result,ModeValue);
  6616. IF convert THEN
  6617. itype := reg.type;
  6618. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6619. Convert(reg,itype);
  6620. END;
  6621. result.op := reg;
  6622. (* ---- CAP ----- *)
  6623. |Global.Cap:
  6624. Evaluate(p0,result);
  6625. ReuseCopy(reg,result.op);
  6626. ReleaseIntermediateOperand(result.op);
  6627. ignore := NewLabel();
  6628. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6629. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6630. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6631. SetLabel(ignore);
  6632. result.op := reg;
  6633. (* ---- CHR ----- *)
  6634. |Global.Chr, Global.Chr32:
  6635. Evaluate(p0,result);
  6636. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6637. |Global.Entier, Global.EntierH:
  6638. Evaluate(p0,result);
  6639. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6640. (* ---- MIN and MAX ----- *)
  6641. |Global.Max,Global.Min:
  6642. Evaluate(p0,s0);
  6643. Evaluate(p1,s1);
  6644. Reuse2(res,s0.op,s1.op);
  6645. else := NewLabel();
  6646. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6647. ELSE BrltL(else,s1.op,s0.op) END;
  6648. Emit(Mov(position,res,s0.op));
  6649. ReleaseOperand(s0);
  6650. end := NewLabel();
  6651. BrL(end);
  6652. SetLabel(else);
  6653. Emit(MovReplace(position,res,s1.op));
  6654. SetLabel(end);
  6655. ReleaseOperand(s1);
  6656. InitOperand(result,ModeValue);
  6657. result.op := res;
  6658. (* ---- ODD ----- *)
  6659. |Global.Odd:
  6660. IF ~conditional THEN
  6661. ConditionToValue(x)
  6662. ELSE
  6663. Evaluate(p0,result);
  6664. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6665. Reuse1(res,result.op);
  6666. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6667. ReleaseIntermediateOperand(result.op);
  6668. result.op := res;
  6669. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6670. ReleaseOperand(result);
  6671. BrL(falseLabel);
  6672. END;
  6673. (* ---- ORD ----- *)
  6674. |Global.Ord, Global.Ord32:
  6675. Evaluate(p0,result);
  6676. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6677. (* ---- SHORT, LONG ----- *)
  6678. |Global.Short, Global.Long:
  6679. Evaluate(p0,result);
  6680. IF x.type IS SyntaxTree.ComplexType THEN
  6681. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6682. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6683. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6684. ELSE
  6685. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6686. END
  6687. (* ---- HALT, SYSTEM.HALT----- *)
  6688. |Global.Halt, Global.systemHalt:
  6689. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6690. EmitTrap (position, val);
  6691. (* ---- ASSERT ----- *)
  6692. |Global.Assert:
  6693. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6694. trueL := NewLabel();
  6695. falseL := NewLabel();
  6696. Condition(p0,trueL,falseL);
  6697. IF p1 = NIL THEN val := AssertTrap
  6698. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6699. END;
  6700. SetLabel(falseL);
  6701. EmitTrap(position,val);
  6702. SetLabel(trueL);
  6703. END;
  6704. (*
  6705. Emit(TrapC(result.op,val);
  6706. *)
  6707. (* ---- INC, DEC----- *)
  6708. |Global.Inc,Global.Dec:
  6709. Expression(p0); adr := result.op;
  6710. LoadValue(result,p0.type); l := result;
  6711. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6712. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6713. END;
  6714. IF x.id = Global.Inc THEN
  6715. Emit(Add(position,l.op,l.op,r.op));
  6716. ELSE
  6717. Emit(Sub(position,l.op,l.op,r.op));
  6718. END;
  6719. ReleaseOperand(l); ReleaseOperand(r);
  6720. (* ---- LEN ----- *)
  6721. |Global.Len: (* dynamic length, static length done by checker *)
  6722. Designate(p0,operand);
  6723. IF p1 = NIL THEN
  6724. InitOperand(l,ModeValue);
  6725. l.op := IntermediateCode.Immediate(int32,0);
  6726. ELSE
  6727. Evaluate(p1,l);
  6728. END;
  6729. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6730. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6731. Dereference(operand, p0.type.resolved, FALSE);
  6732. END;
  6733. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6734. ReleaseOperand(operand); ReleaseOperand(l);
  6735. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6736. ASSERT(p1 # NIL);
  6737. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6738. Dereference(operand,p0.type.resolved,FALSE);
  6739. END;
  6740. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6741. ReleaseOperand(operand); ReleaseOperand(l);
  6742. ELSE HALT(100);
  6743. END;
  6744. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6745. (* ---- FIRST ---- *)
  6746. |Global.First:
  6747. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6748. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6749. ELSE
  6750. Designate(p0, result)
  6751. END
  6752. (* ---- LAST ---- *)
  6753. |Global.Last:
  6754. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6755. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6756. ELSE
  6757. Designate(p0, result);
  6758. (* make sure result.op is a register *)
  6759. tmp := result.op;
  6760. ReuseCopy(result.op, result.op);
  6761. ReleaseIntermediateOperand(tmp);
  6762. (* add offset to result.op *)
  6763. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6764. END
  6765. (* ---- STEP ---- *)
  6766. |Global.Step:
  6767. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6768. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6769. ELSE
  6770. Designate(p0, result);
  6771. (* make sure result.op is a register *)
  6772. tmp := result.op;
  6773. ReuseCopy(result.op, result.op);
  6774. ReleaseIntermediateOperand(tmp);
  6775. (* add offset to result.op *)
  6776. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6777. END
  6778. (* ---- RE ---- *)
  6779. |Global.Re:
  6780. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6781. Designate(p0, result)
  6782. ELSE
  6783. Evaluate(p0, result)
  6784. END
  6785. (* ---- IM ---- *)
  6786. |Global.Im:
  6787. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6788. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6789. Designate(p0, result);
  6790. (* make sure result.op is a register *)
  6791. tmp := result.op;
  6792. ReuseCopy(result.op, result.op);
  6793. ReleaseIntermediateOperand(tmp);
  6794. (* add offset to result.op *)
  6795. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6796. (* ---- ABS ----- *)
  6797. |Global.Abs:
  6798. Evaluate(p0,operand);
  6799. type := p0.type.resolved;
  6800. InitOperand(result,ModeValue);
  6801. Reuse1a(result.op,operand.op,dest);
  6802. Emit(Abs(position,result.op,operand.op));
  6803. ReleaseOperand(operand);
  6804. (* ---- WAIT ----- *)
  6805. |Global.Wait:
  6806. Evaluate(p0,operand);
  6807. Emit(Push(position,operand.op));
  6808. ReleaseOperand(operand);
  6809. CallThis(position,"Activities","Wait", 1);
  6810. (* ---- NEW ----- *)
  6811. |Global.New:
  6812. (*! the following code is only correct for "standard" Oberon calling convention *)
  6813. type := p0.type.resolved;
  6814. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6815. THEN
  6816. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6817. IF backend.cooperative THEN
  6818. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6819. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6820. IF recordType.isObject THEN
  6821. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6822. IF recordType.IsActive() THEN
  6823. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6824. END;
  6825. IF recordType.IsProtected() THEN
  6826. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6827. END;
  6828. ELSE
  6829. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6830. END;
  6831. END;
  6832. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6833. CallThis(position,"Runtime","New", 1);
  6834. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6835. Emit(Result(position, pointer));
  6836. exit := NewLabel();
  6837. BreqL(exit,pointer,nil);
  6838. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6839. GetRecordTypeName (recordType,name);
  6840. IF ~recordType.isObject THEN
  6841. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6842. END;
  6843. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6844. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6845. IF recordType.isObject THEN
  6846. IF recordType.IsProtected() THEN
  6847. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6848. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6849. END;
  6850. IF recordType.IsActive() THEN
  6851. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6852. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6853. END;
  6854. END;
  6855. END;
  6856. (* initialize fields *)
  6857. IF type(SyntaxTree.PointerType).isPlain THEN
  6858. size := 0;
  6859. ELSIF recordType.isObject THEN
  6860. size := BaseObjectTypeSize;
  6861. ELSE
  6862. size := BaseRecordTypeSize;
  6863. END;
  6864. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6865. (* call initializer *)
  6866. constructor := GetConstructor(recordType);
  6867. IF constructor # NIL THEN
  6868. (*! should be unified with ProcedureCallDesignator *)
  6869. Emit(Push(position,pointer));
  6870. ReleaseIntermediateOperand(pointer);
  6871. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6872. FOR i := 1 TO x.parameters.Length()-1 DO
  6873. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6874. formalParameter := formalParameter.nextParameter;
  6875. END;
  6876. (* static call of the constructor *)
  6877. GetCodeSectionNameForSymbol(constructor,name);
  6878. ASSERT(~constructor.isInline);
  6879. IF constructor.scope.ownerModule # module.module THEN
  6880. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6881. ELSE
  6882. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6883. END;
  6884. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6885. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6886. Emit(Pop(position,pointer));
  6887. END;
  6888. (* call bodies *)
  6889. CallBodies(pointer,p0.type);
  6890. SetLabel(exit);
  6891. needsTrace := p0.NeedsTrace();
  6892. IF needsTrace THEN ModifyAssignments(true) END;
  6893. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6894. Emit(Push(position, pointer));
  6895. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6896. Emit(Pop(position, pointer));
  6897. END;
  6898. Designate(p0,l);
  6899. IF needsTrace THEN
  6900. CallAssignPointer(l.op, pointer);
  6901. ELSE
  6902. ToMemory(l.op,addressType,0);
  6903. Emit(Mov(position,l.op,pointer));
  6904. END;
  6905. ReleaseIntermediateOperand(pointer);
  6906. ReleaseOperand(l);
  6907. IF needsTrace THEN ModifyAssignments(false) END;
  6908. ELSE
  6909. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6910. IF temporaryVariable # NIL THEN
  6911. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6912. ELSE
  6913. Designate(p0,l);
  6914. END;
  6915. (* l.op contains address of pointer to record *)
  6916. Emit(Push(position,l.op)); (* address for use after syscall *)
  6917. Emit(Push(position,l.op));
  6918. ReleaseOperand(l);
  6919. (* push type descriptor *)
  6920. reg := TypeDescriptorAdr(recordType);
  6921. IF ~newObjectFile THEN
  6922. IntermediateCode.MakeMemory(reg,addressType);
  6923. END;
  6924. Emit(Push(position,reg));
  6925. ReleaseIntermediateOperand(reg);
  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","NewRec", 3);
  6931. (* check allocation success, if not successful then do not call initializers and bodies *)
  6932. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6933. Emit(Pop(position,pointer));
  6934. MakeMemory(reg,pointer,addressType,0);
  6935. ReleaseIntermediateOperand(pointer);
  6936. pointer := reg;
  6937. exit := NewLabel();
  6938. BreqL(exit,pointer,nil);
  6939. Emit(Push(position,pointer));
  6940. (* initialize fields *)
  6941. InitFields(recordType, pointer,0);
  6942. (* call initializer *)
  6943. constructor := GetConstructor(recordType);
  6944. IF constructor # NIL THEN
  6945. (*! should be unified with ProcedureCallDesignator *)
  6946. Emit(Push(position,pointer));
  6947. ReleaseIntermediateOperand(pointer);
  6948. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6949. FOR i := 1 TO x.parameters.Length()-1 DO
  6950. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6951. formalParameter := formalParameter.nextParameter;
  6952. END;
  6953. (* static call of the constructor *)
  6954. GetCodeSectionNameForSymbol(constructor,name);
  6955. ASSERT(~constructor.isInline);
  6956. IF constructor.scope.ownerModule # module.module THEN
  6957. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6958. ELSE
  6959. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6960. END;
  6961. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6962. ELSE
  6963. ReleaseIntermediateOperand(pointer);
  6964. END;
  6965. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6966. Emit(Pop(position,pointer));
  6967. IF temporaryVariable # NIL THEN
  6968. Designate(p0,l);
  6969. ToMemory(l.op,addressType,0);
  6970. Emit(Mov(position,l.op,pointer));
  6971. ReleaseOperand(l);
  6972. result.tag := emptyOperand;
  6973. END;
  6974. (* call bodies *)
  6975. CallBodies(pointer,p0.type);
  6976. ReleaseIntermediateOperand(pointer);
  6977. IF temporaryVariable # NIL THEN
  6978. end := NewLabel();
  6979. BrL(end);
  6980. SetLabel(exit);
  6981. Designate(p0,l);
  6982. ToMemory(l.op,addressType,0);
  6983. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6984. ReleaseOperand(l);
  6985. SetLabel(end);
  6986. ELSE
  6987. SetLabel(exit);
  6988. END;
  6989. END;
  6990. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6991. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6992. dim := 0;
  6993. IF p1 # NIL THEN
  6994. FOR i := 1 TO x.parameters.Length()-1 DO
  6995. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6996. parameter := x.parameters.GetExpression(i);
  6997. Evaluate(parameter,r);
  6998. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6999. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7000. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7001. END;
  7002. Emit(Push(position,r.op));
  7003. IF i=1 THEN
  7004. ReuseCopy(reg,r.op);
  7005. ELSE
  7006. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7007. END;
  7008. ReleaseOperand(r);
  7009. INC(dim);
  7010. END;
  7011. Convert(reg,addressType);
  7012. ELSE
  7013. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7014. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7015. END;
  7016. openDim := dim;
  7017. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7018. IF backend.cooperative THEN
  7019. size := ToMemoryUnits(system,system.SizeOf(type));
  7020. WHILE type IS SyntaxTree.ArrayType DO
  7021. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7022. END;
  7023. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7024. IF (size # 1) THEN
  7025. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7026. END;
  7027. Emit(Push(position,reg));
  7028. size := ToMemoryUnits(system,system.SizeOf(type));
  7029. IF (size # 1) THEN
  7030. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7031. END;
  7032. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7033. Emit(Push(position,reg));
  7034. ReleaseIntermediateOperand(reg);
  7035. CallThis(position,"Runtime","New", 1);
  7036. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7037. Emit(Result(position, pointer));
  7038. exit := NewLabel();
  7039. else := NewLabel();
  7040. BreqL(else,pointer,nil);
  7041. IF ~type.hasPointers THEN
  7042. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7043. ELSIF type IS SyntaxTree.RecordType THEN
  7044. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7045. ELSIF type IS SyntaxTree.ProcedureType THEN
  7046. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7047. ELSE
  7048. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7049. END;
  7050. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7051. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7052. 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))));
  7053. IF type IS SyntaxTree.RecordType THEN
  7054. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7055. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7056. ELSE
  7057. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7058. END;
  7059. i := openDim;
  7060. WHILE i > 0 DO
  7061. DEC (i);
  7062. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7063. END;
  7064. needsTrace := p0.NeedsTrace();
  7065. IF needsTrace THEN ModifyAssignments(true) END;
  7066. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7067. Emit(Push(position, pointer));
  7068. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7069. Emit(Pop(position, pointer));
  7070. END;
  7071. Designate(p0,l);
  7072. IF needsTrace THEN
  7073. CallAssignPointer(l.op, pointer);
  7074. ModifyAssignments(false);
  7075. ELSE
  7076. ToMemory(l.op,addressType,0);
  7077. Emit(Mov(position,l.op,pointer));
  7078. END;
  7079. ReleaseIntermediateOperand(pointer);
  7080. ReleaseOperand(l);
  7081. BrL(exit);
  7082. SetLabel(else);
  7083. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7084. Designate(p0,l);
  7085. IF needsTrace THEN
  7086. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7087. ELSE
  7088. ToMemory(l.op,addressType,0);
  7089. Emit(Mov(position,l.op,pointer));
  7090. END;
  7091. ReleaseOperand(l);
  7092. SetLabel(exit);
  7093. ELSE
  7094. (*! the following code is only correct for "standard" Oberon calling convention *)
  7095. IF SemanticChecker.ContainsPointer(type) THEN
  7096. IF type IS SyntaxTree.ArrayType THEN
  7097. staticLength := 1;
  7098. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7099. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7100. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7101. END;
  7102. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7103. Emit(Mul(position,reg,reg,tmp));
  7104. END;
  7105. Designate(p0,l);
  7106. IF openDim > 0 THEN
  7107. Emit(Push(position,l.op)); (* address for use after syscall *)
  7108. END;
  7109. Emit(Push(position,l.op)); (* address *)
  7110. ReleaseOperand(l);
  7111. tmp := TypeDescriptorAdr(type);
  7112. IF ~newObjectFile THEN
  7113. IntermediateCode.MakeMemory(tmp,addressType);
  7114. END;
  7115. Emit(Push(position,tmp)); (* type descriptor *)
  7116. ReleaseIntermediateOperand(tmp);
  7117. Emit(Push(position,reg)); (* number Elements *)
  7118. ReleaseIntermediateOperand(reg);
  7119. tmp := IntermediateCode.Immediate(addressType,dim);
  7120. Emit(Push(position,tmp)); (* dimensions *)
  7121. (* push realtime flag *)
  7122. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7123. ELSE Emit(Push(position,false));
  7124. END;
  7125. CallThis(position,"Heaps","NewArr",5)
  7126. ELSE
  7127. size := ToMemoryUnits(system,system.SizeOf(type));
  7128. IF (size # 1) THEN
  7129. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7130. END;
  7131. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7132. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7133. Emit(Add(position,reg,reg,tmp));
  7134. Designate(p0,l);
  7135. IF openDim >0 THEN
  7136. Emit(Push(position,l.op)); (* address for use after syscall *)
  7137. END;
  7138. Emit(Push(position,l.op)); (* address for syscall *)
  7139. ReleaseOperand(l); (* pointer address *)
  7140. Emit(Push(position,reg)); (* size *)
  7141. ReleaseIntermediateOperand(reg);
  7142. (* push realtime flag *)
  7143. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7144. ELSE Emit(Push(position,false));
  7145. END;
  7146. CallThis(position,"Heaps","NewSys", 3)
  7147. END;
  7148. IF openDim > 0 THEN
  7149. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7150. Emit(Pop(position,adr));
  7151. ToMemory(adr,addressType,0);
  7152. ReuseCopy(tmp,adr);
  7153. ReleaseIntermediateOperand(adr);
  7154. adr := tmp;
  7155. else := NewLabel();
  7156. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7157. i := openDim-1;
  7158. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7159. WHILE (i >= 0) DO
  7160. Emit(Pop(position,reg));
  7161. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7162. Emit(Mov(position,res,reg));
  7163. DEC(i);
  7164. END;
  7165. ReleaseIntermediateOperand(adr);
  7166. ReleaseIntermediateOperand(reg);
  7167. exit := NewLabel();
  7168. BrL(exit);
  7169. SetLabel(else);
  7170. (* else part: array could not be allocated *)
  7171. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7172. Emit(Add(position,sp,sp,tmp));
  7173. SetLabel(exit);
  7174. END;
  7175. END;
  7176. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7177. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7178. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7179. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7180. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7181. left.SetType(procedure.type);
  7182. formalParameter := procedureType.firstParameter;
  7183. (* push array to allocate *)
  7184. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7185. formalParameter :=formalParameter.nextParameter;
  7186. (* push length array *)
  7187. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7188. (* push size *)
  7189. type := t0;
  7190. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7191. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7192. END;
  7193. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7194. Emit(Push(position,tmp));
  7195. (* *)
  7196. IF SemanticChecker.ContainsPointer(type) THEN
  7197. tmp := TypeDescriptorAdr(type);
  7198. IF ~newObjectFile THEN
  7199. IntermediateCode.MakeMemory(tmp,addressType);
  7200. END;
  7201. ELSE
  7202. tmp := IntermediateCode.Immediate(addressType, 0);
  7203. END;
  7204. Emit(Push(position,tmp)); (* type descriptor *)
  7205. StaticCallOperand(result,procedure);
  7206. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7207. ReleaseOperand(result);
  7208. END;
  7209. (*
  7210. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7211. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7212. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7213. *)
  7214. ELSE
  7215. dim := 0;
  7216. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7217. (* generate geometry descriptor *)
  7218. Designate(p0,l);
  7219. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7220. ReleaseOperand(l);
  7221. isTensor := TRUE;
  7222. ELSE
  7223. isTensor := FALSE;
  7224. END;
  7225. FOR i := 1 TO x.parameters.Length()-1 DO
  7226. IF ~isTensor THEN
  7227. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7228. END;
  7229. parameter := x.parameters.GetExpression(i);
  7230. Evaluate(parameter,r);
  7231. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7232. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7233. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7234. END;
  7235. Emit(Push(position,r.op));
  7236. IF i=1 THEN
  7237. ReuseCopy(reg,r.op);
  7238. ELSE
  7239. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7240. END;
  7241. ReleaseOperand(r);
  7242. INC(dim);
  7243. END;
  7244. Convert(reg,addressType);
  7245. openDim := dim;
  7246. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7247. (*! the following code is only correct for "standard" Oberon calling convention *)
  7248. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7249. t := type;
  7250. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7251. staticLength := 1;
  7252. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7253. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7254. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7255. END;
  7256. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7257. Emit(Mul(position,reg,reg,tmp));
  7258. END;
  7259. Designate(p0,l);
  7260. IF isTensor THEN
  7261. Dereference(l,type,FALSE);
  7262. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7263. END;
  7264. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7265. Emit(Push(position,l.tag)); (* address *)
  7266. ReleaseOperand(l);
  7267. tmp := TypeDescriptorAdr(t);
  7268. IF ~newObjectFile THEN
  7269. IntermediateCode.MakeMemory(tmp,addressType);
  7270. END;
  7271. Emit(Push(position,tmp)); (* type descriptor *)
  7272. ReleaseIntermediateOperand(tmp);
  7273. Emit(Push(position,reg)); (* number Elements *)
  7274. ReleaseIntermediateOperand(reg);
  7275. tmp := IntermediateCode.Immediate(addressType,0);
  7276. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7277. (* push realtime flag: false by default *)
  7278. Emit(Push(position,false));
  7279. CallThis(position,"Heaps","NewArr",5);
  7280. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7281. Emit(Pop(position,adr));
  7282. GetMathArrayField(tmp,adr,MathPtrOffset);
  7283. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7284. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7285. PutMathArrayField(adr,reg,MathAdrOffset);
  7286. ReleaseIntermediateOperand(tmp);
  7287. ReleaseIntermediateOperand(reg);
  7288. ELSE
  7289. IF isTensor THEN
  7290. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7291. ELSE
  7292. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7293. END;
  7294. IF (size # 1) THEN
  7295. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7296. END;
  7297. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7298. Emit(Add(position,reg,reg,tmp));
  7299. Designate(p0,l);
  7300. IF isTensor THEN
  7301. Dereference(l,type,FALSE);
  7302. END;
  7303. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7304. Emit(Push(position,l.tag)); (* address for syscall *)
  7305. ReleaseOperand(l); (* pointer address *)
  7306. Emit(Push(position,reg)); (* size *)
  7307. ReleaseIntermediateOperand(reg);
  7308. (* push realtime flag: false by default *)
  7309. Emit(Push(position,false));
  7310. CallThis(position,"Heaps","NewSys",3);
  7311. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7312. Emit(Pop(position,adr));
  7313. GetMathArrayField(tmp,adr,MathPtrOffset);
  7314. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7315. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7316. PutMathArrayField(adr,reg,MathAdrOffset);
  7317. ReleaseIntermediateOperand(tmp);
  7318. ReleaseIntermediateOperand(reg);
  7319. END;
  7320. flags := {};
  7321. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7322. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7323. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7324. PutMathArrayField(adr,tmp,MathDimOffset);
  7325. else := NewLabel();
  7326. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7327. i := openDim-1;
  7328. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7329. IF isTensor THEN
  7330. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7331. ELSE
  7332. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7333. END;
  7334. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7335. WHILE (i >= 0) DO
  7336. Emit(Pop(position,reg));
  7337. PutMathArrayLength(adr,reg,i);
  7338. PutMathArrayIncrement(adr,tmp,i);
  7339. IF i > 0 THEN
  7340. IF i=openDim-1 THEN
  7341. ReuseCopy(tmp,tmp);
  7342. END;
  7343. Emit(Mul(position,tmp,tmp,reg));
  7344. END;
  7345. DEC(i);
  7346. END;
  7347. ReleaseIntermediateOperand(adr);
  7348. ReleaseIntermediateOperand(reg);
  7349. ReleaseIntermediateOperand(tmp);
  7350. exit := NewLabel();
  7351. BrL(exit);
  7352. SetLabel(else);
  7353. (* else part: array could not be allocated *)
  7354. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7355. Emit(Add(position,sp,sp,tmp));
  7356. SetLabel(exit);
  7357. END;
  7358. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7359. THEN
  7360. IF ~backend.cellsAreObjects THEN RETURN END;
  7361. IF InCellScope(currentScope) THEN
  7362. PushSelfPointer()
  7363. ELSE
  7364. Emit(Push(position, nil));
  7365. END;
  7366. (* push temp address *)
  7367. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7368. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7369. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7370. (* l.op contains address of pointer to record *)
  7371. Emit(Push(position,l.op)); (* address for use after syscall *)
  7372. ReleaseOperand(l);
  7373. (* push type descriptor *)
  7374. reg := TypeDescriptorAdr(baseType);
  7375. IF ~newObjectFile THEN
  7376. IntermediateCode.MakeMemory(reg,addressType);
  7377. END;
  7378. Emit(Push(position,reg));
  7379. ReleaseIntermediateOperand(reg);
  7380. (* push name *)
  7381. (*Global.GetSymbolName(p0, n);*)
  7382. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7383. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7384. ELSE
  7385. Global.GetModuleName(module.module, n);
  7386. END;
  7387. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7388. (*type.typeDeclaration.GetName(n);*)
  7389. PushConstString(n);
  7390. (* push cellnet boolean *)
  7391. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7392. (* push engine boolean *)
  7393. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7394. (* allocate *)
  7395. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7396. (* add capabilities *)
  7397. modifier := p0(SyntaxTree.Designator).modifiers;
  7398. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7399. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7400. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7401. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7402. END;
  7403. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7404. (*
  7405. modifier := baseType(SyntaxTree.CellType).modifiers;
  7406. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7407. modifier := p0(SyntaxTree.Designator).modifiers;
  7408. *)
  7409. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7410. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7411. (* l.op contains address of pointer to record *)
  7412. ToMemory(l.op,addressType,0);
  7413. (* l.op contains value of pointer to record *)
  7414. Emit(Push(position,l.op)); (* address for use after syscall *)
  7415. ReleaseOperand(l);
  7416. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7417. prevScope := currentScope;
  7418. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7419. previous := section;
  7420. section := init;
  7421. (* add ports *)
  7422. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7423. CloseInitializer(previous);
  7424. currentScope := prevScope;
  7425. Symbol(temporaryVariable,l);
  7426. ToMemory(l.op,addressType,0);
  7427. Emit(Push(position,l.op));
  7428. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7429. (*
  7430. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7431. IF constructor # NIL THEN
  7432. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7433. FOR i := 1 TO x.parameters.Length()-1 DO
  7434. p := x.parameters.GetExpression(i);
  7435. Global.GetSymbolName(parameter,name);
  7436. Evaluate(p, value);
  7437. ASSERT(value.type # NIL);
  7438. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7439. par := instance.AddParameter(name);
  7440. par.SetInteger(value.integer);
  7441. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7442. par := instance.AddParameter(name);
  7443. par.SetBoolean(value.boolean);
  7444. ELSE Error(x.position,NotYetImplemented)
  7445. END;
  7446. parameter := parameter.nextParameter
  7447. END;
  7448. END;
  7449. *)
  7450. (* call initializer *)
  7451. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7452. IF constructor # NIL THEN
  7453. (*! should be unified with ProcedureCallDesignator *)
  7454. IF backend.cellsAreObjects THEN
  7455. Symbol(temporaryVariable,l);
  7456. ToMemory(l.op,addressType,0);
  7457. Emit(Push(position,l.op));
  7458. ReleaseOperand(l);
  7459. END;
  7460. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7461. FOR i := 1 TO x.parameters.Length()-1 DO
  7462. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7463. formalParameter := formalParameter.nextParameter;
  7464. END;
  7465. (* static call of the constructor *)
  7466. Global.GetSymbolSegmentedName(constructor,name);
  7467. ASSERT(~constructor.isInline);
  7468. IF constructor.scope.ownerModule # module.module THEN
  7469. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7470. ELSE
  7471. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7472. END;
  7473. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7474. (*ELSE
  7475. ReleaseIntermediateOperand(pointer);*)
  7476. END;
  7477. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7478. ToMemory(l.op, addressType, 0);
  7479. Designate(p0,s0);
  7480. ToMemory(s0.op,addressType,0);
  7481. Emit(Mov(position,s0.op,l.op));
  7482. ReleaseOperand(l);
  7483. ReleaseOperand(s0);
  7484. result.tag := emptyOperand;
  7485. (* start *)
  7486. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7487. (* push cell *)
  7488. Symbol(temporaryVariable, l);
  7489. ToMemory(l.op,addressType,0);
  7490. Emit(Push(-1,l.op));
  7491. (* push delegate *)
  7492. Emit(Push(-1,l.op));
  7493. ReleaseOperand(l);
  7494. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7495. Emit(Push(position, s1.op));
  7496. ReleaseOperand(s1);
  7497. CallThis(position,"ActiveCellsRuntime","Start",3);
  7498. END;
  7499. (*IF temporaryVariable # NIL THEN
  7500. end := NewLabel();
  7501. BrL(end);
  7502. SetLabel(exit);
  7503. Designate(p0,l);
  7504. ToMemory(l.op,addressType,0);
  7505. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7506. ReleaseOperand(l);
  7507. SetLabel(end);
  7508. ELSE
  7509. SetLabel(exit);
  7510. END;
  7511. *)
  7512. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7513. ELSE (* no pointer to record, no pointer to array *)
  7514. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7515. (* ignore new statement *)
  7516. Warning(p0.position, "cannot run on final hardware");
  7517. ELSE
  7518. HALT(200);
  7519. END;
  7520. END;
  7521. (* ---- ADDRESSOF----- *)
  7522. |Global.systemAdr:
  7523. Designate(p0,s0);
  7524. s0.mode := ModeValue;
  7525. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7526. ReleaseIntermediateOperand(s0.op);
  7527. s0.op := s0.tag;
  7528. IntermediateCode.InitOperand(s0.tag);
  7529. END;
  7530. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7531. result := s0;
  7532. (* ---- BIT ----- *)
  7533. |Global.systemBit:
  7534. Evaluate(p0,s0);
  7535. ToMemory(s0.op,addressType,0);
  7536. ReuseCopy(res,s0.op);
  7537. ReleaseOperand(s0);
  7538. Evaluate(p1,s1);
  7539. Emit(Ror(position,res,res,s1.op));
  7540. ReleaseOperand(s1);
  7541. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7542. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7543. IF ~conditional THEN
  7544. InitOperand(result,ModeValue); result.op := res;
  7545. ELSE
  7546. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7547. BrL(falseLabel);
  7548. ReleaseIntermediateOperand(res);
  7549. END;
  7550. (* --- MSK ----*)
  7551. |Global.systemMsk:
  7552. Evaluate(p0,s0);
  7553. Evaluate(p1,s1);
  7554. ReuseCopy(res,s0.op);
  7555. ReleaseOperand(s0);
  7556. Emit(And(position,res,res,s1.op));
  7557. ReleaseOperand(s1);
  7558. InitOperand(result,ModeValue);
  7559. result.op := res;
  7560. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7561. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7562. Evaluate(p0,s0);
  7563. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7564. ReleaseOperand(s0);
  7565. InitOperand(result,ModeValue);
  7566. result.op := res;
  7567. (* ---- SYSTEM.GetStackPointer ----- *)
  7568. |Global.systemGetStackPointer:
  7569. InitOperand(result,ModeValue);
  7570. result.op := sp;
  7571. (* ---- SYSTEM.GetFramePointer ----- *)
  7572. |Global.systemGetFramePointer:
  7573. InitOperand(result,ModeValue);
  7574. result.op := fp;
  7575. (* ---- SYSTEM.GetActivity ----- *)
  7576. |Global.systemGetActivity:
  7577. ASSERT(backend.cooperative);
  7578. InitOperand(result,ModeValue);
  7579. result.op := ap;
  7580. (* ---- SYSTEM.SetStackPointer ----- *)
  7581. |Global.systemSetStackPointer:
  7582. Evaluate(p0,s0); (* *)
  7583. Emit(Mov(position,sp,s0.op));
  7584. ReleaseOperand(s0);
  7585. (* ---- SYSTEM.SetFramePointer ----- *)
  7586. |Global.systemSetFramePointer:
  7587. Evaluate(p0,s0); (* *)
  7588. Emit(Mov(position,fp,s0.op));
  7589. ReleaseOperand(s0);
  7590. (* ---- SYSTEM.Activity ----- *)
  7591. |Global.systemSetActivity:
  7592. ASSERT(backend.cooperative);
  7593. Evaluate(p0,s0); (* *)
  7594. Emit(Mov(position,ap,s0.op));
  7595. ReleaseOperand(s0);
  7596. (* ---- SYSTEM.VAL ----- *)
  7597. |Global.systemVal:
  7598. Expression(p1);
  7599. s1 := result;
  7600. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7601. IF s1.mode = ModeReference THEN
  7602. (* nothing to be done if not record type, just take over new type *)
  7603. IF (type IS SyntaxTree.RecordType) THEN
  7604. ReleaseIntermediateOperand(s1.tag);
  7605. s1.tag := TypeDescriptorAdr(type);
  7606. IF ~newObjectFile THEN
  7607. IntermediateCode.MakeMemory(s1.tag,addressType);
  7608. END;
  7609. UseIntermediateOperand(s1.tag);
  7610. END;
  7611. result := s1;
  7612. ELSE (* copy over result to different type, may not use convert *)
  7613. itype := IntermediateCode.GetType(system,type);
  7614. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7615. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7616. Emit(Mov(position,s0.op,s1.op));
  7617. ReleaseOperand(s1);
  7618. InitOperand(result,ModeValue);
  7619. result.op := s0.op;
  7620. ELSE (* different size, must convert *)
  7621. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7622. Convert(s1.op, IntermediateCode.GetType(system,type));
  7623. result := s1;
  7624. END;
  7625. END;
  7626. (* ---- SYSTEM.GET ----- *)
  7627. |Global.systemGet:
  7628. Evaluate(p0,s0); (* adr *)
  7629. Designate(p1,s1); (* variable *)
  7630. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7631. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7632. Emit(Mov(position,s1.op,s0.op));
  7633. ReleaseOperand(s1);
  7634. ReleaseOperand(s0);
  7635. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7636. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7637. Evaluate(p0,s0); (* *)
  7638. Evaluate(p1,s1); (* variable *)
  7639. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7640. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7641. (* real part *)
  7642. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7643. Emit(Mov(position,res, s1.op));
  7644. ReleaseIntermediateOperand(res);
  7645. (* imaginary part *)
  7646. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7647. Emit(Mov(position,res, s1.tag));
  7648. ReleaseIntermediateOperand(res);
  7649. ReleaseOperand(s1);
  7650. ReleaseOperand(s0);
  7651. ELSE
  7652. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7653. ReleaseOperand(s0);
  7654. Emit(Mov(position,res,s1.op));
  7655. ReleaseIntermediateOperand(res);
  7656. ReleaseOperand(s1);
  7657. END;
  7658. (* ---- SYSTEM.MOVE ----- *)
  7659. |Global.systemMove:
  7660. Evaluate(p0,s0);
  7661. Evaluate(p1,s1);
  7662. Evaluate(p2,s2);
  7663. Emit(Copy(position,s1.op,s0.op,s2.op));
  7664. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7665. (* ---- SYSTEM.NEW ----- *)
  7666. |Global.systemNew:
  7667. Designate(p0,s0);
  7668. Emit(Push(position,s0.op));
  7669. ReleaseOperand(s0);
  7670. Evaluate(p1,s1);
  7671. Emit(Push(position,s1.op));
  7672. ReleaseOperand(s1);
  7673. (* push realtime flag: false by default *)
  7674. Emit(Push(position,false));
  7675. CallThis(position,"Heaps","NewSys",3);
  7676. (* ---- SYSTEM.CALL ----- *)
  7677. |Global.systemRef:
  7678. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7679. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7680. s0.mode := ModeValue;
  7681. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7682. result := s0
  7683. (* ---- INCR ----- *)
  7684. |Global.Incr:
  7685. Designate(p0,operand);
  7686. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7687. Dereference(operand,p0.type.resolved,FALSE);
  7688. END;
  7689. ASSERT(p1 # NIL);
  7690. Evaluate(p1,l);
  7691. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7692. ReleaseOperand(operand); ReleaseOperand(l);
  7693. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7694. (* ---- SUM ----- *)
  7695. |Global.Sum: HALT(200);
  7696. (* ---- ALL ----- *)
  7697. |Global.All: HALT(200);
  7698. (* ---- CAS ----- *)
  7699. |Global.Cas:
  7700. needsTrace := p0.NeedsTrace();
  7701. IF needsTrace THEN ModifyAssignments(true) END;
  7702. Designate(p0,s0);
  7703. Evaluate(p1,s1);
  7704. Evaluate(p2,s2);
  7705. IF needsTrace THEN
  7706. Emit(Push(position, s0.op));
  7707. Emit(Push(position, s1.op));
  7708. Emit(Push(position, s2.op));
  7709. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7710. ELSE
  7711. Emit(Cas(position,s0.op,s1.op,s2.op));
  7712. END;
  7713. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7714. IF needsTrace THEN ModifyAssignments(false) END;
  7715. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7716. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7717. IF conditional THEN
  7718. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7719. BrL(falseLabel);
  7720. ReleaseIntermediateOperand(res);
  7721. END;
  7722. (* ---- DIM ----- *)
  7723. |Global.Dim:
  7724. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7725. Designate(p0,s0);
  7726. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7727. Dereference(s0,p0.type.resolved,FALSE);
  7728. END;
  7729. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7730. ReleaseOperand(s0);
  7731. (* ---- RESHAPE ----- *)
  7732. |Global.Reshape:
  7733. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7734. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7735. left.SetType(procedure.type);
  7736. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7737. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7738. END;
  7739. (* ---- SYSTEM.TYPECODE ----- *)
  7740. |Global.systemTypeCode:
  7741. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7742. IF type.resolved IS SyntaxTree.PointerType THEN
  7743. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7744. END;
  7745. result.op := TypeDescriptorAdr(type);
  7746. IF ~newObjectFile THEN
  7747. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7748. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7749. END;
  7750. result.mode := ModeValue;
  7751. (* ---- SYSTEM.TRACE ----- *)
  7752. |Global.systemTrace:
  7753. SystemTrace(x.parameters, x.position);
  7754. (* ----- CONNECT ------*)
  7755. |Global.Connect:
  7756. IF backend.cellsAreObjects THEN
  7757. PushPort(p0);
  7758. PushPort(p1);
  7759. IF p2 # NIL THEN
  7760. Evaluate(p2, s2);
  7761. Emit(Push(p2.position, s2.op));
  7762. ReleaseOperand(s2);
  7763. ELSE
  7764. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7765. END;
  7766. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7767. ELSE
  7768. Warning(x.position, "cannot run on final hardware");
  7769. END;
  7770. (* ----- DELEGATE ------*)
  7771. |Global.Delegate:
  7772. IF backend.cellsAreObjects THEN
  7773. PushPort(p0);
  7774. PushPort(p1);
  7775. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7776. ELSE
  7777. Warning(x.position, "cannot run on final hardware");
  7778. END;
  7779. (* ----- SEND ------*)
  7780. |Global.Send:
  7781. Evaluate(p0,s0);
  7782. Evaluate(p1,s1);
  7783. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7784. Emit(Push(position,s0.op));
  7785. Emit(Push(position,s1.op));
  7786. (*
  7787. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7788. *)
  7789. IF ~backend.cellsAreObjects THEN
  7790. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7791. END;
  7792. ReleaseOperand(s0);
  7793. ReleaseOperand(s1);
  7794. IF backend.cellsAreObjects THEN
  7795. CallThis(position,"ActiveCellsRuntime","Send",2);
  7796. ELSE
  7797. CallThis(position,ChannelModuleName,"Send",2);
  7798. END;
  7799. (* ----- RECEIVE ------*)
  7800. |Global.Receive:
  7801. Evaluate(p0,s0);
  7802. Emit(Push(position,s0.op));
  7803. Designate(p1,s1);
  7804. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7805. Emit(Push(position,s1.op));
  7806. IF p2 # NIL THEN
  7807. Designate(p2,s2);
  7808. Emit(Push(position,s2.op));
  7809. END;
  7810. (*
  7811. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7812. *)
  7813. IF ~backend.cellsAreObjects THEN
  7814. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7815. END;
  7816. ReleaseOperand(s0);
  7817. ReleaseOperand(s1);
  7818. ReleaseOperand(s2);
  7819. IF backend.cellsAreObjects THEN
  7820. IF p2 = NIL THEN
  7821. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7822. ELSE
  7823. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7824. END;
  7825. ELSE
  7826. IF p2 = NIL THEN
  7827. CallThis(position,ChannelModuleName,"Receive",2)
  7828. ELSE
  7829. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7830. END;
  7831. END;
  7832. | Global.systemSpecial:
  7833. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7834. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7835. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7836. (* determine if parameters are of the VAR kind *)
  7837. ASSERT(x.parameters.Length() <= 3);
  7838. formalParameter := procedureType.firstParameter;
  7839. FOR i := 0 TO x.parameters.Length() - 1 DO
  7840. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7841. formalParameter := formalParameter.nextParameter
  7842. END;
  7843. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7844. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7845. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7846. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7847. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7848. IF procedureType.returnType # NIL THEN
  7849. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7850. Emit(Result(position, res));
  7851. (*InitOperand(result,ModeValue);
  7852. result.op := res;
  7853. *)
  7854. IF ~conditional THEN
  7855. InitOperand(result,ModeValue); result.op := res;
  7856. ELSE
  7857. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7858. BrL(falseLabel);
  7859. ReleaseIntermediateOperand(res);
  7860. END;
  7861. END
  7862. ELSE (* function not yet implemented *)
  7863. Error(position,"not yet implemented");
  7864. END;
  7865. destination := dest;
  7866. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7867. END VisitBuiltinCallDesignator;
  7868. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7869. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7870. BEGIN
  7871. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7872. dest := destination; destination := emptyOperand;
  7873. Expression(x.left);
  7874. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7875. ELSIF isUnchecked THEN (* no check *)
  7876. ELSE
  7877. trueL := NewLabel();
  7878. falseL := NewLabel();
  7879. IF IsPointerToRecord(x.left.type,recordType) THEN
  7880. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7881. Emit(Mov(position,tag, result.op));
  7882. IF result.mode # ModeValue THEN
  7883. ptr := tag;
  7884. IntermediateCode.MakeMemory(ptr,addressType);
  7885. Emit(Mov(position,tag, ptr));
  7886. END;
  7887. IF ~backend.cooperative THEN
  7888. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7889. END;
  7890. IntermediateCode.MakeMemory(tag,addressType);
  7891. ELSE
  7892. tag := result.tag;
  7893. END;
  7894. TypeTest(tag,x.type,trueL,falseL);
  7895. ReleaseIntermediateOperand(tag);
  7896. SetLabel(falseL);
  7897. EmitTrap(position,TypeCheckTrap);
  7898. SetLabel(trueL);
  7899. END;
  7900. destination := dest;
  7901. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7902. END VisitTypeGuardDesignator;
  7903. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7904. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7905. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7906. VAR label: Label; pc: LONGINT;
  7907. BEGIN
  7908. IF backend.cooperative & ~isUnchecked THEN
  7909. pc := section.pc;
  7910. label := NewLabel();
  7911. BrneL(label, operand.op, nil);
  7912. EmitTrap(position, NilPointerTrap);
  7913. SetLabel(label);
  7914. INC(statCoopNilCheck, section.pc - pc);
  7915. END;
  7916. END NilCheck;
  7917. BEGIN
  7918. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7919. ReuseCopy(dereferenced,operand.op);
  7920. ReleaseOperand(operand);
  7921. operand.mode := ModeReference;
  7922. operand.op := dereferenced;
  7923. operand.tag := dereferenced;
  7924. UseIntermediateOperand(operand.tag);
  7925. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7926. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7927. ReleaseIntermediateOperand(operand.tag);
  7928. operand.tag := TypeDescriptorAdr(type);
  7929. IF ~newObjectFile THEN
  7930. IntermediateCode.MakeMemory(operand.tag,addressType);
  7931. END;
  7932. ELSE
  7933. IF ~backend.cooperative THEN
  7934. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7935. END;
  7936. IntermediateCode.MakeMemory(operand.tag,addressType);
  7937. END;
  7938. NilCheck(operand.op);
  7939. ELSIF type IS SyntaxTree.ArrayType THEN
  7940. IF isUnsafe THEN
  7941. NilCheck(operand.op);
  7942. ReleaseIntermediateOperand(operand.tag);
  7943. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7944. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7945. ELSE
  7946. operand.tag := emptyOperand;
  7947. END;
  7948. ELSE
  7949. NilCheck(operand.op);
  7950. IF backend.cooperative THEN
  7951. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7952. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7953. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7954. ELSE
  7955. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7956. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7957. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7958. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7959. END;
  7960. END;
  7961. ELSIF type IS SyntaxTree.MathArrayType THEN
  7962. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7963. IntermediateCode.MakeMemory(operand.op,addressType);
  7964. ELSE HALT(100);
  7965. END;
  7966. END Dereference;
  7967. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7968. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7969. BEGIN
  7970. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7971. dest := destination; destination := emptyOperand;
  7972. Evaluate(x.left,d);
  7973. type := x.type.resolved;
  7974. prevIsUnchecked := isUnchecked;
  7975. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7976. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7977. END;
  7978. Dereference(d,type,IsUnsafePointer(x.left.type));
  7979. isUnchecked := prevIsUnchecked;
  7980. result := d;
  7981. 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
  7982. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7983. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7984. END;
  7985. END;
  7986. destination := dest;
  7987. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7988. END VisitDereferenceDesignator;
  7989. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7990. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7991. BEGIN
  7992. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7993. dest := destination; destination := emptyOperand;
  7994. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7995. tag := result.op;
  7996. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7997. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7998. StaticCallOperand(result,procedure.super);
  7999. ReleaseIntermediateOperand(result.tag);
  8000. UseIntermediateOperand(tag); (* necessary ? *)
  8001. result.tag := tag;
  8002. destination := dest;
  8003. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8004. END VisitSupercallDesignator;
  8005. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8006. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8007. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8008. name: Basic.SegmentedName;
  8009. BEGIN
  8010. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8011. dest := destination; destination := emptyOperand;
  8012. scope := currentScope;
  8013. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8014. scope := scope.outerScope;
  8015. END;
  8016. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8017. IF newObjectFile THEN
  8018. moduleSection := meta.ModuleSection();
  8019. IF backend.cooperative THEN
  8020. moduleOffset := 0;
  8021. ELSE
  8022. moduleOffset := moduleSection.pc;
  8023. END;
  8024. result.mode := ModeValue;
  8025. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8026. ELSE
  8027. Symbol(moduleSelf,result);
  8028. IntermediateCode.MakeMemory(result.op,addressType);
  8029. END
  8030. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8031. result.mode := ModeValue;
  8032. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8033. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8034. ELSE
  8035. GetBaseRegister(basereg,currentScope,scope);
  8036. InitOperand(result,ModeReference);
  8037. result.op := basereg;
  8038. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8039. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8040. IF backend.cooperative THEN
  8041. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8042. END;
  8043. (* tag must be loaded when dereferencing SELF pointer *)
  8044. END;
  8045. destination := dest;
  8046. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8047. END VisitSelfDesignator;
  8048. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8049. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8050. BEGIN
  8051. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8052. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8053. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8054. parameter := procedureType.returnParameter;
  8055. VisitParameter(parameter);
  8056. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8057. END VisitResultDesignator;
  8058. (** values *)
  8059. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8060. BEGIN
  8061. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8062. IF conditional THEN
  8063. IF x.value THEN BrL(trueLabel)
  8064. ELSE BrL(falseLabel)
  8065. END;
  8066. ELSE
  8067. InitOperand(result,ModeValue);
  8068. IF x.value THEN result.op := true ELSE result.op := false END;
  8069. END;
  8070. END VisitBooleanValue;
  8071. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8072. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8073. BEGIN
  8074. Global.GetModuleSegmentedName(module.module, name);
  8075. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8076. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8077. RETURN section
  8078. END GetDataSection;
  8079. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8080. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8081. BEGIN
  8082. type := vop.type;
  8083. data := GetDataSection();
  8084. pc := EnterImmediate(data,vop);
  8085. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8086. IntermediateCode.MakeMemory(vop, type);
  8087. END GetImmediateMem;
  8088. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8089. BEGIN
  8090. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8091. InitOperand(result,ModeValue);
  8092. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8093. IF ~supportedImmediate(result.op) &~inData THEN
  8094. GetImmediateMem(result.op)
  8095. END;
  8096. END VisitIntegerValue;
  8097. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8098. BEGIN
  8099. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8100. InitOperand(result,ModeValue);
  8101. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8102. END VisitCharacterValue;
  8103. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8104. BEGIN
  8105. IF Trace THEN TraceEnter("VisitSetValue") END;
  8106. InitOperand(result,ModeValue);
  8107. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8108. END VisitSetValue;
  8109. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8110. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8111. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8112. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8113. BEGIN
  8114. numberElements := x.elements.Length();
  8115. FOR i := 0 TO numberElements-1 DO
  8116. expression := x.elements.GetExpression(i);
  8117. IF expression IS SyntaxTree.MathArrayExpression THEN
  8118. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8119. ELSE
  8120. inData := TRUE;
  8121. Evaluate(expression,op);
  8122. irv.Emit(Data(position,op.op));
  8123. inData := FALSE;
  8124. ReleaseOperand(op);
  8125. END;
  8126. END;
  8127. END RecursiveData;
  8128. BEGIN
  8129. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8130. IF ~TryConstantDeclaration() THEN
  8131. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8132. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8133. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8134. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8135. ELSE
  8136. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8137. END;
  8138. RecursiveData(x.array);
  8139. InitOperand(result,ModeReference);
  8140. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8141. END
  8142. END VisitMathArrayValue;
  8143. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8144. VAR constant: Sections.Section;
  8145. BEGIN
  8146. IF constantDeclaration = NIL THEN
  8147. RETURN FALSE
  8148. ELSE
  8149. (* Is a constant in this module: did we generate it already? *)
  8150. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8151. IF constant # NIL THEN
  8152. InitOperand(result,ModeReference);
  8153. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8154. RETURN TRUE;
  8155. END;
  8156. END;
  8157. RETURN FALSE
  8158. END TryConstantDeclaration;
  8159. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8160. BEGIN
  8161. constantDeclaration := x;
  8162. x.value.resolved.Accept(SELF);
  8163. END VisitConstant;
  8164. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8165. BEGIN
  8166. IF Trace THEN TraceEnter("VisitRealValue") END;
  8167. InitOperand(result,ModeValue);
  8168. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8169. END VisitRealValue;
  8170. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8171. VAR
  8172. componentType: SyntaxTree.Type;
  8173. BEGIN
  8174. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8175. ASSERT(x.type IS SyntaxTree.ComplexType);
  8176. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8177. InitOperand(result,ModeValue);
  8178. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8179. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8180. END VisitComplexValue;
  8181. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8182. VAR i: LONGINT; name: Basic.SegmentedName;
  8183. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8184. BEGIN
  8185. IF Trace THEN TraceEnter("VisitStringValue") END;
  8186. IF ~TryConstantDeclaration() THEN
  8187. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8188. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8189. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8190. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8191. ELSE
  8192. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8193. END;
  8194. FOR i := 0 TO x.length-1 DO
  8195. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8196. irv.Emit(Data(position,op));
  8197. END;
  8198. InitOperand(result,ModeReference);
  8199. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8200. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8201. END
  8202. END VisitStringValue;
  8203. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8204. BEGIN
  8205. IF Trace THEN TraceEnter("VisitNilValue") END;
  8206. InitOperand(result,ModeValue);
  8207. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8208. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8209. END VisitNilValue;
  8210. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8211. BEGIN
  8212. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8213. InitOperand(result,ModeValue);
  8214. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8215. END VisitEnumerationValue;
  8216. (** symbols *)
  8217. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8218. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8219. END VisitImport;
  8220. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8221. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8222. BEGIN
  8223. IF scope # baseScope THEN
  8224. (* left := [fp+8] *)
  8225. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8226. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8227. ReuseCopy(left,right);
  8228. ReleaseIntermediateOperand(right);
  8229. scope := scope.outerScope; DEC(level);
  8230. (* { left := [left+8] } *)
  8231. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8232. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8233. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8234. Emit(Mov(position,left,right));
  8235. scope := scope.outerScope; DEC(level);
  8236. END;
  8237. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8238. result := left;
  8239. ELSE
  8240. result := fp;
  8241. END;
  8242. END GetBaseRegister;
  8243. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8244. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8245. BEGIN
  8246. IF Trace THEN TraceEnter("VisitVariable"); END;
  8247. type := x.type.resolved;
  8248. IF (x.useRegister) THEN
  8249. InitOperand(result, ModeValue);
  8250. IF x.registerNumber < 0 THEN
  8251. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8252. reg := x.registerNumber;
  8253. ELSE
  8254. reg := registerUsageCount.Map(x.registerNumber);
  8255. UseRegister(reg);
  8256. END;
  8257. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8258. ELSIF x.externalName # NIL THEN
  8259. InitOperand(result,ModeReference);
  8260. Basic.ToSegmentedName(x.externalName^, name);
  8261. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8262. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8263. InitOperand(result,ModeReference);
  8264. GetBaseRegister(result.op,currentScope,x.scope);
  8265. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8266. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8267. InitOperand(result,ModeReference);
  8268. GetCodeSectionNameForSymbol(x,name);
  8269. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8270. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8271. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8272. InitOperand(result,ModeReference);
  8273. GetCodeSectionNameForSymbol(x,name);
  8274. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8275. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8276. ELSE (* field, left designator must have been emitted *)
  8277. ASSERT(result.mode = ModeReference);
  8278. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8279. ReuseCopy(temp,result.op);
  8280. ReleaseIntermediateOperand(result.op);
  8281. result.op := temp;
  8282. END;
  8283. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8284. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8285. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8286. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8287. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8288. END;
  8289. END;
  8290. END;
  8291. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8292. ValueToCondition(result);
  8293. ELSIF type IS SyntaxTree.ProcedureType THEN
  8294. ReleaseIntermediateOperand(result.tag);
  8295. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8296. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8297. UseIntermediateOperand(result.tag);
  8298. ELSE
  8299. result.tag := nil; (* nil *)
  8300. END;
  8301. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8302. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8303. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8304. ReleaseIntermediateOperand(result.tag);
  8305. Global.GetSymbolSegmentedName(x,name);
  8306. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8307. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8308. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8309. ELSE
  8310. END;
  8311. ELSE
  8312. ReleaseIntermediateOperand(result.tag);
  8313. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8314. END;
  8315. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8316. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8317. ReleaseIntermediateOperand(result.tag);
  8318. result.tag := result.op;
  8319. UseIntermediateOperand(result.tag);
  8320. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8321. IntermediateCode.MakeMemory(result.op,addressType);
  8322. END;
  8323. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8324. ReleaseIntermediateOperand(result.tag);
  8325. result.tag := TypeDescriptorAdr(type);
  8326. IF ~newObjectFile THEN
  8327. IntermediateCode.MakeMemory(result.tag,addressType);
  8328. END;
  8329. UseIntermediateOperand(result.tag);
  8330. (* tag for pointer type computed not here but during dereferencing *)
  8331. END;
  8332. IF Trace THEN TraceExit("VisitVariable") END;
  8333. END VisitVariable;
  8334. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8335. BEGIN
  8336. VisitVariable(property);
  8337. END VisitProperty;
  8338. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8339. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8340. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8341. BEGIN
  8342. type := x.type.resolved;
  8343. IF Trace THEN TraceEnter("VisitParameter") END;
  8344. IF x.ownerType IS SyntaxTree.CellType THEN
  8345. ptype := x.type.resolved;
  8346. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8347. IF ~(ptype IS SyntaxTree.PortType) THEN
  8348. InitOperand(result,ModeReference);
  8349. GetCodeSectionNameForSymbol(x,name);
  8350. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8351. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8352. RETURN
  8353. ELSE
  8354. InitOperand(result, ModeValue);
  8355. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8356. adr := 0;
  8357. WHILE parameter # x DO
  8358. parameterType := parameter.type;
  8359. inc := 1;
  8360. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8361. INC(adr, inc);
  8362. parameter := parameter.nextParameter
  8363. END;
  8364. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8365. RETURN
  8366. END;
  8367. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8368. InitOperand(result,ModeReference);
  8369. GetCodeSectionNameForSymbol(x,name);
  8370. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8371. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8372. RETURN
  8373. ELSE
  8374. GetBaseRegister(basereg,currentScope,x.scope);
  8375. InitOperand(result,ModeReference);
  8376. result.op := basereg;
  8377. END;
  8378. IF IsOpenArray(type) THEN
  8379. result.tag := basereg;
  8380. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8381. IntermediateCode.MakeMemory(result.op,addressType);
  8382. IF Global.IsOberonProcedure(x.ownerType) THEN
  8383. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8384. UseIntermediateOperand(result.tag);
  8385. ELSE
  8386. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8387. END;
  8388. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8389. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8390. ELSIF IsStaticArray(type) THEN
  8391. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8392. IntermediateCode.MakeMemory(result.op,addressType);
  8393. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8394. ELSIF type IS SyntaxTree.MathArrayType THEN
  8395. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8396. WITH type: SyntaxTree.MathArrayType DO
  8397. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8398. IF type.form = SyntaxTree.Tensor THEN
  8399. ELSIF type.form = SyntaxTree.Open THEN
  8400. result.tag := result.op;
  8401. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8402. IntermediateCode.MakeMemory(result.op,addressType);
  8403. UseIntermediateOperand(result.tag);
  8404. ELSIF type.form = SyntaxTree.Static THEN
  8405. IF x.kind = SyntaxTree.ConstParameter THEN
  8406. IntermediateCode.MakeMemory(result.op,addressType);
  8407. END;
  8408. ELSE HALT(100)
  8409. END;
  8410. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8411. IF type.form = SyntaxTree.Tensor THEN
  8412. ToMemory(result.op,addressType,0);
  8413. ELSIF type.form = SyntaxTree.Open THEN
  8414. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8415. ReuseCopy(result.tag, mem);
  8416. ReleaseIntermediateOperand(mem);
  8417. ReleaseIntermediateOperand(result.op);
  8418. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8419. ELSIF type.form = SyntaxTree.Static THEN
  8420. IntermediateCode.MakeMemory(result.op,addressType);
  8421. ELSE HALT(100)
  8422. END;
  8423. ELSE HALT(100)
  8424. END;
  8425. END;
  8426. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8427. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8428. IntermediateCode.MakeMemory(result.op,addressType);
  8429. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8430. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8431. END;
  8432. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8433. ValueToCondition(result);
  8434. ELSIF type IS SyntaxTree.ProcedureType THEN
  8435. ReleaseIntermediateOperand(result.tag);
  8436. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8437. IF x.kind = SyntaxTree.VarParameter THEN
  8438. ReuseCopy(result.tag,result.op);
  8439. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8440. IntermediateCode.MakeMemory(result.tag,addressType);
  8441. ELSE
  8442. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8443. UseIntermediateOperand(result.tag);
  8444. END;
  8445. ELSE
  8446. result.tag := nil;
  8447. END;
  8448. (* tag for pointer type computed not here but during dereferencing *)
  8449. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8450. ReleaseIntermediateOperand(result.tag);
  8451. result.tag := basereg;
  8452. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8453. IntermediateCode.MakeMemory(result.tag,addressType);
  8454. UseIntermediateOperand(result.tag);
  8455. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8456. ReleaseIntermediateOperand(result.tag);
  8457. result.tag := TypeDescriptorAdr(type);
  8458. IF ~newObjectFile THEN
  8459. IntermediateCode.MakeMemory(result.tag,addressType);
  8460. END;
  8461. UseIntermediateOperand(result.tag);
  8462. END;
  8463. IF Trace THEN TraceExit("VisitParameter") END;
  8464. END VisitParameter;
  8465. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8466. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8467. BEGIN
  8468. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8469. (* left.p: left already emitted *)
  8470. tag := result.op; (* value of pointer to left *)
  8471. (* get type desc *)
  8472. tmp := result.tag;
  8473. IntermediateCode.MakeMemory(tmp,addressType);
  8474. (* get method adr *)
  8475. Reuse1(reg,tmp);
  8476. ReleaseIntermediateOperand(tmp);
  8477. IF backend.cooperative THEN
  8478. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8479. WHILE recordType.baseType # NIL DO
  8480. recordType := recordType.GetBaseRecord ();
  8481. END;
  8482. GetRecordTypeName (recordType,name);
  8483. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8484. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8485. offset := 0;
  8486. ELSE
  8487. offset := 2;
  8488. END;
  8489. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8490. ELSE
  8491. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8492. END;
  8493. InitOperand(operand,ModeReference);
  8494. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8495. operand.op := reg;
  8496. operand.tag := tag;
  8497. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8498. END DynamicCallOperand;
  8499. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8500. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8501. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8502. BEGIN
  8503. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8504. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8505. tag := operand.op;
  8506. ReleaseIntermediateOperand(operand.tag);
  8507. ELSE tag := nil
  8508. END;
  8509. IF x.isInline THEN
  8510. sectionType := Sections.InlineCodeSection;
  8511. ELSE
  8512. sectionType := Sections.CodeSection;
  8513. END;
  8514. IF x.externalName # NIL THEN
  8515. Basic.ToSegmentedName(x.externalName^, name);
  8516. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8517. ELSE
  8518. GetCodeSectionNameForSymbol(x, name);
  8519. IF (x.scope.ownerModule = module.module) THEN
  8520. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8521. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8522. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8523. IF source.pc = 0 THEN (* no code yet *)
  8524. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8525. END;
  8526. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8527. bits := x.procedureScope.body.code.inlineCode;
  8528. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8529. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8530. binary.CopyBits(bits, 0, bits.GetSize());
  8531. source.SetResolved(binary);
  8532. ELSE
  8533. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8534. END;
  8535. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8536. END;
  8537. InitOperand(operand,ModeValue);
  8538. operand.op := reg;
  8539. operand.tag := tag;
  8540. IF Trace THEN TraceExit("StaticCallOperand") END;
  8541. END StaticCallOperand;
  8542. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8543. (* handle expressions of the form designator.procedure or procedure *)
  8544. BEGIN
  8545. IF Trace THEN TraceEnter("VisitProcedure") END;
  8546. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8547. DynamicCallOperand(result,x);
  8548. ELSIF x.isInline THEN
  8549. StaticCallOperand(result,x);
  8550. ELSE
  8551. StaticCallOperand(result,x);
  8552. END;
  8553. IF Trace THEN TraceExit("VisitProcedure") END;
  8554. END VisitProcedure;
  8555. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8556. BEGIN
  8557. VisitProcedure(x);
  8558. END VisitOperator;
  8559. (** statements *)
  8560. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8561. BEGIN
  8562. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8563. Expression(x.call);
  8564. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8565. ReleaseOperand(result)
  8566. END;
  8567. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8568. END VisitProcedureCallStatement;
  8569. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8570. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8571. leftBase, rightBase: SyntaxTree.Type;
  8572. procedureName,s: SyntaxTree.IdentifierString;
  8573. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8574. size: LONGINT; rightKind: LONGINT;
  8575. dummy: IntermediateCode.Operand;
  8576. CONST moduleName = "FoxArrayBase";
  8577. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8578. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8579. BEGIN
  8580. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8581. IF base IS SyntaxTree.MathArrayType THEN
  8582. base := OpenArray(base(SyntaxTree.MathArrayType));
  8583. END;
  8584. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8585. result.SetArrayBase(base);
  8586. RETURN result
  8587. END OpenArray;
  8588. BEGIN
  8589. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8590. SaveRegisters();ReleaseUsedRegisters(saved);
  8591. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8592. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8593. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8594. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8595. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8596. IF leftType.form = SyntaxTree.Tensor THEN
  8597. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8598. ELSIF leftType.form = SyntaxTree.Open THEN
  8599. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8600. ELSIF leftType.form = SyntaxTree.Static THEN
  8601. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8602. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8603. END;
  8604. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8605. IF procedure = NIL THEN
  8606. s := "Instruction not supported on target, emulation procedure ";
  8607. Strings.Append(s,moduleName);
  8608. Strings.Append(s,".");
  8609. Strings.Append(s,procedureName);
  8610. Strings.Append(s," not present");
  8611. Error(position,s);
  8612. ELSE
  8613. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8614. parameter.SetType(leftType);
  8615. parameter.SetAccess(SyntaxTree.Internal);
  8616. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8617. parameter.SetKind(rightKind);
  8618. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8619. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8620. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8621. StaticCallOperand(result,procedure);
  8622. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8623. ReleaseOperand(result);
  8624. END;
  8625. RestoreRegisters(saved);
  8626. END;
  8627. END AssignMathArray;
  8628. VAR modifyAssignmentCounter := 0: LONGINT;
  8629. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8630. VAR processor,mem,dst: IntermediateCode.Operand;
  8631. BEGIN
  8632. IF value.intValue = true.intValue THEN
  8633. INC(modifyAssignmentCounter);
  8634. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8635. modifyAssignmentsPC := section.pc;
  8636. ELSE
  8637. DEC(modifyAssignmentCounter);
  8638. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8639. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8640. END;
  8641. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8642. dst := NewRegisterOperand (addressType);
  8643. Emit(Mov(position,dst, processor));
  8644. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8645. Emit(Mov(position,mem, value));
  8646. ReleaseIntermediateOperand(dst);
  8647. END ModifyAssignments;
  8648. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8649. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8650. BEGIN
  8651. type := left.type.resolved;
  8652. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8653. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8654. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8655. IF procedureType.returnParameter = parameter THEN
  8656. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8657. END;
  8658. END;
  8659. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8660. END CopySize;
  8661. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8662. VAR
  8663. leftO, rightO: Operand;
  8664. mem, sizeOp: IntermediateCode.Operand;
  8665. leftType, rightType, componentType: SyntaxTree.Type;
  8666. size: LONGINT;
  8667. parameters: SyntaxTree.ExpressionList;
  8668. procedure: SyntaxTree.Procedure;
  8669. call: SyntaxTree.ProcedureCallDesignator;
  8670. designator: SyntaxTree.Designator;
  8671. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8672. VAR procedureType: SyntaxTree.ProcedureType;
  8673. BEGIN
  8674. IF ReturnedAsParameter(right.type) THEN
  8675. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8676. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8677. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8678. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8679. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8680. IF right.id = Global.Reshape THEN RETURN TRUE
  8681. END;
  8682. END;
  8683. END;
  8684. END;
  8685. RETURN FALSE
  8686. END CanPassAsResultParameter;
  8687. BEGIN
  8688. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8689. leftType := left.type.resolved; rightType:= right.type.resolved;
  8690. IF backend.cooperative & left.NeedsTrace() THEN
  8691. ModifyAssignments(true);
  8692. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8693. Designate(right, rightO);
  8694. Designate(left, leftO);
  8695. ASSERT(leftO.mode = ModeReference);
  8696. TransferToRegister(leftO.op, leftO.op);
  8697. TransferToRegister(rightO.op, rightO.op);
  8698. Emit(Push(position, leftO.op));
  8699. Emit(Push(position, rightO.op));
  8700. CallAssignMethod(leftO.op, rightO.op, left.type);
  8701. Emit(Pop(position, rightO.op));
  8702. Emit(Pop(position, leftO.op));
  8703. sizeOp := CopySize(left);
  8704. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8705. ReleaseOperand(leftO);
  8706. ReleaseOperand(rightO);
  8707. ELSE
  8708. Evaluate(right,rightO);
  8709. Designate(left,leftO);
  8710. ASSERT(leftO.mode = ModeReference);
  8711. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8712. (* copy procedure address first *)
  8713. MakeMemory(mem,leftO.op,addressType,0);
  8714. Emit(Mov(position,mem,rightO.op));
  8715. ReleaseIntermediateOperand(mem);
  8716. (* copy pointer address *)
  8717. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8718. CallAssignPointer(leftO.tag, rightO.tag);
  8719. ELSE
  8720. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8721. CallAssignPointer(leftO.op, rightO.op);
  8722. END;
  8723. ReleaseOperand(leftO);
  8724. ReleaseOperand(rightO);
  8725. END;
  8726. ModifyAssignments(false);
  8727. RETURN;
  8728. END;
  8729. IF CanPassAsResultParameter(right) THEN
  8730. procedureResultDesignator := left(SyntaxTree.Designator);
  8731. Expression(right);
  8732. procedureResultDesignator := NIL;
  8733. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8734. (* left <-- ALIAS OF right: zerocopy *)
  8735. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8736. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8737. designator.SetType(procedure.type);
  8738. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8739. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8740. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8741. END;
  8742. ELSIF leftType IS SyntaxTree.RangeType THEN
  8743. (* LHS is of array range type *)
  8744. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8745. Evaluate(right, rightO);
  8746. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8747. (* first *)
  8748. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8749. Emit(Mov(position,mem, rightO.op));
  8750. ReleaseIntermediateOperand(mem);
  8751. (* last *)
  8752. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8753. Emit(Mov(position,mem, rightO.tag));
  8754. ReleaseIntermediateOperand(mem);
  8755. (* step *)
  8756. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8757. Emit(Mov(position,mem, rightO.extra));
  8758. ReleaseIntermediateOperand(mem);
  8759. ReleaseOperand(rightO);
  8760. ReleaseOperand(leftO)
  8761. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8762. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8763. Evaluate(right, rightO);
  8764. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8765. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8766. (* real part *)
  8767. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8768. Emit(Mov(position,mem, rightO.op));
  8769. ReleaseIntermediateOperand(mem);
  8770. (* imaginary part *)
  8771. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8772. Emit(Mov(position,mem, rightO.tag));
  8773. ReleaseIntermediateOperand(mem);
  8774. ReleaseOperand(rightO);
  8775. ReleaseOperand(leftO)
  8776. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8777. OR (leftType IS SyntaxTree.PortType) THEN
  8778. (* rightO := leftO;*)
  8779. Evaluate(right,rightO);
  8780. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8781. Designate(left,leftO);
  8782. IF leftO.mode = ModeReference THEN
  8783. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8784. destination := mem;
  8785. ELSE
  8786. destination := leftO.op;
  8787. END;
  8788. ReleaseOperand(leftO);
  8789. IF destination.mode # IntermediateCode.Undefined THEN
  8790. Emit(Mov(position,destination,rightO.op));
  8791. END;
  8792. ReleaseOperand(rightO);
  8793. ReleaseIntermediateOperand(mem);
  8794. IntermediateCode.InitOperand(destination);
  8795. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8796. Evaluate(right,rightO);
  8797. Designate(left,leftO);
  8798. MakeMemory(mem,leftO.op,addressType,0);
  8799. Emit(Mov(position,mem,rightO.op));
  8800. ReleaseIntermediateOperand(mem);
  8801. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8802. (* delegate *)
  8803. (*
  8804. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8805. *)
  8806. Emit(Mov(position,leftO.tag,rightO.tag));
  8807. END;
  8808. ReleaseOperand(leftO);
  8809. ReleaseOperand(rightO);
  8810. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8811. Designate(right,rightO);
  8812. Designate(left,leftO);
  8813. sizeOp := CopySize(left);
  8814. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8815. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8816. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8817. IF (rightType IS SyntaxTree.StringType) THEN
  8818. CopyString(left,right);
  8819. 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
  8820. Designate(right,rightO);
  8821. Designate(left,leftO);
  8822. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8823. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8824. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8825. ELSE
  8826. HALT(201)
  8827. END;
  8828. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8829. AssignMathArray(left,right);
  8830. ELSE
  8831. HALT(200);
  8832. END;
  8833. END Assign;
  8834. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8835. BEGIN
  8836. IF Trace THEN TraceEnter("VisitAssignment") END;
  8837. Assign(x.left,x.right);
  8838. IF Trace THEN TraceExit("VisitAssignment") END;
  8839. END VisitAssignment;
  8840. PROCEDURE EmitCooperativeSwitch;
  8841. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8842. BEGIN
  8843. ASSERT (cooperativeSwitches);
  8844. pc := section.pc;
  8845. IF lastSwitchPC = section.pc THEN RETURN END;
  8846. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8847. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8848. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8849. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8850. INC(statCoopSwitch, section.pc - pc);
  8851. END EmitCooperativeSwitch;
  8852. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8853. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8854. BEGIN
  8855. p0 := communication.left; p1 := communication.right;
  8856. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8857. Evaluate(p0,s0);
  8858. Evaluate(p1,s1);
  8859. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8860. Emit(Push(position,s0.op));
  8861. Emit(Push(position,s1.op));
  8862. (*
  8863. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8864. *)
  8865. IF ~backend.cellsAreObjects THEN
  8866. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8867. END;
  8868. ReleaseOperand(s0);
  8869. ReleaseOperand(s1);
  8870. IF backend.cellsAreObjects THEN
  8871. CallThis(position,"ActiveCellsRuntime","Send",2);
  8872. ELSE
  8873. CallThis(position,ChannelModuleName,"Send",2);
  8874. END;
  8875. (* ----- RECEIVE ------*)
  8876. ELSE
  8877. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8878. tmp := p0; p0 := p1; p1 := tmp;
  8879. END;
  8880. Evaluate(p0,s0);
  8881. Emit(Push(position,s0.op));
  8882. Designate(p1,s1);
  8883. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8884. Emit(Push(position,s1.op));
  8885. (*
  8886. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8887. *)
  8888. IF ~backend.cellsAreObjects THEN
  8889. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8890. END;
  8891. ReleaseOperand(s0);
  8892. ReleaseOperand(s1);
  8893. IF backend.cellsAreObjects THEN
  8894. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8895. ELSE
  8896. CallThis(position,ChannelModuleName,"Receive",2)
  8897. END;
  8898. END;
  8899. END VisitCommunicationStatement;
  8900. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8901. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8902. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8903. VAR true, false: Label; condition, value: BOOLEAN;
  8904. BEGIN
  8905. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8906. IF condition THEN
  8907. true := NewLabel();
  8908. false := NewLabel();
  8909. Condition(if.condition,true,false);
  8910. SetLabel(true);
  8911. StatementSequence(if.statements);
  8912. BrL(end);
  8913. SetLabel(false);
  8914. ELSE
  8915. IF value THEN (* always true *)
  8916. escape := TRUE;
  8917. StatementSequence(if.statements);
  8918. (* no branch necessary -- rest skipped *)
  8919. END;
  8920. END;
  8921. END IfPart;
  8922. BEGIN
  8923. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8924. end := NewLabel();
  8925. elsifs := x.ElsifParts();
  8926. IfPart(x.ifPart);
  8927. FOR i := 0 TO elsifs-1 DO
  8928. IF ~escape THEN
  8929. elsif := x.GetElsifPart(i);
  8930. IfPart(elsif);
  8931. END;
  8932. END;
  8933. IF (x.elsePart # NIL) & ~escape THEN
  8934. StatementSequence(x.elsePart);
  8935. END;
  8936. SetLabel(end);
  8937. IF Trace THEN TraceExit("VisitIfStatement") END;
  8938. END VisitIfStatement;
  8939. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8940. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8941. BEGIN
  8942. (*IF x.variable.type.resolved = x.type.resolved THEN
  8943. (* always true, do nothing *)
  8944. ELSE*)
  8945. Designate(x.variable,res);
  8946. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8947. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8948. END;
  8949. trueL := NewLabel();
  8950. TypeTest(res.tag,x.type,trueL,falseL);
  8951. ReleaseOperand(res);
  8952. SetLabel(trueL);
  8953. StatementSequence(x.statements);
  8954. BrL(endL);
  8955. END WithPart;
  8956. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8957. VAR endL,falseL: Label;i: LONGINT;
  8958. BEGIN
  8959. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8960. endL := NewLabel();
  8961. FOR i := 0 TO x.WithParts()-1 DO
  8962. falseL := NewLabel();
  8963. WithPart(x.GetWithPart(i),falseL,endL);
  8964. SetLabel(falseL);
  8965. END;
  8966. IF x.elsePart = NIL THEN
  8967. IF ~isUnchecked THEN
  8968. EmitTrap(position,WithTrap);
  8969. END;
  8970. ELSE
  8971. StatementSequence(x.elsePart)
  8972. END;
  8973. SetLabel(endL);
  8974. IF Trace THEN TraceExit("VisitWithStatement") END;
  8975. END VisitWithStatement;
  8976. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8977. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8978. out,else: Label; label: Label;
  8979. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8980. symbol: SyntaxTree.Symbol;
  8981. BEGIN
  8982. (*! split case statement into if-elsif statements for large case label lists *)
  8983. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8984. size := x.max-x.min+1;
  8985. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8986. END;
  8987. Evaluate(x.variable,var);
  8988. ReuseCopy(tmp,var.op);
  8989. ReleaseIntermediateOperand(var.op);
  8990. var.op := tmp;
  8991. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8992. Convert(var.op,addressType);
  8993. size := x.max-x.min+1;
  8994. else := NewLabel();
  8995. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8996. (*
  8997. UniqueId(name,module.module,"case",caseId);
  8998. *)
  8999. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9000. Global.GetModuleSegmentedName(module.module, name);
  9001. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9002. symbol := SyntaxTree.NewSymbol(name[1]);
  9003. symbol.SetScope(moduleScope);
  9004. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9005. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9006. section.isCaseTable := TRUE;
  9007. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9008. ReuseCopy(res,var.op);
  9009. ReleaseOperand(var);
  9010. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9011. Emit(Add(position,res,res,jmp));
  9012. IntermediateCode.MakeMemory(res,addressType);
  9013. Emit(Br(position,res));
  9014. ReleaseIntermediateOperand(res);
  9015. out := NewLabel();
  9016. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9017. part := x.GetCasePart(i);
  9018. constant := part.firstConstant;
  9019. label := NewLabel();
  9020. SetLabel(label);
  9021. WHILE(constant # NIL) DO (* case labels for this case part *)
  9022. FOR j := constant.min TO constant.max DO
  9023. fixups[j-x.min] := label;
  9024. END;
  9025. constant := constant.next;
  9026. END;
  9027. StatementSequence(part.statements);
  9028. BrL(out);
  9029. END;
  9030. SetLabel(else);
  9031. FOR i := 0 TO size-1 DO
  9032. IF fixups[i] = NIL THEN
  9033. fixups[i] := else;
  9034. END;
  9035. END;
  9036. IF x.elsePart # NIL THEN
  9037. StatementSequence(x.elsePart);
  9038. ELSIF ~isUnchecked THEN
  9039. EmitTrap(position,CaseTrap);
  9040. END;
  9041. SetLabel(out);
  9042. FOR i := 0 TO size-1 DO
  9043. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9044. section.Emit(Data(position,op));
  9045. END;
  9046. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9047. END VisitCaseStatement;
  9048. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9049. VAR start: Label; true,false: Label;
  9050. BEGIN
  9051. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9052. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9053. start := NewLabel();
  9054. true := NewLabel();
  9055. false := NewLabel();
  9056. SetLabel(start);
  9057. Condition(x.condition,true,false);
  9058. SetLabel(true);
  9059. StatementSequence(x.statements);
  9060. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9061. BrL(start);
  9062. SetLabel(false);
  9063. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9064. END VisitWhileStatement;
  9065. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9066. VAR false,true: Label;
  9067. BEGIN
  9068. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9069. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9070. true := NewLabel();
  9071. false := NewLabel();
  9072. SetLabel(false);
  9073. StatementSequence(x.statements);
  9074. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9075. Condition(x.condition,true,false);
  9076. SetLabel(true);
  9077. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9078. END VisitRepeatStatement;
  9079. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9080. VAR
  9081. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9082. temporaryVariable: SyntaxTree.Variable;
  9083. temporaryVariableDesignator : SyntaxTree.Designator;
  9084. BEGIN
  9085. IF Trace THEN TraceEnter("VisitForStatement") END;
  9086. true := NewLabel();
  9087. false := NewLabel();
  9088. start := NewLabel();
  9089. Assign(x.variable,x.from);
  9090. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9091. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9092. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9093. Assign(temporaryVariableDesignator,x.to);
  9094. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9095. IF by > 0 THEN
  9096. cmp := Scanner.LessEqual
  9097. ELSE
  9098. cmp := Scanner.GreaterEqual
  9099. END;
  9100. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9101. binary.SetType(system.booleanType);
  9102. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9103. SetLabel(start);
  9104. Condition(binary,true,false);
  9105. SetLabel(true);
  9106. StatementSequence(x.statements);
  9107. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9108. binary.SetType(x.variable.type);
  9109. Assign(x.variable,binary);
  9110. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9111. BrL(start);
  9112. SetLabel(false);
  9113. IF Trace THEN TraceExit("VisitForStatement") END;
  9114. END VisitForStatement;
  9115. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9116. VAR prevLoop: Label;
  9117. BEGIN
  9118. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9119. prevLoop := currentLoop;
  9120. currentLoop := NewLabel();
  9121. StatementSequence(x.statements);
  9122. SetLabel(currentLoop);
  9123. currentLoop := prevLoop;
  9124. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9125. END VisitExitableBlock;
  9126. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9127. VAR prevLoop,start: Label;
  9128. BEGIN
  9129. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9130. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9131. start := NewLabel();
  9132. prevLoop := currentLoop;
  9133. SetLabel(start);
  9134. currentLoop := NewLabel();
  9135. StatementSequence(x.statements);
  9136. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9137. BrL(start);
  9138. SetLabel(currentLoop);
  9139. currentLoop := prevLoop;
  9140. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9141. END VisitLoopStatement;
  9142. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9143. VAR outer: SyntaxTree.Statement;
  9144. BEGIN
  9145. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9146. IF locked THEN (* r if we jump out of an exclusive block *)
  9147. outer := x.outer;
  9148. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9149. outer := outer.outer;
  9150. END;
  9151. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9152. Lock(FALSE);
  9153. END;
  9154. END;
  9155. BrL(currentLoop);
  9156. IF Trace THEN TraceExit("VisitExitStatement") END;
  9157. END VisitExitStatement;
  9158. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9159. VAR
  9160. expression, parameterDesignator: SyntaxTree.Expression;
  9161. type, componentType: SyntaxTree.Type;
  9162. res, right: Operand;
  9163. left, mem, reg: IntermediateCode.Operand;
  9164. parameter: SyntaxTree.Parameter;
  9165. procedure: SyntaxTree.Procedure;
  9166. procedureType: SyntaxTree.ProcedureType;
  9167. returnTypeOffset: LONGINT;
  9168. delegate: BOOLEAN;
  9169. map: SymbolMap;
  9170. BEGIN
  9171. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9172. expression := x.returnValue;
  9173. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9174. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9175. IF currentIsInline THEN
  9176. IF expression # NIL THEN
  9177. map := currentMapper.Get(NIL);
  9178. IF map # NIL THEN
  9179. Assign(map.to, expression);
  9180. END;
  9181. END;
  9182. BrL(currentInlineExit);
  9183. RETURN;
  9184. END;
  9185. IF expression # NIL THEN
  9186. type := expression.type.resolved;
  9187. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9188. IF locked THEN Lock(FALSE) END;
  9189. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9190. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9191. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9192. (* return without structured return parameter *)
  9193. Evaluate(expression,res);
  9194. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9195. IF locked OR profile THEN
  9196. Emit(Push(position,res.op));
  9197. IF delegate THEN HALT(200) END;
  9198. ReleaseOperand(res);
  9199. IF locked THEN Lock(FALSE) END;
  9200. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9201. reg := NewRegisterOperand(res.op.type);
  9202. Emit(Pop(position,reg));
  9203. Emit(Return(position,reg));
  9204. ReleaseIntermediateOperand(reg);
  9205. ELSE
  9206. Emit(Return(position,res.op));
  9207. ReleaseOperand(res);
  9208. END;
  9209. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9210. THEN
  9211. (* return using structured return parameter *)
  9212. 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)
  9213. OR SemanticChecker.IsPointerType(type));
  9214. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9215. parameter :=procedureType.returnParameter;
  9216. ASSERT(parameter # NIL);
  9217. returnTypeOffset := parameter.offsetInBits;
  9218. (*
  9219. IF parameter# NIL THEN
  9220. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9221. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9222. ELSE
  9223. returnTypeOffset := system.offsetFirstParameter
  9224. END;
  9225. *)
  9226. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9227. IF type IS SyntaxTree.RangeType THEN
  9228. (* array range type *)
  9229. Evaluate(expression, right);
  9230. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9231. Emit(Mov(position,mem, right.op)); (* first *)
  9232. ReleaseIntermediateOperand(mem);
  9233. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9234. Emit(Mov(position,mem, right.tag)); (* last *)
  9235. ReleaseIntermediateOperand(mem);
  9236. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9237. Emit(Mov(position,mem, right.extra)); (* step *)
  9238. ReleaseIntermediateOperand(mem);
  9239. ReleaseOperand(right);
  9240. ELSIF type IS SyntaxTree.ComplexType THEN
  9241. Evaluate(expression, right);
  9242. componentType := type(SyntaxTree.ComplexType).componentType;
  9243. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9244. Emit(Mov(position,mem, right.op)); (* real part *)
  9245. ReleaseIntermediateOperand(mem);
  9246. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9247. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9248. ReleaseIntermediateOperand(mem);
  9249. ReleaseOperand(right);
  9250. ELSE (* covers cases: pointer / record / array *)
  9251. parameter := procedureType.returnParameter;
  9252. checker.SetCurrentScope(currentScope);
  9253. ASSERT(parameter # NIL);
  9254. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9255. Assign(parameterDesignator,expression);
  9256. END;
  9257. ReleaseIntermediateOperand(left);
  9258. IF locked THEN Lock(FALSE) END;
  9259. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9260. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9261. parameter := procedureType.returnParameter;
  9262. checker.SetCurrentScope(currentScope);
  9263. IF parameter = NIL THEN
  9264. Error(procedure.position, "structured return of parameter of procedure not found");
  9265. ELSE
  9266. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9267. Assign(parameterDesignator,expression);
  9268. END;
  9269. IF locked THEN Lock(FALSE) END;
  9270. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9271. ELSE
  9272. HALT(200);
  9273. END;
  9274. ELSE
  9275. IF locked THEN Lock(FALSE) END;
  9276. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9277. END;
  9278. IF backend.cooperative THEN
  9279. BrL(exitLabel);
  9280. ELSE
  9281. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9282. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9283. END;
  9284. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9285. END VisitReturnStatement;
  9286. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9287. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9288. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9289. statements: SyntaxTree.StatementSequence;
  9290. name, suffix: SyntaxTree.IdentifierString;
  9291. BEGIN
  9292. Strings.IntToStr(awaitProcCounter,suffix);
  9293. Strings.Concat("@AwaitProcedure",suffix,name);
  9294. identifier := SyntaxTree.NewIdentifier(name);
  9295. INC(awaitProcCounter);
  9296. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9297. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9298. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9299. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9300. procedure.SetAccess(SyntaxTree.Hidden);
  9301. procedure.SetScope(currentScope);
  9302. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9303. procedureType.SetReturnType(system.booleanType);
  9304. procedure.SetType(procedureType);
  9305. body := SyntaxTree.NewBody(x.position,procedureScope);
  9306. procedureScope.SetBody(body);
  9307. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9308. returnStatement.SetReturnValue(x.condition);
  9309. statements := SyntaxTree.NewStatementSequence();
  9310. statements.AddStatement(returnStatement);
  9311. body.SetStatementSequence(statements);
  9312. currentScope.AddProcedure(procedure);
  9313. RETURN procedure
  9314. END MakeAwaitProcedure;
  9315. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9316. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9317. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9318. BEGIN
  9319. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9320. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9321. IF backend.cooperative THEN
  9322. start := NewLabel();
  9323. true := NewLabel();
  9324. false := NewLabel();
  9325. SetLabel(start);
  9326. Condition(x.condition,true,false);
  9327. SetLabel(false);
  9328. PushSelfPointer();
  9329. CallThis(position,"ExclusiveBlocks","Await",1);
  9330. BrL(start);
  9331. SetLabel(true);
  9332. PushSelfPointer();
  9333. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9334. ELSE
  9335. proc := MakeAwaitProcedure(x);
  9336. Emit(Push(position,fp));
  9337. GetCodeSectionNameForSymbol(proc,name);
  9338. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9339. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9340. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9341. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9342. Emit(Result(position,res));
  9343. (*
  9344. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9345. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9346. *)
  9347. InitOperand(result,ModeValue);
  9348. result.op := res;
  9349. label := NewLabel();
  9350. BreqL(label, result.op, SELF.true);
  9351. ReleaseOperand(result);
  9352. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9353. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9354. Emit(Push(position,res));
  9355. Emit(Push(position,fp));
  9356. PushSelfPointer();
  9357. Emit(Push(position,nil));
  9358. CallThis(position,"Objects","Await",4);
  9359. SetLabel(label);
  9360. END;
  9361. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9362. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9363. END VisitAwaitStatement;
  9364. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9365. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9366. BEGIN
  9367. FOR i := 0 TO x.Length() - 1 DO
  9368. statement := x.GetStatement( i );
  9369. Statement(statement);
  9370. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9371. END;
  9372. END StatementSequence;
  9373. PROCEDURE PushSelfPointer;
  9374. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9375. BEGIN
  9376. scope := currentScope;
  9377. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9378. scope := scope.outerScope;
  9379. END;
  9380. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9381. IF ~newObjectFile THEN
  9382. Symbol(moduleSelf,op);
  9383. IntermediateCode.MakeMemory(op.op,addressType);
  9384. ELSE
  9385. moduleSection := meta.ModuleSection();
  9386. IF backend.cooperative THEN
  9387. moduleOffset := 0;
  9388. ELSE
  9389. moduleOffset := moduleSection.pc;
  9390. END;
  9391. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9392. END;
  9393. ELSE
  9394. GetBaseRegister(op.op,currentScope,scope);
  9395. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9396. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9397. IF backend.cooperative THEN
  9398. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9399. END;
  9400. IntermediateCode.MakeMemory(op.op,addressType);
  9401. END;
  9402. Emit(Push(position,op.op));
  9403. ReleaseOperand(op);
  9404. END PushSelfPointer;
  9405. PROCEDURE Lock(lock: BOOLEAN);
  9406. BEGIN
  9407. IF Trace THEN TraceEnter("Lock") END;
  9408. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9409. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9410. ASSERT(modifyAssignmentCounter = 0);
  9411. IF dump # NIL THEN
  9412. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9413. dump.Ln;dump.Update;
  9414. END;
  9415. PushSelfPointer;
  9416. IF backend.cooperative THEN
  9417. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9418. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9419. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9420. END;
  9421. ELSE
  9422. Emit(Push(position,true));
  9423. IF lock THEN CallThis(position,"Objects","Lock",2)
  9424. ELSE CallThis(position,"Objects","Unlock",2);
  9425. END;
  9426. END;
  9427. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9428. IF Trace THEN TraceExit("Lock") END;
  9429. END Lock;
  9430. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9431. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9432. BEGIN
  9433. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9434. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9435. previouslyUnchecked := isUnchecked;
  9436. isUnchecked := isUnchecked OR x.isUnchecked;
  9437. previouslyCooperativeSwitches := cooperativeSwitches;
  9438. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9439. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9440. IF x.statements # NIL THEN
  9441. StatementSequence(x.statements);
  9442. END;
  9443. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9444. isUnchecked := previouslyUnchecked;
  9445. cooperativeSwitches := previouslyCooperativeSwitches;
  9446. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9447. END VisitStatementBlock;
  9448. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9449. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9450. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9451. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9452. procedure: SyntaxTree.Procedure;
  9453. map: SymbolMap;
  9454. BEGIN
  9455. scope := currentScope;
  9456. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9457. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9458. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9459. return := emptyOperand;
  9460. IF Trace THEN TraceEnter("VisitCode") END;
  9461. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9462. NEW(in, x.inRules.Length());
  9463. FOR i := 0 TO LEN(in)-1 DO
  9464. statement := x.inRules.GetStatement(i);
  9465. WITH statement: SyntaxTree.Assignment DO
  9466. Evaluate(statement.right, operand);
  9467. result := operand.op;
  9468. NEW(str, 64);
  9469. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9470. in[i] := result; IntermediateCode.SetString(in[i], str);
  9471. ReleaseIntermediateOperand(operand.tag);
  9472. END;
  9473. END;
  9474. ELSE in := NIL
  9475. END;
  9476. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9477. NEW(out, x.outRules.Length());
  9478. FOR i := 0 TO LEN(out)-1 DO
  9479. statement := x.outRules.GetStatement(i);
  9480. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9481. WITH statement: SyntaxTree.Assignment DO
  9482. Evaluate(statement.left, operand); (*?? or designate *)
  9483. result := operand.op;
  9484. NEW(str, 64);
  9485. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9486. out[i] := result; IntermediateCode.SetString(out[i], str);
  9487. ReleaseIntermediateOperand(operand.tag);
  9488. |statement: SyntaxTree.ReturnStatement DO
  9489. NEW(str, 64);
  9490. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9491. IF currentIsInline THEN
  9492. map := currentMapper.Get(NIL);
  9493. Evaluate(map.to, operand);
  9494. out[i] := operand.op;
  9495. ELSE
  9496. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9497. END;
  9498. IntermediateCode.SetString(out[i], str);
  9499. ReleaseIntermediateOperand(operand.tag);
  9500. return := out[i];
  9501. ELSE
  9502. END;
  9503. END;
  9504. ELSE out := NIL
  9505. END;
  9506. Emit(Asm(x.position,x.sourceCode, in, out));
  9507. IF in # NIL THEN
  9508. FOR i := 0 TO LEN(in)-1 DO
  9509. ReleaseIntermediateOperand(in[i]);
  9510. END;
  9511. END;
  9512. IF out # NIL THEN
  9513. FOR i := 0 TO LEN(out)-1 DO
  9514. WITH statement: SyntaxTree.Assignment DO
  9515. ReleaseIntermediateOperand(out[i]);
  9516. ELSE
  9517. IF currentIsInline THEN
  9518. ReleaseIntermediateOperand(out[i]);
  9519. END;
  9520. END;
  9521. statement := x.outRules.GetStatement(i);
  9522. END;
  9523. END;
  9524. IF return.mode # IntermediateCode.Undefined THEN
  9525. IF currentIsInline THEN
  9526. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9527. Symbol(procedureType.returnParameter, par);
  9528. MakeMemory(mem, par.op, return.type, 0);
  9529. ReleaseOperand(par);
  9530. Emit(Mov(position, mem, return));
  9531. ReleaseIntermediateOperand(mem);
  9532. ELSE
  9533. Emit(Return(position,return));
  9534. END;
  9535. IF currentIsInline THEN RETURN END;
  9536. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9537. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9538. ReleaseIntermediateOperand(return);
  9539. END;
  9540. IF Trace THEN TraceExit("VisitCode") END;
  9541. END VisitCode;
  9542. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9543. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9544. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9545. const, call: IntermediateCode.Operand;
  9546. parameterDesignator: SyntaxTree.Expression;
  9547. saved: RegisterEntry;
  9548. name: Basic.SegmentedName;
  9549. BEGIN
  9550. IF Trace THEN TraceEnter("ParameterCopies") END;
  9551. parameter := x.firstParameter;
  9552. WHILE parameter # NIL DO
  9553. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9554. type := parameter.type.resolved;
  9555. IF IsOpenArray(type) THEN
  9556. VisitParameter(parameter);
  9557. op := result;
  9558. IF backend.cooperative & parameter.NeedsTrace() THEN
  9559. length := GetArrayLength(type, op.tag);
  9560. size := NewRegisterOperand(addressType);
  9561. base := ArrayBaseType(type);
  9562. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9563. Emit(Mul(position, size, length, const));
  9564. dst := NewRegisterOperand (addressType);
  9565. Emit(Mov(position, dst, size));
  9566. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9567. Emit(Sub(position,dst,sp,dst));
  9568. Emit(And(position,dst,dst,const));
  9569. Emit(Mov(position,sp,dst));
  9570. par := fp;
  9571. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9572. IntermediateCode.InitImmediate(null, byteType, 0);
  9573. Emit(Fill(position, dst, size, null));
  9574. ReleaseIntermediateOperand(dst);
  9575. ReleaseIntermediateOperand(length);
  9576. SaveRegisters();ReleaseUsedRegisters(saved);
  9577. (* register dst has been freed before SaveRegisters already *)
  9578. base := ArrayBaseType(type);
  9579. (* assign method of open array *)
  9580. IF base.IsRecordType() THEN
  9581. Emit (Push(position, length));
  9582. Emit (Push(position, dst));
  9583. Emit (Push(position, op.op));
  9584. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9585. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9586. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9587. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9588. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9589. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9590. Emit (Push(position,length));
  9591. Emit (Push(position, dst));
  9592. Emit (Push(position, length));
  9593. Emit (Push(position, op.op));
  9594. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9595. ELSE
  9596. Emit (Push(position, length));
  9597. Emit (Push(position, dst));
  9598. Emit (Push(position, length));
  9599. Emit (Push(position, op.op));
  9600. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9601. ASSERT(ArrayBaseType(type).IsPointer());
  9602. END;
  9603. RestoreRegisters(saved);
  9604. ELSE
  9605. temp := GetDynamicSize(type,op.tag);
  9606. ReuseCopy(size,temp);
  9607. ReleaseIntermediateOperand(temp);
  9608. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9609. Emit(Sub(position,size,sp,size));
  9610. Emit(And(position,size,size,const));
  9611. Emit(Mov(position,sp,size));
  9612. par := fp;
  9613. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9614. ReleaseIntermediateOperand(size);
  9615. size := GetDynamicSize(type,op.tag);
  9616. END;
  9617. Emit(Copy(position,sp,op.op,size));
  9618. ReleaseIntermediateOperand(size);
  9619. ReleaseOperand(op);
  9620. IntermediateCode.MakeMemory(par,addressType);
  9621. Emit(Mov(position,par,sp));
  9622. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9623. checker.SetCurrentScope(currentScope);
  9624. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9625. Assign(parameterDesignator,parameterDesignator);
  9626. END;
  9627. END;
  9628. parameter := parameter.nextParameter;
  9629. END;
  9630. IF Trace THEN TraceExit("ParameterCopies") END;
  9631. END ParameterCopies;
  9632. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9633. VAR x: SyntaxTree.Variable;
  9634. BEGIN
  9635. x := scope.firstVariable;
  9636. WHILE x # NIL DO
  9637. InitVariable(x);
  9638. x := x.nextVariable;
  9639. END;
  9640. END InitVariables;
  9641. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9642. BEGIN
  9643. IF (symbol # NIL) THEN
  9644. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9645. ELSE
  9646. RETURN 0
  9647. END;
  9648. END GetFingerprint;
  9649. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9650. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9651. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9652. saved: RegisterEntry;
  9653. BEGIN
  9654. IF Trace THEN TraceEnter("Body") END;
  9655. ReleaseUsedRegisters(saved); (* just in case ... *)
  9656. section := ir;
  9657. exitLabel := NewLabel ();
  9658. IF moduleBody THEN moduleBodySection := section END;
  9659. IF ir.comments # NIL THEN
  9660. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9661. commentPrintout.SingleStatement(TRUE);
  9662. dump := ir.comments;
  9663. ELSE
  9664. commentPrintout := NIL;
  9665. dump := NIL;
  9666. END;
  9667. prevScope := currentScope;
  9668. currentScope := scope;
  9669. lastSwitchPC := 0;
  9670. cooperativeSwitches := backend.cooperative;
  9671. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9672. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9673. IF x # NIL THEN
  9674. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9675. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9676. IF moduleBody THEN
  9677. ProfilerInit();
  9678. ELSE
  9679. Basic.SegmentedNameToString(ir.name, string);
  9680. ProfilerAddProcedure(numberProcedures,string);
  9681. ProfilerEnterExit(numberProcedures,TRUE);
  9682. END;
  9683. END;
  9684. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9685. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9686. END;
  9687. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9688. IF moduleBody THEN
  9689. InitVariables(moduleScope)
  9690. END;
  9691. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9692. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9693. IF procedure = cellScope.bodyProcedure THEN
  9694. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9695. StaticCallOperand(op, cellScope.constructor);
  9696. Emit(Call(position,op.op,0));
  9697. END;
  9698. END;
  9699. END;
  9700. ParameterCopies(procedureType);
  9701. InitVariables(scope);
  9702. IF x.code = NIL THEN
  9703. VisitStatementBlock(x);
  9704. ELSE
  9705. VisitCode(x.code)
  9706. END;
  9707. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9708. ir.SetFinally(ir.pc);
  9709. StatementSequence(x.finally)
  9710. END;
  9711. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9712. IF ~backend.cooperative THEN
  9713. ProfilerEnterExit(numberProcedures,FALSE);
  9714. END;
  9715. INC(numberProcedures);
  9716. END;
  9717. END;
  9718. IF backend.cooperative THEN
  9719. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9720. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9721. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9722. (*! not required any more? check and delete!
  9723. PushSelfPointer();
  9724. CallThis(position,"Modules","SetInitialized",1);
  9725. *)
  9726. (*
  9727. SetLabel(end);
  9728. *)
  9729. END;
  9730. IF x # NIL THEN
  9731. SELF.position := x.position;
  9732. END;
  9733. CheckRegistersFree();
  9734. ASSERT(modifyAssignmentCounter = 0);
  9735. currentScope := prevScope;
  9736. IF Trace THEN TraceExit("Body") END;
  9737. END Body;
  9738. END ImplementationVisitor;
  9739. MetaDataGenerator=OBJECT
  9740. VAR
  9741. implementationVisitor: ImplementationVisitor;
  9742. declarationVisitor: DeclarationVisitor;
  9743. module: Sections.Module;
  9744. moduleName: ARRAY 128 OF CHAR;
  9745. moduleNamePool: Basic.HashTableInt;
  9746. moduleNamePoolSection: IntermediateCode.Section;
  9747. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9748. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9749. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9750. TypeTags: LONGINT; (* type extension level support *)
  9751. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9752. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9753. BEGIN
  9754. IF implementationVisitor.backend.cooperative THEN
  9755. TypeTags := MAX(LONGINT);
  9756. BaseTypesTableOffset := 0;
  9757. MethodTableOffset := 2;
  9758. TypeRecordBaseOffset := 0;
  9759. ELSIF simple THEN
  9760. TypeTags := 3; (* only 3 extensions allowed *)
  9761. BaseTypesTableOffset := 1;
  9762. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9763. TypeRecordBaseOffset := 0;
  9764. ELSE
  9765. TypeTags := 16;
  9766. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9767. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9768. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9769. END;
  9770. SELF.simple := simple;
  9771. SELF.implementationVisitor := implementationVisitor;
  9772. SELF.declarationVisitor := declarationVisitor;
  9773. implementationVisitor.meta := SELF;
  9774. declarationVisitor.meta := SELF;
  9775. END InitMetaDataGenerator;
  9776. PROCEDURE SetModule(module: Sections.Module);
  9777. VAR namePoolOffset: LONGINT;
  9778. BEGIN
  9779. SELF.module := module;
  9780. Global.GetModuleName(module.module,moduleName);
  9781. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9782. NEW(moduleNamePool, 32);
  9783. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9784. END;
  9785. END SetModule;
  9786. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9787. BEGIN
  9788. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9789. END GetTypeRecordBaseOffset;
  9790. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9791. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9792. BEGIN
  9793. INC(dataAdrOffset,6);
  9794. Info(section,"headerAdr");
  9795. Address(section,0);
  9796. Info(section,"typeDesc");
  9797. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9798. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9799. NamedSymbol(section, name, symbol, 0, offset);
  9800. Info(section,"mark: LONGINT;");
  9801. Longint(section,-1);
  9802. Info(section,"dataAdr-: ADDRESS");
  9803. Symbol(section,section, dataAdrOffset,0);
  9804. Info(section,"size-: SIZE");
  9805. Address(section,0);
  9806. Info(section,"nextRealtime: HeapBlock;");
  9807. Address(section,0);
  9808. END HeapBlock;
  9809. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9810. VAR i: LONGINT;
  9811. BEGIN
  9812. INC(dataAdrOffset,14);
  9813. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9814. Info(section,"count*: LONGINT");
  9815. Longint(section,0);
  9816. Info(section,"locked*: BOOLEAN");
  9817. Longint(section,0);
  9818. Info(section,"awaitingLock*: ProcessQueue");
  9819. Address(section,0);
  9820. Address(section,0);
  9821. Info(section,"awaitingCond*: ProcessQueue");
  9822. Address(section,0);
  9823. Address(section,0);
  9824. Info(section,"lockedBy*: ANY");
  9825. Address(section,0);
  9826. Info(section,"lock*: ANY");
  9827. Address(section,0);
  9828. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9829. Longint(section,1);
  9830. FOR i := 2 TO 6 DO
  9831. Longint(section,0);
  9832. END;
  9833. END ProtectedHeapBlock;
  9834. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9835. BEGIN
  9836. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9837. END Info;
  9838. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9839. VAR op: IntermediateCode.Operand;
  9840. BEGIN
  9841. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9842. section.Emit(Data(-11,op));
  9843. END Address;
  9844. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9845. VAR op: IntermediateCode.Operand;
  9846. BEGIN
  9847. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9848. section.Emit(Data(-12,op));
  9849. END Size;
  9850. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9851. VAR op: IntermediateCode.Operand;
  9852. BEGIN
  9853. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9854. section.Emit(Data(-1,op));
  9855. END Set;
  9856. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9857. VAR op: IntermediateCode.Operand;
  9858. BEGIN
  9859. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9860. section.Emit(Data(-1,op));
  9861. END Longint;
  9862. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9863. VAR op,noOperand: IntermediateCode.Operand;
  9864. BEGIN
  9865. IntermediateCode.InitOperand(noOperand);
  9866. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9867. section.PatchOperands(pc,op,noOperand,noOperand);
  9868. END PatchLongint;
  9869. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9870. VAR op, noOperand: IntermediateCode.Operand;
  9871. BEGIN
  9872. IntermediateCode.InitOperand(noOperand);
  9873. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9874. section.PatchOperands(pc,op,noOperand,noOperand);
  9875. END PatchSymbol;
  9876. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9877. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9878. BEGIN
  9879. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9880. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9881. section.Emit(Data(-1,op));
  9882. END Boolean;
  9883. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9884. VAR op: IntermediateCode.Operand;
  9885. BEGIN
  9886. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9887. section.Emit(Data(-1,op));
  9888. END Char;
  9889. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9890. VAR i: LONGINT;
  9891. BEGIN
  9892. Info(section,str);
  9893. i := 0;
  9894. WHILE(str[i] # 0X) DO
  9895. Char(section,str[i]);
  9896. INC(i);
  9897. END;
  9898. Char(section,0X);
  9899. END String;
  9900. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9901. VAR op: IntermediateCode.Operand;
  9902. BEGIN
  9903. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9904. IntermediateCode.SetOffset(op,realOffset);
  9905. section.Emit(Data(-1,op));
  9906. END NamedSymbol;
  9907. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9908. BEGIN
  9909. IF symbol= NIL THEN
  9910. Address( section, realOffset);
  9911. ASSERT(virtualOffset = 0);
  9912. ELSE
  9913. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9914. END;
  9915. END Symbol;
  9916. (* OutPointers delivers
  9917. {pointerOffset}
  9918. *)
  9919. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9920. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9921. BEGIN
  9922. type := type.resolved;
  9923. IF type IS SyntaxTree.AnyType THEN
  9924. Symbol(section, symbol, 0, (offset ));
  9925. INC(numberPointers);
  9926. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9927. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9928. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9929. ELSIF type IS SyntaxTree.PointerType THEN
  9930. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9931. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9932. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9933. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9934. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9935. ELSIF (type IS SyntaxTree.RecordType) THEN
  9936. (* never treat a record like a pointer, even if the pointer field is set! *)
  9937. WITH type: SyntaxTree.RecordType DO
  9938. base := type.GetBaseRecord();
  9939. IF base # NIL THEN
  9940. Pointers(offset,symbol,section, base,numberPointers);
  9941. END;
  9942. variable := type.recordScope.firstVariable;
  9943. WHILE(variable # NIL) DO
  9944. IF ~(variable.untraced) THEN
  9945. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9946. END;
  9947. variable := variable.nextVariable;
  9948. END;
  9949. END;
  9950. ELSIF (type IS SyntaxTree.CellType) THEN
  9951. WITH type: SyntaxTree.CellType DO
  9952. base := type.GetBaseRecord();
  9953. IF base # NIL THEN
  9954. Pointers(offset,symbol,section, base,numberPointers);
  9955. END;
  9956. variable := type.cellScope.firstVariable;
  9957. WHILE(variable # NIL) DO
  9958. IF ~(variable.untraced) THEN
  9959. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9960. END;
  9961. variable := variable.nextVariable;
  9962. END;
  9963. END;
  9964. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9965. WITH type: SyntaxTree.ArrayType DO
  9966. IF type.form= SyntaxTree.Static THEN
  9967. n := type.staticLength;
  9968. base := type.arrayBase.resolved;
  9969. WHILE(base IS SyntaxTree.ArrayType) DO
  9970. type := base(SyntaxTree.ArrayType);
  9971. n := n* type.staticLength;
  9972. base := type.arrayBase.resolved;
  9973. END;
  9974. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9975. IF SemanticChecker.ContainsPointer(base) THEN
  9976. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9977. FOR i := 0 TO n-1 DO
  9978. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9979. END;
  9980. END;
  9981. ELSE
  9982. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9983. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9984. END;
  9985. END;
  9986. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9987. WITH type: SyntaxTree.MathArrayType DO
  9988. IF type.form = SyntaxTree.Static THEN
  9989. n := type.staticLength;
  9990. base := type.arrayBase.resolved;
  9991. WHILE(base IS SyntaxTree.MathArrayType) DO
  9992. type := base(SyntaxTree.MathArrayType);
  9993. n := n* type.staticLength;
  9994. base := type.arrayBase.resolved;
  9995. END;
  9996. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9997. IF SemanticChecker.ContainsPointer(base) THEN
  9998. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9999. FOR i := 0 TO n-1 DO
  10000. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10001. END;
  10002. END;
  10003. ELSE
  10004. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10005. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10006. END
  10007. END;
  10008. (* ELSE no pointers in type *)
  10009. END;
  10010. END Pointers;
  10011. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10012. VAR position,i: LONGINT; ch: CHAR;
  10013. BEGIN
  10014. IF pool.Has(index) THEN
  10015. RETURN pool.GetInt(index)
  10016. ELSE
  10017. position := source.pc;
  10018. pool.PutInt(index, position);
  10019. Info(source, name);
  10020. i := 0;
  10021. REPEAT
  10022. ch := name[i]; INC(i);
  10023. Char( source, ch);
  10024. UNTIL ch = 0X;
  10025. END;
  10026. RETURN position;
  10027. END EnterDynamicName;
  10028. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10029. VAR name: Basic.SectionName; position: LONGINT;
  10030. BEGIN
  10031. IF pool.Has(index) THEN
  10032. RETURN pool.GetInt(index)
  10033. ELSE
  10034. StringPool.GetString(index, name);
  10035. position := EnterDynamicName(source,name,index, pool);
  10036. END;
  10037. RETURN position;
  10038. END DynamicName;
  10039. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10040. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10041. BEGIN
  10042. COPY(moduleName,name);
  10043. Strings.Append(name,suffix);
  10044. Basic.ToSegmentedName(name, pooledName);
  10045. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10046. IF implementationVisitor.backend.cooperative THEN
  10047. Info(section, "TypeDescriptor");
  10048. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10049. NamedSymbol(section, pooledName,NIL, 0, 0);
  10050. BasePointer(section);
  10051. offset := 0;
  10052. ELSE
  10053. HeapBlock(mName,typeName,section,2);
  10054. Info(section, "HeapBlock");
  10055. (*
  10056. Symbol(section,section,2,0);
  10057. *)
  10058. Address(section,0); (* empty such that GC does not go on traversing *)
  10059. Info(section, "TypeDescriptor");
  10060. Address(section,0);
  10061. offset := section.pc;
  10062. END;
  10063. RETURN section
  10064. END Block;
  10065. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10066. VAR name: Basic.SegmentedName;
  10067. BEGIN
  10068. Info(source,"ArrayHeader");
  10069. IF implementationVisitor.backend.cooperative THEN
  10070. sizePC := source.pc;
  10071. Address(source,0);
  10072. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10073. IF baseType # "" THEN
  10074. Basic.ToSegmentedName(baseType, name);
  10075. NamedSymbol(source, name,NIL, 0, 0);
  10076. ELSE
  10077. Address(source,0);
  10078. END;
  10079. Address(source,0);
  10080. ELSE
  10081. Address(source,0);
  10082. Address(source,0);
  10083. Address(source,0);
  10084. sizePC := source.pc;
  10085. Address(source,0);
  10086. Info(source,"array data");
  10087. END;
  10088. END Array;
  10089. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10090. BEGIN
  10091. IF implementationVisitor.backend.cooperative THEN
  10092. PatchLongint(section, pc, size);
  10093. PatchLongint(section, pc + 3, size);
  10094. ELSE
  10095. PatchLongint(section, pc, size);
  10096. END;
  10097. END PatchArray;
  10098. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10099. VAR
  10100. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10101. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10102. poolMap: Basic.HashTableInt;
  10103. namePool: IntermediateCode.Section;
  10104. namePoolOffset: LONGINT;
  10105. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10106. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10107. BEGIN
  10108. Basic.SegmentedNameToString(s1.name,n1);
  10109. Basic.SegmentedNameToString(s2.name,n2);
  10110. index := 0;
  10111. ch1 := n1[index];
  10112. ch2 := n2[index];
  10113. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10114. INC(index);
  10115. ch1 := n1[index];
  10116. ch2 := n2[index];
  10117. END;
  10118. RETURN ch1 < ch2;
  10119. END Compare;
  10120. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10121. VAR
  10122. i, j: LONGINT;
  10123. x, t: Sections.Section;
  10124. BEGIN
  10125. IF lo < hi THEN
  10126. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10127. WHILE i <= j DO
  10128. WHILE Compare(list[i], x) DO INC(i) END;
  10129. WHILE Compare(x, list[j]) DO DEC(j) END;
  10130. IF i <= j THEN
  10131. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10132. INC(i); DEC(j)
  10133. END
  10134. END;
  10135. IF lo < j THEN QuickSort(list, lo, j) END;
  10136. IF i < hi THEN QuickSort(list, i, hi) END
  10137. END;
  10138. END QuickSort;
  10139. (*
  10140. ExportDesc* = RECORD
  10141. fp*: ADDRESS;
  10142. name* {UNTRACED}: DynamicName;
  10143. adr*: ADDRESS;
  10144. exports*: LONGINT;
  10145. dsc* {UNTRACED}: ExportArray
  10146. END;
  10147. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10148. *)
  10149. PROCEDURE ExportDesc2(
  10150. source: IntermediateCode.Section;
  10151. namePool: IntermediateCode.Section;
  10152. fingerPrinter: FingerPrinter.FingerPrinter;
  10153. symbol: Sections.Section;
  10154. name: StringPool.Index;
  10155. VAR patchAdr: LONGINT
  10156. ): BOOLEAN;
  10157. VAR fingerPrint: SyntaxTree.FingerPrint;
  10158. BEGIN
  10159. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10160. & (symbol.type # Sections.InlineCodeSection)
  10161. THEN
  10162. *)
  10163. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10164. & (symbol.type # Sections.InlineCodeSection))
  10165. THEN
  10166. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10167. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10168. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10169. Longint(source,fingerPrint.shallow);
  10170. ELSE
  10171. Longint(source, 0);
  10172. END;
  10173. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10174. Symbol(source, symbol,0,0);
  10175. patchAdr := source.pc;
  10176. Address(source,0);
  10177. Address(source,0);
  10178. END;
  10179. RETURN TRUE
  10180. ELSE
  10181. RETURN FALSE
  10182. END;
  10183. END ExportDesc2;
  10184. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10185. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10186. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10187. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10188. TYPE
  10189. Scope = RECORD
  10190. elements: LONGINT;
  10191. gelements: LONGINT;
  10192. section: IntermediateCode.Section;
  10193. patchAdr: LONGINT;
  10194. arraySizePC: LONGINT;
  10195. beginPC: LONGINT; (* current scope start pc *)
  10196. END;
  10197. BEGIN
  10198. Basic.InitSegmentedName(prev);
  10199. olevel := -1;
  10200. scopes[0].section := source;
  10201. FOR s := 0 TO LEN(sections)-1 DO
  10202. symbol := sections[s];
  10203. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10204. this := sections[s].name;
  10205. level := 0;
  10206. WHILE (this[level] > 0) DO
  10207. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10208. INC(level);
  10209. END;
  10210. WHILE level < olevel DO
  10211. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10212. IF olevel > 0 THEN
  10213. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10214. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10215. END;
  10216. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10217. DEC(olevel);
  10218. END;
  10219. IF (this[level] > 0) THEN
  10220. IF level > olevel THEN
  10221. (*TRACE("opening",level); *)
  10222. IF scopes[level].section = NIL THEN
  10223. arrayName := ".@ExportArray";
  10224. Strings.AppendInt(arrayName, level);
  10225. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10226. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10227. END;
  10228. scopes[level].beginPC := scopes[level].section.pc;
  10229. olevel := level;
  10230. scopes[olevel].elements := 0;
  10231. END;
  10232. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10233. sym := sections[s];
  10234. ELSE
  10235. sym := NIL;
  10236. END;
  10237. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10238. THEN
  10239. INC(scopes[olevel].elements);
  10240. END;
  10241. (*StringPool.GetString(this[level], name);*)
  10242. (*TRACE(level, name);*)
  10243. (* enter string in scope *)
  10244. INC(level);
  10245. END;
  10246. END;
  10247. Basic.SegmentedNameToString(this, name);
  10248. (*TRACE(level, "enter", name);*)
  10249. prev := this;
  10250. END;
  10251. END;
  10252. WHILE 0 <= olevel DO
  10253. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10254. IF olevel > 0 THEN
  10255. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10256. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10257. END;
  10258. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10259. DEC(olevel);
  10260. END;
  10261. level := 0;
  10262. WHILE (level < LEN(scopes)) DO
  10263. IF scopes[level].section # NIL THEN
  10264. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10265. END;
  10266. INC(level);
  10267. END;
  10268. END Export;
  10269. BEGIN
  10270. NEW(fingerPrinter, module.system);
  10271. NEW(poolMap, 64);
  10272. (* this is the name pool private to the export table -- it is sorted and should not be mixed / used for other names in a module *)
  10273. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10274. NEW(sectionArray, module.allSections.Length());
  10275. FOR i := 0 TO module.allSections.Length() - 1 DO
  10276. section := module.allSections.GetSection(i);
  10277. sectionArray[i] := section;
  10278. END;
  10279. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10280. Export(sectionArray^);
  10281. END ExportDesc;
  10282. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10283. VAR
  10284. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10285. BEGIN
  10286. Info(source, "exception table offsets array descriptor");
  10287. size := 0;
  10288. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10289. Info(source, "exception table content");
  10290. FOR i := 0 TO module.allSections.Length() - 1 DO
  10291. p := module.allSections.GetSection(i);
  10292. IF p.type = Sections.CodeSection THEN
  10293. finallyPC := p(IntermediateCode.Section).finally;
  10294. IF finallyPC>=0 THEN
  10295. Symbol( source, p, 0,0);
  10296. Symbol( source, p, finallyPC, 0);
  10297. Symbol( source, p, finallyPC,0);
  10298. INC(size);
  10299. END;
  10300. END
  10301. END;
  10302. PatchArray(source,sizePC,size);
  10303. END ExceptionArray;
  10304. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10305. VAR i: LONGINT; ch: CHAR;
  10306. BEGIN
  10307. i := 0;
  10308. REPEAT
  10309. ch := name[i]; INC(i);
  10310. Char( section, ch);
  10311. UNTIL ch = 0X;
  10312. WHILE i < 32 DO
  10313. Char( section, 0X); INC(i);
  10314. END;
  10315. END Name;
  10316. PROCEDURE References(section: IntermediateCode.Section);
  10317. CONST
  10318. rfDirect = 1X; rfIndirect = 3X;
  10319. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10320. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10321. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10322. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10323. rfRecordPointer=1DX;
  10324. rfArrayFlag = 80X;
  10325. VAR
  10326. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10327. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10328. VAR char: CHAR;
  10329. BEGIN
  10330. IF type = NIL THEN char := rfLongint
  10331. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10332. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10333. ELSIF type IS SyntaxTree.CharacterType THEN
  10334. IF type.sizeInBits = 8 THEN char := rfChar8
  10335. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10336. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10337. END;
  10338. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10339. IF type.sizeInBits = 8 THEN char := rfShortint
  10340. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10341. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10342. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10343. END;
  10344. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10345. ELSIF type IS SyntaxTree.FloatType THEN
  10346. IF type.sizeInBits = 32 THEN char := rfReal
  10347. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10348. END;
  10349. ELSIF type IS SyntaxTree.ComplexType THEN
  10350. IF type.sizeInBits = 64 THEN char := rfComplex
  10351. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10352. END;
  10353. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10354. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10355. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10356. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10357. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10358. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10359. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10360. END;
  10361. RETURN char
  10362. END BaseType;
  10363. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10364. VAR destination: Sections.Section;
  10365. BEGIN
  10366. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10367. IF type.pointerType # NIL THEN
  10368. Char(section,rfRecordPointer)
  10369. ELSE
  10370. Char(section,rfRecord);
  10371. END;
  10372. IF destination = NIL THEN
  10373. Longint(section,0);
  10374. ELSE
  10375. Longint(section,destination.offset); (* used for ? *)
  10376. END;
  10377. END RecordType;
  10378. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10379. BEGIN
  10380. baseType := type.arrayBase.resolved;
  10381. IF type.form = SyntaxTree.Static THEN
  10382. IF baseType IS SyntaxTree.ArrayType THEN
  10383. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10384. ELSE
  10385. RETURN type.staticLength
  10386. END
  10387. ELSE
  10388. RETURN 0
  10389. END;
  10390. END StaticArrayLength;
  10391. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10392. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10393. BEGIN
  10394. length := StaticArrayLength(type, baseType);
  10395. char := BaseType(baseType);
  10396. IF type.form # SyntaxTree.Open THEN
  10397. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10398. Longint(section, length)
  10399. ELSE
  10400. length :=0;
  10401. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10402. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10403. Longint(section, length)
  10404. END;
  10405. END ArrayType;
  10406. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10407. BEGIN
  10408. baseType := type.arrayBase;
  10409. IF baseType # NIL THEN
  10410. baseType := baseType.resolved;
  10411. END;
  10412. IF type.form = SyntaxTree.Static THEN
  10413. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10414. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10415. ELSE
  10416. RETURN type.staticLength
  10417. END
  10418. ELSE
  10419. RETURN 0
  10420. END;
  10421. END StaticMathArrayLength;
  10422. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10423. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10424. BEGIN
  10425. length := StaticMathArrayLength(type, baseType);
  10426. char := BaseType(baseType);
  10427. IF type.form = SyntaxTree.Open THEN
  10428. char := BaseType(module.system.addressType);
  10429. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10430. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10431. Longint(section, length)
  10432. ELSIF type.form=SyntaxTree.Tensor THEN
  10433. char := BaseType(module.system.addressType);
  10434. Char(section, CHR(ORD(char)));
  10435. ELSE
  10436. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10437. Longint(section, length)
  10438. END;
  10439. END MathArrayType;
  10440. PROCEDURE Type(type: SyntaxTree.Type);
  10441. BEGIN
  10442. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10443. IF type IS SyntaxTree.BasicType THEN
  10444. Char(section, BaseType(type));
  10445. ELSIF type IS SyntaxTree.RecordType THEN
  10446. RecordType(type(SyntaxTree.RecordType));
  10447. ELSIF type IS SyntaxTree.ArrayType THEN
  10448. ArrayType(type(SyntaxTree.ArrayType))
  10449. ELSIF type IS SyntaxTree.EnumerationType THEN
  10450. Char(section, BaseType(module.system.longintType))
  10451. ELSIF type IS SyntaxTree.PointerType THEN
  10452. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10453. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10454. ELSE
  10455. Char(section, BaseType(type))
  10456. END;
  10457. ELSIF type IS SyntaxTree.ProcedureType THEN
  10458. Char(section, BaseType(type));
  10459. ELSIF type IS SyntaxTree.MathArrayType THEN
  10460. MathArrayType(type(SyntaxTree.MathArrayType));
  10461. ELSIF type IS SyntaxTree.CellType THEN
  10462. Char(section, BaseType(module.system.anyType));
  10463. ELSE HALT(200)
  10464. END;
  10465. END Type;
  10466. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10467. VAR name: ARRAY 256 OF CHAR;
  10468. BEGIN
  10469. IF variable.externalName # NIL THEN RETURN END;
  10470. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10471. variable.GetName(name);
  10472. Type(variable.type);
  10473. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10474. String(section,name);
  10475. END WriteVariable;
  10476. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10477. VAR name: ARRAY 256 OF CHAR;
  10478. BEGIN
  10479. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10480. variable.GetName(name);
  10481. Type(variable.type);
  10482. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10483. variable.GetName(name);
  10484. String(section,name);
  10485. END WriteParameter;
  10486. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10487. BEGIN
  10488. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10489. IF type IS SyntaxTree.ArrayType THEN
  10490. WITH type: SyntaxTree.ArrayType DO
  10491. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10492. ELSE Char(section,rfOpenArray)
  10493. END;
  10494. END
  10495. ELSIF type IS SyntaxTree.MathArrayType THEN
  10496. WITH type: SyntaxTree.MathArrayType DO
  10497. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10498. ELSE Char(section,rfOpenArray)
  10499. END;
  10500. END
  10501. ELSIF type IS SyntaxTree.RecordType THEN
  10502. Char(section,rfRecord);
  10503. ELSE
  10504. Char(section, BaseType(type));
  10505. END;
  10506. END ReturnType;
  10507. PROCEDURE Procedure(s: Sections.Section);
  10508. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10509. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10510. name: ARRAY 256 OF CHAR;
  10511. BEGIN
  10512. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10513. (*procedure.name,name);*)
  10514. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10515. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10516. Char(section,0F9X);
  10517. Symbol(section,s,0,0);
  10518. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10519. Longint(section,procedureType.numberParameters);
  10520. ReturnType(procedureType.returnType);
  10521. Longint(section,0); (*! level *)
  10522. Longint(section,0);
  10523. (*
  10524. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10525. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10526. recordName := "";
  10527. IF record.pointerType # NIL THEN
  10528. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10529. ELSE
  10530. DeclarationName(record.typeDeclaration,recordName);
  10531. END;
  10532. i := 0;
  10533. Info(section,recordName);
  10534. WHILE recordName[i] # 0X DO
  10535. Char(section,recordName[i]); INC(i);
  10536. INC(size);
  10537. END;
  10538. Char(section,".");
  10539. INC(size);
  10540. END;
  10541. *)
  10542. String(section,name);
  10543. parameter := procedureType.firstParameter;
  10544. WHILE(parameter # NIL) DO
  10545. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10546. parameter := parameter.nextParameter;
  10547. END;
  10548. variable := procedure.procedureScope.firstVariable;
  10549. WHILE(variable # NIL) DO
  10550. WriteVariable(variable,FALSE);
  10551. variable := variable.nextVariable;
  10552. END;
  10553. END Procedure;
  10554. PROCEDURE Scope(s: Sections.Section);
  10555. BEGIN
  10556. Char(section,0F8X);
  10557. Symbol(section,s,0,0); (* start *)
  10558. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10559. String(section,"$$");
  10560. (* removed variables -- wrongly interpreted by Reflection
  10561. variable := module.module.moduleScope.firstVariable;
  10562. WHILE(variable # NIL) DO
  10563. WriteVariable(variable,FALSE);
  10564. variable := variable.nextVariable;
  10565. END;
  10566. *)
  10567. END Scope;
  10568. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10569. VAR result, i: LONGINT;
  10570. BEGIN
  10571. FOR i := startPC TO endPC -1 DO
  10572. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10573. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10574. END;
  10575. RETURN result;
  10576. END ComputeSize;
  10577. BEGIN
  10578. Array(section,sizePC,"");
  10579. startPC := section.pc;
  10580. Char(section,0FFX); (* sign for trap writer *)
  10581. FOR i := 0 TO module.allSections.Length() - 1 DO
  10582. s := module.allSections.GetSection(i);
  10583. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10584. Scope(s) (*! must be first procedure in ref section *)
  10585. END
  10586. END;
  10587. FOR i := 0 TO module.allSections.Length() - 1 DO
  10588. s := module.allSections.GetSection(i);
  10589. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10590. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10591. Procedure(s)
  10592. END
  10593. END;
  10594. endPC := section.pc;
  10595. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10596. END References;
  10597. (*
  10598. Command* = RECORD
  10599. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10600. name*: Name; (* name of the procedure *)
  10601. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10602. entryAdr* : ADDRESS; (* entry address of procedure *)
  10603. END;
  10604. *)
  10605. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10606. VAR
  10607. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10608. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10609. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10610. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10611. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10612. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10613. BEGIN
  10614. RETURN
  10615. (type = NIL) OR
  10616. (type.resolved IS SyntaxTree.RecordType) OR
  10617. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10618. (type.resolved IS SyntaxTree.AnyType);
  10619. END TypeAllowed;
  10620. BEGIN
  10621. numberParameters := procedureType.numberParameters;
  10622. RETURN
  10623. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10624. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10625. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10626. END GetProcedureAllowed;
  10627. PROCEDURE WriteType(type : SyntaxTree.Type);
  10628. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10629. name: Basic.SegmentedName; offset: LONGINT;
  10630. BEGIN
  10631. IF type = NIL THEN
  10632. Address(source,0);
  10633. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10634. Address(source,1);
  10635. ELSE
  10636. type := type.resolved;
  10637. IF type IS SyntaxTree.PointerType THEN
  10638. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10639. END;
  10640. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10641. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10642. name[0] := typeDeclaration.name; name[1] := -1;
  10643. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10644. ASSERT(section # NIL);
  10645. ELSE
  10646. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10647. (* TODO *)
  10648. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10649. END;
  10650. IF implementationVisitor.backend.cooperative THEN
  10651. offset := 0;
  10652. ELSE
  10653. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10654. END;
  10655. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10656. END;
  10657. END WriteType;
  10658. BEGIN
  10659. Info(source, "command array descriptor");
  10660. Array(source,sizePC,"Modules.Command");
  10661. numberCommands := 0;
  10662. Info(source, "command array content");
  10663. FOR i := 0 TO module.allSections.Length() - 1 DO
  10664. p := module.allSections.GetSection(i);
  10665. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10666. procedure := p.symbol(SyntaxTree.Procedure);
  10667. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10668. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10669. procedure.GetName(name);
  10670. Name(source,name);
  10671. numberParameters := procedureType.numberParameters;
  10672. (* offset of type of first parameter *)
  10673. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10674. ELSE WriteType(procedureType.firstParameter.type)
  10675. END;
  10676. (* offset of type of return parameter *)
  10677. WriteType(procedureType.returnType);
  10678. (* command name *)
  10679. (* command code offset *)
  10680. Symbol(source,p,0,0);
  10681. INC(numberCommands);
  10682. IF Trace THEN
  10683. D.Ln;
  10684. END;
  10685. END;
  10686. END
  10687. END;
  10688. PatchArray(source,sizePC,numberCommands);
  10689. END CommandArray;
  10690. (* to prevent from double import of different module aliases *)
  10691. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10692. VAR i: SyntaxTree.Import;
  10693. BEGIN
  10694. i := module.module.moduleScope.firstImport;
  10695. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10696. i := i.nextImport;
  10697. END;
  10698. RETURN i = import
  10699. END IsFirstDirectOccurence;
  10700. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10701. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10702. BEGIN
  10703. Array(source,pc,"");
  10704. Info(source, "import module array data");
  10705. IF implementationVisitor.backend.cooperative THEN
  10706. offset := 0;
  10707. ELSE
  10708. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10709. END;
  10710. import := module.module.moduleScope.firstImport;
  10711. numberImports := 0;
  10712. WHILE import # NIL DO
  10713. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10714. Global.GetModuleSegmentedName(import.module,name);
  10715. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10716. NamedSymbol(source, name, NIL, 0, offset);
  10717. INC(numberImports);
  10718. END;
  10719. import := import.nextImport
  10720. END;
  10721. PatchArray(source,pc,numberImports);
  10722. END ImportsArray;
  10723. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10724. VAR
  10725. p: Sections.Section; sizePC, size, i: LONGINT;
  10726. BEGIN
  10727. Info(source, "Type info section");
  10728. size := 0;
  10729. Array(source,sizePC,"Modules.TypeDesc");
  10730. FOR i := 0 TO module.allSections.Length() - 1 DO
  10731. p := module.allSections.GetSection(i);
  10732. WITH p: IntermediateCode.Section DO
  10733. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10734. Symbol(source,p,0,0);
  10735. INC(size);
  10736. END;
  10737. END
  10738. END;
  10739. PatchArray(source,sizePC,size);
  10740. END TypeInfoSection;
  10741. (*
  10742. ProcTableEntry* = RECORD
  10743. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10744. noPtr*: LONGINT;
  10745. END;
  10746. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10747. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10748. *)
  10749. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10750. VAR
  10751. destination: Sections.Section;
  10752. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10753. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10754. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10755. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10756. BEGIN
  10757. Info(procArray,"pcFrom");
  10758. Symbol(procArray,destination,0,0);
  10759. Info(procArray,"pcTo");
  10760. Symbol(procArray,destination,destination.pc,0);
  10761. Info(procArray,"pcStatementBegin");
  10762. Symbol(procArray,destination,destination.validPAFEnter,0);
  10763. Info(procArray,"pcStatementEnd");
  10764. Symbol(procArray,destination,destination.validPAFExit,0);
  10765. IF ~implementationVisitor.backend.cooperative THEN
  10766. Basic.SegmentedNameToString(destination.name, string);
  10767. Info(pointerArray,string);
  10768. procedure := destination.symbol(SyntaxTree.Procedure);
  10769. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10770. variable := procedure.procedureScope.firstVariable;
  10771. WHILE(variable # NIL) DO
  10772. IF ~(variable.untraced) THEN
  10773. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10774. END;
  10775. variable := variable.nextVariable
  10776. END;
  10777. parameter := procedureType.firstParameter;
  10778. WHILE(parameter # NIL) DO
  10779. IF ~(parameter.untraced) THEN
  10780. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10781. END;
  10782. parameter := parameter.nextParameter;
  10783. END;
  10784. END;
  10785. Info(procArray,"numberPointers");
  10786. Longint(procArray,numberPointers);
  10787. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10788. INC(pointerArraySize, numberPointers);
  10789. END PointerOffsets;
  10790. BEGIN
  10791. maxPointers := 0;
  10792. Info(procArray, "proc array descriptor");
  10793. Address(procArray,0);
  10794. Address(procArray,0);
  10795. Address(procArray,0);
  10796. procArraySizePC := procArray.pc;
  10797. Address(procArray,0);
  10798. procArraySize := 0;
  10799. IF ~implementationVisitor.backend.cooperative THEN
  10800. Info(pointerArray, "pointer array descriptor");
  10801. Address(pointerArray,0);
  10802. Address(pointerArray,0);
  10803. Address(pointerArray,0);
  10804. pointerArraySizePC := pointerArray.pc;
  10805. Address(pointerArray,0);
  10806. pointerArraySize := 0;
  10807. END;
  10808. procArraySize := 0;
  10809. FOR i := 0 TO module.allSections.Length() - 1 DO
  10810. destination := module.allSections.GetSection(i);
  10811. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10812. PointerOffsets(destination(IntermediateCode.Section));
  10813. INC(procArraySize);
  10814. END
  10815. END;
  10816. PatchLongint(procArray,procArraySizePC,procArraySize);
  10817. IF ~implementationVisitor.backend.cooperative THEN
  10818. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10819. END;
  10820. END PointersInProcTables;
  10821. (*
  10822. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10823. VAR
  10824. next*: Module; (** once a module is published, all fields are read-only *)
  10825. name*: Name;
  10826. init, published: BOOLEAN;
  10827. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10828. sb*: ADDRESS; <- set to beginning of data section by loader
  10829. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10830. command*: POINTER TO ARRAY OF Command;
  10831. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10832. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10833. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10834. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10835. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10836. data*, code*: Bytes;
  10837. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10838. export*: ExportDesc;
  10839. term*: TerminationHandler;
  10840. exTable*: ExceptionTable;
  10841. noProcs*: LONGINT;
  10842. firstProc*: ADDRESS; <- done by loader
  10843. maxPtrs*: LONGINT;
  10844. crc*: LONGINT;
  10845. *)
  10846. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10847. BEGIN
  10848. Info(section, "cycle");
  10849. Size(section,0);
  10850. Info(section, "references");
  10851. Size(section,0);
  10852. Info(section, "nextMarked");
  10853. Address(section,0);
  10854. Info(section, "nextWatched");
  10855. Address(section,0);
  10856. END BasePointer;
  10857. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10858. BEGIN
  10859. BasePointer(section);
  10860. Info(section, "action");
  10861. Address(section,0);
  10862. Info(section, "monitor");
  10863. Address(section,0);
  10864. END BaseObject;
  10865. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10866. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10867. pooledName: Basic.SegmentedName;
  10868. symbol: SyntaxTree.Symbol;
  10869. BEGIN
  10870. Global.GetModuleName(module.module,name);
  10871. Strings.Append(name,".@Module.@Descriptor");
  10872. Basic.ToSegmentedName(name, pooledName);
  10873. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10874. Symbol(section,descriptorSection,0,0);
  10875. Info(descriptorSection, "descriptor");
  10876. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10877. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10878. Address(descriptorSection,0);
  10879. Global.GetModuleName(module.module,name);
  10880. Strings.Append(name,".@Trace");
  10881. Basic.ToSegmentedName(name, pooledName);
  10882. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10883. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10884. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10885. END ModuleDescriptor;
  10886. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10887. VAR name: ARRAY 128 OF CHAR;
  10888. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10889. symbol: SyntaxTree.Symbol;
  10890. BEGIN
  10891. Global.GetModuleName(module.module,name);
  10892. Strings.Append(name,".@Module");
  10893. Basic.ToSegmentedName(name, pooledName);
  10894. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10895. moduleSection.SetExported(TRUE);
  10896. IF moduleSection.pc = 0 THEN
  10897. IF implementationVisitor.backend.cooperative THEN
  10898. Info(moduleSection, "descriptor");
  10899. ModuleDescriptor(moduleSection);
  10900. BaseObject(moduleSection);
  10901. implementationVisitor.CreateTraceModuleMethod(module.module);
  10902. ELSE
  10903. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10904. Info(moduleSection, "HeapBlock");
  10905. Symbol(moduleSection,moduleSection,2,0);
  10906. Info(moduleSection, "TypeDescriptor");
  10907. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10908. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10909. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10910. END;
  10911. END;
  10912. RETURN moduleSection;
  10913. END ModuleSection;
  10914. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10915. VAR
  10916. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10917. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10918. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10919. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10920. referenceSectionOffset : LONGINT;
  10921. BEGIN
  10922. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10923. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10924. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10925. ImportsArray(importSection);
  10926. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10927. CommandArray(commandsSection);
  10928. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10929. ExceptionArray(exceptionSection);
  10930. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10931. TypeInfoSection(typeInfoSection);
  10932. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10933. References(referenceSection);
  10934. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10935. IF ~implementationVisitor.backend.cooperative THEN
  10936. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10937. ELSE
  10938. ptrTableSection := NIL;
  10939. END;
  10940. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10941. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10942. Array(emptyArraySection,temp,"");
  10943. moduleSection := ModuleSection();
  10944. Info(moduleSection, "nextRoot*: RootObject");
  10945. Address(moduleSection,0);
  10946. Info(moduleSection, "next*: Module");
  10947. Address(moduleSection,0);
  10948. Info(moduleSection, "name*: Name");
  10949. Name(moduleSection,moduleName);
  10950. Info(moduleSection, "init, published: BOOLEAN");
  10951. Boolean(moduleSection,FALSE);
  10952. Boolean(moduleSection,FALSE);
  10953. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10954. Boolean(moduleSection,FALSE);
  10955. Boolean(moduleSection,FALSE);
  10956. Info(moduleSection, "refcnt*: LONGINT");
  10957. Longint(moduleSection,0);
  10958. Info(moduleSection, "sb*: ADDRESS");
  10959. Address(moduleSection,0);
  10960. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10961. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10962. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10963. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10964. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10965. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10966. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10967. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10968. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10969. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10970. Info(moduleSection, "procTable*: ProcTable");
  10971. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10972. Info(moduleSection, "ptrTable*: PtrTable");
  10973. IF ~implementationVisitor.backend.cooperative THEN
  10974. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10975. ELSE
  10976. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10977. END;
  10978. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10979. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10980. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10981. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10982. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10983. Info(moduleSection, "export*: ExportDesc");
  10984. ExportDesc(moduleSection);
  10985. Info(moduleSection, "term*: TerminationHandler");
  10986. Address(moduleSection,0);
  10987. Info(moduleSection, "exTable*: ExceptionTable");
  10988. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10989. Info(moduleSection, "noProcs*: LONGINT");
  10990. Longint(moduleSection,numberProcs);
  10991. Info(moduleSection, "firstProc*: ADDRESS");
  10992. Address(moduleSection,0);
  10993. Info(moduleSection, "maxPtrs*: LONGINT");
  10994. Longint(moduleSection,maxPointers);
  10995. Info(moduleSection, "crc*: LONGINT");
  10996. Longint(moduleSection, 0); (*! must be implemented *)
  10997. Info(moduleSection, "body*: ADDRESS");
  10998. Symbol(moduleSection, bodyProc, 0,0);
  10999. IF implementationVisitor.backend.cooperative THEN
  11000. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11001. Info(moduleSection, "monitor.owner");
  11002. Address(moduleSection,0);
  11003. Info(moduleSection, "monitor.nestingLevel");
  11004. Address(moduleSection,0);
  11005. Info(moduleSection, "monitor.blockedQueue");
  11006. Address(moduleSection,0); Address(moduleSection,0);
  11007. Info(moduleSection, "monitor.waitingQueue");
  11008. Address(moduleSection,0); Address(moduleSection,0);
  11009. Info(moduleSection, "monitor.waitingSentinel");
  11010. Address(moduleSection,0);
  11011. END;
  11012. END Module;
  11013. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11014. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11015. BEGIN
  11016. Array(source,pc,"");
  11017. Info(source, "pointer offsets array data");
  11018. IF scope IS SyntaxTree.RecordScope THEN
  11019. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11020. ELSIF scope IS SyntaxTree.CellScope THEN
  11021. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11022. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11023. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11024. WHILE variable # NIL DO
  11025. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11026. symbol := module.allSections.FindBySymbol(variable);
  11027. ASSERT(symbol # NIL);
  11028. Pointers(0,symbol, source,variable.type,numberPointers);
  11029. END;
  11030. variable := variable.nextVariable;
  11031. END;
  11032. END;
  11033. PatchArray(source,pc,numberPointers);
  11034. END PointerArray;
  11035. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11036. VAR
  11037. name: Basic.SegmentedName;
  11038. section: IntermediateCode.Section;
  11039. BEGIN
  11040. ASSERT(implementationVisitor.newObjectFile);
  11041. Global.GetSymbolSegmentedName(symbol,name);
  11042. Basic.AppendToSegmentedName(name,suffix);
  11043. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11044. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11045. Info(section, "HeapBlock");
  11046. Address(section,0); (* empty such that GC does not go on traversing *)
  11047. Info(section, suffix);
  11048. Address(section,0);
  11049. pc := section.pc;
  11050. RETURN section;
  11051. END SymbolSection;
  11052. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11053. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11054. BEGIN
  11055. ASSERT(implementationVisitor.newObjectFile);
  11056. IF ~ReflectionSupport OR simple THEN variable := NIL
  11057. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11058. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11059. IF type IS SyntaxTree.PointerType THEN
  11060. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11061. END;
  11062. IF type IS SyntaxTree.RecordType THEN
  11063. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11064. ELSIF type IS SyntaxTree.CellType THEN
  11065. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11066. END;
  11067. ELSIF symbol IS SyntaxTree.Procedure THEN
  11068. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11069. END;
  11070. Info(in, "variables");
  11071. IF variable # NIL THEN
  11072. section := SymbolSection(symbol, "@Variables",pc);
  11073. VariableArray(section, variable);
  11074. Symbol(in, section, pc, 0);
  11075. ELSE
  11076. Address(in, 0);
  11077. END;
  11078. END ReflectVariables;
  11079. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11080. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11081. BEGIN
  11082. ASSERT(implementationVisitor.newObjectFile);
  11083. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11084. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11085. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11086. IF type IS SyntaxTree.PointerType THEN
  11087. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11088. END;
  11089. IF type IS SyntaxTree.RecordType THEN
  11090. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11091. ELSIF type IS SyntaxTree.CellType THEN
  11092. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11093. END;
  11094. ELSIF symbol IS SyntaxTree.Procedure THEN
  11095. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11096. END;
  11097. Info(in, "procedures");
  11098. IF procedure # NIL THEN
  11099. section := SymbolSection(symbol, "@Procedures",pc);
  11100. ProcedureArray(section, procedure);
  11101. Symbol(in, section, pc, 0);
  11102. ELSE
  11103. Address(in, 0);
  11104. END;
  11105. END ReflectProcedures;
  11106. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11107. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11108. segmentedName: Basic.SegmentedName;
  11109. td: SyntaxTree.TypeDeclaration;
  11110. type: SyntaxTree.Type;
  11111. BEGIN
  11112. Array(source,pc,"Modules.FieldEntry");
  11113. Info(source, "FieldArray");
  11114. size :=0;
  11115. WHILE variable # NIL DO
  11116. Info(source,"name");
  11117. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11118. type := variable.type.resolved;
  11119. Info(source,"offset");
  11120. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11121. Info(source,"type class");
  11122. IF type IS SyntaxTree.PointerType THEN
  11123. Size(source, 1);
  11124. ELSIF type IS SyntaxTree.RecordType THEN
  11125. Size(source, 2);
  11126. ELSIF type IS SyntaxTree.NumberType THEN
  11127. Size(source, 3);
  11128. ELSE
  11129. Size(source, 0);
  11130. END;
  11131. Info(source, "type desc");
  11132. IF type IS SyntaxTree.RecordType THEN
  11133. td := type(SyntaxTree.RecordType).typeDeclaration;
  11134. Global.GetSymbolSegmentedName(td,segmentedName);
  11135. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11136. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11137. ELSE
  11138. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11139. END;
  11140. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11141. Symbol(source, tir, 0, offset);
  11142. ELSE
  11143. Address(source, 0);
  11144. END;
  11145. Info(source,"flags");
  11146. Set(source, {});
  11147. variable := variable.nextVariable;
  11148. INC(size);
  11149. END;
  11150. PatchArray(source,pc,size);
  11151. END VariableArray;
  11152. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11153. VAR pc: LONGINT; size: LONGINT;
  11154. segmentedName: Basic.SegmentedName;
  11155. BEGIN
  11156. Array(source,pc,"Modules.ProcedureEntry");
  11157. Info(source, "ProcedureArray");
  11158. size :=0;
  11159. WHILE procedure # NIL DO
  11160. Info(source,"name");
  11161. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11162. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11163. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11164. (* size *)
  11165. Size(source, 0);
  11166. (* parameters *)
  11167. Address(source, 0);
  11168. (* variables *)
  11169. ReflectVariables(source, procedure);
  11170. ReflectProcedures(source, procedure);
  11171. (* return type entry *)
  11172. Address(source, 0);
  11173. Address(source, 0);
  11174. procedure := procedure.nextProcedure;
  11175. INC(size);
  11176. END;
  11177. PatchArray(source,pc,size);
  11178. END ProcedureArray;
  11179. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11180. VAR recordType: SyntaxTree.RecordType;
  11181. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11182. section: Sections.Section; cellType: SyntaxTree.CellType;
  11183. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11184. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11185. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11186. sectionName: Basic.SectionName;
  11187. CONST MPO=-40000000H;
  11188. BEGIN
  11189. (*
  11190. TypeDesc* = POINTER TO RECORD
  11191. descSize: LONGINT;
  11192. sentinel: LONGINT; (* = MPO-4 *)
  11193. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11194. flags*: SET;
  11195. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11196. name*: Name;
  11197. END;
  11198. *)
  11199. (* source := module.sections.FindByName(...) *)
  11200. Global.GetSymbolSegmentedName(td,name);
  11201. Basic.AppendToSegmentedName(name,"@Info");
  11202. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11203. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11204. Address(source,MPO-4);
  11205. Info(source, "type tag pointer");
  11206. Symbol( source, tag, offset, 0);
  11207. Info(source, "type flags");
  11208. flags := {};
  11209. IF isProtected THEN INCL(flags,31) END;
  11210. Set( source, flags);
  11211. Info(source, "pointer to module");
  11212. moduleSection := ModuleSection();
  11213. Symbol( source, moduleSection, moduleSection.pc,0);
  11214. Info(source, "type name");
  11215. i := 0;
  11216. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11217. (*
  11218. Global.GetSymbolSegmentedName(td,name);
  11219. Basic.SegmentedNameToString(name, sectionName);
  11220. *)
  11221. Name(source,sectionName);
  11222. source.SetReferenced(FALSE);
  11223. Global.GetSymbolSegmentedName(td,name);
  11224. Basic.AppendToSegmentedName(name,"@Fields");
  11225. ReflectVariables(source, td);
  11226. ReflectProcedures(source, td);
  11227. (*
  11228. fieldSection := VariableArray(
  11229. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11230. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11231. Info(fieldSection, "HeapBlock");
  11232. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11233. Info(fieldSection, "TypeDescriptor");
  11234. Address(fieldSection,0);
  11235. Info(source, "FieldArray ref");
  11236. Symbol(source, fieldSection, fieldSection.pc, 0);
  11237. FieldArray(fieldSection);
  11238. Global.GetSymbolSegmentedName(td,name);
  11239. Basic.AppendToSegmentedName(name,"@Procedures");
  11240. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11241. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11242. Info(fieldSection, "HeapBlock");
  11243. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11244. Info(fieldSection, "TypeDescriptor");
  11245. Address(fieldSection,0);
  11246. Info(source, "Procedure Array ref");
  11247. Symbol(source, fieldSection, fieldSection.pc, 0);
  11248. ProcedureArray(fieldSection);
  11249. *)
  11250. RETURN source;
  11251. END NewTypeDescriptorInfo;
  11252. PROCEDURE NewTypeDescriptor;
  11253. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11254. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11255. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11256. numberPointers: LONGINT; padding, i: LONGINT;
  11257. CONST MPO=-40000000H;
  11258. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11259. VAR i: LONGINT;
  11260. PROCEDURE Td(record: SyntaxTree.RecordType);
  11261. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11262. BEGIN
  11263. IF record # NIL THEN
  11264. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11265. baseTD := record.typeDeclaration;
  11266. Global.GetSymbolSegmentedName(baseTD,name);
  11267. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11268. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11269. ELSE
  11270. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11271. END;
  11272. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11273. Symbol(source, tir, 0, offset);
  11274. IF reverse THEN Td(record.GetBaseRecord()) END;
  11275. END;
  11276. END Td;
  11277. BEGIN
  11278. Info(source, "tag table");
  11279. baseRecord := recordType;
  11280. i := 0;
  11281. WHILE baseRecord # NIL DO
  11282. INC(i);
  11283. baseRecord := baseRecord.GetBaseRecord();
  11284. END;
  11285. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11286. IF ~reverse THEN Td(recordType) END;
  11287. WHILE i < size DO
  11288. Address(source,0);
  11289. INC(i);
  11290. END;
  11291. IF reverse THEN Td(recordType) END;
  11292. END TdTable;
  11293. PROCEDURE MethodTable(reverse: BOOLEAN);
  11294. VAR i,methods: LONGINT;
  11295. BEGIN
  11296. Info(source, "method table");
  11297. IF recordType # NIL THEN
  11298. methods := recordType.recordScope.numberMethods;
  11299. IF reverse THEN
  11300. FOR i := methods-1 TO 0 BY -1 DO
  11301. procedure := recordType.recordScope.FindMethod(i);
  11302. Global.GetSymbolSegmentedName(procedure, name);
  11303. NamedSymbol(source, name,procedure, 0,0);
  11304. END;
  11305. ELSE
  11306. FOR i := 0 TO methods-1 DO
  11307. procedure := recordType.recordScope.FindMethod(i);
  11308. Global.GetSymbolSegmentedName(procedure, name);
  11309. NamedSymbol(source, name,procedure, 0,0);
  11310. END;
  11311. END;
  11312. END;
  11313. END MethodTable;
  11314. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11315. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11316. BEGIN
  11317. Info(source, "method table");
  11318. baseRecord := recordType;
  11319. WHILE baseRecord.baseType # NIL DO
  11320. baseRecord := baseRecord.GetBaseRecord ();
  11321. END;
  11322. GetRecordTypeName (baseRecord, name);
  11323. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11324. IF name = stackFrame THEN
  11325. start := 0;
  11326. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11327. baseRecord := recordType;
  11328. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11329. baseRecord := baseRecord.GetBaseRecord ();
  11330. END;
  11331. IF baseRecord # NIL THEN
  11332. GetRecordTypeName (baseRecord, name);
  11333. IF pointer & ~baseRecord.isObject THEN
  11334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11335. END;
  11336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11337. ELSIF recordType.isObject THEN
  11338. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11339. ELSIF pointer THEN
  11340. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11341. ELSE
  11342. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11343. END;
  11344. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11345. Symbol(source, tir, 0, 0);
  11346. start := 0;
  11347. baseRecord := recordType;
  11348. WHILE (baseRecord # NIL) DO
  11349. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11350. baseRecord := baseRecord.GetBaseRecord ();
  11351. END;
  11352. ELSE
  11353. (* explicit trace method: *)
  11354. procedure := recordType.recordScope.FindMethod(0);
  11355. IF ~procedure.isFinalizer THEN
  11356. Global.GetSymbolSegmentedName(procedure, name);
  11357. NamedSymbol(source, name,procedure, 0,0);
  11358. END;
  11359. start := 1;
  11360. END;
  11361. IF (name # stackFrame) & recordType.isObject THEN
  11362. baseRecord := recordType;
  11363. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11364. baseRecord := baseRecord.GetBaseRecord ();
  11365. END;
  11366. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11367. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11368. ELSE
  11369. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11370. END;
  11371. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11372. Symbol(source, tir, 0, 0);
  11373. END;
  11374. methods := recordType.recordScope.numberMethods;
  11375. FOR i := start TO methods-1 DO
  11376. procedure := recordType.recordScope.FindMethod(i);
  11377. IF ~procedure.isFinalizer THEN
  11378. Global.GetSymbolSegmentedName(procedure, name);
  11379. NamedSymbol(source, name,procedure, 0,0);
  11380. END;
  11381. END;
  11382. END CooperativeMethodTable;
  11383. BEGIN
  11384. Global.GetSymbolSegmentedName(td,name);
  11385. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11386. source.SetExported(IsExported(td));
  11387. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11388. IF implementationVisitor.backend.cooperative THEN
  11389. base := NIL;
  11390. baseRecord := recordType.GetBaseRecord();
  11391. IF baseRecord # NIL THEN
  11392. baseTD := baseRecord.typeDeclaration;
  11393. END;
  11394. IF ~recordType.isObject THEN
  11395. Info(source, "parent");
  11396. IF baseRecord # NIL THEN
  11397. Global.GetSymbolSegmentedName(baseTD,name);
  11398. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11399. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11400. ELSE
  11401. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11402. END;
  11403. Symbol(source, tir, 0, 0);
  11404. ELSE
  11405. Address(source,0);
  11406. END;
  11407. Info(source, "record size");
  11408. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11409. source.SetReferenced(FALSE);
  11410. CooperativeMethodTable(FALSE);
  11411. base := source;
  11412. Global.GetSymbolSegmentedName(td,name);
  11413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11414. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11415. source.SetExported(IsExported(td));
  11416. source.SetReferenced(FALSE);
  11417. END;
  11418. Info(source, "parent");
  11419. IF baseRecord # NIL THEN
  11420. Global.GetSymbolSegmentedName(baseTD,name);
  11421. sym := baseTD;
  11422. IF ~recordType.isObject THEN
  11423. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11424. sym := NIL;
  11425. END;
  11426. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11427. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11428. ELSE
  11429. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11430. END;
  11431. Symbol(source, tir, 0, 0);
  11432. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11433. Address(source,0);
  11434. ELSE
  11435. IF recordType.isObject THEN
  11436. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11437. ELSE
  11438. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11439. END;
  11440. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11441. Symbol(source, tir, 0, 0);
  11442. END;
  11443. Info(source, "base record descriptor");
  11444. Symbol(source, base, 0, 0);
  11445. CooperativeMethodTable(TRUE);
  11446. source.SetReferenced(FALSE);
  11447. IF recordType.hasPointers THEN
  11448. IF ~HasExplicitTraceMethod (recordType) THEN
  11449. implementationVisitor.CreateTraceMethod(recordType);
  11450. END;
  11451. implementationVisitor.CreateResetProcedure(recordType);
  11452. implementationVisitor.CreateAssignProcedure(recordType);
  11453. END;
  11454. ELSIF ~simple THEN
  11455. (*
  11456. MethodEnd = MPO
  11457. ---
  11458. methods (# methods)
  11459. ---
  11460. tags (16)
  11461. ---
  11462. TypeDesc = TypeInfoAdr
  11463. ---
  11464. td adr ---> rec size
  11465. ----
  11466. pointer offsets
  11467. ----
  11468. (padding)
  11469. -----
  11470. empty [2 addresses aligned]
  11471. empty
  11472. empty
  11473. numPtrs
  11474. ---
  11475. pointer offsets
  11476. ---
  11477. *)
  11478. Info(source, "MethodEnd = MPO");
  11479. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11480. source(IntermediateCode.Section).Emit(Data(-1,op));
  11481. MethodTable(TRUE);
  11482. TdTable(TypeTags, TRUE);
  11483. Info(source, "type descriptor info pointer");
  11484. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11485. IF (cellType # NIL) THEN
  11486. IF cellType.sizeInBits < 0 THEN
  11487. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11488. END;
  11489. Info(source, "cell size");
  11490. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11491. ELSE
  11492. Info(source, "record size");
  11493. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11494. END;
  11495. Info(source, "pointer offsets pointer");
  11496. padding := 1- source.pc MOD 2;
  11497. Symbol(source, source, source.pc+1+padding,0);
  11498. IF padding >0 THEN
  11499. Info(source, "padding");
  11500. FOR i := 1 TO padding DO Address(source,0) END;
  11501. END;
  11502. IF cellType # NIL THEN
  11503. PointerArray(source, cellType.cellScope, numberPointers);
  11504. ELSE
  11505. PointerArray(source, recordType.recordScope, numberPointers);
  11506. END;
  11507. ELSE
  11508. (*
  11509. simple:
  11510. td adr --> size
  11511. tag(1)
  11512. tag(2)
  11513. tag(3)
  11514. methods ->
  11515. *)
  11516. Info(source, "record size");
  11517. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11518. TdTable(TypeTags, FALSE);
  11519. MethodTable(FALSE);
  11520. source.SetReferenced(FALSE);
  11521. END;
  11522. END NewTypeDescriptor;
  11523. BEGIN
  11524. x := x.resolved;
  11525. IF (x IS SyntaxTree.PointerType) THEN
  11526. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11527. END;
  11528. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11529. recordType := x(SyntaxTree.RecordType);
  11530. td := x.typeDeclaration;
  11531. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11532. ASSERT(td # NIL);
  11533. section := module.allSections.FindBySymbol(td); (* TODO *)
  11534. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11535. IF implementationVisitor.newObjectFile THEN
  11536. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11537. NewTypeDescriptor
  11538. END;
  11539. ELSE
  11540. (* data section in intermediate code *)
  11541. Global.GetSymbolSegmentedName(td,name);
  11542. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11543. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11544. tir.Emit(Data(-1,op));
  11545. END;
  11546. END;
  11547. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11548. cellType := x(SyntaxTree.CellType);
  11549. td := x.typeDeclaration;
  11550. section := module.allSections.FindBySymbol(td); (* TODO *)
  11551. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11552. IF implementationVisitor.newObjectFile THEN
  11553. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11554. NewTypeDescriptor
  11555. END;
  11556. END;
  11557. END;
  11558. END
  11559. END CheckTypeDeclaration
  11560. END MetaDataGenerator;
  11561. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11562. VAR
  11563. trace-: BOOLEAN;
  11564. traceString-: SyntaxTree.IdentifierString;
  11565. traceModuleName-: SyntaxTree.IdentifierString;
  11566. newObjectFile-: BOOLEAN;
  11567. profile-: BOOLEAN;
  11568. noRuntimeChecks: BOOLEAN;
  11569. simpleMetaData-: BOOLEAN;
  11570. noAsserts: BOOLEAN;
  11571. optimize-: BOOLEAN;
  11572. cooperative-: BOOLEAN;
  11573. preregisterStatic-: BOOLEAN;
  11574. dump-: Basic.Writer;
  11575. cellsAreObjects: BOOLEAN;
  11576. PROCEDURE &InitIntermediateBackend*;
  11577. BEGIN
  11578. simpleMetaData := FALSE;
  11579. newObjectFile := FALSE;
  11580. InitBackend;
  11581. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11582. SetTraceModuleName(DefaultTraceModuleName);
  11583. END InitIntermediateBackend;
  11584. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11585. VAR
  11586. declarationVisitor: DeclarationVisitor;
  11587. implementationVisitor: ImplementationVisitor;
  11588. module: Sections.Module;
  11589. name, platformName: SyntaxTree.IdentifierString;
  11590. meta: MetaDataGenerator;
  11591. BEGIN
  11592. ResetError;
  11593. Global.GetSymbolName(x,name);
  11594. NEW(module,x,system); (* backend structures *)
  11595. Global.GetModuleName(x, name);
  11596. module.SetModuleName(name);
  11597. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11598. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11599. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11600. declarationVisitor.Module(x,module);
  11601. IF newObjectFile & ~meta.simple THEN
  11602. meta.Module(implementationVisitor.moduleBodySection);
  11603. END;
  11604. GetDescription(platformName);
  11605. module.SetPlatformName(platformName);
  11606. RETURN module
  11607. END GenerateIntermediate;
  11608. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11609. BEGIN RETURN TRUE
  11610. END SupportedImmediate;
  11611. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11612. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11613. END ProcessSyntaxTreeModule;
  11614. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11615. VAR
  11616. result: Sections.Module;
  11617. traceName: Basic.MessageString;
  11618. BEGIN
  11619. ASSERT(intermediateCodeModule IS Sections.Module);
  11620. result := intermediateCodeModule(Sections.Module);
  11621. IF trace THEN
  11622. traceName := "intermediate code trace: ";
  11623. Strings.Append(traceName,traceString);
  11624. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11625. IF (traceString="") OR (traceString="*") THEN
  11626. result.Dump(dump);
  11627. dump.Update
  11628. ELSE
  11629. Sections.DumpFiltered(dump, result, traceString);
  11630. END
  11631. END;
  11632. RETURN result
  11633. END ProcessIntermediateCodeModule;
  11634. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11635. BEGIN instructionSet := "Intermediate";
  11636. END GetDescription;
  11637. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11638. BEGIN
  11639. SELF.newObjectFile := newObjectFile;
  11640. SELF.simpleMetaData := simpleMetaData;
  11641. END SetNewObjectFile;
  11642. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11643. BEGIN COPY(name, traceModuleName)
  11644. END SetTraceModuleName;
  11645. PROCEDURE DefineOptions(options: Options.Options);
  11646. BEGIN
  11647. DefineOptions^(options);
  11648. options.Add(0X,"trace",Options.String);
  11649. options.Add(0X,"runtime",Options.String);
  11650. options.Add(0X,"newObjectFile",Options.Flag);
  11651. options.Add(0X,"traceModule",Options.String);
  11652. options.Add(0X,"profile",Options.Flag);
  11653. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11654. options.Add(0X,"noAsserts",Options.Flag);
  11655. options.Add(0X,"metaData",Options.String);
  11656. options.Add('o',"optimize", Options.Flag);
  11657. options.Add(0X,"preregisterStatic", Options.Flag);
  11658. options.Add(0X,"cellsAreObjects", Options.Flag);
  11659. END DefineOptions;
  11660. PROCEDURE GetOptions(options: Options.Options);
  11661. VAR name,string: SyntaxTree.IdentifierString;
  11662. BEGIN
  11663. GetOptions^(options);
  11664. trace := options.GetString("trace",traceString);
  11665. profile := options.GetFlag("profile");
  11666. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11667. noAsserts := options.GetFlag("noAsserts");
  11668. cooperative := options.GetFlag("cooperative");
  11669. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11670. IF cooperative THEN
  11671. SetRuntimeModuleName("CPU") END
  11672. END;
  11673. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11674. simpleMetaData := TRUE
  11675. END;
  11676. IF options.GetString("metaData",string) THEN
  11677. IF string = "simple" THEN simpleMetaData := TRUE
  11678. ELSIF string ="full" THEN simpleMetaData := FALSE
  11679. END;
  11680. END;
  11681. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11682. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11683. optimize := options.GetFlag("optimize");
  11684. preregisterStatic := options.GetFlag("preregisterStatic");
  11685. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11686. END GetOptions;
  11687. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11688. BEGIN RETURN SymbolFileFormat.Get()
  11689. END DefaultSymbolFileFormat;
  11690. END IntermediateBackend;
  11691. (* ----------------------------------- register allocation ------------------------------------- *)
  11692. (* register mapping scheme
  11693. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11694. spill offset
  11695. part(n) --> ticket <--> physical register
  11696. spill offset
  11697. *)
  11698. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11699. emptyOperand: IntermediateCode.Operand;
  11700. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11701. statCoopResetVariables: LONGINT;
  11702. statCoopModifyAssignments: LONGINT;
  11703. modifyAssignmentsPC : LONGINT;
  11704. statCoopNilCheck: LONGINT;
  11705. statCoopSwitch: LONGINT;
  11706. statCoopAssignProcedure: LONGINT;
  11707. statCoopTraceMethod: LONGINT;
  11708. statCoopResetProcedure: LONGINT;
  11709. statCoopTraceModule: LONGINT;
  11710. PROCEDURE ResetStatistics*;
  11711. BEGIN
  11712. statCoopResetVariables := 0;
  11713. statCoopModifyAssignments := 0;
  11714. statCoopNilCheck:= 0;
  11715. statCoopSwitch:= 0;
  11716. statCoopAssignProcedure:= 0;
  11717. statCoopTraceMethod:= 0;
  11718. statCoopResetProcedure:= 0;
  11719. statCoopTraceModule:= 0;
  11720. END ResetStatistics;
  11721. PROCEDURE Statistics*;
  11722. BEGIN
  11723. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11724. TRACE(statCoopNilCheck, statCoopSwitch);
  11725. TRACE(statCoopAssignProcedure,
  11726. statCoopTraceMethod,
  11727. statCoopResetProcedure,
  11728. statCoopTraceModule)
  11729. END Statistics;
  11730. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11731. VAR h: LONGINT;
  11732. BEGIN
  11733. WHILE b # 0 DO
  11734. h := a MOD b;
  11735. a := b;
  11736. b := h;
  11737. END;
  11738. RETURN a
  11739. END GCD;
  11740. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11741. BEGIN
  11742. RETURN a*b DIV GCD(a,b)
  11743. END SCM;
  11744. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11745. BEGIN
  11746. (*TRACE(a,b);*)
  11747. IF a = 0 THEN RETURN b
  11748. ELSIF b = 0 THEN RETURN a
  11749. ELSE RETURN SCM(a,b)
  11750. END;
  11751. END CommonAlignment;
  11752. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11753. BEGIN
  11754. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11755. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11756. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11757. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11758. 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)
  11759. END
  11760. END PassBySingleReference;
  11761. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11762. BEGIN
  11763. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11764. END PassInRegister;
  11765. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11766. VAR new: RegisterEntry;
  11767. BEGIN
  11768. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11769. IF queue = NIL THEN
  11770. queue := new
  11771. ELSE
  11772. new.next := queue;
  11773. IF queue#NIL THEN queue.prev := new END;
  11774. queue := new
  11775. END;
  11776. END AddRegisterEntry;
  11777. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11778. VAR this: RegisterEntry;
  11779. BEGIN
  11780. this := queue;
  11781. WHILE (this # NIL) & (this.register # register) DO
  11782. this := this.next;
  11783. END;
  11784. IF this = NIL THEN
  11785. RETURN FALSE
  11786. END;
  11787. ASSERT(this # NIL);
  11788. IF this = queue THEN queue := queue.next END;
  11789. IF this.prev # NIL THEN this.prev.next := this.next END;
  11790. IF this.next # NIL THEN this.next.prev := this.prev END;
  11791. RETURN TRUE
  11792. END RemoveRegisterEntry;
  11793. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11794. BEGIN ASSERT(cond);
  11795. END Assert;
  11796. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11797. BEGIN
  11798. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11799. END ReusableRegister;
  11800. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11801. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11802. BEGIN
  11803. procedure := moduleScope.bodyProcedure;
  11804. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11805. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11806. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11807. procedure.SetScope(moduleScope);
  11808. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11809. procedure.SetAccess(SyntaxTree.Hidden);
  11810. moduleScope.SetBodyProcedure(procedure);
  11811. moduleScope.AddProcedure(procedure);
  11812. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11813. END;
  11814. END EnsureBodyProcedure;
  11815. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11816. VAR import: SyntaxTree.Import;
  11817. selfName: SyntaxTree.IdentifierString;
  11818. module: SyntaxTree.Module;
  11819. BEGIN
  11820. scope.ownerModule.GetName(selfName);
  11821. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11822. module := scope.ownerModule
  11823. ELSE
  11824. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11825. IF import = NIL THEN
  11826. RETURN NIL
  11827. ELSIF import.module = NIL THEN
  11828. RETURN NIL
  11829. ELSE module := import.module
  11830. END;
  11831. END;
  11832. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11833. END GetSymbol;
  11834. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11835. BEGIN
  11836. op.mode := mode;
  11837. IntermediateCode.InitOperand(op.op);
  11838. IntermediateCode.InitOperand(op.tag);
  11839. IntermediateCode.InitOperand(op.extra);
  11840. op.dimOffset := 0;
  11841. END InitOperand;
  11842. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11843. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11844. BEGIN RETURN IntermediateCode.GetType(system, type)
  11845. END GetType;
  11846. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11847. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11848. BEGIN
  11849. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11850. (*
  11851. UniqueId(name,module,name,adr);
  11852. *)
  11853. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11854. constant.SetValue(value);
  11855. module.moduleScope.AddConstant(constant);
  11856. constant.SetScope(module.moduleScope);
  11857. RETURN constant
  11858. END BuildConstant;
  11859. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11860. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11861. BEGIN
  11862. variable := scope.firstVariable;
  11863. WHILE variable # NIL DO
  11864. IF variable.NeedsTrace() THEN
  11865. RETURN TRUE;
  11866. END;
  11867. variable := variable.nextVariable;
  11868. END;
  11869. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11870. WHILE parameter # NIL DO
  11871. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11872. RETURN TRUE;
  11873. END;
  11874. parameter := parameter.nextParameter;
  11875. END;
  11876. RETURN FALSE;
  11877. END HasPointers;
  11878. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11879. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11880. END IsVariableParameter;
  11881. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11882. VAR parameter: SyntaxTree.Parameter;
  11883. BEGIN
  11884. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11885. WHILE parameter # NIL DO
  11886. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11887. IF parameter.movable THEN RETURN TRUE END;
  11888. parameter := parameter.nextParameter;
  11889. END;
  11890. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11891. END HasVariableParameters;
  11892. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11893. BEGIN
  11894. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11895. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11896. END HasExplicitTraceMethod;
  11897. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11898. BEGIN
  11899. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11900. IF (expression IS SyntaxTree.IntegerValue) THEN
  11901. val := expression(SyntaxTree.IntegerValue).value;
  11902. RETURN TRUE
  11903. ELSE
  11904. RETURN FALSE
  11905. END;
  11906. END IsIntegerConstant;
  11907. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11908. BEGIN
  11909. IF val <= 0 THEN RETURN FALSE END;
  11910. exp := 0;
  11911. WHILE ~ODD(val) DO
  11912. val := val DIV 2;
  11913. INC(exp)
  11914. END;
  11915. RETURN val = 1
  11916. END PowerOf2;
  11917. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11918. VAR procedure: SyntaxTree.Procedure;
  11919. BEGIN
  11920. procedure := record.recordScope.constructor;
  11921. IF procedure = NIL THEN
  11922. record := record.GetBaseRecord();
  11923. IF record # NIL THEN
  11924. procedure := GetConstructor(record)
  11925. END;
  11926. END;
  11927. RETURN procedure;
  11928. END GetConstructor;
  11929. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11930. BEGIN
  11931. value := SHORT(op.intValue);
  11932. RETURN op.mode = IntermediateCode.ModeImmediate;
  11933. END IsIntegerImmediate;
  11934. (** whether a type strictily is a pointer to record or object type
  11935. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11936. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11937. BEGIN
  11938. IF type = NIL THEN
  11939. RETURN FALSE
  11940. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11941. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11942. ELSE
  11943. RETURN FALSE
  11944. END
  11945. END IsStrictlyPointerToRecord;
  11946. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11947. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11948. END IsUnsafePointer;
  11949. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11950. BEGIN type := type.resolved;
  11951. IF type IS SyntaxTree.PointerType THEN
  11952. type := type(SyntaxTree.PointerType).pointerBase;
  11953. type := type.resolved;
  11954. IF type IS SyntaxTree.RecordType THEN
  11955. recordType := type(SyntaxTree.RecordType);
  11956. RETURN TRUE
  11957. ELSE
  11958. RETURN FALSE
  11959. END
  11960. ELSIF type IS SyntaxTree.RecordType THEN
  11961. recordType := type(SyntaxTree.RecordType);
  11962. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11963. ELSIF type IS SyntaxTree.ObjectType THEN
  11964. RETURN TRUE
  11965. ELSIF type IS SyntaxTree.AnyType THEN
  11966. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11967. ELSE
  11968. RETURN FALSE
  11969. END;
  11970. END IsPointerToRecord;
  11971. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11972. BEGIN
  11973. type := type.resolved;
  11974. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11975. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11976. END IsArrayOfSystemByte;
  11977. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11978. BEGIN
  11979. IF type = NIL THEN RETURN FALSE END;
  11980. type := type.resolved;
  11981. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11982. END IsOpenArray;
  11983. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11984. BEGIN
  11985. IF type = NIL THEN RETURN FALSE END;
  11986. type := type.resolved;
  11987. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11988. END IsSemiDynamicArray;
  11989. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11990. BEGIN
  11991. IF type = NIL THEN RETURN FALSE END;
  11992. type := type.resolved;
  11993. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11994. END IsStaticArray;
  11995. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11996. VAR size: LONGINT;
  11997. BEGIN
  11998. size := 1;
  11999. WHILE (IsStaticArray(type)) DO
  12000. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12001. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12002. END;
  12003. RETURN size;
  12004. END StaticArrayNumElements;
  12005. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12006. BEGIN
  12007. WHILE (IsStaticArray(type)) DO
  12008. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12009. END;
  12010. RETURN type;
  12011. END StaticArrayBaseType;
  12012. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12013. BEGIN
  12014. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12015. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12016. END;
  12017. RETURN type;
  12018. END ArrayBaseType;
  12019. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12020. BEGIN
  12021. IF type = NIL THEN RETURN FALSE END;
  12022. type := type.resolved;
  12023. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12024. END IsDelegate;
  12025. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12026. VAR i: LONGINT;
  12027. BEGIN
  12028. i := 0; type := type.resolved;
  12029. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12030. INC(i);
  12031. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12032. END;
  12033. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12034. INC(i);
  12035. type := type(SyntaxTree.MathArrayType).arrayBase;
  12036. IF type # NIL THEN type := type.resolved END;
  12037. END;
  12038. RETURN i
  12039. END DynamicDim;
  12040. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12041. BEGIN
  12042. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12043. type := type(SyntaxTree.ArrayType).arrayBase;
  12044. END;
  12045. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12046. type := type(SyntaxTree.MathArrayType).arrayBase;
  12047. END;
  12048. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12049. END StaticSize;
  12050. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12051. BEGIN
  12052. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12053. END IsImmediate;
  12054. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12055. BEGIN
  12056. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12057. END IsAddress;
  12058. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12059. BEGIN
  12060. RETURN (x.mode = IntermediateCode.ModeRegister);
  12061. END IsRegister;
  12062. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12063. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12064. BEGIN
  12065. typeDeclaration := recordType.typeDeclaration;
  12066. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12067. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12068. END GetRecordTypeName;
  12069. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12070. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12071. BEGIN
  12072. parSize := 0;
  12073. IF StructuredReturnType(procedureType) THEN
  12074. parameter := procedureType.returnParameter;
  12075. INC(parSize,system.SizeOfParameter(parameter));
  12076. parSize := parSize + (-parSize) MOD system.addressSize;
  12077. END;
  12078. parameter :=procedureType.lastParameter;
  12079. WHILE (parameter # NIL) DO
  12080. INC(parSize,system.SizeOfParameter(parameter));
  12081. parSize := parSize + (-parSize) MOD system.addressSize;
  12082. parameter := parameter.prevParameter;
  12083. END;
  12084. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12085. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12086. RETURN ToMemoryUnits(system,parSize)
  12087. END ParametersSize;
  12088. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12089. BEGIN
  12090. IF type = NIL THEN RETURN FALSE
  12091. ELSE
  12092. type := type.resolved;
  12093. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12094. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12095. END
  12096. END ReturnedAsParameter;
  12097. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12098. BEGIN
  12099. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12100. END StructuredReturnType;
  12101. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12102. BEGIN
  12103. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12104. END IsNested;
  12105. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12106. BEGIN
  12107. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12108. scope := scope.outerScope;
  12109. END;
  12110. RETURN scope # NIL;
  12111. END InCellScope;
  12112. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12113. BEGIN
  12114. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12115. RETURN 0
  12116. ELSE
  12117. *)
  12118. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12119. (*END;*)
  12120. END ProcedureParametersSize;
  12121. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12122. VAR dataUnit: LONGINT;
  12123. BEGIN dataUnit := system.dataUnit;
  12124. ASSERT(size MOD system.dataUnit = 0);
  12125. RETURN size DIV system.dataUnit
  12126. END ToMemoryUnits;
  12127. PROCEDURE Get*(): Backend.Backend;
  12128. VAR backend: IntermediateBackend;
  12129. BEGIN NEW(backend); RETURN backend
  12130. END Get;
  12131. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12132. VAR instruction: IntermediateCode.Instruction;
  12133. BEGIN
  12134. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12135. RETURN instruction
  12136. END Nop;
  12137. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12138. VAR instruction: IntermediateCode.Instruction;
  12139. BEGIN
  12140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12141. RETURN instruction
  12142. END Mov;
  12143. (* like Mov but ensures that no new register will be allocated for dest *)
  12144. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12145. VAR instruction: IntermediateCode.Instruction;
  12146. BEGIN
  12147. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12148. RETURN instruction
  12149. END MovReplace;
  12150. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12151. VAR instruction: IntermediateCode.Instruction;
  12152. BEGIN
  12153. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12154. RETURN instruction
  12155. END Conv;
  12156. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12157. VAR instruction: IntermediateCode.Instruction;
  12158. BEGIN
  12159. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12160. RETURN instruction
  12161. END Call;
  12162. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12163. VAR op1, op2: IntermediateCode.Operand;
  12164. VAR instruction: IntermediateCode.Instruction;
  12165. BEGIN
  12166. IntermediateCode.InitNumber(op1,pcOffset);
  12167. IntermediateCode.InitNumber(op2,callingConvention);
  12168. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12169. RETURN instruction
  12170. END Exit;
  12171. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12172. VAR instruction: IntermediateCode.Instruction;
  12173. BEGIN
  12174. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12175. RETURN instruction
  12176. END Return;
  12177. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12178. VAR instruction: IntermediateCode.Instruction;
  12179. BEGIN
  12180. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12181. RETURN instruction
  12182. END Result;
  12183. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12184. VAR op1: IntermediateCode.Operand;
  12185. VAR instruction: IntermediateCode.Instruction;
  12186. BEGIN
  12187. IntermediateCode.InitNumber(op1,nr);
  12188. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12189. RETURN instruction
  12190. END Trap;
  12191. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12192. VAR instruction: IntermediateCode.Instruction;
  12193. BEGIN
  12194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12195. RETURN instruction
  12196. END Br;
  12197. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12198. VAR instruction: IntermediateCode.Instruction;
  12199. BEGIN
  12200. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12201. RETURN instruction
  12202. END Breq;
  12203. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12204. VAR instruction: IntermediateCode.Instruction;
  12205. BEGIN
  12206. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12207. RETURN instruction
  12208. END Brne;
  12209. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12210. VAR instruction: IntermediateCode.Instruction;
  12211. BEGIN
  12212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12213. RETURN instruction
  12214. END Brge;
  12215. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12216. VAR instruction: IntermediateCode.Instruction;
  12217. BEGIN
  12218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12219. RETURN instruction
  12220. END Brlt;
  12221. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12222. VAR instruction: IntermediateCode.Instruction;
  12223. BEGIN
  12224. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12225. RETURN instruction
  12226. END Pop;
  12227. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12228. VAR instruction: IntermediateCode.Instruction;
  12229. BEGIN
  12230. ASSERT(op.mode # IntermediateCode.Undefined);
  12231. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12232. RETURN instruction
  12233. END Push;
  12234. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12235. VAR instruction: IntermediateCode.Instruction;
  12236. BEGIN
  12237. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12238. RETURN instruction
  12239. END Neg;
  12240. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12241. VAR instruction: IntermediateCode.Instruction;
  12242. BEGIN
  12243. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12244. RETURN instruction
  12245. END Not;
  12246. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12247. VAR instruction: IntermediateCode.Instruction;
  12248. BEGIN
  12249. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12250. RETURN instruction
  12251. END Abs;
  12252. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12253. VAR instruction: IntermediateCode.Instruction;
  12254. BEGIN
  12255. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12256. RETURN instruction
  12257. END Mul;
  12258. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12259. VAR instruction: IntermediateCode.Instruction;
  12260. BEGIN
  12261. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12262. RETURN instruction
  12263. END Div;
  12264. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12265. VAR instruction: IntermediateCode.Instruction;
  12266. BEGIN
  12267. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12268. RETURN instruction
  12269. END Mod;
  12270. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12271. VAR instruction: IntermediateCode.Instruction;
  12272. BEGIN
  12273. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12274. RETURN instruction
  12275. END Sub;
  12276. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12277. VAR instruction: IntermediateCode.Instruction;
  12278. BEGIN
  12279. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12280. RETURN instruction
  12281. END Add;
  12282. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12283. VAR instruction: IntermediateCode.Instruction;
  12284. BEGIN
  12285. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12286. RETURN instruction
  12287. END And;
  12288. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12289. VAR instruction: IntermediateCode.Instruction;
  12290. BEGIN
  12291. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12292. RETURN instruction
  12293. END Or;
  12294. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12295. VAR instruction: IntermediateCode.Instruction;
  12296. BEGIN
  12297. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12298. RETURN instruction
  12299. END Xor;
  12300. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12301. VAR instruction: IntermediateCode.Instruction;
  12302. BEGIN
  12303. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12304. RETURN instruction
  12305. END Shl;
  12306. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12307. VAR instruction: IntermediateCode.Instruction;
  12308. BEGIN
  12309. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12310. RETURN instruction
  12311. END Shr;
  12312. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12313. VAR instruction: IntermediateCode.Instruction;
  12314. BEGIN
  12315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12316. RETURN instruction
  12317. END Rol;
  12318. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12319. VAR instruction: IntermediateCode.Instruction;
  12320. BEGIN
  12321. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12322. RETURN instruction
  12323. END Ror;
  12324. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12325. VAR instruction: IntermediateCode.Instruction;
  12326. BEGIN
  12327. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12328. RETURN instruction
  12329. END Cas;
  12330. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12331. VAR instruction: IntermediateCode.Instruction;
  12332. BEGIN
  12333. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12334. RETURN instruction
  12335. END Copy;
  12336. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12337. VAR instruction: IntermediateCode.Instruction;
  12338. BEGIN
  12339. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12340. RETURN instruction
  12341. END Fill;
  12342. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12343. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12344. BEGIN
  12345. string := IntermediateCode.String(s);
  12346. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12347. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12348. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12350. RETURN instruction
  12351. END Asm;
  12352. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12353. VAR instruction: IntermediateCode.Instruction;
  12354. BEGIN
  12355. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12356. RETURN instruction
  12357. END Data;
  12358. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12359. VAR instruction: IntermediateCode.Instruction;
  12360. BEGIN
  12361. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12362. IntermediateCode.SetSubType(instruction, subtype);
  12363. RETURN instruction
  12364. END SpecialInstruction;
  12365. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12366. VAR op1: IntermediateCode.Operand;
  12367. VAR instruction: IntermediateCode.Instruction;
  12368. BEGIN
  12369. (*! generate a warning if size exceeds a certain limit *)
  12370. (*
  12371. ASSERT(bytes < 1000000); (* sanity check *)
  12372. *)
  12373. ASSERT(0 <= units); (* sanity check *)
  12374. IntermediateCode.InitNumber(op1,units);
  12375. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12376. RETURN instruction
  12377. END Reserve;
  12378. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12379. VAR op1: IntermediateCode.Operand;
  12380. VAR instruction: IntermediateCode.Instruction;
  12381. BEGIN
  12382. IntermediateCode.InitNumber(op1,position);
  12383. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12384. RETURN instruction
  12385. END LabelInstruction;
  12386. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12387. VAR pc: LONGINT;
  12388. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12389. BEGIN
  12390. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12391. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12392. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12393. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12394. IF instr.op1.type.form = IntermediateCode.Float THEN
  12395. RETURN instr.op1.floatValue = op.floatValue
  12396. ELSE
  12397. RETURN instr.op1.intValue = op.intValue
  12398. END;
  12399. END ProvidesValue;
  12400. BEGIN
  12401. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12402. pc := 0;
  12403. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12404. INC(pc);
  12405. END;
  12406. IF pc = data.pc THEN
  12407. data.Emit(Data(-1,vop));
  12408. END;
  12409. RETURN pc
  12410. END EnterImmediate;
  12411. PROCEDURE Init;
  12412. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12413. BEGIN
  12414. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12415. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12416. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12417. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12418. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12419. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12420. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12421. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12422. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12423. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12424. IntermediateCode.InitOperand(emptyOperand);
  12425. FOR i := 0 TO NumberSystemCalls-1 DO
  12426. name := "@SystemCall";
  12427. Basic.AppendNumber(name,i);
  12428. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12429. END;
  12430. END Init;
  12431. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12432. BEGIN
  12433. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12434. END IsExported;
  12435. BEGIN
  12436. Init;
  12437. END FoxIntermediateBackend.
  12438. Compiler.Compile FoxIntermediateBackend.Mod ~