FoxIntermediateBackend.Mod 531 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, ActiveCells := FoxActiveCells;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. LongNameLength = 64;
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultRuntimeModuleName ="Runtime";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. suppressModuleRegistration=FALSE;
  54. NonPointer = -1; (* special pointer values *)
  55. NoType = 0; (* special type info values *)
  56. LhsIsPointer = 0; (* for the operator kind *)
  57. RhsIsPointer = 1;
  58. (* priority values, lower means higher priority *)
  59. EntryPriority=-4;
  60. FirstPriority=-3;
  61. InitPriority=-2;
  62. ExitPriority=-1;
  63. StrictChecks = FALSE;
  64. BasePointerTypeSize = 5;
  65. BaseArrayTypeSize = BasePointerTypeSize + 3;
  66. LengthOffset = BasePointerTypeSize + 0;
  67. DataOffset = BasePointerTypeSize + 1;
  68. DescriptorOffset = BasePointerTypeSize + 2;
  69. BaseRecordTypeSize = BasePointerTypeSize + 2;
  70. ActionOffset = BasePointerTypeSize + 0;
  71. MonitorOffset = BasePointerTypeSize + 1;
  72. BaseObjectTypeSize = BaseRecordTypeSize;
  73. ActionTypeSize = 3;
  74. MonitorTypeSize = 7;
  75. ProcessorOffset = BaseObjectTypeSize + 1;
  76. StackLimitOffset* = BaseObjectTypeSize + 3;
  77. QuantumOffset = BaseObjectTypeSize + 4;
  78. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  79. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  80. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  81. Size2Flag = 4; (* size = 2 *)
  82. Size3Flag = 5; (* size = 3 *)
  83. Size4Flag = 6; (* size = 4 *)
  84. Size5Flag = 7; (* size = 5 *)
  85. Size6Flag = 8; (* size = 6 *)
  86. Size7Flag = 9; (* size = 7 *)
  87. Size8Flag = 10; (* size = 8 *)
  88. ReflectionSupport = TRUE;
  89. TYPE
  90. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  91. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  92. Operand = RECORD
  93. mode: SHORTINT;
  94. op: IntermediateCode.Operand;
  95. tag: IntermediateCode.Operand;
  96. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  97. dimOffset: LONGINT;
  98. END;
  99. Fixup= POINTER TO RECORD
  100. pc: LONGINT;
  101. nextFixup: Fixup;
  102. END;
  103. WriteBackCall = POINTER TO RECORD
  104. call: SyntaxTree.ProcedureCallDesignator;
  105. next: WriteBackCall;
  106. END;
  107. Label= OBJECT
  108. VAR
  109. fixups: Fixup;
  110. section: IntermediateCode.Section;
  111. pc: LONGINT;
  112. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  113. BEGIN
  114. SELF.section := section; pc := -1;
  115. END InitLabel;
  116. PROCEDURE Resolve(pc: LONGINT);
  117. VAR at: LONGINT;
  118. BEGIN
  119. SELF.pc := pc;
  120. WHILE(fixups # NIL) DO
  121. at := fixups.pc;
  122. section.PatchAddress(at,pc);
  123. fixups := fixups.nextFixup;
  124. END;
  125. END Resolve;
  126. PROCEDURE AddFixup(at: LONGINT);
  127. VAR fixup: Fixup;
  128. BEGIN
  129. ASSERT(pc=-1);
  130. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  131. END AddFixup;
  132. END Label;
  133. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  134. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  135. VAR
  136. backend: IntermediateBackend;
  137. implementationVisitor: ImplementationVisitor;
  138. meta: MetaDataGenerator;
  139. system: Global.System;
  140. currentScope: SyntaxTree.Scope;
  141. module: Sections.Module;
  142. moduleSelf: SyntaxTree.Variable;
  143. dump: BOOLEAN;
  144. forceModuleBody: BOOLEAN;
  145. addressType: IntermediateCode.Type;
  146. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  147. BEGIN
  148. currentScope := NIL; module := NIL; moduleSelf := NIL;
  149. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  150. SELF.dump := dump;
  151. SELF.backend := backend;
  152. SELF.forceModuleBody := forceModuleBody;
  153. addressType := IntermediateCode.GetType(system,system.addressType)
  154. END Init;
  155. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  156. BEGIN
  157. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  158. END Error;
  159. PROCEDURE Type(x: SyntaxTree.Type);
  160. BEGIN
  161. x.Accept(SELF);
  162. END Type;
  163. (** types **)
  164. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  165. BEGIN (* no code emission *) END VisitBasicType;
  166. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  167. BEGIN (* no code emission *) END VisitCharacterType;
  168. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  169. BEGIN (* no code emission *) END VisitIntegerType;
  170. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  171. BEGIN (* no code emission *) END VisitFloatType;
  172. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  173. BEGIN (* no code emission *) END VisitComplexType;
  174. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  175. VAR type: SyntaxTree.Type;
  176. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  177. type := x.resolved;
  178. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  179. meta.CheckTypeDeclaration(type);
  180. END;
  181. END VisitQualifiedType;
  182. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  183. BEGIN (* no code emission *) END VisitStringType;
  184. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  185. BEGIN (* no code emission *)
  186. END VisitArrayRangeType;
  187. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  188. BEGIN (* no code emission *) END VisitArrayType;
  189. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  190. BEGIN
  191. meta.CheckTypeDeclaration(x);
  192. END VisitMathArrayType;
  193. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  194. BEGIN
  195. meta.CheckTypeDeclaration(x);
  196. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  197. END VisitPointerType;
  198. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  199. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  200. BEGIN (* no code emission *)
  201. meta.CheckTypeDeclaration(x);
  202. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  203. IF x.pointerType.typeDeclaration # NIL THEN
  204. td := x.pointerType.typeDeclaration
  205. ELSE
  206. td := x.typeDeclaration
  207. END;
  208. Global.GetSymbolName(td,name);
  209. (* code section for object *)
  210. END;
  211. Scope(x.recordScope);
  212. END VisitRecordType;
  213. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  214. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  215. BEGIN
  216. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  217. WHILE (this # NIL) & (this.identifier# id) DO
  218. this := this.nextModifier;
  219. END;
  220. RETURN this # NIL
  221. END HasFlag;
  222. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  223. VAR name:Basic.SegmentedName; td: SyntaxTree.TypeDeclaration; type: SyntaxTree.Type; len,port,adr: LONGINT;
  224. parameter: SyntaxTree.Parameter; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  225. PROCEDURE CreatePortArray(type: SyntaxTree.Type; len: LONGINT);
  226. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  227. BEGIN
  228. FOR i := 0 TO len-1 DO
  229. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  230. CreatePortArray(baseType, len2);
  231. ELSE
  232. IF backend.cellsAreObjects THEN
  233. adr := port
  234. ELSE
  235. (*! add check from ActiveCells2 *)
  236. adr := backend.activeCellsSpecification.GetPortAddress(port);
  237. END;
  238. IntermediateCode.InitImmediate(op,addressType,adr);
  239. symbol.Emit(Data(-1,op));
  240. INC(port);
  241. END;
  242. END;
  243. END CreatePortArray;
  244. BEGIN
  245. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  246. IF (x.cellScope.ownerModule = module.module) THEN
  247. td := x.typeDeclaration;
  248. Global.GetSymbolSegmentedName(td,name);
  249. (* code section for object *)
  250. END;
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. IF type IS SyntaxTree.PortType THEN
  256. len := 1;
  257. INC(port);
  258. ELSIF SemanticChecker.IsStaticArray(type,type,len) OR SemanticChecker.IsDynamicArray(type, type) THEN
  259. IF backend.cellsAreObjects THEN
  260. IF IsStaticArray(parameter.type.resolved) THEN
  261. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  262. END;
  263. (* do nothing *)
  264. ELSE
  265. Global.GetSymbolSegmentedName(parameter,name);
  266. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,parameter,dump);
  267. CreatePortArray(type, len);
  268. (*
  269. WHILE len > 0 DO
  270. adr := backend.activeCellsSpecification.GetPortAddress(port);
  271. IntermediateCode.InitImmediate(op,addressType,adr);
  272. symbol.Emit(Data(-1,op));
  273. DEC(len); INC(port);
  274. END;
  275. *)
  276. END;
  277. ELSE
  278. Error(parameter.position,"should never happen, check semantic checker!");
  279. END;
  280. parameter := parameter.nextParameter;
  281. END;
  282. capabilities := {};
  283. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  284. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  285. backend.SetCapabilities(capabilities);
  286. Scope(x.cellScope);
  287. END VisitCellType;
  288. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  289. BEGIN (* no code emission *) END VisitProcedureType;
  290. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  291. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  292. END VisitEnumerationType;
  293. (* symbols *)
  294. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  295. BEGIN
  296. Procedure(x);
  297. END VisitProcedure;
  298. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  299. BEGIN
  300. Procedure(x);
  301. END VisitOperator;
  302. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  303. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align: LONGINT;
  304. BEGIN
  305. IF x.externalName # NIL THEN RETURN END;
  306. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  307. (* code section for variable *)
  308. Global.GetSymbolSegmentedName(x,name);
  309. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  310. irv.SetExported(IsExported(x));
  311. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  312. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  313. IF ~x.fixed THEN
  314. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  315. ELSE
  316. align := x.alignment;
  317. END;
  318. irv.SetPositionOrAlignment(x.fixed, align);
  319. meta.CheckTypeDeclaration(x.type);
  320. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  321. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  322. END;
  323. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  324. END VisitVariable;
  325. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  326. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  327. BEGIN
  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 x.defaultValue = NIL THEN
  337. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  338. ELSE
  339. implementationVisitor.inData := TRUE;
  340. implementationVisitor.Evaluate(x.defaultValue, op);
  341. irv.Emit(Data(x.position,op.op));
  342. implementationVisitor.inData := FALSE;
  343. END;
  344. meta.CheckTypeDeclaration(x.type);
  345. END VisitParameter;
  346. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  347. BEGIN
  348. Type(x.declaredType); (* => code in objects *)
  349. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  350. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  351. END;
  352. END VisitTypeDeclaration;
  353. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  354. BEGIN
  355. IF (SyntaxTree.Public * x.access # {}) THEN
  356. implementationVisitor.VisitConstant(x);
  357. END;
  358. END VisitConstant;
  359. PROCEDURE Scope(x: SyntaxTree.Scope);
  360. VAR procedure: SyntaxTree.Procedure;
  361. constant: SyntaxTree.Constant;
  362. variable: SyntaxTree.Variable;
  363. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  364. BEGIN
  365. prevScope := currentScope;
  366. currentScope := x;
  367. (* constants treated in implementation visitor *)
  368. typeDeclaration := x.firstTypeDeclaration;
  369. WHILE typeDeclaration # NIL DO
  370. VisitTypeDeclaration(typeDeclaration);
  371. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  372. END;
  373. variable := x.firstVariable;
  374. WHILE variable # NIL DO
  375. VisitVariable(variable);
  376. variable := variable.nextVariable;
  377. END;
  378. procedure := x.firstProcedure;
  379. WHILE procedure # NIL DO
  380. VisitProcedure(procedure);
  381. procedure := procedure.nextProcedure;
  382. END;
  383. constant := x.firstConstant;
  384. WHILE constant # NIL DO
  385. VisitConstant(constant);
  386. constant := constant.nextConstant;
  387. END;
  388. currentScope := prevScope;
  389. END Scope;
  390. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  391. VAR parameter: SyntaxTree.Parameter;
  392. BEGIN
  393. parameter := first;
  394. WHILE parameter # NIL DO
  395. VisitParameter(parameter);
  396. parameter := parameter.nextParameter;
  397. END;
  398. END Parameters;
  399. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  400. VAR scope: SyntaxTree.ProcedureScope;
  401. prevScope: SyntaxTree.Scope;
  402. inline, finalizer: BOOLEAN;
  403. procedureType: SyntaxTree.ProcedureType;
  404. pc: LONGINT;
  405. stackSize: LONGINT;
  406. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  407. null,size,src,dest,fp,res: IntermediateCode.Operand;
  408. cc: LONGINT;
  409. cellType: SyntaxTree.CellType;
  410. registerNumber: LONGINT;
  411. registerClass: IntermediateCode.RegisterClass;
  412. type: IntermediateCode.Type;
  413. formalParameter: SyntaxTree.Parameter;
  414. recordType: SyntaxTree.RecordType;
  415. isModuleBody: BOOLEAN;
  416. PROCEDURE Signature;
  417. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  418. BEGIN
  419. procedureType := x.type(SyntaxTree.ProcedureType);
  420. returnType := procedureType.returnType;
  421. IF returnType # NIL THEN
  422. meta.CheckTypeDeclaration(returnType)
  423. END;
  424. parameter := procedureType.firstParameter;
  425. WHILE parameter # NIL DO
  426. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  427. parameter := parameter.nextParameter;
  428. END;
  429. END Signature;
  430. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  431. VAR result: BOOLEAN;
  432. BEGIN
  433. result := FALSE;
  434. IF x = SyntaxTree.invalidExpression THEN
  435. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  436. result := TRUE;
  437. value := x.resolved(SyntaxTree.IntegerValue).value;
  438. ELSE
  439. Error(x.position,"expression is not an integer constant");
  440. END;
  441. RETURN result;
  442. END CheckIntegerValue;
  443. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  444. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  445. BEGIN
  446. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  447. WHILE (this # NIL) & (this.identifier # id) DO
  448. this := this.nextModifier;
  449. END;
  450. IF this # NIL THEN
  451. IF this.expression = NIL THEN
  452. Error(this.position,"expected expression value");
  453. ELSIF CheckIntegerValue(this.expression,value) THEN
  454. END;
  455. RETURN TRUE
  456. ELSE RETURN FALSE
  457. END;
  458. END HasValue;
  459. BEGIN
  460. IF x.externalName # NIL THEN RETURN END;
  461. (*
  462. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  463. *)
  464. (* code section for this procedure *)
  465. scope := x.procedureScope;
  466. prevScope := currentScope;
  467. currentScope := scope;
  468. procedureType := x.type(SyntaxTree.ProcedureType);
  469. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  470. implementationVisitor.temporaries.Init;
  471. implementationVisitor.usedRegisters := NIL;
  472. implementationVisitor.registerUsageCount.Init;
  473. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  474. IF (scope.body # NIL) & (x.isInline) THEN
  475. inline := TRUE;
  476. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  477. ir.SetExported(IsExported(x));
  478. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  479. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  480. IF backend.cellsAreObjects THEN
  481. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  482. ir.SetExported(IsExported(x));
  483. ELSE
  484. RETURN; (* cellnet cannot be compiled for final static hardware *)
  485. END;
  486. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  487. inline := FALSE;
  488. AddBodyCallStub(x);
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  490. ir.SetExported(IsExported(x));
  491. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  492. inline := FALSE;
  493. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  494. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := ActiveCells.defaultDataMemorySize END;
  495. AddBodyCallStub(x);
  496. AddStackAllocation(x,stackSize);
  497. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  498. ir.SetExported(IsExported(x));
  499. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  500. inline := FALSE;
  501. Parameters(procedureType.firstParameter);
  502. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  503. ir.SetExported(IsExported(x));
  504. ELSE
  505. inline := FALSE;
  506. IF x.isEntry OR x.isExit THEN
  507. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  508. ir.SetExported(TRUE);
  509. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  510. ELSE
  511. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  512. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  513. END;
  514. END;
  515. cc := procedureType.callingConvention;
  516. IF scope.body # NIL THEN
  517. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  518. registerNumber := 0;
  519. IF ~inline THEN
  520. IF scope.lastVariable = NIL THEN
  521. stackSize := 0
  522. ELSE
  523. stackSize := scope.lastVariable.offsetInBits;
  524. IF stackSize <0 THEN stackSize := -stackSize END;
  525. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  526. END;
  527. (*
  528. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  529. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  530. *)
  531. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  532. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  533. END;
  534. pc := ir.pc-1;
  535. (*
  536. ir.Emit(Nop(position)); (* placeholder for fill *)
  537. *)
  538. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  539. formalParameter := procedureType.lastParameter;
  540. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  541. IF ~PassInRegister(formalParameter) THEN
  542. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  543. ELSE
  544. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  545. type := GetType(system, formalParameter.type);
  546. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  547. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  548. ir.Emit(Mov(-1,dest, src));
  549. implementationVisitor.ReleaseIntermediateOperand(src);
  550. INC(registerNumber);
  551. formalParameter := formalParameter.prevParameter;
  552. END;
  553. END;
  554. END;
  555. ir.EnterValidPAF;
  556. END;
  557. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  558. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  559. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  560. IF scope.lastVariable # NIL THEN
  561. stackSize := scope.lastVariable.offsetInBits;
  562. IF stackSize <0 THEN stackSize := -stackSize END;
  563. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  564. END;
  565. END;
  566. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  567. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  568. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  569. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  570. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  571. ir.EmitAt(pc,Push(size));
  572. implementationVisitor.StaticCallOperand(result,procedure);
  573. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  574. END;
  575. *)
  576. END;
  577. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  578. IF stackSize > 0 THEN
  579. IF (stackSize MOD system.addressSize = 0) THEN
  580. null := IntermediateCode.Immediate(addressType,0);
  581. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  582. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  583. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  584. ELSE
  585. null := IntermediateCode.Immediate(int8,0);
  586. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  587. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  588. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  589. END;
  590. (*! should potentially be called by backend -- enter might initialize
  591. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  592. *)
  593. END;
  594. ir.ExitValidPAF;
  595. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  596. finalizer := FALSE;
  597. IF backend.cooperative & x.isFinalizer THEN
  598. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  599. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  600. GetRecordTypeName(recordType,name);
  601. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  602. END;
  603. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  604. IF backend.cooperative THEN
  605. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  606. IF implementationVisitor.profile & ~isModuleBody THEN
  607. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  608. END;
  609. END;
  610. implementationVisitor.EmitLeave(ir, x.position,cc);
  611. IF finalizer THEN
  612. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  613. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  614. ir.Emit(Br(x.position,dest));
  615. ELSE
  616. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  617. END;
  618. ELSE
  619. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  620. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  621. END;
  622. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  623. IF backend.cooperative THEN
  624. IF HasPointers (scope) THEN
  625. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  626. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  627. ir.Emit(Result(x.position, res));
  628. ir.Emit(Push(x.position, res));
  629. implementationVisitor.ResetVariables(scope);
  630. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  631. ir.Emit(Pop(x.position, res));
  632. ir.Emit(Return(x.position, res));
  633. ELSE
  634. implementationVisitor.ResetVariables(scope);
  635. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  636. END;
  637. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  638. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  639. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  640. ir.Emit(Result(x.position, res));
  641. ir.Emit(Push(x.position, res));
  642. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  643. ir.Emit(Pop(x.position, res));
  644. ir.Emit(Return(x.position, res));
  645. ELSE
  646. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  647. END;
  648. END;
  649. implementationVisitor.EmitLeave(ir,x.position,cc);
  650. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  651. ELSE
  652. ir.Emit(Nop(x.position));
  653. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  654. implementationVisitor.EmitLeave(ir,x.position,cc);
  655. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  656. END;
  657. END;
  658. END
  659. END;
  660. ELSE (* force body for procedures *)
  661. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  662. ir.EnterValidPAF;
  663. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  664. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  665. ir.ExitValidPAF;
  666. implementationVisitor.EmitLeave(ir,x.position,cc);
  667. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  668. END;
  669. Scope(scope);
  670. Signature;
  671. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  672. currentScope := prevScope;
  673. END Procedure;
  674. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  675. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  676. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  677. BEGIN
  678. ASSERT (bodyProcedure # NIL);
  679. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  680. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  681. procedure.SetScope(bodyProcedure.scope);
  682. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  683. procedure.SetAccess(SyntaxTree.Hidden);
  684. Global.GetSymbolSegmentedName (procedure,name);
  685. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  686. ir.SetExported(TRUE);
  687. ir.SetPriority(InitPriority);
  688. Global.GetSymbolSegmentedName (bodyProcedure,name);
  689. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  690. implementationVisitor.currentScope := module.module.moduleScope;
  691. implementationVisitor.section := ir;
  692. implementationVisitor.PushSelfPointer();
  693. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  694. ELSIF backend.preregisterStatic THEN
  695. implementationVisitor.currentScope := module.module.moduleScope;
  696. implementationVisitor.section := ir;
  697. implementationVisitor.PushSelfPointer();
  698. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  699. ELSE
  700. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  701. ir.Emit(Call(bodyProcedure.position,op, 0));
  702. END;
  703. END AddBodyCallStub;
  704. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  705. VAR name: Basic.SegmentedName;
  706. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  707. BEGIN
  708. Global.GetSymbolSegmentedName (symbol,name);
  709. Basic.RemoveSuffix(name);
  710. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  711. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  712. ir.SetExported(TRUE);
  713. ir.SetPriority(FirstPriority);
  714. IntermediateCode.InitImmediate(op,addressType,initStack);
  715. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  716. END AddStackAllocation;
  717. (** entry function to visit a complete module *)
  718. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  719. VAR
  720. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  721. hasDynamicOperatorDeclarations: BOOLEAN;
  722. operator: SyntaxTree.Operator;
  723. import: SyntaxTree.Import;
  724. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  725. BEGIN
  726. type := type.resolved;
  727. IF type IS SyntaxTree.RecordType THEN
  728. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  729. ELSIF (type IS SyntaxTree.ArrayType) THEN
  730. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  731. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  732. END;
  733. ELSIF type IS SyntaxTree.MathArrayType THEN
  734. WITH type: SyntaxTree.MathArrayType DO
  735. IF type.form = SyntaxTree.Open THEN
  736. RETURN TRUE
  737. ELSIF type.form = SyntaxTree.Static THEN
  738. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  739. END;
  740. END;
  741. END;
  742. RETURN FALSE
  743. END TypeNeedsInitialization;
  744. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  745. VAR variable: SyntaxTree.Variable;
  746. BEGIN
  747. variable := scope.firstVariable;
  748. WHILE variable # NIL DO
  749. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  750. IF variable.initializer # NIL THEN RETURN TRUE END;
  751. variable := variable.nextVariable;
  752. END;
  753. RETURN FALSE
  754. END ScopeNeedsInitialization;
  755. BEGIN
  756. ASSERT(x # NIL); ASSERT(module # NIL);
  757. SELF.module := module;
  758. (* add import names to the generated Sections.Module *)
  759. import := x.moduleScope.firstImport;
  760. WHILE import # NIL DO
  761. import.module.GetName(idstr);
  762. module.imports.AddName(idstr);
  763. import := import.nextImport
  764. END;
  765. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  766. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  767. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  768. moduleSelf.SetType(system.anyType);
  769. moduleSelf.SetScope(x.moduleScope);
  770. moduleSelf.SetUntraced(TRUE);
  771. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  772. ir.SetExported(TRUE);
  773. IntermediateCode.InitImmediate(op,addressType,0);
  774. ir.Emit(Data(-1,op));
  775. END;
  776. implementationVisitor.module := module;
  777. implementationVisitor.moduleScope := x.moduleScope;
  778. implementationVisitor.moduleSelf := moduleSelf;
  779. implementationVisitor.canBeLoaded := TRUE;
  780. meta.SetModule(module);
  781. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  782. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  783. END;
  784. IF backend.profile THEN
  785. EnsureBodyProcedure(x.moduleScope);
  786. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  787. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  788. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  789. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  790. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  791. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  792. Global.GetModuleName(module.module,idstr);
  793. implementationVisitor.ProfilerAddModule(idstr);
  794. implementationVisitor.numberProcedures := 0;
  795. END;
  796. implementationVisitor.profile := backend.profile;
  797. (* check if there is at least one dynamic operator locally defined *)
  798. hasDynamicOperatorDeclarations := FALSE;
  799. operator := x.moduleScope.firstOperator;
  800. WHILE operator # NIL DO
  801. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  802. operator := operator.nextOperator
  803. END;
  804. (* add operator initialization code section *)
  805. IF hasDynamicOperatorDeclarations THEN
  806. EnsureBodyProcedure(x.moduleScope);
  807. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  808. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  809. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  810. END;
  811. Scope(x.moduleScope);
  812. IF hasDynamicOperatorDeclarations THEN
  813. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  814. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  815. END;
  816. IF backend.profile THEN
  817. implementationVisitor.ProfilerPatchInit;
  818. END;
  819. END Module;
  820. END DeclarationVisitor;
  821. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  822. RegisterUsageCount*=OBJECT
  823. VAR used: UsedArray; count: LONGINT;
  824. PROCEDURE &Init;
  825. VAR i: LONGINT;
  826. BEGIN
  827. count := 0;
  828. IF used = NIL THEN NEW(used,64); END;
  829. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  830. END Init;
  831. PROCEDURE Grow;
  832. VAR new: UsedArray; size,i: LONGINT;
  833. BEGIN
  834. size := LEN(used)*2;
  835. NEW(new,size);
  836. FOR i := 0 TO LEN(used)-1 DO
  837. new[i].count := used[i].count;
  838. new[i].type := used[i].type;
  839. new[i].map := used[i].map
  840. END;
  841. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  842. used := new
  843. END Grow;
  844. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  845. BEGIN
  846. INC(count);
  847. IF count = LEN(used) THEN Grow END;
  848. used[count].type := type;
  849. used[count].class := class;
  850. used[count].map := count;
  851. RETURN count;
  852. END Next;
  853. PROCEDURE IncUse(register: LONGINT);
  854. BEGIN
  855. INC(used[register].count);
  856. (*
  857. IF (register = 1) & (count > 30) THEN
  858. D.TraceBack;
  859. END;
  860. *)
  861. END IncUse;
  862. PROCEDURE DecUse(register: LONGINT);
  863. BEGIN
  864. DEC(used[register].count);
  865. END DecUse;
  866. PROCEDURE Map(register: LONGINT): LONGINT;
  867. VAR map : LONGINT;
  868. BEGIN
  869. IF register > 0 THEN
  870. map := used[register].map;
  871. WHILE register # map DO register := map; map := used[register].map END;
  872. END;
  873. RETURN register
  874. END Map;
  875. PROCEDURE Remap(register: LONGINT; to: LONGINT);
  876. BEGIN
  877. used[register].map:= to;
  878. used[to].count := used[register].count;
  879. used[register].count := 0;
  880. END Remap;
  881. PROCEDURE Use(register: LONGINT): LONGINT;
  882. BEGIN
  883. IF register< LEN(used) THEN
  884. RETURN used[register].count
  885. ELSE
  886. RETURN 0
  887. END
  888. END Use;
  889. END RegisterUsageCount;
  890. RegisterEntry = POINTER TO RECORD
  891. prev,next: RegisterEntry;
  892. register: LONGINT;
  893. registerClass: IntermediateCode.RegisterClass;
  894. type: IntermediateCode.Type;
  895. END;
  896. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  897. Variables = OBJECT (Basic.List)
  898. VAR
  899. inUse: VariableUse;
  900. registerIndex: LONGINT;
  901. PROCEDURE & Init;
  902. VAR i: LONGINT;
  903. BEGIN
  904. InitList(16);
  905. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  906. registerIndex := 1024;
  907. END Init;
  908. PROCEDURE GetUsage(VAR use: VariableUse);
  909. BEGIN
  910. use := inUse;
  911. END GetUsage;
  912. PROCEDURE SetUsage(CONST use: VariableUse);
  913. BEGIN
  914. inUse := use;
  915. END SetUsage;
  916. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  917. VAR any: ANY;
  918. BEGIN
  919. any := Get(i);;
  920. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  921. END GetVariable;
  922. PROCEDURE Occupy(pos: LONGINT);
  923. BEGIN
  924. INCL(inUse[pos DIV 32], pos MOD 32);
  925. END Occupy;
  926. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  927. BEGIN
  928. Occupy(Length());
  929. Add(v);
  930. END AddVariable;
  931. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  932. VAR var : SyntaxTree.Variable;
  933. BEGIN
  934. FOR pos := 0 TO Length()-1 DO
  935. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  936. var := GetVariable(pos);
  937. IF type.SameType(var.type) THEN
  938. Occupy(pos); RETURN var
  939. END;
  940. END;
  941. END;
  942. pos := Length();
  943. RETURN NIL
  944. END GetFreeVariable;
  945. END Variables;
  946. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  947. SymbolMapper = OBJECT
  948. VAR
  949. first: SymbolMap;
  950. PROCEDURE & Init;
  951. BEGIN
  952. first := NIL;
  953. END Init;
  954. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  955. VAR new: SymbolMap;
  956. BEGIN
  957. NEW(new); new.this := this; new.to := to; new.tag := tag;
  958. new.next := first; first := new;
  959. END Add;
  960. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  961. VAR s: SymbolMap;
  962. BEGIN
  963. s := first;
  964. WHILE (s # NIL) & (s.this # this) DO
  965. s := s.next
  966. END;
  967. RETURN s
  968. END Get;
  969. END SymbolMapper;
  970. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  971. VAR
  972. system: Global.System;
  973. section: IntermediateCode.Section;
  974. module: Sections.Module;
  975. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  976. awaitProcCounter, labelId, constId, caseId: LONGINT;
  977. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  978. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  979. checker: SemanticChecker.Checker;
  980. backend: IntermediateBackend;
  981. meta: MetaDataGenerator;
  982. position: LONGINT;
  983. moduleSelf: SyntaxTree.Variable;
  984. (* variables for hand over of variables / temporary state *)
  985. currentScope: SyntaxTree.Scope;
  986. constantDeclaration : SyntaxTree.Symbol;
  987. result: Operand; (* result of the most recent expression / statement *)
  988. destination: IntermediateCode.Operand;
  989. arrayDestinationTag: IntermediateCode.Operand;
  990. arrayDestinationDimension:LONGINT;
  991. currentLoop: Label; (* variable to hand over loop exit jump list *)
  992. conditional: BOOLEAN;
  993. trueLabel, falseLabel, exitLabel: Label;
  994. locked: BOOLEAN;
  995. (*
  996. usedRegisters: Registers;
  997. *)
  998. registerUsageCount: RegisterUsageCount;
  999. usedRegisters: RegisterEntry;
  1000. (* useful operands and types *)
  1001. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1002. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1003. commentPrintout: Printout.Printer;
  1004. dump: Streams.Writer;
  1005. tagsAvailable : BOOLEAN;
  1006. supportedInstruction: SupportedInstructionProcedure;
  1007. supportedImmediate: SupportedImmediateProcedure;
  1008. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1009. emitLabels: BOOLEAN;
  1010. runtimeModuleName : SyntaxTree.IdentifierString;
  1011. newObjectFile: BOOLEAN;
  1012. indexCounter: LONGINT;
  1013. profile: BOOLEAN;
  1014. profileId, profileInit: IntermediateCode.Section;
  1015. profileInitPatchPosition: LONGINT;
  1016. numberProcedures: LONGINT;
  1017. procedureResultDesignator : SyntaxTree.Designator;
  1018. operatorInitializationCodeSection: IntermediateCode.Section;
  1019. fingerPrinter: FingerPrinter.FingerPrinter;
  1020. temporaries: Variables;
  1021. canBeLoaded : BOOLEAN;
  1022. currentIsInline: BOOLEAN;
  1023. currentMapper: SymbolMapper;
  1024. currentInlineExit: Label;
  1025. moduleBodySection: IntermediateCode.Section;
  1026. NeedDescriptor : BOOLEAN;
  1027. cooperativeSwitches: BOOLEAN;
  1028. lastSwitchPC: LONGINT;
  1029. isUnchecked: BOOLEAN;
  1030. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1031. newObjectFile: BOOLEAN);
  1032. BEGIN
  1033. SELF.system := system;
  1034. SELF.runtimeModuleName := runtime;
  1035. currentScope := NIL;
  1036. hiddenPointerType := NIL;
  1037. delegatePointerType := NIL;
  1038. awaitProcCounter := 0;
  1039. labelId := 0; constId := 0; labelId := 0;
  1040. SELF.checker := checker;
  1041. SELF.backend := backend;
  1042. position := Diagnostics.Invalid;
  1043. conditional := FALSE;
  1044. locked := FALSE;
  1045. InitOperand(result,ModeUndefined);
  1046. addressType := IntermediateCode.GetType(system,system.addressType);
  1047. setType := IntermediateCode.GetType(system,system.setType);
  1048. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1049. byteType := IntermediateCode.GetType(system, system.byteType);
  1050. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1051. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1052. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1053. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1054. nil := IntermediateCode.Immediate(addressType,0);
  1055. IntermediateCode.InitOperand(destination);
  1056. tagsAvailable := TRUE;
  1057. supportedInstruction := supportedInstructionProcedure;
  1058. supportedImmediate := supportedImmediateProcedure;
  1059. inData := FALSE;
  1060. SELF.emitLabels := emitLabels;
  1061. IntermediateCode.InitOperand(arrayDestinationTag);
  1062. bool := IntermediateCode.GetType(system,system.booleanType);
  1063. IntermediateCode.InitImmediate(false,bool,0);
  1064. IntermediateCode.InitImmediate(true,bool,1);
  1065. SELF.newObjectFile := newObjectFile;
  1066. indexCounter := 0;
  1067. NEW(registerUsageCount);
  1068. usedRegisters := NIL;
  1069. procedureResultDesignator := NIL;
  1070. NEW(fingerPrinter, system);
  1071. NEW(temporaries);
  1072. currentIsInline := FALSE;
  1073. NeedDescriptor := FALSE;
  1074. isUnchecked := backend.noRuntimeChecks;
  1075. END Init;
  1076. TYPE Context = RECORD
  1077. section: IntermediateCode.Section;
  1078. registerUsageCount: RegisterUsageCount;
  1079. usedRegisters: RegisterEntry;
  1080. END;
  1081. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1082. VAR context: Context;
  1083. BEGIN
  1084. context.section := section;
  1085. context.registerUsageCount := registerUsageCount;
  1086. context.usedRegisters := usedRegisters;
  1087. section := new;
  1088. NEW(registerUsageCount);
  1089. usedRegisters := NIL;
  1090. RETURN context;
  1091. END SwitchContext;
  1092. PROCEDURE ReturnToContext(context: Context);
  1093. BEGIN
  1094. section := context.section;
  1095. registerUsageCount := context.registerUsageCount;
  1096. usedRegisters := context.usedRegisters;
  1097. END ReturnToContext;
  1098. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1099. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1100. BEGIN
  1101. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1102. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1103. END;
  1104. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1105. section.SetExported(IsExported(syntaxTreeSymbol));
  1106. RETURN section
  1107. END NewSection;
  1108. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1109. VAR new: LONGINT;
  1110. BEGIN
  1111. new := registerUsageCount.Next(type,class);
  1112. UseRegister(new);
  1113. RETURN new
  1114. END AcquireRegister;
  1115. (** get the name for the code section that represens a certain symbol
  1116. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1117. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1118. VAR
  1119. operatorFingerPrint: SyntaxTree.FingerPrint;
  1120. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1121. BEGIN
  1122. Global.GetSymbolSegmentedName(symbol, name);
  1123. (* if the symbol is an operator, then append the fingerprint to the name *)
  1124. IF symbol IS SyntaxTree.Operator THEN
  1125. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1126. string := "[";
  1127. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1128. Strings.Append(string, operatorFingerPrintString);
  1129. Strings.Append(string, "]");
  1130. Basic.AppendToSegmentedName(name,string);
  1131. END
  1132. END GetCodeSectionNameForSymbol;
  1133. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1134. BEGIN
  1135. IF dump # NIL THEN
  1136. dump.String("enter "); dump.String(s); dump.Ln;
  1137. END;
  1138. END TraceEnter;
  1139. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1140. BEGIN
  1141. IF dump # NIL THEN
  1142. dump.String("exit "); dump.String(s); dump.Ln;
  1143. END;
  1144. END TraceExit;
  1145. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1146. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1147. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1148. VAR i: LONGINT;
  1149. BEGIN
  1150. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1151. IF op.rule # NIL THEN
  1152. FOR i := 0 TO LEN(op.rule)-1 DO
  1153. CheckRegister(op.rule[i])
  1154. END;
  1155. END;
  1156. END CheckRegister;
  1157. BEGIN
  1158. CheckRegister(instruction.op1);
  1159. CheckRegister(instruction.op2);
  1160. CheckRegister(instruction.op3);
  1161. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1162. ELSE section.Emit(instruction);
  1163. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1164. END;
  1165. END Emit;
  1166. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1167. BEGIN
  1168. IF backend.cooperative THEN
  1169. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1170. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1171. ELSE
  1172. Emit(Trap(position,trapNo));
  1173. END;
  1174. END EmitTrap;
  1175. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1176. VAR name: Basic.SegmentedName;
  1177. VAR op1, op2, reg: IntermediateCode.Operand;
  1178. VAR call, nocall: Label;
  1179. VAR parametersSize: LONGINT;
  1180. VAR prevSection: IntermediateCode.Section;
  1181. VAR prevDump: Streams.Writer;
  1182. VAR body: SyntaxTree.Body;
  1183. BEGIN
  1184. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1185. prevSection := SELF.section;
  1186. SELF.section := section;
  1187. prevDump := dump;
  1188. dump := section.comments;
  1189. IF backend.hasLinkRegister THEN
  1190. Emit(Push(-1, lr));
  1191. END;
  1192. Emit(Push(-1,fp));
  1193. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1194. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1195. GetCodeSectionNameForSymbol(procedure, name);
  1196. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1197. ELSE
  1198. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1199. END;
  1200. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1201. Emit(Push(-1,op1));
  1202. Emit(Mov(-1,fp, sp));
  1203. body := procedure.procedureScope.body;
  1204. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1205. NEW(call, section);
  1206. NEW(nocall, section);
  1207. reg := NewRegisterOperand(addressType);
  1208. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1209. Emit(Sub(-1,reg, sp, op1));
  1210. BrltL(call, sp, reg);
  1211. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1212. BrgeL(nocall, sp, op2);
  1213. call.Resolve(section.pc);
  1214. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1215. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1216. Emit(Push(-1, op2));
  1217. Emit(Push(-1, reg));
  1218. ReleaseIntermediateOperand(reg);
  1219. CallThis(position, "Activities","ExpandStack",2);
  1220. Emit(Result(-1, sp));
  1221. nocall.Resolve(section.pc);
  1222. END;
  1223. ELSE
  1224. Emit(Mov(-1, fp, sp));
  1225. END;
  1226. Emit(Enter(-1, callconv, varSize));
  1227. SELF.section := prevSection;
  1228. dump := prevDump;
  1229. END EmitEnter;
  1230. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1231. VAR op1,op2: IntermediateCode.Operand;
  1232. VAR instruction: IntermediateCode.Instruction;
  1233. BEGIN
  1234. IntermediateCode.InitNumber(op1,callconv);
  1235. IntermediateCode.InitNumber(op2,varSize);
  1236. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1237. RETURN instruction
  1238. END Enter;
  1239. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1240. VAR op1: IntermediateCode.Operand;
  1241. VAR instruction: IntermediateCode.Instruction;
  1242. BEGIN
  1243. IntermediateCode.InitNumber(op1,callconv);
  1244. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1245. RETURN instruction
  1246. END Leave;
  1247. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1248. VAR prevSection: IntermediateCode.Section;
  1249. VAR op2: IntermediateCode.Operand;
  1250. BEGIN
  1251. prevSection := SELF.section;
  1252. SELF.section := section;
  1253. Emit(Leave(position, callconv));
  1254. IF backend.cooperative THEN
  1255. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1256. Emit(Add(position, sp, fp, op2));
  1257. ELSE
  1258. Emit(Mov(position, sp, fp));
  1259. END;
  1260. Emit(Pop(position, fp));
  1261. SELF.section := prevSection;
  1262. END EmitLeave;
  1263. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1264. VAR m: SymbolMap;
  1265. BEGIN
  1266. position := x.position;
  1267. IF currentIsInline THEN
  1268. m := currentMapper.Get(x);
  1269. IF m # NIL THEN
  1270. (*
  1271. Printout.Info("mapping from", x);
  1272. Printout.Info("mapping to ", m.to);
  1273. *)
  1274. m.to.Accept(SELF);
  1275. op := result;
  1276. IF m.tag # NIL THEN
  1277. ReleaseIntermediateOperand(result.tag);
  1278. m.tag.Accept(SELF);
  1279. op.tag := result.op;
  1280. ReleaseIntermediateOperand(result.tag);
  1281. END;
  1282. RETURN
  1283. END;
  1284. END;
  1285. x.Accept(SELF);
  1286. op := result;
  1287. END Symbol;
  1288. PROCEDURE Expression(x: SyntaxTree.Expression);
  1289. BEGIN
  1290. position := x.position;
  1291. constantDeclaration := NIL;
  1292. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1293. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1294. END;
  1295. IF x.resolved # NIL THEN
  1296. x.resolved.Accept(SELF)
  1297. ELSE
  1298. x.Accept(SELF)
  1299. END;
  1300. (* check this, was commented out in ActiveCells3 *)
  1301. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1302. Error(x.position, "unsupported modifier");
  1303. END;
  1304. END Expression;
  1305. (*
  1306. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1307. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1308. BEGIN
  1309. temporaries.GetUsage(current);
  1310. FOR i := 0 TO LEN(current)-1 DO
  1311. set := current[i] - previous[i];
  1312. IF set # {} THEN
  1313. FOR j := 0 TO MAX(SET)-1 DO
  1314. IF j IN set THEN
  1315. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1316. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1317. Symbol(variable, op);
  1318. MakeMemory(tmp,op.op,addressType,0);
  1319. ReleaseOperand(op);
  1320. Emit(Mov(position,tmp, nil ) );
  1321. ReleaseIntermediateOperand(tmp);
  1322. END;
  1323. END;
  1324. END;
  1325. END;
  1326. END;
  1327. END ResetUsedTemporaries;
  1328. *)
  1329. PROCEDURE Statement(x: SyntaxTree.Statement);
  1330. VAR use: VariableUse;
  1331. BEGIN
  1332. temporaries.GetUsage(use);
  1333. position := x.position;
  1334. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1335. IF commentPrintout # NIL THEN
  1336. commentPrintout.Statement(x);
  1337. dump.Ln;
  1338. (*dump.Update;*)
  1339. END;
  1340. x.Accept(SELF);
  1341. (*
  1342. CheckRegistersFree();
  1343. *)
  1344. (*ResetUsedTemporaries(use);*)
  1345. temporaries.SetUsage(use);
  1346. END Statement;
  1347. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1348. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1349. *)
  1350. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1351. BEGIN
  1352. IF op.mode = IntermediateCode.ModeMemory THEN
  1353. ReuseCopy(res,op);
  1354. ELSE
  1355. res := op;
  1356. UseIntermediateOperand(res);
  1357. END;
  1358. IntermediateCode.AddOffset(res,offset);
  1359. IntermediateCode.MakeMemory(res,type);
  1360. END MakeMemory;
  1361. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1362. VAR mem: IntermediateCode.Operand;
  1363. BEGIN
  1364. MakeMemory(mem,res,type,offset);
  1365. ReleaseIntermediateOperand(res);
  1366. res := mem;
  1367. END ToMemory;
  1368. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1369. VAR mem: IntermediateCode.Operand;
  1370. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1371. componentType: SyntaxTree.Type;
  1372. BEGIN
  1373. type := type.resolved;
  1374. IF operand.mode = ModeReference THEN
  1375. IF type IS SyntaxTree.RangeType THEN
  1376. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1377. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1378. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1379. ReleaseOperand(operand);
  1380. operand.op := firstOp;
  1381. operand.tag := lastOp;
  1382. operand.extra := stepOp;
  1383. ELSIF type IS SyntaxTree.ComplexType THEN
  1384. componentType := type(SyntaxTree.ComplexType).componentType;
  1385. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1386. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1387. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1388. ReleaseOperand(operand);
  1389. operand.op := firstOp;
  1390. operand.tag := lastOp
  1391. ELSE
  1392. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1393. ReleaseIntermediateOperand(operand.op);
  1394. operand.op := mem;
  1395. END;
  1396. operand.mode := ModeValue;
  1397. END;
  1398. ASSERT(operand.mode = ModeValue);
  1399. END LoadValue;
  1400. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1401. VAR prevConditional: BOOLEAN;
  1402. BEGIN
  1403. prevConditional := conditional;
  1404. conditional := FALSE;
  1405. InitOperand(result, ModeUndefined);
  1406. Expression(x);
  1407. op := result;
  1408. LoadValue(op,x.type.resolved);
  1409. conditional := prevConditional;
  1410. END Evaluate;
  1411. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1412. VAR prevConditional: BOOLEAN;
  1413. BEGIN
  1414. prevConditional := conditional;
  1415. conditional := FALSE;
  1416. InitOperand(result,ModeUndefined);
  1417. Expression(x);
  1418. op := result;
  1419. (*
  1420. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1421. *)
  1422. conditional := prevConditional;
  1423. END Designate;
  1424. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1425. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1426. BEGIN
  1427. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1428. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1429. conditional := TRUE;
  1430. trueLabel := trueL; falseLabel := falseL;
  1431. Expression(x);
  1432. trueL := trueLabel; falseL := falseLabel;
  1433. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1434. END Condition;
  1435. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1436. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1437. BEGIN
  1438. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1439. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1440. RETURN op
  1441. END NewRegisterOperand;
  1442. PROCEDURE UnuseRegister(register: LONGINT);
  1443. BEGIN
  1444. IF (register > 0) THEN
  1445. register := registerUsageCount.Map(register);
  1446. registerUsageCount.DecUse(register);
  1447. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1448. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1449. END;
  1450. IF registerUsageCount.Use(register)=0 THEN
  1451. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1452. Warning(position, "register cannot be removed");
  1453. END;
  1454. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1455. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1456. END;
  1457. ELSIF registerUsageCount.Use(register)<0 THEN
  1458. Warning(position, "register removed too often");
  1459. IF dump # NIL THEN
  1460. dump.String("register removed too often"); dump.Ln; dump.Update;
  1461. END;
  1462. D.TraceBack;
  1463. END;
  1464. END;
  1465. END UnuseRegister;
  1466. PROCEDURE UseRegister(register: LONGINT);
  1467. BEGIN
  1468. IF (register > 0) THEN
  1469. register := registerUsageCount.Map(register);
  1470. registerUsageCount.IncUse(register);
  1471. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1472. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1473. END;
  1474. IF registerUsageCount.Use(register)=1 THEN
  1475. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1476. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1477. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1478. END;
  1479. END;
  1480. END;
  1481. END UseRegister;
  1482. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1483. BEGIN
  1484. UnuseRegister(op.register)
  1485. END ReleaseIntermediateOperand;
  1486. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1487. BEGIN
  1488. UseRegister(op.register)
  1489. END UseIntermediateOperand;
  1490. PROCEDURE ReleaseOperand(CONST op: Operand);
  1491. BEGIN
  1492. UnuseRegister(op.op.register);
  1493. UnuseRegister(op.tag.register);
  1494. UnuseRegister(op.extra.register);
  1495. END ReleaseOperand;
  1496. (* save registers marked in array "markedRegisters" to the stack
  1497. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1498. *)
  1499. PROCEDURE SaveRegisters();
  1500. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1501. BEGIN
  1502. entry := usedRegisters;
  1503. WHILE entry # NIL DO
  1504. type := registerUsageCount.used[entry.register].type;
  1505. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1506. Emit(Push(position,op));
  1507. entry := entry.next;
  1508. END;
  1509. END SaveRegisters;
  1510. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1511. BEGIN
  1512. saved := usedRegisters;
  1513. usedRegisters := NIL;
  1514. END ReleaseUsedRegisters;
  1515. (** remove parameter registers from used queue *)
  1516. PROCEDURE ReleaseParameterRegisters;
  1517. VAR entry,prev,next: RegisterEntry;
  1518. BEGIN
  1519. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1520. WHILE entry # NIL DO
  1521. next := entry.next;
  1522. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1523. registerUsageCount.DecUse(entry.register);
  1524. ASSERT(registerUsageCount.Use(entry.register)=0);
  1525. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1526. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1527. END;
  1528. ELSIF prev = NIL THEN
  1529. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1530. ELSE
  1531. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1532. END;
  1533. entry := next;
  1534. END;
  1535. END ReleaseParameterRegisters;
  1536. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1537. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1538. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1539. BEGIN
  1540. entry := saved;
  1541. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1542. entry := prev;
  1543. WHILE entry # NIL DO
  1544. prev := entry.prev;
  1545. type := entry.type;
  1546. class := entry.registerClass;
  1547. IntermediateCode.InitRegister(op,type,class,entry.register);
  1548. (*
  1549. new := registerUsageCount.Next(type,class);
  1550. registerUsageCount.Remap(entry.register,new);
  1551. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1552. dump.String("remap register "); dump.Int(entry.register,1);
  1553. dump.String("to "); dump.Int(new,1);
  1554. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1555. END;
  1556. entry.register := new;
  1557. *)
  1558. Emit(Pop(position,op));
  1559. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1560. entry := prev;
  1561. END;
  1562. (*
  1563. usedRegisters := saved;
  1564. *)
  1565. END RestoreRegisters;
  1566. PROCEDURE CheckRegistersFree;
  1567. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1568. BEGIN
  1569. IF usedRegisters # NIL THEN
  1570. r := usedRegisters;
  1571. WHILE r # NIL DO
  1572. warning := "register ";
  1573. Strings.AppendInt(warning, r.register);
  1574. Strings.Append(warning, " not released.");
  1575. Warning(position,warning);
  1576. r := r .next;
  1577. END;
  1578. END;
  1579. FOR i := 0 TO registerUsageCount.count-1 DO
  1580. IF registerUsageCount.used[i].count < 0 THEN
  1581. warning := "register ";
  1582. Strings.AppendInt(warning, i);
  1583. Strings.Append(warning, " unused too often.");
  1584. Warning(position,warning);
  1585. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1586. warning := "register ";
  1587. Strings.AppendInt(warning, i);
  1588. Strings.Append(warning, " not unused often enough.");
  1589. Warning(position,warning);
  1590. END;
  1591. END;
  1592. END CheckRegistersFree;
  1593. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1594. Otherwise allocate a new register.
  1595. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1596. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1597. BEGIN
  1598. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1599. UseIntermediateOperand(result);
  1600. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1601. UseIntermediateOperand(result);
  1602. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1603. END;
  1604. END Reuse2;
  1605. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1606. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1607. If not then allocate a new register.
  1608. Does NOT necessarily keep the content of src1 or src2 in result!
  1609. *)
  1610. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1611. BEGIN
  1612. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1613. UseIntermediateOperand(result);
  1614. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1615. UseIntermediateOperand(result);
  1616. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1617. result := alternative; alternative := emptyOperand;
  1618. UseIntermediateOperand(result);
  1619. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1620. END;
  1621. END Reuse2a;
  1622. (* like reuse2 but only one source *)
  1623. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1624. BEGIN
  1625. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1626. UseIntermediateOperand(result);
  1627. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1628. END;
  1629. END Reuse1;
  1630. (* like reuse2a but only one source *)
  1631. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1632. BEGIN
  1633. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1634. UseIntermediateOperand(result);
  1635. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1636. UseIntermediateOperand(result);
  1637. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1638. END;
  1639. END Reuse1a;
  1640. (* like reuse1 but guarantees that content of src1 is in result *)
  1641. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1642. BEGIN
  1643. IF ReusableRegister(src1) THEN
  1644. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1645. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1646. UseIntermediateOperand(result);
  1647. ELSE
  1648. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1649. Emit(Mov(position,result,src1));
  1650. END
  1651. END ReuseCopy;
  1652. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1653. BEGIN
  1654. IF ReusableRegister(src) THEN
  1655. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1656. ELSE
  1657. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1658. Emit(Mov(position,result,src));
  1659. ReleaseIntermediateOperand(src);
  1660. END
  1661. END TransferToRegister;
  1662. (** labels and branches **)
  1663. PROCEDURE NewLabel(): Label;
  1664. VAR label: Label;
  1665. BEGIN
  1666. NEW(label,section); RETURN label;
  1667. END NewLabel;
  1668. PROCEDURE SetLabel(label: Label);
  1669. BEGIN label.Resolve(section.pc);
  1670. END SetLabel;
  1671. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1672. BEGIN
  1673. ASSERT(label # NIL);
  1674. IF label.pc < 0 THEN (* label not yet set *)
  1675. label.AddFixup(section.pc);
  1676. END;
  1677. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1678. END LabelOperand;
  1679. PROCEDURE BrL(label: Label);
  1680. BEGIN
  1681. Emit(Br(position,LabelOperand(label)));
  1682. END BrL;
  1683. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1684. BEGIN
  1685. Emit(Brge(position,LabelOperand(label),left,right));
  1686. END BrgeL;
  1687. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1688. BEGIN
  1689. Emit(Brlt(position,LabelOperand(label),left,right));
  1690. END BrltL;
  1691. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1692. BEGIN
  1693. Emit(Breq(position,LabelOperand(label),left,right));
  1694. END BreqL;
  1695. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1696. BEGIN
  1697. Emit(Brne(position,LabelOperand(label),left,right));
  1698. END BrneL;
  1699. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1700. VAR new: IntermediateCode.Operand;
  1701. BEGIN
  1702. IF Trace THEN TraceEnter("Convert") END;
  1703. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1704. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1705. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1706. & (operand.offset = 0)
  1707. THEN
  1708. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1709. Emit(Conv(position,new,operand));
  1710. ELSE
  1711. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1712. Emit(Conv(position,new,operand));
  1713. ReleaseIntermediateOperand(operand);
  1714. END;
  1715. operand := new;
  1716. 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
  1717. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1718. ELSE
  1719. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1720. Emit(Conv(position,new,operand));
  1721. ReleaseIntermediateOperand(operand);
  1722. operand := new;
  1723. END;
  1724. IF Trace THEN TraceExit("Convert") END;
  1725. END Convert;
  1726. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1727. VAR exit: Label;
  1728. BEGIN
  1729. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1730. exit := NewLabel();
  1731. br(exit,left,right);
  1732. EmitTrap(position,trapNo);
  1733. SetLabel(exit);
  1734. END TrapC;
  1735. (** expressions *)
  1736. (** emit necessary runtime check for set elements **)
  1737. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1738. VAR max: IntermediateCode.Operand;
  1739. BEGIN
  1740. IF isUnchecked THEN RETURN END;
  1741. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1742. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1743. TrapC(BrgeL, max, o, SetElementTrap);
  1744. END;
  1745. END CheckSetElement;
  1746. (** the set that a range represents **)
  1747. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1748. VAR
  1749. operand: Operand;
  1750. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1751. BEGIN
  1752. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1753. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1754. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1755. one := IntermediateCode.Immediate(setType, 1);
  1756. Evaluate(x, operand);
  1757. Convert(operand.op, setType);
  1758. Convert(operand.tag, setType);
  1759. CheckSetElement(operand.op);
  1760. CheckSetElement(operand.tag);
  1761. (* create mask for lower bound
  1762. i.e. shift 11111111 to the left by the value of the lower bound
  1763. *)
  1764. Reuse1(temp, operand.op);
  1765. Emit(Shl(position,temp, allBits, operand.op));
  1766. ReleaseIntermediateOperand(operand.op);
  1767. operand.op := temp;
  1768. (* create mask for upper bound
  1769. i.e. shift 11111111 to the right by the difference between the
  1770. upper bound and the maximum number of set elements
  1771. *)
  1772. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1773. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1774. Reuse1(temp, operand.tag);
  1775. ELSE
  1776. Reuse1(temp, operand.tag);
  1777. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1778. Emit(Sub(position,temp, size, operand.tag));
  1779. END;
  1780. Emit(Shr(position,temp, allBits, operand.tag));
  1781. ReleaseIntermediateOperand(operand.tag);
  1782. operand.tag := temp;
  1783. Reuse2(resultingSet, operand.op, operand.tag);
  1784. (* intersect the two masks *)
  1785. Emit(And(position,resultingSet, operand.op, operand.tag));
  1786. ReleaseOperand(operand);
  1787. RETURN resultingSet
  1788. END SetFromRange;
  1789. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1790. VAR
  1791. res, operand: Operand;
  1792. temp, one, noBits, dest: IntermediateCode.Operand;
  1793. expression: SyntaxTree.Expression;
  1794. i: LONGINT;
  1795. BEGIN
  1796. IF Trace THEN TraceEnter("VisitSet") END;
  1797. dest := destination;
  1798. destination := emptyOperand;
  1799. noBits := IntermediateCode.Immediate(setType, 0);
  1800. one := IntermediateCode.Immediate(setType, 1);
  1801. (* start off with the empty set *)
  1802. InitOperand(res, ModeValue);
  1803. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1804. Emit(Mov(position,res.op, noBits));
  1805. FOR i := 0 TO x.elements.Length() - 1 DO
  1806. expression := x.elements.GetExpression(i);
  1807. IF expression IS SyntaxTree.RangeExpression THEN
  1808. (* range of set elements *)
  1809. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1810. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1811. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1812. ReleaseIntermediateOperand(temp)
  1813. ELSE
  1814. (* singelton element *)
  1815. Evaluate(expression, operand);
  1816. Convert(operand.op, setType);
  1817. CheckSetElement(operand.op);
  1818. (* create subset containing single element *)
  1819. Reuse1(temp, operand.op);
  1820. Emit(Shl(position,temp, one, operand.op));
  1821. ReleaseOperand(operand);
  1822. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1823. ReleaseIntermediateOperand(temp);
  1824. END
  1825. END;
  1826. result := res;
  1827. destination := dest;
  1828. IF Trace THEN TraceExit("VisitSet") END;
  1829. END VisitSet;
  1830. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1831. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1832. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1833. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1834. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1835. element: SyntaxTree.IntegerValue;
  1836. BEGIN
  1837. numberElements := x.elements.Length();
  1838. expression := index.parameters.GetExpression(dim);
  1839. element := expression(SyntaxTree.IntegerValue);
  1840. FOR i := 0 TO numberElements-1 DO
  1841. expression := x.elements.GetExpression(i);
  1842. element.SetValue(i);
  1843. IF expression IS SyntaxTree.MathArrayExpression THEN
  1844. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1845. ELSE
  1846. Assign(index,expression);
  1847. END;
  1848. END;
  1849. END RecursiveAssignment;
  1850. BEGIN
  1851. variable := GetTemporaryVariable(x.type, FALSE);
  1852. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1853. designator.SetType(variable.type);
  1854. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1855. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1856. FOR i := 0 TO dim-1 DO
  1857. element := SyntaxTree.NewIntegerValue(x.position,0);
  1858. element.SetType(system.longintType);
  1859. index.parameters.AddExpression(element);
  1860. END;
  1861. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1862. RecursiveAssignment(x,0);
  1863. Expression(designator);
  1864. END VisitMathArrayExpression;
  1865. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1866. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1867. BEGIN
  1868. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1869. dest := destination; destination := emptyOperand;
  1870. IF x.operator = Scanner.Not THEN
  1871. IF conditional THEN
  1872. Condition(x.left,falseLabel,trueLabel)
  1873. ELSE
  1874. Evaluate(x.left,operand);
  1875. InitOperand(result,ModeValue);
  1876. Reuse1a(result.op,operand.op,dest);
  1877. Emit(Xor(position,result.op,operand.op,true));
  1878. ReleaseOperand(operand);
  1879. END;
  1880. ELSIF x.operator = Scanner.Minus THEN
  1881. Evaluate(x.left,operand);
  1882. InitOperand(result,ModeValue);
  1883. Reuse1a(result.op,operand.op,dest);
  1884. type := x.left.type.resolved;
  1885. IF type IS SyntaxTree.SetType THEN
  1886. Emit(Not(position,result.op,operand.op));
  1887. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1888. Reuse1(result.tag,operand.tag);
  1889. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1890. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1891. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1892. Emit(Neg(position,result.op,operand.op));
  1893. ELSE HALT(200)
  1894. END;
  1895. ReleaseOperand(operand);
  1896. ELSIF x.operator = Scanner.Address THEN
  1897. Designate(x.left,operand);
  1898. operand.mode := ModeValue;
  1899. t0 := x.left.type.resolved;
  1900. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1901. ReleaseIntermediateOperand(operand.op);
  1902. operand.op := operand.tag;
  1903. IntermediateCode.InitOperand(operand.tag);
  1904. END;
  1905. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1906. result := operand;
  1907. ELSE HALT(100)
  1908. END;
  1909. destination := dest;
  1910. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1911. END VisitUnaryExpression;
  1912. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1913. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1914. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1915. BEGIN
  1916. type := type.resolved;
  1917. originalType := type;
  1918. IF type IS SyntaxTree.PointerType THEN
  1919. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1920. END;
  1921. IF type IS SyntaxTree.ObjectType THEN
  1922. BrL(trueL);
  1923. ELSE
  1924. ASSERT(type IS SyntaxTree.RecordType);
  1925. (*
  1926. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1927. *)
  1928. ReuseCopy(left,tag);
  1929. right := TypeDescriptorAdr(type);
  1930. IF ~newObjectFile THEN
  1931. IntermediateCode.MakeMemory(right,addressType);
  1932. END;
  1933. IF backend.cooperative THEN
  1934. repeatL := NewLabel();
  1935. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1936. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1937. END;
  1938. SetLabel(repeatL);
  1939. BreqL(trueL,left,right);
  1940. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1941. BrneL(repeatL,left,nil);
  1942. ELSIF meta.simple THEN
  1943. level := type(SyntaxTree.RecordType).Level();
  1944. (* get type desc tag of level relative to base tag *)
  1945. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1946. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1947. IntermediateCode.MakeMemory(left,addressType);
  1948. BreqL(trueL,left,right);
  1949. ELSE
  1950. level := type(SyntaxTree.RecordType).Level();
  1951. (* get type desc tag of level relative to base tag *)
  1952. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1953. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1954. IntermediateCode.MakeMemory(left,addressType);
  1955. BreqL(trueL,left,right);
  1956. END;
  1957. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1958. BrL(falseL);
  1959. END;
  1960. END TypeTest;
  1961. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1962. BEGIN
  1963. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1964. IF dump # NIL THEN
  1965. dump.String(s); dump.Ln;
  1966. END;
  1967. END Error;
  1968. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1969. BEGIN
  1970. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1971. IF dump # NIL THEN
  1972. dump.String(s); dump.Ln; dump.Update;
  1973. END;
  1974. END Warning;
  1975. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1976. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1977. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1978. operand:Operand;
  1979. BEGIN
  1980. previousSection := section;
  1981. Global.GetModuleName(mod,name);
  1982. Strings.Append(name,".@Trace");
  1983. Basic.ToSegmentedName(name, pooledName);
  1984. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1985. IF dump # NIL THEN dump := section.comments END;
  1986. variable := mod.moduleScope.firstVariable;
  1987. WHILE variable # NIL DO
  1988. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1989. Symbol(variable, operand);
  1990. register := operand.op;
  1991. CallTraceMethod(register, variable.type);
  1992. ReleaseIntermediateOperand(register);
  1993. END;
  1994. variable := variable.nextVariable;
  1995. END;
  1996. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1997. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1998. Emit(Br(position,op));
  1999. INC(statCoopTraceModule, section.pc);
  2000. section := previousSection;
  2001. IF dump # NIL THEN dump := section.comments END;
  2002. END CreateTraceModuleMethod;
  2003. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2004. BEGIN
  2005. Emit (Push(position, dst));
  2006. Emit (Push(position, src));
  2007. CallThis(position,"GarbageCollector","Assign", 2);
  2008. END CallAssignPointer;
  2009. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2010. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2011. BEGIN
  2012. IF SemanticChecker.IsPointerType (type) THEN
  2013. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2014. ELSIF type.IsRecordType() THEN
  2015. Emit (Push(position,dst));
  2016. Emit (Push(position,src));
  2017. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2018. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2019. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2020. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2021. ELSIF IsStaticArray(type) THEN
  2022. size := StaticArrayNumElements(type);
  2023. base := StaticArrayBaseType(type);
  2024. IF base.IsRecordType() THEN
  2025. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2026. Emit (Push(position, dst));
  2027. Emit (Push(position, src));
  2028. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2029. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2030. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2031. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2032. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2033. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2034. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2035. Emit (Push(position, dst));
  2036. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2037. Emit (Push(position, src));
  2038. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2039. ELSE
  2040. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2041. Emit (Push(position, dst));
  2042. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2043. Emit (Push(position, src));
  2044. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2045. ASSERT(StaticArrayBaseType(type).IsPointer());
  2046. END;
  2047. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2048. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2049. Emit (Push(position, dst));
  2050. Emit (Push(position, src));
  2051. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2052. ELSE HALT(100); (* missing ? *)
  2053. END;
  2054. END CallAssignMethod;
  2055. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2056. VAR name: Basic.SegmentedName;
  2057. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2058. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2059. context: Context;
  2060. BEGIN
  2061. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2062. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2063. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2064. GetRecordTypeName (recordType,name);
  2065. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2066. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2067. IF dump # NIL THEN dump := section.comments END;
  2068. variable := recordType.recordScope.firstVariable;
  2069. WHILE variable # NIL DO
  2070. IF variable.NeedsTrace() THEN
  2071. dst := NewRegisterOperand (addressType);
  2072. src := NewRegisterOperand (addressType);
  2073. Emit (Mov(position, dst, parameter1));
  2074. Emit (Mov(position, src, parameter2));
  2075. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2076. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2077. CallAssignMethod(dst, src, variable.type);
  2078. ReleaseIntermediateOperand(src);
  2079. ReleaseIntermediateOperand(dst);
  2080. END;
  2081. variable := variable.nextVariable;
  2082. END;
  2083. recordBase := recordType.GetBaseRecord();
  2084. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2085. GetRecordTypeName (recordBase,name);
  2086. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2087. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2088. Emit(Br(position,op));
  2089. ELSE
  2090. Emit(Exit(position,0,0));
  2091. END;
  2092. IF ~recordType.isObject THEN
  2093. GetRecordTypeName (recordType,name);
  2094. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2095. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2096. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2097. NEW(registerUsageCount);
  2098. usedRegisters := NIL;
  2099. dst := NewRegisterOperand (addressType);
  2100. src := NewRegisterOperand (addressType);
  2101. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2102. Emit(Mov(position, dst, parameter1));
  2103. Emit(Mov(position, src, parameter2));
  2104. label := NewLabel();
  2105. SetLabel(label);
  2106. Emit(Push(position, dst));
  2107. Emit(Push(position, src));
  2108. GetRecordTypeName (recordType,name);
  2109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2110. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2111. Emit(Call(position, op, 0));
  2112. Emit(Pop(position, src));
  2113. Emit(Pop(position, dst));
  2114. Emit(Add(position, dst, dst, ofs));
  2115. Emit(Add(position, src, src, ofs));
  2116. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2117. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2118. Emit(Exit(position,0,0));
  2119. END;
  2120. INC(statCoopAssignProcedure, section.pc);
  2121. ReturnToContext(context);
  2122. IF dump # NIL THEN dump := section.comments END;
  2123. END CreateAssignProcedure;
  2124. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2125. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2126. BEGIN
  2127. IF IsUnsafePointer (type) THEN
  2128. skip := NewLabel();
  2129. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2130. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2131. BreqL (skip, op, nil);
  2132. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2133. SetLabel (skip);
  2134. ELSIF SemanticChecker.IsPointerType (type) THEN
  2135. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2136. CallThis(position,"GarbageCollector","Mark", 1);
  2137. ELSIF type.IsRecordType() THEN
  2138. Emit (Push(position,register));
  2139. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2140. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2141. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2142. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2143. ELSIF IsStaticArray(type) THEN
  2144. size := StaticArrayNumElements(type);
  2145. base := StaticArrayBaseType(type);
  2146. IF base.IsRecordType() THEN
  2147. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2148. Emit (Push(position, register));
  2149. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2150. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2151. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2152. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2153. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2154. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2155. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2156. Emit (Push(position, register));
  2157. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2158. ELSE
  2159. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2160. Emit (Push(position, register));
  2161. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2162. ASSERT(base.IsPointer());
  2163. END;
  2164. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2165. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2166. CallThis(position,"GarbageCollector","Mark", 1);
  2167. ELSE HALT(100); (* missing ? *)
  2168. END;
  2169. END CallTraceMethod;
  2170. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2171. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2172. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2173. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2174. BEGIN
  2175. previousSection := section;
  2176. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2177. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2178. GetRecordTypeName (recordType,name);
  2179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2180. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2181. IF dump # NIL THEN dump := section.comments END;
  2182. variable := recordType.recordScope.firstVariable;
  2183. WHILE variable # NIL DO
  2184. IF variable.NeedsTrace() THEN
  2185. register := NewRegisterOperand (addressType);
  2186. Emit (Mov(position,register,parameter1));
  2187. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2188. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2189. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2190. END;
  2191. CallTraceMethod(register, variable.type);
  2192. ReleaseIntermediateOperand(register);
  2193. END;
  2194. variable := variable.nextVariable;
  2195. END;
  2196. recordBase := recordType.GetBaseRecord();
  2197. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2198. recordBase := recordBase.GetBaseRecord();
  2199. END;
  2200. IF recordBase # NIL THEN
  2201. GetRecordTypeName (recordBase,name);
  2202. IF HasExplicitTraceMethod (recordBase) THEN
  2203. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2204. ELSE
  2205. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2206. END;
  2207. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2208. Emit(Br(position,op));
  2209. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2210. Emit(Exit(position,0,0));
  2211. ELSE
  2212. IF recordType.isObject THEN
  2213. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2214. ELSE
  2215. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2216. END;
  2217. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2218. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2219. Emit(Br(position,op));
  2220. END;
  2221. IF ~recordType.isObject THEN
  2222. GetRecordTypeName (recordType,name);
  2223. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2224. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2225. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2226. NEW(registerUsageCount);
  2227. usedRegisters := NIL;
  2228. IF dump # NIL THEN dump := section.comments END;
  2229. register := NewRegisterOperand (addressType);
  2230. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2231. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2232. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2233. END;
  2234. Emit (Push(position,register));
  2235. GetRecordTypeName (recordType,name);
  2236. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2237. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2238. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2239. ReleaseIntermediateOperand(register);
  2240. Emit(Exit(position,0,0));
  2241. GetRecordTypeName (recordType,name);
  2242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2243. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2244. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2245. NEW(registerUsageCount);
  2246. usedRegisters := NIL;
  2247. register := NewRegisterOperand (addressType);
  2248. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2249. Emit(Mov(position, register, parameter1));
  2250. label := NewLabel();
  2251. SetLabel(label);
  2252. Emit(Push(position, register));
  2253. GetRecordTypeName (recordType,name);
  2254. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2255. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2256. Emit(Call(position, op, 0));
  2257. Emit(Pop(position, register));
  2258. Emit(Add(position, register, register, ofs));
  2259. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2260. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2261. Emit(Exit(position,0,0));
  2262. END;
  2263. INC(statCoopTraceMethod, section.pc);
  2264. ReturnToContext(context);
  2265. IF dump # NIL THEN dump := section.comments END;
  2266. END CreateTraceMethod;
  2267. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2268. VAR name: Basic.SegmentedName;
  2269. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2270. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2271. context: Context;
  2272. BEGIN
  2273. IF recordType.isObject THEN RETURN END;
  2274. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2275. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2276. GetRecordTypeName (recordType,name);
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2278. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2279. IF dump # NIL THEN dump := section.comments END;
  2280. variable := recordType.recordScope.firstVariable;
  2281. WHILE variable # NIL DO
  2282. IF variable.NeedsTrace() THEN
  2283. dst := NewRegisterOperand (addressType);
  2284. Emit (Mov(position, dst, parameter1));
  2285. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2286. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2287. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2288. END;
  2289. CallResetProcedure(dst, nil, variable.type);
  2290. ReleaseIntermediateOperand(dst);
  2291. END;
  2292. variable := variable.nextVariable;
  2293. END;
  2294. recordBase := recordType.GetBaseRecord();
  2295. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2296. GetRecordTypeName (recordBase,name);
  2297. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2298. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2299. Emit(Br(position,op));
  2300. ELSE
  2301. Emit(Exit(position,0,0));
  2302. END;
  2303. GetRecordTypeName (recordType,name);
  2304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2305. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2306. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2307. NEW(registerUsageCount);
  2308. usedRegisters := NIL;
  2309. dst := NewRegisterOperand (addressType);
  2310. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2311. Emit(Mov(position, dst, parameter1));
  2312. label := NewLabel();
  2313. SetLabel(label);
  2314. Emit(Push(position, dst));
  2315. GetRecordTypeName (recordType,name);
  2316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2317. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2318. Emit(Call(position, op, 0));
  2319. Emit(Pop(position, dst));
  2320. Emit(Add(position, dst, dst, ofs));
  2321. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2322. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2323. Emit(Exit(position,0,0));
  2324. INC(statCoopResetProcedure, section.pc);
  2325. ReturnToContext(context);
  2326. IF dump # NIL THEN dump := section.comments END;
  2327. END CreateResetProcedure;
  2328. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2329. VAR name: Basic.SegmentedName; context: Context;
  2330. BEGIN
  2331. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2333. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2334. IF dump # NIL THEN dump := section.comments END;
  2335. Emit(Push(position,fp));
  2336. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2337. ResetVariables(scope);
  2338. Emit(Pop(position,fp));
  2339. Emit(Exit(position,0,0));
  2340. ReturnToContext(context);
  2341. IF dump # NIL THEN dump := section.comments END;
  2342. END CreateResetMethod;
  2343. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2344. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2345. BEGIN
  2346. IF SemanticChecker.IsPointerType (type) THEN
  2347. Emit (Push(position, dest));
  2348. CallThis(position,"GarbageCollector","Reset", 1);
  2349. ELSIF type.IsRecordType() THEN
  2350. Emit (Push(position, dest));
  2351. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2353. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2354. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2355. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2356. size := GetArrayLength(type, tag);
  2357. base := ArrayBaseType(type);
  2358. IF base.IsRecordType() THEN
  2359. Emit (Push(position, size));
  2360. Emit (Push(position, dest));
  2361. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2362. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2363. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2364. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2365. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2366. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2367. Emit (Push(position, size));
  2368. Emit (Push(position, dest));
  2369. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2370. ELSE
  2371. Emit (Push(position, size));
  2372. Emit (Push(position, dest));
  2373. CallThis(position,"GarbageCollector","ResetArray", 2);
  2374. ASSERT(ArrayBaseType(type).IsPointer());
  2375. END;
  2376. ReleaseIntermediateOperand(size);
  2377. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2378. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2379. Emit (Push(position, dest));
  2380. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2381. ELSE HALT(100); (* missing ? *)
  2382. END;
  2383. END CallResetProcedure;
  2384. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2385. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2386. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2387. VAR operand: Operand;
  2388. BEGIN
  2389. Symbol (symbol, operand);
  2390. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2391. ReleaseOperand(operand);
  2392. END Reset;
  2393. BEGIN
  2394. previousScope := currentScope;
  2395. currentScope := scope;
  2396. pc := section.pc;
  2397. variable := scope.firstVariable;
  2398. WHILE variable # NIL DO
  2399. IF variable.NeedsTrace() THEN
  2400. Reset (variable);
  2401. END;
  2402. variable := variable.nextVariable;
  2403. END;
  2404. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2405. WHILE parameter # NIL DO
  2406. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2407. Reset (parameter);
  2408. END;
  2409. parameter := parameter.nextParameter;
  2410. END;
  2411. INC(statCoopResetVariables, section.pc - pc);
  2412. currentScope := previousScope;
  2413. END ResetVariables;
  2414. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2415. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2416. VAR op: IntermediateCode.Operand; context: Context;
  2417. BEGIN
  2418. previousSection := section;
  2419. GetCodeSectionNameForSymbol(procedure, name);
  2420. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2421. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2422. IF dump # NIL THEN dump := section.comments END;
  2423. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2424. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2425. Emit(Data(position,op));
  2426. Emit(Data(position,nil));
  2427. IF HasPointers (procedure.procedureScope) THEN
  2428. GetCodeSectionNameForSymbol(procedure, name);
  2429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2430. ELSE
  2431. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2432. END;
  2433. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2434. Emit(Data(position,op));
  2435. ReturnToContext(context);
  2436. IF dump # NIL THEN dump := section.comments END;
  2437. END CreateProcedureDescriptor;
  2438. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2439. VAR import: SyntaxTree.Import;
  2440. s: Basic.MessageString;
  2441. selfName: SyntaxTree.IdentifierString;
  2442. BEGIN
  2443. moduleScope.ownerModule.GetName(selfName);
  2444. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2445. module := moduleScope.ownerModule
  2446. ELSE
  2447. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2448. IF import = NIL THEN
  2449. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),TRUE);
  2450. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2451. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2452. s := "Module ";
  2453. Strings.Append(s,moduleName);
  2454. Strings.Append(s," cannot be imported.");
  2455. IF force THEN
  2456. Error(position,s);
  2457. ELSIF canBeLoaded THEN
  2458. Strings.Append(s, "=> no dynamic linking.");
  2459. Warning(position, s);
  2460. canBeLoaded := FALSE;
  2461. END;
  2462. RETURN FALSE
  2463. ELSE
  2464. SELF.module.imports.AddName(moduleName)
  2465. END;
  2466. ELSIF import.module = NIL THEN (* already tried *)
  2467. RETURN FALSE
  2468. END;
  2469. module := import.module;
  2470. END;
  2471. RETURN TRUE
  2472. END AddImport;
  2473. (* needed for old binary object file format*)
  2474. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2475. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2476. BEGIN
  2477. IF AddImport(moduleName,module,TRUE) THEN
  2478. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2479. IF procedure = NIL THEN
  2480. s := "Instruction not supported on target, emulation procedure ";
  2481. Strings.Append(s,moduleName);
  2482. Strings.Append(s,".");
  2483. Strings.Append(s,procedureName);
  2484. Strings.Append(s," not present");
  2485. Error(position,s);
  2486. ELSE
  2487. StaticCallOperand(r,procedure);
  2488. ReleaseOperand(r);
  2489. fp := GetFingerprint(procedure);
  2490. END;
  2491. END;
  2492. END EnsureSymbol;
  2493. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2494. VAR exit: Label; trueL,falseL: Label;
  2495. BEGIN
  2496. trueL := NewLabel();
  2497. falseL := NewLabel();
  2498. exit := NewLabel();
  2499. Condition(x,trueL,falseL);
  2500. InitOperand(result,ModeValue);
  2501. SetLabel(trueL);
  2502. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2503. Emit(Mov(position,result.op,true));
  2504. BrL(exit);
  2505. SetLabel(falseL);
  2506. Emit(MovReplace(position,result.op,false));
  2507. SetLabel(exit);
  2508. END ConditionToValue;
  2509. PROCEDURE ValueToCondition(VAR op: Operand);
  2510. BEGIN
  2511. LoadValue(op,system.booleanType);
  2512. BrneL(trueLabel,op.op, false);
  2513. ReleaseOperand(op);
  2514. BrL(falseLabel);
  2515. END ValueToCondition;
  2516. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2517. VAR size: LONGINT;
  2518. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2519. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2520. BEGIN
  2521. ASSERT(type.form = SyntaxTree.Open);
  2522. baseType := type.arrayBase.resolved;
  2523. IF IsOpenArray(baseType) THEN
  2524. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2525. ELSE
  2526. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2527. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2528. END;
  2529. len := tag;
  2530. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2531. IntermediateCode.MakeMemory(len,addressType);
  2532. UseIntermediateOperand(len);
  2533. Reuse2(res,sizeOperand,len);
  2534. Emit(Mul(position,res,sizeOperand,len));
  2535. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2536. RETURN res
  2537. END GetArraySize;
  2538. BEGIN
  2539. type := type.resolved;
  2540. IF IsOpenArray(type) THEN
  2541. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2542. RETURN tag
  2543. ELSE
  2544. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2545. END;
  2546. ELSE
  2547. size := ToMemoryUnits(system,system.SizeOf(type));
  2548. RETURN IntermediateCode.Immediate(addressType,size)
  2549. END;
  2550. END GetDynamicSize;
  2551. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2552. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2553. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2554. BEGIN
  2555. ASSERT(type.form = SyntaxTree.Open);
  2556. baseType := type.arrayBase.resolved;
  2557. IF IsOpenArray(baseType) THEN
  2558. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2559. ELSE
  2560. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2561. END;
  2562. len := tag;
  2563. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2564. IntermediateCode.MakeMemory(len,addressType);
  2565. UseIntermediateOperand(len);
  2566. Reuse2(res,sizeOperand,len);
  2567. Emit(Mul(position,res,sizeOperand,len));
  2568. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2569. RETURN res
  2570. END GetLength;
  2571. BEGIN
  2572. type := type.resolved;
  2573. IF IsOpenArray(type) THEN
  2574. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2575. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2576. ELSE
  2577. RETURN IntermediateCode.Immediate(addressType,1)
  2578. END;
  2579. END GetArrayLength;
  2580. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2581. VAR result: IntermediateCode.Operand;
  2582. BEGIN
  2583. IF backend.cooperative THEN
  2584. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2585. ELSE
  2586. MakeMemory(result, tag, addressType, 0);
  2587. END;
  2588. RETURN result
  2589. END GetSizeFromTag;
  2590. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2591. VAR parameter: SyntaxTree.Parameter;
  2592. BEGIN
  2593. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2594. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2595. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2596. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2597. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2598. END;
  2599. RETURN GetDynamicSize(e.type, tag);
  2600. END GetArrayOfBytesSize;
  2601. (*
  2602. to find imported symbol. not needed ?
  2603. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2604. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2605. BEGIN
  2606. IF AddImport(moduleName,importedModule,FALSE) THEN
  2607. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2608. RETURN symbol
  2609. ELSE
  2610. RETURN NIL
  2611. END
  2612. END SymbolByName;
  2613. *)
  2614. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2615. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2616. BEGIN
  2617. IF AddImport(moduleName,runtimeModule,force) THEN
  2618. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2619. IF procedure = NIL THEN
  2620. s := "Procedure ";
  2621. Strings.Append(s,moduleName);
  2622. Strings.Append(s,".");
  2623. Strings.Append(s,procedureName);
  2624. Strings.Append(s," not present");
  2625. Error(position,s);
  2626. RETURN FALSE
  2627. ELSE
  2628. RETURN TRUE
  2629. END;
  2630. ELSE RETURN FALSE
  2631. END;
  2632. END GetRuntimeProcedure;
  2633. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2634. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2635. s: Basic.MessageString;
  2636. BEGIN
  2637. Basic.InitSegmentedName(name);
  2638. name[0] := Basic.MakeString(moduleName);
  2639. name[1] := Basic.MakeString(typeName);
  2640. name[2] := -1;
  2641. IF AddImport(moduleName,importedModule, FALSE) THEN
  2642. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2643. IF symbol = NIL THEN
  2644. s := "type ";
  2645. Strings.Append(s,moduleName);
  2646. Strings.Append(s,".");
  2647. Strings.Append(s,typeName);
  2648. Strings.Append(s," not present");
  2649. Error(position,s);
  2650. END;
  2651. ELSE symbol := NIL;
  2652. END;
  2653. IF importedModule = moduleScope.ownerModule THEN
  2654. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2655. ELSE
  2656. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2657. END;
  2658. RETURN symbol
  2659. END GetTypeDescriptor;
  2660. (* 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. *)
  2661. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2662. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2663. pooledName: Basic.SegmentedName; size: LONGINT;
  2664. BEGIN
  2665. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2666. StaticCallOperand(result,procedure);
  2667. IF numberParameters < 0 THEN
  2668. size := ProcedureParametersSize(system,procedure);
  2669. ELSE
  2670. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2671. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2672. Error(position,"runtime call parameter count mismatch");
  2673. END;
  2674. END;
  2675. Emit(Call(position, result.op, size));
  2676. ReleaseOperand(result);
  2677. ELSE (* only static linking possible *)
  2678. ASSERT(numberParameters >= 0);
  2679. Basic.InitSegmentedName(pooledName);
  2680. pooledName[0] := Basic.MakeString(moduleName);
  2681. pooledName[1] := Basic.MakeString(procedureName);
  2682. pooledName[2] := -1;
  2683. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2684. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2685. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2686. END;
  2687. END CallThisChecked;
  2688. (* 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. *)
  2689. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2690. BEGIN
  2691. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2692. END CallThis;
  2693. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2694. VAR
  2695. left,right: Operand;
  2696. leftSize, rightSize: IntermediateCode.Operand;
  2697. saved: RegisterEntry;
  2698. reg: IntermediateCode.Operand;
  2699. procedureName: SyntaxTree.IdentifierString;
  2700. BEGIN
  2701. procedureName := "CompareString";
  2702. SaveRegisters();ReleaseUsedRegisters(saved);
  2703. Designate(leftExpression,left);
  2704. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2705. Emit(Push(position,leftSize));
  2706. ReleaseIntermediateOperand(leftSize);
  2707. Emit(Push(position,left.op));
  2708. ReleaseOperand(left);
  2709. Designate(rightExpression,right);
  2710. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2711. Emit(Push(position,rightSize));
  2712. ReleaseIntermediateOperand(rightSize);
  2713. Emit(Push(position,right.op));
  2714. ReleaseOperand(right);
  2715. IF backend.cooperative THEN
  2716. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2717. ELSE
  2718. CallThis(position,runtimeModuleName,procedureName, 4);
  2719. END;
  2720. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2721. Emit(Result(position,reg));
  2722. (*
  2723. AcquireThisRegister(int8,IntermediateCode.Result);
  2724. *)
  2725. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2726. (*
  2727. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2728. *)
  2729. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2730. ReleaseIntermediateOperand(reg);
  2731. BrL(falseLabel);
  2732. END CompareString;
  2733. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2734. VAR
  2735. left,right: Operand;
  2736. leftSize, rightSize: IntermediateCode.Operand;
  2737. saved: RegisterEntry;
  2738. procedureName: SyntaxTree.IdentifierString;
  2739. BEGIN
  2740. procedureName := "CopyString";
  2741. SaveRegisters();ReleaseUsedRegisters(saved);
  2742. Designate(leftExpression,left);
  2743. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2744. Emit(Push(position,leftSize));
  2745. ReleaseIntermediateOperand(leftSize);
  2746. Emit(Push(position,left.op));
  2747. ReleaseOperand(left);
  2748. Designate(rightExpression,right);
  2749. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2750. Emit(Push(position,rightSize));
  2751. ReleaseIntermediateOperand(rightSize);
  2752. Emit(Push(position,right.op));
  2753. ReleaseOperand(right);
  2754. IF backend.cooperative THEN
  2755. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2756. ELSE
  2757. CallThis(position,runtimeModuleName,procedureName,4);
  2758. END;
  2759. RestoreRegisters(saved);
  2760. END CopyString;
  2761. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2762. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2763. leftType,rightType: SyntaxTree.Type;
  2764. leftExpression,rightExpression : SyntaxTree.Expression;
  2765. componentType: IntermediateCode.Type;
  2766. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2767. size: LONGINT;
  2768. BEGIN
  2769. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2770. dest := destination; destination := emptyOperand;
  2771. leftType := x.left.type.resolved;
  2772. rightType := x.right.type.resolved;
  2773. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2774. CASE x.operator OF
  2775. Scanner.Or:
  2776. (* shortcut evaluation of left OR right *)
  2777. IF ~conditional THEN ConditionToValue(x);
  2778. ELSE
  2779. next := NewLabel();
  2780. Condition(x.left,trueLabel,next);
  2781. SetLabel(next);
  2782. Condition(x.right,trueLabel,falseLabel);
  2783. END;
  2784. |Scanner.And:
  2785. (* shortcut evaluation of left & right *)
  2786. IF ~conditional THEN ConditionToValue(x);
  2787. ELSE
  2788. next := NewLabel();
  2789. Condition(x.left,next,falseLabel);
  2790. SetLabel(next);
  2791. Condition(x.right,trueLabel,falseLabel);
  2792. END;
  2793. |Scanner.Is:
  2794. IF ~conditional THEN ConditionToValue(x);
  2795. ELSE
  2796. (* get type desc tag *)
  2797. IF IsPointerToRecord(leftType,recordType) THEN
  2798. Evaluate(x.left,left);
  2799. Dereference(left,recordType,IsUnsafePointer(leftType))
  2800. ELSE
  2801. Designate(x.left,left);
  2802. END;
  2803. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2804. ReleaseOperand(left);
  2805. END;
  2806. |Scanner.Plus:
  2807. Evaluate(x.left,left);
  2808. Evaluate(x.right,right);
  2809. IF leftType IS SyntaxTree.SetType THEN
  2810. InitOperand(result,ModeValue);
  2811. Reuse2a(result.op,left.op,right.op,dest);
  2812. Emit(Or(position,result.op,left.op,right.op));
  2813. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2814. InitOperand(result,ModeValue);
  2815. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2816. Reuse2(result.tag,left.tag,right.tag);
  2817. Emit(Add(position,result.op,left.op,right.op));
  2818. Emit(Add(position,result.tag,left.tag,right.tag))
  2819. ELSE
  2820. InitOperand(result,ModeValue);
  2821. Reuse2a(result.op,left.op,right.op,dest);
  2822. Emit(Add(position,result.op,left.op,right.op));
  2823. END;
  2824. ReleaseOperand(left); ReleaseOperand(right);
  2825. |Scanner.Minus:
  2826. Evaluate(x.left,left);
  2827. Evaluate(x.right,right);
  2828. IF leftType IS SyntaxTree.SetType THEN
  2829. InitOperand(result,ModeValue);
  2830. Reuse1(result.op,right.op);
  2831. Emit(Not(position,result.op,right.op));
  2832. ReleaseOperand(right);
  2833. Emit(And(position,result.op,result.op,left.op));
  2834. ReleaseOperand(left);
  2835. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2836. InitOperand(result,ModeValue);
  2837. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2838. Reuse2(result.tag,left.tag,right.tag);
  2839. Emit(Sub(position,result.op,left.op,right.op));
  2840. Emit(Sub(position,result.tag,left.tag,right.tag));
  2841. ReleaseOperand(left); ReleaseOperand(right)
  2842. ELSE
  2843. InitOperand(result,ModeValue);
  2844. Reuse2a(result.op,left.op,right.op,dest);
  2845. Emit(Sub(position,result.op,left.op,right.op));
  2846. ReleaseOperand(left); ReleaseOperand(right);
  2847. END;
  2848. |Scanner.Times:
  2849. Evaluate(x.left,left);
  2850. Evaluate(x.right,right);
  2851. IF leftType IS SyntaxTree.SetType THEN
  2852. InitOperand(result,ModeValue);
  2853. Reuse2a(result.op,left.op,right.op,dest);
  2854. Emit(And(position,result.op,left.op,right.op));
  2855. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2856. InitOperand(result,ModeValue);
  2857. Reuse1a(result.op,left.op,dest);
  2858. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2859. Emit(Shl(position,result.op,left.op,right.op));
  2860. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2861. InitOperand(result, ModeValue);
  2862. componentType := left.op.type;
  2863. (* TODO: review this *)
  2864. (*
  2865. result.op = left.op * right.op - left.tag * right.tag
  2866. result.tag = left.tag * right.op + left.op * right.tag
  2867. *)
  2868. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2869. Emit(Mul(position,result.op, left.op, right.op));
  2870. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2871. Emit(Mul(position,tempReg, left.tag, right.tag));
  2872. Emit(Sub(position,result.op, result.op, tempReg));
  2873. Reuse2(result.tag, left.tag, right.op);
  2874. Emit(Mul(position,result.tag, left.tag, right.op));
  2875. Emit(Mul(position,tempReg, left.op, right.tag));
  2876. Emit(Add(position,result.tag, result.tag, tempReg));
  2877. ReleaseIntermediateOperand(tempReg)
  2878. ELSE
  2879. InitOperand(result,ModeValue);
  2880. Reuse2a(result.op,left.op,right.op,dest);
  2881. Emit(Mul(position,result.op,left.op,right.op));
  2882. END;
  2883. ReleaseOperand(left); ReleaseOperand(right);
  2884. |Scanner.Div:
  2885. Evaluate(x.left,left);
  2886. Evaluate(x.right,right);
  2887. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2888. InitOperand(result,ModeValue);
  2889. Reuse1a(result.op,left.op,dest);
  2890. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2891. Emit(Shr(position,result.op,left.op,right.op));
  2892. ELSE
  2893. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2894. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2895. IF ~isUnchecked THEN
  2896. exit := NewLabel();
  2897. BrltL(exit,zero,right.op);
  2898. EmitTrap(position,NegativeDivisorTrap);
  2899. SetLabel(exit);
  2900. END;
  2901. END;
  2902. InitOperand(result,ModeValue);
  2903. Reuse2a(result.op,left.op,right.op,dest);
  2904. Emit(Div(position,result.op,left.op,right.op));
  2905. END;
  2906. ReleaseOperand(left); ReleaseOperand(right);
  2907. |Scanner.Mod:
  2908. Evaluate(x.left,left);
  2909. Evaluate(x.right,right);
  2910. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2911. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2912. InitOperand(result,ModeValue);
  2913. Reuse1a(result.op,left.op,dest);
  2914. Emit(And(position,result.op,left.op,right.op));
  2915. ELSE
  2916. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2917. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2918. IF ~isUnchecked THEN
  2919. exit := NewLabel();
  2920. BrltL(exit,zero,right.op);
  2921. EmitTrap(position,NegativeDivisorTrap);
  2922. SetLabel(exit);
  2923. END;
  2924. END;
  2925. InitOperand(result,ModeValue);
  2926. Reuse2a(result.op,left.op,right.op,dest);
  2927. Emit(Mod(position,result.op,left.op,right.op));
  2928. END;
  2929. ReleaseOperand(left); ReleaseOperand(right);
  2930. |Scanner.Slash:
  2931. Evaluate(x.left,left);
  2932. Evaluate(x.right,right);
  2933. IF leftType IS SyntaxTree.SetType THEN
  2934. InitOperand(result,ModeValue);
  2935. Reuse2a(result.op,left.op,right.op,dest);
  2936. Emit(Xor(position,result.op,left.op,right.op));
  2937. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2938. InitOperand(result,ModeValue);
  2939. componentType := left.op.type;
  2940. (* review this *)
  2941. (*
  2942. divisor = right.op * right.op + right.tag * right.tag
  2943. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2944. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2945. *)
  2946. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2947. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2948. Emit(Mul(position,tempReg, right.op, right.op));
  2949. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2950. Emit(Add(position,tempReg, tempReg, tempReg2));
  2951. result.op := tempReg2;
  2952. Emit(Mul(position,result.op, left.op, right.op));
  2953. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2954. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2955. Emit(Add(position,result.op, result.op, tempReg2));
  2956. Emit(Div(position,result.op, result.op, tempReg));
  2957. Reuse2(result.tag, left.tag, right.op);
  2958. Emit(Mul(position,result.tag, left.tag, right.op));
  2959. Emit(Mul(position,tempReg2, left.op, right.tag));
  2960. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2961. Emit(Div(position,result.tag, result.tag, tempReg));
  2962. ReleaseIntermediateOperand(tempReg);
  2963. ReleaseIntermediateOperand(tempReg2)
  2964. ELSE
  2965. InitOperand(result,ModeValue);
  2966. Reuse2a(result.op,left.op,right.op,dest);
  2967. Emit(Div(position,result.op,left.op,right.op));
  2968. END;
  2969. ReleaseOperand(left); ReleaseOperand(right);
  2970. |Scanner.Equal:
  2971. IF ~conditional THEN ConditionToValue(x);
  2972. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2973. CompareString(BreqL,x.left,x.right);
  2974. ELSE
  2975. Evaluate(x.left,left);
  2976. Evaluate(x.right,right);
  2977. IF leftType IS SyntaxTree.RangeType THEN
  2978. ASSERT(rightType IS SyntaxTree.RangeType);
  2979. BrneL(falseLabel, left.op, right.op); (* first *)
  2980. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2981. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2982. ReleaseOperand(left); ReleaseOperand(right);
  2983. BrL(trueLabel)
  2984. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2985. BrneL(falseLabel, left.op, right.op); (* first *)
  2986. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2987. ReleaseOperand(left); ReleaseOperand(right);
  2988. BrL(trueLabel)
  2989. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2990. (* TODO: review this *)
  2991. BrneL(falseLabel, left.op, right.op); (* real part *)
  2992. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2993. ReleaseOperand(left); ReleaseOperand(right);
  2994. BrL(trueLabel)
  2995. ELSE
  2996. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2997. ReleaseOperand(left); ReleaseOperand(right);
  2998. BrL(trueLabel);
  2999. END;
  3000. END;
  3001. |Scanner.LessEqual:
  3002. IF ~conditional THEN ConditionToValue(x);
  3003. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3004. CompareString(BrgeL,x.right,x.left);
  3005. ELSE
  3006. Evaluate(x.left,left);
  3007. Evaluate(x.right,right);
  3008. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3009. Reuse1(temp.op,right.op);
  3010. Emit(And(position,temp.op,left.op,right.op));
  3011. ReleaseOperand(right);
  3012. BreqL(trueLabel,temp.op,left.op);
  3013. BrL(falseLabel);
  3014. ReleaseOperand(temp);ReleaseOperand(left);
  3015. ELSE
  3016. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3017. ReleaseOperand(left); ReleaseOperand(right);
  3018. BrL(trueLabel);
  3019. END;
  3020. END;
  3021. |Scanner.Less:
  3022. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3023. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3024. leftExpression.SetType(system.booleanType);
  3025. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3026. rightExpression.SetType(system.booleanType);
  3027. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3028. leftExpression.SetType(system.booleanType);
  3029. Expression(leftExpression);
  3030. ELSIF ~conditional THEN ConditionToValue(x);
  3031. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3032. CompareString(BrltL,x.left,x.right);
  3033. ELSE
  3034. Evaluate(x.left,left);
  3035. Evaluate(x.right,right);
  3036. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3037. ReleaseOperand(left); ReleaseOperand(right);
  3038. BrL(trueLabel);
  3039. END;
  3040. |Scanner.Greater:
  3041. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3042. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3043. leftExpression.SetType(system.booleanType);
  3044. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3045. rightExpression.SetType(system.booleanType);
  3046. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3047. leftExpression.SetType(system.booleanType);
  3048. Expression(leftExpression);
  3049. ELSIF ~conditional THEN ConditionToValue(x);
  3050. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3051. CompareString(BrltL,x.right,x.left);
  3052. ELSE
  3053. Evaluate(x.left,left);
  3054. Evaluate(x.right,right);
  3055. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3056. ReleaseOperand(left); ReleaseOperand(right);
  3057. BrL(trueLabel);
  3058. END;
  3059. |Scanner.GreaterEqual:
  3060. IF ~conditional THEN ConditionToValue(x);
  3061. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3062. CompareString(BrgeL,x.left,x.right);
  3063. ELSE
  3064. Evaluate(x.left,left);
  3065. Evaluate(x.right,right);
  3066. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3067. Reuse1(temp.op,left.op);
  3068. Emit(And(position,temp.op,left.op,right.op));
  3069. ReleaseOperand(left);
  3070. BreqL(trueLabel, temp.op,right.op);
  3071. ReleaseOperand(temp); ReleaseOperand(right);
  3072. BrL(falseLabel);
  3073. ELSE
  3074. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3075. ReleaseOperand(left); ReleaseOperand(right);
  3076. BrL(trueLabel);
  3077. END;
  3078. END;
  3079. |Scanner.Unequal:
  3080. IF ~conditional THEN ConditionToValue(x);
  3081. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3082. CompareString(BrneL,x.left,x.right);
  3083. ELSE
  3084. Evaluate(x.left,left);
  3085. Evaluate(x.right,right);
  3086. IF leftType IS SyntaxTree.RangeType THEN
  3087. ASSERT(rightType IS SyntaxTree.RangeType);
  3088. BrneL(trueLabel, left.op, right.op); (* first *)
  3089. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3090. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3091. ReleaseOperand(left); ReleaseOperand(right);
  3092. BrL(falseLabel)
  3093. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3094. BrneL(trueLabel, left.op, right.op); (* first *)
  3095. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3096. ReleaseOperand(left); ReleaseOperand(right);
  3097. BrL(falseLabel)
  3098. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3099. (* TODO: review this *)
  3100. BrneL(trueLabel, left.op, right.op); (* real part *)
  3101. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3102. ReleaseOperand(left); ReleaseOperand(right);
  3103. BrL(falseLabel)
  3104. ELSE
  3105. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3106. ReleaseOperand(left); ReleaseOperand(right);
  3107. BrL(trueLabel);
  3108. END;
  3109. END;
  3110. |Scanner.In:
  3111. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3112. Evaluate(x.left,left);
  3113. Evaluate(x.right,right);
  3114. Convert(left.op,setType);
  3115. ReuseCopy(temp.op,right.op);
  3116. Emit(Shr(position,temp.op,temp.op,left.op));
  3117. ReleaseOperand(right); ReleaseOperand(left);
  3118. IntermediateCode.InitImmediate(one,setType,1);
  3119. Emit(And(position,temp.op,temp.op,one));
  3120. IF conditional THEN
  3121. IntermediateCode.InitImmediate(zero,setType,0);
  3122. BrneL(trueLabel,temp.op,zero);
  3123. ReleaseOperand(temp);
  3124. BrL(falseLabel);
  3125. ELSE
  3126. Convert(temp.op,bool);
  3127. result.mode := ModeValue;
  3128. result.op := temp.op;
  3129. result.tag := nil; (* may be left over from calls to evaluate *)
  3130. END;
  3131. ELSE
  3132. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3133. IF x.operator = Scanner.Questionmarks THEN
  3134. leftExpression := x.left;
  3135. rightExpression := x.right;
  3136. ELSE
  3137. leftExpression := x.right;
  3138. rightExpression := x.left;
  3139. END;
  3140. Evaluate(leftExpression, left);
  3141. Emit(Push(position,left.op));
  3142. ReleaseOperand(left);
  3143. Designate(rightExpression, right);
  3144. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3145. IF ~backend.cellsAreObjects THEN
  3146. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3147. END;
  3148. Emit(Push(position,right.op));
  3149. ReleaseOperand(right);
  3150. IF backend.cellsAreObjects THEN
  3151. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3152. ELSE
  3153. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3154. END;
  3155. InitOperand(result, ModeValue);
  3156. result.op := NewRegisterOperand(bool);
  3157. Emit(Result(position,result.op));
  3158. IF conditional THEN
  3159. IntermediateCode.InitImmediate(zero,setType,0);
  3160. BrneL(trueLabel,result.op,zero);
  3161. ReleaseOperand(result);
  3162. BrL(falseLabel);
  3163. END;
  3164. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3165. leftExpression := x.left;
  3166. rightExpression := x.right;
  3167. Evaluate(leftExpression, left);
  3168. Emit(Push(position,left.op));
  3169. ReleaseOperand(left);
  3170. Evaluate(rightExpression, right);
  3171. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3172. IF ~backend.cellsAreObjects THEN
  3173. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3174. END;
  3175. Emit(Push(position,right.op));
  3176. ReleaseOperand(right);
  3177. IF backend.cellsAreObjects THEN
  3178. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3179. ELSE
  3180. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3181. END;
  3182. InitOperand(result, ModeValue);
  3183. result.op := NewRegisterOperand(bool);
  3184. Emit(Result(position,result.op));
  3185. IF conditional THEN
  3186. IntermediateCode.InitImmediate(zero,setType,0);
  3187. BrneL(trueLabel,result.op,zero);
  3188. ReleaseOperand(result);
  3189. BrL(falseLabel);
  3190. END;
  3191. ELSE
  3192. HALT(100);
  3193. END;
  3194. END;
  3195. destination := dest;
  3196. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3197. END VisitBinaryExpression;
  3198. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3199. VAR localResult, operand: Operand;
  3200. BEGIN
  3201. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3202. InitOperand(localResult, ModeValue);
  3203. ASSERT(x.first # NIL);
  3204. Evaluate(x.first, operand);
  3205. localResult.op := operand.op;
  3206. ReleaseOperand(operand);
  3207. UseIntermediateOperand(localResult.op);
  3208. ASSERT(x.last # NIL);
  3209. Evaluate(x.last, operand);
  3210. localResult.tag := operand.op;
  3211. ReleaseOperand(operand);
  3212. UseIntermediateOperand(localResult.tag);
  3213. IF x.step # NIL THEN
  3214. Evaluate(x.step, operand);
  3215. localResult.extra := operand.op;
  3216. ReleaseOperand(operand);
  3217. UseIntermediateOperand(localResult.extra);
  3218. END;
  3219. result := localResult;
  3220. IF Trace THEN TraceExit("VisitRangeExpression") END
  3221. END VisitRangeExpression;
  3222. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3223. BEGIN
  3224. HALT(100); (* should never be evaluated *)
  3225. END VisitTensorRangeExpression;
  3226. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3227. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3228. BEGIN
  3229. IF Trace THEN TraceEnter("VisitConversion") END;
  3230. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3231. dest := destination; destination := emptyOperand;
  3232. Evaluate(x.expression,old);
  3233. InitOperand(result,ModeValue);
  3234. result.op := old.op;
  3235. ASSERT(result.op.mode # 0);
  3236. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3237. (* convert TO a complex number *)
  3238. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3239. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3240. ASSERT(result.op.mode # 0);
  3241. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3242. (* convert FROM a complex number TO a complex number*)
  3243. result.tag := old.tag;
  3244. ASSERT(result.tag.mode # 0);
  3245. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3246. ASSERT(result.tag.mode # 0)
  3247. ELSE
  3248. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3249. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3250. END
  3251. ELSE
  3252. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3253. ASSERT(result.op.mode # 0);
  3254. result.tag := old.tag; (*! probably never used *)
  3255. END;
  3256. destination := dest;
  3257. IF Trace THEN TraceExit("VisitConversion") END;
  3258. END VisitConversion;
  3259. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3260. BEGIN
  3261. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3262. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3263. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3264. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3265. END VisitTypeDeclaration;
  3266. (** designators (expressions) *)
  3267. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3268. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3269. BEGIN
  3270. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3271. IF x.left # NIL THEN Expression(x.left) END;
  3272. Symbol(x.symbol,result);
  3273. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3274. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3275. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3276. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3277. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3278. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3279. END;
  3280. END;
  3281. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3282. END VisitSymbolDesignator;
  3283. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3284. BEGIN
  3285. IF isUnchecked THEN RETURN END;
  3286. IF tagsAvailable THEN
  3287. TrapC(BrltL,index,length,IndexCheckTrap);
  3288. END;
  3289. END BoundCheck;
  3290. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3291. VAR d: IntermediateCode.Operand;
  3292. BEGIN
  3293. IF isUnchecked THEN RETURN END;
  3294. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3295. TrapC(op,dim,d,ArraySizeTrap);
  3296. ReleaseIntermediateOperand(d);
  3297. END DimensionCheck;
  3298. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3299. VAR
  3300. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3301. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3302. expression: SyntaxTree.Expression;
  3303. resultingType, leftType, baseType: SyntaxTree.Type;
  3304. skipLabel1: Label;
  3305. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3306. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3307. variableOp: Operand;
  3308. variable: SyntaxTree.Variable;
  3309. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3310. VAR expression: SyntaxTree.Expression;
  3311. BEGIN
  3312. (* count the number of indices, ranges and tensorRanges in the index list *)
  3313. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3314. FOR i := 0 TO parameters.Length() - 1 DO
  3315. expression := parameters.GetExpression(i);
  3316. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3317. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3318. ELSE INC(indexCount)
  3319. END
  3320. END;
  3321. END CountIndices;
  3322. BEGIN
  3323. ASSERT(tagsAvailable);
  3324. resultingType := x.type.resolved; (* resulting type *)
  3325. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3326. InitOperand(localResult, ModeReference);
  3327. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3328. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3329. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3330. (* a globally defined array destination tag is available -> use and invalidate it*)
  3331. localResult.tag := arrayDestinationTag;
  3332. IntermediateCode.InitOperand(arrayDestinationTag)
  3333. ELSE
  3334. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3335. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3336. Symbol(variable, variableOp);
  3337. ReuseCopy(localResult.tag, variableOp.op);
  3338. ReleaseOperand(variableOp);
  3339. END
  3340. END;
  3341. indexListSize := x.parameters.Length();
  3342. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3343. ASSERT(tensorRangeCount <= 1);
  3344. (* designate the array to be indexed over, perform tensor range check if known *)
  3345. Designate(x.left, array);
  3346. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3347. Dereference(array, leftType,FALSE);
  3348. IF tensorRangeCount=0 THEN
  3349. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3350. END
  3351. END;
  3352. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3353. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3354. srcDimOffset := -indexListSize;
  3355. destDimOffset := -rangeCount
  3356. ELSE
  3357. srcDimOffset := 0;
  3358. destDimOffset := 0
  3359. END;
  3360. indexDim := 0;
  3361. (* use address of source array as basis *)
  3362. (*
  3363. ReuseCopy(localResult.op, array.op);
  3364. *)
  3365. localResult.op := array.op;
  3366. UseIntermediateOperand(localResult.op);
  3367. (* go through the index list *)
  3368. FOR i := 0 TO indexListSize - 1 DO
  3369. expression := x.parameters.GetExpression(i);
  3370. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3371. (* nothing to do *)
  3372. ELSE
  3373. (* determine which dimension of source array is currently looked at *)
  3374. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3375. (* get the memory operand pointing to array descriptor dimension *)
  3376. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3377. (* make a reusable register from it *)
  3378. ReuseCopy(srcDim, tmp);
  3379. ReleaseIntermediateOperand(tmp);
  3380. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3381. ELSE
  3382. srcDim := IntermediateCode.Immediate(int32, i)
  3383. END;
  3384. (* get length and increment of source array for current dimension *)
  3385. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3386. Convert(sourceLength.op, sizeType);
  3387. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3388. Convert(sourceIncrement.op, sizeType);
  3389. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3390. ReleaseIntermediateOperand(srcDim);
  3391. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3392. (* SINGLE INDEX *)
  3393. Evaluate(expression, index);
  3394. ReleaseIntermediateOperand(index.tag);
  3395. index.tag := emptyOperand;
  3396. Convert(index.op, sizeType);
  3397. (* lower bound check *)
  3398. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3399. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3400. ELSIF isUnchecked THEN (* do nothing *)
  3401. ELSE
  3402. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3403. END;
  3404. (* upper bound check *)
  3405. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3406. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3407. ELSIF isUnchecked THEN (* do nothing *)
  3408. ELSE
  3409. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3410. END;
  3411. ReleaseOperand(sourceLength);
  3412. Convert(index.op, addressType);
  3413. summand := index.op;
  3414. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3415. (* RANGE OF INDICES *)
  3416. Evaluate(expression, range);
  3417. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3418. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3419. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3420. ReleaseOperand(range);
  3421. Convert(firstIndex, sizeType);
  3422. Convert(lastIndex, sizeType);
  3423. Convert(stepSize, sizeType);
  3424. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3425. if it is 'MAX(LONGINT)' *)
  3426. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3427. TransferToRegister(lastIndex, lastIndex);
  3428. skipLabel1 := NewLabel();
  3429. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3430. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3431. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3432. SetLabel(skipLabel1)
  3433. END;
  3434. (* check if step size is valid *)
  3435. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3436. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3437. ELSIF isUnchecked THEN (* do nothing *)
  3438. ELSE
  3439. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3440. END;
  3441. (* check lower bound check *)
  3442. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3443. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3444. ELSIF isUnchecked THEN (* do nothing *)
  3445. ELSE
  3446. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3447. END;
  3448. (* check upper bound check *)
  3449. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3450. (* statically open range: nothing to do *)
  3451. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3452. ASSERT(staticLastIndex < staticSourceLength)
  3453. ELSIF isUnchecked THEN (* do nothing *)
  3454. ELSE
  3455. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3456. END;
  3457. (* determine length of target array for current dimension *)
  3458. (* 1. incorporate last index: *)
  3459. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3460. (* last index is static *)
  3461. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3462. targetLength := sourceLength.op
  3463. ELSE
  3464. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3465. END;
  3466. UseIntermediateOperand(targetLength);
  3467. ELSE
  3468. (* targetLength := lastIndex + 1
  3469. Reuse1(targetLength, lastIndex);
  3470. *)
  3471. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3472. END;
  3473. ReleaseOperand(sourceLength);
  3474. ReleaseIntermediateOperand(lastIndex);
  3475. (* 2. incorporate first index: *)
  3476. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3477. (* first index and current target length are static *)
  3478. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3479. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3480. (* first index = 0: nothing to do *)
  3481. ELSE
  3482. (* targetLength := targetLength - firstIndex *)
  3483. TransferToRegister(targetLength, targetLength);
  3484. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3485. END;
  3486. (* clip negative lengths to 0 *)
  3487. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3488. IF staticTargetLength < 0 THEN
  3489. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3490. END
  3491. ELSE
  3492. skipLabel1 := NewLabel();
  3493. TransferToRegister(targetLength, targetLength);
  3494. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3495. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3496. SetLabel(skipLabel1)
  3497. END;
  3498. (* 3. incorporate index step size: *)
  3499. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3500. (*step size and current target length are static *)
  3501. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3502. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3503. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3504. (* step size = 1: nothing to do *)
  3505. ELSE
  3506. (* emit code for this:
  3507. targetLength := (targetLength-1) DIV stepSize +1;
  3508. *)
  3509. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3510. DivInt(targetLength, targetLength, stepSize);
  3511. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3512. END;
  3513. (* determine increment of target array for current dimension *)
  3514. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3515. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3516. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3517. (* step size = 1 *)
  3518. targetIncrement := sourceIncrement.op;
  3519. UseIntermediateOperand(targetIncrement)
  3520. ELSE
  3521. (* targetIncrement := sourceIncrement * stepSize *)
  3522. Reuse1(targetIncrement, stepSize);
  3523. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3524. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3525. END;
  3526. ReleaseIntermediateOperand(stepSize);
  3527. (* write length and increment of target array to descriptor *)
  3528. IF destDimOffset < 0 THEN
  3529. (* determine which dimension of target array is currently looked at *)
  3530. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3531. TransferToRegister(destDim, tmp);
  3532. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3533. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3534. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3535. ReleaseIntermediateOperand(destDim)
  3536. ELSE
  3537. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3538. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3539. END;
  3540. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3541. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3542. INC(indexDim);
  3543. Convert(firstIndex, addressType);
  3544. TransferToRegister(summand, firstIndex);
  3545. ELSE HALT(100);
  3546. END;
  3547. (*
  3548. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3549. *)
  3550. Convert(sourceIncrement.op, addressType);
  3551. Convert(summand, addressType);
  3552. MulInt(summand, summand, sourceIncrement.op);
  3553. ReleaseIntermediateOperand(sourceIncrement.op);
  3554. AddInt(localResult.op, localResult.op, summand);
  3555. ReleaseIntermediateOperand(summand);
  3556. END
  3557. END;
  3558. result := localResult;
  3559. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3560. ReleaseIntermediateOperand(result.tag);
  3561. result.tag := TypeDescriptorAdr(resultingType);
  3562. IF ~newObjectFile THEN
  3563. IntermediateCode.MakeMemory(result.tag,addressType);
  3564. END;
  3565. ELSIF IsDelegate(resultingType) THEN
  3566. ReleaseIntermediateOperand(result.tag);
  3567. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3568. UseIntermediateOperand(result.tag);
  3569. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3570. ReleaseIntermediateOperand(result.tag);
  3571. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3572. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3573. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3574. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3575. (* finalize target array descriptor *)
  3576. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3577. (* write lengths and increments of target array for remaining dimensions *)
  3578. i := indexListSize;
  3579. WHILE indexDim < targetArrayDimensionality DO
  3580. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3581. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3582. ReleaseOperand(sourceLength);
  3583. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3584. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3585. ReleaseOperand(sourceIncrement);
  3586. INC(i); INC(indexDim);
  3587. END;
  3588. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3589. tmp := nil;
  3590. ELSE
  3591. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3592. END;
  3593. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3594. ReleaseIntermediateOperand(tmp);
  3595. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3596. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3597. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3598. ELSE
  3599. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3600. END;
  3601. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3602. ReleaseIntermediateOperand(tmp);
  3603. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3604. (* write dimensionality *)
  3605. IF targetArrayDimensionality # 0 THEN
  3606. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3607. END;
  3608. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3609. END;
  3610. ReleaseOperand(array);
  3611. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3612. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3613. END;
  3614. END MathIndexDesignator;
  3615. (* TENTATIVE *)
  3616. PROCEDURE DumpOperand(operand: Operand);
  3617. BEGIN
  3618. D.Log.String(" op = ");
  3619. IntermediateCode.DumpOperand(D.Log, operand.op );
  3620. D.Log.Ln;
  3621. D.Log.String(" tag = ");
  3622. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3623. D.Log.Ln;
  3624. D.Log.String(" extra = ");
  3625. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3626. D.Log.Ln;
  3627. D.Log.Update
  3628. END DumpOperand;
  3629. (* get the length of an array , trying to make use of static information *)
  3630. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3631. VAR res: IntermediateCode.Operand; size: LONGINT;
  3632. BEGIN
  3633. type := type.resolved;
  3634. IF type IS SyntaxTree.ArrayType THEN
  3635. WITH type: SyntaxTree.ArrayType DO
  3636. IF type.form = SyntaxTree.Static THEN
  3637. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3638. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3639. Evaluate(type.length, op);
  3640. ReleaseIntermediateOperand(op.tag);
  3641. RETURN op.op;*)
  3642. ELSE
  3643. res := tag;
  3644. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3645. IntermediateCode.MakeMemory(res,addressType);
  3646. UseIntermediateOperand(res);
  3647. RETURN res
  3648. END
  3649. END;
  3650. ELSE
  3651. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3652. RETURN IntermediateCode.Immediate(addressType,size);
  3653. END;
  3654. END ArrayLength;
  3655. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3656. BEGIN
  3657. ReleaseIntermediateOperand(res);
  3658. IF IsImmediate(x) & IsImmediate(y) THEN
  3659. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3660. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3661. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3662. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3663. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3664. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3665. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3666. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3667. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3668. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3669. UseIntermediateOperand(res);
  3670. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3671. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3672. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3673. UseIntermediateOperand(res);
  3674. ELSE
  3675. IF ~ReusableRegister(res) THEN
  3676. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3677. ELSE
  3678. UseIntermediateOperand(res);
  3679. END;
  3680. IF IsImmediate(x) & (x.intValue = 0) THEN
  3681. Emit(Mov(position,res,y))
  3682. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3683. Emit(Mov(position,res,x))
  3684. ELSE
  3685. Emit(Add(position,res, x, y));
  3686. END;
  3687. END;
  3688. END AddInt;
  3689. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3690. BEGIN
  3691. ReleaseIntermediateOperand(res);
  3692. IF IsImmediate(x) & IsImmediate(y) THEN
  3693. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3694. ELSE
  3695. IF ~ReusableRegister(res) THEN
  3696. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3697. ELSE UseIntermediateOperand(res);
  3698. END;
  3699. IF IsImmediate(x) & (x.intValue = 1) THEN
  3700. Emit(Mov(position,res,y))
  3701. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3702. Emit(Mov(position,res,x))
  3703. ELSE
  3704. Emit(Mul(position,res, x, y));
  3705. END;
  3706. END;
  3707. END MulInt;
  3708. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3709. BEGIN
  3710. ReleaseIntermediateOperand(res);
  3711. IF IsImmediate(x) & IsImmediate(y) THEN
  3712. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3713. ELSE
  3714. IF ~ReusableRegister(res) THEN
  3715. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3716. ELSE UseIntermediateOperand(res);
  3717. END;
  3718. IF IsImmediate(x) & (x.intValue = 1) THEN
  3719. Emit(Mov(position,res,y))
  3720. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3721. Emit(Mov(position,res,x))
  3722. ELSE
  3723. Emit(Div(position,res, x, y));
  3724. END;
  3725. END;
  3726. END DivInt;
  3727. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3728. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3729. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3730. BEGIN
  3731. type := x.left.type.resolved;
  3732. IF type IS SyntaxTree.StringType THEN
  3733. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3734. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3735. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3736. type := atype;
  3737. x.left.SetType(type);
  3738. END;
  3739. IntermediateCode.InitImmediate(res,addressType,0);
  3740. maxDim := x.parameters.Length()-1;
  3741. FOR i := 0 TO maxDim DO
  3742. e := x.parameters.GetExpression(i);
  3743. Evaluate(e,index);
  3744. Convert(index.op,addressType);
  3745. AddInt(res, res, index.op);
  3746. IF i = 0 THEN
  3747. (*
  3748. ReuseCopy(res, index.op);
  3749. *)
  3750. Designate(x.left,array);
  3751. type := x.left.type.resolved;
  3752. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3753. Dereference(array, type, FALSE);
  3754. END;
  3755. (*
  3756. ELSE AddInt(res, res, index.op);
  3757. *)
  3758. END;
  3759. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3760. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3761. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3762. BoundCheck(index.op, length);
  3763. END;
  3764. ReleaseIntermediateOperand(length);
  3765. END;
  3766. ReleaseOperand(index);
  3767. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3768. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3769. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3770. MulInt(res,res,length);
  3771. END;
  3772. ReleaseIntermediateOperand(length);
  3773. END;
  3774. IF (type IS SyntaxTree.ArrayType) THEN
  3775. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3776. size := StaticSize(system, type);
  3777. IF size # 1 THEN
  3778. length := IntermediateCode.Immediate(addressType,size);
  3779. MulInt(res,res,length);
  3780. END;
  3781. ELSE
  3782. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3783. IF size # 1 THEN
  3784. length := IntermediateCode.Immediate(addressType,size);
  3785. MulInt(res,res,length);
  3786. END;
  3787. END;
  3788. END;
  3789. AddInt(res,res,array.op);
  3790. InitOperand(result,ModeReference);
  3791. result.op := res;
  3792. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3793. ReleaseIntermediateOperand(result.tag);
  3794. result.tag := TypeDescriptorAdr(type);
  3795. IF ~newObjectFile THEN
  3796. IntermediateCode.MakeMemory(result.tag,addressType);
  3797. END
  3798. ELSIF IsDelegate(type) THEN
  3799. ReleaseIntermediateOperand(result.tag);
  3800. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3801. UseIntermediateOperand(result.tag);
  3802. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3803. ReleaseIntermediateOperand(result.tag);
  3804. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3805. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3806. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3807. END;
  3808. ReleaseOperand(array);
  3809. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3810. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3811. END;
  3812. END IndexDesignator;
  3813. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3814. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3815. BEGIN
  3816. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3817. dest := destination; destination := emptyOperand;
  3818. type := x.left.type.resolved;
  3819. IF type IS SyntaxTree.MathArrayType THEN
  3820. MathIndexDesignator(x);
  3821. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3822. IndexDesignator(x);
  3823. END;
  3824. destination := dest;
  3825. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3826. END VisitIndexDesignator;
  3827. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3828. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3829. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3830. procedure: SyntaxTree.Procedure;
  3831. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3832. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3833. BEGIN
  3834. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3835. parameters := expression.parameters;
  3836. moduleName := "FoxArrayBase";
  3837. procedureName := "CopyDescriptor";
  3838. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3839. SaveRegisters();ReleaseUsedRegisters(saved);
  3840. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3841. IF procedure = NIL THEN
  3842. s := "procedure ";
  3843. Strings.Append(s,moduleName);
  3844. Strings.Append(s,".");
  3845. Strings.Append(s,procedureName);
  3846. Strings.Append(s," not present");
  3847. Error(position,s);
  3848. ELSE
  3849. (* push address of temporary variable *)
  3850. Symbol(variable,destOperand);
  3851. Emit(Push(position,destOperand.op));
  3852. ReleaseOperand(destOperand);
  3853. (* push src *)
  3854. Evaluate(expression.left,srcOperand);
  3855. (*
  3856. Dereference(srcOperand,expression.type.resolved);
  3857. Emit(Push(position,srcOperand.tag));
  3858. *)
  3859. Emit(Push(position,srcOperand.op));
  3860. ReleaseOperand(srcOperand);
  3861. tensorFound := FALSE;
  3862. FOR i := 0 TO parameters.Length()-1 DO
  3863. e := parameters.GetExpression(i);
  3864. IF e IS SyntaxTree.TensorRangeExpression THEN
  3865. tensorFound := TRUE;
  3866. ELSIF e IS SyntaxTree.RangeExpression THEN
  3867. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3868. ELSE
  3869. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3870. END;
  3871. END;
  3872. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3873. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3874. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3875. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3876. StaticCallOperand(procOp,procedure);
  3877. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3878. ReleaseOperand(procOp);
  3879. END;
  3880. RestoreRegisters(saved);
  3881. END;
  3882. RETURN variable
  3883. END PrepareTensorDescriptor;
  3884. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3885. VAR
  3886. type, descriptorType, baseType: SyntaxTree.Type;
  3887. operand, tmpOperand, variableOp, variable2Op: Operand;
  3888. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3889. variable, variable2: SyntaxTree.Variable;
  3890. dim, i, size: LONGINT;
  3891. (* TODO: needed? *)
  3892. oldArrayDestinationTag: IntermediateCode.Operand;
  3893. oldArrayDestinationDimension: LONGINT;
  3894. position: LONGINT;
  3895. saved: RegisterEntry;
  3896. arrayFlags: SET;
  3897. m, n: LONGINT;
  3898. PROCEDURE Pass(op: IntermediateCode.Operand);
  3899. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3900. BEGIN
  3901. IF numberRegister >= 0 THEN
  3902. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3903. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3904. Emit(Mov(position,parameterRegister, op));
  3905. ELSE
  3906. Emit(Push(position,op))
  3907. END
  3908. END Pass;
  3909. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3910. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3911. BEGIN
  3912. formalType := formalType.resolved; actualType := actualType.resolved;
  3913. IF IsOpenArray(formalType)THEN
  3914. IF actualType IS SyntaxTree.StringType THEN
  3915. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3916. RETURN;
  3917. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3918. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3919. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3920. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3921. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3922. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3923. ELSE
  3924. tmp := baseReg;
  3925. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3926. IntermediateCode.MakeMemory(tmp,addressType);
  3927. Pass((tmp));
  3928. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3929. END;
  3930. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3931. END;
  3932. END PushArrayLens;
  3933. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3934. BEGIN
  3935. CASE size OF
  3936. |2: INCL(flags,Size2Flag);
  3937. |3: INCL(flags,Size3Flag);
  3938. |4: INCL(flags,Size4Flag);
  3939. |5: INCL(flags,Size5Flag);
  3940. |6: INCL(flags,Size6Flag);
  3941. |7: INCL(flags,Size7Flag);
  3942. |8: INCL(flags,Size8Flag);
  3943. END;
  3944. END SetSmallArraySizeFlag;
  3945. BEGIN
  3946. IF Trace THEN TraceEnter("PushParameter") END;
  3947. position := expression.position;
  3948. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3949. type := expression.type.resolved;
  3950. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3951. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3952. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3953. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3954. );
  3955. (* TODO: needed? *)
  3956. oldArrayDestinationTag := arrayDestinationTag;
  3957. oldArrayDestinationDimension := arrayDestinationDimension;
  3958. IF IsArrayOfSystemByte(parameter.type) THEN
  3959. Designate(expression,operand);
  3960. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3961. ReleaseIntermediateOperand(operand.tag);
  3962. operand.tag := tmp;
  3963. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3964. Pass((operand.tag));
  3965. END;
  3966. Pass((operand.op));
  3967. ELSIF IsOpenArray(parameter.type) THEN
  3968. Designate(expression,operand);
  3969. baseReg := operand.tag;
  3970. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3971. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3972. END;
  3973. Pass((operand.op)); (* address of the array *)
  3974. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3975. (* case 1 *)
  3976. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3977. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3978. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3979. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3980. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3981. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3982. arrayDestinationTag := sp;
  3983. (* case 1b *)
  3984. IF expression IS SyntaxTree.IndexDesignator THEN
  3985. (*
  3986. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3987. descriptorType := GetMathArrayDescriptorType(dim);
  3988. variable := GetTemporaryVariable(descriptorType,expression.position);
  3989. Symbol(variable,variableOp);
  3990. arrayDestinationTag := variableOp.op;
  3991. *)
  3992. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3993. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3994. arrayDestinationDimension := dim;
  3995. Designate(expression,operand);
  3996. (* case 1a *)
  3997. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3998. Designate(expression,operand);
  3999. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4000. i := 0;
  4001. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4002. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4003. INC(i);
  4004. END;
  4005. type := expression.type.resolved;
  4006. WHILE (i<dim) DO (* remaining static dimensions *)
  4007. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4008. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4009. ReleaseOperand(tmpOperand);
  4010. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4011. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4012. ReleaseOperand(tmpOperand);
  4013. INC(i);
  4014. END;
  4015. dimOp := IntermediateCode.Immediate(addressType,dim);
  4016. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4017. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4018. (* case 1d *)
  4019. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4020. Designate(expression,operand);
  4021. Dereference(operand,type.resolved,FALSE);
  4022. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4023. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4024. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4025. (* case 1f *)
  4026. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4027. Designate(expression,operand);
  4028. FOR i := 0 TO dim-1 DO
  4029. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4030. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4031. ReleaseOperand(tmpOperand);
  4032. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4033. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4034. ReleaseOperand(tmpOperand);
  4035. END;
  4036. (*******
  4037. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4038. *)
  4039. arrayFlags := {StaticFlag};
  4040. IF dim = 1 THEN
  4041. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4042. ReleaseOperand(tmpOperand);
  4043. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4044. m := LONGINT(tmpOperand.op.intValue);
  4045. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4046. ELSIF dim = 2 THEN
  4047. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4048. ReleaseOperand(tmpOperand);
  4049. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4050. m := LONGINT(tmpOperand.op.intValue);
  4051. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4052. ReleaseOperand(tmpOperand);
  4053. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4054. n := LONGINT(tmpOperand.op.intValue);
  4055. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4056. INCL(arrayFlags,SmallMatrixFlag);
  4057. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4058. END;
  4059. END;
  4060. (*******)
  4061. dimOp := IntermediateCode.Immediate(addressType,dim);
  4062. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4063. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4064. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4065. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4066. baseType := SemanticChecker.ArrayBase(type,dim);
  4067. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4068. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4069. ELSE HALT(100);
  4070. END;
  4071. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4072. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4073. (* case 2b *)
  4074. IF expression IS SyntaxTree.IndexDesignator THEN
  4075. descriptorType := GetMathArrayDescriptorType(dim);
  4076. variable := GetTemporaryVariable(descriptorType, FALSE);
  4077. Symbol(variable,variableOp);
  4078. arrayDestinationTag := variableOp.op;
  4079. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4080. arrayDestinationDimension := dim;
  4081. NeedDescriptor := TRUE;
  4082. Designate(expression,operand);
  4083. Pass((operand.tag));
  4084. NeedDescriptor := FALSE;
  4085. (* case 2a *)
  4086. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4087. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4088. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4089. INC(i);
  4090. END;
  4091. IF i = dim THEN
  4092. Designate(expression,operand);
  4093. Pass((operand.tag));
  4094. ELSE (* open-static *)
  4095. type := expression.type.resolved;
  4096. descriptorType := GetMathArrayDescriptorType(dim);
  4097. variable := GetTemporaryVariable(descriptorType, FALSE);
  4098. Symbol(variable,variableOp);
  4099. arrayDestinationTag := variableOp.op;
  4100. Designate(expression,operand);
  4101. FOR i := 0 TO dim-1 DO
  4102. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4103. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4104. ReleaseOperand(tmpOperand);
  4105. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4106. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4107. ReleaseOperand(tmpOperand);
  4108. END;
  4109. dimOp := IntermediateCode.Immediate(addressType,dim);
  4110. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4111. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4112. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4113. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4114. baseType := SemanticChecker.ArrayBase(type,dim);
  4115. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4116. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4117. Pass((arrayDestinationTag));
  4118. END;
  4119. (* case 2d *)
  4120. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4121. Designate(expression,operand);
  4122. Dereference(operand,type.resolved,FALSE);
  4123. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4124. Pass((operand.tag));
  4125. (* case 2f *)
  4126. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4127. descriptorType := GetMathArrayDescriptorType(dim);
  4128. variable := GetTemporaryVariable(descriptorType, FALSE);
  4129. Symbol(variable,variableOp);
  4130. arrayDestinationTag := variableOp.op;
  4131. Designate(expression,operand);
  4132. FOR i := 0 TO dim-1 DO
  4133. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4134. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4135. ReleaseOperand(tmpOperand);
  4136. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4137. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4138. ReleaseOperand(tmpOperand);
  4139. END;
  4140. (*
  4141. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4142. *)
  4143. arrayFlags := {StaticFlag};
  4144. IF dim = 1 THEN
  4145. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4146. ReleaseOperand(tmpOperand);
  4147. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4148. m := LONGINT(tmpOperand.op.intValue);
  4149. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4150. ELSIF dim = 2 THEN
  4151. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4152. ReleaseOperand(tmpOperand);
  4153. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4154. m := LONGINT(tmpOperand.op.intValue);
  4155. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4156. ReleaseOperand(tmpOperand);
  4157. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4158. n := LONGINT(tmpOperand.op.intValue);
  4159. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4160. INCL(arrayFlags,SmallMatrixFlag);
  4161. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4162. END;
  4163. END;
  4164. (*******)
  4165. dimOp := IntermediateCode.Immediate(addressType,dim);
  4166. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4167. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4168. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4169. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4170. baseType := SemanticChecker.ArrayBase(type,dim);
  4171. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4172. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4173. Pass((arrayDestinationTag));
  4174. ELSE HALT(100);
  4175. END;
  4176. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4177. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4178. (* case 3b *)
  4179. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4180. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4181. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4182. Symbol(variable,variableOp);
  4183. LoadValue(variableOp,system.addressType);
  4184. ELSE
  4185. descriptorType := GetMathArrayDescriptorType(dim);
  4186. variable := GetTemporaryVariable(descriptorType, FALSE);
  4187. Symbol(variable,variableOp);
  4188. END;
  4189. arrayDestinationTag := variableOp.op;
  4190. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4191. arrayDestinationDimension := 0;
  4192. Designate(expression,operand);
  4193. Pass((operand.tag));
  4194. (* case 3a *)
  4195. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4196. i := 0;
  4197. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4198. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4199. INC(i);
  4200. END;
  4201. IF i = dim THEN
  4202. Designate(expression,operand);
  4203. Pass((operand.tag));
  4204. ELSE (* open-static *)
  4205. type := expression.type.resolved;
  4206. descriptorType := GetMathArrayDescriptorType(dim);
  4207. variable := GetTemporaryVariable(descriptorType, FALSE);
  4208. Symbol(variable,variableOp);
  4209. arrayDestinationTag := variableOp.op;
  4210. Designate(expression,operand);
  4211. FOR i := 0 TO dim-1 DO
  4212. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4213. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4214. ReleaseOperand(tmpOperand);
  4215. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4216. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4217. ReleaseOperand(tmpOperand);
  4218. END;
  4219. dimOp := IntermediateCode.Immediate(addressType,dim);
  4220. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4221. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4222. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4223. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4224. baseType := SemanticChecker.ArrayBase(type,dim);
  4225. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4226. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4227. Pass((arrayDestinationTag));
  4228. END;
  4229. (* case 3d *)
  4230. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4231. Designate(expression,operand);
  4232. Dereference(operand,type.resolved,FALSE);
  4233. (*
  4234. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4235. *)
  4236. Pass((operand.tag));
  4237. (* case 3f *)
  4238. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4239. descriptorType := GetMathArrayDescriptorType(dim);
  4240. variable := GetTemporaryVariable(descriptorType, FALSE);
  4241. Symbol(variable,variableOp);
  4242. arrayDestinationTag := variableOp.op;
  4243. Designate(expression,operand);
  4244. IF operand.op.type.length >1 THEN (* vector register *)
  4245. variable2 := GetTemporaryVariable(type, FALSE);
  4246. Symbol(variable2, variable2Op);
  4247. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4248. Emit(Mov(position,tmp, operand.op));
  4249. ReleaseOperand(operand);
  4250. Symbol(variable2, operand);
  4251. END;
  4252. FOR i := 0 TO dim-1 DO
  4253. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4254. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4255. ReleaseOperand(tmpOperand);
  4256. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4257. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4258. ReleaseOperand(tmpOperand);
  4259. END;
  4260. dimOp := IntermediateCode.Immediate(addressType,dim);
  4261. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4262. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4263. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4264. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4265. baseType := SemanticChecker.ArrayBase(type,dim);
  4266. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4267. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4268. Pass((arrayDestinationTag));
  4269. ELSE HALT(100);
  4270. END;
  4271. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4272. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4273. (* case 4b *)
  4274. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4275. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4276. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4277. Symbol(variable,variableOp);
  4278. LoadValue(variableOp,system.addressType);
  4279. ELSE
  4280. descriptorType := GetMathArrayDescriptorType(dim);
  4281. variable := GetTemporaryVariable(descriptorType, FALSE);
  4282. Symbol(variable,variableOp);
  4283. END;
  4284. arrayDestinationTag := variableOp.op;
  4285. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4286. arrayDestinationDimension := 0;
  4287. Designate(expression,operand);
  4288. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4289. Symbol(variable,variableOp);
  4290. ELSE
  4291. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4292. Symbol(variable,variableOp);
  4293. MakeMemory(tmp,variableOp.op,addressType,0);
  4294. Emit(Mov(position,tmp,operand.tag));
  4295. ReleaseIntermediateOperand(tmp);
  4296. END;
  4297. Pass((variableOp.op));
  4298. ReleaseOperand(variableOp);
  4299. (* case 4a *)
  4300. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4301. i := 0;
  4302. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4303. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4304. INC(i);
  4305. END;
  4306. IF i = dim THEN
  4307. Designate(expression,operand);
  4308. arrayDestinationTag := operand.tag;
  4309. ELSE (* open-static *)
  4310. type := expression.type.resolved;
  4311. descriptorType := GetMathArrayDescriptorType(dim);
  4312. variable := GetTemporaryVariable(descriptorType, FALSE);
  4313. Symbol(variable,variableOp);
  4314. arrayDestinationTag := variableOp.op;
  4315. Designate(expression,operand);
  4316. FOR i := 0 TO dim-1 DO
  4317. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4318. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4319. ReleaseOperand(tmpOperand);
  4320. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4321. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4322. ReleaseOperand(tmpOperand);
  4323. END;
  4324. dimOp := IntermediateCode.Immediate(addressType,dim);
  4325. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4326. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4327. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4328. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4329. baseType := SemanticChecker.ArrayBase(type,dim);
  4330. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4331. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4332. END;
  4333. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4334. Symbol(variable,variableOp);
  4335. MakeMemory(tmp,variableOp.op,addressType,0);
  4336. Emit(Mov(position,tmp,arrayDestinationTag));
  4337. ReleaseIntermediateOperand(tmp);
  4338. Pass((variableOp.op));
  4339. ReleaseOperand(variableOp);
  4340. (* case 4d *)
  4341. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4342. Designate(expression,operand);
  4343. (*
  4344. Dereference(operand,type.resolved,FALSE);
  4345. *)
  4346. (*
  4347. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4348. *)
  4349. Pass((operand.op));
  4350. (* case 4f *)
  4351. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4352. descriptorType := GetMathArrayDescriptorType(dim);
  4353. variable := GetTemporaryVariable(descriptorType, FALSE);
  4354. Symbol(variable,variableOp);
  4355. arrayDestinationTag := variableOp.op;
  4356. Designate(expression,operand);
  4357. FOR i := 0 TO dim-1 DO
  4358. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4359. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4360. ReleaseOperand(tmpOperand);
  4361. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4362. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4363. ReleaseOperand(tmpOperand);
  4364. END;
  4365. dimOp := IntermediateCode.Immediate(addressType,dim);
  4366. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4367. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4368. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4369. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4370. baseType := SemanticChecker.ArrayBase(type,dim);
  4371. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4372. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4373. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4374. Symbol(variable,variableOp);
  4375. MakeMemory(tmp,variableOp.op,addressType,0);
  4376. Emit(Mov(position,tmp,arrayDestinationTag));
  4377. ReleaseIntermediateOperand(tmp);
  4378. Pass((variableOp.op));
  4379. ReleaseOperand(variableOp);
  4380. ELSE HALT(100);
  4381. END;
  4382. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4383. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4384. Designate(expression,operand);
  4385. IF operand.op.type.length > 1 THEN
  4386. Emit(Push(position, operand.op));
  4387. ReleaseOperand(operand);
  4388. ELSE
  4389. size := system.SizeOf(type);
  4390. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4391. size := ToMemoryUnits(system,size);
  4392. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4393. arrayDestinationTag := sp;
  4394. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4395. END;
  4396. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4397. Designate(expression,operand);
  4398. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4399. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4400. Symbol(variable,variableOp);
  4401. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4402. Emit(Mov(position,tmp,operand.op));
  4403. Emit(Push(position,variableOp.op));
  4404. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4405. Pass((operand.op));
  4406. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4407. END;
  4408. ELSE HALT(200)
  4409. END;
  4410. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4411. IF parameter.kind = SyntaxTree.VarParameter THEN
  4412. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4413. Designate(expression, operand);
  4414. Pass((operand.op));
  4415. ELSE
  4416. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4417. Evaluate(expression, operand);
  4418. Pass((operand.extra)); (* step *)
  4419. Pass((operand.tag)); (* last *)
  4420. Pass((operand.op)) (* first *)
  4421. END
  4422. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4423. IF parameter.kind = SyntaxTree.VarParameter THEN
  4424. Designate(expression, operand);
  4425. Pass((operand.op));
  4426. ELSE
  4427. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4428. Evaluate(expression, operand);
  4429. Pass((operand.tag)); (* real part *)
  4430. Pass((operand.op)) (* imaginary part *)
  4431. END
  4432. ELSE
  4433. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4434. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4435. Designate(expression,operand);
  4436. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4437. (* stack allocation *)
  4438. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4439. (*! parameter alignment to be discussed ... *)
  4440. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4441. size := type(SyntaxTree.StringType).length;
  4442. END;
  4443. IF backend.cooperative & parameter.NeedsTrace() THEN
  4444. dst := NewRegisterOperand (addressType);
  4445. Emit(Mov(position,dst, sp));
  4446. IntermediateCode.InitImmediate(null, byteType, 0);
  4447. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4448. ReleaseIntermediateOperand(dst);
  4449. SaveRegisters();ReleaseUsedRegisters(saved);
  4450. (* register dst has been freed before SaveRegisters already *)
  4451. CallAssignMethod(dst, operand.op, parameter.type);
  4452. RestoreRegisters(saved);
  4453. END;
  4454. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4455. ELSIF IsOpenArray(parameter.type) THEN
  4456. Designate(expression,operand);
  4457. baseReg := operand.tag;
  4458. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4459. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4460. END;
  4461. Pass((operand.op)); (* address of the array *)
  4462. ELSIF IsDelegate(parameter.type) THEN
  4463. Evaluate(expression,operand);
  4464. IF backend.cooperative & parameter.NeedsTrace() THEN
  4465. Emit(Push(position, nil));
  4466. dst := NewRegisterOperand (addressType);
  4467. Emit(Mov(position,dst, sp));
  4468. ReleaseIntermediateOperand(dst);
  4469. SaveRegisters();ReleaseUsedRegisters(saved);
  4470. Emit(Push(position, dst));
  4471. (* register dst has been freed before SaveRegisters already *)
  4472. Emit(Push(position, operand.tag));
  4473. CallThis(position,"GarbageCollector","Assign",2);
  4474. RestoreRegisters(saved);
  4475. ELSE
  4476. Pass((operand.tag));
  4477. END;
  4478. Pass((operand.op));
  4479. ELSE
  4480. Evaluate(expression,operand);
  4481. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4482. Emit(Push(position, nil));
  4483. dst := NewRegisterOperand (addressType);
  4484. Emit(Mov(position,dst, sp));
  4485. ReleaseIntermediateOperand(dst);
  4486. SaveRegisters();ReleaseUsedRegisters(saved);
  4487. Emit(Push(position, dst));
  4488. (* register dst has been freed before SaveRegisters already *)
  4489. Emit(Push(position, operand.op));
  4490. CallThis(position,"GarbageCollector","Assign",2);
  4491. RestoreRegisters(saved);
  4492. ELSE
  4493. Pass((operand.op));
  4494. END;
  4495. END;
  4496. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4497. Evaluate(expression,operand);
  4498. Pass((operand.op));
  4499. ELSE (* var parameter *)
  4500. Designate(expression,operand);
  4501. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4502. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4503. Pass((operand.tag));
  4504. END;
  4505. END;
  4506. Pass((operand.op));
  4507. END;
  4508. END;
  4509. (* TODO: needed? *)
  4510. arrayDestinationTag := oldArrayDestinationTag;
  4511. arrayDestinationDimension := oldArrayDestinationDimension;
  4512. IF needsParameterBackup THEN
  4513. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4514. ReuseCopy(parameterBackup, operand.op)
  4515. END;
  4516. ReleaseOperand(operand);
  4517. IF Trace THEN TraceExit("PushParameter") END;
  4518. END PushParameter;
  4519. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4520. VAR prevConditional: BOOLEAN;
  4521. BEGIN
  4522. prevConditional := conditional;
  4523. conditional := FALSE;
  4524. 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
  4525. Expression(x.result); (* use register *)
  4526. END;
  4527. Statement(x.statement);
  4528. conditional := prevConditional;
  4529. IF x.result # NIL THEN Expression(x.result) END;
  4530. 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
  4531. ReleaseIntermediateOperand(result.op);
  4532. END;
  4533. END VisitStatementDesignator;
  4534. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4535. VAR
  4536. procedure: SyntaxTree.Procedure;
  4537. procedureType: SyntaxTree.ProcedureType;
  4538. wasInline: BOOLEAN;
  4539. actualParameters: SyntaxTree.ExpressionList;
  4540. formalParameter: SyntaxTree.Parameter;
  4541. actualParameter: SyntaxTree.Expression;
  4542. i: LONGINT;
  4543. localVariable: SyntaxTree.Variable;
  4544. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4545. src, dest: Operand;
  4546. prevInlineExit : Label;
  4547. prevMapper: SymbolMapper;
  4548. tooComplex: BOOLEAN;
  4549. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4550. BEGIN
  4551. IF e = NIL THEN RETURN TRUE
  4552. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4553. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4554. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4555. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4556. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4557. ELSE RETURN FALSE
  4558. END;
  4559. END SimpleExpression;
  4560. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4561. BEGIN
  4562. RETURN checker.CanPassInRegister(type)
  4563. END FitsInRegister;
  4564. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4565. VAR
  4566. variable: SyntaxTree.Variable;
  4567. variableDesignator: SyntaxTree.Designator;
  4568. BEGIN
  4569. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4570. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4571. variableDesignator.SetType(type);
  4572. RETURN variableDesignator
  4573. END GetTemp;
  4574. BEGIN
  4575. wasInline := currentIsInline;
  4576. prevInlineExit := currentInlineExit;
  4577. prevMapper := currentMapper;
  4578. currentInlineExit := NewLabel();
  4579. tooComplex := FALSE;
  4580. NEW(currentMapper);
  4581. currentIsInline := TRUE;
  4582. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4583. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4584. formalParameter := procedureType.firstParameter;
  4585. actualParameters := x.parameters;
  4586. i := 0;
  4587. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4588. actualParameter := actualParameters.GetExpression(i);
  4589. IF actualParameter.resolved # NIL THEN
  4590. actualParameter := actualParameter.resolved
  4591. END;
  4592. (*
  4593. if expression is simple and can be passed immediately
  4594. or if type fits in register then we can proceed
  4595. otherwise we escape to ordinary procedure call.
  4596. *)
  4597. (* cases where the expression can be mapped identically *)
  4598. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4599. currentMapper.Add(formalParameter, actualParameter, NIL);
  4600. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4601. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4602. (*
  4603. Assign(variableDesignator, actualParameter);
  4604. *)
  4605. Evaluate(actualParameter, src);
  4606. Designate(variableDesignator, dest);
  4607. Emit(Mov(x.position, dest.op, src.op));
  4608. ReleaseOperand(dest);
  4609. ReleaseOperand(src);
  4610. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4611. ELSE tooComplex := TRUE
  4612. END;
  4613. (*
  4614. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4615. currentMapper.Add(formalParameter, actualParameter, NIL);
  4616. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4617. variableDesignator := GetTemp(system.addressType, FALSE);
  4618. Designate(actualParameter, src);
  4619. Designate(variableDesignator, dest);
  4620. IntermediateCode.MakeMemory(dest.op,addressType);
  4621. Emit(Mov(x.position, dest.op, src.op));
  4622. ReleaseOperand(dest);
  4623. IF src.tag.mode # IntermediateCode.Undefined THEN
  4624. tagDesignator := GetTemp(system.addressType, FALSE);
  4625. Designate(tagDesignator, dest);
  4626. IntermediateCode.MakeMemory(dest.op,addressType);
  4627. Emit(Mov(x.position, dest.op, src.op));
  4628. END;
  4629. ReleaseOperand(dest); ReleaseOperand(src);
  4630. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4631. END;
  4632. *)
  4633. formalParameter := formalParameter.nextParameter;
  4634. INC(i);
  4635. END;
  4636. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4637. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4638. currentMapper.Add(NIL, returnDesignator, NIL);
  4639. END;
  4640. localVariable := procedure.procedureScope.firstVariable;
  4641. WHILE ~tooComplex & (localVariable # NIL) DO
  4642. variableDesignator := GetTemp(localVariable.type, FALSE);
  4643. currentMapper.Add(localVariable, variableDesignator, NIL);
  4644. localVariable := localVariable.nextVariable;
  4645. END;
  4646. IF ~tooComplex THEN
  4647. VisitStatementBlock(procedure.procedureScope.body);
  4648. SetLabel(currentInlineExit);
  4649. IF procedureType.returnType # NIL THEN
  4650. Designate(returnDesignator, result);
  4651. IF conditional THEN
  4652. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4653. ValueToCondition(result)
  4654. END;
  4655. END;
  4656. END;
  4657. currentMapper := prevMapper;
  4658. currentInlineExit := prevInlineExit;
  4659. currentIsInline := wasInline;
  4660. RETURN ~tooComplex
  4661. END InlineProcedureCall;
  4662. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4663. VAR
  4664. parameters: SyntaxTree.ExpressionList;
  4665. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4666. designator: SyntaxTree.Designator;
  4667. procedureType: SyntaxTree.ProcedureType;
  4668. formalParameter: SyntaxTree.Parameter;
  4669. operand, returnValue: Operand;
  4670. reg, size, mask, dest: IntermediateCode.Operand;
  4671. saved: RegisterEntry;
  4672. symbol: SyntaxTree.Symbol;
  4673. variable: SyntaxTree.Variable;
  4674. i, parametersSize, returnTypeSize : LONGINT;
  4675. structuredReturnType: BOOLEAN;
  4676. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4677. tempVariableDesignator: SyntaxTree.Designator;
  4678. gap, alignment: LONGINT; (*fld*)
  4679. (* TODO: remove unnecessary backup variables *)
  4680. oldResult: Operand;
  4681. oldCurrentScope: SyntaxTree.Scope;
  4682. oldArrayDestinationTag: IntermediateCode.Operand;
  4683. oldArrayDestinationDimension: LONGINT;
  4684. oldConstantDeclaration: SyntaxTree.Symbol;
  4685. oldDestination: IntermediateCode.Operand;
  4686. oldCurrentLoop: Label;
  4687. oldConditional: BOOLEAN;
  4688. oldTrueLabel, oldFalseLabel: Label;
  4689. oldLocked: BOOLEAN;
  4690. usedRegisters,oldUsedRegisters: RegisterEntry;
  4691. return: IntermediateCode.Operand;
  4692. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4693. arg: IntermediateCode.Operand;
  4694. dummy: IntermediateCode.Operand;
  4695. recordType: SyntaxTree.RecordType;
  4696. operatorSelectionProcedureOperand: Operand;
  4697. operatorSelectionProcedure: SyntaxTree.Procedure;
  4698. fingerPrint: SyntaxTree.FingerPrint;
  4699. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4700. identifierNumber: LONGINT;
  4701. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4702. procedure: SyntaxTree.Procedure;
  4703. PROCEDURE BackupGlobalState;
  4704. BEGIN
  4705. oldResult := result;
  4706. oldCurrentScope := currentScope;
  4707. oldArrayDestinationTag := arrayDestinationTag;
  4708. oldArrayDestinationDimension := arrayDestinationDimension;
  4709. oldConstantDeclaration := constantDeclaration;
  4710. oldDestination := destination;
  4711. oldCurrentLoop := currentLoop;
  4712. oldConditional := conditional;
  4713. oldTrueLabel := trueLabel;
  4714. oldFalseLabel := falseLabel;
  4715. oldLocked := locked;
  4716. oldUsedRegisters := usedRegisters
  4717. END BackupGlobalState;
  4718. PROCEDURE RestoreGlobalState;
  4719. BEGIN
  4720. result := oldResult;
  4721. currentScope := oldCurrentScope;
  4722. arrayDestinationTag := oldArrayDestinationTag;
  4723. arrayDestinationDimension := oldArrayDestinationDimension;
  4724. constantDeclaration := oldConstantDeclaration;
  4725. destination := oldDestination;
  4726. currentLoop := oldCurrentLoop;
  4727. conditional := oldConditional;
  4728. trueLabel := oldTrueLabel;
  4729. falseLabel := oldFalseLabel;
  4730. locked := oldLocked;
  4731. usedRegisters := oldUsedRegisters
  4732. END RestoreGlobalState;
  4733. (** do preparations before parameter push for array-structured object types (ASOTs):
  4734. if ASOT is passed as VAR parameter:
  4735. - allocate temporary variable of math array type
  4736. - copy contents of ASOT to be passed to temporary variable
  4737. - use temporary variable as the actual parameter instead
  4738. - 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)
  4739. **)
  4740. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4741. VAR
  4742. expression: SyntaxTree.Expression;
  4743. BEGIN
  4744. IF actualParameter IS SyntaxTree.Designator THEN
  4745. designator := actualParameter(SyntaxTree.Designator);
  4746. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4747. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4748. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4749. ASSERT(checker # NIL);
  4750. checker.SetCurrentScope(currentScope);
  4751. (* allocate temporary variable *)
  4752. ASSERT(actualParameter.type # NIL);
  4753. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4754. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4755. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4756. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4757. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4758. ASSERT(tempVariableDesignator.type # NIL);
  4759. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4760. (* copy math array stored in actual parameter to temporary variable *)
  4761. BackupGlobalState;
  4762. AssignMathArray(tempVariableDesignator, actualParameter);
  4763. RestoreGlobalState;
  4764. (* use temporary variable as actual parameter instead of the original one *)
  4765. actualParameter := tempVariableDesignator;
  4766. (* create write-back call and store it in linked list *)
  4767. (* create new list entry *)
  4768. IF firstWriteBackCall = NIL THEN
  4769. NEW(firstWriteBackCall);
  4770. currentWriteBackCall := firstWriteBackCall
  4771. ELSE
  4772. ASSERT(currentWriteBackCall # NIL);
  4773. NEW(currentWriteBackCall.next);
  4774. currentWriteBackCall := currentWriteBackCall.next
  4775. END;
  4776. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4777. ASSERT(expression.type = NIL);
  4778. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4779. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4780. (* prepare writeback for any other "normal" indexer *)
  4781. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4782. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4783. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4784. Assign(tempVariableDesignator, actualParameter);
  4785. actualParameter := tempVariableDesignator;
  4786. IF firstWriteBackCall = NIL THEN
  4787. NEW(firstWriteBackCall);
  4788. currentWriteBackCall := firstWriteBackCall
  4789. ELSE
  4790. ASSERT(currentWriteBackCall # NIL);
  4791. NEW(currentWriteBackCall.next);
  4792. currentWriteBackCall := currentWriteBackCall.next
  4793. END;
  4794. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4795. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4796. END
  4797. END
  4798. END PrepareParameter;
  4799. BEGIN
  4800. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4801. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4802. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4803. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4804. IF InlineProcedureCall(x) THEN
  4805. RETURN
  4806. ELSE
  4807. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4808. END
  4809. END;
  4810. END;
  4811. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4812. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4813. dest := destination; destination := emptyOperand;
  4814. SaveRegisters();ReleaseUsedRegisters(saved);
  4815. parameters := x.parameters;
  4816. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4817. (* an operator is called *)
  4818. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4819. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4820. (* check if a dynamic operator call should be performed *)
  4821. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4822. ELSE
  4823. isCallOfDynamicOperator := FALSE
  4824. END;
  4825. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4826. Emit(Push(position, ap));
  4827. END;
  4828. alignment := procedureType.stackAlignment;
  4829. IF alignment > 1 THEN
  4830. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4831. Emit(Mov(position,reg, sp));
  4832. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4833. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4834. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4835. Emit(And(position,sp, sp, mask));
  4836. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4837. Emit(Push(position,reg));
  4838. (*
  4839. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4840. Emit(Mov(position,mem,reg));
  4841. *)
  4842. ReleaseIntermediateOperand(reg);
  4843. END;
  4844. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4845. IntermediateCode.InitImmediate(mask,addressType,-16);
  4846. Emit(And(position,sp, sp, mask));
  4847. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4848. IF gap # 0 THEN
  4849. IntermediateCode.InitImmediate(size,addressType,gap);
  4850. Emit(Sub(position,sp,sp,size))
  4851. END;
  4852. END;
  4853. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4854. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4855. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4856. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4857. ELSE
  4858. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4859. END;
  4860. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4861. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4862. (* push ID *)
  4863. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4864. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4865. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4866. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4867. formalParameter := procedureType.firstParameter;
  4868. FOR i := 0 TO parameters.Length() - 1 DO
  4869. IF formalParameter.access # SyntaxTree.Hidden THEN
  4870. ASSERT(i < 2);
  4871. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4872. (* push pointer *)
  4873. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4874. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4875. (* add dereference *)
  4876. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4877. ReleaseIntermediateOperand(parameterBackups[i]);
  4878. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4879. END;
  4880. Emit(Push(position,parameterBackups[i]));
  4881. ReleaseIntermediateOperand(parameterBackups[i]);
  4882. (* push typetag *)
  4883. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4884. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4885. arg := TypeDescriptorAdr(recordType);
  4886. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4887. Emit(Push(position,arg));
  4888. ELSE
  4889. (* push 'NonPointer' *)
  4890. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4891. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4892. (* push fingerprint *)
  4893. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4894. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4895. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4896. END
  4897. END;
  4898. formalParameter := formalParameter.nextParameter
  4899. END;
  4900. (* for unary operators: complete the information for the second parameter *)
  4901. IF procedureType.numberParameters < 2 THEN
  4902. (* push 'NonPointer' *)
  4903. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4904. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4905. (* push 'NoType' *)
  4906. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4907. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4908. END;
  4909. (* call operator selection procedure *)
  4910. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4911. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4912. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4913. ReleaseOperand(operatorSelectionProcedureOperand);
  4914. (* use the address that the operator selection procedure returned as the target address of the call *)
  4915. InitOperand(operand, ModeValue);
  4916. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4917. Emit(Result(position,operand.op))
  4918. END
  4919. ELSE
  4920. Evaluate(x.left, operand)
  4921. END;
  4922. IF symbol IS SyntaxTree.Procedure THEN
  4923. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4924. Emit(Push(position,operand.tag));
  4925. ELSIF (procedureType.isDelegate) THEN
  4926. Emit(Push(position,operand.tag));
  4927. END;
  4928. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4929. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4930. Emit(Push(position,operand.tag));
  4931. END;
  4932. ELSE HALT(200);
  4933. END;
  4934. ReleaseIntermediateOperand(operand.tag);
  4935. operand.tag := emptyOperand;
  4936. (* determine if a structured return type is needed *)
  4937. structuredReturnType := StructuredReturnType(procedureType);
  4938. IF structuredReturnType THEN
  4939. IF resultDesignator # NIL THEN
  4940. d := resultDesignator;
  4941. ELSE
  4942. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4943. variable.SetUntraced(procedureType.hasUntracedReturn);
  4944. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4945. d.SetType(variable.type);
  4946. END;
  4947. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4948. Designate(d,returnValue);
  4949. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4950. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4951. Emit(Push(position,size));
  4952. Emit(Push(position,returnValue.op));
  4953. ReleaseOperand(returnValue);
  4954. ELSE
  4955. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4956. END;
  4957. END;
  4958. firstWriteBackCall := NIL; (* reset write-back call list *)
  4959. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4960. passByRegister := system.registerParameters > 0;
  4961. registerNumber := 0;
  4962. formalParameter := procedureType.lastParameter;
  4963. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4964. actualParameter := parameters.GetExpression(i);
  4965. PrepareParameter(actualParameter, formalParameter);
  4966. IF passByRegister & (i < system.registerParameters) THEN
  4967. IF ~PassInRegister(formalParameter) THEN
  4968. Error(actualParameter.position,"cannot be passed by register")
  4969. ELSE
  4970. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4971. END;
  4972. INC(registerNumber);
  4973. ELSE
  4974. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4975. END;
  4976. formalParameter := formalParameter.prevParameter;
  4977. END;
  4978. IF passByRegister & (registerNumber > 0) THEN
  4979. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4980. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4981. END;
  4982. ELSE
  4983. hasDynamicOperands := FALSE;
  4984. formalParameter := procedureType.firstParameter;
  4985. FOR i := 0 TO parameters.Length() - 1 DO
  4986. actualParameter := parameters.GetExpression(i);
  4987. IF formalParameter # NIL THEN (* TENTATIVE *)
  4988. PrepareParameter(actualParameter, formalParameter);
  4989. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4990. ASSERT(i < 2);
  4991. hasDynamicOperands := TRUE;
  4992. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4993. ELSE
  4994. IF passByRegister & (registerNumber > 0) THEN
  4995. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4996. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4997. END;
  4998. passByRegister := FALSE;
  4999. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5000. END;
  5001. formalParameter := formalParameter.nextParameter;
  5002. END;
  5003. END;
  5004. END;
  5005. IF symbol IS SyntaxTree.Procedure THEN
  5006. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5007. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5008. Emit(Push(position,reg));
  5009. ReleaseIntermediateOperand(reg);
  5010. END;
  5011. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5012. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5013. parametersSize := ParametersSize(system,procedureType,FALSE);
  5014. END;
  5015. ReleaseParameterRegisters();
  5016. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5017. Emit(Call(position,operand.op,0));
  5018. ELSE
  5019. Emit(Call(position,operand.op,parametersSize));
  5020. END;
  5021. ReleaseOperand(operand);
  5022. IF procedureType.noReturn THEN
  5023. EmitTrap(position,NoReturnTrap);
  5024. END;
  5025. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5026. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5027. Emit(Result(position,return));
  5028. END;
  5029. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5030. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5031. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5032. END;
  5033. size := IntermediateCode.Immediate(addressType,parametersSize);
  5034. Emit(Add(position,sp,sp,size));
  5035. END;
  5036. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5037. IF structuredReturnType THEN
  5038. (* stack pointer rewinding done by callee
  5039. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5040. Emit(Add(position,sp,sp,size));
  5041. *)
  5042. RestoreRegisters(saved);
  5043. InitOperand(result,ModeReference);
  5044. Symbol(variable,result);
  5045. ELSE
  5046. RestoreRegisters(saved);
  5047. InitOperand(result,ModeValue);
  5048. result.op := return;
  5049. END;
  5050. END;
  5051. IF alignment > 1 THEN
  5052. Emit(Pop(position,sp));
  5053. END;
  5054. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5055. Emit(Pop(position, ap));
  5056. END;
  5057. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5058. ValueToCondition(result);
  5059. END;
  5060. destination := dest;
  5061. (* perform all write-back calls in the list *)
  5062. BackupGlobalState;
  5063. currentWriteBackCall := firstWriteBackCall;
  5064. WHILE currentWriteBackCall # NIL DO
  5065. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5066. currentWriteBackCall := currentWriteBackCall.next
  5067. END;
  5068. RestoreGlobalState;
  5069. (* TENATIVE *)
  5070. (*
  5071. IF isOperatorCall THEN
  5072. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5073. END;
  5074. *)
  5075. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5076. END VisitProcedureCallDesignator;
  5077. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5078. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5079. td: SyntaxTree.Symbol;
  5080. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5081. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5082. BEGIN
  5083. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5084. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5085. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5086. variable.SetType(system.anyType);
  5087. scope.AddVariable(variable);
  5088. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5089. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5090. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5091. typeDeclaration.SetScope(module.module.moduleScope);
  5092. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5093. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5094. END;
  5095. RETURN hiddenPointerType;
  5096. END GetHiddenPointerType;
  5097. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5098. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5099. BEGIN
  5100. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5101. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5102. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5103. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5104. scope.AddVariable(variable);
  5105. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5106. variable.SetType(system.anyType);
  5107. scope.AddVariable(variable);
  5108. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5109. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5110. typeDeclaration.SetDeclaredType(delegatePointerType);
  5111. typeDeclaration.SetScope(module.module.moduleScope);
  5112. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5113. delegatePointerType.SetState(SyntaxTree.Resolved);
  5114. END;
  5115. RETURN delegatePointerType
  5116. END GetDelegateType;
  5117. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5118. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5119. such as in VAR a: RECORD ... END;
  5120. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5121. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5122. *)
  5123. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5124. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5125. BEGIN (* no code emission *)
  5126. source := NIL;
  5127. x := x.resolved;
  5128. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5129. x := GetHiddenPointerType();
  5130. ELSIF IsDelegate(x) THEN
  5131. x := GetDelegateType();
  5132. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5133. ELSE HALT(200);
  5134. END;
  5135. td := x.typeDeclaration;
  5136. IF td = NIL THEN
  5137. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5138. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5139. ASSERT(td # NIL);
  5140. END;
  5141. IF newObjectFile THEN
  5142. GetCodeSectionNameForSymbol(td,name);
  5143. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5144. meta.CheckTypeDeclaration(x);
  5145. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5146. ELSE
  5147. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5148. END;
  5149. IF backend.cooperative OR meta.simple THEN
  5150. offset := 0;
  5151. ELSE
  5152. IF x IS SyntaxTree.CellType THEN
  5153. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5154. IF baseRecord = NIL THEN
  5155. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5156. ELSE
  5157. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5158. END;
  5159. ELSE
  5160. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5161. END;
  5162. END;
  5163. ELSE
  5164. offset := 0;
  5165. source := module.allSections.FindBySymbol(td); (*TODO*)
  5166. IF source = NIL THEN
  5167. null := 0;
  5168. GetCodeSectionNameForSymbol(td,name);
  5169. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5170. IntermediateCode.InitImmediate(op,addressType,0);
  5171. source(IntermediateCode.Section).Emit(Data(position,op));
  5172. source.SetReferenced(FALSE)
  5173. ELSE
  5174. name := source.name;
  5175. END;
  5176. END;
  5177. RETURN td
  5178. END GetBackendType;
  5179. BEGIN
  5180. (*td := t.typeDeclaration;*)
  5181. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5182. (*
  5183. IF t IS SyntaxTree.PointerType THEN
  5184. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5185. ELSE
  5186. source := GetBackendType(t);
  5187. END;
  5188. *)
  5189. IF newObjectFile THEN
  5190. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5191. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5192. IntermediateCode.SetOffset(res,offset);
  5193. ELSE
  5194. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5195. END;
  5196. (*
  5197. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5198. make memory should be used when tag is used, not earlier
  5199. *)
  5200. RETURN res
  5201. END TypeDescriptorAdr;
  5202. (*
  5203. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5204. VAR result: IntermediateCode.Operand;
  5205. BEGIN
  5206. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5207. operand.tag := TypeDescriptorAdr(operand.type);
  5208. IntermediateCode.MakeMemory(operand.tag,addressType);
  5209. UseIntermediateOperand(operand.tag);
  5210. END;
  5211. END MakeTypeTag;
  5212. *)
  5213. PROCEDURE ProfilerInit;
  5214. VAR reg: IntermediateCode.Operand;
  5215. BEGIN
  5216. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5217. Emit(Call(position,reg,0));
  5218. END ProfilerInit;
  5219. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5220. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5221. BEGIN
  5222. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5223. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5224. THEN
  5225. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5226. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5227. Emit(Push(position,reg));
  5228. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5229. Emit(Push(position,reg));
  5230. StaticCallOperand(result,procedure);
  5231. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5232. ReleaseOperand(result);
  5233. END;
  5234. END ProfilerEnterExit;
  5235. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5236. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5237. BEGIN
  5238. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5239. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5240. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5241. profileInit.Emit(Push(position,reg));
  5242. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5243. profileInit.Emit(Push(position,reg));
  5244. NEW(string, LEN(name)); COPY(name, string^);
  5245. sv := SyntaxTree.NewStringValue(-1,string);
  5246. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5247. sv.SetType(type);
  5248. Designate(sv,result);
  5249. profileInit.Emit(Push(position,result.tag));
  5250. profileInit.Emit(Push(position,result.op));
  5251. StaticCallOperand(result,procedure);
  5252. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5253. ReleaseOperand(result);
  5254. END;
  5255. END ProfilerAddProcedure;
  5256. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5257. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5258. BEGIN
  5259. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5260. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5261. profileInit.Emit(Push(position,reg));
  5262. profileInitPatchPosition := profileInit.pc;
  5263. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5264. NEW(string, LEN(name)); COPY(name, string^);
  5265. sv := SyntaxTree.NewStringValue(-1,string);
  5266. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5267. sv.SetType(type);
  5268. Designate(sv,result);
  5269. profileInit.Emit(Push(position,result.tag));
  5270. profileInit.Emit(Push(position,result.op));
  5271. StaticCallOperand(result,procedure);
  5272. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5273. ReleaseOperand(result);
  5274. END;
  5275. END ProfilerAddModule;
  5276. PROCEDURE ProfilerPatchInit;
  5277. VAR reg: IntermediateCode.Operand;
  5278. BEGIN
  5279. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5280. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5281. EmitLeave(profileInit,position,0);
  5282. profileInit.Emit(Exit(position,0,0));
  5283. END ProfilerPatchInit;
  5284. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5285. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5286. VAR
  5287. id: LONGINT;
  5288. leftType, rightType: SyntaxTree.Type;
  5289. procedureType: SyntaxTree.ProcedureType;
  5290. runtimeProcedure: SyntaxTree.Procedure;
  5291. runtimeProcedureOperand, operatorOperand: Operand;
  5292. kind: SET;
  5293. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5294. VAR
  5295. arg: IntermediateCode.Operand;
  5296. recordType: SyntaxTree.RecordType;
  5297. fingerPrint: SyntaxTree.FingerPrint;
  5298. BEGIN
  5299. IF type = NIL THEN
  5300. (* no type: push 'NoType' *)
  5301. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5302. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5303. ELSIF IsStrictlyPointerToRecord(type) THEN
  5304. (* pointer to record type: push typetag *)
  5305. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5306. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5307. arg := TypeDescriptorAdr(recordType);
  5308. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5309. ELSE
  5310. (* non-pointer to record type: push fingerprint *)
  5311. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5312. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5313. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5314. END;
  5315. operatorInitializationCodeSection.Emit(Push(position,arg))
  5316. END PushTypeInfo;
  5317. BEGIN
  5318. ASSERT(operatorInitializationCodeSection # NIL);
  5319. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5320. procedureType := operator.type(SyntaxTree.ProcedureType);
  5321. (* determine types *)
  5322. leftType := procedureType.firstParameter.type;
  5323. IF procedureType.numberParameters = 2 THEN
  5324. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5325. rightType := procedureType.firstParameter.nextParameter.type;
  5326. ELSE
  5327. rightType := NIL
  5328. END;
  5329. (* determine operator kind *)
  5330. IF IsStrictlyPointerToRecord(leftType) THEN
  5331. kind := {LhsIsPointer}
  5332. ELSE
  5333. kind := {}
  5334. END;
  5335. IF IsStrictlyPointerToRecord(rightType) THEN
  5336. kind := kind + {RhsIsPointer}
  5337. END;
  5338. IF kind # {} THEN (* TODO: to be removed later on *)
  5339. (* at least one of the types is a pointer to record *)
  5340. (* emit a code that registers this specific operator in the runtime *)
  5341. dump := operatorInitializationCodeSection.comments;
  5342. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5343. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5344. (* push ID *)
  5345. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5346. id := Global.GetSymbol(module.module.case, operator.name);
  5347. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5348. (* push kind *)
  5349. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5350. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5351. (* push type infos *)
  5352. PushTypeInfo(leftType);
  5353. PushTypeInfo(rightType);
  5354. (* push operator address *)
  5355. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5356. StaticCallOperand(operatorOperand, operator);
  5357. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5358. ReleaseOperand(operatorOperand);
  5359. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5360. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5361. ReleaseOperand(runtimeProcedureOperand)
  5362. END
  5363. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5364. END
  5365. END RegisterDynamicOperator;
  5366. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5367. VAR
  5368. traceModule: SyntaxTree.Module;
  5369. procedure: SyntaxTree.Procedure;
  5370. procedureVariable: SyntaxTree.Variable;
  5371. s,msg: Basic.MessageString;
  5372. res: Operand;
  5373. i: LONGINT;
  5374. sv: SyntaxTree.StringValue;
  5375. type: SyntaxTree.Type;
  5376. recordType: SyntaxTree.RecordType;
  5377. printout: Printout.Printer;
  5378. stringWriter: Streams.StringWriter;
  5379. expression: SyntaxTree.Expression;
  5380. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5381. BEGIN
  5382. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5383. IF procedure = NIL THEN
  5384. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5385. END;
  5386. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5387. s := "procedure ";
  5388. Strings.Append(s,backend.traceModuleName);
  5389. Strings.Append(s,".");
  5390. Strings.Append(s,procedureName);
  5391. Strings.Append(s," not present");
  5392. Error(position,s);
  5393. RETURN FALSE
  5394. ELSE
  5395. RETURN TRUE
  5396. END;
  5397. END GetProcedure;
  5398. PROCEDURE CallProcedure;
  5399. VAR size: LONGINT;
  5400. BEGIN
  5401. IF procedure # NIL THEN
  5402. StaticCallOperand(result,procedure);
  5403. size := ProcedureParametersSize(system,procedure);
  5404. ELSE
  5405. Symbol(procedureVariable, result);
  5406. LoadValue(result, procedureVariable.type.resolved);
  5407. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5408. END;
  5409. Emit(Call(position,result.op,size));
  5410. END CallProcedure;
  5411. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5412. VAR res: Operand; string: SyntaxTree.String;
  5413. BEGIN
  5414. IF GetProcedure("String") THEN
  5415. NEW(string, LEN(s)); COPY(s, string^);
  5416. sv := SyntaxTree.NewStringValue(-1,string);
  5417. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5418. sv.SetType(type);
  5419. Designate(sv,res);
  5420. Emit(Push(position,res.tag));
  5421. Emit(Push(position,res.op));
  5422. ReleaseOperand(res);
  5423. CallProcedure;
  5424. END;
  5425. END String;
  5426. PROCEDURE Integer(op: IntermediateCode.Operand);
  5427. BEGIN
  5428. IF GetProcedure("Int") THEN
  5429. Emit(Push(position,op));
  5430. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5431. CallProcedure;
  5432. END;
  5433. END Integer;
  5434. PROCEDURE Float(op: IntermediateCode.Operand);
  5435. BEGIN
  5436. IF GetProcedure("HIntHex") THEN
  5437. Emit(Push(position,op));
  5438. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5439. CallProcedure;
  5440. END;
  5441. END Float;
  5442. PROCEDURE Set(op: IntermediateCode.Operand);
  5443. BEGIN
  5444. IF GetProcedure("Set") THEN
  5445. Emit(Push(position,op));
  5446. (*
  5447. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5448. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5449. *)
  5450. CallProcedure;
  5451. END;
  5452. END Set;
  5453. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5454. BEGIN
  5455. IF GetProcedure("Boolean") THEN
  5456. Emit(Push(position,op));
  5457. CallProcedure;
  5458. END;
  5459. END Boolean;
  5460. PROCEDURE Char(op: IntermediateCode.Operand);
  5461. BEGIN
  5462. IF GetProcedure("Char") THEN
  5463. Emit(Push(position,op));
  5464. CallProcedure;
  5465. END;
  5466. END Char;
  5467. PROCEDURE Address(op: IntermediateCode.Operand);
  5468. BEGIN
  5469. IF GetProcedure("Address") THEN
  5470. Emit(Push(position,op));
  5471. CallProcedure;
  5472. END;
  5473. END Address;
  5474. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5475. BEGIN
  5476. IF GetProcedure("String") THEN
  5477. Emit(Push(position,tag));
  5478. Emit(Push(position,op));
  5479. CallProcedure;
  5480. END;
  5481. END StringOperand;
  5482. PROCEDURE Ln;
  5483. BEGIN
  5484. IF GetProcedure("Ln") THEN
  5485. CallProcedure;
  5486. END;
  5487. END Ln;
  5488. BEGIN
  5489. IF backend.traceModuleName = "" THEN RETURN END;
  5490. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5491. IF GetProcedure("Enter") THEN
  5492. CallProcedure
  5493. END;
  5494. NEW(stringWriter,LEN(s));
  5495. FOR i := 0 TO x.Length()-1 DO
  5496. msg := "";
  5497. expression := x.GetExpression(i);
  5498. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5499. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5500. ELSE
  5501. Global.GetModuleName(module.module, s);
  5502. END;
  5503. IF i = 0 THEN
  5504. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5505. stringWriter.String(":");
  5506. END;
  5507. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5508. IF ~(expression IS SyntaxTree.StringValue) THEN
  5509. printout.Expression(expression);
  5510. stringWriter.Get(s);
  5511. Strings.Append(msg,s);
  5512. Strings.Append(msg,"= ");
  5513. ELSE stringWriter.Get(s); (* remove from string writer *)
  5514. Strings.Append(msg, s);
  5515. END;
  5516. String(msg);
  5517. IF SemanticChecker.IsStringType(expression.type) THEN
  5518. Designate(expression,res);
  5519. StringOperand(res.op,res.tag);
  5520. ELSE
  5521. Evaluate(expression,res);
  5522. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5523. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5524. Convert(res.op,int64);
  5525. END;
  5526. Integer(res.op);
  5527. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5528. Boolean(res.op);
  5529. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5530. Set(res.op);
  5531. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5532. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5533. Convert(res.op,float64);
  5534. END;
  5535. Float(res.op);
  5536. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5537. Char(res.op);
  5538. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5539. Address(res.op);String("H");
  5540. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5541. Address(res.op);String("H");
  5542. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5543. Address(res.op);String("H");
  5544. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5545. Address(res.op);String("H");
  5546. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5547. String("NIL");
  5548. ELSE HALT(200);
  5549. END;
  5550. END;
  5551. ReleaseOperand(res);
  5552. String("; ");
  5553. END;
  5554. IF GetProcedure("Exit") THEN
  5555. CallProcedure
  5556. ELSE
  5557. Ln;
  5558. END;
  5559. END;
  5560. END SystemTrace;
  5561. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5562. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5563. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5564. BEGIN
  5565. type := type.resolved;
  5566. IF type IS SyntaxTree.RecordType THEN
  5567. WITH type: SyntaxTree.RecordType DO
  5568. baseType := type.baseType;
  5569. IF baseType # NIL THEN
  5570. baseType := baseType.resolved;
  5571. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5572. InitFields(baseType,adr,offset);
  5573. END;
  5574. variable := type.recordScope.firstVariable;
  5575. WHILE variable # NIL DO
  5576. IF variable.initializer # NIL THEN
  5577. Evaluate(variable.initializer,initializerOp);
  5578. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5579. Emit(Mov(position,mem,initializerOp.op));
  5580. ReleaseOperand(initializerOp);
  5581. ReleaseIntermediateOperand(mem);
  5582. END;
  5583. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5584. variable := variable.nextVariable
  5585. END;
  5586. END;
  5587. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5588. WITH type: SyntaxTree.ArrayType DO
  5589. IF type.form = SyntaxTree.Static THEN
  5590. baseType := type.arrayBase;
  5591. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5592. FOR i := 0 TO type.staticLength-1 DO
  5593. InitFields(baseType,adr,offset+i*size);
  5594. END;
  5595. END;
  5596. END;
  5597. ELSIF type IS SyntaxTree.MathArrayType THEN
  5598. WITH type: SyntaxTree.MathArrayType DO
  5599. IF type.form = SyntaxTree.Open THEN
  5600. dim := DynamicDim(type);
  5601. imm := IntermediateCode.Immediate(addressType,dim);
  5602. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5603. baseType := SemanticChecker.ArrayBase(type,dim);
  5604. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5605. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5606. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5607. ReleaseIntermediateOperand(imm);
  5608. (* flags remain empty (=0) for open array *)
  5609. ELSIF type.form = SyntaxTree.Static THEN
  5610. baseType := type.arrayBase;
  5611. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5612. ASSERT(type.staticLength < 1024*1024*1024);
  5613. FOR i := 0 TO type.staticLength-1 DO
  5614. InitFields(baseType,adr,offset+i*size);
  5615. END;
  5616. END;
  5617. END;
  5618. END;
  5619. END InitFields;
  5620. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5621. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5622. BEGIN
  5623. type := variable.type.resolved;
  5624. IF (type IS SyntaxTree.MathArrayType) THEN
  5625. WITH type: SyntaxTree.MathArrayType DO
  5626. IF type.form = SyntaxTree.Open THEN
  5627. Symbol(variable,operand);
  5628. InitFields(type, operand.tag,0);
  5629. ELSIF type.form = SyntaxTree.Tensor THEN
  5630. Symbol(variable, operand);
  5631. MakeMemory(tmp,operand.op,addressType,0);
  5632. ReleaseOperand(operand);
  5633. Emit(Mov(position,tmp, nil ) );
  5634. ReleaseIntermediateOperand(tmp);
  5635. END;
  5636. END;
  5637. ELSE
  5638. Symbol(variable,operand);
  5639. IF variable.initializer # NIL THEN
  5640. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5641. reference.SetType(variable.type.resolved);
  5642. reference.SetAssignable(TRUE);
  5643. Assign(reference,variable.initializer);
  5644. END;
  5645. InitFields(type, operand.op,0);
  5646. ReleaseOperand(operand);
  5647. END;
  5648. END InitVariable;
  5649. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5650. VAR end: Label;
  5651. BEGIN
  5652. IF type.form = SyntaxTree.Tensor THEN
  5653. InitOperand(result,ModeValue);
  5654. ReuseCopy(result.op,base);
  5655. end := NewLabel();
  5656. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5657. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5658. SetLabel(end);
  5659. Convert(result.op,int32);
  5660. ELSE
  5661. InitOperand(result,ModeValue);
  5662. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5663. END
  5664. END MathArrayDim;
  5665. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5666. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5667. BEGIN
  5668. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5669. MakeMemory(mem,base,addressType,offset);
  5670. Emit(Mov(position,mem,value));
  5671. ReleaseIntermediateOperand(mem);
  5672. END PutMathArrayField;
  5673. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5674. VAR mem: IntermediateCode.Operand;
  5675. BEGIN
  5676. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5677. MakeMemory(mem,base,addressType,offset);
  5678. Emit(Mov(position,mem,value));
  5679. ReleaseIntermediateOperand(mem);
  5680. END PutMathArrayFieldOffset;
  5681. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5682. BEGIN
  5683. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5684. MakeMemory(value,base,addressType,offset);
  5685. END GetMathArrayField;
  5686. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5687. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5688. BEGIN
  5689. IF incr THEN
  5690. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5691. ELSE
  5692. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5693. END;
  5694. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5695. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5696. ELSE
  5697. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5698. Emit(Mov(position,reg,dim));
  5699. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5700. Emit(Add(position,reg,reg,base));
  5701. MakeMemory(mem, reg, addressType, offset);
  5702. ReleaseIntermediateOperand(reg);
  5703. Emit(Mov(position,mem,value));
  5704. ReleaseIntermediateOperand(mem);
  5705. END;
  5706. END PutMathArrayLenOrIncr;
  5707. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5708. BEGIN
  5709. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5710. END PutMathArrayLength;
  5711. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5712. BEGIN
  5713. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5714. END PutMathArrayIncrement;
  5715. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5716. BEGIN
  5717. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5718. END GetMathArrayIncrement;
  5719. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5720. BEGIN
  5721. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5722. END GetMathArrayLength;
  5723. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5724. VAR dimOp: IntermediateCode.Operand;
  5725. BEGIN
  5726. dimOp := IntermediateCode.Immediate(int32, dim);
  5727. GetMathArrayLength(type, operand, dimOp, check, result);
  5728. END GetMathArrayLengthAt;
  5729. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5730. VAR dimOp: IntermediateCode.Operand;
  5731. BEGIN
  5732. dimOp := IntermediateCode.Immediate(int32, dim);
  5733. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5734. END GetMathArrayIncrementAt;
  5735. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5736. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5737. offset: LONGINT;
  5738. BEGIN
  5739. IF increment THEN
  5740. offset := MathIncrOffset;
  5741. ELSE
  5742. offset := MathLenOffset;
  5743. END;
  5744. INC(offset,operand.dimOffset*2);
  5745. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5746. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5747. END;
  5748. (* static dimension *)
  5749. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5750. IF check & (type.form = SyntaxTree.Tensor) THEN
  5751. DimensionCheck(operand.tag,dim,BrltL);
  5752. END;
  5753. val := SHORT(dim.intValue);
  5754. IF type.form # SyntaxTree.Tensor THEN
  5755. t := SemanticChecker.ArrayBase(type,val);
  5756. type := t.resolved(SyntaxTree.MathArrayType);
  5757. IF type.form = SyntaxTree.Static THEN
  5758. IF increment THEN
  5759. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5760. ELSE
  5761. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5762. END;
  5763. InitOperand(result,ModeValue);
  5764. result.op := res;
  5765. RETURN;
  5766. END;
  5767. END;
  5768. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5769. MakeMemory(res,operand.tag,addressType,offset);
  5770. (*
  5771. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5772. *)
  5773. InitOperand(result,ModeValue);
  5774. result.op := res;
  5775. ELSE
  5776. Convert(dim,addressType);
  5777. IF check THEN
  5778. IF type.form = SyntaxTree.Tensor THEN
  5779. DimensionCheck(operand.tag,dim,BrltL);
  5780. ELSIF isUnchecked THEN (* do nothing *)
  5781. ELSE
  5782. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5783. END;
  5784. END;
  5785. end := NewLabel(); next := NIL;
  5786. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5787. Emit(Mov(position,res,dim));
  5788. Convert(res,int32);
  5789. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5790. WHILE t IS SyntaxTree.MathArrayType DO
  5791. type := t(SyntaxTree.MathArrayType);
  5792. IF type.form = SyntaxTree.Static THEN
  5793. imm := IntermediateCode.Immediate(int32,val);
  5794. next := NewLabel();
  5795. BrneL(next,imm,res);
  5796. IF increment THEN
  5797. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5798. ELSE
  5799. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5800. END;
  5801. Emit(MovReplace(position,res,imm));
  5802. BrL(end);
  5803. ELSE hasDynamicPart := TRUE;
  5804. END;
  5805. t := type.arrayBase.resolved;
  5806. val := val + 1;
  5807. IF next # NIL THEN SetLabel(next) END;
  5808. END;
  5809. IF hasDynamicPart THEN
  5810. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5811. Emit(Mov(position,res2,dim));
  5812. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5813. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5814. Emit(Add(position,res2,res2,imm));
  5815. Emit(Add(position,res2,res2,operand.tag));
  5816. IntermediateCode.MakeMemory(res2,int32);
  5817. Emit(MovReplace(position,res,res2));
  5818. ReleaseIntermediateOperand(res2);
  5819. END;
  5820. SetLabel(end);
  5821. Convert(res,int32);
  5822. InitOperand(result,ModeValue);
  5823. result.op := res;
  5824. END;
  5825. END MathArrayLenOrIncr;
  5826. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5827. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5828. offset: LONGINT;
  5829. BEGIN
  5830. offset := operand.dimOffset+DynamicDim(type)-1;
  5831. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5832. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5833. val := SHORT(dim.intValue);
  5834. t := SemanticChecker.ArrayBase(type,val);
  5835. type := t.resolved(SyntaxTree.ArrayType);
  5836. IF type.form = SyntaxTree.Static THEN
  5837. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5838. ELSE
  5839. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5840. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5841. END;
  5842. UseIntermediateOperand(res);
  5843. InitOperand(result,ModeValue);
  5844. result.op := res;
  5845. ELSE
  5846. Convert(dim,addressType);
  5847. IF ~isUnchecked THEN
  5848. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5849. END;
  5850. end := NewLabel(); next := NIL;
  5851. (* ReuseCopy(dim,res); *)
  5852. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5853. Emit(Mov(position,res,dim));
  5854. Convert(res,int32);
  5855. Convert(res,int32);
  5856. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5857. WHILE t IS SyntaxTree.ArrayType DO
  5858. type := t(SyntaxTree.ArrayType);
  5859. IF type.form = SyntaxTree.Static THEN
  5860. imm := IntermediateCode.Immediate(int32,val);
  5861. next := NewLabel();
  5862. BrneL(next,imm,res);
  5863. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5864. Emit(MovReplace(position,res,imm));
  5865. BrL(end);
  5866. ELSE hasDynamicPart := TRUE;
  5867. END;
  5868. t := type.arrayBase.resolved;
  5869. val := val + 1;
  5870. IF next # NIL THEN SetLabel(next) END;
  5871. END;
  5872. IF hasDynamicPart THEN
  5873. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5874. Convert(res2,addressType);
  5875. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5876. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5877. Emit(Sub(position,res2,imm,res2));
  5878. Emit(Add(position,res2,res2,operand.tag));
  5879. IntermediateCode.MakeMemory(res2,int32);
  5880. Emit(MovReplace(position,res,res2));
  5881. ReleaseIntermediateOperand(res2);
  5882. END;
  5883. SetLabel(end);
  5884. Convert(res,int32);
  5885. InitOperand(result,ModeValue);
  5886. result.op := res;
  5887. END;
  5888. END ArrayLen;
  5889. (**
  5890. create a temporary variable in current scope
  5891. **)
  5892. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5893. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5894. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5895. BEGIN
  5896. IF ~register THEN
  5897. variable := temporaries.GetFreeVariable(type, index);
  5898. ELSE
  5899. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5900. END;
  5901. scope := currentScope;
  5902. IF variable = NIL THEN
  5903. COPY("@hiddenIRVar",string);
  5904. Basic.AppendNumber(string,index);
  5905. name := SyntaxTree.NewIdentifier(string);
  5906. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5907. variable.SetType(type);
  5908. variable.SetAccess(SyntaxTree.Hidden);
  5909. IF ~register THEN
  5910. temporaries.AddVariable(variable);
  5911. IF scope.lastVariable # NIL THEN
  5912. offset := scope.lastVariable.offsetInBits;
  5913. ELSE
  5914. offset := 0;
  5915. END;
  5916. DEC(offset,system.SizeOf(variable.type));
  5917. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5918. variable(SyntaxTree.Variable).SetOffset(offset);
  5919. scope.AddVariable(variable(SyntaxTree.Variable));
  5920. scope.EnterSymbol(variable, duplicate);
  5921. ASSERT(~duplicate);
  5922. InitVariable(variable(SyntaxTree.Variable));
  5923. ELSE
  5924. variable.SetUseRegister(TRUE);
  5925. variable(SyntaxTree.Variable).SetOffset(0);
  5926. END;
  5927. ELSE
  5928. InitVariable(variable(SyntaxTree.Variable));
  5929. (*
  5930. ASSERT(variable.type.resolved = type.resolved)
  5931. *)
  5932. END;
  5933. RETURN variable(SyntaxTree.Variable)
  5934. END GetTemporaryVariable;
  5935. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5936. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5937. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5938. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5939. i: LONGINT; duplicate: BOOLEAN;
  5940. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5941. VAR variable: SyntaxTree.Variable;
  5942. BEGIN
  5943. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5944. variable.SetType(type);
  5945. recordScope.AddVariable(variable);
  5946. END AddVariable;
  5947. BEGIN
  5948. name := "@ArrayDescriptor";
  5949. Basic.AppendNumber(name,dimensions);
  5950. identifier := SyntaxTree.NewIdentifier(name);
  5951. parentScope := module.module.moduleScope;
  5952. symbol := parentScope.FindSymbol(identifier);
  5953. IF symbol # NIL THEN
  5954. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5955. type := typeDeclaration.declaredType;
  5956. ELSE
  5957. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5958. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5959. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5960. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5961. recordType.SetTypeDeclaration(typeDeclaration);
  5962. recordType.SetState(SyntaxTree.Resolved);
  5963. typeDeclaration.SetDeclaredType(recordType);
  5964. AddVariable("@ptr",system.anyType);
  5965. AddVariable("@adr",system.addressType);
  5966. AddVariable("@flags",system.addressType);
  5967. AddVariable("@dim",system.addressType);
  5968. AddVariable("@elementSize",system.addressType);
  5969. FOR i := 0 TO dimensions-1 DO
  5970. name := "@len";
  5971. Basic.AppendNumber(name,i);
  5972. AddVariable(name,system.addressType);
  5973. name := "@incr";
  5974. Basic.AppendNumber(name,i);
  5975. AddVariable(name,system.addressType);
  5976. END;
  5977. parentScope.AddTypeDeclaration(typeDeclaration);
  5978. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5979. ASSERT(~duplicate);
  5980. type := recordType;
  5981. END;
  5982. RETURN type
  5983. END GetMathArrayDescriptorType;
  5984. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5985. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5986. BEGIN
  5987. type := GetMathArrayDescriptorType(dimensions);
  5988. Emit(Push(position,op.op));
  5989. (* push type descriptor *)
  5990. reg := TypeDescriptorAdr(type);
  5991. IF ~newObjectFile THEN
  5992. IntermediateCode.MakeMemory(reg,addressType);
  5993. END;
  5994. Emit(Push(position,reg));
  5995. ReleaseIntermediateOperand(reg);
  5996. (* push realtime flag: false by default *)
  5997. Emit(Push(position,false));
  5998. CallThis(position,"Heaps","NewRec",3);
  5999. END NewMathArrayDescriptor;
  6000. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6001. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6002. BEGIN
  6003. NEW(string, LEN(s)); COPY(s, string^);
  6004. sv := SyntaxTree.NewStringValue(-1,string);
  6005. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6006. sv.SetType(type);
  6007. Designate(sv,res);
  6008. Emit(Push(position,res.tag));
  6009. Emit(Push(position,res.op));
  6010. ReleaseOperand(res);
  6011. END PushConstString;
  6012. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6013. BEGIN
  6014. IF b THEN
  6015. Emit(Push(-1, true));
  6016. ELSE
  6017. Emit(Push(-1, false));
  6018. END;
  6019. END PushConstBoolean;
  6020. PROCEDURE PushConstSet(v: SET);
  6021. VAR value: SyntaxTree.Value; op: Operand;
  6022. BEGIN
  6023. value := SyntaxTree.NewSetValue(-1, v);
  6024. value.SetType(system.setType);
  6025. Evaluate(value, op);
  6026. Emit(Push(-1, op.op));
  6027. ReleaseOperand(op);
  6028. END PushConstSet;
  6029. PROCEDURE PushConstInteger(v: LONGINT);
  6030. VAR value: SyntaxTree.Value; op: Operand;
  6031. BEGIN
  6032. value := SyntaxTree.NewIntegerValue(-1, v);
  6033. value.SetType(system.longintType);
  6034. Evaluate(value, op);
  6035. Emit(Push(-1, op.op));
  6036. ReleaseOperand(op);
  6037. END PushConstInteger;
  6038. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6039. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6040. section: IntermediateCode.Section;
  6041. BEGIN
  6042. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6043. Global.GetSymbolSegmentedName(symbol, name);
  6044. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6045. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6046. procedure.SetScope(moduleScope);
  6047. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6048. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6049. procedure.SetAccess(SyntaxTree.Hidden);
  6050. currentScope := procedureScope;
  6051. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6052. EmitEnter(section, -1,NIL,0,0,0);
  6053. RETURN section;
  6054. END OpenInitializer;
  6055. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6056. BEGIN
  6057. EmitLeave(section, 0, 0 );
  6058. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6059. section := prev;
  6060. END CloseInitializer;
  6061. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6062. VAR name: SyntaxTree.IdentifierString;
  6063. variable: SyntaxTree.Variable;
  6064. type: SyntaxTree.Type;
  6065. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6066. BEGIN
  6067. InitOperand(op,ModeReference);
  6068. op.op := fp;
  6069. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6070. Dereference(op, x, FALSE);
  6071. result := op;
  6072. Symbol(symbol, op);
  6073. END Field;
  6074. PROCEDURE Direction(direction: LONGINT): SET;
  6075. BEGIN
  6076. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6077. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6078. ELSE HALT(100);
  6079. END;
  6080. END Direction;
  6081. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6082. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6083. BEGIN
  6084. Field(port, op);
  6085. ToMemory(op.op,addressType,0);
  6086. Emit(Push(-1, op.op));
  6087. ReleaseOperand(op);
  6088. Basic.GetString(modifier.identifier, name);
  6089. PushConstString(name);
  6090. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6091. ASSERT(SemanticChecker.IsStringType(value.type));
  6092. Designate(value, op);
  6093. Emit(Push(modifier.position, op.tag));
  6094. Emit(Push(modifier.position, op.op));
  6095. ReleaseOperand(op);
  6096. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6097. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6098. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6099. Evaluate(value, op);
  6100. Emit(Push(modifier.position, op.op));
  6101. ReleaseOperand(op);
  6102. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6103. ELSE
  6104. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6105. END;
  6106. END AddPortProperty;
  6107. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6108. VAR modifier: SyntaxTree.Modifier;
  6109. BEGIN
  6110. modifier := variable.modifiers;
  6111. WHILE modifier # NIL DO
  6112. AddPortProperty(variable,modifier, modifier.expression);
  6113. modifier := modifier.nextModifier;
  6114. END;
  6115. END AddPortProperties;
  6116. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6117. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6118. size, reg: IntermediateCode.Operand; dim: LONGINT;
  6119. PROCEDURE PushLens(type: SyntaxTree.Type);
  6120. BEGIN
  6121. IF type IS SyntaxTree.ArrayType THEN
  6122. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6123. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6124. Emit(Push(-1, op.op));
  6125. ReleaseOperand(op);
  6126. INC(dim);
  6127. ELSE
  6128. baseType := type;
  6129. END;
  6130. END PushLens;
  6131. BEGIN
  6132. (* cell *)
  6133. IF variable.type IS SyntaxTree.ArrayType THEN
  6134. type := variable.type;
  6135. dim := 0;
  6136. PushLens(type);
  6137. portType := baseType.resolved(SyntaxTree.PortType);
  6138. ELSE
  6139. portType := variable.type(SyntaxTree.PortType);
  6140. END;
  6141. PushSelfPointer();
  6142. (* port *)
  6143. Field(variable, op);
  6144. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6145. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6146. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6147. Designate(d, op);*)
  6148. Emit(Push(-1, op.op));
  6149. ReleaseOperand(op);
  6150. (* name *)
  6151. PushConstString(name);
  6152. (* inout *)
  6153. PushConstSet(Direction(portType.direction));
  6154. (* width *)
  6155. PushConstInteger(portType.sizeInBits);
  6156. IF variable.type IS SyntaxTree.PortType THEN
  6157. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6158. AddPortProperties(variable);
  6159. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  6160. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6161. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6162. Emit(Add(position,reg, sp, size));
  6163. (* dim *)
  6164. PushConstInteger(dim);
  6165. (* len array *)
  6166. Emit(Push(position, reg));
  6167. ReleaseIntermediateOperand(reg);
  6168. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6169. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6170. Emit(Add(position, sp,sp, size));
  6171. END;
  6172. END Variable;
  6173. BEGIN
  6174. IF backend.cellsAreObjects THEN
  6175. variable := x.cellScope.firstVariable;
  6176. WHILE (variable # NIL) DO
  6177. type := variable.type.resolved;
  6178. WHILE (type IS SyntaxTree.ArrayType) DO
  6179. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6180. END;
  6181. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6182. (*!!! check port arrays !! *)
  6183. Global.GetSymbolName(variable,name);
  6184. Variable(name,variable);
  6185. END;
  6186. variable := variable.nextVariable;
  6187. END;
  6188. ELSE HALT(200)
  6189. END;
  6190. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6191. (*
  6192. x.typeDeclaration.GetName(componentName);
  6193. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6194. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6195. instanceType.SetDataMemorySize(dataMemorySize);
  6196. END;
  6197. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6198. instanceType.SetInstructionMemorySize(codeMemorySize)
  6199. END;
  6200. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6201. instanceType.AddCapability(ActiveCells.VectorCapability)
  6202. END;
  6203. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6204. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6205. END;
  6206. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6207. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6208. END;
  6209. AddDevices(instanceType, x);
  6210. *)
  6211. (*
  6212. IF x.isCellNet THEN
  6213. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6214. END;
  6215. *)
  6216. (*currentActiveCellsScope := instanceType;*)
  6217. (*
  6218. parameter := x.firstParameter;
  6219. portIndex := 0;
  6220. WHILE parameter # NIL DO
  6221. parameter.GetName(parameterName);
  6222. parameterType := parameter.type.resolved;
  6223. Parameter(parameterName, parameterType);
  6224. (*
  6225. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6226. ParameterArray(parameterType);
  6227. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6228. FOR i := 0 TO len-1 DO
  6229. COPY(parameterName,name);
  6230. AppendIndex(name,i);
  6231. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6232. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6233. INC(portIndex);
  6234. END;
  6235. ELSE
  6236. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6237. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6238. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6239. INC(portIndex);
  6240. END;
  6241. *)
  6242. parameter := parameter.nextParameter;
  6243. END;
  6244. *)
  6245. (*
  6246. Scope(x.cellScope);
  6247. currentActiveCellsScope := prevActiveCellsScope;
  6248. AddModules(instanceType,x.cellScope);
  6249. *)
  6250. END AddPorts;
  6251. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6252. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6253. BEGIN
  6254. Symbol(cell,op);
  6255. ToMemory(op.op,addressType,0);
  6256. Emit(Push(position,op.op));
  6257. ReleaseOperand(op);
  6258. Basic.GetString(property.name, name);
  6259. PushConstString(name);
  6260. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6261. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6262. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6263. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6264. Designate(d, op);
  6265. IF SemanticChecker.IsStringType(property.type) THEN
  6266. Emit(Push(-1, op.tag))
  6267. END;
  6268. Emit(Push(-1, op.op));
  6269. ReleaseOperand(op);
  6270. END;
  6271. IF SemanticChecker.IsStringType(property.type) THEN
  6272. ASSERT(SemanticChecker.IsStringType(value.type));
  6273. Designate(value, op);
  6274. Emit(Push(property.position, op.tag));
  6275. Emit(Push(property.position, op.op));
  6276. ReleaseOperand(op);
  6277. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6278. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6279. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6280. Evaluate(value, op);
  6281. Emit(Push(property.position, op.op));
  6282. ReleaseOperand(op);
  6283. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6284. ELSE
  6285. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6286. END;
  6287. END AddProperty;
  6288. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6289. VAR symbol: SyntaxTree.Symbol;
  6290. BEGIN
  6291. WHILE modifier # NIL DO
  6292. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6293. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6294. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6295. ELSE
  6296. (*! move this check to checker *)
  6297. Error(modifier.position, "undefined property");
  6298. END;
  6299. modifier := modifier.nextModifier;
  6300. END;
  6301. END AddModifiers;
  6302. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6303. VAR last: SyntaxTree.Modifier;
  6304. BEGIN
  6305. IF to = NIL THEN
  6306. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6307. ELSE
  6308. last := to;
  6309. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6310. last := last.nextModifier;
  6311. END;
  6312. IF last.identifier # this.identifier THEN
  6313. ASSERT(last.nextModifier = NIL);
  6314. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6315. END;
  6316. END;
  6317. END AppendModifier;
  6318. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6319. BEGIN
  6320. WHILE this # NIL DO
  6321. AppendModifier(to, this);
  6322. this := this.nextModifier;
  6323. END;
  6324. END AppendModifiers;
  6325. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6326. VAR op: Operand;
  6327. BEGIN
  6328. Evaluate(p, op);
  6329. Emit(Push(p.position, op.op));
  6330. ReleaseOperand(op);
  6331. (*
  6332. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6333. p := p(SyntaxTree.Designator).left;
  6334. END;
  6335. IF p # NIL THEN
  6336. Evaluate(p, op);
  6337. Emit(Push(p.position, op.op));
  6338. ReleaseOperand(op);
  6339. ELSE
  6340. Emit(Push(-1, nil));
  6341. END;
  6342. *)
  6343. END PushPort;
  6344. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6345. VAR
  6346. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6347. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6348. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6349. tmp:IntermediateCode.Operand;
  6350. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6351. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6352. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6353. dest: IntermediateCode.Operand;
  6354. staticLength: LONGINT; itype: IntermediateCode.Type;
  6355. convert,isTensor: BOOLEAN;
  6356. recordType: SyntaxTree.RecordType;
  6357. baseType: SyntaxTree.Type;
  6358. flags: SET;
  6359. left: SyntaxTree.Expression;
  6360. call: SyntaxTree.Designator;
  6361. procedure: SyntaxTree.Procedure;
  6362. temporaryVariable: SyntaxTree.Variable;
  6363. dummy: IntermediateCode.Operand;
  6364. customBuiltin: SyntaxTree.CustomBuiltin;
  6365. isVarPar: ARRAY 3 OF BOOLEAN;
  6366. callsection: Sections.Section;
  6367. segmentedName: Basic.SegmentedName;
  6368. needsTrace: BOOLEAN;
  6369. n: ARRAY 256 OF CHAR;
  6370. modifier: SyntaxTree.Modifier;
  6371. previous, init: IntermediateCode.Section;
  6372. prevScope: SyntaxTree.Scope;
  6373. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6374. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6375. priority: IntermediateCode.Operand;
  6376. op,callop: Operand;
  6377. BEGIN
  6378. IF type = NIL THEN RETURN END;
  6379. type := type.resolved;
  6380. IF type IS SyntaxTree.PointerType THEN
  6381. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6382. END;
  6383. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6384. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6385. recordScope := type(SyntaxTree.RecordType).recordScope;
  6386. IF recordScope.bodyProcedure # NIL THEN
  6387. procedure := recordScope.bodyProcedure;
  6388. body := procedure.procedureScope.body;
  6389. Emit(Push(position,self));
  6390. IF body.isActive THEN
  6391. StaticCallOperand(callop,procedure);
  6392. Emit(Push(position,callop.op));
  6393. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6394. Convert(priority,sizeType);
  6395. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6396. END;
  6397. Emit(Push(position,priority));
  6398. ReleaseIntermediateOperand(priority);
  6399. IF backend.cooperative THEN
  6400. Emit(Push(position,self));
  6401. CallThis(position,"Activities","Create",3)
  6402. ELSE
  6403. flags := 0;
  6404. IF body.isSafe THEN
  6405. flags := 1;
  6406. END;
  6407. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6408. Emit(Push(position,self));
  6409. CallThis(position,"Objects","CreateProcess",4)
  6410. END;
  6411. ELSE
  6412. Emit(Push(position,self));
  6413. StaticCallOperand(callop,procedure);
  6414. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6415. END;
  6416. Emit(Pop(position,self));
  6417. END;
  6418. END CallBodies;
  6419. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6420. BEGIN
  6421. actualType := actualType.resolved;
  6422. IF actualType IS SyntaxTree.StringType THEN
  6423. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6424. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6425. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6426. ELSE
  6427. tmp := op.tag;
  6428. IntermediateCode.MakeMemory(tmp,addressType);
  6429. Emit(Push(position,tmp));
  6430. END;
  6431. Emit(Push(position,op.op))
  6432. END PushString;
  6433. PROCEDURE PushTD(type: SyntaxTree.Type);
  6434. VAR op: IntermediateCode.Operand;
  6435. BEGIN
  6436. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6437. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6438. ELSE
  6439. IF type.resolved IS SyntaxTree.PointerType THEN
  6440. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6441. END;
  6442. op := TypeDescriptorAdr(type.resolved);
  6443. IF ~newObjectFile THEN
  6444. IntermediateCode.MakeMemory(op,addressType);
  6445. END;
  6446. Emit(Push(position,op));
  6447. END
  6448. END PushTD;
  6449. BEGIN
  6450. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6451. dest := destination; destination := emptyOperand;
  6452. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6453. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6454. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6455. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6456. CASE x.id OF
  6457. (* ---- COPY ----- *)
  6458. |Global.Copy:
  6459. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6460. (* ---- EXCL, INCL----- *)
  6461. |Global.Excl,Global.Incl:
  6462. Evaluate(p0,s0);
  6463. Evaluate(p1,s1);
  6464. Convert(s1.op,setType);
  6465. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6466. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6467. END;
  6468. ReuseCopy(res,s0.op);
  6469. ReleaseOperand(s0);
  6470. Reuse1(tmp,s1.op);
  6471. ReleaseOperand(s1);
  6472. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6473. IF x.id = Global.Excl THEN
  6474. Emit(Not(position,tmp,tmp));
  6475. Emit(And(position,res,res,tmp));
  6476. ELSE
  6477. Emit(Or(position,res,res,tmp));
  6478. END;
  6479. ReleaseIntermediateOperand(tmp);
  6480. Designate(p0,s0);
  6481. ToMemory(s0.op,setType,0);
  6482. Emit(Mov(position,s0.op,res));
  6483. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6484. (* ---- DISPOSE ----- *)
  6485. |Global.Dispose:
  6486. Designate(p0,s0);
  6487. Emit(Push(position,s0.op));
  6488. ReleaseOperand(s0);
  6489. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6490. (* ---- GETPROCEDURE ----- *)
  6491. |Global.GetProcedure:
  6492. Designate(p0,s0);
  6493. PushString(s0,p0.type);
  6494. Designate(p1,s1);
  6495. PushString(s1,p1.type);
  6496. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6497. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6498. ELSE PushTD(procedureType.firstParameter.type)
  6499. END;
  6500. PushTD(procedureType.returnType);
  6501. Designate(p2,s2);
  6502. Emit(Push(position,s2.op));
  6503. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6504. CallThis(position,"Modules","GetProcedure", 7);
  6505. (* ---- ASH, LSH, ROT ----- *)
  6506. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6507. Evaluate(p0,s0);
  6508. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6509. (* make unsigned arguments in order to produced a logical shift *)
  6510. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6511. convert:= TRUE;
  6512. itype := s0.op.type;
  6513. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6514. Convert(s0.op,itype);
  6515. ELSE
  6516. convert := FALSE;
  6517. END;
  6518. END;
  6519. Evaluate(p1,s1);
  6520. IF IsIntegerConstant(p1,hint) THEN
  6521. ReuseCopy(reg,s0.op);
  6522. IF hint > 0 THEN
  6523. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6524. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6525. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6526. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6527. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6528. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6529. END;
  6530. ELSIF hint < 0 THEN
  6531. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6532. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6533. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6534. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6535. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6536. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6537. END;
  6538. END;
  6539. ReleaseOperand(s0); ReleaseOperand(s1);
  6540. ELSE
  6541. exit := NewLabel();
  6542. end := NewLabel();
  6543. ReuseCopy(reg,s0.op);
  6544. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6545. Reuse1(tmp,s1.op);
  6546. Emit(Neg(position,tmp,s1.op));
  6547. Convert(tmp,s1.op.type);
  6548. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6549. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6550. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6551. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6552. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6553. END;
  6554. ReleaseIntermediateOperand(tmp);
  6555. BrL(end);
  6556. SetLabel(exit);
  6557. ReuseCopy(tmp,s1.op);
  6558. Convert(tmp,s1.op.type);
  6559. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6560. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6561. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6562. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6563. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6564. END;
  6565. ReleaseIntermediateOperand(tmp);
  6566. SetLabel(end);
  6567. ReleaseOperand(s0); ReleaseOperand(s1);
  6568. END;
  6569. InitOperand(result,ModeValue);
  6570. IF convert THEN
  6571. itype := reg.type;
  6572. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6573. Convert(reg,itype);
  6574. END;
  6575. result.op := reg;
  6576. (* ---- CAP ----- *)
  6577. |Global.Cap:
  6578. Evaluate(p0,result);
  6579. ReuseCopy(reg,result.op);
  6580. ReleaseIntermediateOperand(result.op);
  6581. ignore := NewLabel();
  6582. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6583. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6584. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6585. SetLabel(ignore);
  6586. result.op := reg;
  6587. (* ---- CHR ----- *)
  6588. |Global.Chr, Global.Chr32:
  6589. Evaluate(p0,result);
  6590. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6591. |Global.Entier, Global.EntierH:
  6592. Evaluate(p0,result);
  6593. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6594. (* ---- MIN and MAX ----- *)
  6595. |Global.Max,Global.Min:
  6596. Evaluate(p0,s0);
  6597. Evaluate(p1,s1);
  6598. Reuse2(res,s0.op,s1.op);
  6599. else := NewLabel();
  6600. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6601. ELSE BrltL(else,s1.op,s0.op) END;
  6602. Emit(Mov(position,res,s0.op));
  6603. ReleaseOperand(s0);
  6604. end := NewLabel();
  6605. BrL(end);
  6606. SetLabel(else);
  6607. Emit(MovReplace(position,res,s1.op));
  6608. SetLabel(end);
  6609. ReleaseOperand(s1);
  6610. InitOperand(result,ModeValue);
  6611. result.op := res;
  6612. (* ---- ODD ----- *)
  6613. |Global.Odd:
  6614. IF ~conditional THEN
  6615. ConditionToValue(x)
  6616. ELSE
  6617. Evaluate(p0,result);
  6618. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6619. Reuse1(res,result.op);
  6620. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6621. ReleaseIntermediateOperand(result.op);
  6622. result.op := res;
  6623. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6624. ReleaseOperand(result);
  6625. BrL(falseLabel);
  6626. END;
  6627. (* ---- ORD ----- *)
  6628. |Global.Ord, Global.Ord32:
  6629. Evaluate(p0,result);
  6630. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6631. (* ---- SHORT, LONG ----- *)
  6632. |Global.Short, Global.Long:
  6633. Evaluate(p0,result);
  6634. IF x.type IS SyntaxTree.ComplexType THEN
  6635. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6636. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6637. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6638. ELSE
  6639. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6640. END
  6641. (* ---- HALT, SYSTEM.HALT----- *)
  6642. |Global.Halt, Global.systemHalt:
  6643. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6644. EmitTrap (position, val);
  6645. (* ---- ASSERT ----- *)
  6646. |Global.Assert:
  6647. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6648. trueL := NewLabel();
  6649. falseL := NewLabel();
  6650. Condition(p0,trueL,falseL);
  6651. IF p1 = NIL THEN val := AssertTrap
  6652. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6653. END;
  6654. SetLabel(falseL);
  6655. EmitTrap(position,val);
  6656. SetLabel(trueL);
  6657. END;
  6658. (*
  6659. Emit(TrapC(result.op,val);
  6660. *)
  6661. (* ---- INC, DEC----- *)
  6662. |Global.Inc,Global.Dec:
  6663. Expression(p0); adr := result.op;
  6664. LoadValue(result,p0.type); l := result;
  6665. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6666. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6667. END;
  6668. IF x.id = Global.Inc THEN
  6669. Emit(Add(position,l.op,l.op,r.op));
  6670. ELSE
  6671. Emit(Sub(position,l.op,l.op,r.op));
  6672. END;
  6673. ReleaseOperand(l); ReleaseOperand(r);
  6674. (* ---- LEN ----- *)
  6675. |Global.Len: (* dynamic length, static length done by checker *)
  6676. Designate(p0,operand);
  6677. IF p1 = NIL THEN
  6678. InitOperand(l,ModeValue);
  6679. l.op := IntermediateCode.Immediate(int32,0);
  6680. ELSE
  6681. Evaluate(p1,l);
  6682. END;
  6683. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6684. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6685. Dereference(operand, p0.type.resolved, FALSE);
  6686. END;
  6687. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6688. ReleaseOperand(operand); ReleaseOperand(l);
  6689. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6690. ASSERT(p1 # NIL);
  6691. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6692. Dereference(operand,p0.type.resolved,FALSE);
  6693. END;
  6694. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6695. ReleaseOperand(operand); ReleaseOperand(l);
  6696. ELSE HALT(100);
  6697. END;
  6698. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6699. (* ---- FIRST ---- *)
  6700. |Global.First:
  6701. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6702. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6703. ELSE
  6704. Designate(p0, result)
  6705. END
  6706. (* ---- LAST ---- *)
  6707. |Global.Last:
  6708. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6709. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6710. ELSE
  6711. Designate(p0, result);
  6712. (* make sure result.op is a register *)
  6713. tmp := result.op;
  6714. ReuseCopy(result.op, result.op);
  6715. ReleaseIntermediateOperand(tmp);
  6716. (* add offset to result.op *)
  6717. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6718. END
  6719. (* ---- STEP ---- *)
  6720. |Global.Step:
  6721. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6722. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6723. ELSE
  6724. Designate(p0, result);
  6725. (* make sure result.op is a register *)
  6726. tmp := result.op;
  6727. ReuseCopy(result.op, result.op);
  6728. ReleaseIntermediateOperand(tmp);
  6729. (* add offset to result.op *)
  6730. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6731. END
  6732. (* ---- RE ---- *)
  6733. |Global.Re:
  6734. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6735. Designate(p0, result)
  6736. ELSE
  6737. Evaluate(p0, result)
  6738. END
  6739. (* ---- IM ---- *)
  6740. |Global.Im:
  6741. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6742. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6743. Designate(p0, result);
  6744. (* make sure result.op is a register *)
  6745. tmp := result.op;
  6746. ReuseCopy(result.op, result.op);
  6747. ReleaseIntermediateOperand(tmp);
  6748. (* add offset to result.op *)
  6749. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6750. (* ---- ABS ----- *)
  6751. |Global.Abs:
  6752. Evaluate(p0,operand);
  6753. type := p0.type.resolved;
  6754. InitOperand(result,ModeValue);
  6755. Reuse1a(result.op,operand.op,dest);
  6756. Emit(Abs(position,result.op,operand.op));
  6757. ReleaseOperand(operand);
  6758. (* ---- WAIT ----- *)
  6759. |Global.Wait:
  6760. Evaluate(p0,operand);
  6761. Emit(Push(position,operand.op));
  6762. ReleaseOperand(operand);
  6763. CallThis(position,"Activities","Wait", 1);
  6764. (* ---- NEW ----- *)
  6765. |Global.New:
  6766. (*! the following code is only correct for "standard" Oberon calling convention *)
  6767. type := p0.type.resolved;
  6768. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6769. THEN
  6770. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6771. IF backend.cooperative THEN
  6772. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6773. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6774. IF recordType.isObject THEN
  6775. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6776. IF recordType.IsActive() THEN
  6777. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6778. END;
  6779. IF recordType.IsProtected() THEN
  6780. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6781. END;
  6782. ELSE
  6783. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6784. END;
  6785. END;
  6786. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6787. CallThis(position,"Runtime","New", 1);
  6788. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6789. Emit(Result(position, pointer));
  6790. exit := NewLabel();
  6791. BreqL(exit,pointer,nil);
  6792. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6793. GetRecordTypeName (recordType,name);
  6794. IF ~recordType.isObject THEN
  6795. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6796. END;
  6797. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6798. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6799. IF recordType.isObject THEN
  6800. IF recordType.IsProtected() THEN
  6801. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6802. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6803. END;
  6804. IF recordType.IsActive() THEN
  6805. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6806. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6807. END;
  6808. END;
  6809. END;
  6810. (* initialize fields *)
  6811. IF type(SyntaxTree.PointerType).isPlain THEN
  6812. size := 0;
  6813. ELSIF recordType.isObject THEN
  6814. size := BaseObjectTypeSize;
  6815. ELSE
  6816. size := BaseRecordTypeSize;
  6817. END;
  6818. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6819. (* call initializer *)
  6820. constructor := GetConstructor(recordType);
  6821. IF constructor # NIL THEN
  6822. (*! should be unified with ProcedureCallDesignator *)
  6823. Emit(Push(position,pointer));
  6824. ReleaseIntermediateOperand(pointer);
  6825. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6826. FOR i := 1 TO x.parameters.Length()-1 DO
  6827. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6828. formalParameter := formalParameter.nextParameter;
  6829. END;
  6830. (* static call of the constructor *)
  6831. GetCodeSectionNameForSymbol(constructor,name);
  6832. ASSERT(~constructor.isInline);
  6833. IF constructor.scope.ownerModule # module.module THEN
  6834. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6835. ELSE
  6836. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6837. END;
  6838. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6839. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6840. Emit(Pop(position,pointer));
  6841. END;
  6842. (* call bodies *)
  6843. CallBodies(pointer,p0.type);
  6844. SetLabel(exit);
  6845. needsTrace := p0.NeedsTrace();
  6846. IF needsTrace THEN ModifyAssignments(true) END;
  6847. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6848. Emit(Push(position, pointer));
  6849. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6850. Emit(Pop(position, pointer));
  6851. END;
  6852. Designate(p0,l);
  6853. IF needsTrace THEN
  6854. CallAssignPointer(l.op, pointer);
  6855. ELSE
  6856. ToMemory(l.op,addressType,0);
  6857. Emit(Mov(position,l.op,pointer));
  6858. END;
  6859. ReleaseIntermediateOperand(pointer);
  6860. ReleaseOperand(l);
  6861. IF needsTrace THEN ModifyAssignments(false) END;
  6862. ELSE
  6863. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6864. IF temporaryVariable # NIL THEN
  6865. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6866. ELSE
  6867. Designate(p0,l);
  6868. END;
  6869. (* l.op contains address of pointer to record *)
  6870. Emit(Push(position,l.op)); (* address for use after syscall *)
  6871. Emit(Push(position,l.op));
  6872. ReleaseOperand(l);
  6873. (* push type descriptor *)
  6874. reg := TypeDescriptorAdr(recordType);
  6875. IF ~newObjectFile THEN
  6876. IntermediateCode.MakeMemory(reg,addressType);
  6877. END;
  6878. Emit(Push(position,reg));
  6879. ReleaseIntermediateOperand(reg);
  6880. (* push realtime flag *)
  6881. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6882. ELSE Emit(Push(position,false));
  6883. END;
  6884. CallThis(position,"Heaps","NewRec", 3);
  6885. (* check allocation success, if not successful then do not call initializers and bodies *)
  6886. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6887. Emit(Pop(position,pointer));
  6888. MakeMemory(reg,pointer,addressType,0);
  6889. ReleaseIntermediateOperand(pointer);
  6890. pointer := reg;
  6891. exit := NewLabel();
  6892. BreqL(exit,pointer,nil);
  6893. Emit(Push(position,pointer));
  6894. (* initialize fields *)
  6895. InitFields(recordType, pointer,0);
  6896. (* call initializer *)
  6897. constructor := GetConstructor(recordType);
  6898. IF constructor # NIL THEN
  6899. (*! should be unified with ProcedureCallDesignator *)
  6900. Emit(Push(position,pointer));
  6901. ReleaseIntermediateOperand(pointer);
  6902. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6903. FOR i := 1 TO x.parameters.Length()-1 DO
  6904. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6905. formalParameter := formalParameter.nextParameter;
  6906. END;
  6907. (* static call of the constructor *)
  6908. GetCodeSectionNameForSymbol(constructor,name);
  6909. ASSERT(~constructor.isInline);
  6910. IF constructor.scope.ownerModule # module.module THEN
  6911. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6912. ELSE
  6913. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6914. END;
  6915. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6916. ELSE
  6917. ReleaseIntermediateOperand(pointer);
  6918. END;
  6919. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6920. Emit(Pop(position,pointer));
  6921. IF temporaryVariable # NIL THEN
  6922. Designate(p0,l);
  6923. ToMemory(l.op,addressType,0);
  6924. Emit(Mov(position,l.op,pointer));
  6925. ReleaseOperand(l);
  6926. result.tag := emptyOperand;
  6927. END;
  6928. (* call bodies *)
  6929. CallBodies(pointer,p0.type);
  6930. ReleaseIntermediateOperand(pointer);
  6931. IF temporaryVariable # NIL THEN
  6932. end := NewLabel();
  6933. BrL(end);
  6934. SetLabel(exit);
  6935. Designate(p0,l);
  6936. ToMemory(l.op,addressType,0);
  6937. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6938. ReleaseOperand(l);
  6939. SetLabel(end);
  6940. ELSE
  6941. SetLabel(exit);
  6942. END;
  6943. END;
  6944. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6945. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6946. dim := 0;
  6947. IF p1 # NIL THEN
  6948. FOR i := 1 TO x.parameters.Length()-1 DO
  6949. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6950. parameter := x.parameters.GetExpression(i);
  6951. Evaluate(parameter,r);
  6952. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6953. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6954. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6955. END;
  6956. Emit(Push(position,r.op));
  6957. IF i=1 THEN
  6958. ReuseCopy(reg,r.op);
  6959. ELSE
  6960. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6961. END;
  6962. ReleaseOperand(r);
  6963. INC(dim);
  6964. END;
  6965. Convert(reg,addressType);
  6966. ELSE
  6967. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6968. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6969. END;
  6970. openDim := dim;
  6971. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6972. IF backend.cooperative THEN
  6973. size := ToMemoryUnits(system,system.SizeOf(type));
  6974. WHILE type IS SyntaxTree.ArrayType DO
  6975. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6976. END;
  6977. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6978. IF (size # 1) THEN
  6979. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6980. END;
  6981. Emit(Push(position,reg));
  6982. size := ToMemoryUnits(system,system.SizeOf(type));
  6983. IF (size # 1) THEN
  6984. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6985. END;
  6986. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6987. Emit(Push(position,reg));
  6988. ReleaseIntermediateOperand(reg);
  6989. CallThis(position,"Runtime","New", 1);
  6990. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6991. Emit(Result(position, pointer));
  6992. exit := NewLabel();
  6993. else := NewLabel();
  6994. BreqL(else,pointer,nil);
  6995. IF ~type.hasPointers THEN
  6996. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6997. ELSIF type IS SyntaxTree.RecordType THEN
  6998. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6999. ELSIF type IS SyntaxTree.ProcedureType THEN
  7000. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7001. ELSE
  7002. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7003. END;
  7004. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7005. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7006. 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))));
  7007. IF type IS SyntaxTree.RecordType THEN
  7008. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7009. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7010. ELSE
  7011. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7012. END;
  7013. i := openDim;
  7014. WHILE i > 0 DO
  7015. DEC (i);
  7016. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7017. END;
  7018. needsTrace := p0.NeedsTrace();
  7019. IF needsTrace THEN ModifyAssignments(true) END;
  7020. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7021. Emit(Push(position, pointer));
  7022. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7023. Emit(Pop(position, pointer));
  7024. END;
  7025. Designate(p0,l);
  7026. IF needsTrace THEN
  7027. CallAssignPointer(l.op, pointer);
  7028. ModifyAssignments(false);
  7029. ELSE
  7030. ToMemory(l.op,addressType,0);
  7031. Emit(Mov(position,l.op,pointer));
  7032. END;
  7033. ReleaseIntermediateOperand(pointer);
  7034. ReleaseOperand(l);
  7035. BrL(exit);
  7036. SetLabel(else);
  7037. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7038. Designate(p0,l);
  7039. IF needsTrace THEN
  7040. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7041. ELSE
  7042. ToMemory(l.op,addressType,0);
  7043. Emit(Mov(position,l.op,pointer));
  7044. END;
  7045. ReleaseOperand(l);
  7046. SetLabel(exit);
  7047. ELSE
  7048. (*! the following code is only correct for "standard" Oberon calling convention *)
  7049. IF SemanticChecker.ContainsPointer(type) THEN
  7050. IF type IS SyntaxTree.ArrayType THEN
  7051. staticLength := 1;
  7052. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7053. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7054. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7055. END;
  7056. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7057. Emit(Mul(position,reg,reg,tmp));
  7058. END;
  7059. Designate(p0,l);
  7060. IF openDim > 0 THEN
  7061. Emit(Push(position,l.op)); (* address for use after syscall *)
  7062. END;
  7063. Emit(Push(position,l.op)); (* address *)
  7064. ReleaseOperand(l);
  7065. tmp := TypeDescriptorAdr(type);
  7066. IF ~newObjectFile THEN
  7067. IntermediateCode.MakeMemory(tmp,addressType);
  7068. END;
  7069. Emit(Push(position,tmp)); (* type descriptor *)
  7070. ReleaseIntermediateOperand(tmp);
  7071. Emit(Push(position,reg)); (* number Elements *)
  7072. ReleaseIntermediateOperand(reg);
  7073. tmp := IntermediateCode.Immediate(addressType,dim);
  7074. Emit(Push(position,tmp)); (* dimensions *)
  7075. (* push realtime flag *)
  7076. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7077. ELSE Emit(Push(position,false));
  7078. END;
  7079. CallThis(position,"Heaps","NewArr",5)
  7080. ELSE
  7081. size := ToMemoryUnits(system,system.SizeOf(type));
  7082. IF (size # 1) THEN
  7083. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7084. END;
  7085. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7086. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7087. Emit(Add(position,reg,reg,tmp));
  7088. Designate(p0,l);
  7089. IF openDim >0 THEN
  7090. Emit(Push(position,l.op)); (* address for use after syscall *)
  7091. END;
  7092. Emit(Push(position,l.op)); (* address for syscall *)
  7093. ReleaseOperand(l); (* pointer address *)
  7094. Emit(Push(position,reg)); (* size *)
  7095. ReleaseIntermediateOperand(reg);
  7096. (* push realtime flag *)
  7097. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7098. ELSE Emit(Push(position,false));
  7099. END;
  7100. CallThis(position,"Heaps","NewSys", 3)
  7101. END;
  7102. IF openDim > 0 THEN
  7103. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7104. Emit(Pop(position,adr));
  7105. ToMemory(adr,addressType,0);
  7106. ReuseCopy(tmp,adr);
  7107. ReleaseIntermediateOperand(adr);
  7108. adr := tmp;
  7109. else := NewLabel();
  7110. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7111. i := openDim-1;
  7112. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7113. WHILE (i >= 0) DO
  7114. Emit(Pop(position,reg));
  7115. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7116. Emit(Mov(position,res,reg));
  7117. DEC(i);
  7118. END;
  7119. ReleaseIntermediateOperand(adr);
  7120. ReleaseIntermediateOperand(reg);
  7121. exit := NewLabel();
  7122. BrL(exit);
  7123. SetLabel(else);
  7124. (* else part: array could not be allocated *)
  7125. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7126. Emit(Add(position,sp,sp,tmp));
  7127. SetLabel(exit);
  7128. END;
  7129. END;
  7130. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7131. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7132. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7133. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7134. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7135. left.SetType(procedure.type);
  7136. formalParameter := procedureType.firstParameter;
  7137. (* push array to allocate *)
  7138. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7139. formalParameter :=formalParameter.nextParameter;
  7140. (* push length array *)
  7141. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7142. (* push size *)
  7143. type := t0;
  7144. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7145. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7146. END;
  7147. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7148. Emit(Push(position,tmp));
  7149. (* *)
  7150. IF SemanticChecker.ContainsPointer(type) THEN
  7151. tmp := TypeDescriptorAdr(type);
  7152. IF ~newObjectFile THEN
  7153. IntermediateCode.MakeMemory(tmp,addressType);
  7154. END;
  7155. ELSE
  7156. tmp := IntermediateCode.Immediate(addressType, 0);
  7157. END;
  7158. Emit(Push(position,tmp)); (* type descriptor *)
  7159. StaticCallOperand(result,procedure);
  7160. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7161. ReleaseOperand(result);
  7162. END;
  7163. (*
  7164. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7165. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7166. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7167. *)
  7168. ELSE
  7169. dim := 0;
  7170. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7171. (* generate geometry descriptor *)
  7172. Designate(p0,l);
  7173. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7174. ReleaseOperand(l);
  7175. isTensor := TRUE;
  7176. ELSE
  7177. isTensor := FALSE;
  7178. END;
  7179. FOR i := 1 TO x.parameters.Length()-1 DO
  7180. IF ~isTensor THEN
  7181. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7182. END;
  7183. parameter := x.parameters.GetExpression(i);
  7184. Evaluate(parameter,r);
  7185. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7186. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7187. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7188. END;
  7189. Emit(Push(position,r.op));
  7190. IF i=1 THEN
  7191. ReuseCopy(reg,r.op);
  7192. ELSE
  7193. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7194. END;
  7195. ReleaseOperand(r);
  7196. INC(dim);
  7197. END;
  7198. Convert(reg,addressType);
  7199. openDim := dim;
  7200. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7201. (*! the following code is only correct for "standard" Oberon calling convention *)
  7202. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7203. t := type;
  7204. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7205. staticLength := 1;
  7206. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7207. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7208. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7209. END;
  7210. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7211. Emit(Mul(position,reg,reg,tmp));
  7212. END;
  7213. Designate(p0,l);
  7214. IF isTensor THEN
  7215. Dereference(l,type,FALSE);
  7216. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7217. END;
  7218. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7219. Emit(Push(position,l.tag)); (* address *)
  7220. ReleaseOperand(l);
  7221. tmp := TypeDescriptorAdr(t);
  7222. IF ~newObjectFile THEN
  7223. IntermediateCode.MakeMemory(tmp,addressType);
  7224. END;
  7225. Emit(Push(position,tmp)); (* type descriptor *)
  7226. ReleaseIntermediateOperand(tmp);
  7227. Emit(Push(position,reg)); (* number Elements *)
  7228. ReleaseIntermediateOperand(reg);
  7229. tmp := IntermediateCode.Immediate(addressType,0);
  7230. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7231. (* push realtime flag: false by default *)
  7232. Emit(Push(position,false));
  7233. CallThis(position,"Heaps","NewArr",5);
  7234. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7235. Emit(Pop(position,adr));
  7236. GetMathArrayField(tmp,adr,MathPtrOffset);
  7237. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7238. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7239. PutMathArrayField(adr,reg,MathAdrOffset);
  7240. ReleaseIntermediateOperand(tmp);
  7241. ReleaseIntermediateOperand(reg);
  7242. ELSE
  7243. IF isTensor THEN
  7244. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7245. ELSE
  7246. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7247. END;
  7248. IF (size # 1) THEN
  7249. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7250. END;
  7251. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7252. Emit(Add(position,reg,reg,tmp));
  7253. Designate(p0,l);
  7254. IF isTensor THEN
  7255. Dereference(l,type,FALSE);
  7256. END;
  7257. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7258. Emit(Push(position,l.tag)); (* address for syscall *)
  7259. ReleaseOperand(l); (* pointer address *)
  7260. Emit(Push(position,reg)); (* size *)
  7261. ReleaseIntermediateOperand(reg);
  7262. (* push realtime flag: false by default *)
  7263. Emit(Push(position,false));
  7264. CallThis(position,"Heaps","NewSys",3);
  7265. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7266. Emit(Pop(position,adr));
  7267. GetMathArrayField(tmp,adr,MathPtrOffset);
  7268. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7269. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7270. PutMathArrayField(adr,reg,MathAdrOffset);
  7271. ReleaseIntermediateOperand(tmp);
  7272. ReleaseIntermediateOperand(reg);
  7273. END;
  7274. flags := {};
  7275. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7276. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7277. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7278. PutMathArrayField(adr,tmp,MathDimOffset);
  7279. else := NewLabel();
  7280. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7281. i := openDim-1;
  7282. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7283. IF isTensor THEN
  7284. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7285. ELSE
  7286. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7287. END;
  7288. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7289. WHILE (i >= 0) DO
  7290. Emit(Pop(position,reg));
  7291. PutMathArrayLength(adr,reg,i);
  7292. PutMathArrayIncrement(adr,tmp,i);
  7293. IF i > 0 THEN
  7294. IF i=openDim-1 THEN
  7295. ReuseCopy(tmp,tmp);
  7296. END;
  7297. Emit(Mul(position,tmp,tmp,reg));
  7298. END;
  7299. DEC(i);
  7300. END;
  7301. ReleaseIntermediateOperand(adr);
  7302. ReleaseIntermediateOperand(reg);
  7303. ReleaseIntermediateOperand(tmp);
  7304. exit := NewLabel();
  7305. BrL(exit);
  7306. SetLabel(else);
  7307. (* else part: array could not be allocated *)
  7308. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7309. Emit(Add(position,sp,sp,tmp));
  7310. SetLabel(exit);
  7311. END;
  7312. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7313. THEN
  7314. IF ~backend.cellsAreObjects THEN RETURN END;
  7315. IF InCellScope(currentScope) THEN
  7316. PushSelfPointer()
  7317. ELSE
  7318. Emit(Push(position, nil));
  7319. END;
  7320. (* push temp address *)
  7321. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7322. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7323. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7324. (* l.op contains address of pointer to record *)
  7325. Emit(Push(position,l.op)); (* address for use after syscall *)
  7326. ReleaseOperand(l);
  7327. (* push type descriptor *)
  7328. reg := TypeDescriptorAdr(baseType);
  7329. IF ~newObjectFile THEN
  7330. IntermediateCode.MakeMemory(reg,addressType);
  7331. END;
  7332. Emit(Push(position,reg));
  7333. ReleaseIntermediateOperand(reg);
  7334. (* push name *)
  7335. (*Global.GetSymbolName(p0, n);*)
  7336. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7337. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7338. ELSE
  7339. Global.GetModuleName(module.module, n);
  7340. END;
  7341. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7342. (*type.typeDeclaration.GetName(n);*)
  7343. PushConstString(n);
  7344. (* push cellnet boolean *)
  7345. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7346. (* push engine boolean *)
  7347. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7348. (* allocate *)
  7349. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7350. (* add capabilities *)
  7351. modifier := p0(SyntaxTree.Designator).modifiers;
  7352. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7353. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7354. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7355. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7356. END;
  7357. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7358. (*
  7359. modifier := baseType(SyntaxTree.CellType).modifiers;
  7360. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7361. modifier := p0(SyntaxTree.Designator).modifiers;
  7362. *)
  7363. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7364. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7365. (* l.op contains address of pointer to record *)
  7366. ToMemory(l.op,addressType,0);
  7367. (* l.op contains value of pointer to record *)
  7368. Emit(Push(position,l.op)); (* address for use after syscall *)
  7369. ReleaseOperand(l);
  7370. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7371. prevScope := currentScope;
  7372. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7373. previous := section;
  7374. section := init;
  7375. (* add ports *)
  7376. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7377. CloseInitializer(previous);
  7378. currentScope := prevScope;
  7379. Symbol(temporaryVariable,l);
  7380. ToMemory(l.op,addressType,0);
  7381. Emit(Push(position,l.op));
  7382. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7383. (*
  7384. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7385. IF constructor # NIL THEN
  7386. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7387. FOR i := 1 TO x.parameters.Length()-1 DO
  7388. p := x.parameters.GetExpression(i);
  7389. Global.GetSymbolName(parameter,name);
  7390. Evaluate(p, value);
  7391. ASSERT(value.type # NIL);
  7392. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7393. par := instance.AddParameter(name);
  7394. par.SetInteger(value.integer);
  7395. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7396. par := instance.AddParameter(name);
  7397. par.SetBoolean(value.boolean);
  7398. ELSE Error(x.position,NotYetImplemented)
  7399. END;
  7400. parameter := parameter.nextParameter
  7401. END;
  7402. END;
  7403. *)
  7404. (* call initializer *)
  7405. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7406. IF constructor # NIL THEN
  7407. (*! should be unified with ProcedureCallDesignator *)
  7408. IF backend.cellsAreObjects THEN
  7409. Symbol(temporaryVariable,l);
  7410. ToMemory(l.op,addressType,0);
  7411. Emit(Push(position,l.op));
  7412. ReleaseOperand(l);
  7413. END;
  7414. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7415. FOR i := 1 TO x.parameters.Length()-1 DO
  7416. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7417. formalParameter := formalParameter.nextParameter;
  7418. END;
  7419. (* static call of the constructor *)
  7420. Global.GetSymbolSegmentedName(constructor,name);
  7421. ASSERT(~constructor.isInline);
  7422. IF constructor.scope.ownerModule # module.module THEN
  7423. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7424. ELSE
  7425. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7426. END;
  7427. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7428. (*ELSE
  7429. ReleaseIntermediateOperand(pointer);*)
  7430. END;
  7431. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7432. ToMemory(l.op, addressType, 0);
  7433. Designate(p0,s0);
  7434. ToMemory(s0.op,addressType,0);
  7435. Emit(Mov(position,s0.op,l.op));
  7436. ReleaseOperand(l);
  7437. ReleaseOperand(s0);
  7438. result.tag := emptyOperand;
  7439. (* start *)
  7440. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7441. (* push cell *)
  7442. Symbol(temporaryVariable, l);
  7443. ToMemory(l.op,addressType,0);
  7444. Emit(Push(-1,l.op));
  7445. (* push delegate *)
  7446. Emit(Push(-1,l.op));
  7447. ReleaseOperand(l);
  7448. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7449. Emit(Push(position, s1.op));
  7450. ReleaseOperand(s1);
  7451. CallThis(position,"ActiveCellsRuntime","Start",3);
  7452. END;
  7453. (*IF temporaryVariable # NIL THEN
  7454. end := NewLabel();
  7455. BrL(end);
  7456. SetLabel(exit);
  7457. Designate(p0,l);
  7458. ToMemory(l.op,addressType,0);
  7459. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7460. ReleaseOperand(l);
  7461. SetLabel(end);
  7462. ELSE
  7463. SetLabel(exit);
  7464. END;
  7465. *)
  7466. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7467. ELSE (* no pointer to record, no pointer to array *)
  7468. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7469. (* ignore new statement *)
  7470. Warning(p0.position, "cannot run on final hardware");
  7471. ELSE
  7472. HALT(200);
  7473. END;
  7474. END;
  7475. (* ---- ADDRESSOF----- *)
  7476. |Global.systemAdr:
  7477. Designate(p0,s0);
  7478. s0.mode := ModeValue;
  7479. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7480. ReleaseIntermediateOperand(s0.op);
  7481. s0.op := s0.tag;
  7482. IntermediateCode.InitOperand(s0.tag);
  7483. END;
  7484. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7485. result := s0;
  7486. (* ---- BIT ----- *)
  7487. |Global.systemBit:
  7488. Evaluate(p0,s0);
  7489. ToMemory(s0.op,addressType,0);
  7490. ReuseCopy(res,s0.op);
  7491. ReleaseOperand(s0);
  7492. Evaluate(p1,s1);
  7493. Emit(Ror(position,res,res,s1.op));
  7494. ReleaseOperand(s1);
  7495. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7496. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7497. IF ~conditional THEN
  7498. InitOperand(result,ModeValue); result.op := res;
  7499. ELSE
  7500. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7501. BrL(falseLabel);
  7502. ReleaseIntermediateOperand(res);
  7503. END;
  7504. (* --- MSK ----*)
  7505. |Global.systemMsk:
  7506. Evaluate(p0,s0);
  7507. Evaluate(p1,s1);
  7508. ReuseCopy(res,s0.op);
  7509. ReleaseOperand(s0);
  7510. Emit(And(position,res,res,s1.op));
  7511. ReleaseOperand(s1);
  7512. InitOperand(result,ModeValue);
  7513. result.op := res;
  7514. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7515. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7516. Evaluate(p0,s0);
  7517. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7518. ReleaseOperand(s0);
  7519. InitOperand(result,ModeValue);
  7520. result.op := res;
  7521. (* ---- SYSTEM.GetStackPointer ----- *)
  7522. |Global.systemGetStackPointer:
  7523. InitOperand(result,ModeValue);
  7524. result.op := sp;
  7525. (* ---- SYSTEM.GetFramePointer ----- *)
  7526. |Global.systemGetFramePointer:
  7527. InitOperand(result,ModeValue);
  7528. result.op := fp;
  7529. (* ---- SYSTEM.GetActivity ----- *)
  7530. |Global.systemGetActivity:
  7531. ASSERT(backend.cooperative);
  7532. InitOperand(result,ModeValue);
  7533. result.op := ap;
  7534. (* ---- SYSTEM.SetStackPointer ----- *)
  7535. |Global.systemSetStackPointer:
  7536. Evaluate(p0,s0); (* *)
  7537. Emit(Mov(position,sp,s0.op));
  7538. ReleaseOperand(s0);
  7539. (* ---- SYSTEM.SetFramePointer ----- *)
  7540. |Global.systemSetFramePointer:
  7541. Evaluate(p0,s0); (* *)
  7542. Emit(Mov(position,fp,s0.op));
  7543. ReleaseOperand(s0);
  7544. (* ---- SYSTEM.Activity ----- *)
  7545. |Global.systemSetActivity:
  7546. ASSERT(backend.cooperative);
  7547. Evaluate(p0,s0); (* *)
  7548. Emit(Mov(position,ap,s0.op));
  7549. ReleaseOperand(s0);
  7550. (* ---- SYSTEM.VAL ----- *)
  7551. |Global.systemVal:
  7552. Expression(p1);
  7553. s1 := result;
  7554. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7555. IF s1.mode = ModeReference THEN
  7556. (* nothing to be done if not record type, just take over new type *)
  7557. IF (type IS SyntaxTree.RecordType) THEN
  7558. ReleaseIntermediateOperand(s1.tag);
  7559. s1.tag := TypeDescriptorAdr(type);
  7560. IF ~newObjectFile THEN
  7561. IntermediateCode.MakeMemory(s1.tag,addressType);
  7562. END;
  7563. UseIntermediateOperand(s1.tag);
  7564. END;
  7565. result := s1;
  7566. ELSE (* copy over result to different type, may not use convert *)
  7567. itype := IntermediateCode.GetType(system,type);
  7568. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7569. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7570. Emit(Mov(position,s0.op,s1.op));
  7571. ReleaseOperand(s1);
  7572. InitOperand(result,ModeValue);
  7573. result.op := s0.op;
  7574. ELSE (* different size, must convert *)
  7575. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7576. Convert(s1.op, IntermediateCode.GetType(system,type));
  7577. result := s1;
  7578. END;
  7579. END;
  7580. (* ---- SYSTEM.GET ----- *)
  7581. |Global.systemGet:
  7582. Evaluate(p0,s0); (* adr *)
  7583. Designate(p1,s1); (* variable *)
  7584. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7585. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7586. Emit(Mov(position,s1.op,s0.op));
  7587. ReleaseOperand(s1);
  7588. ReleaseOperand(s0);
  7589. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7590. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7591. Evaluate(p0,s0); (* *)
  7592. Evaluate(p1,s1); (* variable *)
  7593. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7594. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7595. (* real part *)
  7596. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7597. Emit(Mov(position,res, s1.op));
  7598. ReleaseIntermediateOperand(res);
  7599. (* imaginary part *)
  7600. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7601. Emit(Mov(position,res, s1.tag));
  7602. ReleaseIntermediateOperand(res);
  7603. ReleaseOperand(s1);
  7604. ReleaseOperand(s0);
  7605. ELSE
  7606. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7607. ReleaseOperand(s0);
  7608. Emit(Mov(position,res,s1.op));
  7609. ReleaseIntermediateOperand(res);
  7610. ReleaseOperand(s1);
  7611. END;
  7612. (* ---- SYSTEM.MOVE ----- *)
  7613. |Global.systemMove:
  7614. Evaluate(p0,s0);
  7615. Evaluate(p1,s1);
  7616. Evaluate(p2,s2);
  7617. Emit(Copy(position,s1.op,s0.op,s2.op));
  7618. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7619. (* ---- SYSTEM.NEW ----- *)
  7620. |Global.systemNew:
  7621. Designate(p0,s0);
  7622. Emit(Push(position,s0.op));
  7623. ReleaseOperand(s0);
  7624. Evaluate(p1,s1);
  7625. Emit(Push(position,s1.op));
  7626. ReleaseOperand(s1);
  7627. (* push realtime flag: false by default *)
  7628. Emit(Push(position,false));
  7629. CallThis(position,"Heaps","NewSys",3);
  7630. (* ---- SYSTEM.CALL ----- *)
  7631. |Global.systemRef:
  7632. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7633. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7634. s0.mode := ModeValue;
  7635. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7636. result := s0
  7637. (* ---- INCR ----- *)
  7638. |Global.Incr:
  7639. Designate(p0,operand);
  7640. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7641. Dereference(operand,p0.type.resolved,FALSE);
  7642. END;
  7643. ASSERT(p1 # NIL);
  7644. Evaluate(p1,l);
  7645. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7646. ReleaseOperand(operand); ReleaseOperand(l);
  7647. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7648. (* ---- SUM ----- *)
  7649. |Global.Sum: HALT(200);
  7650. (* ---- ALL ----- *)
  7651. |Global.All: HALT(200);
  7652. (* ---- CAS ----- *)
  7653. |Global.Cas:
  7654. needsTrace := p0.NeedsTrace();
  7655. IF needsTrace THEN ModifyAssignments(true) END;
  7656. Designate(p0,s0);
  7657. Evaluate(p1,s1);
  7658. Evaluate(p2,s2);
  7659. IF needsTrace THEN
  7660. Emit(Push(position, s0.op));
  7661. Emit(Push(position, s1.op));
  7662. Emit(Push(position, s2.op));
  7663. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7664. ELSE
  7665. Emit(Cas(position,s0.op,s1.op,s2.op));
  7666. END;
  7667. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7668. IF needsTrace THEN ModifyAssignments(false) END;
  7669. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7670. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7671. IF conditional THEN
  7672. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7673. BrL(falseLabel);
  7674. ReleaseIntermediateOperand(res);
  7675. END;
  7676. (* ---- DIM ----- *)
  7677. |Global.Dim:
  7678. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7679. Designate(p0,s0);
  7680. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7681. Dereference(s0,p0.type.resolved,FALSE);
  7682. END;
  7683. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7684. ReleaseOperand(s0);
  7685. (* ---- RESHAPE ----- *)
  7686. |Global.Reshape:
  7687. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7688. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7689. left.SetType(procedure.type);
  7690. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7691. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7692. END;
  7693. (* ---- SYSTEM.TYPECODE ----- *)
  7694. |Global.systemTypeCode:
  7695. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7696. IF type.resolved IS SyntaxTree.PointerType THEN
  7697. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7698. END;
  7699. result.op := TypeDescriptorAdr(type);
  7700. IF ~newObjectFile THEN
  7701. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7702. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7703. END;
  7704. result.mode := ModeValue;
  7705. (* ---- SYSTEM.TRACE ----- *)
  7706. |Global.systemTrace:
  7707. SystemTrace(x.parameters, x.position);
  7708. (* ----- CONNECT ------*)
  7709. |Global.Connect:
  7710. IF backend.cellsAreObjects THEN
  7711. PushPort(p0);
  7712. PushPort(p1);
  7713. IF p2 # NIL THEN
  7714. Evaluate(p2, s2);
  7715. Emit(Push(p2.position, s2.op));
  7716. ReleaseOperand(s2);
  7717. ELSE
  7718. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7719. END;
  7720. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7721. ELSE
  7722. Warning(x.position, "cannot run on final hardware");
  7723. END;
  7724. (* ----- DELEGATE ------*)
  7725. |Global.Delegate:
  7726. IF backend.cellsAreObjects THEN
  7727. PushPort(p0);
  7728. PushPort(p1);
  7729. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7730. ELSE
  7731. Warning(x.position, "cannot run on final hardware");
  7732. END;
  7733. (* ----- SEND ------*)
  7734. |Global.Send:
  7735. Evaluate(p0,s0);
  7736. Evaluate(p1,s1);
  7737. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7738. Emit(Push(position,s0.op));
  7739. Emit(Push(position,s1.op));
  7740. (*
  7741. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7742. *)
  7743. IF ~backend.cellsAreObjects THEN
  7744. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7745. END;
  7746. ReleaseOperand(s0);
  7747. ReleaseOperand(s1);
  7748. IF backend.cellsAreObjects THEN
  7749. CallThis(position,"ActiveCellsRuntime","Send",2);
  7750. ELSE
  7751. CallThis(position,ChannelModuleName,"Send",2);
  7752. END;
  7753. (* ----- RECEIVE ------*)
  7754. |Global.Receive:
  7755. Evaluate(p0,s0);
  7756. Emit(Push(position,s0.op));
  7757. Designate(p1,s1);
  7758. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7759. Emit(Push(position,s1.op));
  7760. IF p2 # NIL THEN
  7761. Designate(p2,s2);
  7762. Emit(Push(position,s2.op));
  7763. END;
  7764. (*
  7765. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7766. *)
  7767. IF ~backend.cellsAreObjects THEN
  7768. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7769. END;
  7770. ReleaseOperand(s0);
  7771. ReleaseOperand(s1);
  7772. ReleaseOperand(s2);
  7773. IF backend.cellsAreObjects THEN
  7774. IF p2 = NIL THEN
  7775. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7776. ELSE
  7777. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7778. END;
  7779. ELSE
  7780. IF p2 = NIL THEN
  7781. CallThis(position,ChannelModuleName,"Receive",2)
  7782. ELSE
  7783. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7784. END;
  7785. END;
  7786. | Global.systemSpecial:
  7787. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7788. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7789. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7790. (* determine if parameters are of the VAR kind *)
  7791. ASSERT(x.parameters.Length() <= 3);
  7792. formalParameter := procedureType.firstParameter;
  7793. FOR i := 0 TO x.parameters.Length() - 1 DO
  7794. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7795. formalParameter := formalParameter.nextParameter
  7796. END;
  7797. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7798. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7799. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7800. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7801. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7802. IF procedureType.returnType # NIL THEN
  7803. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7804. Emit(Result(position, res));
  7805. (*InitOperand(result,ModeValue);
  7806. result.op := res;
  7807. *)
  7808. IF ~conditional THEN
  7809. InitOperand(result,ModeValue); result.op := res;
  7810. ELSE
  7811. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7812. BrL(falseLabel);
  7813. ReleaseIntermediateOperand(res);
  7814. END;
  7815. END
  7816. ELSE (* function not yet implemented *)
  7817. Error(position,"not yet implemented");
  7818. END;
  7819. destination := dest;
  7820. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7821. END VisitBuiltinCallDesignator;
  7822. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7823. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7824. BEGIN
  7825. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7826. dest := destination; destination := emptyOperand;
  7827. Expression(x.left);
  7828. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7829. ELSIF isUnchecked THEN (* no check *)
  7830. ELSE
  7831. trueL := NewLabel();
  7832. falseL := NewLabel();
  7833. IF IsPointerToRecord(x.left.type,recordType) THEN
  7834. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7835. Emit(Mov(position,tag, result.op));
  7836. IF result.mode # ModeValue THEN
  7837. ptr := tag;
  7838. IntermediateCode.MakeMemory(ptr,addressType);
  7839. Emit(Mov(position,tag, ptr));
  7840. END;
  7841. IF ~backend.cooperative THEN
  7842. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7843. END;
  7844. IntermediateCode.MakeMemory(tag,addressType);
  7845. ELSE
  7846. tag := result.tag;
  7847. END;
  7848. TypeTest(tag,x.type,trueL,falseL);
  7849. ReleaseIntermediateOperand(tag);
  7850. SetLabel(falseL);
  7851. EmitTrap(position,TypeCheckTrap);
  7852. SetLabel(trueL);
  7853. END;
  7854. destination := dest;
  7855. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7856. END VisitTypeGuardDesignator;
  7857. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7858. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7859. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7860. VAR label: Label; pc: LONGINT;
  7861. BEGIN
  7862. IF backend.cooperative & ~isUnchecked THEN
  7863. pc := section.pc;
  7864. label := NewLabel();
  7865. BrneL(label, operand.op, nil);
  7866. EmitTrap(position, NilPointerTrap);
  7867. SetLabel(label);
  7868. INC(statCoopNilCheck, section.pc - pc);
  7869. END;
  7870. END NilCheck;
  7871. BEGIN
  7872. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7873. ReuseCopy(dereferenced,operand.op);
  7874. ReleaseOperand(operand);
  7875. operand.mode := ModeReference;
  7876. operand.op := dereferenced;
  7877. operand.tag := dereferenced;
  7878. UseIntermediateOperand(operand.tag);
  7879. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7880. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7881. ReleaseIntermediateOperand(operand.tag);
  7882. operand.tag := TypeDescriptorAdr(type);
  7883. IF ~newObjectFile THEN
  7884. IntermediateCode.MakeMemory(operand.tag,addressType);
  7885. END;
  7886. ELSE
  7887. IF ~backend.cooperative THEN
  7888. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7889. END;
  7890. IntermediateCode.MakeMemory(operand.tag,addressType);
  7891. END;
  7892. NilCheck(operand.op);
  7893. ELSIF type IS SyntaxTree.ArrayType THEN
  7894. IF isUnsafe THEN
  7895. NilCheck(operand.op);
  7896. ReleaseIntermediateOperand(operand.tag);
  7897. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7898. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7899. ELSE
  7900. operand.tag := emptyOperand;
  7901. END;
  7902. ELSE
  7903. NilCheck(operand.op);
  7904. IF backend.cooperative THEN
  7905. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7906. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7907. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7908. ELSE
  7909. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7910. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7911. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7912. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7913. END;
  7914. END;
  7915. ELSIF type IS SyntaxTree.MathArrayType THEN
  7916. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7917. IntermediateCode.MakeMemory(operand.op,addressType);
  7918. ELSE HALT(100);
  7919. END;
  7920. END Dereference;
  7921. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7922. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7923. BEGIN
  7924. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7925. dest := destination; destination := emptyOperand;
  7926. Evaluate(x.left,d);
  7927. type := x.type.resolved;
  7928. prevIsUnchecked := isUnchecked;
  7929. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7930. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7931. END;
  7932. Dereference(d,type,IsUnsafePointer(x.left.type));
  7933. isUnchecked := prevIsUnchecked;
  7934. result := d;
  7935. 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
  7936. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7937. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7938. END;
  7939. END;
  7940. destination := dest;
  7941. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7942. END VisitDereferenceDesignator;
  7943. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7944. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7945. BEGIN
  7946. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7947. dest := destination; destination := emptyOperand;
  7948. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7949. tag := result.op;
  7950. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7951. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7952. StaticCallOperand(result,procedure.super);
  7953. ReleaseIntermediateOperand(result.tag);
  7954. UseIntermediateOperand(tag); (* necessary ? *)
  7955. result.tag := tag;
  7956. destination := dest;
  7957. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7958. END VisitSupercallDesignator;
  7959. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7960. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7961. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7962. name: Basic.SegmentedName;
  7963. BEGIN
  7964. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7965. dest := destination; destination := emptyOperand;
  7966. scope := currentScope;
  7967. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7968. scope := scope.outerScope;
  7969. END;
  7970. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7971. IF newObjectFile THEN
  7972. moduleSection := meta.ModuleSection();
  7973. IF backend.cooperative THEN
  7974. moduleOffset := 0;
  7975. ELSE
  7976. moduleOffset := moduleSection.pc;
  7977. END;
  7978. result.mode := ModeValue;
  7979. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7980. ELSE
  7981. Symbol(moduleSelf,result);
  7982. IntermediateCode.MakeMemory(result.op,addressType);
  7983. END
  7984. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7985. result.mode := ModeValue;
  7986. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7987. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7988. ELSE
  7989. GetBaseRegister(basereg,currentScope,scope);
  7990. InitOperand(result,ModeReference);
  7991. result.op := basereg;
  7992. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7993. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7994. IF backend.cooperative THEN
  7995. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7996. END;
  7997. (* tag must be loaded when dereferencing SELF pointer *)
  7998. END;
  7999. destination := dest;
  8000. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8001. END VisitSelfDesignator;
  8002. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8003. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8004. BEGIN
  8005. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8006. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8007. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8008. parameter := procedureType.returnParameter;
  8009. VisitParameter(parameter);
  8010. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8011. END VisitResultDesignator;
  8012. (** values *)
  8013. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8014. BEGIN
  8015. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8016. IF conditional THEN
  8017. IF x.value THEN BrL(trueLabel)
  8018. ELSE BrL(falseLabel)
  8019. END;
  8020. ELSE
  8021. InitOperand(result,ModeValue);
  8022. IF x.value THEN result.op := true ELSE result.op := false END;
  8023. END;
  8024. END VisitBooleanValue;
  8025. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8026. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8027. BEGIN
  8028. Global.GetModuleSegmentedName(module.module, name);
  8029. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8030. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8031. RETURN section
  8032. END GetDataSection;
  8033. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8034. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8035. BEGIN
  8036. type := vop.type;
  8037. data := GetDataSection();
  8038. pc := EnterImmediate(data,vop);
  8039. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8040. IntermediateCode.MakeMemory(vop, type);
  8041. END GetImmediateMem;
  8042. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8043. BEGIN
  8044. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8045. InitOperand(result,ModeValue);
  8046. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8047. IF ~supportedImmediate(result.op) &~inData THEN
  8048. GetImmediateMem(result.op)
  8049. END;
  8050. END VisitIntegerValue;
  8051. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8052. BEGIN
  8053. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8054. InitOperand(result,ModeValue);
  8055. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8056. END VisitCharacterValue;
  8057. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8058. BEGIN
  8059. IF Trace THEN TraceEnter("VisitSetValue") END;
  8060. InitOperand(result,ModeValue);
  8061. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8062. END VisitSetValue;
  8063. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8064. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8065. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8066. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8067. BEGIN
  8068. numberElements := x.elements.Length();
  8069. FOR i := 0 TO numberElements-1 DO
  8070. expression := x.elements.GetExpression(i);
  8071. IF expression IS SyntaxTree.MathArrayExpression THEN
  8072. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8073. ELSE
  8074. inData := TRUE;
  8075. Evaluate(expression,op);
  8076. irv.Emit(Data(position,op.op));
  8077. inData := FALSE;
  8078. ReleaseOperand(op);
  8079. END;
  8080. END;
  8081. END RecursiveData;
  8082. BEGIN
  8083. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8084. IF ~TryConstantDeclaration() THEN
  8085. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8086. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8087. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8088. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8089. ELSE
  8090. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8091. END;
  8092. RecursiveData(x.array);
  8093. InitOperand(result,ModeReference);
  8094. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8095. END
  8096. END VisitMathArrayValue;
  8097. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8098. VAR constant: Sections.Section;
  8099. BEGIN
  8100. IF constantDeclaration = NIL THEN
  8101. RETURN FALSE
  8102. ELSE
  8103. (* Is a constant in this module: did we generate it already? *)
  8104. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8105. IF constant # NIL THEN
  8106. InitOperand(result,ModeReference);
  8107. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8108. RETURN TRUE;
  8109. END;
  8110. END;
  8111. RETURN FALSE
  8112. END TryConstantDeclaration;
  8113. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8114. BEGIN
  8115. constantDeclaration := x;
  8116. x.value.resolved.Accept(SELF);
  8117. END VisitConstant;
  8118. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8119. BEGIN
  8120. IF Trace THEN TraceEnter("VisitRealValue") END;
  8121. InitOperand(result,ModeValue);
  8122. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8123. END VisitRealValue;
  8124. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8125. VAR
  8126. componentType: SyntaxTree.Type;
  8127. BEGIN
  8128. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8129. ASSERT(x.type IS SyntaxTree.ComplexType);
  8130. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8131. InitOperand(result,ModeValue);
  8132. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8133. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8134. END VisitComplexValue;
  8135. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8136. VAR i: LONGINT; name: Basic.SegmentedName;
  8137. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8138. BEGIN
  8139. IF Trace THEN TraceEnter("VisitStringValue") END;
  8140. IF ~TryConstantDeclaration() THEN
  8141. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8142. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8143. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8144. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8145. ELSE
  8146. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8147. END;
  8148. FOR i := 0 TO x.length-1 DO
  8149. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8150. irv.Emit(Data(position,op));
  8151. END;
  8152. InitOperand(result,ModeReference);
  8153. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8154. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8155. END
  8156. END VisitStringValue;
  8157. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8158. BEGIN
  8159. IF Trace THEN TraceEnter("VisitNilValue") END;
  8160. InitOperand(result,ModeValue);
  8161. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8162. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8163. END VisitNilValue;
  8164. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8165. BEGIN
  8166. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8167. InitOperand(result,ModeValue);
  8168. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8169. END VisitEnumerationValue;
  8170. (** symbols *)
  8171. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8172. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8173. END VisitImport;
  8174. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8175. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8176. BEGIN
  8177. IF scope # baseScope THEN
  8178. (* left := [fp+8] *)
  8179. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8180. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8181. ReuseCopy(left,right);
  8182. ReleaseIntermediateOperand(right);
  8183. scope := scope.outerScope; DEC(level);
  8184. (* { left := [left+8] } *)
  8185. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8186. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8187. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8188. Emit(Mov(position,left,right));
  8189. scope := scope.outerScope; DEC(level);
  8190. END;
  8191. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8192. result := left;
  8193. ELSE
  8194. result := fp;
  8195. END;
  8196. END GetBaseRegister;
  8197. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8198. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8199. BEGIN
  8200. IF Trace THEN TraceEnter("VisitVariable"); END;
  8201. type := x.type.resolved;
  8202. IF (x.useRegister) THEN
  8203. InitOperand(result, ModeValue);
  8204. IF x.registerNumber < 0 THEN
  8205. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8206. reg := x.registerNumber;
  8207. ELSE
  8208. reg := registerUsageCount.Map(x.registerNumber);
  8209. UseRegister(reg);
  8210. END;
  8211. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8212. ELSIF x.externalName # NIL THEN
  8213. InitOperand(result,ModeReference);
  8214. Basic.ToSegmentedName(x.externalName^, name);
  8215. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8216. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8217. InitOperand(result,ModeReference);
  8218. GetBaseRegister(result.op,currentScope,x.scope);
  8219. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8220. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8221. InitOperand(result,ModeReference);
  8222. GetCodeSectionNameForSymbol(x,name);
  8223. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8224. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8225. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8226. InitOperand(result,ModeReference);
  8227. GetCodeSectionNameForSymbol(x,name);
  8228. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8229. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8230. ELSE (* field, left designator must have been emitted *)
  8231. ASSERT(result.mode = ModeReference);
  8232. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8233. ReuseCopy(temp,result.op);
  8234. ReleaseIntermediateOperand(result.op);
  8235. result.op := temp;
  8236. END;
  8237. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8238. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8239. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8240. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8241. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8242. END;
  8243. END;
  8244. END;
  8245. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8246. ValueToCondition(result);
  8247. ELSIF type IS SyntaxTree.ProcedureType THEN
  8248. ReleaseIntermediateOperand(result.tag);
  8249. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8250. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8251. UseIntermediateOperand(result.tag);
  8252. ELSE
  8253. result.tag := nil; (* nil *)
  8254. END;
  8255. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8256. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8257. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8258. ReleaseIntermediateOperand(result.tag);
  8259. Global.GetSymbolSegmentedName(x,name);
  8260. Basic.AppendToSegmentedName(name,"@len");
  8261. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8262. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8263. ELSE
  8264. END;
  8265. ELSE
  8266. ReleaseIntermediateOperand(result.tag);
  8267. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8268. END;
  8269. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8270. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8271. ReleaseIntermediateOperand(result.tag);
  8272. result.tag := result.op;
  8273. UseIntermediateOperand(result.tag);
  8274. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8275. IntermediateCode.MakeMemory(result.op,addressType);
  8276. END;
  8277. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8278. ReleaseIntermediateOperand(result.tag);
  8279. result.tag := TypeDescriptorAdr(type);
  8280. IF ~newObjectFile THEN
  8281. IntermediateCode.MakeMemory(result.tag,addressType);
  8282. END;
  8283. UseIntermediateOperand(result.tag);
  8284. (* tag for pointer type computed not here but during dereferencing *)
  8285. END;
  8286. IF Trace THEN TraceExit("VisitVariable") END;
  8287. END VisitVariable;
  8288. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8289. BEGIN
  8290. VisitVariable(property);
  8291. END VisitProperty;
  8292. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8293. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8294. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8295. BEGIN
  8296. type := x.type.resolved;
  8297. IF Trace THEN TraceEnter("VisitParameter") END;
  8298. IF x.ownerType IS SyntaxTree.CellType THEN
  8299. ptype := x.type.resolved;
  8300. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8301. IF ~(ptype IS SyntaxTree.PortType) THEN
  8302. InitOperand(result,ModeReference);
  8303. GetCodeSectionNameForSymbol(x,name);
  8304. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8305. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8306. RETURN
  8307. ELSE
  8308. InitOperand(result, ModeValue);
  8309. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8310. adr := 0;
  8311. WHILE parameter # x DO
  8312. parameterType := parameter.type;
  8313. inc := 1;
  8314. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8315. INC(adr, inc);
  8316. parameter := parameter.nextParameter
  8317. END;
  8318. adr := backend.activeCellsSpecification.GetPortAddress(adr);
  8319. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8320. RETURN
  8321. END;
  8322. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8323. InitOperand(result,ModeReference);
  8324. GetCodeSectionNameForSymbol(x,name);
  8325. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8326. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8327. RETURN
  8328. ELSE
  8329. GetBaseRegister(basereg,currentScope,x.scope);
  8330. InitOperand(result,ModeReference);
  8331. result.op := basereg;
  8332. END;
  8333. IF IsOpenArray(type) THEN
  8334. result.tag := basereg;
  8335. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8336. IntermediateCode.MakeMemory(result.op,addressType);
  8337. IF Global.IsOberonProcedure(x.ownerType) THEN
  8338. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8339. UseIntermediateOperand(result.tag);
  8340. ELSE
  8341. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8342. END;
  8343. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8344. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8345. ELSIF IsStaticArray(type) THEN
  8346. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8347. IntermediateCode.MakeMemory(result.op,addressType);
  8348. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8349. ELSIF type IS SyntaxTree.MathArrayType THEN
  8350. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8351. WITH type: SyntaxTree.MathArrayType DO
  8352. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8353. IF type.form = SyntaxTree.Tensor THEN
  8354. ELSIF type.form = SyntaxTree.Open THEN
  8355. result.tag := result.op;
  8356. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8357. IntermediateCode.MakeMemory(result.op,addressType);
  8358. UseIntermediateOperand(result.tag);
  8359. ELSIF type.form = SyntaxTree.Static THEN
  8360. IF x.kind = SyntaxTree.ConstParameter THEN
  8361. IntermediateCode.MakeMemory(result.op,addressType);
  8362. END;
  8363. ELSE HALT(100)
  8364. END;
  8365. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8366. IF type.form = SyntaxTree.Tensor THEN
  8367. ToMemory(result.op,addressType,0);
  8368. ELSIF type.form = SyntaxTree.Open THEN
  8369. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8370. ReuseCopy(result.tag, mem);
  8371. ReleaseIntermediateOperand(mem);
  8372. ReleaseIntermediateOperand(result.op);
  8373. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8374. ELSIF type.form = SyntaxTree.Static THEN
  8375. IntermediateCode.MakeMemory(result.op,addressType);
  8376. ELSE HALT(100)
  8377. END;
  8378. ELSE HALT(100)
  8379. END;
  8380. END;
  8381. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8382. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8383. IntermediateCode.MakeMemory(result.op,addressType);
  8384. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8385. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8386. END;
  8387. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8388. ValueToCondition(result);
  8389. ELSIF type IS SyntaxTree.ProcedureType THEN
  8390. ReleaseIntermediateOperand(result.tag);
  8391. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8392. IF x.kind = SyntaxTree.VarParameter THEN
  8393. ReuseCopy(result.tag,result.op);
  8394. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8395. IntermediateCode.MakeMemory(result.tag,addressType);
  8396. ELSE
  8397. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8398. UseIntermediateOperand(result.tag);
  8399. END;
  8400. ELSE
  8401. result.tag := nil;
  8402. END;
  8403. (* tag for pointer type computed not here but during dereferencing *)
  8404. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8405. ReleaseIntermediateOperand(result.tag);
  8406. result.tag := basereg;
  8407. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8408. IntermediateCode.MakeMemory(result.tag,addressType);
  8409. UseIntermediateOperand(result.tag);
  8410. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8411. ReleaseIntermediateOperand(result.tag);
  8412. result.tag := TypeDescriptorAdr(type);
  8413. IF ~newObjectFile THEN
  8414. IntermediateCode.MakeMemory(result.tag,addressType);
  8415. END;
  8416. UseIntermediateOperand(result.tag);
  8417. END;
  8418. IF Trace THEN TraceExit("VisitParameter") END;
  8419. END VisitParameter;
  8420. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8421. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8422. BEGIN
  8423. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8424. (* left.p: left already emitted *)
  8425. tag := result.op; (* value of pointer to left *)
  8426. (* get type desc *)
  8427. tmp := result.tag;
  8428. IntermediateCode.MakeMemory(tmp,addressType);
  8429. (* get method adr *)
  8430. Reuse1(reg,tmp);
  8431. ReleaseIntermediateOperand(tmp);
  8432. IF backend.cooperative THEN
  8433. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8434. WHILE recordType.baseType # NIL DO
  8435. recordType := recordType.GetBaseRecord ();
  8436. END;
  8437. GetRecordTypeName (recordType,name);
  8438. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8439. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8440. offset := 0;
  8441. ELSE
  8442. offset := 2;
  8443. END;
  8444. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8445. ELSE
  8446. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8447. END;
  8448. InitOperand(operand,ModeReference);
  8449. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8450. operand.op := reg;
  8451. operand.tag := tag;
  8452. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8453. END DynamicCallOperand;
  8454. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8455. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8456. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8457. BEGIN
  8458. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8459. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8460. tag := operand.op;
  8461. ReleaseIntermediateOperand(operand.tag);
  8462. ELSE tag := nil
  8463. END;
  8464. IF x.isInline THEN
  8465. sectionType := Sections.InlineCodeSection;
  8466. ELSE
  8467. sectionType := Sections.CodeSection;
  8468. END;
  8469. IF x.externalName # NIL THEN
  8470. Basic.ToSegmentedName(x.externalName^, name);
  8471. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8472. ELSE
  8473. GetCodeSectionNameForSymbol(x, name);
  8474. IF (x.scope.ownerModule = module.module) THEN
  8475. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8476. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8477. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8478. IF source.pc = 0 THEN (* no code yet *)
  8479. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8480. END;
  8481. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8482. bits := x.procedureScope.body.code.inlineCode;
  8483. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8484. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8485. binary.CopyBits(bits, 0, bits.GetSize());
  8486. source.SetResolved(binary);
  8487. ELSE
  8488. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8489. END;
  8490. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8491. END;
  8492. InitOperand(operand,ModeValue);
  8493. operand.op := reg;
  8494. operand.tag := tag;
  8495. IF Trace THEN TraceExit("StaticCallOperand") END;
  8496. END StaticCallOperand;
  8497. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8498. (* handle expressions of the form designator.procedure or procedure *)
  8499. BEGIN
  8500. IF Trace THEN TraceEnter("VisitProcedure") END;
  8501. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8502. DynamicCallOperand(result,x);
  8503. ELSIF x.isInline THEN
  8504. StaticCallOperand(result,x);
  8505. ELSE
  8506. StaticCallOperand(result,x);
  8507. END;
  8508. IF Trace THEN TraceExit("VisitProcedure") END;
  8509. END VisitProcedure;
  8510. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8511. BEGIN
  8512. VisitProcedure(x);
  8513. END VisitOperator;
  8514. (** statements *)
  8515. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8516. BEGIN
  8517. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8518. Expression(x.call);
  8519. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8520. ReleaseOperand(result)
  8521. END;
  8522. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8523. END VisitProcedureCallStatement;
  8524. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8525. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8526. leftBase, rightBase: SyntaxTree.Type;
  8527. procedureName,s: SyntaxTree.IdentifierString;
  8528. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8529. size: LONGINT; rightKind: LONGINT;
  8530. dummy: IntermediateCode.Operand;
  8531. CONST moduleName = "FoxArrayBase";
  8532. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8533. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8534. BEGIN
  8535. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8536. IF base IS SyntaxTree.MathArrayType THEN
  8537. base := OpenArray(base(SyntaxTree.MathArrayType));
  8538. END;
  8539. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8540. result.SetArrayBase(base);
  8541. RETURN result
  8542. END OpenArray;
  8543. BEGIN
  8544. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8545. SaveRegisters();ReleaseUsedRegisters(saved);
  8546. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8547. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8548. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8549. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8550. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8551. IF leftType.form = SyntaxTree.Tensor THEN
  8552. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8553. ELSIF leftType.form = SyntaxTree.Open THEN
  8554. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8555. ELSIF leftType.form = SyntaxTree.Static THEN
  8556. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8557. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8558. END;
  8559. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8560. IF procedure = NIL THEN
  8561. s := "Instruction not supported on target, emulation procedure ";
  8562. Strings.Append(s,moduleName);
  8563. Strings.Append(s,".");
  8564. Strings.Append(s,procedureName);
  8565. Strings.Append(s," not present");
  8566. Error(position,s);
  8567. ELSE
  8568. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8569. parameter.SetType(leftType);
  8570. parameter.SetAccess(SyntaxTree.Internal);
  8571. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8572. parameter.SetKind(rightKind);
  8573. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8574. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8575. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8576. StaticCallOperand(result,procedure);
  8577. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8578. ReleaseOperand(result);
  8579. END;
  8580. RestoreRegisters(saved);
  8581. END;
  8582. END AssignMathArray;
  8583. VAR modifyAssignmentCounter := 0: LONGINT;
  8584. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8585. VAR processor,mem,dst: IntermediateCode.Operand;
  8586. BEGIN
  8587. IF value.intValue = true.intValue THEN
  8588. INC(modifyAssignmentCounter);
  8589. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8590. modifyAssignmentsPC := section.pc;
  8591. ELSE
  8592. DEC(modifyAssignmentCounter);
  8593. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8594. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8595. END;
  8596. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8597. dst := NewRegisterOperand (addressType);
  8598. Emit(Mov(position,dst, processor));
  8599. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8600. Emit(Mov(position,mem, value));
  8601. ReleaseIntermediateOperand(dst);
  8602. END ModifyAssignments;
  8603. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8604. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8605. BEGIN
  8606. type := left.type.resolved;
  8607. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8608. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8609. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8610. IF procedureType.returnParameter = parameter THEN
  8611. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8612. END;
  8613. END;
  8614. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8615. END CopySize;
  8616. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8617. VAR
  8618. leftO, rightO: Operand;
  8619. mem, sizeOp: IntermediateCode.Operand;
  8620. leftType, rightType, componentType: SyntaxTree.Type;
  8621. size: LONGINT;
  8622. parameters: SyntaxTree.ExpressionList;
  8623. procedure: SyntaxTree.Procedure;
  8624. call: SyntaxTree.ProcedureCallDesignator;
  8625. designator: SyntaxTree.Designator;
  8626. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8627. VAR procedureType: SyntaxTree.ProcedureType;
  8628. BEGIN
  8629. IF ReturnedAsParameter(right.type) THEN
  8630. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8631. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8632. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8633. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8634. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8635. IF right.id = Global.Reshape THEN RETURN TRUE
  8636. END;
  8637. END;
  8638. END;
  8639. END;
  8640. RETURN FALSE
  8641. END CanPassAsResultParameter;
  8642. BEGIN
  8643. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8644. leftType := left.type.resolved; rightType:= right.type.resolved;
  8645. IF backend.cooperative & left.NeedsTrace() THEN
  8646. ModifyAssignments(true);
  8647. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8648. Designate(right, rightO);
  8649. Designate(left, leftO);
  8650. ASSERT(leftO.mode = ModeReference);
  8651. TransferToRegister(leftO.op, leftO.op);
  8652. TransferToRegister(rightO.op, rightO.op);
  8653. Emit(Push(position, leftO.op));
  8654. Emit(Push(position, rightO.op));
  8655. CallAssignMethod(leftO.op, rightO.op, left.type);
  8656. Emit(Pop(position, rightO.op));
  8657. Emit(Pop(position, leftO.op));
  8658. sizeOp := CopySize(left);
  8659. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8660. ReleaseOperand(leftO);
  8661. ReleaseOperand(rightO);
  8662. ELSE
  8663. Evaluate(right,rightO);
  8664. Designate(left,leftO);
  8665. ASSERT(leftO.mode = ModeReference);
  8666. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8667. (* copy procedure address first *)
  8668. MakeMemory(mem,leftO.op,addressType,0);
  8669. Emit(Mov(position,mem,rightO.op));
  8670. ReleaseIntermediateOperand(mem);
  8671. (* copy pointer address *)
  8672. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8673. CallAssignPointer(leftO.tag, rightO.tag);
  8674. ELSE
  8675. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8676. CallAssignPointer(leftO.op, rightO.op);
  8677. END;
  8678. ReleaseOperand(leftO);
  8679. ReleaseOperand(rightO);
  8680. END;
  8681. ModifyAssignments(false);
  8682. RETURN;
  8683. END;
  8684. IF CanPassAsResultParameter(right) THEN
  8685. procedureResultDesignator := left(SyntaxTree.Designator);
  8686. Expression(right);
  8687. procedureResultDesignator := NIL;
  8688. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8689. (* left <-- ALIAS OF right: zerocopy *)
  8690. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8691. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8692. designator.SetType(procedure.type);
  8693. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8694. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8695. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8696. END;
  8697. ELSIF leftType IS SyntaxTree.RangeType THEN
  8698. (* LHS is of array range type *)
  8699. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8700. Evaluate(right, rightO);
  8701. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8702. (* first *)
  8703. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8704. Emit(Mov(position,mem, rightO.op));
  8705. ReleaseIntermediateOperand(mem);
  8706. (* last *)
  8707. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8708. Emit(Mov(position,mem, rightO.tag));
  8709. ReleaseIntermediateOperand(mem);
  8710. (* step *)
  8711. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8712. Emit(Mov(position,mem, rightO.extra));
  8713. ReleaseIntermediateOperand(mem);
  8714. ReleaseOperand(rightO);
  8715. ReleaseOperand(leftO)
  8716. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8717. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8718. Evaluate(right, rightO);
  8719. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8720. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8721. (* real part *)
  8722. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8723. Emit(Mov(position,mem, rightO.op));
  8724. ReleaseIntermediateOperand(mem);
  8725. (* imaginary part *)
  8726. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8727. Emit(Mov(position,mem, rightO.tag));
  8728. ReleaseIntermediateOperand(mem);
  8729. ReleaseOperand(rightO);
  8730. ReleaseOperand(leftO)
  8731. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8732. OR (leftType IS SyntaxTree.PortType) THEN
  8733. (* rightO := leftO;*)
  8734. Evaluate(right,rightO);
  8735. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8736. Designate(left,leftO);
  8737. IF leftO.mode = ModeReference THEN
  8738. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8739. destination := mem;
  8740. ELSE
  8741. destination := leftO.op;
  8742. END;
  8743. ReleaseOperand(leftO);
  8744. IF destination.mode # IntermediateCode.Undefined THEN
  8745. Emit(Mov(position,destination,rightO.op));
  8746. END;
  8747. ReleaseOperand(rightO);
  8748. ReleaseIntermediateOperand(mem);
  8749. IntermediateCode.InitOperand(destination);
  8750. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8751. Evaluate(right,rightO);
  8752. Designate(left,leftO);
  8753. MakeMemory(mem,leftO.op,addressType,0);
  8754. Emit(Mov(position,mem,rightO.op));
  8755. ReleaseIntermediateOperand(mem);
  8756. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8757. (* delegate *)
  8758. (*
  8759. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8760. *)
  8761. Emit(Mov(position,leftO.tag,rightO.tag));
  8762. END;
  8763. ReleaseOperand(leftO);
  8764. ReleaseOperand(rightO);
  8765. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8766. Designate(right,rightO);
  8767. Designate(left,leftO);
  8768. sizeOp := CopySize(left);
  8769. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8770. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8771. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8772. IF (rightType IS SyntaxTree.StringType) THEN
  8773. CopyString(left,right);
  8774. 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
  8775. Designate(right,rightO);
  8776. Designate(left,leftO);
  8777. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8778. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8779. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8780. ELSE
  8781. HALT(201)
  8782. END;
  8783. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8784. AssignMathArray(left,right);
  8785. ELSE
  8786. HALT(200);
  8787. END;
  8788. END Assign;
  8789. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8790. BEGIN
  8791. IF Trace THEN TraceEnter("VisitAssignment") END;
  8792. Assign(x.left,x.right);
  8793. IF Trace THEN TraceExit("VisitAssignment") END;
  8794. END VisitAssignment;
  8795. PROCEDURE EmitCooperativeSwitch;
  8796. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8797. BEGIN
  8798. ASSERT (cooperativeSwitches);
  8799. pc := section.pc;
  8800. IF lastSwitchPC = section.pc THEN RETURN END;
  8801. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8802. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8803. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8804. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8805. INC(statCoopSwitch, section.pc - pc);
  8806. END EmitCooperativeSwitch;
  8807. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8808. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8809. BEGIN
  8810. p0 := communication.left; p1 := communication.right;
  8811. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8812. Evaluate(p0,s0);
  8813. Evaluate(p1,s1);
  8814. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8815. Emit(Push(position,s0.op));
  8816. Emit(Push(position,s1.op));
  8817. (*
  8818. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8819. *)
  8820. IF ~backend.cellsAreObjects THEN
  8821. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8822. END;
  8823. ReleaseOperand(s0);
  8824. ReleaseOperand(s1);
  8825. IF backend.cellsAreObjects THEN
  8826. CallThis(position,"ActiveCellsRuntime","Send",2);
  8827. ELSE
  8828. CallThis(position,ChannelModuleName,"Send",2);
  8829. END;
  8830. (* ----- RECEIVE ------*)
  8831. ELSE
  8832. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8833. tmp := p0; p0 := p1; p1 := tmp;
  8834. END;
  8835. Evaluate(p0,s0);
  8836. Emit(Push(position,s0.op));
  8837. Designate(p1,s1);
  8838. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8839. Emit(Push(position,s1.op));
  8840. (*
  8841. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8842. *)
  8843. IF ~backend.cellsAreObjects THEN
  8844. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8845. END;
  8846. ReleaseOperand(s0);
  8847. ReleaseOperand(s1);
  8848. IF backend.cellsAreObjects THEN
  8849. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8850. ELSE
  8851. CallThis(position,ChannelModuleName,"Receive",2)
  8852. END;
  8853. END;
  8854. END VisitCommunicationStatement;
  8855. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8856. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8857. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8858. VAR true, false: Label; condition, value: BOOLEAN;
  8859. BEGIN
  8860. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8861. IF condition THEN
  8862. true := NewLabel();
  8863. false := NewLabel();
  8864. Condition(if.condition,true,false);
  8865. SetLabel(true);
  8866. StatementSequence(if.statements);
  8867. BrL(end);
  8868. SetLabel(false);
  8869. ELSE
  8870. IF value THEN (* always true *)
  8871. escape := TRUE;
  8872. StatementSequence(if.statements);
  8873. (* no branch necessary -- rest skipped *)
  8874. END;
  8875. END;
  8876. END IfPart;
  8877. BEGIN
  8878. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8879. end := NewLabel();
  8880. elsifs := x.ElsifParts();
  8881. IfPart(x.ifPart);
  8882. FOR i := 0 TO elsifs-1 DO
  8883. IF ~escape THEN
  8884. elsif := x.GetElsifPart(i);
  8885. IfPart(elsif);
  8886. END;
  8887. END;
  8888. IF (x.elsePart # NIL) & ~escape THEN
  8889. StatementSequence(x.elsePart);
  8890. END;
  8891. SetLabel(end);
  8892. IF Trace THEN TraceExit("VisitIfStatement") END;
  8893. END VisitIfStatement;
  8894. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8895. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8896. BEGIN
  8897. (*IF x.variable.type.resolved = x.type.resolved THEN
  8898. (* always true, do nothing *)
  8899. ELSE*)
  8900. Designate(x.variable,res);
  8901. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8902. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8903. END;
  8904. trueL := NewLabel();
  8905. TypeTest(res.tag,x.type,trueL,falseL);
  8906. ReleaseOperand(res);
  8907. SetLabel(trueL);
  8908. StatementSequence(x.statements);
  8909. BrL(endL);
  8910. END WithPart;
  8911. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8912. VAR endL,falseL: Label;i: LONGINT;
  8913. BEGIN
  8914. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8915. endL := NewLabel();
  8916. FOR i := 0 TO x.WithParts()-1 DO
  8917. falseL := NewLabel();
  8918. WithPart(x.GetWithPart(i),falseL,endL);
  8919. SetLabel(falseL);
  8920. END;
  8921. IF x.elsePart = NIL THEN
  8922. IF ~isUnchecked THEN
  8923. EmitTrap(position,WithTrap);
  8924. END;
  8925. ELSE
  8926. StatementSequence(x.elsePart)
  8927. END;
  8928. SetLabel(endL);
  8929. IF Trace THEN TraceExit("VisitWithStatement") END;
  8930. END VisitWithStatement;
  8931. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8932. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8933. out,else: Label; label: Label;
  8934. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8935. symbol: SyntaxTree.Symbol;
  8936. BEGIN
  8937. (*! split case statement into if-elsif statements for large case label lists *)
  8938. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8939. size := x.max-x.min+1;
  8940. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8941. END;
  8942. Evaluate(x.variable,var);
  8943. ReuseCopy(tmp,var.op);
  8944. ReleaseIntermediateOperand(var.op);
  8945. var.op := tmp;
  8946. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8947. Convert(var.op,addressType);
  8948. size := x.max-x.min+1;
  8949. else := NewLabel();
  8950. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8951. (*
  8952. UniqueId(name,module.module,"case",caseId);
  8953. *)
  8954. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8955. Global.GetModuleSegmentedName(module.module, name);
  8956. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8957. symbol := SyntaxTree.NewSymbol(name[1]);
  8958. symbol.SetScope(moduleScope);
  8959. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8960. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8961. section.isCaseTable := TRUE;
  8962. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8963. ReuseCopy(res,var.op);
  8964. ReleaseOperand(var);
  8965. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8966. Emit(Add(position,res,res,jmp));
  8967. IntermediateCode.MakeMemory(res,addressType);
  8968. Emit(Br(position,res));
  8969. ReleaseIntermediateOperand(res);
  8970. out := NewLabel();
  8971. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8972. part := x.GetCasePart(i);
  8973. constant := part.firstConstant;
  8974. label := NewLabel();
  8975. SetLabel(label);
  8976. WHILE(constant # NIL) DO (* case labels for this case part *)
  8977. FOR j := constant.min TO constant.max DO
  8978. fixups[j-x.min] := label;
  8979. END;
  8980. constant := constant.next;
  8981. END;
  8982. StatementSequence(part.statements);
  8983. BrL(out);
  8984. END;
  8985. SetLabel(else);
  8986. FOR i := 0 TO size-1 DO
  8987. IF fixups[i] = NIL THEN
  8988. fixups[i] := else;
  8989. END;
  8990. END;
  8991. IF x.elsePart # NIL THEN
  8992. StatementSequence(x.elsePart);
  8993. ELSIF ~isUnchecked THEN
  8994. EmitTrap(position,CaseTrap);
  8995. END;
  8996. SetLabel(out);
  8997. FOR i := 0 TO size-1 DO
  8998. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8999. section.Emit(Data(position,op));
  9000. END;
  9001. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9002. END VisitCaseStatement;
  9003. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9004. VAR start: Label; true,false: Label;
  9005. BEGIN
  9006. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9007. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9008. start := NewLabel();
  9009. true := NewLabel();
  9010. false := NewLabel();
  9011. SetLabel(start);
  9012. Condition(x.condition,true,false);
  9013. SetLabel(true);
  9014. StatementSequence(x.statements);
  9015. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9016. BrL(start);
  9017. SetLabel(false);
  9018. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9019. END VisitWhileStatement;
  9020. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9021. VAR false,true: Label;
  9022. BEGIN
  9023. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9024. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9025. true := NewLabel();
  9026. false := NewLabel();
  9027. SetLabel(false);
  9028. StatementSequence(x.statements);
  9029. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9030. Condition(x.condition,true,false);
  9031. SetLabel(true);
  9032. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9033. END VisitRepeatStatement;
  9034. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9035. VAR
  9036. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9037. temporaryVariable: SyntaxTree.Variable;
  9038. temporaryVariableDesignator : SyntaxTree.Designator;
  9039. BEGIN
  9040. IF Trace THEN TraceEnter("VisitForStatement") END;
  9041. true := NewLabel();
  9042. false := NewLabel();
  9043. start := NewLabel();
  9044. Assign(x.variable,x.from);
  9045. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9046. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9047. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9048. Assign(temporaryVariableDesignator,x.to);
  9049. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9050. IF by > 0 THEN
  9051. cmp := Scanner.LessEqual
  9052. ELSE
  9053. cmp := Scanner.GreaterEqual
  9054. END;
  9055. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9056. binary.SetType(system.booleanType);
  9057. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9058. SetLabel(start);
  9059. Condition(binary,true,false);
  9060. SetLabel(true);
  9061. StatementSequence(x.statements);
  9062. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9063. binary.SetType(x.variable.type);
  9064. Assign(x.variable,binary);
  9065. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9066. BrL(start);
  9067. SetLabel(false);
  9068. IF Trace THEN TraceExit("VisitForStatement") END;
  9069. END VisitForStatement;
  9070. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9071. VAR prevLoop: Label;
  9072. BEGIN
  9073. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9074. prevLoop := currentLoop;
  9075. currentLoop := NewLabel();
  9076. StatementSequence(x.statements);
  9077. SetLabel(currentLoop);
  9078. currentLoop := prevLoop;
  9079. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9080. END VisitExitableBlock;
  9081. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9082. VAR prevLoop,start: Label;
  9083. BEGIN
  9084. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9085. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9086. start := NewLabel();
  9087. prevLoop := currentLoop;
  9088. SetLabel(start);
  9089. currentLoop := NewLabel();
  9090. StatementSequence(x.statements);
  9091. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9092. BrL(start);
  9093. SetLabel(currentLoop);
  9094. currentLoop := prevLoop;
  9095. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9096. END VisitLoopStatement;
  9097. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9098. VAR outer: SyntaxTree.Statement;
  9099. BEGIN
  9100. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9101. IF locked THEN (* r if we jump out of an exclusive block *)
  9102. outer := x.outer;
  9103. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9104. outer := outer.outer;
  9105. END;
  9106. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9107. Lock(FALSE);
  9108. END;
  9109. END;
  9110. BrL(currentLoop);
  9111. IF Trace THEN TraceExit("VisitExitStatement") END;
  9112. END VisitExitStatement;
  9113. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9114. VAR
  9115. expression, parameterDesignator: SyntaxTree.Expression;
  9116. type, componentType: SyntaxTree.Type;
  9117. res, right: Operand;
  9118. left, mem, reg: IntermediateCode.Operand;
  9119. parameter: SyntaxTree.Parameter;
  9120. procedure: SyntaxTree.Procedure;
  9121. procedureType: SyntaxTree.ProcedureType;
  9122. returnTypeOffset: LONGINT;
  9123. delegate: BOOLEAN;
  9124. map: SymbolMap;
  9125. BEGIN
  9126. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9127. expression := x.returnValue;
  9128. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9129. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9130. IF currentIsInline THEN
  9131. IF expression # NIL THEN
  9132. map := currentMapper.Get(NIL);
  9133. IF map # NIL THEN
  9134. Assign(map.to, expression);
  9135. END;
  9136. END;
  9137. BrL(currentInlineExit);
  9138. RETURN;
  9139. END;
  9140. IF expression # NIL THEN
  9141. type := expression.type.resolved;
  9142. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9143. IF locked THEN Lock(FALSE) END;
  9144. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9145. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9146. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9147. (* return without structured return parameter *)
  9148. Evaluate(expression,res);
  9149. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9150. IF locked OR profile THEN
  9151. Emit(Push(position,res.op));
  9152. IF delegate THEN HALT(200) END;
  9153. ReleaseOperand(res);
  9154. IF locked THEN Lock(FALSE) END;
  9155. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9156. reg := NewRegisterOperand(res.op.type);
  9157. Emit(Pop(position,reg));
  9158. Emit(Return(position,reg));
  9159. ReleaseIntermediateOperand(reg);
  9160. ELSE
  9161. Emit(Return(position,res.op));
  9162. ReleaseOperand(res);
  9163. END;
  9164. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9165. THEN
  9166. (* return using structured return parameter *)
  9167. 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)
  9168. OR SemanticChecker.IsPointerType(type));
  9169. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9170. parameter :=procedureType.returnParameter;
  9171. ASSERT(parameter # NIL);
  9172. returnTypeOffset := parameter.offsetInBits;
  9173. (*
  9174. IF parameter# NIL THEN
  9175. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9176. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9177. ELSE
  9178. returnTypeOffset := system.offsetFirstParameter
  9179. END;
  9180. *)
  9181. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9182. IF type IS SyntaxTree.RangeType THEN
  9183. (* array range type *)
  9184. Evaluate(expression, right);
  9185. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9186. Emit(Mov(position,mem, right.op)); (* first *)
  9187. ReleaseIntermediateOperand(mem);
  9188. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9189. Emit(Mov(position,mem, right.tag)); (* last *)
  9190. ReleaseIntermediateOperand(mem);
  9191. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9192. Emit(Mov(position,mem, right.extra)); (* step *)
  9193. ReleaseIntermediateOperand(mem);
  9194. ReleaseOperand(right);
  9195. ELSIF type IS SyntaxTree.ComplexType THEN
  9196. Evaluate(expression, right);
  9197. componentType := type(SyntaxTree.ComplexType).componentType;
  9198. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9199. Emit(Mov(position,mem, right.op)); (* real part *)
  9200. ReleaseIntermediateOperand(mem);
  9201. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9202. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9203. ReleaseIntermediateOperand(mem);
  9204. ReleaseOperand(right);
  9205. ELSE (* covers cases: pointer / record / array *)
  9206. parameter := procedureType.returnParameter;
  9207. checker.SetCurrentScope(currentScope);
  9208. ASSERT(parameter # NIL);
  9209. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9210. Assign(parameterDesignator,expression);
  9211. END;
  9212. ReleaseIntermediateOperand(left);
  9213. IF locked THEN Lock(FALSE) END;
  9214. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9215. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9216. parameter := procedureType.returnParameter;
  9217. checker.SetCurrentScope(currentScope);
  9218. IF parameter = NIL THEN
  9219. Error(procedure.position, "structured return of parameter of procedure not found");
  9220. ELSE
  9221. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9222. Assign(parameterDesignator,expression);
  9223. END;
  9224. IF locked THEN Lock(FALSE) END;
  9225. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9226. ELSE
  9227. HALT(200);
  9228. END;
  9229. ELSE
  9230. IF locked THEN Lock(FALSE) END;
  9231. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9232. END;
  9233. IF backend.cooperative THEN
  9234. BrL(exitLabel);
  9235. ELSE
  9236. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9237. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9238. END;
  9239. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9240. END VisitReturnStatement;
  9241. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9242. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9243. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9244. statements: SyntaxTree.StatementSequence;
  9245. name, suffix: SyntaxTree.IdentifierString;
  9246. BEGIN
  9247. Strings.IntToStr(awaitProcCounter,suffix);
  9248. Strings.Concat("@AwaitProcedure",suffix,name);
  9249. identifier := SyntaxTree.NewIdentifier(name);
  9250. INC(awaitProcCounter);
  9251. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9252. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9253. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9254. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9255. procedure.SetAccess(SyntaxTree.Hidden);
  9256. procedure.SetScope(currentScope);
  9257. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9258. procedureType.SetReturnType(system.booleanType);
  9259. procedure.SetType(procedureType);
  9260. body := SyntaxTree.NewBody(x.position,procedureScope);
  9261. procedureScope.SetBody(body);
  9262. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9263. returnStatement.SetReturnValue(x.condition);
  9264. statements := SyntaxTree.NewStatementSequence();
  9265. statements.AddStatement(returnStatement);
  9266. body.SetStatementSequence(statements);
  9267. currentScope.AddProcedure(procedure);
  9268. RETURN procedure
  9269. END MakeAwaitProcedure;
  9270. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9271. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9272. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9273. BEGIN
  9274. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9275. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9276. IF backend.cooperative THEN
  9277. start := NewLabel();
  9278. true := NewLabel();
  9279. false := NewLabel();
  9280. SetLabel(start);
  9281. Condition(x.condition,true,false);
  9282. SetLabel(false);
  9283. PushSelfPointer();
  9284. CallThis(position,"ExclusiveBlocks","Await",1);
  9285. BrL(start);
  9286. SetLabel(true);
  9287. PushSelfPointer();
  9288. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9289. ELSE
  9290. proc := MakeAwaitProcedure(x);
  9291. Emit(Push(position,fp));
  9292. GetCodeSectionNameForSymbol(proc,name);
  9293. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9294. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9295. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9296. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9297. Emit(Result(position,res));
  9298. (*
  9299. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9300. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9301. *)
  9302. InitOperand(result,ModeValue);
  9303. result.op := res;
  9304. label := NewLabel();
  9305. BreqL(label, result.op, SELF.true);
  9306. ReleaseOperand(result);
  9307. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9308. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9309. Emit(Push(position,res));
  9310. Emit(Push(position,fp));
  9311. PushSelfPointer();
  9312. Emit(Push(position,nil));
  9313. CallThis(position,"Objects","Await",4);
  9314. SetLabel(label);
  9315. END;
  9316. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9317. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9318. END VisitAwaitStatement;
  9319. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9320. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9321. BEGIN
  9322. FOR i := 0 TO x.Length() - 1 DO
  9323. statement := x.GetStatement( i );
  9324. Statement(statement);
  9325. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9326. END;
  9327. END StatementSequence;
  9328. PROCEDURE PushSelfPointer;
  9329. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9330. BEGIN
  9331. scope := currentScope;
  9332. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9333. scope := scope.outerScope;
  9334. END;
  9335. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9336. IF ~newObjectFile THEN
  9337. Symbol(moduleSelf,op);
  9338. IntermediateCode.MakeMemory(op.op,addressType);
  9339. ELSE
  9340. moduleSection := meta.ModuleSection();
  9341. IF backend.cooperative THEN
  9342. moduleOffset := 0;
  9343. ELSE
  9344. moduleOffset := moduleSection.pc;
  9345. END;
  9346. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9347. END;
  9348. ELSE
  9349. GetBaseRegister(op.op,currentScope,scope);
  9350. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9351. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9352. IF backend.cooperative THEN
  9353. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9354. END;
  9355. IntermediateCode.MakeMemory(op.op,addressType);
  9356. END;
  9357. Emit(Push(position,op.op));
  9358. ReleaseOperand(op);
  9359. END PushSelfPointer;
  9360. PROCEDURE Lock(lock: BOOLEAN);
  9361. BEGIN
  9362. IF Trace THEN TraceEnter("Lock") END;
  9363. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9364. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9365. ASSERT(modifyAssignmentCounter = 0);
  9366. IF dump # NIL THEN
  9367. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9368. dump.Ln;dump.Update;
  9369. END;
  9370. PushSelfPointer;
  9371. IF backend.cooperative THEN
  9372. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9373. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9374. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9375. END;
  9376. ELSE
  9377. Emit(Push(position,true));
  9378. IF lock THEN CallThis(position,"Objects","Lock",2)
  9379. ELSE CallThis(position,"Objects","Unlock",2);
  9380. END;
  9381. END;
  9382. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9383. IF Trace THEN TraceExit("Lock") END;
  9384. END Lock;
  9385. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9386. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9387. BEGIN
  9388. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9389. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9390. previouslyUnchecked := isUnchecked;
  9391. isUnchecked := isUnchecked OR x.isUnchecked;
  9392. previouslyCooperativeSwitches := cooperativeSwitches;
  9393. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9394. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9395. IF x.statements # NIL THEN
  9396. StatementSequence(x.statements);
  9397. END;
  9398. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9399. isUnchecked := previouslyUnchecked;
  9400. cooperativeSwitches := previouslyCooperativeSwitches;
  9401. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9402. END VisitStatementBlock;
  9403. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9404. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9405. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9406. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9407. procedure: SyntaxTree.Procedure;
  9408. map: SymbolMap;
  9409. BEGIN
  9410. scope := currentScope;
  9411. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9412. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9413. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9414. return := emptyOperand;
  9415. IF Trace THEN TraceEnter("VisitCode") END;
  9416. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9417. NEW(in, x.inRules.Length());
  9418. FOR i := 0 TO LEN(in)-1 DO
  9419. statement := x.inRules.GetStatement(i);
  9420. WITH statement: SyntaxTree.Assignment DO
  9421. Evaluate(statement.right, operand);
  9422. result := operand.op;
  9423. NEW(str, 64);
  9424. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9425. in[i] := result; IntermediateCode.SetString(in[i], str);
  9426. ReleaseIntermediateOperand(operand.tag);
  9427. END;
  9428. END;
  9429. ELSE in := NIL
  9430. END;
  9431. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9432. NEW(out, x.outRules.Length());
  9433. FOR i := 0 TO LEN(out)-1 DO
  9434. statement := x.outRules.GetStatement(i);
  9435. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9436. WITH statement: SyntaxTree.Assignment DO
  9437. Evaluate(statement.left, operand); (*?? or designate *)
  9438. result := operand.op;
  9439. NEW(str, 64);
  9440. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9441. out[i] := result; IntermediateCode.SetString(out[i], str);
  9442. ReleaseIntermediateOperand(operand.tag);
  9443. |statement: SyntaxTree.ReturnStatement DO
  9444. NEW(str, 64);
  9445. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9446. IF currentIsInline THEN
  9447. map := currentMapper.Get(NIL);
  9448. Evaluate(map.to, operand);
  9449. out[i] := operand.op;
  9450. ELSE
  9451. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9452. END;
  9453. IntermediateCode.SetString(out[i], str);
  9454. ReleaseIntermediateOperand(operand.tag);
  9455. return := out[i];
  9456. ELSE
  9457. END;
  9458. END;
  9459. ELSE out := NIL
  9460. END;
  9461. Emit(Asm(x.position,x.sourceCode, in, out));
  9462. IF in # NIL THEN
  9463. FOR i := 0 TO LEN(in)-1 DO
  9464. ReleaseIntermediateOperand(in[i]);
  9465. END;
  9466. END;
  9467. IF out # NIL THEN
  9468. FOR i := 0 TO LEN(out)-1 DO
  9469. WITH statement: SyntaxTree.Assignment DO
  9470. ReleaseIntermediateOperand(out[i]);
  9471. ELSE
  9472. IF currentIsInline THEN
  9473. ReleaseIntermediateOperand(out[i]);
  9474. END;
  9475. END;
  9476. statement := x.outRules.GetStatement(i);
  9477. END;
  9478. END;
  9479. IF return.mode # IntermediateCode.Undefined THEN
  9480. IF currentIsInline THEN
  9481. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9482. Symbol(procedureType.returnParameter, par);
  9483. MakeMemory(mem, par.op, return.type, 0);
  9484. ReleaseOperand(par);
  9485. Emit(Mov(position, mem, return));
  9486. ReleaseIntermediateOperand(mem);
  9487. ELSE
  9488. Emit(Return(position,return));
  9489. END;
  9490. IF currentIsInline THEN RETURN END;
  9491. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9492. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9493. ReleaseIntermediateOperand(return);
  9494. END;
  9495. IF Trace THEN TraceExit("VisitCode") END;
  9496. END VisitCode;
  9497. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9498. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9499. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9500. const, call: IntermediateCode.Operand;
  9501. parameterDesignator: SyntaxTree.Expression;
  9502. saved: RegisterEntry;
  9503. name: Basic.SegmentedName;
  9504. BEGIN
  9505. IF Trace THEN TraceEnter("ParameterCopies") END;
  9506. parameter := x.firstParameter;
  9507. WHILE parameter # NIL DO
  9508. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9509. type := parameter.type.resolved;
  9510. IF IsOpenArray(type) THEN
  9511. VisitParameter(parameter);
  9512. op := result;
  9513. IF backend.cooperative & parameter.NeedsTrace() THEN
  9514. length := GetArrayLength(type, op.tag);
  9515. size := NewRegisterOperand(addressType);
  9516. base := ArrayBaseType(type);
  9517. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9518. Emit(Mul(position, size, length, const));
  9519. dst := NewRegisterOperand (addressType);
  9520. Emit(Mov(position, dst, size));
  9521. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9522. Emit(Sub(position,dst,sp,dst));
  9523. Emit(And(position,dst,dst,const));
  9524. Emit(Mov(position,sp,dst));
  9525. par := fp;
  9526. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9527. IntermediateCode.InitImmediate(null, byteType, 0);
  9528. Emit(Fill(position, dst, size, null));
  9529. ReleaseIntermediateOperand(dst);
  9530. ReleaseIntermediateOperand(length);
  9531. SaveRegisters();ReleaseUsedRegisters(saved);
  9532. (* register dst has been freed before SaveRegisters already *)
  9533. base := ArrayBaseType(type);
  9534. (* assign method of open array *)
  9535. IF base.IsRecordType() THEN
  9536. Emit (Push(position, length));
  9537. Emit (Push(position, dst));
  9538. Emit (Push(position, op.op));
  9539. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9540. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9541. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9542. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9543. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9544. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9545. Emit (Push(position,length));
  9546. Emit (Push(position, dst));
  9547. Emit (Push(position, length));
  9548. Emit (Push(position, op.op));
  9549. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9550. ELSE
  9551. Emit (Push(position, length));
  9552. Emit (Push(position, dst));
  9553. Emit (Push(position, length));
  9554. Emit (Push(position, op.op));
  9555. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9556. ASSERT(ArrayBaseType(type).IsPointer());
  9557. END;
  9558. RestoreRegisters(saved);
  9559. ELSE
  9560. temp := GetDynamicSize(type,op.tag);
  9561. ReuseCopy(size,temp);
  9562. ReleaseIntermediateOperand(temp);
  9563. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9564. Emit(Sub(position,size,sp,size));
  9565. Emit(And(position,size,size,const));
  9566. Emit(Mov(position,sp,size));
  9567. par := fp;
  9568. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9569. ReleaseIntermediateOperand(size);
  9570. size := GetDynamicSize(type,op.tag);
  9571. END;
  9572. Emit(Copy(position,sp,op.op,size));
  9573. ReleaseIntermediateOperand(size);
  9574. ReleaseOperand(op);
  9575. IntermediateCode.MakeMemory(par,addressType);
  9576. Emit(Mov(position,par,sp));
  9577. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9578. checker.SetCurrentScope(currentScope);
  9579. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9580. Assign(parameterDesignator,parameterDesignator);
  9581. END;
  9582. END;
  9583. parameter := parameter.nextParameter;
  9584. END;
  9585. IF Trace THEN TraceExit("ParameterCopies") END;
  9586. END ParameterCopies;
  9587. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9588. VAR x: SyntaxTree.Variable;
  9589. BEGIN
  9590. x := scope.firstVariable;
  9591. WHILE x # NIL DO
  9592. InitVariable(x);
  9593. x := x.nextVariable;
  9594. END;
  9595. END InitVariables;
  9596. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9597. BEGIN
  9598. IF (symbol # NIL) THEN
  9599. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9600. ELSE
  9601. RETURN 0
  9602. END;
  9603. END GetFingerprint;
  9604. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9605. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9606. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9607. saved: RegisterEntry;
  9608. BEGIN
  9609. IF Trace THEN TraceEnter("Body") END;
  9610. ReleaseUsedRegisters(saved); (* just in case ... *)
  9611. section := ir;
  9612. exitLabel := NewLabel ();
  9613. IF moduleBody THEN moduleBodySection := section END;
  9614. IF ir.comments # NIL THEN
  9615. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9616. commentPrintout.SingleStatement(TRUE);
  9617. dump := ir.comments;
  9618. ELSE
  9619. commentPrintout := NIL;
  9620. dump := NIL;
  9621. END;
  9622. prevScope := currentScope;
  9623. currentScope := scope;
  9624. lastSwitchPC := 0;
  9625. cooperativeSwitches := backend.cooperative;
  9626. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9627. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9628. IF x # NIL THEN
  9629. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9630. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9631. IF moduleBody THEN
  9632. ProfilerInit();
  9633. ELSE
  9634. Basic.SegmentedNameToString(ir.name, string);
  9635. ProfilerAddProcedure(numberProcedures,string);
  9636. ProfilerEnterExit(numberProcedures,TRUE);
  9637. END;
  9638. END;
  9639. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9640. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9641. END;
  9642. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9643. IF moduleBody THEN
  9644. InitVariables(moduleScope)
  9645. END;
  9646. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9647. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9648. IF procedure = cellScope.bodyProcedure THEN
  9649. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9650. StaticCallOperand(op, cellScope.constructor);
  9651. Emit(Call(position,op.op,0));
  9652. END;
  9653. END;
  9654. END;
  9655. ParameterCopies(procedureType);
  9656. InitVariables(scope);
  9657. IF x.code = NIL THEN
  9658. VisitStatementBlock(x);
  9659. ELSE
  9660. VisitCode(x.code)
  9661. END;
  9662. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9663. ir.SetFinally(ir.pc);
  9664. StatementSequence(x.finally)
  9665. END;
  9666. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9667. IF ~backend.cooperative THEN
  9668. ProfilerEnterExit(numberProcedures,FALSE);
  9669. END;
  9670. INC(numberProcedures);
  9671. END;
  9672. END;
  9673. IF backend.cooperative THEN
  9674. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9675. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9676. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9677. (*! not required any more? check and delete!
  9678. PushSelfPointer();
  9679. CallThis(position,"Modules","SetInitialized",1);
  9680. *)
  9681. (*
  9682. SetLabel(end);
  9683. *)
  9684. END;
  9685. IF x # NIL THEN
  9686. SELF.position := x.position;
  9687. END;
  9688. CheckRegistersFree();
  9689. ASSERT(modifyAssignmentCounter = 0);
  9690. currentScope := prevScope;
  9691. IF Trace THEN TraceExit("Body") END;
  9692. END Body;
  9693. END ImplementationVisitor;
  9694. MetaDataGenerator=OBJECT
  9695. VAR
  9696. implementationVisitor: ImplementationVisitor;
  9697. declarationVisitor: DeclarationVisitor;
  9698. module: Sections.Module;
  9699. moduleName: ARRAY 128 OF CHAR;
  9700. moduleNamePool: Basic.HashTableInt;
  9701. moduleNamePoolSection: IntermediateCode.Section;
  9702. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9703. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9704. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9705. TypeTags: LONGINT; (* type extension level support *)
  9706. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9707. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9708. BEGIN
  9709. IF implementationVisitor.backend.cooperative THEN
  9710. TypeTags := MAX(LONGINT);
  9711. BaseTypesTableOffset := 0;
  9712. MethodTableOffset := 2;
  9713. TypeRecordBaseOffset := 0;
  9714. ELSIF simple THEN
  9715. TypeTags := 3; (* only 3 extensions allowed *)
  9716. BaseTypesTableOffset := 1;
  9717. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9718. TypeRecordBaseOffset := 0;
  9719. ELSE
  9720. TypeTags := 16;
  9721. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9722. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9723. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9724. END;
  9725. SELF.simple := simple;
  9726. SELF.implementationVisitor := implementationVisitor;
  9727. SELF.declarationVisitor := declarationVisitor;
  9728. implementationVisitor.meta := SELF;
  9729. declarationVisitor.meta := SELF;
  9730. END InitMetaDataGenerator;
  9731. PROCEDURE SetModule(module: Sections.Module);
  9732. VAR namePoolOffset: LONGINT;
  9733. BEGIN
  9734. SELF.module := module;
  9735. Global.GetModuleName(module.module,moduleName);
  9736. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9737. NEW(moduleNamePool, 32);
  9738. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9739. END;
  9740. END SetModule;
  9741. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9742. BEGIN
  9743. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9744. END GetTypeRecordBaseOffset;
  9745. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9746. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9747. BEGIN
  9748. INC(dataAdrOffset,6);
  9749. Info(section,"headerAdr");
  9750. Address(section,0);
  9751. Info(section,"typeDesc");
  9752. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9753. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9754. NamedSymbol(section, name, symbol, 0, offset);
  9755. Info(section,"mark: LONGINT;");
  9756. Longint(section,-1);
  9757. Info(section,"dataAdr-: ADDRESS");
  9758. Symbol(section,section, dataAdrOffset,0);
  9759. Info(section,"size-: SIZE");
  9760. Address(section,0);
  9761. Info(section,"nextRealtime: HeapBlock;");
  9762. Address(section,0);
  9763. END HeapBlock;
  9764. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9765. VAR i: LONGINT;
  9766. BEGIN
  9767. INC(dataAdrOffset,14);
  9768. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9769. Info(section,"count*: LONGINT");
  9770. Longint(section,0);
  9771. Info(section,"locked*: BOOLEAN");
  9772. Longint(section,0);
  9773. Info(section,"awaitingLock*: ProcessQueue");
  9774. Address(section,0);
  9775. Address(section,0);
  9776. Info(section,"awaitingCond*: ProcessQueue");
  9777. Address(section,0);
  9778. Address(section,0);
  9779. Info(section,"lockedBy*: ANY");
  9780. Address(section,0);
  9781. Info(section,"lock*: ANY");
  9782. Address(section,0);
  9783. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9784. Longint(section,1);
  9785. FOR i := 2 TO 6 DO
  9786. Longint(section,0);
  9787. END;
  9788. END ProtectedHeapBlock;
  9789. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9790. BEGIN
  9791. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9792. END Info;
  9793. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9794. VAR op: IntermediateCode.Operand;
  9795. BEGIN
  9796. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9797. section.Emit(Data(-11,op));
  9798. END Address;
  9799. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9800. VAR op: IntermediateCode.Operand;
  9801. BEGIN
  9802. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9803. section.Emit(Data(-12,op));
  9804. END Size;
  9805. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9806. VAR op: IntermediateCode.Operand;
  9807. BEGIN
  9808. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9809. section.Emit(Data(-1,op));
  9810. END Set;
  9811. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9812. VAR op: IntermediateCode.Operand;
  9813. BEGIN
  9814. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9815. section.Emit(Data(-1,op));
  9816. END Longint;
  9817. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9818. VAR op,noOperand: IntermediateCode.Operand;
  9819. BEGIN
  9820. IntermediateCode.InitOperand(noOperand);
  9821. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9822. section.PatchOperands(pc,op,noOperand,noOperand);
  9823. END PatchLongint;
  9824. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9825. VAR op, noOperand: IntermediateCode.Operand;
  9826. BEGIN
  9827. IntermediateCode.InitOperand(noOperand);
  9828. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9829. section.PatchOperands(pc,op,noOperand,noOperand);
  9830. END PatchSymbol;
  9831. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9832. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9833. BEGIN
  9834. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9835. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9836. section.Emit(Data(-1,op));
  9837. END Boolean;
  9838. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9839. VAR op: IntermediateCode.Operand;
  9840. BEGIN
  9841. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9842. section.Emit(Data(-1,op));
  9843. END Char;
  9844. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9845. VAR i: LONGINT;
  9846. BEGIN
  9847. Info(section,str);
  9848. i := 0;
  9849. WHILE(str[i] # 0X) DO
  9850. Char(section,str[i]);
  9851. INC(i);
  9852. END;
  9853. Char(section,0X);
  9854. END String;
  9855. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9856. VAR op: IntermediateCode.Operand;
  9857. BEGIN
  9858. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9859. IntermediateCode.SetOffset(op,realOffset);
  9860. section.Emit(Data(-1,op));
  9861. END NamedSymbol;
  9862. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9863. BEGIN
  9864. IF symbol= NIL THEN
  9865. Address( section, realOffset);
  9866. ASSERT(virtualOffset = 0);
  9867. ELSE
  9868. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9869. END;
  9870. END Symbol;
  9871. (* OutPointers delivers
  9872. {pointerOffset}
  9873. *)
  9874. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9875. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9876. BEGIN
  9877. type := type.resolved;
  9878. IF type IS SyntaxTree.AnyType THEN
  9879. Symbol(section, symbol, 0, (offset ));
  9880. INC(numberPointers);
  9881. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9882. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9883. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9884. ELSIF type IS SyntaxTree.PointerType THEN
  9885. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9886. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9887. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9888. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9889. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9890. ELSIF (type IS SyntaxTree.RecordType) THEN
  9891. (* never treat a record like a pointer, even if the pointer field is set! *)
  9892. WITH type: SyntaxTree.RecordType DO
  9893. base := type.GetBaseRecord();
  9894. IF base # NIL THEN
  9895. Pointers(offset,symbol,section, base,numberPointers);
  9896. END;
  9897. variable := type.recordScope.firstVariable;
  9898. WHILE(variable # NIL) DO
  9899. IF ~(variable.untraced) THEN
  9900. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9901. END;
  9902. variable := variable.nextVariable;
  9903. END;
  9904. END;
  9905. ELSIF (type IS SyntaxTree.CellType) THEN
  9906. WITH type: SyntaxTree.CellType DO
  9907. base := type.GetBaseRecord();
  9908. IF base # NIL THEN
  9909. Pointers(offset,symbol,section, base,numberPointers);
  9910. END;
  9911. variable := type.cellScope.firstVariable;
  9912. WHILE(variable # NIL) DO
  9913. IF ~(variable.untraced) THEN
  9914. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9915. END;
  9916. variable := variable.nextVariable;
  9917. END;
  9918. END;
  9919. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9920. WITH type: SyntaxTree.ArrayType DO
  9921. IF type.form= SyntaxTree.Static THEN
  9922. n := type.staticLength;
  9923. base := type.arrayBase.resolved;
  9924. WHILE(base IS SyntaxTree.ArrayType) DO
  9925. type := base(SyntaxTree.ArrayType);
  9926. n := n* type.staticLength;
  9927. base := type.arrayBase.resolved;
  9928. END;
  9929. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9930. IF SemanticChecker.ContainsPointer(base) THEN
  9931. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9932. FOR i := 0 TO n-1 DO
  9933. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9934. END;
  9935. END;
  9936. ELSE
  9937. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9938. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9939. END;
  9940. END;
  9941. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9942. WITH type: SyntaxTree.MathArrayType DO
  9943. IF type.form = SyntaxTree.Static THEN
  9944. n := type.staticLength;
  9945. base := type.arrayBase.resolved;
  9946. WHILE(base IS SyntaxTree.MathArrayType) DO
  9947. type := base(SyntaxTree.MathArrayType);
  9948. n := n* type.staticLength;
  9949. base := type.arrayBase.resolved;
  9950. END;
  9951. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9952. IF SemanticChecker.ContainsPointer(base) THEN
  9953. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9954. FOR i := 0 TO n-1 DO
  9955. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9956. END;
  9957. END;
  9958. ELSE
  9959. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9960. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9961. END
  9962. END;
  9963. (* ELSE no pointers in type *)
  9964. END;
  9965. END Pointers;
  9966. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  9967. VAR position,i: LONGINT; ch: CHAR;
  9968. BEGIN
  9969. IF pool.Has(index) THEN
  9970. RETURN pool.GetInt(index)
  9971. ELSE
  9972. position := source.pc;
  9973. pool.PutInt(index, position);
  9974. Info(source, name);
  9975. i := 0;
  9976. REPEAT
  9977. ch := name[i]; INC(i);
  9978. Char( source, ch);
  9979. UNTIL ch = 0X;
  9980. END;
  9981. RETURN position;
  9982. END EnterDynamicName;
  9983. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9984. VAR name: Basic.SectionName; i: LONGINT; ch: CHAR; position: LONGINT;
  9985. BEGIN
  9986. IF pool.Has(index) THEN
  9987. RETURN pool.GetInt(index)
  9988. ELSE
  9989. StringPool.GetString(index, name);
  9990. position := EnterDynamicName(source,name,index, pool);
  9991. END;
  9992. RETURN position;
  9993. END DynamicName;
  9994. PROCEDURE DynamicNameS(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; pool: Basic.HashTableInt): LONGINT;
  9995. BEGIN
  9996. RETURN EnterDynamicName(source, name, StringPool.GetIndex1(name), pool)
  9997. END DynamicNameS;
  9998. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9999. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10000. BEGIN
  10001. COPY(moduleName,name);
  10002. Strings.Append(name,suffix);
  10003. Basic.ToSegmentedName(name, pooledName);
  10004. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10005. IF implementationVisitor.backend.cooperative THEN
  10006. Info(section, "TypeDescriptor");
  10007. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10008. NamedSymbol(section, pooledName,NIL, 0, 0);
  10009. BasePointer(section);
  10010. offset := 0;
  10011. ELSE
  10012. HeapBlock(mName,typeName,section,2);
  10013. Info(section, "HeapBlock");
  10014. (*
  10015. Symbol(section,section,2,0);
  10016. *)
  10017. Address(section,0); (* empty such that GC does not go on traversing *)
  10018. Info(section, "TypeDescriptor");
  10019. Address(section,0);
  10020. offset := section.pc;
  10021. END;
  10022. RETURN section
  10023. END Block;
  10024. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10025. VAR name: Basic.SegmentedName;
  10026. BEGIN
  10027. Info(source,"ArrayHeader");
  10028. IF implementationVisitor.backend.cooperative THEN
  10029. sizePC := source.pc;
  10030. Address(source,0);
  10031. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10032. IF baseType # "" THEN
  10033. Basic.ToSegmentedName(baseType, name);
  10034. NamedSymbol(source, name,NIL, 0, 0);
  10035. ELSE
  10036. Address(source,0);
  10037. END;
  10038. Address(source,0);
  10039. ELSE
  10040. Address(source,0);
  10041. Address(source,0);
  10042. Address(source,0);
  10043. sizePC := source.pc;
  10044. Address(source,0);
  10045. Info(source,"array data");
  10046. END;
  10047. END Array;
  10048. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10049. BEGIN
  10050. IF implementationVisitor.backend.cooperative THEN
  10051. PatchLongint(section, pc, size);
  10052. PatchLongint(section, pc + 3, size);
  10053. ELSE
  10054. PatchLongint(section, pc, size);
  10055. END;
  10056. END PatchArray;
  10057. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10058. VAR
  10059. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10060. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10061. poolMap: Basic.HashTableInt;
  10062. namePool: IntermediateCode.Section;
  10063. namePoolOffset: LONGINT;
  10064. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10065. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10066. BEGIN
  10067. Basic.SegmentedNameToString(s1.name,n1);
  10068. Basic.SegmentedNameToString(s2.name,n2);
  10069. index := 0;
  10070. ch1 := n1[index];
  10071. ch2 := n2[index];
  10072. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10073. INC(index);
  10074. ch1 := n1[index];
  10075. ch2 := n2[index];
  10076. END;
  10077. RETURN ch1 < ch2;
  10078. END Compare;
  10079. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10080. VAR
  10081. i, j: LONGINT;
  10082. x, t: Sections.Section;
  10083. BEGIN
  10084. IF lo < hi THEN
  10085. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10086. WHILE i <= j DO
  10087. WHILE Compare(list[i], x) DO INC(i) END;
  10088. WHILE Compare(x, list[j]) DO DEC(j) END;
  10089. IF i <= j THEN
  10090. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10091. INC(i); DEC(j)
  10092. END
  10093. END;
  10094. IF lo < j THEN QuickSort(list, lo, j) END;
  10095. IF i < hi THEN QuickSort(list, i, hi) END
  10096. END;
  10097. END QuickSort;
  10098. (*
  10099. ExportDesc* = RECORD
  10100. fp*: ADDRESS;
  10101. name* {UNTRACED}: DynamicName;
  10102. adr*: ADDRESS;
  10103. exports*: LONGINT;
  10104. dsc* {UNTRACED}: ExportArray
  10105. END;
  10106. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10107. *)
  10108. PROCEDURE ExportDesc2(
  10109. source: IntermediateCode.Section;
  10110. namePool: IntermediateCode.Section;
  10111. fingerPrinter: FingerPrinter.FingerPrinter;
  10112. symbol: Sections.Section;
  10113. name: StringPool.Index;
  10114. VAR patchAdr: LONGINT
  10115. ): BOOLEAN;
  10116. VAR fingerPrint: SyntaxTree.FingerPrint;
  10117. BEGIN
  10118. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10119. & (symbol.type # Sections.InlineCodeSection)
  10120. THEN
  10121. *)
  10122. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10123. & (symbol.type # Sections.InlineCodeSection))
  10124. THEN
  10125. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10126. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10127. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10128. Longint(source,fingerPrint.shallow);
  10129. ELSE
  10130. Longint(source, 0);
  10131. END;
  10132. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10133. Symbol(source, symbol,0,0);
  10134. patchAdr := source.pc;
  10135. Address(source,0);
  10136. Address(source,0);
  10137. END;
  10138. RETURN TRUE
  10139. ELSE
  10140. RETURN FALSE
  10141. END;
  10142. END ExportDesc2;
  10143. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10144. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10145. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10146. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10147. TYPE
  10148. Scope = RECORD
  10149. elements: LONGINT;
  10150. gelements: LONGINT;
  10151. section: IntermediateCode.Section;
  10152. patchAdr: LONGINT;
  10153. arraySizePC: LONGINT;
  10154. beginPC: LONGINT; (* current scope start pc *)
  10155. END;
  10156. BEGIN
  10157. Basic.InitSegmentedName(prev);
  10158. olevel := -1;
  10159. scopes[0].section := source;
  10160. FOR s := 0 TO LEN(sections)-1 DO
  10161. symbol := sections[s];
  10162. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10163. this := sections[s].name;
  10164. level := 0;
  10165. WHILE (this[level] > 0) DO
  10166. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10167. INC(level);
  10168. END;
  10169. WHILE level < olevel DO
  10170. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10171. IF olevel > 0 THEN
  10172. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10173. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10174. END;
  10175. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10176. DEC(olevel);
  10177. END;
  10178. IF (this[level] > 0) THEN
  10179. IF level > olevel THEN
  10180. (*TRACE("opening",level); *)
  10181. IF scopes[level].section = NIL THEN
  10182. arrayName := ".@ExportArray";
  10183. Strings.AppendInt(arrayName, level);
  10184. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10185. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10186. END;
  10187. scopes[level].beginPC := scopes[level].section.pc;
  10188. olevel := level;
  10189. scopes[olevel].elements := 0;
  10190. END;
  10191. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10192. sym := sections[s];
  10193. ELSE
  10194. sym := NIL;
  10195. END;
  10196. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10197. THEN
  10198. INC(scopes[olevel].elements);
  10199. END;
  10200. (*StringPool.GetString(this[level], name);*)
  10201. (*TRACE(level, name);*)
  10202. (* enter string in scope *)
  10203. INC(level);
  10204. END;
  10205. END;
  10206. Basic.SegmentedNameToString(this, name);
  10207. (*TRACE(level, "enter", name);*)
  10208. prev := this;
  10209. END;
  10210. END;
  10211. WHILE 0 <= olevel DO
  10212. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10213. IF olevel > 0 THEN
  10214. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10215. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10216. END;
  10217. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10218. DEC(olevel);
  10219. END;
  10220. level := 0;
  10221. WHILE (level < LEN(scopes)) DO
  10222. IF scopes[level].section # NIL THEN
  10223. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10224. END;
  10225. INC(level);
  10226. END;
  10227. END Export;
  10228. BEGIN
  10229. NEW(fingerPrinter, module.system);
  10230. NEW(poolMap, 64);
  10231. (* 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 *)
  10232. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10233. NEW(sectionArray, module.allSections.Length());
  10234. FOR i := 0 TO module.allSections.Length() - 1 DO
  10235. section := module.allSections.GetSection(i);
  10236. sectionArray[i] := section;
  10237. END;
  10238. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10239. Export(sectionArray^);
  10240. END ExportDesc;
  10241. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10242. VAR
  10243. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10244. BEGIN
  10245. Info(source, "exception table offsets array descriptor");
  10246. size := 0;
  10247. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10248. Info(source, "exception table content");
  10249. FOR i := 0 TO module.allSections.Length() - 1 DO
  10250. p := module.allSections.GetSection(i);
  10251. IF p.type = Sections.CodeSection THEN
  10252. finallyPC := p(IntermediateCode.Section).finally;
  10253. IF finallyPC>=0 THEN
  10254. Symbol( source, p, 0,0);
  10255. Symbol( source, p, finallyPC, 0);
  10256. Symbol( source, p, finallyPC,0);
  10257. INC(size);
  10258. END;
  10259. END
  10260. END;
  10261. PatchArray(source,sizePC,size);
  10262. END ExceptionArray;
  10263. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10264. VAR i: LONGINT; ch: CHAR;
  10265. BEGIN
  10266. i := 0;
  10267. REPEAT
  10268. ch := name[i]; INC(i);
  10269. Char( section, ch);
  10270. UNTIL ch = 0X;
  10271. WHILE i < 32 DO
  10272. Char( section, 0X); INC(i);
  10273. END;
  10274. END Name;
  10275. PROCEDURE LongName(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10276. VAR i: LONGINT; ch: CHAR;
  10277. BEGIN
  10278. i := 0;
  10279. REPEAT
  10280. ch := name[i]; INC(i);
  10281. Char( section, ch);
  10282. UNTIL ch = 0X;
  10283. ASSERT(i < LongNameLength);
  10284. WHILE i < 64 DO
  10285. Char( section, 0X); INC(i);
  10286. END;
  10287. END LongName;
  10288. PROCEDURE References(section: IntermediateCode.Section);
  10289. CONST
  10290. rfDirect = 1X; rfIndirect = 3X;
  10291. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10292. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10293. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10294. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10295. rfRecordPointer=1DX;
  10296. rfArrayFlag = 80X;
  10297. VAR
  10298. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10299. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10300. VAR char: CHAR;
  10301. BEGIN
  10302. IF type = NIL THEN char := rfLongint
  10303. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10304. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10305. ELSIF type IS SyntaxTree.CharacterType THEN
  10306. IF type.sizeInBits = 8 THEN char := rfChar8
  10307. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10308. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10309. END;
  10310. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10311. IF type.sizeInBits = 8 THEN char := rfShortint
  10312. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10313. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10314. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10315. END;
  10316. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10317. ELSIF type IS SyntaxTree.FloatType THEN
  10318. IF type.sizeInBits = 32 THEN char := rfReal
  10319. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10320. END;
  10321. ELSIF type IS SyntaxTree.ComplexType THEN
  10322. IF type.sizeInBits = 64 THEN char := rfComplex
  10323. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10324. END;
  10325. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10326. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10327. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10328. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10329. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10330. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10331. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10332. END;
  10333. RETURN char
  10334. END BaseType;
  10335. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10336. VAR destination: Sections.Section; name: SyntaxTree.IdentifierString; sname: Basic.SegmentedName;
  10337. BEGIN
  10338. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10339. IF type.pointerType # NIL THEN
  10340. Char(section,rfRecordPointer)
  10341. ELSE
  10342. Char(section,rfRecord);
  10343. END;
  10344. IF destination = NIL THEN
  10345. Longint(section,0);
  10346. ELSE
  10347. Longint(section,destination.offset); (* used for ? *)
  10348. END;
  10349. END RecordType;
  10350. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10351. BEGIN
  10352. baseType := type.arrayBase.resolved;
  10353. IF type.form = SyntaxTree.Static THEN
  10354. IF baseType IS SyntaxTree.ArrayType THEN
  10355. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10356. ELSE
  10357. RETURN type.staticLength
  10358. END
  10359. ELSE
  10360. RETURN 0
  10361. END;
  10362. END StaticArrayLength;
  10363. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10364. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10365. BEGIN
  10366. length := StaticArrayLength(type, baseType);
  10367. char := BaseType(baseType);
  10368. IF type.form # SyntaxTree.Open THEN
  10369. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10370. Longint(section, length)
  10371. ELSE
  10372. length :=0;
  10373. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10374. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10375. Longint(section, length)
  10376. END;
  10377. END ArrayType;
  10378. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10379. BEGIN
  10380. baseType := type.arrayBase;
  10381. IF baseType # NIL THEN
  10382. baseType := baseType.resolved;
  10383. END;
  10384. IF type.form = SyntaxTree.Static THEN
  10385. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10386. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10387. ELSE
  10388. RETURN type.staticLength
  10389. END
  10390. ELSE
  10391. RETURN 0
  10392. END;
  10393. END StaticMathArrayLength;
  10394. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10395. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10396. BEGIN
  10397. length := StaticMathArrayLength(type, baseType);
  10398. char := BaseType(baseType);
  10399. IF type.form = SyntaxTree.Open THEN
  10400. char := BaseType(module.system.addressType);
  10401. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10402. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10403. Longint(section, length)
  10404. ELSIF type.form=SyntaxTree.Tensor THEN
  10405. char := BaseType(module.system.addressType);
  10406. Char(section, CHR(ORD(char)));
  10407. ELSE
  10408. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10409. Longint(section, length)
  10410. END;
  10411. END MathArrayType;
  10412. PROCEDURE Type(type: SyntaxTree.Type);
  10413. BEGIN
  10414. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10415. IF type IS SyntaxTree.BasicType THEN
  10416. Char(section, BaseType(type));
  10417. ELSIF type IS SyntaxTree.RecordType THEN
  10418. RecordType(type(SyntaxTree.RecordType));
  10419. ELSIF type IS SyntaxTree.ArrayType THEN
  10420. ArrayType(type(SyntaxTree.ArrayType))
  10421. ELSIF type IS SyntaxTree.EnumerationType THEN
  10422. Char(section, BaseType(module.system.longintType))
  10423. ELSIF type IS SyntaxTree.PointerType THEN
  10424. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10425. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10426. ELSE
  10427. Char(section, BaseType(type))
  10428. END;
  10429. ELSIF type IS SyntaxTree.ProcedureType THEN
  10430. Char(section, BaseType(type));
  10431. ELSIF type IS SyntaxTree.MathArrayType THEN
  10432. MathArrayType(type(SyntaxTree.MathArrayType));
  10433. ELSIF type IS SyntaxTree.CellType THEN
  10434. Char(section, BaseType(module.system.anyType));
  10435. ELSE HALT(200)
  10436. END;
  10437. END Type;
  10438. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10439. VAR name: ARRAY 256 OF CHAR;
  10440. BEGIN
  10441. IF variable.externalName # NIL THEN RETURN END;
  10442. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10443. variable.GetName(name);
  10444. Type(variable.type);
  10445. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10446. String(section,name);
  10447. END WriteVariable;
  10448. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10449. VAR name: ARRAY 256 OF CHAR;
  10450. BEGIN
  10451. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10452. variable.GetName(name);
  10453. Type(variable.type);
  10454. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10455. variable.GetName(name);
  10456. String(section,name);
  10457. END WriteParameter;
  10458. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10459. BEGIN
  10460. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10461. IF type IS SyntaxTree.ArrayType THEN
  10462. WITH type: SyntaxTree.ArrayType DO
  10463. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10464. ELSE Char(section,rfOpenArray)
  10465. END;
  10466. END
  10467. ELSIF type IS SyntaxTree.MathArrayType THEN
  10468. WITH type: SyntaxTree.MathArrayType DO
  10469. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10470. ELSE Char(section,rfOpenArray)
  10471. END;
  10472. END
  10473. ELSIF type IS SyntaxTree.RecordType THEN
  10474. Char(section,rfRecord);
  10475. ELSE
  10476. Char(section, BaseType(type));
  10477. END;
  10478. END ReturnType;
  10479. PROCEDURE Procedure(s: Sections.Section);
  10480. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10481. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10482. name: ARRAY 256 OF CHAR;
  10483. BEGIN
  10484. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10485. (*procedure.name,name);*)
  10486. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10487. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10488. Char(section,0F9X);
  10489. Symbol(section,s,0,0);
  10490. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10491. Longint(section,procedureType.numberParameters);
  10492. ReturnType(procedureType.returnType);
  10493. Longint(section,0); (*! level *)
  10494. Longint(section,0);
  10495. (*
  10496. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10497. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10498. recordName := "";
  10499. IF record.pointerType # NIL THEN
  10500. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10501. ELSE
  10502. DeclarationName(record.typeDeclaration,recordName);
  10503. END;
  10504. i := 0;
  10505. Info(section,recordName);
  10506. WHILE recordName[i] # 0X DO
  10507. Char(section,recordName[i]); INC(i);
  10508. INC(size);
  10509. END;
  10510. Char(section,".");
  10511. INC(size);
  10512. END;
  10513. *)
  10514. String(section,name);
  10515. parameter := procedureType.firstParameter;
  10516. WHILE(parameter # NIL) DO
  10517. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10518. parameter := parameter.nextParameter;
  10519. END;
  10520. variable := procedure.procedureScope.firstVariable;
  10521. WHILE(variable # NIL) DO
  10522. WriteVariable(variable,FALSE);
  10523. variable := variable.nextVariable;
  10524. END;
  10525. END Procedure;
  10526. PROCEDURE Scope(s: Sections.Section);
  10527. BEGIN
  10528. Char(section,0F8X);
  10529. Symbol(section,s,0,0); (* start *)
  10530. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10531. String(section,"$$");
  10532. (* removed variables -- wrongly interpreted by Reflection
  10533. variable := module.module.moduleScope.firstVariable;
  10534. WHILE(variable # NIL) DO
  10535. WriteVariable(variable,FALSE);
  10536. variable := variable.nextVariable;
  10537. END;
  10538. *)
  10539. END Scope;
  10540. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10541. VAR result, i: LONGINT;
  10542. BEGIN
  10543. FOR i := startPC TO endPC -1 DO
  10544. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10545. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10546. END;
  10547. RETURN result;
  10548. END ComputeSize;
  10549. BEGIN
  10550. Array(section,sizePC,"");
  10551. startPC := section.pc;
  10552. Char(section,0FFX); (* sign for trap writer *)
  10553. FOR i := 0 TO module.allSections.Length() - 1 DO
  10554. s := module.allSections.GetSection(i);
  10555. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10556. Scope(s) (*! must be first procedure in ref section *)
  10557. END
  10558. END;
  10559. FOR i := 0 TO module.allSections.Length() - 1 DO
  10560. s := module.allSections.GetSection(i);
  10561. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10562. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10563. Procedure(s)
  10564. END
  10565. END;
  10566. endPC := section.pc;
  10567. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10568. END References;
  10569. (*
  10570. Command* = RECORD
  10571. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10572. name*: Name; (* name of the procedure *)
  10573. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10574. entryAdr* : ADDRESS; (* entry address of procedure *)
  10575. END;
  10576. *)
  10577. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10578. VAR
  10579. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10580. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10581. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10582. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10583. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10584. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10585. BEGIN
  10586. RETURN
  10587. (type = NIL) OR
  10588. (type.resolved IS SyntaxTree.RecordType) OR
  10589. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10590. (type.resolved IS SyntaxTree.AnyType);
  10591. END TypeAllowed;
  10592. BEGIN
  10593. numberParameters := procedureType.numberParameters;
  10594. RETURN
  10595. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10596. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10597. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10598. END GetProcedureAllowed;
  10599. PROCEDURE WriteType(type : SyntaxTree.Type);
  10600. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10601. name: Basic.SegmentedName; offset: LONGINT;
  10602. BEGIN
  10603. IF type = NIL THEN
  10604. Address(source,0);
  10605. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10606. Address(source,1);
  10607. ELSE
  10608. type := type.resolved;
  10609. IF type IS SyntaxTree.PointerType THEN
  10610. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10611. END;
  10612. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10613. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10614. name[0] := typeDeclaration.name; name[1] := -1;
  10615. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10616. ASSERT(section # NIL);
  10617. ELSE
  10618. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10619. (* TODO *)
  10620. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10621. END;
  10622. IF implementationVisitor.backend.cooperative THEN
  10623. offset := 0;
  10624. ELSE
  10625. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10626. END;
  10627. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10628. END;
  10629. END WriteType;
  10630. BEGIN
  10631. Info(source, "command array descriptor");
  10632. Array(source,sizePC,"Modules.Command");
  10633. numberCommands := 0;
  10634. Info(source, "command array content");
  10635. FOR i := 0 TO module.allSections.Length() - 1 DO
  10636. p := module.allSections.GetSection(i);
  10637. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10638. procedure := p.symbol(SyntaxTree.Procedure);
  10639. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10640. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10641. procedure.GetName(name);
  10642. Name(source,name);
  10643. numberParameters := procedureType.numberParameters;
  10644. (* offset of type of first parameter *)
  10645. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10646. ELSE WriteType(procedureType.firstParameter.type)
  10647. END;
  10648. (* offset of type of return parameter *)
  10649. WriteType(procedureType.returnType);
  10650. (* command name *)
  10651. (* command code offset *)
  10652. Symbol(source,p,0,0);
  10653. INC(numberCommands);
  10654. IF Trace THEN
  10655. D.Ln;
  10656. END;
  10657. END;
  10658. END
  10659. END;
  10660. PatchArray(source,sizePC,numberCommands);
  10661. END CommandArray;
  10662. (* to prevent from double import of different module aliases *)
  10663. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10664. VAR i: SyntaxTree.Import;
  10665. BEGIN
  10666. i := module.module.moduleScope.firstImport;
  10667. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10668. i := i.nextImport;
  10669. END;
  10670. RETURN i = import
  10671. END IsFirstDirectOccurence;
  10672. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10673. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10674. BEGIN
  10675. Array(source,pc,"");
  10676. Info(source, "import module array data");
  10677. IF implementationVisitor.backend.cooperative THEN
  10678. offset := 0;
  10679. ELSE
  10680. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10681. END;
  10682. import := module.module.moduleScope.firstImport;
  10683. numberImports := 0;
  10684. WHILE import # NIL DO
  10685. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10686. Global.GetModuleSegmentedName(import.module,name);
  10687. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10688. NamedSymbol(source, name, NIL, 0, offset);
  10689. INC(numberImports);
  10690. END;
  10691. import := import.nextImport
  10692. END;
  10693. PatchArray(source,pc,numberImports);
  10694. END ImportsArray;
  10695. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10696. VAR
  10697. p: Sections.Section; sizePC, size, i: LONGINT;
  10698. BEGIN
  10699. Info(source, "Type info section");
  10700. size := 0;
  10701. Array(source,sizePC,"Modules.TypeDesc");
  10702. FOR i := 0 TO module.allSections.Length() - 1 DO
  10703. p := module.allSections.GetSection(i);
  10704. WITH p: IntermediateCode.Section DO
  10705. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10706. Symbol(source,p,0,0);
  10707. INC(size);
  10708. END;
  10709. END
  10710. END;
  10711. PatchArray(source,sizePC,size);
  10712. END TypeInfoSection;
  10713. (*
  10714. ProcTableEntry* = RECORD
  10715. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10716. noPtr*: LONGINT;
  10717. END;
  10718. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10719. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10720. *)
  10721. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10722. VAR
  10723. destination: Sections.Section;
  10724. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10725. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10726. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10727. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10728. BEGIN
  10729. Info(procArray,"pcFrom");
  10730. Symbol(procArray,destination,0,0);
  10731. Info(procArray,"pcTo");
  10732. Symbol(procArray,destination,destination.pc,0);
  10733. Info(procArray,"pcStatementBegin");
  10734. Symbol(procArray,destination,destination.validPAFEnter,0);
  10735. Info(procArray,"pcStatementEnd");
  10736. Symbol(procArray,destination,destination.validPAFExit,0);
  10737. IF ~implementationVisitor.backend.cooperative THEN
  10738. Basic.SegmentedNameToString(destination.name, string);
  10739. Info(pointerArray,string);
  10740. procedure := destination.symbol(SyntaxTree.Procedure);
  10741. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10742. variable := procedure.procedureScope.firstVariable;
  10743. WHILE(variable # NIL) DO
  10744. IF ~(variable.untraced) THEN
  10745. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10746. END;
  10747. variable := variable.nextVariable
  10748. END;
  10749. parameter := procedureType.firstParameter;
  10750. WHILE(parameter # NIL) DO
  10751. IF ~(parameter.untraced) THEN
  10752. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10753. END;
  10754. parameter := parameter.nextParameter;
  10755. END;
  10756. END;
  10757. Info(procArray,"numberPointers");
  10758. Longint(procArray,numberPointers);
  10759. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10760. INC(pointerArraySize, numberPointers);
  10761. END PointerOffsets;
  10762. BEGIN
  10763. maxPointers := 0;
  10764. Info(procArray, "proc array descriptor");
  10765. Address(procArray,0);
  10766. Address(procArray,0);
  10767. Address(procArray,0);
  10768. procArraySizePC := procArray.pc;
  10769. Address(procArray,0);
  10770. procArraySize := 0;
  10771. IF ~implementationVisitor.backend.cooperative THEN
  10772. Info(pointerArray, "pointer array descriptor");
  10773. Address(pointerArray,0);
  10774. Address(pointerArray,0);
  10775. Address(pointerArray,0);
  10776. pointerArraySizePC := pointerArray.pc;
  10777. Address(pointerArray,0);
  10778. pointerArraySize := 0;
  10779. END;
  10780. procArraySize := 0;
  10781. FOR i := 0 TO module.allSections.Length() - 1 DO
  10782. destination := module.allSections.GetSection(i);
  10783. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10784. PointerOffsets(destination(IntermediateCode.Section));
  10785. INC(procArraySize);
  10786. END
  10787. END;
  10788. PatchLongint(procArray,procArraySizePC,procArraySize);
  10789. IF ~implementationVisitor.backend.cooperative THEN
  10790. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10791. END;
  10792. END PointersInProcTables;
  10793. (*
  10794. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10795. VAR
  10796. next*: Module; (** once a module is published, all fields are read-only *)
  10797. name*: Name;
  10798. init, published: BOOLEAN;
  10799. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10800. sb*: ADDRESS; <- set to beginning of data section by loader
  10801. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10802. command*: POINTER TO ARRAY OF Command;
  10803. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10804. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10805. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10806. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10807. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10808. data*, code*: Bytes;
  10809. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10810. export*: ExportDesc;
  10811. term*: TerminationHandler;
  10812. exTable*: ExceptionTable;
  10813. noProcs*: LONGINT;
  10814. firstProc*: ADDRESS; <- done by loader
  10815. maxPtrs*: LONGINT;
  10816. crc*: LONGINT;
  10817. *)
  10818. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10819. BEGIN
  10820. Info(section, "cycle");
  10821. Size(section,0);
  10822. Info(section, "references");
  10823. Size(section,0);
  10824. Info(section, "nextMarked");
  10825. Address(section,0);
  10826. Info(section, "nextWatched");
  10827. Address(section,0);
  10828. END BasePointer;
  10829. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10830. BEGIN
  10831. BasePointer(section);
  10832. Info(section, "action");
  10833. Address(section,0);
  10834. Info(section, "monitor");
  10835. Address(section,0);
  10836. END BaseObject;
  10837. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10838. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10839. pooledName: Basic.SegmentedName;
  10840. symbol: SyntaxTree.Symbol;
  10841. BEGIN
  10842. Global.GetModuleName(module.module,name);
  10843. Strings.Append(name,".@Module.@Descriptor");
  10844. Basic.ToSegmentedName(name, pooledName);
  10845. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10846. Symbol(section,descriptorSection,0,0);
  10847. Info(descriptorSection, "descriptor");
  10848. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10849. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10850. Address(descriptorSection,0);
  10851. Global.GetModuleName(module.module,name);
  10852. Strings.Append(name,".@Trace");
  10853. Basic.ToSegmentedName(name, pooledName);
  10854. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10855. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10856. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10857. END ModuleDescriptor;
  10858. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10859. VAR name: ARRAY 128 OF CHAR;
  10860. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10861. symbol: SyntaxTree.Symbol;
  10862. BEGIN
  10863. Global.GetModuleName(module.module,name);
  10864. Strings.Append(name,".@Module");
  10865. Basic.ToSegmentedName(name, pooledName);
  10866. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10867. moduleSection.SetExported(TRUE);
  10868. IF moduleSection.pc = 0 THEN
  10869. IF implementationVisitor.backend.cooperative THEN
  10870. Info(moduleSection, "descriptor");
  10871. ModuleDescriptor(moduleSection);
  10872. BaseObject(moduleSection);
  10873. implementationVisitor.CreateTraceModuleMethod(module.module);
  10874. ELSE
  10875. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10876. Info(moduleSection, "HeapBlock");
  10877. Symbol(moduleSection,moduleSection,2,0);
  10878. Info(moduleSection, "TypeDescriptor");
  10879. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10880. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10881. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10882. END;
  10883. END;
  10884. RETURN moduleSection;
  10885. END ModuleSection;
  10886. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10887. VAR
  10888. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10889. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10890. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10891. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10892. referenceSectionOffset : LONGINT;
  10893. BEGIN
  10894. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10895. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10896. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10897. ImportsArray(importSection);
  10898. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10899. CommandArray(commandsSection);
  10900. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10901. ExceptionArray(exceptionSection);
  10902. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10903. TypeInfoSection(typeInfoSection);
  10904. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10905. References(referenceSection);
  10906. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10907. IF ~implementationVisitor.backend.cooperative THEN
  10908. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10909. ELSE
  10910. ptrTableSection := NIL;
  10911. END;
  10912. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10913. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10914. Array(emptyArraySection,temp,"");
  10915. moduleSection := ModuleSection();
  10916. Info(moduleSection, "nextRoot*: RootObject");
  10917. Address(moduleSection,0);
  10918. Info(moduleSection, "next*: Module");
  10919. Address(moduleSection,0);
  10920. Info(moduleSection, "name*: Name");
  10921. Name(moduleSection,moduleName);
  10922. Info(moduleSection, "init, published: BOOLEAN");
  10923. Boolean(moduleSection,FALSE);
  10924. Boolean(moduleSection,FALSE);
  10925. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10926. Boolean(moduleSection,FALSE);
  10927. Boolean(moduleSection,FALSE);
  10928. Info(moduleSection, "refcnt*: LONGINT");
  10929. Longint(moduleSection,0);
  10930. Info(moduleSection, "sb*: ADDRESS");
  10931. Address(moduleSection,0);
  10932. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10933. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10934. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10935. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10936. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10937. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10938. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10939. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10940. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10941. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10942. Info(moduleSection, "procTable*: ProcTable");
  10943. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10944. Info(moduleSection, "ptrTable*: PtrTable");
  10945. IF ~implementationVisitor.backend.cooperative THEN
  10946. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10947. ELSE
  10948. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10949. END;
  10950. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10951. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10952. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10953. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10954. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10955. Info(moduleSection, "export*: ExportDesc");
  10956. ExportDesc(moduleSection);
  10957. Info(moduleSection, "term*: TerminationHandler");
  10958. Address(moduleSection,0);
  10959. Info(moduleSection, "exTable*: ExceptionTable");
  10960. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10961. Info(moduleSection, "noProcs*: LONGINT");
  10962. Longint(moduleSection,numberProcs);
  10963. Info(moduleSection, "firstProc*: ADDRESS");
  10964. Address(moduleSection,0);
  10965. Info(moduleSection, "maxPtrs*: LONGINT");
  10966. Longint(moduleSection,maxPointers);
  10967. Info(moduleSection, "crc*: LONGINT");
  10968. Longint(moduleSection, 0); (*! must be implemented *)
  10969. Info(moduleSection, "body*: ADDRESS");
  10970. Symbol(moduleSection, bodyProc, 0,0);
  10971. IF implementationVisitor.backend.cooperative THEN
  10972. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10973. Info(moduleSection, "monitor.owner");
  10974. Address(moduleSection,0);
  10975. Info(moduleSection, "monitor.nestingLevel");
  10976. Address(moduleSection,0);
  10977. Info(moduleSection, "monitor.blockedQueue");
  10978. Address(moduleSection,0); Address(moduleSection,0);
  10979. Info(moduleSection, "monitor.waitingQueue");
  10980. Address(moduleSection,0); Address(moduleSection,0);
  10981. Info(moduleSection, "monitor.waitingSentinel");
  10982. Address(moduleSection,0);
  10983. END;
  10984. END Module;
  10985. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10986. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10987. BEGIN
  10988. Array(source,pc,"");
  10989. Info(source, "pointer offsets array data");
  10990. IF scope IS SyntaxTree.RecordScope THEN
  10991. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10992. ELSIF scope IS SyntaxTree.CellScope THEN
  10993. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10994. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10995. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10996. WHILE variable # NIL DO
  10997. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10998. symbol := module.allSections.FindBySymbol(variable);
  10999. ASSERT(symbol # NIL);
  11000. Pointers(0,symbol, source,variable.type,numberPointers);
  11001. END;
  11002. variable := variable.nextVariable;
  11003. END;
  11004. END;
  11005. PatchArray(source,pc,numberPointers);
  11006. END PointerArray;
  11007. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11008. VAR
  11009. name: Basic.SegmentedName;
  11010. section: IntermediateCode.Section;
  11011. BEGIN
  11012. ASSERT(implementationVisitor.newObjectFile);
  11013. Global.GetSymbolSegmentedName(symbol,name);
  11014. Basic.AppendToSegmentedName(name,suffix);
  11015. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11016. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11017. Info(section, "HeapBlock");
  11018. Address(section,0); (* empty such that GC does not go on traversing *)
  11019. Info(section, suffix);
  11020. Address(section,0);
  11021. pc := section.pc;
  11022. RETURN section;
  11023. END SymbolSection;
  11024. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11025. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11026. BEGIN
  11027. ASSERT(implementationVisitor.newObjectFile);
  11028. IF ~ReflectionSupport OR simple THEN variable := NIL
  11029. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11030. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11031. IF type IS SyntaxTree.PointerType THEN
  11032. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11033. END;
  11034. IF type IS SyntaxTree.RecordType THEN
  11035. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11036. ELSIF type IS SyntaxTree.CellType THEN
  11037. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11038. END;
  11039. ELSIF symbol IS SyntaxTree.Procedure THEN
  11040. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11041. END;
  11042. Info(in, "variables");
  11043. IF variable # NIL THEN
  11044. section := SymbolSection(symbol, "@Variables",pc);
  11045. VariableArray(section, variable);
  11046. Symbol(in, section, pc, 0);
  11047. ELSE
  11048. Address(in, 0);
  11049. END;
  11050. END ReflectVariables;
  11051. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11052. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11053. BEGIN
  11054. ASSERT(implementationVisitor.newObjectFile);
  11055. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11056. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11057. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11058. IF type IS SyntaxTree.PointerType THEN
  11059. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11060. END;
  11061. IF type IS SyntaxTree.RecordType THEN
  11062. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11063. ELSIF type IS SyntaxTree.CellType THEN
  11064. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11065. END;
  11066. ELSIF symbol IS SyntaxTree.Procedure THEN
  11067. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11068. END;
  11069. Info(in, "procedures");
  11070. IF procedure # NIL THEN
  11071. section := SymbolSection(symbol, "@Procedures",pc);
  11072. ProcedureArray(section, procedure);
  11073. Symbol(in, section, pc, 0);
  11074. ELSE
  11075. Address(in, 0);
  11076. END;
  11077. END ReflectProcedures;
  11078. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11079. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  11080. segmentedName: Basic.SegmentedName;
  11081. td: SyntaxTree.TypeDeclaration;
  11082. type: SyntaxTree.Type;
  11083. BEGIN
  11084. Array(source,pc,"Modules.FieldEntry");
  11085. Info(source, "FieldArray");
  11086. size :=0;
  11087. WHILE variable # NIL DO
  11088. Info(source,"name");
  11089. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11090. type := variable.type.resolved;
  11091. Info(source,"offset");
  11092. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11093. Info(source,"type class");
  11094. IF type IS SyntaxTree.PointerType THEN
  11095. Size(source, 1);
  11096. ELSIF type IS SyntaxTree.RecordType THEN
  11097. Size(source, 2);
  11098. ELSIF type IS SyntaxTree.NumberType THEN
  11099. Size(source, 3);
  11100. ELSE
  11101. Size(source, 0);
  11102. END;
  11103. Info(source, "type desc");
  11104. IF type IS SyntaxTree.RecordType THEN
  11105. td := type(SyntaxTree.RecordType).typeDeclaration;
  11106. Global.GetSymbolSegmentedName(td,segmentedName);
  11107. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11108. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11109. ELSE
  11110. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11111. END;
  11112. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11113. Symbol(source, tir, 0, offset);
  11114. ELSE
  11115. Address(source, 0);
  11116. END;
  11117. Info(source,"flags");
  11118. Set(source, {});
  11119. variable := variable.nextVariable;
  11120. INC(size);
  11121. END;
  11122. PatchArray(source,pc,size);
  11123. END VariableArray;
  11124. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11125. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  11126. segmentedName: Basic.SegmentedName;
  11127. td: SyntaxTree.TypeDeclaration;
  11128. BEGIN
  11129. Array(source,pc,"Modules.ProcedureEntry");
  11130. Info(source, "ProcedureArray");
  11131. size :=0;
  11132. WHILE procedure # NIL DO
  11133. Info(source,"name");
  11134. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11135. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11136. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11137. (* size *)
  11138. Size(source, 0);
  11139. (* parameters *)
  11140. Address(source, 0);
  11141. (* variables *)
  11142. ReflectVariables(source, procedure);
  11143. ReflectProcedures(source, procedure);
  11144. (* return type entry *)
  11145. Address(source, 0);
  11146. Address(source, 0);
  11147. procedure := procedure.nextProcedure;
  11148. INC(size);
  11149. END;
  11150. PatchArray(source,pc,size);
  11151. END ProcedureArray;
  11152. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11153. VAR recordType: SyntaxTree.RecordType;
  11154. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11155. section: Sections.Section; type: SyntaxTree.Type; cellType: SyntaxTree.CellType;
  11156. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11157. VAR name: Basic.SegmentedName;source, fieldSection: IntermediateCode.Section;
  11158. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11159. sectionName: Basic.SectionName;
  11160. CONST MPO=-40000000H;
  11161. BEGIN
  11162. (*
  11163. TypeDesc* = POINTER TO RECORD
  11164. descSize: LONGINT;
  11165. sentinel: LONGINT; (* = MPO-4 *)
  11166. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11167. flags*: SET;
  11168. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11169. name*: Name;
  11170. END;
  11171. *)
  11172. (* source := module.sections.FindByName(...) *)
  11173. Global.GetSymbolSegmentedName(td,name);
  11174. Basic.AppendToSegmentedName(name,"@Info");
  11175. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11176. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11177. Address(source,MPO-4);
  11178. Info(source, "type tag pointer");
  11179. Symbol( source, tag, offset, 0);
  11180. Info(source, "type flags");
  11181. flags := {};
  11182. IF isProtected THEN INCL(flags,31) END;
  11183. Set( source, flags);
  11184. Info(source, "pointer to module");
  11185. moduleSection := ModuleSection();
  11186. Symbol( source, moduleSection, moduleSection.pc,0);
  11187. Info(source, "type name");
  11188. i := 0;
  11189. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11190. (*
  11191. Global.GetSymbolSegmentedName(td,name);
  11192. Basic.SegmentedNameToString(name, sectionName);
  11193. *)
  11194. Name(source,sectionName);
  11195. source.SetReferenced(FALSE);
  11196. Global.GetSymbolSegmentedName(td,name);
  11197. Basic.AppendToSegmentedName(name,"@Fields");
  11198. ReflectVariables(source, td);
  11199. ReflectProcedures(source, td);
  11200. (*
  11201. fieldSection := VariableArray(
  11202. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11203. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11204. Info(fieldSection, "HeapBlock");
  11205. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11206. Info(fieldSection, "TypeDescriptor");
  11207. Address(fieldSection,0);
  11208. Info(source, "FieldArray ref");
  11209. Symbol(source, fieldSection, fieldSection.pc, 0);
  11210. FieldArray(fieldSection);
  11211. Global.GetSymbolSegmentedName(td,name);
  11212. Basic.AppendToSegmentedName(name,"@Procedures");
  11213. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11214. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11215. Info(fieldSection, "HeapBlock");
  11216. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11217. Info(fieldSection, "TypeDescriptor");
  11218. Address(fieldSection,0);
  11219. Info(source, "Procedure Array ref");
  11220. Symbol(source, fieldSection, fieldSection.pc, 0);
  11221. ProcedureArray(fieldSection);
  11222. *)
  11223. RETURN source;
  11224. END NewTypeDescriptorInfo;
  11225. PROCEDURE NewTypeDescriptor;
  11226. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11227. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11228. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11229. numberPointers: LONGINT; padding,offset, i: LONGINT;
  11230. CONST MPO=-40000000H;
  11231. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11232. VAR i: LONGINT;
  11233. PROCEDURE Td(record: SyntaxTree.RecordType);
  11234. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11235. BEGIN
  11236. IF record # NIL THEN
  11237. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11238. baseTD := record.typeDeclaration;
  11239. Global.GetSymbolSegmentedName(baseTD,name);
  11240. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11241. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11242. ELSE
  11243. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11244. END;
  11245. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11246. Symbol(source, tir, 0, offset);
  11247. IF reverse THEN Td(record.GetBaseRecord()) END;
  11248. END;
  11249. END Td;
  11250. BEGIN
  11251. Info(source, "tag table");
  11252. baseRecord := recordType;
  11253. i := 0;
  11254. WHILE baseRecord # NIL DO
  11255. INC(i);
  11256. baseRecord := baseRecord.GetBaseRecord();
  11257. END;
  11258. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11259. IF ~reverse THEN Td(recordType) END;
  11260. WHILE i < size DO
  11261. Address(source,0);
  11262. INC(i);
  11263. END;
  11264. IF reverse THEN Td(recordType) END;
  11265. END TdTable;
  11266. PROCEDURE MethodTable(reverse: BOOLEAN);
  11267. VAR i,methods: LONGINT;
  11268. BEGIN
  11269. Info(source, "method table");
  11270. IF recordType # NIL THEN
  11271. methods := recordType.recordScope.numberMethods;
  11272. IF reverse THEN
  11273. FOR i := methods-1 TO 0 BY -1 DO
  11274. procedure := recordType.recordScope.FindMethod(i);
  11275. Global.GetSymbolSegmentedName(procedure, name);
  11276. NamedSymbol(source, name,procedure, 0,0);
  11277. END;
  11278. ELSE
  11279. FOR i := 0 TO methods-1 DO
  11280. procedure := recordType.recordScope.FindMethod(i);
  11281. Global.GetSymbolSegmentedName(procedure, name);
  11282. NamedSymbol(source, name,procedure, 0,0);
  11283. END;
  11284. END;
  11285. END;
  11286. END MethodTable;
  11287. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11288. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11289. BEGIN
  11290. Info(source, "method table");
  11291. baseRecord := recordType;
  11292. WHILE baseRecord.baseType # NIL DO
  11293. baseRecord := baseRecord.GetBaseRecord ();
  11294. END;
  11295. GetRecordTypeName (baseRecord, name);
  11296. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11297. IF name = stackFrame THEN
  11298. start := 0;
  11299. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11300. baseRecord := recordType;
  11301. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11302. baseRecord := baseRecord.GetBaseRecord ();
  11303. END;
  11304. IF baseRecord # NIL THEN
  11305. GetRecordTypeName (baseRecord, name);
  11306. IF pointer & ~baseRecord.isObject THEN
  11307. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11308. END;
  11309. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11310. ELSIF recordType.isObject THEN
  11311. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11312. ELSIF pointer THEN
  11313. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11314. ELSE
  11315. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11316. END;
  11317. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11318. Symbol(source, tir, 0, 0);
  11319. start := 0;
  11320. baseRecord := recordType;
  11321. WHILE (baseRecord # NIL) DO
  11322. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11323. baseRecord := baseRecord.GetBaseRecord ();
  11324. END;
  11325. ELSE
  11326. (* explicit trace method: *)
  11327. procedure := recordType.recordScope.FindMethod(0);
  11328. IF ~procedure.isFinalizer THEN
  11329. Global.GetSymbolSegmentedName(procedure, name);
  11330. NamedSymbol(source, name,procedure, 0,0);
  11331. END;
  11332. start := 1;
  11333. END;
  11334. IF (name # stackFrame) & recordType.isObject THEN
  11335. baseRecord := recordType;
  11336. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11337. baseRecord := baseRecord.GetBaseRecord ();
  11338. END;
  11339. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11340. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11341. ELSE
  11342. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11343. END;
  11344. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11345. Symbol(source, tir, 0, 0);
  11346. END;
  11347. methods := recordType.recordScope.numberMethods;
  11348. FOR i := start TO methods-1 DO
  11349. procedure := recordType.recordScope.FindMethod(i);
  11350. IF ~procedure.isFinalizer THEN
  11351. Global.GetSymbolSegmentedName(procedure, name);
  11352. NamedSymbol(source, name,procedure, 0,0);
  11353. END;
  11354. END;
  11355. END CooperativeMethodTable;
  11356. BEGIN
  11357. Global.GetSymbolSegmentedName(td,name);
  11358. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11359. source.SetExported(IsExported(td));
  11360. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11361. IF implementationVisitor.backend.cooperative THEN
  11362. base := NIL;
  11363. baseRecord := recordType.GetBaseRecord();
  11364. IF baseRecord # NIL THEN
  11365. baseTD := baseRecord.typeDeclaration;
  11366. END;
  11367. IF ~recordType.isObject THEN
  11368. Info(source, "parent");
  11369. IF baseRecord # NIL THEN
  11370. Global.GetSymbolSegmentedName(baseTD,name);
  11371. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11372. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11373. ELSE
  11374. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11375. END;
  11376. Symbol(source, tir, 0, 0);
  11377. ELSE
  11378. Address(source,0);
  11379. END;
  11380. Info(source, "record size");
  11381. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11382. source.SetReferenced(FALSE);
  11383. CooperativeMethodTable(FALSE);
  11384. base := source;
  11385. Global.GetSymbolSegmentedName(td,name);
  11386. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11387. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11388. source.SetExported(IsExported(td));
  11389. source.SetReferenced(FALSE);
  11390. END;
  11391. Info(source, "parent");
  11392. IF baseRecord # NIL THEN
  11393. Global.GetSymbolSegmentedName(baseTD,name);
  11394. sym := baseTD;
  11395. IF ~recordType.isObject THEN
  11396. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11397. sym := NIL;
  11398. END;
  11399. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11400. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11401. ELSE
  11402. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11403. END;
  11404. Symbol(source, tir, 0, 0);
  11405. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11406. Address(source,0);
  11407. ELSE
  11408. IF recordType.isObject THEN
  11409. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11410. ELSE
  11411. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11412. END;
  11413. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11414. Symbol(source, tir, 0, 0);
  11415. END;
  11416. Info(source, "base record descriptor");
  11417. Symbol(source, base, 0, 0);
  11418. CooperativeMethodTable(TRUE);
  11419. source.SetReferenced(FALSE);
  11420. IF recordType.hasPointers THEN
  11421. IF ~HasExplicitTraceMethod (recordType) THEN
  11422. implementationVisitor.CreateTraceMethod(recordType);
  11423. END;
  11424. implementationVisitor.CreateResetProcedure(recordType);
  11425. implementationVisitor.CreateAssignProcedure(recordType);
  11426. END;
  11427. ELSIF ~simple THEN
  11428. (*
  11429. MethodEnd = MPO
  11430. ---
  11431. methods (# methods)
  11432. ---
  11433. tags (16)
  11434. ---
  11435. TypeDesc = TypeInfoAdr
  11436. ---
  11437. td adr ---> rec size
  11438. ----
  11439. pointer offsets
  11440. ----
  11441. (padding)
  11442. -----
  11443. empty [2 addresses aligned]
  11444. empty
  11445. empty
  11446. numPtrs
  11447. ---
  11448. pointer offsets
  11449. ---
  11450. *)
  11451. Info(source, "MethodEnd = MPO");
  11452. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11453. source(IntermediateCode.Section).Emit(Data(-1,op));
  11454. MethodTable(TRUE);
  11455. TdTable(TypeTags, TRUE);
  11456. Info(source, "type descriptor info pointer");
  11457. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11458. IF (cellType # NIL) THEN
  11459. IF cellType.sizeInBits < 0 THEN
  11460. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11461. END;
  11462. Info(source, "cell size");
  11463. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11464. ELSE
  11465. Info(source, "record size");
  11466. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11467. END;
  11468. Info(source, "pointer offsets pointer");
  11469. padding := 1- source.pc MOD 2;
  11470. Symbol(source, source, source.pc+1+padding,0);
  11471. IF padding >0 THEN
  11472. Info(source, "padding");
  11473. FOR i := 1 TO padding DO Address(source,0) END;
  11474. END;
  11475. IF cellType # NIL THEN
  11476. PointerArray(source, cellType.cellScope, numberPointers);
  11477. ELSE
  11478. PointerArray(source, recordType.recordScope, numberPointers);
  11479. END;
  11480. ELSE
  11481. (*
  11482. simple:
  11483. td adr --> size
  11484. tag(1)
  11485. tag(2)
  11486. tag(3)
  11487. methods ->
  11488. *)
  11489. Info(source, "record size");
  11490. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11491. TdTable(TypeTags, FALSE);
  11492. MethodTable(FALSE);
  11493. source.SetReferenced(FALSE);
  11494. END;
  11495. END NewTypeDescriptor;
  11496. BEGIN
  11497. x := x.resolved;
  11498. IF (x IS SyntaxTree.PointerType) THEN
  11499. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11500. END;
  11501. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11502. recordType := x(SyntaxTree.RecordType);
  11503. td := x.typeDeclaration;
  11504. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11505. ASSERT(td # NIL);
  11506. section := module.allSections.FindBySymbol(td); (* TODO *)
  11507. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11508. IF implementationVisitor.newObjectFile THEN
  11509. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11510. NewTypeDescriptor
  11511. END;
  11512. ELSE
  11513. (* data section in intermediate code *)
  11514. Global.GetSymbolSegmentedName(td,name);
  11515. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11516. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11517. tir.Emit(Data(-1,op));
  11518. END;
  11519. END;
  11520. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11521. cellType := x(SyntaxTree.CellType);
  11522. td := x.typeDeclaration;
  11523. section := module.allSections.FindBySymbol(td); (* TODO *)
  11524. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11525. IF implementationVisitor.newObjectFile THEN
  11526. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11527. NewTypeDescriptor
  11528. END;
  11529. END;
  11530. END;
  11531. END
  11532. END CheckTypeDeclaration
  11533. END MetaDataGenerator;
  11534. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11535. VAR
  11536. trace-: BOOLEAN;
  11537. traceString-: SyntaxTree.IdentifierString;
  11538. traceModuleName-: SyntaxTree.IdentifierString;
  11539. newObjectFile-: BOOLEAN;
  11540. profile-: BOOLEAN;
  11541. noRuntimeChecks: BOOLEAN;
  11542. simpleMetaData-: BOOLEAN;
  11543. noAsserts: BOOLEAN;
  11544. optimize-: BOOLEAN;
  11545. cooperative-: BOOLEAN;
  11546. preregisterStatic-: BOOLEAN;
  11547. dump-: Basic.Writer;
  11548. cellsAreObjects: BOOLEAN;
  11549. PROCEDURE &InitIntermediateBackend*;
  11550. BEGIN
  11551. simpleMetaData := FALSE;
  11552. newObjectFile := FALSE;
  11553. InitBackend;
  11554. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11555. SetTraceModuleName(DefaultTraceModuleName);
  11556. END InitIntermediateBackend;
  11557. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11558. VAR
  11559. declarationVisitor: DeclarationVisitor;
  11560. implementationVisitor: ImplementationVisitor;
  11561. module: Sections.Module;
  11562. name, instructionSet, platformName: SyntaxTree.IdentifierString;
  11563. meta: MetaDataGenerator;
  11564. BEGIN
  11565. ResetError;
  11566. Global.GetSymbolName(x,name);
  11567. IF activeCellsSpecification # NIL THEN
  11568. GetDescription(instructionSet);
  11569. activeCellsSpecification.SetInstructionSet(instructionSet)
  11570. END;
  11571. NEW(module,x,system); (* backend structures *)
  11572. Global.GetModuleName(x, name);
  11573. module.SetModuleName(name);
  11574. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11575. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11576. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11577. declarationVisitor.Module(x,module);
  11578. IF newObjectFile & ~meta.simple THEN
  11579. meta.Module(implementationVisitor.moduleBodySection);
  11580. END;
  11581. GetDescription(platformName);
  11582. module.SetPlatformName(platformName);
  11583. RETURN module
  11584. END GenerateIntermediate;
  11585. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11586. BEGIN RETURN TRUE
  11587. END SupportedImmediate;
  11588. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11589. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11590. END ProcessSyntaxTreeModule;
  11591. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11592. VAR
  11593. result: Sections.Module;
  11594. traceName: Basic.MessageString;
  11595. BEGIN
  11596. ASSERT(intermediateCodeModule IS Sections.Module);
  11597. result := intermediateCodeModule(Sections.Module);
  11598. IF trace THEN
  11599. traceName := "intermediate code trace: ";
  11600. Strings.Append(traceName,traceString);
  11601. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11602. IF (traceString="") OR (traceString="*") THEN
  11603. result.Dump(dump);
  11604. dump.Update
  11605. ELSE
  11606. Sections.DumpFiltered(dump, result, traceString);
  11607. END
  11608. END;
  11609. RETURN result
  11610. END ProcessIntermediateCodeModule;
  11611. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11612. BEGIN instructionSet := "Intermediate";
  11613. END GetDescription;
  11614. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11615. BEGIN
  11616. SELF.newObjectFile := newObjectFile;
  11617. SELF.simpleMetaData := simpleMetaData;
  11618. END SetNewObjectFile;
  11619. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11620. BEGIN COPY(name, traceModuleName)
  11621. END SetTraceModuleName;
  11622. PROCEDURE DefineOptions(options: Options.Options);
  11623. BEGIN
  11624. DefineOptions^(options);
  11625. options.Add(0X,"trace",Options.String);
  11626. options.Add(0X,"runtime",Options.String);
  11627. options.Add(0X,"newObjectFile",Options.Flag);
  11628. options.Add(0X,"traceModule",Options.String);
  11629. options.Add(0X,"profile",Options.Flag);
  11630. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11631. options.Add(0X,"noAsserts",Options.Flag);
  11632. options.Add(0X,"metaData",Options.String);
  11633. options.Add('o',"optimize", Options.Flag);
  11634. options.Add(0X,"preregisterStatic", Options.Flag);
  11635. options.Add(0X,"cellsAreObjects", Options.Flag);
  11636. END DefineOptions;
  11637. PROCEDURE GetOptions(options: Options.Options);
  11638. VAR name,string: SyntaxTree.IdentifierString;
  11639. BEGIN
  11640. GetOptions^(options);
  11641. trace := options.GetString("trace",traceString);
  11642. profile := options.GetFlag("profile");
  11643. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11644. noAsserts := options.GetFlag("noAsserts");
  11645. cooperative := options.GetFlag("cooperative");
  11646. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11647. IF cooperative THEN
  11648. SetRuntimeModuleName("CPU") END
  11649. END;
  11650. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11651. simpleMetaData := TRUE
  11652. END;
  11653. IF options.GetString("metaData",string) THEN
  11654. IF string = "simple" THEN simpleMetaData := TRUE
  11655. ELSIF string ="full" THEN simpleMetaData := FALSE
  11656. END;
  11657. END;
  11658. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11659. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11660. optimize := options.GetFlag("optimize");
  11661. preregisterStatic := options.GetFlag("preregisterStatic");
  11662. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11663. END GetOptions;
  11664. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11665. BEGIN RETURN SymbolFileFormat.Get()
  11666. END DefaultSymbolFileFormat;
  11667. END IntermediateBackend;
  11668. (* ----------------------------------- register allocation ------------------------------------- *)
  11669. (* register mapping scheme
  11670. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11671. spill offset
  11672. part(n) --> ticket <--> physical register
  11673. spill offset
  11674. *)
  11675. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11676. emptyOperand: IntermediateCode.Operand;
  11677. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11678. statCoopResetVariables: LONGINT;
  11679. statCoopModifyAssignments: LONGINT;
  11680. modifyAssignmentsPC : LONGINT;
  11681. statCoopNilCheck: LONGINT;
  11682. statCoopSwitch: LONGINT;
  11683. statCoopAssignProcedure: LONGINT;
  11684. statCoopTraceMethod: LONGINT;
  11685. statCoopResetProcedure: LONGINT;
  11686. statCoopTraceModule: LONGINT;
  11687. PROCEDURE ResetStatistics*;
  11688. BEGIN
  11689. statCoopResetVariables := 0;
  11690. statCoopModifyAssignments := 0;
  11691. statCoopNilCheck:= 0;
  11692. statCoopSwitch:= 0;
  11693. statCoopAssignProcedure:= 0;
  11694. statCoopTraceMethod:= 0;
  11695. statCoopResetProcedure:= 0;
  11696. statCoopTraceModule:= 0;
  11697. END ResetStatistics;
  11698. PROCEDURE Statistics*;
  11699. BEGIN
  11700. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11701. TRACE(statCoopNilCheck, statCoopSwitch);
  11702. TRACE(statCoopAssignProcedure,
  11703. statCoopTraceMethod,
  11704. statCoopResetProcedure,
  11705. statCoopTraceModule)
  11706. END Statistics;
  11707. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11708. VAR h: LONGINT;
  11709. BEGIN
  11710. WHILE b # 0 DO
  11711. h := a MOD b;
  11712. a := b;
  11713. b := h;
  11714. END;
  11715. RETURN a
  11716. END GCD;
  11717. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11718. BEGIN
  11719. RETURN a*b DIV GCD(a,b)
  11720. END SCM;
  11721. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11722. BEGIN
  11723. (*TRACE(a,b);*)
  11724. IF a = 0 THEN RETURN b
  11725. ELSIF b = 0 THEN RETURN a
  11726. ELSE RETURN SCM(a,b)
  11727. END;
  11728. END CommonAlignment;
  11729. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11730. BEGIN
  11731. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11732. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11733. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11734. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11735. 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)
  11736. END
  11737. END PassBySingleReference;
  11738. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11739. BEGIN
  11740. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11741. END PassInRegister;
  11742. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11743. VAR new: RegisterEntry;
  11744. BEGIN
  11745. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11746. IF queue = NIL THEN
  11747. queue := new
  11748. ELSE
  11749. new.next := queue;
  11750. IF queue#NIL THEN queue.prev := new END;
  11751. queue := new
  11752. END;
  11753. END AddRegisterEntry;
  11754. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11755. VAR this: RegisterEntry;
  11756. BEGIN
  11757. this := queue;
  11758. WHILE (this # NIL) & (this.register # register) DO
  11759. this := this.next;
  11760. END;
  11761. IF this = NIL THEN
  11762. RETURN FALSE
  11763. END;
  11764. ASSERT(this # NIL);
  11765. IF this = queue THEN queue := queue.next END;
  11766. IF this.prev # NIL THEN this.prev.next := this.next END;
  11767. IF this.next # NIL THEN this.next.prev := this.prev END;
  11768. RETURN TRUE
  11769. END RemoveRegisterEntry;
  11770. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11771. BEGIN ASSERT(cond);
  11772. END Assert;
  11773. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11774. BEGIN
  11775. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11776. END ReusableRegister;
  11777. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11778. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11779. BEGIN
  11780. procedure := moduleScope.bodyProcedure;
  11781. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11782. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11783. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11784. procedure.SetScope(moduleScope);
  11785. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11786. procedure.SetAccess(SyntaxTree.Hidden);
  11787. moduleScope.SetBodyProcedure(procedure);
  11788. moduleScope.AddProcedure(procedure);
  11789. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11790. END;
  11791. END EnsureBodyProcedure;
  11792. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11793. VAR import: SyntaxTree.Import;
  11794. s: Basic.MessageString;
  11795. selfName: SyntaxTree.IdentifierString;
  11796. module: SyntaxTree.Module;
  11797. BEGIN
  11798. scope.ownerModule.GetName(selfName);
  11799. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11800. module := scope.ownerModule
  11801. ELSE
  11802. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11803. IF import = NIL THEN
  11804. RETURN NIL
  11805. ELSIF import.module = NIL THEN
  11806. RETURN NIL
  11807. ELSE module := import.module
  11808. END;
  11809. END;
  11810. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11811. END GetSymbol;
  11812. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11813. BEGIN
  11814. op.mode := mode;
  11815. IntermediateCode.InitOperand(op.op);
  11816. IntermediateCode.InitOperand(op.tag);
  11817. IntermediateCode.InitOperand(op.extra);
  11818. op.dimOffset := 0;
  11819. END InitOperand;
  11820. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11821. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11822. BEGIN RETURN IntermediateCode.GetType(system, type)
  11823. END GetType;
  11824. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11825. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11826. BEGIN
  11827. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11828. (*
  11829. UniqueId(name,module,name,adr);
  11830. *)
  11831. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11832. constant.SetValue(value);
  11833. module.moduleScope.AddConstant(constant);
  11834. constant.SetScope(module.moduleScope);
  11835. RETURN constant
  11836. END BuildConstant;
  11837. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11838. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11839. BEGIN
  11840. variable := scope.firstVariable;
  11841. WHILE variable # NIL DO
  11842. IF variable.NeedsTrace() THEN
  11843. RETURN TRUE;
  11844. END;
  11845. variable := variable.nextVariable;
  11846. END;
  11847. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11848. WHILE parameter # NIL DO
  11849. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11850. RETURN TRUE;
  11851. END;
  11852. parameter := parameter.nextParameter;
  11853. END;
  11854. RETURN FALSE;
  11855. END HasPointers;
  11856. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11857. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11858. END IsVariableParameter;
  11859. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11860. VAR parameter: SyntaxTree.Parameter;
  11861. BEGIN
  11862. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11863. WHILE parameter # NIL DO
  11864. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11865. IF parameter.movable THEN RETURN TRUE END;
  11866. parameter := parameter.nextParameter;
  11867. END;
  11868. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11869. END HasVariableParameters;
  11870. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11871. BEGIN
  11872. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11873. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11874. END HasExplicitTraceMethod;
  11875. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11876. BEGIN
  11877. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11878. IF (expression IS SyntaxTree.IntegerValue) THEN
  11879. val := expression(SyntaxTree.IntegerValue).value;
  11880. RETURN TRUE
  11881. ELSE
  11882. RETURN FALSE
  11883. END;
  11884. END IsIntegerConstant;
  11885. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11886. BEGIN
  11887. IF val <= 0 THEN RETURN FALSE END;
  11888. exp := 0;
  11889. WHILE ~ODD(val) DO
  11890. val := val DIV 2;
  11891. INC(exp)
  11892. END;
  11893. RETURN val = 1
  11894. END PowerOf2;
  11895. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11896. VAR procedure: SyntaxTree.Procedure;
  11897. BEGIN
  11898. procedure := record.recordScope.constructor;
  11899. IF procedure = NIL THEN
  11900. record := record.GetBaseRecord();
  11901. IF record # NIL THEN
  11902. procedure := GetConstructor(record)
  11903. END;
  11904. END;
  11905. RETURN procedure;
  11906. END GetConstructor;
  11907. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11908. BEGIN
  11909. value := SHORT(op.intValue);
  11910. RETURN op.mode = IntermediateCode.ModeImmediate;
  11911. END IsIntegerImmediate;
  11912. (** whether a type strictily is a pointer to record or object type
  11913. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11914. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11915. BEGIN
  11916. IF type = NIL THEN
  11917. RETURN FALSE
  11918. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11919. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11920. ELSE
  11921. RETURN FALSE
  11922. END
  11923. END IsStrictlyPointerToRecord;
  11924. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11925. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11926. END IsUnsafePointer;
  11927. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11928. BEGIN type := type.resolved;
  11929. IF type IS SyntaxTree.PointerType THEN
  11930. type := type(SyntaxTree.PointerType).pointerBase;
  11931. type := type.resolved;
  11932. IF type IS SyntaxTree.RecordType THEN
  11933. recordType := type(SyntaxTree.RecordType);
  11934. RETURN TRUE
  11935. ELSE
  11936. RETURN FALSE
  11937. END
  11938. ELSIF type IS SyntaxTree.RecordType THEN
  11939. recordType := type(SyntaxTree.RecordType);
  11940. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11941. ELSIF type IS SyntaxTree.ObjectType THEN
  11942. RETURN TRUE
  11943. ELSIF type IS SyntaxTree.AnyType THEN
  11944. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11945. ELSE
  11946. RETURN FALSE
  11947. END;
  11948. END IsPointerToRecord;
  11949. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11950. BEGIN
  11951. type := type.resolved;
  11952. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11953. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11954. END IsArrayOfSystemByte;
  11955. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11956. BEGIN
  11957. IF type = NIL THEN RETURN FALSE END;
  11958. type := type.resolved;
  11959. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11960. END IsOpenArray;
  11961. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11962. BEGIN
  11963. IF type = NIL THEN RETURN FALSE END;
  11964. type := type.resolved;
  11965. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11966. END IsStaticArray;
  11967. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11968. VAR size: LONGINT;
  11969. BEGIN
  11970. size := 1;
  11971. WHILE (IsStaticArray(type)) DO
  11972. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11973. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11974. END;
  11975. RETURN size;
  11976. END StaticArrayNumElements;
  11977. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11978. BEGIN
  11979. WHILE (IsStaticArray(type)) DO
  11980. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11981. END;
  11982. RETURN type;
  11983. END StaticArrayBaseType;
  11984. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11985. BEGIN
  11986. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11987. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11988. END;
  11989. RETURN type;
  11990. END ArrayBaseType;
  11991. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11992. BEGIN
  11993. IF type = NIL THEN RETURN FALSE END;
  11994. type := type.resolved;
  11995. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11996. END IsDelegate;
  11997. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11998. VAR i: LONGINT;
  11999. BEGIN
  12000. i := 0; type := type.resolved;
  12001. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12002. INC(i);
  12003. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12004. END;
  12005. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12006. INC(i);
  12007. type := type(SyntaxTree.MathArrayType).arrayBase;
  12008. IF type # NIL THEN type := type.resolved END;
  12009. END;
  12010. RETURN i
  12011. END DynamicDim;
  12012. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12013. BEGIN
  12014. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12015. type := type(SyntaxTree.ArrayType).arrayBase;
  12016. END;
  12017. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12018. type := type(SyntaxTree.MathArrayType).arrayBase;
  12019. END;
  12020. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12021. END StaticSize;
  12022. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12023. BEGIN
  12024. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12025. END IsImmediate;
  12026. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12027. BEGIN
  12028. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12029. END IsAddress;
  12030. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12031. BEGIN
  12032. RETURN (x.mode = IntermediateCode.ModeRegister);
  12033. END IsRegister;
  12034. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12035. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12036. BEGIN
  12037. typeDeclaration := recordType.typeDeclaration;
  12038. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12039. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12040. END GetRecordTypeName;
  12041. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12042. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12043. BEGIN
  12044. parSize := 0;
  12045. IF StructuredReturnType(procedureType) THEN
  12046. parameter := procedureType.returnParameter;
  12047. INC(parSize,system.SizeOfParameter(parameter));
  12048. parSize := parSize + (-parSize) MOD system.addressSize;
  12049. END;
  12050. parameter :=procedureType.lastParameter;
  12051. WHILE (parameter # NIL) DO
  12052. INC(parSize,system.SizeOfParameter(parameter));
  12053. parSize := parSize + (-parSize) MOD system.addressSize;
  12054. parameter := parameter.prevParameter;
  12055. END;
  12056. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12057. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12058. RETURN ToMemoryUnits(system,parSize)
  12059. END ParametersSize;
  12060. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12061. BEGIN
  12062. IF type = NIL THEN RETURN FALSE
  12063. ELSE
  12064. type := type.resolved;
  12065. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12066. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12067. END
  12068. END ReturnedAsParameter;
  12069. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12070. BEGIN
  12071. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12072. END StructuredReturnType;
  12073. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12074. BEGIN
  12075. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12076. END IsNested;
  12077. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12078. BEGIN
  12079. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12080. scope := scope.outerScope;
  12081. END;
  12082. RETURN scope # NIL;
  12083. END InCellScope;
  12084. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12085. BEGIN
  12086. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12087. RETURN 0
  12088. ELSE
  12089. *)
  12090. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12091. (*END;*)
  12092. END ProcedureParametersSize;
  12093. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12094. VAR dataUnit: LONGINT;
  12095. BEGIN dataUnit := system.dataUnit;
  12096. ASSERT(size MOD system.dataUnit = 0);
  12097. RETURN size DIV system.dataUnit
  12098. END ToMemoryUnits;
  12099. PROCEDURE Get*(): Backend.Backend;
  12100. VAR backend: IntermediateBackend;
  12101. BEGIN NEW(backend); RETURN backend
  12102. END Get;
  12103. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12104. VAR instruction: IntermediateCode.Instruction;
  12105. BEGIN
  12106. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12107. RETURN instruction
  12108. END Nop;
  12109. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12110. VAR instruction: IntermediateCode.Instruction;
  12111. BEGIN
  12112. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12113. RETURN instruction
  12114. END Mov;
  12115. (* like Mov but ensures that no new register will be allocated for dest *)
  12116. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12117. VAR instruction: IntermediateCode.Instruction;
  12118. BEGIN
  12119. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12120. RETURN instruction
  12121. END MovReplace;
  12122. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12123. VAR instruction: IntermediateCode.Instruction;
  12124. BEGIN
  12125. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12126. RETURN instruction
  12127. END Conv;
  12128. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12129. VAR instruction: IntermediateCode.Instruction;
  12130. BEGIN
  12131. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12132. RETURN instruction
  12133. END Call;
  12134. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12135. VAR op1, op2: IntermediateCode.Operand;
  12136. VAR instruction: IntermediateCode.Instruction;
  12137. BEGIN
  12138. IntermediateCode.InitNumber(op1,pcOffset);
  12139. IntermediateCode.InitNumber(op2,callingConvention);
  12140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12141. RETURN instruction
  12142. END Exit;
  12143. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12144. VAR instruction: IntermediateCode.Instruction;
  12145. BEGIN
  12146. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12147. RETURN instruction
  12148. END Return;
  12149. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12150. VAR instruction: IntermediateCode.Instruction;
  12151. BEGIN
  12152. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12153. RETURN instruction
  12154. END Result;
  12155. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12156. VAR op1: IntermediateCode.Operand;
  12157. VAR instruction: IntermediateCode.Instruction;
  12158. BEGIN
  12159. IntermediateCode.InitNumber(op1,nr);
  12160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12161. RETURN instruction
  12162. END Trap;
  12163. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12164. VAR instruction: IntermediateCode.Instruction;
  12165. BEGIN
  12166. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12167. RETURN instruction
  12168. END Br;
  12169. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12170. VAR instruction: IntermediateCode.Instruction;
  12171. BEGIN
  12172. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12173. RETURN instruction
  12174. END Breq;
  12175. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12176. VAR instruction: IntermediateCode.Instruction;
  12177. BEGIN
  12178. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12179. RETURN instruction
  12180. END Brne;
  12181. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12182. VAR instruction: IntermediateCode.Instruction;
  12183. BEGIN
  12184. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12185. RETURN instruction
  12186. END Brge;
  12187. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12188. VAR instruction: IntermediateCode.Instruction;
  12189. BEGIN
  12190. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12191. RETURN instruction
  12192. END Brlt;
  12193. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12194. VAR instruction: IntermediateCode.Instruction;
  12195. BEGIN
  12196. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12197. RETURN instruction
  12198. END Pop;
  12199. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12200. VAR instruction: IntermediateCode.Instruction;
  12201. BEGIN
  12202. ASSERT(op.mode # IntermediateCode.Undefined);
  12203. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12204. RETURN instruction
  12205. END Push;
  12206. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12207. VAR instruction: IntermediateCode.Instruction;
  12208. BEGIN
  12209. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12210. RETURN instruction
  12211. END Neg;
  12212. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12213. VAR instruction: IntermediateCode.Instruction;
  12214. BEGIN
  12215. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12216. RETURN instruction
  12217. END Not;
  12218. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12219. VAR instruction: IntermediateCode.Instruction;
  12220. BEGIN
  12221. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12222. RETURN instruction
  12223. END Abs;
  12224. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12225. VAR instruction: IntermediateCode.Instruction;
  12226. BEGIN
  12227. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12228. RETURN instruction
  12229. END Mul;
  12230. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12231. VAR instruction: IntermediateCode.Instruction;
  12232. BEGIN
  12233. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12234. RETURN instruction
  12235. END Div;
  12236. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12237. VAR instruction: IntermediateCode.Instruction;
  12238. BEGIN
  12239. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12240. RETURN instruction
  12241. END Mod;
  12242. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12243. VAR instruction: IntermediateCode.Instruction;
  12244. BEGIN
  12245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12246. RETURN instruction
  12247. END Sub;
  12248. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12249. VAR instruction: IntermediateCode.Instruction;
  12250. BEGIN
  12251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12252. RETURN instruction
  12253. END Add;
  12254. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12255. VAR instruction: IntermediateCode.Instruction;
  12256. BEGIN
  12257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12258. RETURN instruction
  12259. END And;
  12260. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12261. VAR instruction: IntermediateCode.Instruction;
  12262. BEGIN
  12263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12264. RETURN instruction
  12265. END Or;
  12266. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12267. VAR instruction: IntermediateCode.Instruction;
  12268. BEGIN
  12269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12270. RETURN instruction
  12271. END Xor;
  12272. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12273. VAR instruction: IntermediateCode.Instruction;
  12274. BEGIN
  12275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12276. RETURN instruction
  12277. END Shl;
  12278. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12279. VAR instruction: IntermediateCode.Instruction;
  12280. BEGIN
  12281. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12282. RETURN instruction
  12283. END Shr;
  12284. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12285. VAR instruction: IntermediateCode.Instruction;
  12286. BEGIN
  12287. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12288. RETURN instruction
  12289. END Rol;
  12290. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12291. VAR instruction: IntermediateCode.Instruction;
  12292. BEGIN
  12293. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12294. RETURN instruction
  12295. END Ror;
  12296. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12297. VAR instruction: IntermediateCode.Instruction;
  12298. BEGIN
  12299. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12300. RETURN instruction
  12301. END Cas;
  12302. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12303. VAR instruction: IntermediateCode.Instruction;
  12304. BEGIN
  12305. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12306. RETURN instruction
  12307. END Copy;
  12308. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12309. VAR instruction: IntermediateCode.Instruction;
  12310. BEGIN
  12311. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12312. RETURN instruction
  12313. END Fill;
  12314. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12315. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12316. BEGIN
  12317. string := IntermediateCode.String(s);
  12318. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12319. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12320. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12321. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12322. RETURN instruction
  12323. END Asm;
  12324. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12325. VAR instruction: IntermediateCode.Instruction;
  12326. BEGIN
  12327. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12328. RETURN instruction
  12329. END Data;
  12330. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12331. VAR instruction: IntermediateCode.Instruction;
  12332. BEGIN
  12333. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12334. IntermediateCode.SetSubType(instruction, subtype);
  12335. RETURN instruction
  12336. END SpecialInstruction;
  12337. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12338. VAR op1: IntermediateCode.Operand;
  12339. VAR instruction: IntermediateCode.Instruction;
  12340. BEGIN
  12341. (*! generate a warning if size exceeds a certain limit *)
  12342. (*
  12343. ASSERT(bytes < 1000000); (* sanity check *)
  12344. *)
  12345. ASSERT(0 <= units); (* sanity check *)
  12346. IntermediateCode.InitNumber(op1,units);
  12347. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12348. RETURN instruction
  12349. END Reserve;
  12350. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12351. VAR op1: IntermediateCode.Operand;
  12352. VAR instruction: IntermediateCode.Instruction;
  12353. BEGIN
  12354. IntermediateCode.InitNumber(op1,position);
  12355. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12356. RETURN instruction
  12357. END LabelInstruction;
  12358. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12359. VAR pc: LONGINT;
  12360. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12361. BEGIN
  12362. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12363. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12364. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12365. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12366. IF instr.op1.type.form = IntermediateCode.Float THEN
  12367. RETURN instr.op1.floatValue = op.floatValue
  12368. ELSE
  12369. RETURN instr.op1.intValue = op.intValue
  12370. END;
  12371. END ProvidesValue;
  12372. BEGIN
  12373. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12374. pc := 0;
  12375. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12376. INC(pc);
  12377. END;
  12378. IF pc = data.pc THEN
  12379. data.Emit(Data(-1,vop));
  12380. END;
  12381. RETURN pc
  12382. END EnterImmediate;
  12383. PROCEDURE Init;
  12384. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12385. BEGIN
  12386. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12387. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12388. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12389. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12390. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12391. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12392. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12393. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12394. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12395. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12396. IntermediateCode.InitOperand(emptyOperand);
  12397. FOR i := 0 TO NumberSystemCalls-1 DO
  12398. name := "@SystemCall";
  12399. Basic.AppendNumber(name,i);
  12400. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12401. END;
  12402. END Init;
  12403. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12404. BEGIN
  12405. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12406. END IsExported;
  12407. BEGIN
  12408. Init;
  12409. END FoxIntermediateBackend.
  12410. Compiler.Compile FoxIntermediateBackend.Mod ~