FoxIntermediateBackend.Mod 568 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524
  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, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  87. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  291. BEGIN
  292. size := offset - lastUpdated;
  293. IF size > 0 THEN
  294. irv.Emit(Reserve(x.position,size));
  295. END;
  296. irv.Emit(Data(x.position, op));
  297. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  298. END SingleInitialize;
  299. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  300. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size: SIZE;
  301. BEGIN
  302. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  303. WITH type: SyntaxTree.RecordType DO
  304. baseType := type.baseType;
  305. IF baseType # NIL THEN
  306. baseType := baseType.resolved;
  307. IF baseType IS SyntaxTree.PointerType THEN
  308. baseType := baseType(SyntaxTree.PointerType).pointerBase
  309. END;
  310. Initialize(baseType,NIL, offset);
  311. END;
  312. variable := type.recordScope.firstVariable;
  313. WHILE variable # NIL DO
  314. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  315. variable := variable.nextVariable
  316. END;
  317. | type: SyntaxTree.ArrayType DO
  318. IF type.form = SyntaxTree.Static THEN
  319. baseType := type.arrayBase;
  320. IF TypeNeedsInitialization(baseType) THEN
  321. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  322. FOR i := 0 TO type.staticLength-1 DO
  323. Initialize(baseType,NIL,offset+i*size);
  324. END;
  325. END;
  326. END;
  327. | type: SyntaxTree.MathArrayType DO
  328. IF type.form = SyntaxTree.Open THEN
  329. dim := DynamicDim(type);
  330. baseType := SemanticChecker.ArrayBase(type,dim);
  331. imm := IntermediateCode.Immediate(addressType,dim);
  332. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  333. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  334. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  335. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  336. (* flags remain empty (=0) for open array *)
  337. ELSIF type.form = SyntaxTree.Static THEN
  338. baseType := type.arrayBase;
  339. IF TypeNeedsInitialization(baseType) THEN
  340. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  341. ASSERT(type.staticLength < 1024*1024*1024);
  342. FOR i := 0 TO type.staticLength-1 DO
  343. Initialize(baseType,NIL,offset+i*size);
  344. END;
  345. END;
  346. END;
  347. ELSE
  348. IF initializer # NIL THEN
  349. implementationVisitor.Evaluate(initializer, op);
  350. SingleInitialize(op.op, offset);
  351. END;
  352. END;
  353. END Initialize;
  354. BEGIN
  355. IF x.externalName # NIL THEN RETURN END;
  356. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  357. (* code section for variable *)
  358. Global.GetSymbolSegmentedName(x,name);
  359. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  360. irv.SetExported(IsExported(x));
  361. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  362. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  363. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  366. FOR i := 0 TO DynamicDim(x.type)-1 DO
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. END;
  369. ELSE
  370. lastUpdated:= 0;
  371. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  372. Initialize(x.type, x.initializer, 0);
  373. END;
  374. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  375. IF size > 0 THEN
  376. irv.Emit(Reserve(x.position,size));
  377. END;
  378. IF ~x.fixed THEN
  379. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  380. ELSE
  381. align := x.alignment;
  382. END;
  383. irv.SetPositionOrAlignment(x.fixed, align);
  384. meta.CheckTypeDeclaration(x.type);
  385. END;
  386. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  387. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  388. END;
  389. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  390. END VisitVariable;
  391. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  392. BEGIN
  393. VisitVariable(x)
  394. END VisitProperty;
  395. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  396. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  397. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  398. BEGIN
  399. ASSERT(currentScope IS SyntaxTree.CellScope);
  400. Global.GetSymbolSegmentedName(x,name);
  401. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  402. irv.SetExported(IsExported(x));
  403. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  404. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  405. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  407. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  408. FOR i := 0 TO DynamicDim(x.type)-1 DO
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. END;
  411. ELSE
  412. lastUpdated:= 0;
  413. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  414. IF size > 0 THEN
  415. irv.Emit(Reserve(x.position,size));
  416. END;
  417. IF ~x.fixed THEN
  418. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  419. ELSE
  420. align := x.alignment;
  421. END;
  422. irv.SetPositionOrAlignment(x.fixed, align);
  423. meta.CheckTypeDeclaration(x.type);
  424. END;
  425. END VisitParameter;
  426. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  427. BEGIN
  428. Type(x.declaredType); (* => code in objects *)
  429. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  430. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  431. END;
  432. END VisitTypeDeclaration;
  433. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  434. BEGIN
  435. IF (SyntaxTree.Public * x.access # {}) THEN
  436. implementationVisitor.VisitConstant(x);
  437. END;
  438. END VisitConstant;
  439. PROCEDURE Scope(x: SyntaxTree.Scope);
  440. VAR procedure: SyntaxTree.Procedure;
  441. constant: SyntaxTree.Constant;
  442. variable: SyntaxTree.Variable;
  443. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  444. cell: SyntaxTree.CellType;
  445. parameter: SyntaxTree.Parameter;
  446. property: SyntaxTree.Property;
  447. BEGIN
  448. prevScope := currentScope;
  449. currentScope := x;
  450. (* constants treated in implementation visitor *)
  451. WITH x: SyntaxTree.CellScope DO
  452. cell := x.ownerCell;
  453. parameter := cell.firstParameter;
  454. WHILE parameter # NIL DO
  455. VisitParameter(parameter);
  456. parameter := parameter.nextParameter;
  457. END;
  458. property := cell.firstProperty;
  459. WHILE property # NIL DO
  460. VisitProperty(property);
  461. property := property.nextProperty;
  462. END;
  463. ELSE
  464. END;
  465. typeDeclaration := x.firstTypeDeclaration;
  466. WHILE typeDeclaration # NIL DO
  467. VisitTypeDeclaration(typeDeclaration);
  468. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  469. END;
  470. variable := x.firstVariable;
  471. WHILE variable # NIL DO
  472. VisitVariable(variable);
  473. variable := variable.nextVariable;
  474. END;
  475. procedure := x.firstProcedure;
  476. WHILE procedure # NIL DO
  477. VisitProcedure(procedure);
  478. procedure := procedure.nextProcedure;
  479. END;
  480. constant := x.firstConstant;
  481. WHILE constant # NIL DO
  482. VisitConstant(constant);
  483. constant := constant.nextConstant;
  484. END;
  485. currentScope := prevScope;
  486. END Scope;
  487. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  488. VAR parameter: SyntaxTree.Parameter;
  489. BEGIN
  490. parameter := first;
  491. WHILE parameter # NIL DO
  492. VisitParameter(parameter);
  493. parameter := parameter.nextParameter;
  494. END;
  495. END Parameters;
  496. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  497. VAR scope: SyntaxTree.ProcedureScope;
  498. prevScope: SyntaxTree.Scope;
  499. inline, finalizer: BOOLEAN;
  500. procedureType: SyntaxTree.ProcedureType;
  501. pc: LONGINT;
  502. stackSize: LONGINT;
  503. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  504. null,size,src,dest,fp,res: IntermediateCode.Operand;
  505. cc: LONGINT;
  506. cellType: SyntaxTree.CellType;
  507. registerNumber: LONGINT;
  508. registerParameter: Backend.Registers;
  509. registerParameters: LONGINT;
  510. registerClass: IntermediateCode.RegisterClass;
  511. type: IntermediateCode.Type;
  512. formalParameter: SyntaxTree.Parameter;
  513. recordType: SyntaxTree.RecordType;
  514. isModuleBody: BOOLEAN;
  515. parametersSize: LONGINT;
  516. PROCEDURE Signature;
  517. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  518. BEGIN
  519. procedureType := x.type(SyntaxTree.ProcedureType);
  520. returnType := procedureType.returnType;
  521. IF returnType # NIL THEN
  522. meta.CheckTypeDeclaration(returnType)
  523. END;
  524. parameter := procedureType.firstParameter;
  525. WHILE parameter # NIL DO
  526. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  527. parameter := parameter.nextParameter;
  528. END;
  529. END Signature;
  530. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  531. VAR result: BOOLEAN;
  532. BEGIN
  533. result := FALSE;
  534. IF x = SyntaxTree.invalidExpression THEN
  535. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  536. result := TRUE;
  537. value := x.resolved(SyntaxTree.IntegerValue).value;
  538. ELSE
  539. Error(x.position,"expression is not an integer constant");
  540. END;
  541. RETURN result;
  542. END CheckIntegerValue;
  543. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  544. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  545. BEGIN
  546. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  547. WHILE (this # NIL) & (this.identifier # id) DO
  548. this := this.nextModifier;
  549. END;
  550. IF this # NIL THEN
  551. IF this.expression = NIL THEN
  552. Error(this.position,"expected expression value");
  553. ELSIF CheckIntegerValue(this.expression,value) THEN
  554. END;
  555. RETURN TRUE
  556. ELSE RETURN FALSE
  557. END;
  558. END HasValue;
  559. CONST DefaultDataMemorySize=512;
  560. BEGIN
  561. IF x.externalName # NIL THEN RETURN END;
  562. (*
  563. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  564. *)
  565. (* code section for this procedure *)
  566. scope := x.procedureScope;
  567. prevScope := currentScope;
  568. currentScope := scope;
  569. procedureType := x.type(SyntaxTree.ProcedureType);
  570. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  571. implementationVisitor.temporaries.Init;
  572. implementationVisitor.usedRegisters := NIL;
  573. implementationVisitor.registerUsageCount.Init;
  574. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  575. IF (scope.body # NIL) & (x.isInline) THEN
  576. inline := TRUE;
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  578. ir.SetExported(IsExported(x));
  579. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  580. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  581. IF backend.cellsAreObjects THEN
  582. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  583. ir.SetExported(IsExported(x));
  584. ELSE
  585. RETURN; (* cellnet cannot be compiled for final static hardware *)
  586. END;
  587. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  588. inline := FALSE;
  589. AddBodyCallStub(x);
  590. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  591. ir.SetExported(IsExported(x));
  592. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  593. inline := FALSE;
  594. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  595. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  596. AddBodyCallStub(x);
  597. AddStackAllocation(x,stackSize);
  598. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  599. ir.SetExported(IsExported(x));
  600. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  601. inline := FALSE;
  602. Parameters(procedureType.firstParameter);
  603. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  604. ir.SetExported(IsExported(x));
  605. ELSE
  606. inline := FALSE;
  607. IF x.isEntry OR x.isExit THEN
  608. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  609. ir.SetExported(TRUE);
  610. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  611. ELSE
  612. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  613. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  614. END;
  615. END;
  616. cc := procedureType.callingConvention;
  617. IF cc = SyntaxTree.WinAPICallingConvention THEN
  618. parametersSize := ProcedureParametersSize(backend.system,x);
  619. ELSE
  620. parametersSize := 0;
  621. END;
  622. IF scope.body # NIL THEN
  623. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  624. registerNumber := 0;
  625. IF ~inline THEN
  626. IF scope.lastVariable = NIL THEN
  627. stackSize := 0
  628. ELSE
  629. stackSize := scope.lastVariable.offsetInBits;
  630. IF stackSize <0 THEN stackSize := -stackSize END;
  631. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  632. END;
  633. (*
  634. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  635. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  636. *)
  637. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  638. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  639. END;
  640. pc := ir.pc-1;
  641. (*
  642. ir.Emit(Nop(position)); (* placeholder for fill *)
  643. *)
  644. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  645. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  646. IF registerParameter = NIL THEN registerParameters := 0
  647. ELSE registerParameters := LEN(registerParameter)
  648. END;
  649. formalParameter := procedureType.lastParameter;
  650. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  651. IF ~PassInRegister(formalParameter) THEN
  652. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  653. ELSE
  654. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  655. type := GetType(system, formalParameter.type);
  656. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  657. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  658. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  659. implementationVisitor.ReleaseIntermediateOperand(src);
  660. INC(registerNumber);
  661. formalParameter := formalParameter.prevParameter;
  662. END;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  677. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  678. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  679. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  680. ir.EmitAt(pc,Push(size));
  681. implementationVisitor.StaticCallOperand(result,procedure);
  682. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  683. END;
  684. *)
  685. END;
  686. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  687. IF stackSize > 0 THEN
  688. IF (stackSize MOD system.addressSize = 0) THEN
  689. null := IntermediateCode.Immediate(addressType,0);
  690. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  691. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  692. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  693. ELSE
  694. null := IntermediateCode.Immediate(int8,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  698. END;
  699. (*! should potentially be called by backend -- enter might initialize
  700. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  701. *)
  702. END;
  703. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  704. parametersSize := ProcedureParametersSize(backend.system,x);
  705. ELSE
  706. parametersSize := 0;
  707. END;
  708. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  709. finalizer := FALSE;
  710. IF backend.cooperative & x.isFinalizer THEN
  711. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  712. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  713. GetRecordTypeName(recordType,name);
  714. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  715. END;
  716. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  717. IF backend.cooperative THEN
  718. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  719. IF implementationVisitor.profile & ~isModuleBody THEN
  720. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  721. END;
  722. END;
  723. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  724. IF finalizer THEN
  725. IF backend.hasLinkRegister THEN
  726. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  727. END;
  728. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  729. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  730. ir.Emit(Br(x.position,dest));
  731. ELSE
  732. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  733. END;
  734. ELSE
  735. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  736. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  737. END;
  738. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  739. IF backend.cooperative THEN
  740. IF HasPointers (scope) THEN
  741. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  742. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  743. ir.Emit(Result(x.position, res));
  744. ir.Emit(Push(x.position, res));
  745. implementationVisitor.ResetVariables(scope);
  746. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  747. ir.Emit(Pop(x.position, res));
  748. ir.Emit(Return(x.position, res));
  749. ELSE
  750. implementationVisitor.ResetVariables(scope);
  751. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  752. END;
  753. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  754. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  755. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  756. ir.Emit(Result(x.position, res));
  757. ir.Emit(Push(x.position, res));
  758. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  759. ir.Emit(Pop(x.position, res));
  760. ir.Emit(Return(x.position, res));
  761. ELSE
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. END;
  764. END;
  765. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  766. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  767. ELSE
  768. ir.Emit(Nop(x.position));
  769. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  770. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  771. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  772. END;
  773. END;
  774. END
  775. END;
  776. ELSE (* force body for procedures *)
  777. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  778. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  779. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  780. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  781. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  782. END;
  783. Scope(scope);
  784. Signature;
  785. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  786. currentScope := prevScope;
  787. END Procedure;
  788. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  789. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  790. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  791. BEGIN
  792. ASSERT (bodyProcedure # NIL);
  793. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  794. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  795. procedure.SetScope(bodyProcedure.scope);
  796. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  797. procedure.SetAccess(SyntaxTree.Hidden);
  798. Global.GetSymbolSegmentedName (procedure,name);
  799. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  800. ir.SetExported(TRUE);
  801. ir.SetPriority(InitPriority);
  802. Global.GetSymbolSegmentedName (bodyProcedure,name);
  803. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  804. implementationVisitor.currentScope := module.module.moduleScope;
  805. implementationVisitor.section := ir;
  806. implementationVisitor.PushSelfPointer();
  807. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  808. ELSIF backend.preregisterStatic THEN
  809. implementationVisitor.currentScope := module.module.moduleScope;
  810. implementationVisitor.section := ir;
  811. implementationVisitor.PushSelfPointer();
  812. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  813. ELSE
  814. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  815. ir.Emit(Call(bodyProcedure.position,op, 0));
  816. END;
  817. END AddBodyCallStub;
  818. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  819. VAR name: Basic.SegmentedName;
  820. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  821. BEGIN
  822. Global.GetSymbolSegmentedName (symbol,name);
  823. Basic.RemoveSuffix(name);
  824. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  825. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  826. ir.SetExported(TRUE);
  827. ir.SetPriority(FirstPriority);
  828. IntermediateCode.InitImmediate(op,addressType,initStack);
  829. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  830. END AddStackAllocation;
  831. (** entry function to visit a complete module *)
  832. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  833. VAR
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  835. hasDynamicOperatorDeclarations: BOOLEAN;
  836. operator: SyntaxTree.Operator;
  837. import: SyntaxTree.Import;
  838. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  839. BEGIN
  840. type := type.resolved;
  841. IF type IS SyntaxTree.RecordType THEN
  842. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  843. ELSIF (type IS SyntaxTree.ArrayType) THEN
  844. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  845. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  846. END;
  847. ELSIF type IS SyntaxTree.MathArrayType THEN
  848. WITH type: SyntaxTree.MathArrayType DO
  849. IF type.form = SyntaxTree.Open THEN
  850. RETURN TRUE
  851. ELSIF type.form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  853. END;
  854. END;
  855. END;
  856. RETURN FALSE
  857. END TypeNeedsInitialization;
  858. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  859. VAR variable: SyntaxTree.Variable;
  860. BEGIN
  861. variable := scope.firstVariable;
  862. WHILE variable # NIL DO
  863. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  864. IF variable.initializer # NIL THEN RETURN TRUE END;
  865. variable := variable.nextVariable;
  866. END;
  867. RETURN FALSE
  868. END ScopeNeedsInitialization;
  869. BEGIN
  870. ASSERT(x # NIL); ASSERT(module # NIL);
  871. SELF.module := module;
  872. (* add import names to the generated Sections.Module *)
  873. import := x.moduleScope.firstImport;
  874. WHILE import # NIL DO
  875. import.module.GetName(idstr);
  876. module.imports.AddName(idstr);
  877. import := import.nextImport
  878. END;
  879. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  880. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  881. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  882. moduleSelf.SetType(system.anyType);
  883. moduleSelf.SetScope(x.moduleScope);
  884. moduleSelf.SetUntraced(TRUE);
  885. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  886. ir.SetExported(TRUE);
  887. IntermediateCode.InitImmediate(op,addressType,0);
  888. ir.Emit(Data(Basic.invalidPosition,op));
  889. END;
  890. implementationVisitor.module := module;
  891. implementationVisitor.moduleScope := x.moduleScope;
  892. implementationVisitor.moduleSelf := moduleSelf;
  893. implementationVisitor.canBeLoaded := TRUE;
  894. meta.SetModule(module);
  895. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  896. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  897. END;
  898. IF backend.profile THEN
  899. EnsureBodyProcedure(x.moduleScope);
  900. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  901. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  902. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  903. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  904. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  905. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  906. Global.GetModuleName(module.module,idstr);
  907. implementationVisitor.ProfilerAddModule(idstr);
  908. implementationVisitor.numberProcedures := 0;
  909. END;
  910. implementationVisitor.profile := backend.profile;
  911. (* check if there is at least one dynamic operator locally defined *)
  912. hasDynamicOperatorDeclarations := FALSE;
  913. operator := x.moduleScope.firstOperator;
  914. WHILE operator # NIL DO
  915. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  916. operator := operator.nextOperator
  917. END;
  918. (* add operator initialization code section *)
  919. IF hasDynamicOperatorDeclarations THEN
  920. EnsureBodyProcedure(x.moduleScope);
  921. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  922. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  923. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  924. END;
  925. Scope(x.moduleScope);
  926. IF hasDynamicOperatorDeclarations THEN
  927. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  928. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  929. END;
  930. IF backend.profile THEN
  931. implementationVisitor.ProfilerPatchInit;
  932. END;
  933. END Module;
  934. END DeclarationVisitor;
  935. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  936. RegisterUsageCount*=OBJECT
  937. VAR used: UsedArray; count: LONGINT;
  938. PROCEDURE &Init;
  939. VAR i: LONGINT;
  940. BEGIN
  941. count := 0;
  942. IF used = NIL THEN NEW(used,64); END;
  943. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  944. END Init;
  945. PROCEDURE Grow;
  946. VAR new: UsedArray; size,i: LONGINT;
  947. BEGIN
  948. size := LEN(used)*2;
  949. NEW(new,size);
  950. FOR i := 0 TO LEN(used)-1 DO
  951. new[i].count := used[i].count;
  952. new[i].type := used[i].type;
  953. new[i].map := used[i].map
  954. END;
  955. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  956. used := new
  957. END Grow;
  958. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  959. BEGIN
  960. INC(count);
  961. IF count = LEN(used) THEN Grow END;
  962. used[count].type := type;
  963. used[count].class := class;
  964. used[count].map := count;
  965. RETURN count;
  966. END Next;
  967. PROCEDURE IncUse(register: LONGINT);
  968. BEGIN
  969. INC(used[register].count);
  970. (*
  971. IF (register = 1) & (count > 30) THEN
  972. D.TraceBack;
  973. END;
  974. *)
  975. END IncUse;
  976. PROCEDURE DecUse(register: LONGINT);
  977. BEGIN
  978. DEC(used[register].count);
  979. END DecUse;
  980. PROCEDURE Map(register: LONGINT): LONGINT;
  981. VAR map : LONGINT;
  982. BEGIN
  983. IF register > 0 THEN
  984. map := used[register].map;
  985. WHILE register # map DO register := map; map := used[register].map END;
  986. END;
  987. RETURN register
  988. END Map;
  989. PROCEDURE Use(register: LONGINT): LONGINT;
  990. BEGIN
  991. IF register< LEN(used) THEN
  992. RETURN used[register].count
  993. ELSE
  994. RETURN 0
  995. END
  996. END Use;
  997. END RegisterUsageCount;
  998. RegisterEntry = POINTER TO RECORD
  999. prev,next: RegisterEntry;
  1000. register: LONGINT;
  1001. registerClass: IntermediateCode.RegisterClass;
  1002. type: IntermediateCode.Type;
  1003. END;
  1004. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1005. Variables = OBJECT (Basic.List)
  1006. VAR
  1007. inUse: VariableUse;
  1008. registerIndex: LONGINT;
  1009. PROCEDURE & Init;
  1010. VAR i: LONGINT;
  1011. BEGIN
  1012. InitList(16);
  1013. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1014. registerIndex := 1024;
  1015. END Init;
  1016. PROCEDURE GetUsage(VAR use: VariableUse);
  1017. BEGIN
  1018. use := inUse;
  1019. END GetUsage;
  1020. PROCEDURE SetUsage(CONST use: VariableUse);
  1021. BEGIN
  1022. inUse := use;
  1023. END SetUsage;
  1024. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1025. VAR any: ANY;
  1026. BEGIN
  1027. any := Get(i);;
  1028. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1029. END GetVariable;
  1030. PROCEDURE Occupy(pos: LONGINT);
  1031. BEGIN
  1032. INCL(inUse[pos DIV 32], pos MOD 32);
  1033. END Occupy;
  1034. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1035. BEGIN
  1036. Occupy(Length());
  1037. Add(v);
  1038. END AddVariable;
  1039. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1040. BEGIN
  1041. t1 := t1.resolved;
  1042. t2 := t2.resolved;
  1043. RETURN
  1044. (t1.SameType(t2))
  1045. OR
  1046. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1047. OR
  1048. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1049. OR
  1050. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1051. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1052. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1053. OR
  1054. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1055. (DynamicDim(t1) = DynamicDim(t2))
  1056. );
  1057. END CompatibleType;
  1058. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1059. VAR var : SyntaxTree.Variable;
  1060. BEGIN
  1061. FOR pos := 0 TO Length()-1 DO
  1062. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1063. var := GetVariable(pos);
  1064. IF CompatibleType(type, var.type) & (var.untraced = untraced) THEN
  1065. var.SetType(type);
  1066. Occupy(pos); RETURN var
  1067. END;
  1068. END;
  1069. END;
  1070. pos := Length();
  1071. RETURN NIL
  1072. END GetFreeVariable;
  1073. END Variables;
  1074. SymbolMap = POINTER TO RECORD
  1075. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1076. isAddress: BOOLEAN;
  1077. END;
  1078. SymbolMapper = OBJECT
  1079. VAR
  1080. first: SymbolMap;
  1081. PROCEDURE & Init;
  1082. BEGIN
  1083. first := NIL;
  1084. END Init;
  1085. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1086. VAR new: SymbolMap;
  1087. BEGIN
  1088. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1089. new.next := first; first := new;
  1090. END Add;
  1091. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1092. VAR s: SymbolMap;
  1093. BEGIN
  1094. s := first;
  1095. WHILE (s # NIL) & (s.this # this) DO
  1096. s := s.next
  1097. END;
  1098. RETURN s
  1099. END Get;
  1100. END SymbolMapper;
  1101. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1102. VAR
  1103. system: Global.System;
  1104. section: IntermediateCode.Section;
  1105. module: Sections.Module;
  1106. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1107. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1108. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1109. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1110. checker: SemanticChecker.Checker;
  1111. backend: IntermediateBackend;
  1112. meta: MetaDataGenerator;
  1113. position: Position;
  1114. moduleSelf: SyntaxTree.Variable;
  1115. (* variables for hand over of variables / temporary state *)
  1116. currentScope: SyntaxTree.Scope;
  1117. constantDeclaration : SyntaxTree.Symbol;
  1118. result: Operand; (* result of the most recent expression / statement *)
  1119. destination: IntermediateCode.Operand;
  1120. arrayDestinationTag: IntermediateCode.Operand;
  1121. arrayDestinationDimension:LONGINT;
  1122. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1123. conditional: BOOLEAN;
  1124. trueLabel, falseLabel, exitLabel: Label;
  1125. locked: BOOLEAN;
  1126. (*
  1127. usedRegisters: Registers;
  1128. *)
  1129. registerUsageCount: RegisterUsageCount;
  1130. usedRegisters: RegisterEntry;
  1131. (* useful operands and types *)
  1132. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1133. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1134. commentPrintout: Printout.Printer;
  1135. dump: Streams.Writer;
  1136. tagsAvailable : BOOLEAN;
  1137. supportedInstruction: SupportedInstructionProcedure;
  1138. supportedImmediate: SupportedImmediateProcedure;
  1139. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1140. emitLabels: BOOLEAN;
  1141. runtimeModuleName : SyntaxTree.IdentifierString;
  1142. newObjectFile: BOOLEAN;
  1143. indexCounter: LONGINT;
  1144. profile: BOOLEAN;
  1145. profileId, profileInit: IntermediateCode.Section;
  1146. profileInitPatchPosition: LONGINT;
  1147. numberProcedures: LONGINT;
  1148. procedureResultDesignator : SyntaxTree.Designator;
  1149. operatorInitializationCodeSection: IntermediateCode.Section;
  1150. fingerPrinter: FingerPrinter.FingerPrinter;
  1151. temporaries: Variables;
  1152. canBeLoaded : BOOLEAN;
  1153. currentIsInline: BOOLEAN;
  1154. currentMapper: SymbolMapper;
  1155. currentInlineExit: Label;
  1156. moduleBodySection: IntermediateCode.Section;
  1157. NeedDescriptor : BOOLEAN;
  1158. cooperativeSwitches: BOOLEAN;
  1159. lastSwitchPC: LONGINT;
  1160. isUnchecked: BOOLEAN;
  1161. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1162. newObjectFile: BOOLEAN);
  1163. BEGIN
  1164. SELF.system := system;
  1165. SELF.runtimeModuleName := runtime;
  1166. currentScope := NIL;
  1167. hiddenPointerType := NIL;
  1168. delegatePointerType := NIL;
  1169. awaitProcCounter := 0;
  1170. labelId := 0; constId := 0; labelId := 0;
  1171. SELF.checker := checker;
  1172. SELF.backend := backend;
  1173. position := Basic.invalidPosition;
  1174. conditional := FALSE;
  1175. locked := FALSE;
  1176. InitOperand(result,ModeUndefined);
  1177. addressType := IntermediateCode.GetType(system,system.addressType);
  1178. setType := IntermediateCode.GetType(system,system.setType);
  1179. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1180. byteType := IntermediateCode.GetType(system, system.byteType);
  1181. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1182. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1183. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1184. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1185. nil := IntermediateCode.Immediate(addressType,0);
  1186. one := IntermediateCode.Immediate(addressType,1);
  1187. IntermediateCode.InitOperand(destination);
  1188. tagsAvailable := TRUE;
  1189. supportedInstruction := supportedInstructionProcedure;
  1190. supportedImmediate := supportedImmediateProcedure;
  1191. inData := FALSE;
  1192. SELF.emitLabels := emitLabels;
  1193. IntermediateCode.InitOperand(arrayDestinationTag);
  1194. bool := IntermediateCode.GetType(system,system.booleanType);
  1195. IntermediateCode.InitImmediate(false,bool,0);
  1196. IntermediateCode.InitImmediate(true,bool,1);
  1197. SELF.newObjectFile := newObjectFile;
  1198. indexCounter := 0;
  1199. NEW(registerUsageCount);
  1200. usedRegisters := NIL;
  1201. procedureResultDesignator := NIL;
  1202. NEW(fingerPrinter);
  1203. NEW(temporaries);
  1204. currentIsInline := FALSE;
  1205. NeedDescriptor := FALSE;
  1206. isUnchecked := backend.noRuntimeChecks;
  1207. END Init;
  1208. TYPE Context = RECORD
  1209. section: IntermediateCode.Section;
  1210. registerUsageCount: RegisterUsageCount;
  1211. usedRegisters: RegisterEntry;
  1212. END;
  1213. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1214. VAR context: Context;
  1215. BEGIN
  1216. context.section := section;
  1217. context.registerUsageCount := registerUsageCount;
  1218. context.usedRegisters := usedRegisters;
  1219. section := new;
  1220. NEW(registerUsageCount);
  1221. usedRegisters := NIL;
  1222. RETURN context;
  1223. END SwitchContext;
  1224. PROCEDURE ReturnToContext(context: Context);
  1225. BEGIN
  1226. section := context.section;
  1227. registerUsageCount := context.registerUsageCount;
  1228. usedRegisters := context.usedRegisters;
  1229. END ReturnToContext;
  1230. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1231. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1232. BEGIN
  1233. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1234. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1235. END;
  1236. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1237. section.SetExported(IsExported(syntaxTreeSymbol));
  1238. RETURN section
  1239. END NewSection;
  1240. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1241. VAR new: LONGINT;
  1242. BEGIN
  1243. new := registerUsageCount.Next(type,class);
  1244. UseRegister(new);
  1245. RETURN new
  1246. END AcquireRegister;
  1247. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1248. VAR
  1249. fingerPrint: SyntaxTree.FingerPrint;
  1250. fingerPrintString: ARRAY 32 OF CHAR;
  1251. BEGIN
  1252. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1253. string := "[";
  1254. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1255. Strings.Append(string, fingerPrintString);
  1256. Strings.Append(string, "]");
  1257. END GetFingerprintString;
  1258. (** get the name for the code section that represens a certain symbol
  1259. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1260. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1261. VAR string: ARRAY 32 OF CHAR;
  1262. BEGIN
  1263. Global.GetSymbolSegmentedName(symbol, name);
  1264. (* if the symbol is an operator, then append the fingerprint to the name *)
  1265. IF symbol IS SyntaxTree.Operator THEN
  1266. GetFingerprintString(symbol, string);
  1267. Basic.AppendToSegmentedName(name,string);
  1268. END
  1269. END GetCodeSectionNameForSymbol;
  1270. (** get the name for the code section that represens a certain symbol
  1271. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1272. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1273. VAR string: ARRAY 32 OF CHAR;
  1274. BEGIN
  1275. Global.GetSymbolNameInScope(symbol, scope, name);
  1276. (* if the symbol is an operator, then append the fingerprint to the name *)
  1277. IF symbol IS SyntaxTree.Operator THEN
  1278. GetFingerprintString(symbol, string);
  1279. Strings.Append(name, string);
  1280. END
  1281. END GetCodeSectionNameForSymbolInScope;
  1282. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1283. BEGIN
  1284. IF dump # NIL THEN
  1285. dump.String("enter "); dump.String(s); dump.Ln;
  1286. END;
  1287. END TraceEnter;
  1288. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1289. BEGIN
  1290. IF dump # NIL THEN
  1291. dump.String("exit "); dump.String(s); dump.Ln;
  1292. END;
  1293. END TraceExit;
  1294. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1295. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1296. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1297. VAR i: LONGINT;
  1298. BEGIN
  1299. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1300. IF op.rule # NIL THEN
  1301. FOR i := 0 TO LEN(op.rule)-1 DO
  1302. CheckRegister(op.rule[i])
  1303. END;
  1304. END;
  1305. END CheckRegister;
  1306. BEGIN
  1307. CheckRegister(instruction.op1);
  1308. CheckRegister(instruction.op2);
  1309. CheckRegister(instruction.op3);
  1310. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1311. ELSE section.Emit(instruction);
  1312. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1313. END;
  1314. END Emit;
  1315. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1316. BEGIN
  1317. IF backend.cooperative THEN
  1318. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1319. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1320. ELSE
  1321. Emit(Trap(position,trapNo));
  1322. END;
  1323. END EmitTrap;
  1324. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1325. VAR name: Basic.SegmentedName;
  1326. VAR op1, op2, reg: IntermediateCode.Operand;
  1327. VAR call, nocall: Label;
  1328. VAR parametersSize: LONGINT;
  1329. VAR prevSection: IntermediateCode.Section;
  1330. VAR prevDump: Streams.Writer;
  1331. VAR body: SyntaxTree.Body;
  1332. VAR procedureType: SyntaxTree.ProcedureType;
  1333. BEGIN
  1334. IF procedure # NIL THEN
  1335. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1336. ELSE procedureType := NIL;
  1337. END;
  1338. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1339. prevSection := SELF.section;
  1340. SELF.section := section;
  1341. prevDump := dump;
  1342. dump := section.comments;
  1343. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1344. IF backend.hasLinkRegister THEN
  1345. Emit(Push(Basic.invalidPosition, lr));
  1346. END;
  1347. Emit(Push(Basic.invalidPosition,fp));
  1348. IF procedure # NIL THEN
  1349. body := procedure.procedureScope.body;
  1350. ELSE
  1351. body := NIL;
  1352. END;
  1353. IF backend.cooperative THEN
  1354. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1355. GetCodeSectionNameForSymbol(procedure, name);
  1356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1357. ELSE
  1358. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1359. END;
  1360. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1361. Emit(Push(Basic.invalidPosition,op1));
  1362. Emit(Mov(Basic.invalidPosition,fp, sp));
  1363. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1364. NEW(call, section);
  1365. NEW(nocall, section);
  1366. reg := NewRegisterOperand(addressType);
  1367. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1368. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1369. BrltL(call, sp, reg);
  1370. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1371. BrgeL(nocall, sp, op2);
  1372. call.Resolve(section.pc);
  1373. Emit(Push(Basic.invalidPosition, reg));
  1374. ReleaseIntermediateOperand(reg);
  1375. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1376. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1377. Emit(Push(Basic.invalidPosition, op2));
  1378. CallThis(position, "Activities","ExpandStack",2);
  1379. Emit(Result(Basic.invalidPosition, sp));
  1380. nocall.Resolve(section.pc);
  1381. END;
  1382. ELSE
  1383. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1384. Emit(Push(Basic.invalidPosition, one)) ;
  1385. procedureType.SetParametersOffset(1);
  1386. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1387. END;
  1388. Emit(Mov(Basic.invalidPosition, fp, sp));
  1389. END;
  1390. END;
  1391. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1392. SELF.section := prevSection;
  1393. dump := prevDump;
  1394. END EmitEnter;
  1395. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1396. VAR op1,op2: IntermediateCode.Operand;
  1397. VAR instruction: IntermediateCode.Instruction;
  1398. BEGIN
  1399. IntermediateCode.InitNumber(op1,callconv);
  1400. IntermediateCode.InitNumber(op2,varSize);
  1401. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1402. RETURN instruction
  1403. END Enter;
  1404. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1405. VAR op1: IntermediateCode.Operand;
  1406. VAR instruction: IntermediateCode.Instruction;
  1407. BEGIN
  1408. IntermediateCode.InitNumber(op1,callconv);
  1409. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1410. RETURN instruction
  1411. END Leave;
  1412. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1413. VAR prevSection: IntermediateCode.Section;
  1414. VAR op2, size: IntermediateCode.Operand;
  1415. VAR body: SyntaxTree.Body;
  1416. BEGIN
  1417. prevSection := SELF.section;
  1418. SELF.section := section;
  1419. Emit(Leave(position, callconv));
  1420. IF procedure # NIL THEN
  1421. body := procedure.procedureScope.body;
  1422. ELSE
  1423. body := NIL;
  1424. END;
  1425. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1426. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1427. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1428. Emit(Add(position, sp, fp, op2));
  1429. ELSE
  1430. Emit(Mov(position, sp, fp));
  1431. END;
  1432. Emit(Pop(position, fp));
  1433. END;
  1434. SELF.section := prevSection;
  1435. END EmitLeave;
  1436. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1437. VAR m: SymbolMap;
  1438. BEGIN
  1439. position := x.position;
  1440. IF currentIsInline THEN
  1441. m := currentMapper.Get(x);
  1442. IF m # NIL THEN
  1443. (*
  1444. Printout.Info("mapping from", x);
  1445. Printout.Info("mapping to ", m.to);
  1446. *)
  1447. m.to.Accept(SELF);
  1448. op := result;
  1449. IF m.tag # NIL THEN
  1450. ReleaseIntermediateOperand(result.tag);
  1451. m.tag.Accept(SELF);
  1452. op.tag := result.op;
  1453. ReleaseIntermediateOperand(result.tag);
  1454. END;
  1455. RETURN
  1456. END;
  1457. END;
  1458. x.Accept(SELF);
  1459. op := result;
  1460. END Symbol;
  1461. PROCEDURE Expression(x: SyntaxTree.Expression);
  1462. BEGIN
  1463. position := x.position;
  1464. constantDeclaration := NIL;
  1465. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1466. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1467. END;
  1468. IF x.resolved # NIL THEN
  1469. x.resolved.Accept(SELF)
  1470. ELSE
  1471. x.Accept(SELF)
  1472. END;
  1473. (* check this, was commented out in ActiveCells3 *)
  1474. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1475. Error(x.position, "unsupported modifier");
  1476. END;
  1477. END Expression;
  1478. (*
  1479. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1480. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1481. BEGIN
  1482. temporaries.GetUsage(current);
  1483. FOR i := 0 TO LEN(current)-1 DO
  1484. set := current[i] - previous[i];
  1485. IF set # {} THEN
  1486. FOR j := 0 TO MAX(SET)-1 DO
  1487. IF j IN set THEN
  1488. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1489. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1490. Symbol(variable, op);
  1491. MakeMemory(tmp,op.op,addressType,0);
  1492. ReleaseOperand(op);
  1493. Emit(Mov(position,tmp, nil ) );
  1494. ReleaseIntermediateOperand(tmp);
  1495. END;
  1496. END;
  1497. END;
  1498. END;
  1499. END;
  1500. END ResetUsedTemporaries;
  1501. *)
  1502. PROCEDURE Statement(x: SyntaxTree.Statement);
  1503. VAR use: VariableUse;
  1504. BEGIN
  1505. temporaries.GetUsage(use);
  1506. position := x.position;
  1507. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1508. IF commentPrintout # NIL THEN
  1509. commentPrintout.Statement(x);
  1510. dump.Ln;
  1511. (*dump.Update;*)
  1512. END;
  1513. x.Accept(SELF);
  1514. (*
  1515. CheckRegistersFree();
  1516. *)
  1517. (*ResetUsedTemporaries(use);*)
  1518. temporaries.SetUsage(use);
  1519. END Statement;
  1520. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1521. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1522. *)
  1523. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1524. BEGIN
  1525. ASSERT(op.mode # IntermediateCode.Undefined);
  1526. IF op.mode = IntermediateCode.ModeMemory THEN
  1527. ReuseCopy(res,op);
  1528. ELSE
  1529. res := op;
  1530. UseIntermediateOperand(res);
  1531. END;
  1532. IntermediateCode.AddOffset(res,offset);
  1533. IntermediateCode.MakeMemory(res,type);
  1534. END MakeMemory;
  1535. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1536. VAR mem: IntermediateCode.Operand;
  1537. BEGIN
  1538. MakeMemory(mem,res,type,offset);
  1539. ReleaseIntermediateOperand(res);
  1540. res := mem;
  1541. END ToMemory;
  1542. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1543. VAR mem: IntermediateCode.Operand;
  1544. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1545. componentType: SyntaxTree.Type;
  1546. BEGIN
  1547. type := type.resolved;
  1548. IF operand.mode = ModeReference THEN
  1549. IF type IS SyntaxTree.RangeType THEN
  1550. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1551. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1552. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1553. ReleaseOperand(operand);
  1554. operand.op := firstOp;
  1555. operand.tag := lastOp;
  1556. operand.extra := stepOp;
  1557. ELSIF type IS SyntaxTree.ComplexType THEN
  1558. componentType := type(SyntaxTree.ComplexType).componentType;
  1559. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1560. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1561. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1562. ReleaseOperand(operand);
  1563. operand.op := firstOp;
  1564. operand.tag := lastOp
  1565. ELSE
  1566. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1567. ReleaseIntermediateOperand(operand.op);
  1568. operand.op := mem;
  1569. END;
  1570. operand.mode := ModeValue;
  1571. END;
  1572. ASSERT(operand.mode = ModeValue);
  1573. END LoadValue;
  1574. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1575. VAR prevConditional: BOOLEAN;
  1576. BEGIN
  1577. prevConditional := conditional;
  1578. conditional := FALSE;
  1579. InitOperand(result, ModeUndefined);
  1580. Expression(x);
  1581. op := result;
  1582. LoadValue(op,x.type.resolved);
  1583. conditional := prevConditional;
  1584. END Evaluate;
  1585. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1586. VAR prevConditional: BOOLEAN;
  1587. BEGIN
  1588. prevConditional := conditional;
  1589. conditional := FALSE;
  1590. InitOperand(result,ModeUndefined);
  1591. Expression(x);
  1592. op := result;
  1593. (*
  1594. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1595. *)
  1596. conditional := prevConditional;
  1597. END Designate;
  1598. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1599. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1600. BEGIN
  1601. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1602. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1603. conditional := TRUE;
  1604. trueLabel := trueL; falseLabel := falseL;
  1605. Expression(x);
  1606. trueL := trueLabel; falseL := falseLabel;
  1607. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1608. END Condition;
  1609. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1610. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1611. BEGIN
  1612. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1613. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1614. RETURN op
  1615. END NewRegisterOperand;
  1616. PROCEDURE UnuseRegister(register: LONGINT);
  1617. BEGIN
  1618. IF (register > 0) THEN
  1619. register := registerUsageCount.Map(register);
  1620. registerUsageCount.DecUse(register);
  1621. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1622. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1623. END;
  1624. IF registerUsageCount.Use(register)=0 THEN
  1625. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1626. Warning(position, "register cannot be removed");
  1627. END;
  1628. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1629. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1630. END;
  1631. ELSIF registerUsageCount.Use(register)<0 THEN
  1632. Warning(position, "register removed too often");
  1633. IF dump # NIL THEN
  1634. dump.String("register removed too often"); dump.Ln; dump.Update;
  1635. END;
  1636. END;
  1637. END;
  1638. END UnuseRegister;
  1639. PROCEDURE UseRegister(register: LONGINT);
  1640. BEGIN
  1641. IF (register > 0) THEN
  1642. register := registerUsageCount.Map(register);
  1643. registerUsageCount.IncUse(register);
  1644. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1645. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1646. END;
  1647. IF registerUsageCount.Use(register)=1 THEN
  1648. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1649. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1650. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1651. END;
  1652. END;
  1653. END;
  1654. END UseRegister;
  1655. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1656. BEGIN
  1657. UnuseRegister(op.register)
  1658. END ReleaseIntermediateOperand;
  1659. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1660. BEGIN
  1661. UseRegister(op.register)
  1662. END UseIntermediateOperand;
  1663. PROCEDURE ReleaseOperand(CONST op: Operand);
  1664. BEGIN
  1665. UnuseRegister(op.op.register);
  1666. UnuseRegister(op.tag.register);
  1667. UnuseRegister(op.extra.register);
  1668. END ReleaseOperand;
  1669. (* save registers marked in array "markedRegisters" to the stack
  1670. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1671. *)
  1672. PROCEDURE SaveRegisters();
  1673. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1674. BEGIN
  1675. entry := usedRegisters;
  1676. WHILE entry # NIL DO
  1677. type := registerUsageCount.used[entry.register].type;
  1678. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1679. Emit(Push(position,op));
  1680. entry := entry.next;
  1681. END;
  1682. END SaveRegisters;
  1683. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1684. BEGIN
  1685. saved := usedRegisters;
  1686. usedRegisters := NIL;
  1687. END ReleaseUsedRegisters;
  1688. (** remove parameter registers from used queue *)
  1689. PROCEDURE ReleaseParameterRegisters;
  1690. VAR entry,prev,next: RegisterEntry;
  1691. BEGIN
  1692. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1693. WHILE entry # NIL DO
  1694. next := entry.next;
  1695. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1696. registerUsageCount.DecUse(entry.register);
  1697. ASSERT(registerUsageCount.Use(entry.register)=0);
  1698. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1699. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1700. END;
  1701. ELSIF prev = NIL THEN
  1702. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1703. ELSE
  1704. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1705. END;
  1706. entry := next;
  1707. END;
  1708. END ReleaseParameterRegisters;
  1709. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1710. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1711. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1712. BEGIN
  1713. entry := saved;
  1714. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1715. entry := prev;
  1716. WHILE entry # NIL DO
  1717. prev := entry.prev;
  1718. type := entry.type;
  1719. class := entry.registerClass;
  1720. IntermediateCode.InitRegister(op,type,class,entry.register);
  1721. (*
  1722. new := registerUsageCount.Next(type,class);
  1723. registerUsageCount.Remap(entry.register,new);
  1724. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1725. dump.String("remap register "); dump.Int(entry.register,1);
  1726. dump.String("to "); dump.Int(new,1);
  1727. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1728. END;
  1729. entry.register := new;
  1730. *)
  1731. Emit(Pop(position,op));
  1732. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1733. entry := prev;
  1734. END;
  1735. (*
  1736. usedRegisters := saved;
  1737. *)
  1738. END RestoreRegisters;
  1739. PROCEDURE CheckRegistersFree;
  1740. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1741. BEGIN
  1742. IF usedRegisters # NIL THEN
  1743. r := usedRegisters;
  1744. WHILE r # NIL DO
  1745. warning := "register ";
  1746. Strings.AppendInt(warning, r.register);
  1747. Strings.Append(warning, " not released.");
  1748. Warning(position,warning);
  1749. r := r .next;
  1750. END;
  1751. END;
  1752. FOR i := 0 TO registerUsageCount.count-1 DO
  1753. IF registerUsageCount.used[i].count < 0 THEN
  1754. warning := "register ";
  1755. Strings.AppendInt(warning, i);
  1756. Strings.Append(warning, " unused too often.");
  1757. Warning(position,warning);
  1758. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1759. warning := "register ";
  1760. Strings.AppendInt(warning, i);
  1761. Strings.Append(warning, " not unused often enough.");
  1762. Warning(position,warning);
  1763. END;
  1764. END;
  1765. END CheckRegistersFree;
  1766. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1767. Otherwise allocate a new register.
  1768. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1769. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1770. BEGIN
  1771. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1772. UseIntermediateOperand(result);
  1773. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1774. UseIntermediateOperand(result);
  1775. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1776. END;
  1777. END Reuse2;
  1778. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1779. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1780. If not then allocate a new register.
  1781. Does NOT necessarily keep the content of src1 or src2 in result!
  1782. *)
  1783. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1784. BEGIN
  1785. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1786. UseIntermediateOperand(result);
  1787. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1788. UseIntermediateOperand(result);
  1789. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1790. result := alternative; alternative := emptyOperand;
  1791. UseIntermediateOperand(result);
  1792. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1793. END;
  1794. END Reuse2a;
  1795. (* like reuse2 but only one source *)
  1796. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1797. BEGIN
  1798. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1799. UseIntermediateOperand(result);
  1800. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1801. END;
  1802. END Reuse1;
  1803. (* like reuse2a but only one source *)
  1804. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1805. BEGIN
  1806. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1807. UseIntermediateOperand(result);
  1808. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1809. UseIntermediateOperand(result);
  1810. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1811. END;
  1812. END Reuse1a;
  1813. (* like reuse1 but guarantees that content of src1 is in result *)
  1814. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1815. BEGIN
  1816. IF ReusableRegister(src1) THEN
  1817. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1818. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1819. UseIntermediateOperand(result);
  1820. ELSE
  1821. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1822. Emit(Mov(position,result,src1));
  1823. END
  1824. END ReuseCopy;
  1825. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1826. BEGIN
  1827. IF ReusableRegister(src) THEN
  1828. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1829. ELSE
  1830. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1831. Emit(Mov(position,result,src));
  1832. ReleaseIntermediateOperand(src);
  1833. END
  1834. END TransferToRegister;
  1835. (** labels and branches **)
  1836. PROCEDURE NewLabel(): Label;
  1837. VAR label: Label;
  1838. BEGIN
  1839. NEW(label,section); RETURN label;
  1840. END NewLabel;
  1841. PROCEDURE SetLabel(label: Label);
  1842. BEGIN label.Resolve(section.pc);
  1843. END SetLabel;
  1844. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1845. BEGIN
  1846. ASSERT(label # NIL);
  1847. IF label.pc < 0 THEN (* label not yet set *)
  1848. label.AddFixup(section.pc);
  1849. END;
  1850. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1851. END LabelOperand;
  1852. PROCEDURE BrL(label: Label);
  1853. BEGIN
  1854. Emit(Br(position,LabelOperand(label)));
  1855. END BrL;
  1856. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1857. BEGIN
  1858. Emit(Brge(position,LabelOperand(label),left,right));
  1859. END BrgeL;
  1860. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1861. BEGIN
  1862. Emit(Brlt(position,LabelOperand(label),left,right));
  1863. END BrltL;
  1864. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1865. BEGIN
  1866. Emit(Breq(position,LabelOperand(label),left,right));
  1867. END BreqL;
  1868. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1869. BEGIN
  1870. Emit(Brne(position,LabelOperand(label),left,right));
  1871. END BrneL;
  1872. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1873. VAR new: IntermediateCode.Operand;
  1874. BEGIN
  1875. IF Trace THEN TraceEnter("Convert") END;
  1876. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1877. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1878. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1879. & (operand.offset = 0)
  1880. THEN
  1881. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1882. Emit(Conv(position,new,operand));
  1883. ELSE
  1884. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1885. Emit(Conv(position,new,operand));
  1886. ReleaseIntermediateOperand(operand);
  1887. END;
  1888. operand := new;
  1889. 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
  1890. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1891. ELSE
  1892. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1893. Emit(Conv(position,new,operand));
  1894. ReleaseIntermediateOperand(operand);
  1895. operand := new;
  1896. END;
  1897. IF Trace THEN TraceExit("Convert") END;
  1898. END Convert;
  1899. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1900. VAR exit: Label;
  1901. BEGIN
  1902. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1903. exit := NewLabel();
  1904. br(exit,left,right);
  1905. EmitTrap(position,trapNo);
  1906. SetLabel(exit);
  1907. END TrapC;
  1908. (** expressions *)
  1909. (** emit necessary runtime check for set elements **)
  1910. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1911. VAR max: IntermediateCode.Operand;
  1912. BEGIN
  1913. IF isUnchecked THEN RETURN END;
  1914. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1915. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1916. TrapC(BrgeL, max, o, SetElementTrap);
  1917. END;
  1918. END CheckSetElement;
  1919. (** the set that a range represents **)
  1920. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1921. VAR
  1922. operand: Operand;
  1923. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1924. BEGIN
  1925. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1926. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1927. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1928. one := IntermediateCode.Immediate(setType, 1);
  1929. Evaluate(x, operand);
  1930. Convert(operand.op, setType);
  1931. Convert(operand.tag, setType);
  1932. CheckSetElement(operand.op);
  1933. CheckSetElement(operand.tag);
  1934. (* create mask for lower bound
  1935. i.e. shift 11111111 to the left by the value of the lower bound
  1936. *)
  1937. Reuse1(temp, operand.op);
  1938. Emit(Shl(position,temp, allBits, operand.op));
  1939. ReleaseIntermediateOperand(operand.op);
  1940. operand.op := temp;
  1941. (* create mask for upper bound
  1942. i.e. shift 11111111 to the right by the difference between the
  1943. upper bound and the maximum number of set elements
  1944. *)
  1945. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1946. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1947. Reuse1(temp, operand.tag);
  1948. ELSE
  1949. Reuse1(temp, operand.tag);
  1950. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1951. Emit(Sub(position,temp, size, operand.tag));
  1952. END;
  1953. Emit(Shr(position,temp, allBits, operand.tag));
  1954. ReleaseIntermediateOperand(operand.tag);
  1955. operand.tag := temp;
  1956. Reuse2(resultingSet, operand.op, operand.tag);
  1957. (* intersect the two masks *)
  1958. Emit(And(position,resultingSet, operand.op, operand.tag));
  1959. ReleaseOperand(operand);
  1960. RETURN resultingSet
  1961. END SetFromRange;
  1962. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1963. VAR
  1964. res, operand: Operand;
  1965. temp, one, noBits, dest: IntermediateCode.Operand;
  1966. expression: SyntaxTree.Expression;
  1967. i: LONGINT;
  1968. BEGIN
  1969. IF Trace THEN TraceEnter("VisitSet") END;
  1970. dest := destination;
  1971. destination := emptyOperand;
  1972. noBits := IntermediateCode.Immediate(setType, 0);
  1973. one := IntermediateCode.Immediate(setType, 1);
  1974. (* start off with the empty set *)
  1975. InitOperand(res, ModeValue);
  1976. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1977. Emit(Mov(position,res.op, noBits));
  1978. FOR i := 0 TO x.elements.Length() - 1 DO
  1979. expression := x.elements.GetExpression(i);
  1980. IF expression IS SyntaxTree.RangeExpression THEN
  1981. (* range of set elements *)
  1982. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1983. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1984. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1985. ReleaseIntermediateOperand(temp)
  1986. ELSE
  1987. (* singelton element *)
  1988. Evaluate(expression, operand);
  1989. Convert(operand.op, setType);
  1990. CheckSetElement(operand.op);
  1991. (* create subset containing single element *)
  1992. Reuse1(temp, operand.op);
  1993. Emit(Shl(position,temp, one, operand.op));
  1994. ReleaseOperand(operand);
  1995. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1996. ReleaseIntermediateOperand(temp);
  1997. END
  1998. END;
  1999. result := res;
  2000. destination := dest;
  2001. IF Trace THEN TraceExit("VisitSet") END;
  2002. END VisitSet;
  2003. (* math arrays of the form [a,b,c]
  2004. x is a static array and thus does not provide any pointers
  2005. *)
  2006. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2007. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2008. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2009. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2010. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2011. element: SyntaxTree.IntegerValue;
  2012. BEGIN
  2013. numberElements := x.elements.Length();
  2014. expression := index.parameters.GetExpression(dim);
  2015. element := expression(SyntaxTree.IntegerValue);
  2016. FOR i := 0 TO numberElements-1 DO
  2017. expression := x.elements.GetExpression(i);
  2018. element.SetValue(i);
  2019. IF expression IS SyntaxTree.MathArrayExpression THEN
  2020. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2021. ELSE
  2022. Assign(index,expression);
  2023. END;
  2024. END;
  2025. END RecursiveAssignment;
  2026. BEGIN
  2027. (*static math array not providing pointers anyway *)
  2028. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2029. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2030. designator.SetType(variable.type);
  2031. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2032. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2033. FOR i := 0 TO dim-1 DO
  2034. element := SyntaxTree.NewIntegerValue(x.position,0);
  2035. element.SetType(system.longintType);
  2036. index.parameters.AddExpression(element);
  2037. END;
  2038. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2039. RecursiveAssignment(x,0);
  2040. Expression(designator);
  2041. END VisitMathArrayExpression;
  2042. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2043. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2044. BEGIN
  2045. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2046. dest := destination; destination := emptyOperand;
  2047. IF x.operator = Scanner.Not THEN
  2048. IF conditional THEN
  2049. Condition(x.left,falseLabel,trueLabel)
  2050. ELSE
  2051. Evaluate(x.left,operand);
  2052. InitOperand(result,ModeValue);
  2053. Reuse1a(result.op,operand.op,dest);
  2054. Emit(Xor(position,result.op,operand.op,true));
  2055. ReleaseOperand(operand);
  2056. END;
  2057. ELSIF x.operator = Scanner.Minus THEN
  2058. Evaluate(x.left,operand);
  2059. InitOperand(result,ModeValue);
  2060. Reuse1a(result.op,operand.op,dest);
  2061. type := x.left.type.resolved;
  2062. IF type IS SyntaxTree.SetType THEN
  2063. Emit(Not(position,result.op,operand.op));
  2064. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2065. Reuse1(result.tag,operand.tag);
  2066. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2067. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2068. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2069. Emit(Neg(position,result.op,operand.op));
  2070. ELSE HALT(200)
  2071. END;
  2072. ReleaseOperand(operand);
  2073. ELSIF x.operator = Scanner.Address THEN
  2074. Designate(x.left,operand);
  2075. operand.mode := ModeValue;
  2076. t0 := x.left.type.resolved;
  2077. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2078. ReleaseIntermediateOperand(operand.op);
  2079. operand.op := operand.tag;
  2080. IntermediateCode.InitOperand(operand.tag);
  2081. END;
  2082. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2083. result := operand;
  2084. ELSE HALT(100)
  2085. END;
  2086. destination := dest;
  2087. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2088. END VisitUnaryExpression;
  2089. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2090. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2091. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2092. BEGIN
  2093. type := type.resolved;
  2094. originalType := type;
  2095. IF type IS SyntaxTree.PointerType THEN
  2096. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2097. END;
  2098. IF type IS SyntaxTree.ObjectType THEN
  2099. BrL(trueL);
  2100. ELSE
  2101. ASSERT(type IS SyntaxTree.RecordType);
  2102. (*
  2103. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2104. *)
  2105. ReuseCopy(left,tag);
  2106. right := TypeDescriptorAdr(type);
  2107. IF ~newObjectFile THEN
  2108. IntermediateCode.MakeMemory(right,addressType);
  2109. END;
  2110. IF backend.cooperative THEN
  2111. repeatL := NewLabel();
  2112. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2113. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2114. END;
  2115. SetLabel(repeatL);
  2116. BreqL(trueL,left,right);
  2117. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2118. BrneL(repeatL,left,nil);
  2119. ELSIF meta.simple THEN
  2120. level := type(SyntaxTree.RecordType).Level();
  2121. (* get type desc tag of level relative to base tag *)
  2122. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2123. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2124. IntermediateCode.MakeMemory(left,addressType);
  2125. BreqL(trueL,left,right);
  2126. ELSE
  2127. level := type(SyntaxTree.RecordType).Level();
  2128. (* get type desc tag of level relative to base tag *)
  2129. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2130. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2131. IntermediateCode.MakeMemory(left,addressType);
  2132. BreqL(trueL,left,right);
  2133. END;
  2134. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2135. BrL(falseL);
  2136. END;
  2137. END TypeTest;
  2138. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2139. BEGIN
  2140. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2141. IF dump # NIL THEN
  2142. dump.String(s); dump.Ln;
  2143. END;
  2144. END Error;
  2145. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2146. BEGIN
  2147. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2148. IF dump # NIL THEN
  2149. dump.String(s); dump.Ln; dump.Update;
  2150. END;
  2151. END Warning;
  2152. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2153. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2154. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2155. operand:Operand;
  2156. BEGIN
  2157. previousSection := section;
  2158. Global.GetModuleName(mod,name);
  2159. Strings.Append(name,".@Trace");
  2160. Basic.ToSegmentedName(name, pooledName);
  2161. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2162. IF dump # NIL THEN dump := section.comments END;
  2163. IF backend.hasLinkRegister THEN
  2164. Emit(Push(Basic.invalidPosition, lr));
  2165. END;
  2166. variable := mod.moduleScope.firstVariable;
  2167. WHILE variable # NIL DO
  2168. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2169. Symbol(variable, operand);
  2170. register := operand.op;
  2171. CallTraceMethod(register, variable.type);
  2172. ReleaseIntermediateOperand(register);
  2173. END;
  2174. variable := variable.nextVariable;
  2175. END;
  2176. IF backend.hasLinkRegister THEN
  2177. Emit(Pop(Basic.invalidPosition, lr));
  2178. END;
  2179. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2180. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2181. Emit(Br(position,op));
  2182. INC(statCoopTraceModule, section.pc);
  2183. section := previousSection;
  2184. IF dump # NIL THEN dump := section.comments END;
  2185. END CreateTraceModuleMethod;
  2186. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2187. BEGIN
  2188. Emit (Push(position, dst));
  2189. Emit (Push(position, src));
  2190. CallThis(position,"GarbageCollector","Assign", 2);
  2191. END CallAssignPointer;
  2192. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2193. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2194. BEGIN
  2195. IF SemanticChecker.IsPointerType (type) THEN
  2196. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2197. ELSIF type.IsRecordType() THEN
  2198. Emit (Push(position,dst));
  2199. Emit (Push(position,src));
  2200. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2201. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2202. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2203. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2204. ELSIF IsStaticArray(type) THEN
  2205. size := StaticArrayNumElements(type);
  2206. base := StaticArrayBaseType(type);
  2207. IF base.IsRecordType() THEN
  2208. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2209. Emit (Push(position, dst));
  2210. Emit (Push(position, src));
  2211. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2212. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2213. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2214. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2215. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2216. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2217. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2218. Emit (Push(position, dst));
  2219. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2220. Emit (Push(position, src));
  2221. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2222. ELSE
  2223. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2224. Emit (Push(position, dst));
  2225. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2226. Emit (Push(position, src));
  2227. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2228. ASSERT(StaticArrayBaseType(type).IsPointer());
  2229. END;
  2230. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2231. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2232. Emit (Push(position, dst));
  2233. Emit (Push(position, src));
  2234. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2235. ELSE HALT(100); (* missing ? *)
  2236. END;
  2237. END CallAssignMethod;
  2238. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2239. VAR name: Basic.SegmentedName;
  2240. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2241. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2242. context: Context;
  2243. BEGIN
  2244. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2245. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2246. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2247. GetRecordTypeName (recordType,name);
  2248. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2249. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2250. IF dump # NIL THEN dump := section.comments END;
  2251. IF backend.hasLinkRegister THEN
  2252. Emit(Push(Basic.invalidPosition, lr));
  2253. END;
  2254. variable := recordType.recordScope.firstVariable;
  2255. WHILE variable # NIL DO
  2256. IF variable.NeedsTrace() THEN
  2257. dst := NewRegisterOperand (addressType);
  2258. src := NewRegisterOperand (addressType);
  2259. Emit (Mov(position, dst, parameter1));
  2260. Emit (Mov(position, src, parameter2));
  2261. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2262. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2263. CallAssignMethod(dst, src, variable.type);
  2264. ReleaseIntermediateOperand(src);
  2265. ReleaseIntermediateOperand(dst);
  2266. END;
  2267. variable := variable.nextVariable;
  2268. END;
  2269. recordBase := recordType.GetBaseRecord();
  2270. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2271. IF backend.hasLinkRegister THEN
  2272. Emit(Pop(Basic.invalidPosition, lr));
  2273. END;
  2274. GetRecordTypeName (recordBase,name);
  2275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2276. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2277. Emit(Br(position,op));
  2278. ELSE
  2279. Emit(Exit(position,0,0, 0));
  2280. END;
  2281. IF ~recordType.isObject THEN
  2282. GetRecordTypeName (recordType,name);
  2283. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2284. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2285. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2286. NEW(registerUsageCount);
  2287. usedRegisters := NIL;
  2288. dst := NewRegisterOperand (addressType);
  2289. src := NewRegisterOperand (addressType);
  2290. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2291. Emit(Mov(position, dst, parameter1));
  2292. Emit(Mov(position, src, parameter2));
  2293. label := NewLabel();
  2294. SetLabel(label);
  2295. Emit(Push(position, dst));
  2296. Emit(Push(position, src));
  2297. GetRecordTypeName (recordType,name);
  2298. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2299. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2300. Emit(Call(position, op, 0));
  2301. Emit(Pop(position, src));
  2302. Emit(Pop(position, dst));
  2303. Emit(Add(position, dst, dst, ofs));
  2304. Emit(Add(position, src, src, ofs));
  2305. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2306. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2307. Emit(Exit(position,0,0, 0));
  2308. END;
  2309. INC(statCoopAssignProcedure, section.pc);
  2310. ReturnToContext(context);
  2311. IF dump # NIL THEN dump := section.comments END;
  2312. END CreateAssignProcedure;
  2313. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2314. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2315. BEGIN
  2316. IF IsUnsafePointer (type) THEN
  2317. skip := NewLabel();
  2318. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2319. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2320. BreqL (skip, op, nil);
  2321. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2322. SetLabel (skip);
  2323. ELSIF SemanticChecker.IsPointerType (type) THEN
  2324. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2325. CallThis(position,"GarbageCollector","Mark", 1);
  2326. ELSIF type.IsRecordType() THEN
  2327. Emit (Push(position,register));
  2328. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2329. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2330. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2331. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2332. ELSIF IsStaticArray(type) THEN
  2333. size := StaticArrayNumElements(type);
  2334. base := StaticArrayBaseType(type);
  2335. IF base.IsRecordType() THEN
  2336. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2337. Emit (Push(position, register));
  2338. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2340. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2341. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2342. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2343. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2344. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2345. Emit (Push(position, register));
  2346. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2347. ELSE
  2348. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2349. Emit (Push(position, register));
  2350. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2351. ASSERT(base.IsPointer());
  2352. END;
  2353. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2354. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2355. CallThis(position,"GarbageCollector","Mark", 1);
  2356. ELSE HALT(100); (* missing ? *)
  2357. END;
  2358. END CallTraceMethod;
  2359. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2360. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2361. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2362. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2363. BEGIN
  2364. previousSection := section;
  2365. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2366. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2367. GetRecordTypeName (recordType,name);
  2368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2369. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2370. IF dump # NIL THEN dump := section.comments END;
  2371. IF backend.hasLinkRegister THEN
  2372. Emit(Push(Basic.invalidPosition, lr));
  2373. END;
  2374. variable := recordType.recordScope.firstVariable;
  2375. WHILE variable # NIL DO
  2376. IF variable.NeedsTrace() THEN
  2377. register := NewRegisterOperand (addressType);
  2378. Emit (Mov(position,register,parameter1));
  2379. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2380. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2381. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2382. END;
  2383. CallTraceMethod(register, variable.type);
  2384. ReleaseIntermediateOperand(register);
  2385. END;
  2386. variable := variable.nextVariable;
  2387. END;
  2388. recordBase := recordType.GetBaseRecord();
  2389. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2390. recordBase := recordBase.GetBaseRecord();
  2391. END;
  2392. IF recordBase # NIL THEN
  2393. IF backend.hasLinkRegister THEN
  2394. Emit(Pop(Basic.invalidPosition, lr));
  2395. END;
  2396. GetRecordTypeName (recordBase,name);
  2397. IF HasExplicitTraceMethod (recordBase) THEN
  2398. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2399. ELSE
  2400. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2401. END;
  2402. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2403. Emit(Br(position,op));
  2404. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2405. Emit(Exit(position,0,0,0));
  2406. ELSE
  2407. IF backend.hasLinkRegister THEN
  2408. Emit(Pop(Basic.invalidPosition, lr));
  2409. END;
  2410. IF recordType.isObject THEN
  2411. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2412. ELSE
  2413. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2414. END;
  2415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2416. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2417. Emit(Br(position,op));
  2418. END;
  2419. IF ~recordType.isObject THEN
  2420. GetRecordTypeName (recordType,name);
  2421. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2422. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2423. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2424. NEW(registerUsageCount);
  2425. usedRegisters := NIL;
  2426. IF dump # NIL THEN dump := section.comments END;
  2427. register := NewRegisterOperand (addressType);
  2428. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2429. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2430. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2431. END;
  2432. Emit (Push(position,register));
  2433. GetRecordTypeName (recordType,name);
  2434. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2435. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2436. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2437. ReleaseIntermediateOperand(register);
  2438. Emit(Exit(position,0,0,0));
  2439. GetRecordTypeName (recordType,name);
  2440. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2441. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2442. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2443. NEW(registerUsageCount);
  2444. usedRegisters := NIL;
  2445. register := NewRegisterOperand (addressType);
  2446. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2447. Emit(Mov(position, register, parameter1));
  2448. label := NewLabel();
  2449. SetLabel(label);
  2450. Emit(Push(position, register));
  2451. GetRecordTypeName (recordType,name);
  2452. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2453. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2454. Emit(Call(position, op, 0));
  2455. Emit(Pop(position, register));
  2456. Emit(Add(position, register, register, ofs));
  2457. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2458. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2459. Emit(Exit(position,0,0,0));
  2460. END;
  2461. INC(statCoopTraceMethod, section.pc);
  2462. ReturnToContext(context);
  2463. IF dump # NIL THEN dump := section.comments END;
  2464. END CreateTraceMethod;
  2465. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2466. VAR name: Basic.SegmentedName;
  2467. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2468. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2469. context: Context;
  2470. BEGIN
  2471. IF recordType.isObject THEN RETURN END;
  2472. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2473. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2474. GetRecordTypeName (recordType,name);
  2475. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2476. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2477. IF dump # NIL THEN dump := section.comments END;
  2478. IF backend.hasLinkRegister THEN
  2479. Emit(Push(Basic.invalidPosition, lr));
  2480. END;
  2481. variable := recordType.recordScope.firstVariable;
  2482. WHILE variable # NIL DO
  2483. IF variable.NeedsTrace() THEN
  2484. dst := NewRegisterOperand (addressType);
  2485. Emit (Mov(position, dst, parameter1));
  2486. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2487. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2488. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2489. END;
  2490. CallResetProcedure(dst, nil, variable.type);
  2491. ReleaseIntermediateOperand(dst);
  2492. END;
  2493. variable := variable.nextVariable;
  2494. END;
  2495. recordBase := recordType.GetBaseRecord();
  2496. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2497. IF backend.hasLinkRegister THEN
  2498. Emit(Pop(Basic.invalidPosition, lr));
  2499. END;
  2500. GetRecordTypeName (recordBase,name);
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2502. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2503. Emit(Br(position,op));
  2504. ELSE
  2505. Emit(Exit(position,0,0, 0));
  2506. END;
  2507. GetRecordTypeName (recordType,name);
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2509. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2510. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2511. NEW(registerUsageCount);
  2512. usedRegisters := NIL;
  2513. dst := NewRegisterOperand (addressType);
  2514. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2515. Emit(Mov(position, dst, parameter1));
  2516. label := NewLabel();
  2517. SetLabel(label);
  2518. Emit(Push(position, dst));
  2519. GetRecordTypeName (recordType,name);
  2520. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2521. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2522. Emit(Call(position, op, 0));
  2523. Emit(Pop(position, dst));
  2524. Emit(Add(position, dst, dst, ofs));
  2525. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2526. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2527. Emit(Exit(position,0,0, 0));
  2528. INC(statCoopResetProcedure, section.pc);
  2529. ReturnToContext(context);
  2530. IF dump # NIL THEN dump := section.comments END;
  2531. END CreateResetProcedure;
  2532. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2533. VAR name: Basic.SegmentedName; context: Context;
  2534. BEGIN
  2535. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2536. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2537. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2538. IF dump # NIL THEN dump := section.comments END;
  2539. IF backend.hasLinkRegister THEN
  2540. Emit(Push(Basic.invalidPosition, lr));
  2541. END;
  2542. Emit(Push(position,fp));
  2543. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2544. ResetVariables(scope);
  2545. Emit(Pop(position,fp));
  2546. Emit(Exit(position,0,0, 0));
  2547. ReturnToContext(context);
  2548. IF dump # NIL THEN dump := section.comments END;
  2549. END CreateResetMethod;
  2550. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2551. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2552. BEGIN
  2553. IF SemanticChecker.IsPointerType (type) THEN
  2554. Emit (Push(position, dest));
  2555. CallThis(position,"GarbageCollector","Reset", 1);
  2556. ELSIF type.IsRecordType() THEN
  2557. Emit (Push(position, dest));
  2558. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2560. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2561. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2562. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2563. size := GetArrayLength(type, tag);
  2564. base := ArrayBaseType(type);
  2565. IF base.IsRecordType() THEN
  2566. Emit (Push(position, size));
  2567. Emit (Push(position, dest));
  2568. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2569. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2570. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2571. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2572. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2573. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2574. Emit (Push(position, size));
  2575. Emit (Push(position, dest));
  2576. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2577. ELSE
  2578. Emit (Push(position, size));
  2579. Emit (Push(position, dest));
  2580. CallThis(position,"GarbageCollector","ResetArray", 2);
  2581. ASSERT(ArrayBaseType(type).IsPointer());
  2582. END;
  2583. ReleaseIntermediateOperand(size);
  2584. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2585. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2586. Emit (Push(position, dest));
  2587. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2588. ELSE HALT(100); (* missing ? *)
  2589. END;
  2590. END CallResetProcedure;
  2591. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2592. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2593. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2594. VAR operand: Operand;
  2595. BEGIN
  2596. Symbol (symbol, operand);
  2597. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2598. ReleaseOperand(operand);
  2599. END Reset;
  2600. BEGIN
  2601. previousScope := currentScope;
  2602. currentScope := scope;
  2603. pc := section.pc;
  2604. variable := scope.firstVariable;
  2605. WHILE variable # NIL DO
  2606. IF variable.NeedsTrace() THEN
  2607. Reset (variable);
  2608. END;
  2609. variable := variable.nextVariable;
  2610. END;
  2611. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2612. WHILE parameter # NIL DO
  2613. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2614. Reset (parameter);
  2615. END;
  2616. parameter := parameter.nextParameter;
  2617. END;
  2618. INC(statCoopResetVariables, section.pc - pc);
  2619. currentScope := previousScope;
  2620. END ResetVariables;
  2621. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2622. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2623. VAR op: IntermediateCode.Operand; context: Context;
  2624. BEGIN
  2625. previousSection := section;
  2626. GetCodeSectionNameForSymbol(procedure, name);
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2628. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2629. IF dump # NIL THEN dump := section.comments END;
  2630. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2631. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2632. Emit(Data(position,op));
  2633. Emit(Data(position,nil));
  2634. IF HasPointers (procedure.procedureScope) THEN
  2635. GetCodeSectionNameForSymbol(procedure, name);
  2636. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2637. ELSE
  2638. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2639. END;
  2640. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2641. Emit(Data(position,op));
  2642. ReturnToContext(context);
  2643. IF dump # NIL THEN dump := section.comments END;
  2644. END CreateProcedureDescriptor;
  2645. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2646. VAR import: SyntaxTree.Import;
  2647. s: Basic.MessageString;
  2648. selfName: SyntaxTree.IdentifierString;
  2649. BEGIN
  2650. moduleScope.ownerModule.GetName(selfName);
  2651. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2652. module := moduleScope.ownerModule
  2653. ELSE
  2654. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2655. IF import = NIL THEN
  2656. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2657. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2658. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2659. s := "Module ";
  2660. Strings.Append(s,moduleName);
  2661. Strings.Append(s," cannot be imported.");
  2662. IF force THEN
  2663. Error(position,s);
  2664. ELSIF canBeLoaded THEN
  2665. IF WarningDynamicLoading THEN
  2666. Strings.Append(s, "=> no dynamic linking.");
  2667. Warning(position, s);
  2668. END;
  2669. canBeLoaded := FALSE;
  2670. END;
  2671. RETURN FALSE
  2672. ELSE
  2673. SELF.module.imports.AddName(moduleName)
  2674. END;
  2675. ELSIF import.module = NIL THEN (* already tried *)
  2676. RETURN FALSE
  2677. END;
  2678. module := import.module;
  2679. END;
  2680. RETURN TRUE
  2681. END AddImport;
  2682. (* needed for old binary object file format*)
  2683. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2684. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2685. BEGIN
  2686. IF AddImport(moduleName,module,TRUE) THEN
  2687. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2688. IF procedure = NIL THEN
  2689. s := "Instruction not supported on target, emulation procedure ";
  2690. Strings.Append(s,moduleName);
  2691. Strings.Append(s,".");
  2692. Strings.Append(s,procedureName);
  2693. Strings.Append(s," not present");
  2694. Error(position,s);
  2695. ELSE
  2696. StaticCallOperand(r,procedure);
  2697. ReleaseOperand(r);
  2698. fp := GetFingerprint(procedure);
  2699. END;
  2700. END;
  2701. END EnsureSymbol;
  2702. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2703. VAR exit: Label; trueL,falseL: Label;
  2704. BEGIN
  2705. trueL := NewLabel();
  2706. falseL := NewLabel();
  2707. exit := NewLabel();
  2708. Condition(x,trueL,falseL);
  2709. InitOperand(result,ModeValue);
  2710. SetLabel(trueL);
  2711. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2712. Emit(Mov(position,result.op,true));
  2713. BrL(exit);
  2714. SetLabel(falseL);
  2715. Emit(MovReplace(position,result.op,false));
  2716. SetLabel(exit);
  2717. END ConditionToValue;
  2718. PROCEDURE ValueToCondition(VAR op: Operand);
  2719. BEGIN
  2720. LoadValue(op,system.booleanType);
  2721. BrneL(trueLabel,op.op, false);
  2722. ReleaseOperand(op);
  2723. BrL(falseLabel);
  2724. END ValueToCondition;
  2725. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2726. VAR size: LONGINT;
  2727. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2728. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2729. BEGIN
  2730. ASSERT(type.form = SyntaxTree.Open);
  2731. baseType := type.arrayBase.resolved;
  2732. IF IsOpenArray(baseType) THEN
  2733. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2734. ELSE
  2735. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2736. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2737. END;
  2738. len := tag;
  2739. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2740. IntermediateCode.MakeMemory(len,addressType);
  2741. UseIntermediateOperand(len);
  2742. Reuse2(res,sizeOperand,len);
  2743. Emit(Mul(position,res,sizeOperand,len));
  2744. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2745. RETURN res
  2746. END GetArraySize;
  2747. BEGIN
  2748. type := type.resolved;
  2749. IF IsOpenArray(type) THEN
  2750. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2751. RETURN tag
  2752. ELSE
  2753. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2754. END;
  2755. ELSE
  2756. size := ToMemoryUnits(system,system.SizeOf(type));
  2757. RETURN IntermediateCode.Immediate(addressType,size)
  2758. END;
  2759. END GetDynamicSize;
  2760. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2761. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2762. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2763. BEGIN
  2764. ASSERT(type.form = SyntaxTree.Open);
  2765. baseType := type.arrayBase.resolved;
  2766. IF IsOpenArray(baseType) THEN
  2767. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2768. ELSE
  2769. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2770. END;
  2771. len := tag;
  2772. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2773. IntermediateCode.MakeMemory(len,addressType);
  2774. UseIntermediateOperand(len);
  2775. Reuse2(res,sizeOperand,len);
  2776. Emit(Mul(position,res,sizeOperand,len));
  2777. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2778. RETURN res
  2779. END GetLength;
  2780. BEGIN
  2781. type := type.resolved;
  2782. IF IsOpenArray(type) THEN
  2783. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2784. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2785. ELSIF type IS SyntaxTree.StringType THEN
  2786. RETURN tag;
  2787. ELSE
  2788. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2789. END;
  2790. END GetArrayLength;
  2791. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2792. VAR result: IntermediateCode.Operand;
  2793. BEGIN
  2794. IF backend.cooperative THEN
  2795. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2796. ELSE
  2797. MakeMemory(result, tag, addressType, 0);
  2798. END;
  2799. RETURN result
  2800. END GetSizeFromTag;
  2801. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2802. VAR parameter: SyntaxTree.Parameter;
  2803. BEGIN
  2804. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2805. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2806. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2807. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2808. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2809. END;
  2810. RETURN GetDynamicSize(e.type, tag);
  2811. END GetArrayOfBytesSize;
  2812. (*
  2813. to find imported symbol. not needed ?
  2814. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2815. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2816. BEGIN
  2817. IF AddImport(moduleName,importedModule,FALSE) THEN
  2818. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2819. RETURN symbol
  2820. ELSE
  2821. RETURN NIL
  2822. END
  2823. END SymbolByName;
  2824. *)
  2825. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2826. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2827. BEGIN
  2828. IF AddImport(moduleName,runtimeModule,force) THEN
  2829. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2830. IF procedure = NIL THEN
  2831. s := "Procedure ";
  2832. Strings.Append(s,moduleName);
  2833. Strings.Append(s,".");
  2834. Strings.Append(s,procedureName);
  2835. Strings.Append(s," not present");
  2836. Error(position,s);
  2837. RETURN FALSE
  2838. ELSE
  2839. RETURN TRUE
  2840. END;
  2841. ELSE RETURN FALSE
  2842. END;
  2843. END GetRuntimeProcedure;
  2844. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2845. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2846. s: Basic.MessageString;
  2847. BEGIN
  2848. Basic.InitSegmentedName(name);
  2849. name[0] := Basic.MakeString(moduleName);
  2850. name[1] := Basic.MakeString(typeName);
  2851. name[2] := -1;
  2852. IF AddImport(moduleName,importedModule, FALSE) THEN
  2853. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2854. IF symbol = NIL THEN
  2855. s := "type ";
  2856. Strings.Append(s,moduleName);
  2857. Strings.Append(s,".");
  2858. Strings.Append(s,typeName);
  2859. Strings.Append(s," not present");
  2860. Error(position,s);
  2861. END;
  2862. ELSE symbol := NIL;
  2863. END;
  2864. IF importedModule = moduleScope.ownerModule THEN
  2865. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2866. ELSE
  2867. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2868. END;
  2869. RETURN symbol
  2870. END GetTypeDescriptor;
  2871. (* 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. *)
  2872. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2873. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2874. pooledName: Basic.SegmentedName; size: LONGINT;
  2875. BEGIN
  2876. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2877. StaticCallOperand(result,procedure);
  2878. IF numberParameters < 0 THEN
  2879. size := ProcedureParametersSize(system,procedure);
  2880. ELSE
  2881. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2882. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2883. Error(position,"runtime call parameter count mismatch");
  2884. END;
  2885. END;
  2886. Emit(Call(position, result.op, size));
  2887. ReleaseOperand(result);
  2888. ELSE (* only static linking possible *)
  2889. ASSERT(numberParameters >= 0);
  2890. Basic.InitSegmentedName(pooledName);
  2891. pooledName[0] := Basic.MakeString(moduleName);
  2892. pooledName[1] := Basic.MakeString(procedureName);
  2893. pooledName[2] := -1;
  2894. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2895. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2896. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2897. END;
  2898. END CallThisChecked;
  2899. (* 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. *)
  2900. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2901. BEGIN
  2902. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2903. END CallThis;
  2904. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2905. VAR
  2906. left,right: Operand;
  2907. leftSize, rightSize: IntermediateCode.Operand;
  2908. saved: RegisterEntry;
  2909. reg: IntermediateCode.Operand;
  2910. procedureName: SyntaxTree.IdentifierString;
  2911. BEGIN
  2912. procedureName := "CompareString";
  2913. SaveRegisters();ReleaseUsedRegisters(saved);
  2914. Designate(leftExpression,left);
  2915. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2916. Emit(Push(position,leftSize));
  2917. ReleaseIntermediateOperand(leftSize);
  2918. Emit(Push(position,left.op));
  2919. ReleaseOperand(left);
  2920. Designate(rightExpression,right);
  2921. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2922. Emit(Push(position,rightSize));
  2923. ReleaseIntermediateOperand(rightSize);
  2924. Emit(Push(position,right.op));
  2925. ReleaseOperand(right);
  2926. IF backend.cooperative THEN
  2927. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2928. ELSE
  2929. CallThis(position,runtimeModuleName,procedureName, 4);
  2930. END;
  2931. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2932. Emit(Result(position,reg));
  2933. (*
  2934. AcquireThisRegister(int8,IntermediateCode.Result);
  2935. *)
  2936. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2937. (*
  2938. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2939. *)
  2940. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2941. ReleaseIntermediateOperand(reg);
  2942. BrL(falseLabel);
  2943. END CompareString;
  2944. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2945. VAR
  2946. left,right: Operand;
  2947. leftSize, rightSize: IntermediateCode.Operand;
  2948. saved: RegisterEntry;
  2949. procedureName: SyntaxTree.IdentifierString;
  2950. BEGIN
  2951. procedureName := "CopyString";
  2952. SaveRegisters();ReleaseUsedRegisters(saved);
  2953. Designate(leftExpression,left);
  2954. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2955. Emit(Push(position,leftSize));
  2956. ReleaseIntermediateOperand(leftSize);
  2957. Emit(Push(position,left.op));
  2958. ReleaseOperand(left);
  2959. Designate(rightExpression,right);
  2960. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2961. Emit(Push(position,rightSize));
  2962. ReleaseIntermediateOperand(rightSize);
  2963. Emit(Push(position,right.op));
  2964. ReleaseOperand(right);
  2965. IF backend.cooperative THEN
  2966. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2967. ELSE
  2968. CallThis(position,runtimeModuleName,procedureName,4);
  2969. END;
  2970. RestoreRegisters(saved);
  2971. END CopyString;
  2972. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2973. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2974. leftType,rightType: SyntaxTree.Type;
  2975. leftExpression,rightExpression : SyntaxTree.Expression;
  2976. componentType: IntermediateCode.Type;
  2977. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2978. size: LONGINT;
  2979. BEGIN
  2980. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2981. dest := destination; destination := emptyOperand;
  2982. leftType := x.left.type.resolved;
  2983. rightType := x.right.type.resolved;
  2984. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2985. CASE x.operator OF
  2986. Scanner.Or:
  2987. (* shortcut evaluation of left OR right *)
  2988. IF ~conditional THEN ConditionToValue(x);
  2989. ELSE
  2990. next := NewLabel();
  2991. Condition(x.left,trueLabel,next);
  2992. SetLabel(next);
  2993. Condition(x.right,trueLabel,falseLabel);
  2994. END;
  2995. |Scanner.And:
  2996. (* shortcut evaluation of left & right *)
  2997. IF ~conditional THEN ConditionToValue(x);
  2998. ELSE
  2999. next := NewLabel();
  3000. Condition(x.left,next,falseLabel);
  3001. SetLabel(next);
  3002. Condition(x.right,trueLabel,falseLabel);
  3003. END;
  3004. |Scanner.Is:
  3005. IF ~conditional THEN ConditionToValue(x);
  3006. ELSE
  3007. (* get type desc tag *)
  3008. IF IsPointerToRecord(leftType,recordType) THEN
  3009. Evaluate(x.left,left);
  3010. Dereference(left,recordType,IsUnsafePointer(leftType))
  3011. ELSE
  3012. Designate(x.left,left);
  3013. END;
  3014. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3015. ReleaseOperand(left);
  3016. END;
  3017. |Scanner.Plus:
  3018. Evaluate(x.left,left);
  3019. Evaluate(x.right,right);
  3020. IF leftType IS SyntaxTree.SetType THEN
  3021. InitOperand(result,ModeValue);
  3022. Reuse2a(result.op,left.op,right.op,dest);
  3023. Emit(Or(position,result.op,left.op,right.op));
  3024. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3025. InitOperand(result,ModeValue);
  3026. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3027. Reuse2(result.tag,left.tag,right.tag);
  3028. Emit(Add(position,result.op,left.op,right.op));
  3029. Emit(Add(position,result.tag,left.tag,right.tag))
  3030. ELSE
  3031. InitOperand(result,ModeValue);
  3032. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3033. AddInt(result.op, left.op, right.op) ;
  3034. ELSE
  3035. *)
  3036. Reuse2a(result.op,left.op,right.op,dest);
  3037. Emit(Add(position,result.op,left.op,right.op));
  3038. (*
  3039. END;
  3040. *)
  3041. END;
  3042. ReleaseOperand(left); ReleaseOperand(right);
  3043. |Scanner.Minus:
  3044. Evaluate(x.left,left);
  3045. Evaluate(x.right,right);
  3046. IF leftType IS SyntaxTree.SetType THEN
  3047. InitOperand(result,ModeValue);
  3048. Reuse1(result.op,right.op);
  3049. Emit(Not(position,result.op,right.op));
  3050. ReleaseOperand(right);
  3051. Emit(And(position,result.op,result.op,left.op));
  3052. ReleaseOperand(left);
  3053. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3054. InitOperand(result,ModeValue);
  3055. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3056. Reuse2(result.tag,left.tag,right.tag);
  3057. Emit(Sub(position,result.op,left.op,right.op));
  3058. Emit(Sub(position,result.tag,left.tag,right.tag));
  3059. ReleaseOperand(left); ReleaseOperand(right)
  3060. ELSE
  3061. InitOperand(result,ModeValue);
  3062. Reuse2a(result.op,left.op,right.op,dest);
  3063. Emit(Sub(position,result.op,left.op,right.op));
  3064. ReleaseOperand(left); ReleaseOperand(right);
  3065. END;
  3066. |Scanner.Times:
  3067. Evaluate(x.left,left);
  3068. Evaluate(x.right,right);
  3069. IF leftType IS SyntaxTree.SetType THEN
  3070. InitOperand(result,ModeValue);
  3071. Reuse2a(result.op,left.op,right.op,dest);
  3072. Emit(And(position,result.op,left.op,right.op));
  3073. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3074. InitOperand(result, ModeValue);
  3075. componentType := left.op.type;
  3076. (* TODO: review this *)
  3077. (*
  3078. result.op = left.op * right.op - left.tag * right.tag
  3079. result.tag = left.tag * right.op + left.op * right.tag
  3080. *)
  3081. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3082. Emit(Mul(position,result.op, left.op, right.op));
  3083. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3084. Emit(Mul(position,tempReg, left.tag, right.tag));
  3085. Emit(Sub(position,result.op, result.op, tempReg));
  3086. Reuse2(result.tag, left.tag, right.op);
  3087. Emit(Mul(position,result.tag, left.tag, right.op));
  3088. Emit(Mul(position,tempReg, left.op, right.tag));
  3089. Emit(Add(position,result.tag, result.tag, tempReg));
  3090. ReleaseIntermediateOperand(tempReg)
  3091. ELSE
  3092. InitOperand(result,ModeValue);
  3093. Reuse2a(result.op,left.op,right.op,dest);
  3094. Emit(Mul(position,result.op,left.op,right.op));
  3095. END;
  3096. ReleaseOperand(left); ReleaseOperand(right);
  3097. |Scanner.Div:
  3098. Evaluate(x.left,left);
  3099. Evaluate(x.right,right);
  3100. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3101. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3102. IF ~isUnchecked THEN
  3103. exit := NewLabel();
  3104. BrltL(exit,zero,right.op);
  3105. EmitTrap(position,NegativeDivisorTrap);
  3106. SetLabel(exit);
  3107. END;
  3108. END;
  3109. InitOperand(result,ModeValue);
  3110. Reuse2a(result.op,left.op,right.op,dest);
  3111. Emit(Div(position,result.op,left.op,right.op));
  3112. ReleaseOperand(left); ReleaseOperand(right);
  3113. |Scanner.Mod:
  3114. Evaluate(x.left,left);
  3115. Evaluate(x.right,right);
  3116. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3117. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3118. IF ~isUnchecked THEN
  3119. exit := NewLabel();
  3120. BrltL(exit,zero,right.op);
  3121. EmitTrap(position,NegativeDivisorTrap);
  3122. SetLabel(exit);
  3123. END;
  3124. END;
  3125. InitOperand(result,ModeValue);
  3126. Reuse2a(result.op,left.op,right.op,dest);
  3127. Emit(Mod(position,result.op,left.op,right.op));
  3128. ReleaseOperand(left); ReleaseOperand(right);
  3129. |Scanner.Slash:
  3130. Evaluate(x.left,left);
  3131. Evaluate(x.right,right);
  3132. IF leftType IS SyntaxTree.SetType THEN
  3133. InitOperand(result,ModeValue);
  3134. Reuse2a(result.op,left.op,right.op,dest);
  3135. Emit(Xor(position,result.op,left.op,right.op));
  3136. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3137. InitOperand(result,ModeValue);
  3138. componentType := left.op.type;
  3139. (* review this *)
  3140. (*
  3141. divisor = right.op * right.op + right.tag * right.tag
  3142. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3143. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3144. *)
  3145. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3146. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3147. Emit(Mul(position,tempReg, right.op, right.op));
  3148. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3149. Emit(Add(position,tempReg, tempReg, tempReg2));
  3150. result.op := tempReg2;
  3151. Emit(Mul(position,result.op, left.op, right.op));
  3152. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3153. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3154. Emit(Add(position,result.op, result.op, tempReg2));
  3155. Emit(Div(position,result.op, result.op, tempReg));
  3156. Reuse2(result.tag, left.tag, right.op);
  3157. Emit(Mul(position,result.tag, left.tag, right.op));
  3158. Emit(Mul(position,tempReg2, left.op, right.tag));
  3159. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3160. Emit(Div(position,result.tag, result.tag, tempReg));
  3161. ReleaseIntermediateOperand(tempReg);
  3162. ReleaseIntermediateOperand(tempReg2)
  3163. ELSE
  3164. InitOperand(result,ModeValue);
  3165. Reuse2a(result.op,left.op,right.op,dest);
  3166. Emit(Div(position,result.op,left.op,right.op));
  3167. END;
  3168. ReleaseOperand(left); ReleaseOperand(right);
  3169. |Scanner.Equal:
  3170. IF ~conditional THEN ConditionToValue(x);
  3171. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3172. CompareString(BreqL,x.left,x.right);
  3173. ELSE
  3174. Evaluate(x.left,left);
  3175. Evaluate(x.right,right);
  3176. IF leftType IS SyntaxTree.RangeType THEN
  3177. ASSERT(rightType IS SyntaxTree.RangeType);
  3178. BrneL(falseLabel, left.op, right.op); (* first *)
  3179. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3180. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3181. ReleaseOperand(left); ReleaseOperand(right);
  3182. BrL(trueLabel)
  3183. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3184. BrneL(falseLabel, left.op, right.op); (* first *)
  3185. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3186. ReleaseOperand(left); ReleaseOperand(right);
  3187. BrL(trueLabel)
  3188. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3189. (* TODO: review this *)
  3190. BrneL(falseLabel, left.op, right.op); (* real part *)
  3191. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3192. ReleaseOperand(left); ReleaseOperand(right);
  3193. BrL(trueLabel)
  3194. ELSE
  3195. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3196. ReleaseOperand(left); ReleaseOperand(right);
  3197. BrL(trueLabel);
  3198. END;
  3199. END;
  3200. |Scanner.LessEqual:
  3201. IF ~conditional THEN ConditionToValue(x);
  3202. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3203. CompareString(BrgeL,x.right,x.left);
  3204. ELSE
  3205. Evaluate(x.left,left);
  3206. Evaluate(x.right,right);
  3207. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3208. Reuse1(temp.op,right.op);
  3209. Emit(And(position,temp.op,left.op,right.op));
  3210. ReleaseOperand(right);
  3211. BreqL(trueLabel,temp.op,left.op);
  3212. BrL(falseLabel);
  3213. ReleaseOperand(temp);ReleaseOperand(left);
  3214. ELSE
  3215. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3216. ReleaseOperand(left); ReleaseOperand(right);
  3217. BrL(trueLabel);
  3218. END;
  3219. END;
  3220. |Scanner.Less:
  3221. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3222. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3223. leftExpression.SetType(system.booleanType);
  3224. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3225. rightExpression.SetType(system.booleanType);
  3226. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3227. leftExpression.SetType(system.booleanType);
  3228. Expression(leftExpression);
  3229. ELSIF ~conditional THEN ConditionToValue(x);
  3230. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3231. CompareString(BrltL,x.left,x.right);
  3232. ELSE
  3233. Evaluate(x.left,left);
  3234. Evaluate(x.right,right);
  3235. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. BrL(trueLabel);
  3238. END;
  3239. |Scanner.Greater:
  3240. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3241. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3242. leftExpression.SetType(system.booleanType);
  3243. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3244. rightExpression.SetType(system.booleanType);
  3245. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3246. leftExpression.SetType(system.booleanType);
  3247. Expression(leftExpression);
  3248. ELSIF ~conditional THEN ConditionToValue(x);
  3249. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3250. CompareString(BrltL,x.right,x.left);
  3251. ELSE
  3252. Evaluate(x.left,left);
  3253. Evaluate(x.right,right);
  3254. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3255. ReleaseOperand(left); ReleaseOperand(right);
  3256. BrL(trueLabel);
  3257. END;
  3258. |Scanner.GreaterEqual:
  3259. IF ~conditional THEN ConditionToValue(x);
  3260. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3261. CompareString(BrgeL,x.left,x.right);
  3262. ELSE
  3263. Evaluate(x.left,left);
  3264. Evaluate(x.right,right);
  3265. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3266. Reuse1(temp.op,left.op);
  3267. Emit(And(position,temp.op,left.op,right.op));
  3268. ReleaseOperand(left);
  3269. BreqL(trueLabel, temp.op,right.op);
  3270. ReleaseOperand(temp); ReleaseOperand(right);
  3271. BrL(falseLabel);
  3272. ELSE
  3273. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3274. ReleaseOperand(left); ReleaseOperand(right);
  3275. BrL(trueLabel);
  3276. END;
  3277. END;
  3278. |Scanner.Unequal:
  3279. IF ~conditional THEN ConditionToValue(x);
  3280. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3281. CompareString(BrneL,x.left,x.right);
  3282. ELSE
  3283. Evaluate(x.left,left);
  3284. Evaluate(x.right,right);
  3285. IF leftType IS SyntaxTree.RangeType THEN
  3286. ASSERT(rightType IS SyntaxTree.RangeType);
  3287. BrneL(trueLabel, left.op, right.op); (* first *)
  3288. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3289. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3290. ReleaseOperand(left); ReleaseOperand(right);
  3291. BrL(falseLabel)
  3292. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3293. BrneL(trueLabel, left.op, right.op); (* first *)
  3294. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3295. ReleaseOperand(left); ReleaseOperand(right);
  3296. BrL(falseLabel)
  3297. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3298. (* TODO: review this *)
  3299. BrneL(trueLabel, left.op, right.op); (* real part *)
  3300. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3301. ReleaseOperand(left); ReleaseOperand(right);
  3302. BrL(falseLabel)
  3303. ELSE
  3304. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3305. ReleaseOperand(left); ReleaseOperand(right);
  3306. BrL(trueLabel);
  3307. END;
  3308. END;
  3309. |Scanner.In:
  3310. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3311. Evaluate(x.left,left);
  3312. Evaluate(x.right,right);
  3313. Convert(left.op,setType);
  3314. ReuseCopy(temp.op,right.op);
  3315. Emit(Shr(position,temp.op,temp.op,left.op));
  3316. ReleaseOperand(right); ReleaseOperand(left);
  3317. IntermediateCode.InitImmediate(one,setType,1);
  3318. Emit(And(position,temp.op,temp.op,one));
  3319. IF conditional THEN
  3320. IntermediateCode.InitImmediate(zero,setType,0);
  3321. BrneL(trueLabel,temp.op,zero);
  3322. ReleaseOperand(temp);
  3323. BrL(falseLabel);
  3324. ELSE
  3325. Convert(temp.op,bool);
  3326. result.mode := ModeValue;
  3327. result.op := temp.op;
  3328. result.tag := nil; (* may be left over from calls to evaluate *)
  3329. END;
  3330. ELSE
  3331. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3332. IF x.operator = Scanner.Questionmarks THEN
  3333. leftExpression := x.left;
  3334. rightExpression := x.right;
  3335. ELSE
  3336. leftExpression := x.right;
  3337. rightExpression := x.left;
  3338. END;
  3339. Evaluate(leftExpression, left);
  3340. Emit(Push(position,left.op));
  3341. ReleaseOperand(left);
  3342. Designate(rightExpression, right);
  3343. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3344. IF ~backend.cellsAreObjects THEN
  3345. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3346. END;
  3347. Emit(Push(position,right.op));
  3348. ReleaseOperand(right);
  3349. IF backend.cellsAreObjects THEN
  3350. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3351. ELSE
  3352. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3353. END;
  3354. InitOperand(result, ModeValue);
  3355. result.op := NewRegisterOperand(bool);
  3356. Emit(Result(position,result.op));
  3357. IF conditional THEN
  3358. IntermediateCode.InitImmediate(zero,setType,0);
  3359. BrneL(trueLabel,result.op,zero);
  3360. ReleaseOperand(result);
  3361. BrL(falseLabel);
  3362. END;
  3363. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3364. leftExpression := x.left;
  3365. rightExpression := x.right;
  3366. Evaluate(leftExpression, left);
  3367. Emit(Push(position,left.op));
  3368. ReleaseOperand(left);
  3369. Evaluate(rightExpression, right);
  3370. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3371. IF ~backend.cellsAreObjects THEN
  3372. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3373. END;
  3374. Emit(Push(position,right.op));
  3375. ReleaseOperand(right);
  3376. IF backend.cellsAreObjects THEN
  3377. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3378. ELSE
  3379. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3380. END;
  3381. InitOperand(result, ModeValue);
  3382. result.op := NewRegisterOperand(bool);
  3383. Emit(Result(position,result.op));
  3384. IF conditional THEN
  3385. IntermediateCode.InitImmediate(zero,setType,0);
  3386. BrneL(trueLabel,result.op,zero);
  3387. ReleaseOperand(result);
  3388. BrL(falseLabel);
  3389. END;
  3390. ELSE
  3391. HALT(100);
  3392. END;
  3393. END;
  3394. destination := dest;
  3395. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3396. END VisitBinaryExpression;
  3397. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3398. VAR localResult, operand: Operand;
  3399. BEGIN
  3400. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3401. InitOperand(localResult, ModeValue);
  3402. ASSERT(x.first # NIL);
  3403. Evaluate(x.first, operand);
  3404. localResult.op := operand.op;
  3405. ReleaseOperand(operand);
  3406. UseIntermediateOperand(localResult.op);
  3407. ASSERT(x.last # NIL);
  3408. Evaluate(x.last, operand);
  3409. localResult.tag := operand.op;
  3410. ReleaseOperand(operand);
  3411. UseIntermediateOperand(localResult.tag);
  3412. IF x.step # NIL THEN
  3413. Evaluate(x.step, operand);
  3414. localResult.extra := operand.op;
  3415. ReleaseOperand(operand);
  3416. UseIntermediateOperand(localResult.extra);
  3417. END;
  3418. result := localResult;
  3419. IF Trace THEN TraceExit("VisitRangeExpression") END
  3420. END VisitRangeExpression;
  3421. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3422. BEGIN
  3423. HALT(100); (* should never be evaluated *)
  3424. END VisitTensorRangeExpression;
  3425. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3426. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3427. BEGIN
  3428. IF Trace THEN TraceEnter("VisitConversion") END;
  3429. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3430. dest := destination; destination := emptyOperand;
  3431. Evaluate(x.expression,old);
  3432. InitOperand(result,ModeValue);
  3433. result.op := old.op;
  3434. ASSERT(result.op.mode # 0);
  3435. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3436. (* convert TO a complex number *)
  3437. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3438. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3439. ASSERT(result.op.mode # 0);
  3440. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3441. (* convert FROM a complex number TO a complex number*)
  3442. result.tag := old.tag;
  3443. ASSERT(result.tag.mode # 0);
  3444. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3445. ASSERT(result.tag.mode # 0)
  3446. ELSE
  3447. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3448. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3449. END
  3450. ELSE
  3451. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3452. ASSERT(result.op.mode # 0);
  3453. result.tag := old.tag; (*! probably never used *)
  3454. END;
  3455. destination := dest;
  3456. IF Trace THEN TraceExit("VisitConversion") END;
  3457. END VisitConversion;
  3458. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3459. BEGIN
  3460. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3461. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3462. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3463. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3464. END VisitTypeDeclaration;
  3465. (** designators (expressions) *)
  3466. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3467. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3468. BEGIN
  3469. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3470. IF x.left # NIL THEN Expression(x.left) END;
  3471. Symbol(x.symbol,result);
  3472. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3473. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3474. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3475. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3476. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3477. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3478. END;
  3479. END;
  3480. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3481. END VisitSymbolDesignator;
  3482. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3483. BEGIN
  3484. IF isUnchecked THEN RETURN END;
  3485. IF tagsAvailable THEN
  3486. TrapC(BrltL,index,length,IndexCheckTrap);
  3487. END;
  3488. END BoundCheck;
  3489. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3490. VAR d: IntermediateCode.Operand;
  3491. BEGIN
  3492. IF isUnchecked THEN RETURN END;
  3493. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3494. TrapC(op,dim,d,ArraySizeTrap);
  3495. ReleaseIntermediateOperand(d);
  3496. END DimensionCheck;
  3497. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3498. VAR
  3499. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3500. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3501. expression: SyntaxTree.Expression;
  3502. resultingType, leftType, baseType: SyntaxTree.Type;
  3503. skipLabel1: Label;
  3504. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3505. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3506. variableOp: Operand;
  3507. variable: SyntaxTree.Variable;
  3508. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3509. VAR expression: SyntaxTree.Expression;
  3510. BEGIN
  3511. (* count the number of indices, ranges and tensorRanges in the index list *)
  3512. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3513. FOR i := 0 TO parameters.Length() - 1 DO
  3514. expression := parameters.GetExpression(i);
  3515. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3516. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3517. ELSE INC(indexCount)
  3518. END
  3519. END;
  3520. END CountIndices;
  3521. BEGIN
  3522. ASSERT(tagsAvailable);
  3523. resultingType := x.type.resolved; (* resulting type *)
  3524. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3525. InitOperand(localResult, ModeReference);
  3526. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3527. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3528. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3529. (* a globally defined array destination tag is available -> use and invalidate it*)
  3530. localResult.tag := arrayDestinationTag;
  3531. IntermediateCode.InitOperand(arrayDestinationTag)
  3532. ELSE
  3533. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3534. (* the result is of array range type and thus does not provide any collectable pointers *)
  3535. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3536. Symbol(variable, variableOp);
  3537. ReuseCopy(localResult.tag, variableOp.op);
  3538. ReleaseOperand(variableOp);
  3539. END
  3540. END;
  3541. indexListSize := x.parameters.Length();
  3542. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3543. ASSERT(tensorRangeCount <= 1);
  3544. (* designate the array to be indexed over, perform tensor range check if known *)
  3545. Designate(x.left, array);
  3546. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3547. Dereference(array, leftType,FALSE);
  3548. IF tensorRangeCount=0 THEN
  3549. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3550. END
  3551. END;
  3552. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3553. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3554. srcDimOffset := -indexListSize;
  3555. destDimOffset := -rangeCount
  3556. ELSE
  3557. srcDimOffset := 0;
  3558. destDimOffset := 0
  3559. END;
  3560. indexDim := 0;
  3561. (* use address of source array as basis *)
  3562. (*
  3563. ReuseCopy(localResult.op, array.op);
  3564. *)
  3565. localResult.op := array.op;
  3566. UseIntermediateOperand(localResult.op);
  3567. (* go through the index list *)
  3568. FOR i := 0 TO indexListSize - 1 DO
  3569. expression := x.parameters.GetExpression(i);
  3570. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3571. (* nothing to do *)
  3572. ELSE
  3573. (* determine which dimension of source array is currently looked at *)
  3574. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3575. (* get the memory operand pointing to array descriptor dimension *)
  3576. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3577. (* make a reusable register from it *)
  3578. ReuseCopy(srcDim, tmp);
  3579. ReleaseIntermediateOperand(tmp);
  3580. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3581. ELSE
  3582. srcDim := IntermediateCode.Immediate(int32, i)
  3583. END;
  3584. (* get length and increment of source array for current dimension *)
  3585. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3586. Convert(sourceLength.op, sizeType);
  3587. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3588. Convert(sourceIncrement.op, sizeType);
  3589. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3590. ReleaseIntermediateOperand(srcDim);
  3591. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3592. (* SINGLE INDEX *)
  3593. Evaluate(expression, index);
  3594. ReleaseIntermediateOperand(index.tag);
  3595. index.tag := emptyOperand;
  3596. Convert(index.op, sizeType);
  3597. (* lower bound check *)
  3598. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3599. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3600. ELSIF isUnchecked THEN (* do nothing *)
  3601. ELSE
  3602. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3603. END;
  3604. (* upper bound check *)
  3605. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3606. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3607. ELSIF isUnchecked THEN (* do nothing *)
  3608. ELSE
  3609. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3610. END;
  3611. ReleaseOperand(sourceLength);
  3612. Convert(index.op, addressType);
  3613. summand := index.op;
  3614. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3615. (* RANGE OF INDICES *)
  3616. Evaluate(expression, range);
  3617. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3618. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3619. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3620. ReleaseOperand(range);
  3621. Convert(firstIndex, sizeType);
  3622. Convert(lastIndex, sizeType);
  3623. Convert(stepSize, sizeType);
  3624. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3625. if it is 'MAX(LONGINT)' *)
  3626. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3627. TransferToRegister(lastIndex, lastIndex);
  3628. skipLabel1 := NewLabel();
  3629. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3630. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3631. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3632. SetLabel(skipLabel1)
  3633. END;
  3634. (* check if step size is valid *)
  3635. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3636. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3637. ELSIF isUnchecked THEN (* do nothing *)
  3638. ELSE
  3639. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3640. END;
  3641. (* check lower bound check *)
  3642. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3643. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3644. ELSIF isUnchecked THEN (* do nothing *)
  3645. ELSE
  3646. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3647. END;
  3648. (* check upper bound check *)
  3649. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3650. (* statically open range: nothing to do *)
  3651. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3652. ASSERT(staticLastIndex < staticSourceLength)
  3653. ELSIF isUnchecked THEN (* do nothing *)
  3654. ELSE
  3655. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3656. END;
  3657. (* determine length of target array for current dimension *)
  3658. (* 1. incorporate last index: *)
  3659. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3660. (* last index is static *)
  3661. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3662. targetLength := sourceLength.op
  3663. ELSE
  3664. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3665. END;
  3666. UseIntermediateOperand(targetLength);
  3667. ELSE
  3668. (* targetLength := lastIndex + 1
  3669. Reuse1(targetLength, lastIndex);
  3670. *)
  3671. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3672. END;
  3673. ReleaseOperand(sourceLength);
  3674. ReleaseIntermediateOperand(lastIndex);
  3675. (* 2. incorporate first index: *)
  3676. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3677. (* first index and current target length are static *)
  3678. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3679. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3680. (* first index = 0: nothing to do *)
  3681. ELSE
  3682. (* targetLength := targetLength - firstIndex *)
  3683. TransferToRegister(targetLength, targetLength);
  3684. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3685. END;
  3686. (* clip negative lengths to 0 *)
  3687. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3688. IF staticTargetLength < 0 THEN
  3689. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3690. END
  3691. ELSE
  3692. skipLabel1 := NewLabel();
  3693. TransferToRegister(targetLength, targetLength);
  3694. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3695. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3696. SetLabel(skipLabel1)
  3697. END;
  3698. (* 3. incorporate index step size: *)
  3699. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3700. (*step size and current target length are static *)
  3701. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3702. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3703. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3704. (* step size = 1: nothing to do *)
  3705. ELSE
  3706. (* emit code for this:
  3707. targetLength := (targetLength-1) DIV stepSize +1;
  3708. *)
  3709. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3710. DivInt(targetLength, targetLength, stepSize);
  3711. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3712. END;
  3713. (* determine increment of target array for current dimension *)
  3714. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3715. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3716. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3717. (* step size = 1 *)
  3718. targetIncrement := sourceIncrement.op;
  3719. UseIntermediateOperand(targetIncrement)
  3720. ELSE
  3721. (* targetIncrement := sourceIncrement * stepSize *)
  3722. Reuse1(targetIncrement, stepSize);
  3723. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3724. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3725. END;
  3726. ReleaseIntermediateOperand(stepSize);
  3727. (* write length and increment of target array to descriptor *)
  3728. IF destDimOffset < 0 THEN
  3729. (* determine which dimension of target array is currently looked at *)
  3730. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3731. TransferToRegister(destDim, tmp);
  3732. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3733. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3734. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3735. ReleaseIntermediateOperand(destDim)
  3736. ELSE
  3737. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3738. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3739. END;
  3740. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3741. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3742. INC(indexDim);
  3743. Convert(firstIndex, addressType);
  3744. TransferToRegister(summand, firstIndex);
  3745. ELSE HALT(100);
  3746. END;
  3747. (*
  3748. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3749. *)
  3750. Convert(sourceIncrement.op, addressType);
  3751. Convert(summand, addressType);
  3752. MulInt(summand, summand, sourceIncrement.op);
  3753. ReleaseIntermediateOperand(sourceIncrement.op);
  3754. AddInt(localResult.op, localResult.op, summand);
  3755. ReleaseIntermediateOperand(summand);
  3756. END
  3757. END;
  3758. result := localResult;
  3759. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3760. ReleaseIntermediateOperand(result.tag);
  3761. result.tag := TypeDescriptorAdr(resultingType);
  3762. IF ~newObjectFile THEN
  3763. IntermediateCode.MakeMemory(result.tag,addressType);
  3764. END;
  3765. ELSIF IsDelegate(resultingType) THEN
  3766. ReleaseIntermediateOperand(result.tag);
  3767. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3768. UseIntermediateOperand(result.tag);
  3769. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3770. ReleaseIntermediateOperand(result.tag);
  3771. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3772. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3773. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3774. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3775. (* finalize target array descriptor *)
  3776. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3777. (* write lengths and increments of target array for remaining dimensions *)
  3778. i := indexListSize;
  3779. WHILE indexDim < targetArrayDimensionality DO
  3780. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3781. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3782. ReleaseOperand(sourceLength);
  3783. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3784. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3785. ReleaseOperand(sourceIncrement);
  3786. INC(i); INC(indexDim);
  3787. END;
  3788. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3789. tmp := nil;
  3790. ELSE
  3791. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3792. END;
  3793. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3794. ReleaseIntermediateOperand(tmp);
  3795. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3796. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3797. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3798. ELSE
  3799. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3800. END;
  3801. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3802. ReleaseIntermediateOperand(tmp);
  3803. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3804. (* write dimensionality *)
  3805. IF targetArrayDimensionality # 0 THEN
  3806. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3807. END;
  3808. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3809. END;
  3810. ReleaseOperand(array);
  3811. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3812. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3813. END;
  3814. END MathIndexDesignator;
  3815. (* get the length of an array , trying to make use of static information *)
  3816. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3817. VAR res: IntermediateCode.Operand; size: LONGINT;
  3818. BEGIN
  3819. type := type.resolved;
  3820. IF type IS SyntaxTree.ArrayType THEN
  3821. WITH type: SyntaxTree.ArrayType DO
  3822. IF type.form = SyntaxTree.Static THEN
  3823. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3824. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3825. Evaluate(type.length, op);
  3826. ReleaseIntermediateOperand(op.tag);
  3827. RETURN op.op;*)
  3828. ELSE
  3829. res := tag;
  3830. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3831. IntermediateCode.MakeMemory(res,addressType);
  3832. UseIntermediateOperand(res);
  3833. RETURN res
  3834. END
  3835. END;
  3836. ELSE
  3837. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3838. RETURN IntermediateCode.Immediate(addressType,size);
  3839. END;
  3840. END ArrayLength;
  3841. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3842. BEGIN
  3843. IF IsImmediate(x) THEN
  3844. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3845. ELSE
  3846. IF ~ReusableRegister(res) THEN
  3847. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3848. ELSE
  3849. UseIntermediateOperand(res);
  3850. END;
  3851. Emit(Mov(position,res,x))
  3852. END;
  3853. END CopyInt;
  3854. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3855. BEGIN
  3856. ReleaseIntermediateOperand(res);
  3857. IF IsImmediate(x) & IsImmediate(y) THEN
  3858. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3859. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3860. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3861. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3862. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3863. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3864. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3865. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3866. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3867. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3868. UseIntermediateOperand(res);
  3869. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3870. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3871. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3872. UseIntermediateOperand(res);
  3873. ELSE
  3874. IF ~ReusableRegister(res) THEN
  3875. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3876. ELSE
  3877. UseIntermediateOperand(res);
  3878. END;
  3879. IF IsImmediate(x) & (x.intValue = 0) THEN
  3880. Emit(Mov(position,res,y))
  3881. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3882. Emit(Mov(position,res,x))
  3883. ELSE
  3884. Emit(Add(position,res, x, y));
  3885. END;
  3886. END;
  3887. END AddInt;
  3888. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3889. BEGIN
  3890. ReleaseIntermediateOperand(res);
  3891. IF IsImmediate(x) & IsImmediate(y) THEN
  3892. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3893. ELSE
  3894. IF ~ReusableRegister(res) THEN
  3895. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3896. ELSE UseIntermediateOperand(res);
  3897. END;
  3898. IF IsImmediate(x) & (x.intValue = 1) THEN
  3899. Emit(Mov(position,res,y))
  3900. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3901. Emit(Mov(position,res,x))
  3902. ELSE
  3903. Emit(Mul(position,res, x, y));
  3904. END;
  3905. END;
  3906. END MulInt;
  3907. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3908. BEGIN
  3909. ReleaseIntermediateOperand(res);
  3910. IF IsImmediate(x) & IsImmediate(y) THEN
  3911. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3912. ELSE
  3913. IF ~ReusableRegister(res) THEN
  3914. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3915. ELSE UseIntermediateOperand(res);
  3916. END;
  3917. IF IsImmediate(x) & (x.intValue = 1) THEN
  3918. Emit(Mov(position,res,y))
  3919. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3920. Emit(Mov(position,res,x))
  3921. ELSE
  3922. Emit(Div(position,res, x, y));
  3923. END;
  3924. END;
  3925. END DivInt;
  3926. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3927. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3928. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3929. BEGIN
  3930. type := x.left.type.resolved;
  3931. IF type IS SyntaxTree.StringType THEN
  3932. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3933. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3934. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3935. type := atype;
  3936. x.left.SetType(type);
  3937. END;
  3938. IntermediateCode.InitImmediate(res,addressType,0);
  3939. maxDim := x.parameters.Length()-1;
  3940. (*
  3941. computation rule:
  3942. a: ARRAY X,Y,Z OF Element with size S
  3943. a[i,j,k] -->
  3944. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3945. *)
  3946. FOR i := 0 TO maxDim DO
  3947. e := x.parameters.GetExpression(i);
  3948. Evaluate(e,index);
  3949. Convert(index.op,addressType);
  3950. AddInt(res, res, index.op);
  3951. IF i = 0 THEN
  3952. (*
  3953. ReuseCopy(res, index.op);
  3954. *)
  3955. Designate(x.left,array);
  3956. type := x.left.type.resolved;
  3957. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3958. Dereference(array, type, FALSE);
  3959. END;
  3960. (*
  3961. ELSE AddInt(res, res, index.op);
  3962. *)
  3963. END;
  3964. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3965. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3966. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3967. BoundCheck(index.op, length);
  3968. END;
  3969. ReleaseIntermediateOperand(length);
  3970. END;
  3971. ReleaseOperand(index);
  3972. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3973. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3974. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3975. MulInt(res,res,length);
  3976. END;
  3977. ReleaseIntermediateOperand(length);
  3978. END;
  3979. (* remaining open dimensions -- compute address *)
  3980. i := maxDim+1;
  3981. IF type IS SyntaxTree.ArrayType THEN
  3982. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3983. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  3984. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  3985. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3986. MulInt(res,res,length);
  3987. END;
  3988. ReleaseIntermediateOperand(length);
  3989. INC(i);
  3990. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  3991. END;
  3992. END;
  3993. IF (type IS SyntaxTree.ArrayType) THEN
  3994. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3995. size := StaticSize(system, type);
  3996. IF size # 1 THEN
  3997. length := IntermediateCode.Immediate(addressType,size);
  3998. MulInt(res,res,length);
  3999. END;
  4000. ELSE
  4001. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4002. IF size # 1 THEN
  4003. length := IntermediateCode.Immediate(addressType,size);
  4004. MulInt(res,res,length);
  4005. END;
  4006. END;
  4007. END;
  4008. AddInt(res,res,array.op);
  4009. InitOperand(result,ModeReference);
  4010. result.op := res;
  4011. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4012. ReleaseIntermediateOperand(result.tag);
  4013. result.tag := TypeDescriptorAdr(type);
  4014. IF ~newObjectFile THEN
  4015. IntermediateCode.MakeMemory(result.tag,addressType);
  4016. END
  4017. ELSIF IsDelegate(type) THEN
  4018. ReleaseIntermediateOperand(result.tag);
  4019. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4020. UseIntermediateOperand(result.tag);
  4021. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4022. ReleaseIntermediateOperand(result.tag);
  4023. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4024. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4025. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4026. END;
  4027. ReleaseOperand(array);
  4028. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4029. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4030. END;
  4031. END IndexDesignator;
  4032. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4033. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4034. BEGIN
  4035. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4036. dest := destination; destination := emptyOperand;
  4037. type := x.left.type.resolved;
  4038. IF type IS SyntaxTree.MathArrayType THEN
  4039. MathIndexDesignator(x);
  4040. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4041. IndexDesignator(x);
  4042. END;
  4043. destination := dest;
  4044. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4045. END VisitIndexDesignator;
  4046. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4047. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4048. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4049. procedure: SyntaxTree.Procedure;
  4050. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4051. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4052. BEGIN
  4053. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4054. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4055. parameters := expression.parameters;
  4056. moduleName := "FoxArrayBase";
  4057. procedureName := "CopyDescriptor";
  4058. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4059. SaveRegisters();ReleaseUsedRegisters(saved);
  4060. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4061. IF procedure = NIL THEN
  4062. s := "procedure ";
  4063. Strings.Append(s,moduleName);
  4064. Strings.Append(s,".");
  4065. Strings.Append(s,procedureName);
  4066. Strings.Append(s," not present");
  4067. Error(position,s);
  4068. ELSE
  4069. (* push address of temporary variable *)
  4070. Symbol(variable,destOperand);
  4071. Emit(Push(position,destOperand.op));
  4072. ReleaseOperand(destOperand);
  4073. (* push src *)
  4074. Evaluate(expression.left,srcOperand);
  4075. (*
  4076. Dereference(srcOperand,expression.type.resolved);
  4077. Emit(Push(position,srcOperand.tag));
  4078. *)
  4079. Emit(Push(position,srcOperand.op));
  4080. ReleaseOperand(srcOperand);
  4081. tensorFound := FALSE;
  4082. FOR i := 0 TO parameters.Length()-1 DO
  4083. e := parameters.GetExpression(i);
  4084. IF e IS SyntaxTree.TensorRangeExpression THEN
  4085. tensorFound := TRUE;
  4086. ELSIF e IS SyntaxTree.RangeExpression THEN
  4087. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4088. ELSE
  4089. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4090. END;
  4091. END;
  4092. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4093. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4094. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4095. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4096. StaticCallOperand(procOp,procedure);
  4097. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4098. ReleaseOperand(procOp);
  4099. END;
  4100. RestoreRegisters(saved);
  4101. END;
  4102. RETURN variable
  4103. END PrepareTensorDescriptor;
  4104. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4105. VAR
  4106. type, descriptorType, baseType: SyntaxTree.Type;
  4107. operand, tmpOperand, variableOp, variable2Op: Operand;
  4108. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4109. variable, variable2: SyntaxTree.Variable;
  4110. dim, i, size: LONGINT;
  4111. (* TODO: needed? *)
  4112. oldArrayDestinationTag: IntermediateCode.Operand;
  4113. oldArrayDestinationDimension: LONGINT;
  4114. position: Position;
  4115. saved: RegisterEntry;
  4116. arrayFlags: SET;
  4117. m, n: LONGINT;
  4118. PROCEDURE Pass(op: IntermediateCode.Operand);
  4119. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4120. BEGIN
  4121. IF numberRegister >= 0 THEN
  4122. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4123. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4124. Emit(Mov(position,parameterRegister, op));
  4125. ELSE
  4126. Emit(Push(position,op))
  4127. END
  4128. END Pass;
  4129. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4130. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4131. BEGIN
  4132. formalType := formalType.resolved; actualType := actualType.resolved;
  4133. IF IsOpenArray(formalType)THEN
  4134. IF actualType IS SyntaxTree.StringType THEN
  4135. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4136. RETURN;
  4137. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4138. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4139. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4140. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4141. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4142. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4143. ELSE
  4144. tmp := baseReg;
  4145. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4146. IntermediateCode.MakeMemory(tmp,addressType);
  4147. Pass((tmp));
  4148. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4149. END;
  4150. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4151. END;
  4152. END PushArrayLens;
  4153. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4154. BEGIN
  4155. CASE size OF
  4156. |2: INCL(flags,Size2Flag);
  4157. |3: INCL(flags,Size3Flag);
  4158. |4: INCL(flags,Size4Flag);
  4159. |5: INCL(flags,Size5Flag);
  4160. |6: INCL(flags,Size6Flag);
  4161. |7: INCL(flags,Size7Flag);
  4162. |8: INCL(flags,Size8Flag);
  4163. END;
  4164. END SetSmallArraySizeFlag;
  4165. BEGIN
  4166. IF Trace THEN TraceEnter("PushParameter") END;
  4167. position := expression.position;
  4168. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4169. type := expression.type.resolved;
  4170. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4171. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4172. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4173. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4174. );
  4175. (* TODO: needed? *)
  4176. oldArrayDestinationTag := arrayDestinationTag;
  4177. oldArrayDestinationDimension := arrayDestinationDimension;
  4178. IF IsArrayOfSystemByte(parameter.type) THEN
  4179. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4180. Designate(expression,operand);
  4181. ELSE
  4182. Evaluate(expression, tmpOperand);
  4183. (* array of system byte does not provide any pointers *)
  4184. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4185. Symbol(variable, operand);
  4186. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4187. Emit(Mov(position,tmp, tmpOperand.op));
  4188. ReleaseOperand(tmpOperand);
  4189. END;
  4190. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4191. ReleaseIntermediateOperand(operand.tag);
  4192. operand.tag := tmp;
  4193. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4194. Pass((operand.tag));
  4195. END;
  4196. Pass((operand.op));
  4197. ELSIF IsOpenArray(parameter.type) THEN
  4198. Designate(expression,operand);
  4199. baseReg := operand.tag;
  4200. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4201. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4202. END;
  4203. Pass((operand.op)); (* address of the array *)
  4204. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4205. (* case 1
  4206. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4207. *)
  4208. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4209. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4210. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4211. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4212. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4213. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4214. arrayDestinationTag := sp;
  4215. (* case 1b
  4216. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4217. *)
  4218. IF expression IS SyntaxTree.IndexDesignator THEN
  4219. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4220. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4221. arrayDestinationDimension := dim;
  4222. Designate(expression,operand);
  4223. (* case 1a
  4224. P(...,A,...) push: push array descriptor to stack
  4225. *)
  4226. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4227. Designate(expression,operand);
  4228. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4229. i := 0;
  4230. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4231. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4232. INC(i);
  4233. END;
  4234. type := expression.type.resolved;
  4235. WHILE (i<dim) DO (* remaining static dimensions *)
  4236. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4237. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4238. ReleaseOperand(tmpOperand);
  4239. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4240. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4241. ReleaseOperand(tmpOperand);
  4242. INC(i);
  4243. END;
  4244. dimOp := IntermediateCode.Immediate(addressType,dim);
  4245. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4246. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4247. (* case 1d
  4248. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4249. + case 1e
  4250. P(.. PT() ... );
  4251. *)
  4252. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4253. Designate(expression,operand);
  4254. Dereference(operand,type.resolved,FALSE);
  4255. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4256. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4257. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4258. (* case 1f
  4259. P(...,S,...) push: create array descriptor to S on stack
  4260. case 1g
  4261. P(... PS()...)
  4262. *)
  4263. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4264. Designate(expression,operand);
  4265. FOR i := 0 TO dim-1 DO
  4266. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4267. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4268. ReleaseOperand(tmpOperand);
  4269. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4270. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4271. ReleaseOperand(tmpOperand);
  4272. END;
  4273. (*******
  4274. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4275. *)
  4276. arrayFlags := {StaticFlag};
  4277. IF dim = 1 THEN
  4278. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4279. ReleaseOperand(tmpOperand);
  4280. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4281. m := LONGINT(tmpOperand.op.intValue);
  4282. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4283. ELSIF dim = 2 THEN
  4284. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4285. ReleaseOperand(tmpOperand);
  4286. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4287. m := LONGINT(tmpOperand.op.intValue);
  4288. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4289. ReleaseOperand(tmpOperand);
  4290. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4291. n := LONGINT(tmpOperand.op.intValue);
  4292. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4293. INCL(arrayFlags,SmallMatrixFlag);
  4294. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4295. END;
  4296. END;
  4297. (*******)
  4298. dimOp := IntermediateCode.Immediate(addressType,dim);
  4299. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4300. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4301. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4302. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4303. baseType := SemanticChecker.ArrayBase(type,dim);
  4304. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4305. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4306. ELSE HALT(100);
  4307. END;
  4308. (* case 2
  4309. procedure P([left args], var A: array [*,*] of Type, [right args])
  4310. *)
  4311. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4312. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4313. (* case 2b
  4314. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4315. push: push reference to pushed array descriptor
  4316. post: remove array descriptor.
  4317. *)
  4318. IF expression IS SyntaxTree.IndexDesignator THEN
  4319. descriptorType := GetMathArrayDescriptorType(dim);
  4320. (* range type : no allocation possible, should be untraced *)
  4321. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4322. Symbol(variable,variableOp);
  4323. arrayDestinationTag := variableOp.op;
  4324. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4325. arrayDestinationDimension := dim;
  4326. NeedDescriptor := TRUE;
  4327. Designate(expression,operand);
  4328. Pass((operand.tag));
  4329. NeedDescriptor := FALSE;
  4330. (* case 2a
  4331. P(...,A,...)
  4332. push: push reference to array descriptor on stack
  4333. *)
  4334. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4335. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4336. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4337. INC(i);
  4338. END;
  4339. IF i = dim THEN
  4340. Designate(expression,operand);
  4341. Pass((operand.tag));
  4342. ELSE (* open-static *)
  4343. type := expression.type.resolved;
  4344. descriptorType := GetMathArrayDescriptorType(dim);
  4345. (* static array , cannot be reallocated, untraced !*)
  4346. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4347. Symbol(variable,variableOp);
  4348. arrayDestinationTag := variableOp.op;
  4349. Designate(expression,operand);
  4350. FOR i := 0 TO dim-1 DO
  4351. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4352. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4353. ReleaseOperand(tmpOperand);
  4354. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4355. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4356. ReleaseOperand(tmpOperand);
  4357. END;
  4358. dimOp := IntermediateCode.Immediate(addressType,dim);
  4359. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4360. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4361. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4362. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4363. baseType := SemanticChecker.ArrayBase(type,dim);
  4364. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4365. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4366. Pass((arrayDestinationTag));
  4367. END;
  4368. (* case 2d
  4369. P(...,T,...) push: emit dimension check, push T
  4370. *)
  4371. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4372. Designate(expression,operand);
  4373. Dereference(operand,type.resolved,FALSE);
  4374. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4375. Pass((operand.tag));
  4376. (* case 2f
  4377. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4378. push: push reference to pushed array descriptor
  4379. post: remove array descriptor
  4380. *)
  4381. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4382. descriptorType := GetMathArrayDescriptorType(dim);
  4383. (* static array -- cannot be reallocatated, untraced *)
  4384. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4385. Symbol(variable,variableOp);
  4386. arrayDestinationTag := variableOp.op;
  4387. Designate(expression,operand);
  4388. FOR i := 0 TO dim-1 DO
  4389. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4390. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4391. ReleaseOperand(tmpOperand);
  4392. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4393. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4394. ReleaseOperand(tmpOperand);
  4395. END;
  4396. (*
  4397. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4398. *)
  4399. arrayFlags := {StaticFlag};
  4400. IF dim = 1 THEN
  4401. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4402. ReleaseOperand(tmpOperand);
  4403. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4404. m := LONGINT(tmpOperand.op.intValue);
  4405. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4406. ELSIF dim = 2 THEN
  4407. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4408. ReleaseOperand(tmpOperand);
  4409. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4410. m := LONGINT(tmpOperand.op.intValue);
  4411. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4412. ReleaseOperand(tmpOperand);
  4413. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4414. n := LONGINT(tmpOperand.op.intValue);
  4415. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4416. INCL(arrayFlags,SmallMatrixFlag);
  4417. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4418. END;
  4419. END;
  4420. (*******)
  4421. dimOp := IntermediateCode.Immediate(addressType,dim);
  4422. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4423. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4424. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4425. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4426. baseType := SemanticChecker.ArrayBase(type,dim);
  4427. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4428. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4429. Pass((arrayDestinationTag));
  4430. ELSE HALT(100);
  4431. END;
  4432. (* case 3
  4433. procedure P([left args], [const] A: array [?] of Type, [right args])
  4434. *)
  4435. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4436. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4437. (* case 3b
  4438. P(...,A[a..b,c..d],...)
  4439. *)
  4440. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4441. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4442. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4443. Symbol(variable,variableOp);
  4444. LoadValue(variableOp,system.addressType);
  4445. ELSE
  4446. descriptorType := GetMathArrayDescriptorType(dim);
  4447. (* range -- cannot be reallocated *)
  4448. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4449. Symbol(variable,variableOp);
  4450. END;
  4451. arrayDestinationTag := variableOp.op;
  4452. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4453. arrayDestinationDimension := 0;
  4454. Designate(expression,operand);
  4455. Pass((operand.tag));
  4456. (* case 3a
  4457. P(...,A,...)
  4458. *)
  4459. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4460. i := 0;
  4461. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4462. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4463. INC(i);
  4464. END;
  4465. IF i = dim THEN
  4466. Designate(expression,operand);
  4467. Pass((operand.tag));
  4468. ELSE (* open-static *)
  4469. type := expression.type.resolved;
  4470. descriptorType := GetMathArrayDescriptorType(dim);
  4471. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4472. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4473. Symbol(variable,variableOp);
  4474. arrayDestinationTag := variableOp.op;
  4475. Designate(expression,operand);
  4476. FOR i := 0 TO dim-1 DO
  4477. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4478. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4479. ReleaseOperand(tmpOperand);
  4480. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4481. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4482. ReleaseOperand(tmpOperand);
  4483. END;
  4484. dimOp := IntermediateCode.Immediate(addressType,dim);
  4485. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4486. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4487. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4488. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4489. baseType := SemanticChecker.ArrayBase(type,dim);
  4490. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4491. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4492. Pass((arrayDestinationTag));
  4493. END;
  4494. (* case 3d
  4495. P(...,T,...)
  4496. case 3e
  4497. P(...,PT(...),...)
  4498. *)
  4499. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4500. Designate(expression,operand);
  4501. Dereference(operand,type.resolved,FALSE);
  4502. Pass((operand.tag));
  4503. (* case 3f
  4504. P(...,S,...)
  4505. case 3g
  4506. P(...,PS(...),...)
  4507. *)
  4508. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4509. descriptorType := GetMathArrayDescriptorType(dim);
  4510. (* static array does not need to be traced *)
  4511. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4512. Symbol(variable,variableOp);
  4513. arrayDestinationTag := variableOp.op;
  4514. Designate(expression,operand);
  4515. IF operand.op.type.length >1 THEN (* vector register *)
  4516. (* static array does not need to be traced *)
  4517. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4518. Symbol(variable2, variable2Op);
  4519. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4520. Emit(Mov(position,tmp, operand.op));
  4521. ReleaseOperand(operand);
  4522. Symbol(variable2, operand);
  4523. END;
  4524. FOR i := 0 TO dim-1 DO
  4525. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4526. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4527. ReleaseOperand(tmpOperand);
  4528. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4529. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4530. ReleaseOperand(tmpOperand);
  4531. END;
  4532. dimOp := IntermediateCode.Immediate(addressType,dim);
  4533. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4534. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4535. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4536. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4537. baseType := SemanticChecker.ArrayBase(type,dim);
  4538. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4539. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4540. Pass((arrayDestinationTag));
  4541. ELSE HALT(100);
  4542. END;
  4543. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4544. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4545. (* case 4b
  4546. P(...,A[a..b,c..d],...)
  4547. *)
  4548. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4549. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4550. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4551. Symbol(variable,variableOp);
  4552. LoadValue(variableOp,system.addressType);
  4553. ELSE
  4554. descriptorType := GetMathArrayDescriptorType(dim);
  4555. (* range array -- cannot be allocated *)
  4556. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4557. Symbol(variable,variableOp);
  4558. END;
  4559. arrayDestinationTag := variableOp.op;
  4560. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4561. arrayDestinationDimension := 0;
  4562. Designate(expression,operand);
  4563. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4564. Symbol(variable,variableOp);
  4565. ELSE
  4566. (* alias to range -- untraced *)
  4567. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4568. Symbol(variable,variableOp);
  4569. MakeMemory(tmp,variableOp.op,addressType,0);
  4570. Emit(Mov(position,tmp,operand.tag));
  4571. ReleaseIntermediateOperand(tmp);
  4572. END;
  4573. Pass((variableOp.op));
  4574. ReleaseOperand(variableOp);
  4575. (* case 4a
  4576. P(...,A,...)
  4577. *)
  4578. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4579. i := 0;
  4580. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4581. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4582. INC(i);
  4583. END;
  4584. IF i = dim THEN
  4585. Designate(expression,operand);
  4586. arrayDestinationTag := operand.tag;
  4587. ELSE (* open-static *)
  4588. type := expression.type.resolved;
  4589. descriptorType := GetMathArrayDescriptorType(dim);
  4590. (* static array -- untraced *)
  4591. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4592. Symbol(variable,variableOp);
  4593. arrayDestinationTag := variableOp.op;
  4594. Designate(expression,operand);
  4595. FOR i := 0 TO dim-1 DO
  4596. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4597. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4598. ReleaseOperand(tmpOperand);
  4599. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4600. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4601. ReleaseOperand(tmpOperand);
  4602. END;
  4603. dimOp := IntermediateCode.Immediate(addressType,dim);
  4604. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4605. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4606. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4607. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4608. baseType := SemanticChecker.ArrayBase(type,dim);
  4609. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4610. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4611. END;
  4612. (* tensor alias to open array -- untraced *)
  4613. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4614. Symbol(variable,variableOp);
  4615. MakeMemory(tmp,variableOp.op,addressType,0);
  4616. Emit(Mov(position,tmp,arrayDestinationTag));
  4617. ReleaseIntermediateOperand(tmp);
  4618. Pass((variableOp.op));
  4619. ReleaseOperand(variableOp);
  4620. (* case 4d
  4621. P(...,T,...)
  4622. *)
  4623. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4624. Designate(expression,operand);
  4625. Pass((operand.op));
  4626. (* case 4f
  4627. P(...,S,...)
  4628. *)
  4629. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4630. descriptorType := GetMathArrayDescriptorType(dim);
  4631. (* static array -- cannot be reallocated, untraced *)
  4632. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4633. Symbol(variable,variableOp);
  4634. arrayDestinationTag := variableOp.op;
  4635. Designate(expression,operand);
  4636. FOR i := 0 TO dim-1 DO
  4637. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4638. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4639. ReleaseOperand(tmpOperand);
  4640. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4641. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4642. ReleaseOperand(tmpOperand);
  4643. END;
  4644. dimOp := IntermediateCode.Immediate(addressType,dim);
  4645. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4646. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4647. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4648. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4649. baseType := SemanticChecker.ArrayBase(type,dim);
  4650. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4651. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4652. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4653. Symbol(variable,variableOp);
  4654. MakeMemory(tmp,variableOp.op,addressType,0);
  4655. Emit(Mov(position,tmp,arrayDestinationTag));
  4656. ReleaseIntermediateOperand(tmp);
  4657. Pass((variableOp.op));
  4658. ReleaseOperand(variableOp);
  4659. ELSE HALT(100);
  4660. END;
  4661. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4662. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4663. Designate(expression,operand);
  4664. IF operand.op.type.length > 1 THEN
  4665. Emit(Push(position, operand.op));
  4666. ELSE
  4667. size := system.SizeOf(type);
  4668. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4669. size := ToMemoryUnits(system,size);
  4670. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4671. arrayDestinationTag := sp;
  4672. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4673. END;
  4674. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4675. Designate(expression,operand);
  4676. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4677. (* static array no pointer *)
  4678. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4679. Symbol(variable,variableOp);
  4680. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4681. Emit(Mov(position,tmp,operand.op));
  4682. Emit(Push(position,variableOp.op));
  4683. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4684. Pass((operand.op));
  4685. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4686. END;
  4687. ELSE HALT(200)
  4688. END;
  4689. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4690. IF parameter.kind = SyntaxTree.VarParameter THEN
  4691. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4692. Designate(expression, operand);
  4693. Pass((operand.op));
  4694. ELSE
  4695. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4696. Evaluate(expression, operand);
  4697. Pass((operand.extra)); (* step *)
  4698. Pass((operand.tag)); (* last *)
  4699. Pass((operand.op)) (* first *)
  4700. END
  4701. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4702. IF parameter.kind = SyntaxTree.VarParameter THEN
  4703. Designate(expression, operand);
  4704. Pass((operand.op));
  4705. ELSE
  4706. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4707. Evaluate(expression, operand);
  4708. Pass((operand.tag)); (* real part *)
  4709. Pass((operand.op)) (* imaginary part *)
  4710. END
  4711. ELSE
  4712. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4713. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4714. Designate(expression,operand);
  4715. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4716. (* stack allocation *)
  4717. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4718. (*! parameter alignment to be discussed ... *)
  4719. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4720. size := type(SyntaxTree.StringType).length;
  4721. END;
  4722. IF backend.cooperative & parameter.NeedsTrace() THEN
  4723. dst := NewRegisterOperand (addressType);
  4724. Emit(Mov(position,dst, sp));
  4725. IntermediateCode.InitImmediate(null, byteType, 0);
  4726. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4727. ReleaseIntermediateOperand(dst);
  4728. SaveRegisters();ReleaseUsedRegisters(saved);
  4729. (* register dst has been freed before SaveRegisters already *)
  4730. CallAssignMethod(dst, operand.op, parameter.type);
  4731. RestoreRegisters(saved);
  4732. END;
  4733. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4734. ELSIF IsOpenArray(parameter.type) THEN
  4735. Designate(expression,operand);
  4736. baseReg := operand.tag;
  4737. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4738. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4739. END;
  4740. Pass((operand.op)); (* address of the array *)
  4741. ELSIF IsDelegate(parameter.type) THEN
  4742. Evaluate(expression,operand);
  4743. IF backend.cooperative & parameter.NeedsTrace() THEN
  4744. Emit(Push(position, nil));
  4745. dst := NewRegisterOperand (addressType);
  4746. Emit(Mov(position,dst, sp));
  4747. ReleaseIntermediateOperand(dst);
  4748. SaveRegisters();ReleaseUsedRegisters(saved);
  4749. Emit(Push(position, dst));
  4750. (* register dst has been freed before SaveRegisters already *)
  4751. Emit(Push(position, operand.tag));
  4752. CallThis(position,"GarbageCollector","Assign",2);
  4753. RestoreRegisters(saved);
  4754. ELSE
  4755. Pass((operand.tag));
  4756. END;
  4757. Pass((operand.op));
  4758. ELSE
  4759. Evaluate(expression,operand);
  4760. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4761. Emit(Push(position, nil));
  4762. dst := NewRegisterOperand (addressType);
  4763. Emit(Mov(position,dst, sp));
  4764. ReleaseIntermediateOperand(dst);
  4765. SaveRegisters();ReleaseUsedRegisters(saved);
  4766. Emit(Push(position, dst));
  4767. (* register dst has been freed before SaveRegisters already *)
  4768. Emit(Push(position, operand.op));
  4769. CallThis(position,"GarbageCollector","Assign",2);
  4770. RestoreRegisters(saved);
  4771. ELSE
  4772. Pass((operand.op));
  4773. END;
  4774. END;
  4775. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4776. Evaluate(expression,operand);
  4777. Pass((operand.op));
  4778. ELSE (* var parameter *)
  4779. Designate(expression,operand);
  4780. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4781. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4782. Pass((operand.tag));
  4783. END;
  4784. END;
  4785. Pass((operand.op));
  4786. END;
  4787. END;
  4788. (* TODO: needed? *)
  4789. arrayDestinationTag := oldArrayDestinationTag;
  4790. arrayDestinationDimension := oldArrayDestinationDimension;
  4791. IF needsParameterBackup THEN
  4792. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4793. ReuseCopy(parameterBackup, operand.op)
  4794. END;
  4795. ReleaseOperand(operand);
  4796. IF Trace THEN TraceExit("PushParameter") END;
  4797. END PushParameter;
  4798. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4799. VAR prevConditional: BOOLEAN;
  4800. BEGIN
  4801. prevConditional := conditional;
  4802. conditional := FALSE;
  4803. 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
  4804. Expression(x.result); (* use register *)
  4805. END;
  4806. Statement(x.statement);
  4807. conditional := prevConditional;
  4808. IF x.result # NIL THEN Expression(x.result) END;
  4809. 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
  4810. ReleaseIntermediateOperand(result.op);
  4811. END;
  4812. END VisitStatementDesignator;
  4813. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4814. VAR
  4815. procedure: SyntaxTree.Procedure;
  4816. procedureType: SyntaxTree.ProcedureType;
  4817. wasInline: BOOLEAN;
  4818. actualParameters: SyntaxTree.ExpressionList;
  4819. formalParameter: SyntaxTree.Parameter;
  4820. actualParameter: SyntaxTree.Expression;
  4821. i: LONGINT;
  4822. localVariable: SyntaxTree.Variable;
  4823. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4824. src, dest: Operand;
  4825. prevInlineExit : Label;
  4826. prevMapper: SymbolMapper;
  4827. tooComplex: BOOLEAN;
  4828. resultDesignator: SyntaxTree.Expression;
  4829. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4830. BEGIN
  4831. IF e = NIL THEN RETURN TRUE
  4832. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4833. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4834. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4835. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4836. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4837. ELSE RETURN FALSE
  4838. END;
  4839. END SimpleExpression;
  4840. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4841. BEGIN
  4842. RETURN checker.CanPassInRegister(type)
  4843. END FitsInRegister;
  4844. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4845. VAR
  4846. variable: SyntaxTree.Variable;
  4847. variableDesignator: SyntaxTree.Designator;
  4848. BEGIN
  4849. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4850. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4851. variableDesignator.SetType(type);
  4852. RETURN variableDesignator
  4853. END GetTemp;
  4854. BEGIN
  4855. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4856. wasInline := currentIsInline;
  4857. prevInlineExit := currentInlineExit;
  4858. prevMapper := currentMapper;
  4859. currentInlineExit := NewLabel();
  4860. tooComplex := FALSE;
  4861. NEW(currentMapper);
  4862. currentIsInline := TRUE;
  4863. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4864. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4865. formalParameter := procedureType.firstParameter;
  4866. actualParameters := x.parameters;
  4867. i := 0;
  4868. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4869. actualParameter := actualParameters.GetExpression(i);
  4870. IF actualParameter.resolved # NIL THEN
  4871. actualParameter := actualParameter.resolved
  4872. END;
  4873. (*
  4874. if expression is simple and can be passed immediately
  4875. or if type fits in register then we can proceed
  4876. otherwise we escape to ordinary procedure call.
  4877. *)
  4878. (* cases where the expression can be mapped identically *)
  4879. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4880. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4881. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4882. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4883. (*
  4884. Assign(variableDesignator, actualParameter);
  4885. *)
  4886. Evaluate(actualParameter, src);
  4887. Designate(variableDesignator, dest);
  4888. Emit(Mov(x.position, dest.op, src.op));
  4889. ReleaseOperand(dest);
  4890. ReleaseOperand(src);
  4891. (* the src operand should now have been completely released ! *)
  4892. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4893. ELSE tooComplex := TRUE
  4894. END;
  4895. (*
  4896. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4897. currentMapper.Add(formalParameter, actualParameter, NIL);
  4898. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4899. variableDesignator := GetTemp(system.addressType, FALSE);
  4900. Designate(actualParameter, src);
  4901. Designate(variableDesignator, dest);
  4902. IntermediateCode.MakeMemory(dest.op,addressType);
  4903. Emit(Mov(x.position, dest.op, src.op));
  4904. ReleaseOperand(dest);
  4905. IF src.tag.mode # IntermediateCode.Undefined THEN
  4906. tagDesignator := GetTemp(system.addressType, FALSE);
  4907. Designate(tagDesignator, dest);
  4908. IntermediateCode.MakeMemory(dest.op,addressType);
  4909. Emit(Mov(x.position, dest.op, src.op));
  4910. END;
  4911. ReleaseOperand(dest); ReleaseOperand(src);
  4912. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4913. END;
  4914. *)
  4915. formalParameter := formalParameter.nextParameter;
  4916. INC(i);
  4917. END;
  4918. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4919. IF resultDesignator # NIL THEN
  4920. returnDesignator := resultDesignator
  4921. ELSE
  4922. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4923. END;
  4924. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4925. END;
  4926. localVariable := procedure.procedureScope.firstVariable;
  4927. WHILE ~tooComplex & (localVariable # NIL) DO
  4928. variableDesignator := GetTemp(localVariable.type, FALSE);
  4929. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4930. localVariable := localVariable.nextVariable;
  4931. END;
  4932. IF ~tooComplex THEN
  4933. VisitStatementBlock(procedure.procedureScope.body);
  4934. SetLabel(currentInlineExit);
  4935. IF procedureType.returnType # NIL THEN
  4936. Designate(returnDesignator, result);
  4937. IF conditional THEN
  4938. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4939. ValueToCondition(result)
  4940. END;
  4941. END;
  4942. END;
  4943. currentMapper := prevMapper;
  4944. currentInlineExit := prevInlineExit;
  4945. currentIsInline := wasInline;
  4946. RETURN ~tooComplex
  4947. END InlineProcedureCall;
  4948. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4949. VAR
  4950. parameters: SyntaxTree.ExpressionList;
  4951. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4952. designator: SyntaxTree.Designator;
  4953. procedureType: SyntaxTree.ProcedureType;
  4954. formalParameter: SyntaxTree.Parameter;
  4955. operand, returnValue: Operand;
  4956. reg, size, mask, dest: IntermediateCode.Operand;
  4957. saved,saved2: RegisterEntry;
  4958. symbol: SyntaxTree.Symbol;
  4959. variable: SyntaxTree.Variable;
  4960. i, parametersSize, returnTypeSize : LONGINT;
  4961. structuredReturnType: BOOLEAN;
  4962. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4963. tempVariableDesignator: SyntaxTree.Designator;
  4964. gap, alignment: LONGINT; (*fld*)
  4965. (* TODO: remove unnecessary backup variables *)
  4966. oldResult: Operand;
  4967. oldCurrentScope: SyntaxTree.Scope;
  4968. oldArrayDestinationTag: IntermediateCode.Operand;
  4969. oldArrayDestinationDimension: LONGINT;
  4970. oldConstantDeclaration: SyntaxTree.Symbol;
  4971. oldDestination: IntermediateCode.Operand;
  4972. oldCurrentLoop: Label;
  4973. oldConditional: BOOLEAN;
  4974. oldTrueLabel, oldFalseLabel: Label;
  4975. oldLocked: BOOLEAN;
  4976. usedRegisters,oldUsedRegisters: RegisterEntry;
  4977. return: IntermediateCode.Operand;
  4978. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4979. arg: IntermediateCode.Operand;
  4980. dummy: IntermediateCode.Operand;
  4981. recordType: SyntaxTree.RecordType;
  4982. operatorSelectionProcedureOperand: Operand;
  4983. operatorSelectionProcedure: SyntaxTree.Procedure;
  4984. fingerPrint: SyntaxTree.FingerPrint;
  4985. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4986. identifierNumber: LONGINT;
  4987. parameterRegister: Backend.Registers;
  4988. parameterRegisters: LONGINT;
  4989. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4990. procedure: SyntaxTree.Procedure;
  4991. PROCEDURE BackupGlobalState;
  4992. BEGIN
  4993. oldResult := result;
  4994. oldCurrentScope := currentScope;
  4995. oldArrayDestinationTag := arrayDestinationTag;
  4996. oldArrayDestinationDimension := arrayDestinationDimension;
  4997. oldConstantDeclaration := constantDeclaration;
  4998. oldDestination := destination;
  4999. oldCurrentLoop := currentLoop;
  5000. oldConditional := conditional;
  5001. oldTrueLabel := trueLabel;
  5002. oldFalseLabel := falseLabel;
  5003. oldLocked := locked;
  5004. oldUsedRegisters := usedRegisters
  5005. END BackupGlobalState;
  5006. PROCEDURE RestoreGlobalState;
  5007. BEGIN
  5008. result := oldResult;
  5009. currentScope := oldCurrentScope;
  5010. arrayDestinationTag := oldArrayDestinationTag;
  5011. arrayDestinationDimension := oldArrayDestinationDimension;
  5012. constantDeclaration := oldConstantDeclaration;
  5013. destination := oldDestination;
  5014. currentLoop := oldCurrentLoop;
  5015. conditional := oldConditional;
  5016. trueLabel := oldTrueLabel;
  5017. falseLabel := oldFalseLabel;
  5018. locked := oldLocked;
  5019. usedRegisters := oldUsedRegisters
  5020. END RestoreGlobalState;
  5021. (** do preparations before parameter push for array-structured object types (ASOTs):
  5022. if ASOT is passed as VAR parameter:
  5023. - allocate temporary variable of math array type
  5024. - copy contents of ASOT to be passed to temporary variable
  5025. - use temporary variable as the actual parameter instead
  5026. - 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)
  5027. **)
  5028. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5029. VAR
  5030. expression: SyntaxTree.Expression;
  5031. BEGIN
  5032. IF actualParameter IS SyntaxTree.Designator THEN
  5033. designator := actualParameter(SyntaxTree.Designator);
  5034. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5035. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5036. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5037. ASSERT(checker # NIL);
  5038. checker.SetCurrentScope(currentScope);
  5039. (* allocate temporary variable *)
  5040. ASSERT(actualParameter.type # NIL);
  5041. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5042. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5043. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5044. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5045. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5046. ASSERT(tempVariableDesignator.type # NIL);
  5047. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5048. (* copy math array stored in actual parameter to temporary variable *)
  5049. BackupGlobalState;
  5050. AssignMathArray(tempVariableDesignator, actualParameter);
  5051. RestoreGlobalState;
  5052. (* use temporary variable as actual parameter instead of the original one *)
  5053. actualParameter := tempVariableDesignator;
  5054. (* create write-back call and store it in linked list *)
  5055. (* create new list entry *)
  5056. IF firstWriteBackCall = NIL THEN
  5057. NEW(firstWriteBackCall);
  5058. currentWriteBackCall := firstWriteBackCall
  5059. ELSE
  5060. ASSERT(currentWriteBackCall # NIL);
  5061. NEW(currentWriteBackCall.next);
  5062. currentWriteBackCall := currentWriteBackCall.next
  5063. END;
  5064. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5065. ASSERT(expression.type = NIL);
  5066. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5067. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5068. (* prepare writeback for any other "normal" indexer *)
  5069. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5070. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5071. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5072. Assign(tempVariableDesignator, actualParameter);
  5073. actualParameter := tempVariableDesignator;
  5074. IF firstWriteBackCall = NIL THEN
  5075. NEW(firstWriteBackCall);
  5076. currentWriteBackCall := firstWriteBackCall
  5077. ELSE
  5078. ASSERT(currentWriteBackCall # NIL);
  5079. NEW(currentWriteBackCall.next);
  5080. currentWriteBackCall := currentWriteBackCall.next
  5081. END;
  5082. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5083. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5084. END
  5085. END
  5086. END PrepareParameter;
  5087. BEGIN
  5088. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5089. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5090. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5091. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5092. IF InlineProcedureCall(x) THEN
  5093. RETURN
  5094. ELSE
  5095. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5096. END
  5097. END;
  5098. END;
  5099. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5100. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5101. dest := destination; destination := emptyOperand;
  5102. SaveRegisters();ReleaseUsedRegisters(saved);
  5103. parameters := x.parameters;
  5104. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5105. (* an operator is called *)
  5106. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5107. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5108. (* check if a dynamic operator call should be performed *)
  5109. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5110. ELSE
  5111. isCallOfDynamicOperator := FALSE
  5112. END;
  5113. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5114. Emit(Push(position, ap));
  5115. END;
  5116. alignment := procedureType.stackAlignment;
  5117. IF alignment > 1 THEN
  5118. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5119. Emit(Mov(position,reg, sp));
  5120. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5121. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5122. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5123. Emit(And(position,sp, sp, mask));
  5124. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5125. Emit(Push(position,reg));
  5126. (*
  5127. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5128. Emit(Mov(position,mem,reg));
  5129. *)
  5130. ReleaseIntermediateOperand(reg);
  5131. END;
  5132. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5133. (* align stack to 16-byte boundary *)
  5134. IntermediateCode.InitImmediate(mask,addressType,-16);
  5135. Emit(And(position,sp, sp, mask));
  5136. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5137. IF gap # 0 THEN
  5138. IntermediateCode.InitImmediate(size,addressType,gap);
  5139. Emit(Sub(position,sp,sp,size))
  5140. END;
  5141. END;
  5142. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5143. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5144. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5145. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5146. ELSE
  5147. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5148. END;
  5149. Evaluate(x.left, operand);
  5150. IF symbol IS SyntaxTree.Procedure THEN
  5151. IF (procedureType.selfParameter # NIL) THEN
  5152. Emit(Push(position,operand.tag));
  5153. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5154. Emit(Push(position,operand.tag));
  5155. ELSIF (procedureType.isDelegate) THEN
  5156. Emit(Push(position,operand.tag));
  5157. END;
  5158. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5159. IF (procedureType.selfParameter # NIL) THEN
  5160. Emit(Push(position,operand.tag));
  5161. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5162. Emit(Push(position,operand.tag));
  5163. END;
  5164. ELSE HALT(200);
  5165. END;
  5166. ReleaseIntermediateOperand(operand.tag);
  5167. operand.tag := emptyOperand;
  5168. (* determine if a structured return type is needed *)
  5169. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5170. IF structuredReturnType THEN
  5171. IF resultDesignator # NIL THEN
  5172. d := resultDesignator;
  5173. ELSE
  5174. (* temporary result that might be allocated, must potentially be traced *)
  5175. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5176. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5177. d.SetType(variable.type);
  5178. END;
  5179. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5180. Designate(d,returnValue);
  5181. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5182. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5183. Emit(Push(position,size));
  5184. Emit(Push(position,returnValue.op));
  5185. ReleaseOperand(returnValue);
  5186. ELSE*)
  5187. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5188. (*
  5189. END;
  5190. *)
  5191. END;
  5192. firstWriteBackCall := NIL; (* reset write-back call list *)
  5193. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5194. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5195. IF parameterRegister = NIL THEN parameterRegisters := 0
  5196. ELSE parameterRegisters := LEN(parameterRegister)
  5197. END;
  5198. passByRegister := parameterRegisters > 0;
  5199. registerNumber := 0;
  5200. formalParameter := procedureType.lastParameter;
  5201. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5202. actualParameter := parameters.GetExpression(i);
  5203. PrepareParameter(actualParameter, formalParameter);
  5204. IF passByRegister & (i < parameterRegisters) THEN
  5205. IF ~PassInRegister(formalParameter) THEN
  5206. Error(actualParameter.position,"cannot be passed by register")
  5207. ELSE
  5208. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5209. END;
  5210. INC(registerNumber);
  5211. ELSE
  5212. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5213. END;
  5214. formalParameter := formalParameter.prevParameter;
  5215. END;
  5216. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5217. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5218. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5219. END;
  5220. ELSE
  5221. hasDynamicOperands := FALSE;
  5222. formalParameter := procedureType.firstParameter;
  5223. FOR i := 0 TO parameters.Length() - 1 DO
  5224. actualParameter := parameters.GetExpression(i);
  5225. IF formalParameter # NIL THEN (* TENTATIVE *)
  5226. PrepareParameter(actualParameter, formalParameter);
  5227. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5228. ASSERT(i < 2);
  5229. hasDynamicOperands := TRUE;
  5230. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5231. ELSE
  5232. IF passByRegister & (registerNumber > 0) THEN
  5233. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5234. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5235. END;
  5236. passByRegister := FALSE;
  5237. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5238. END;
  5239. formalParameter := formalParameter.nextParameter;
  5240. END;
  5241. END;
  5242. END;
  5243. IF symbol IS SyntaxTree.Procedure THEN
  5244. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5245. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5246. Emit(Push(position,reg));
  5247. ReleaseIntermediateOperand(reg);
  5248. END;
  5249. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5250. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5251. parametersSize := ParametersSize(system,procedureType,FALSE);
  5252. END;
  5253. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5254. (*
  5255. dynamic operator overloading:
  5256. first push parameters, regularly:
  5257. [self]
  5258. par1
  5259. par2
  5260. then push parameters for GetOperator
  5261. identifier
  5262. ptr1
  5263. tag
  5264. ptr2
  5265. tag
  5266. call GetOperatorRuntimeProc
  5267. call Operator
  5268. *)
  5269. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5270. (* push ID *)
  5271. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5272. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5273. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5274. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5275. formalParameter := procedureType.firstParameter;
  5276. FOR i := 0 TO parameters.Length() - 1 DO
  5277. IF formalParameter.access # SyntaxTree.Hidden THEN
  5278. ASSERT(i < 2);
  5279. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5280. (* push pointer *)
  5281. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5282. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5283. (* add dereference *)
  5284. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5285. (*! better: do refer to stack above than using parameter backups !!*)
  5286. ReleaseIntermediateOperand(parameterBackups[i]);
  5287. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5288. END;
  5289. Emit(Push(position,parameterBackups[i]));
  5290. ReleaseIntermediateOperand(parameterBackups[i]);
  5291. (* push typetag *)
  5292. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5293. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5294. arg := TypeDescriptorAdr(recordType);
  5295. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5296. Emit(Push(position,arg));
  5297. ELSE
  5298. (* push 'NonPointer' *)
  5299. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5300. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5301. (* push fingerprint *)
  5302. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5303. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5304. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5305. END
  5306. END;
  5307. formalParameter := formalParameter.nextParameter
  5308. END;
  5309. (* for unary operators: complete the information for the second parameter *)
  5310. IF procedureType.numberParameters < 2 THEN
  5311. (* push 'NonPointer' *)
  5312. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5313. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5314. (* push 'NoType' *)
  5315. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5316. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5317. END;
  5318. (* call operator selection procedure *)
  5319. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5320. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5321. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5322. ReleaseOperand(operatorSelectionProcedureOperand);
  5323. (* use the address that the operator selection procedure returned as the target address of the call *)
  5324. InitOperand(operand, ModeValue);
  5325. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5326. Emit(Result(position,operand.op))
  5327. END
  5328. END;
  5329. ReleaseParameterRegisters();
  5330. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5331. SaveRegisters();ReleaseUsedRegisters(saved2);
  5332. CallThis(position,"Objects","LeaveA2",0);
  5333. RestoreRegisters(saved2);
  5334. END;
  5335. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5336. Emit(Call(position,operand.op,0));
  5337. ELSE
  5338. Emit(Call(position,operand.op,parametersSize));
  5339. END;
  5340. ReleaseOperand(operand);
  5341. IF procedureType.noReturn THEN
  5342. EmitTrap(position,NoReturnTrap);
  5343. END;
  5344. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5345. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5346. Emit(Result(position,return));
  5347. END;
  5348. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5349. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5350. Emit(Push(position, return));
  5351. CallThis(position,"Objects","ReenterA2",0);
  5352. Emit(Pop(position, return));
  5353. ELSE
  5354. CallThis(position,"Objects","ReenterA2",0);
  5355. END;
  5356. END;
  5357. (* === return parameter space === *)
  5358. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5359. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5360. IF parametersSize < 32 THEN
  5361. (* allocated space for all parameter registers *)
  5362. parametersSize := 32
  5363. END;
  5364. size := IntermediateCode.Immediate(addressType,parametersSize);
  5365. Emit(Add(position,sp,sp,size))
  5366. END;
  5367. IF SysvABI(procedureType.callingConvention) THEN
  5368. IF passByRegister THEN
  5369. IF parameters.Length() > parameterRegisters THEN
  5370. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5371. ELSE
  5372. parametersSize := 0
  5373. END;
  5374. ELSE
  5375. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5376. INC( parametersSize, (-parametersSize) MOD 16 )
  5377. END;
  5378. IF parametersSize > 0 THEN
  5379. size := IntermediateCode.Immediate(addressType,parametersSize);
  5380. Emit(Add(position,sp,sp,size))
  5381. END;
  5382. END;
  5383. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5384. IF structuredReturnType THEN
  5385. (* stack pointer rewinding done by callee
  5386. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5387. Emit(Add(position,sp,sp,size));
  5388. *)
  5389. RestoreRegisters(saved);
  5390. InitOperand(result,ModeReference);
  5391. Symbol(variable,result);
  5392. ELSE
  5393. RestoreRegisters(saved);
  5394. InitOperand(result,ModeValue);
  5395. result.op := return;
  5396. END;
  5397. END;
  5398. IF alignment > 1 THEN
  5399. Emit(Pop(position,sp));
  5400. END;
  5401. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5402. Emit(Pop(position, ap));
  5403. END;
  5404. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5405. ValueToCondition(result);
  5406. END;
  5407. destination := dest;
  5408. (* perform all write-back calls in the list *)
  5409. BackupGlobalState;
  5410. currentWriteBackCall := firstWriteBackCall;
  5411. WHILE currentWriteBackCall # NIL DO
  5412. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5413. currentWriteBackCall := currentWriteBackCall.next
  5414. END;
  5415. RestoreGlobalState;
  5416. (* TENATIVE *)
  5417. (*
  5418. IF isOperatorCall THEN
  5419. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5420. END;
  5421. *)
  5422. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5423. END VisitProcedureCallDesignator;
  5424. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5425. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5426. td: SyntaxTree.Symbol;
  5427. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5428. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5429. BEGIN
  5430. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5431. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5432. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5433. variable.SetType(system.anyType);
  5434. scope.AddVariable(variable);
  5435. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5436. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5437. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5438. typeDeclaration.SetScope(module.module.moduleScope);
  5439. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5440. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5441. END;
  5442. RETURN hiddenPointerType;
  5443. END GetHiddenPointerType;
  5444. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5445. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5446. BEGIN
  5447. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5448. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5449. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5450. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5451. scope.AddVariable(variable);
  5452. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5453. variable.SetType(system.anyType);
  5454. scope.AddVariable(variable);
  5455. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5456. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5457. typeDeclaration.SetDeclaredType(delegatePointerType);
  5458. typeDeclaration.SetScope(module.module.moduleScope);
  5459. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5460. delegatePointerType.SetState(SyntaxTree.Resolved);
  5461. END;
  5462. RETURN delegatePointerType
  5463. END GetDelegateType;
  5464. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5465. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5466. such as in VAR a: RECORD ... END;
  5467. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5468. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5469. *)
  5470. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5471. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5472. BEGIN (* no code emission *)
  5473. source := NIL;
  5474. x := x.resolved;
  5475. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5476. x := GetHiddenPointerType();
  5477. ELSIF IsDelegate(x) THEN
  5478. x := GetDelegateType();
  5479. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5480. ELSE HALT(200);
  5481. END;
  5482. td := x.typeDeclaration;
  5483. IF td = NIL THEN
  5484. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5485. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5486. ASSERT(td # NIL);
  5487. END;
  5488. IF newObjectFile THEN
  5489. GetCodeSectionNameForSymbol(td,name);
  5490. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5491. meta.CheckTypeDeclaration(x);
  5492. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5493. ELSE
  5494. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5495. END;
  5496. IF backend.cooperative OR meta.simple THEN
  5497. offset := 0;
  5498. ELSE
  5499. IF x IS SyntaxTree.CellType THEN
  5500. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5501. IF baseRecord = NIL THEN
  5502. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5503. ELSE
  5504. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5505. END;
  5506. ELSE
  5507. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5508. END;
  5509. END;
  5510. ELSE
  5511. offset := 0;
  5512. source := module.allSections.FindBySymbol(td); (*TODO*)
  5513. IF source = NIL THEN
  5514. null := 0;
  5515. GetCodeSectionNameForSymbol(td,name);
  5516. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5517. Basic.SuffixSegmentedName (name, module.module.name);
  5518. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5519. IntermediateCode.InitImmediate(op,addressType,0);
  5520. source(IntermediateCode.Section).Emit(Data(position,op));
  5521. source.SetReferenced(FALSE)
  5522. ELSE
  5523. name := source.name;
  5524. END;
  5525. END;
  5526. RETURN td
  5527. END GetBackendType;
  5528. BEGIN
  5529. (*td := t.typeDeclaration;*)
  5530. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5531. (*
  5532. IF t IS SyntaxTree.PointerType THEN
  5533. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5534. ELSE
  5535. source := GetBackendType(t);
  5536. END;
  5537. *)
  5538. IF newObjectFile THEN
  5539. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5540. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5541. IntermediateCode.SetOffset(res,offset);
  5542. ELSE
  5543. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5544. END;
  5545. (*
  5546. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5547. make memory should be used when tag is used, not earlier
  5548. *)
  5549. RETURN res
  5550. END TypeDescriptorAdr;
  5551. (*
  5552. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5553. VAR result: IntermediateCode.Operand;
  5554. BEGIN
  5555. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5556. operand.tag := TypeDescriptorAdr(operand.type);
  5557. IntermediateCode.MakeMemory(operand.tag,addressType);
  5558. UseIntermediateOperand(operand.tag);
  5559. END;
  5560. END MakeTypeTag;
  5561. *)
  5562. PROCEDURE ProfilerInit;
  5563. VAR reg: IntermediateCode.Operand;
  5564. BEGIN
  5565. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5566. Emit(Call(position,reg,0));
  5567. END ProfilerInit;
  5568. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5569. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5570. BEGIN
  5571. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5572. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5573. THEN
  5574. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5575. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5576. Emit(Push(position,reg));
  5577. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5578. Emit(Push(position,reg));
  5579. StaticCallOperand(result,procedure);
  5580. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5581. ReleaseOperand(result);
  5582. END;
  5583. END ProfilerEnterExit;
  5584. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5585. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5586. BEGIN
  5587. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5588. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5589. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5590. profileInit.Emit(Push(position,reg));
  5591. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5592. profileInit.Emit(Push(position,reg));
  5593. NEW(string, LEN(name)); COPY(name, string^);
  5594. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5595. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5596. sv.SetType(type);
  5597. Designate(sv,result);
  5598. profileInit.Emit(Push(position,result.tag));
  5599. profileInit.Emit(Push(position,result.op));
  5600. StaticCallOperand(result,procedure);
  5601. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5602. ReleaseOperand(result);
  5603. END;
  5604. END ProfilerAddProcedure;
  5605. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5606. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5607. BEGIN
  5608. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5609. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5610. profileInit.Emit(Push(position,reg));
  5611. profileInitPatchPosition := profileInit.pc;
  5612. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5613. NEW(string, LEN(name)); COPY(name, string^);
  5614. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5615. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5616. sv.SetType(type);
  5617. Designate(sv,result);
  5618. profileInit.Emit(Push(position,result.tag));
  5619. profileInit.Emit(Push(position,result.op));
  5620. StaticCallOperand(result,procedure);
  5621. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5622. ReleaseOperand(result);
  5623. END;
  5624. END ProfilerAddModule;
  5625. PROCEDURE ProfilerPatchInit;
  5626. VAR reg: IntermediateCode.Operand;
  5627. BEGIN
  5628. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5629. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5630. EmitLeave(profileInit,position,NIL,0);
  5631. profileInit.Emit(Exit(position,0,0,0));
  5632. END ProfilerPatchInit;
  5633. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5634. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5635. VAR
  5636. id: LONGINT;
  5637. leftType, rightType: SyntaxTree.Type;
  5638. procedureType: SyntaxTree.ProcedureType;
  5639. runtimeProcedure: SyntaxTree.Procedure;
  5640. runtimeProcedureOperand, operatorOperand: Operand;
  5641. kind: SET;
  5642. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5643. VAR
  5644. arg: IntermediateCode.Operand;
  5645. recordType: SyntaxTree.RecordType;
  5646. fingerPrint: SyntaxTree.FingerPrint;
  5647. BEGIN
  5648. IF type = NIL THEN
  5649. (* no type: push 'NoType' *)
  5650. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5651. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5652. ELSIF IsStrictlyPointerToRecord(type) THEN
  5653. (* pointer to record type: push typetag *)
  5654. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5655. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5656. arg := TypeDescriptorAdr(recordType);
  5657. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5658. ELSE
  5659. (* non-pointer to record type: push fingerprint *)
  5660. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5661. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5662. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5663. END;
  5664. operatorInitializationCodeSection.Emit(Push(position,arg))
  5665. END PushTypeInfo;
  5666. BEGIN
  5667. ASSERT(operatorInitializationCodeSection # NIL);
  5668. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5669. procedureType := operator.type(SyntaxTree.ProcedureType);
  5670. (* determine types *)
  5671. leftType := procedureType.firstParameter.type;
  5672. IF procedureType.numberParameters = 2 THEN
  5673. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5674. rightType := procedureType.firstParameter.nextParameter.type;
  5675. ELSE
  5676. rightType := NIL
  5677. END;
  5678. (* determine operator kind *)
  5679. IF IsStrictlyPointerToRecord(leftType) THEN
  5680. kind := {LhsIsPointer}
  5681. ELSE
  5682. kind := {}
  5683. END;
  5684. IF IsStrictlyPointerToRecord(rightType) THEN
  5685. kind := kind + {RhsIsPointer}
  5686. END;
  5687. IF kind # {} THEN (* TODO: to be removed later on *)
  5688. (* at least one of the types is a pointer to record *)
  5689. (* emit a code that registers this specific operator in the runtime *)
  5690. dump := operatorInitializationCodeSection.comments;
  5691. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5692. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5693. (* push ID *)
  5694. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5695. id := Global.GetSymbol(module.module.case, operator.name);
  5696. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5697. (* push kind *)
  5698. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5699. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5700. (* push type infos *)
  5701. PushTypeInfo(leftType);
  5702. PushTypeInfo(rightType);
  5703. (* push operator address *)
  5704. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5705. StaticCallOperand(operatorOperand, operator);
  5706. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5707. ReleaseOperand(operatorOperand);
  5708. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5709. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5710. ReleaseOperand(runtimeProcedureOperand)
  5711. END
  5712. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5713. END
  5714. END RegisterDynamicOperator;
  5715. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5716. VAR
  5717. traceModule: SyntaxTree.Module;
  5718. procedure: SyntaxTree.Procedure;
  5719. procedureVariable: SyntaxTree.Variable;
  5720. s,msg: Basic.MessageString;
  5721. res: Operand;
  5722. i: LONGINT;
  5723. sv: SyntaxTree.StringValue;
  5724. type: SyntaxTree.Type;
  5725. recordType: SyntaxTree.RecordType;
  5726. printout: Printout.Printer;
  5727. stringWriter: Streams.StringWriter;
  5728. expression: SyntaxTree.Expression;
  5729. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5730. BEGIN
  5731. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5732. IF procedure = NIL THEN
  5733. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5734. END;
  5735. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5736. s := "procedure ";
  5737. Strings.Append(s,backend.traceModuleName);
  5738. Strings.Append(s,".");
  5739. Strings.Append(s,procedureName);
  5740. Strings.Append(s," not present");
  5741. Error(position,s);
  5742. RETURN FALSE
  5743. ELSE
  5744. RETURN TRUE
  5745. END;
  5746. END GetProcedure;
  5747. PROCEDURE CallProcedure;
  5748. VAR size: LONGINT;
  5749. BEGIN
  5750. IF procedure # NIL THEN
  5751. StaticCallOperand(result,procedure);
  5752. size := ProcedureParametersSize(system,procedure);
  5753. ELSE
  5754. Symbol(procedureVariable, result);
  5755. LoadValue(result, procedureVariable.type.resolved);
  5756. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5757. END;
  5758. Emit(Call(position,result.op,size));
  5759. END CallProcedure;
  5760. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5761. VAR res: Operand; string: SyntaxTree.String;
  5762. BEGIN
  5763. IF GetProcedure("String") THEN
  5764. NEW(string, LEN(s)); COPY(s, string^);
  5765. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5766. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5767. sv.SetType(type);
  5768. Designate(sv,res);
  5769. Emit(Push(position,res.tag));
  5770. Emit(Push(position,res.op));
  5771. ReleaseOperand(res);
  5772. CallProcedure;
  5773. END;
  5774. END String;
  5775. PROCEDURE Integer(op: IntermediateCode.Operand);
  5776. BEGIN
  5777. IF GetProcedure("Int") THEN
  5778. Emit(Push(position,op));
  5779. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5780. CallProcedure;
  5781. END;
  5782. END Integer;
  5783. PROCEDURE Float(op: IntermediateCode.Operand);
  5784. BEGIN
  5785. IF GetProcedure("HIntHex") THEN
  5786. Emit(Push(position,op));
  5787. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5788. CallProcedure;
  5789. END;
  5790. END Float;
  5791. PROCEDURE Set(op: IntermediateCode.Operand);
  5792. BEGIN
  5793. IF GetProcedure("Set") THEN
  5794. Emit(Push(position,op));
  5795. (*
  5796. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5797. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5798. *)
  5799. CallProcedure;
  5800. END;
  5801. END Set;
  5802. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5803. BEGIN
  5804. IF GetProcedure("Boolean") THEN
  5805. Emit(Push(position,op));
  5806. CallProcedure;
  5807. END;
  5808. END Boolean;
  5809. PROCEDURE Char(op: IntermediateCode.Operand);
  5810. BEGIN
  5811. IF GetProcedure("Char") THEN
  5812. Emit(Push(position,op));
  5813. CallProcedure;
  5814. END;
  5815. END Char;
  5816. PROCEDURE Address(op: IntermediateCode.Operand);
  5817. BEGIN
  5818. IF GetProcedure("Address") THEN
  5819. Emit(Push(position,op));
  5820. CallProcedure;
  5821. END;
  5822. END Address;
  5823. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5824. VAR len: IntermediateCode.Operand;
  5825. BEGIN
  5826. IF GetProcedure("String") THEN
  5827. len := GetArrayLength(type, op.tag);
  5828. Emit(Push(position,len));
  5829. ReleaseIntermediateOperand(len);
  5830. Emit(Push(position,op.op));
  5831. CallProcedure;
  5832. END;
  5833. END StringOperand;
  5834. PROCEDURE Ln;
  5835. BEGIN
  5836. IF GetProcedure("Ln") THEN
  5837. CallProcedure;
  5838. END;
  5839. END Ln;
  5840. BEGIN
  5841. IF backend.traceModuleName = "" THEN RETURN END;
  5842. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5843. IF GetProcedure("Enter") THEN
  5844. CallProcedure
  5845. END;
  5846. NEW(stringWriter,LEN(s));
  5847. FOR i := 0 TO x.Length()-1 DO
  5848. msg := "";
  5849. expression := x.GetExpression(i);
  5850. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5851. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5852. ELSE
  5853. Global.GetModuleName(module.module, s);
  5854. END;
  5855. IF i = 0 THEN
  5856. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5857. stringWriter.String(":");
  5858. END;
  5859. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5860. IF ~(expression IS SyntaxTree.StringValue) THEN
  5861. printout.Expression(expression);
  5862. stringWriter.Get(s);
  5863. Strings.Append(msg,s);
  5864. Strings.Append(msg,"= ");
  5865. ELSE stringWriter.Get(s); (* remove from string writer *)
  5866. Strings.Append(msg, s);
  5867. END;
  5868. String(msg);
  5869. IF SemanticChecker.IsStringType(expression.type) THEN
  5870. Designate(expression,res);
  5871. StringOperand(res, expression.type);
  5872. ELSE
  5873. Evaluate(expression,res);
  5874. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5875. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5876. Convert(res.op,int64);
  5877. END;
  5878. Integer(res.op);
  5879. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5880. Boolean(res.op);
  5881. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5882. Set(res.op);
  5883. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5884. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5885. Convert(res.op,float64);
  5886. END;
  5887. Float(res.op);
  5888. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5889. Char(res.op);
  5890. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5891. Address(res.op);String("H");
  5892. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5893. Address(res.op);String("H");
  5894. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5895. Address(res.op);String("H");
  5896. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5897. Address(res.op);String("H");
  5898. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5899. String("NIL");
  5900. ELSE HALT(200);
  5901. END;
  5902. END;
  5903. ReleaseOperand(res);
  5904. String("; ");
  5905. END;
  5906. IF GetProcedure("Exit") THEN
  5907. CallProcedure
  5908. ELSE
  5909. Ln;
  5910. END;
  5911. END;
  5912. END SystemTrace;
  5913. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5914. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5915. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5916. BEGIN
  5917. type := type.resolved;
  5918. IF type IS SyntaxTree.RecordType THEN
  5919. WITH type: SyntaxTree.RecordType DO
  5920. baseType := type.baseType;
  5921. IF baseType # NIL THEN
  5922. baseType := baseType.resolved;
  5923. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5924. InitFields(baseType,adr,offset);
  5925. END;
  5926. variable := type.recordScope.firstVariable;
  5927. WHILE variable # NIL DO
  5928. IF variable.initializer # NIL THEN
  5929. Evaluate(variable.initializer,initializerOp);
  5930. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5931. Emit(Mov(position,mem,initializerOp.op));
  5932. ReleaseOperand(initializerOp);
  5933. ReleaseIntermediateOperand(mem);
  5934. END;
  5935. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5936. variable := variable.nextVariable
  5937. END;
  5938. END;
  5939. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5940. WITH type: SyntaxTree.ArrayType DO
  5941. IF type.form = SyntaxTree.Static THEN
  5942. baseType := type.arrayBase;
  5943. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5944. FOR i := 0 TO type.staticLength-1 DO
  5945. InitFields(baseType,adr,offset+i*size);
  5946. END;
  5947. END;
  5948. END;
  5949. ELSIF type IS SyntaxTree.MathArrayType THEN
  5950. WITH type: SyntaxTree.MathArrayType DO
  5951. IF type.form = SyntaxTree.Open THEN
  5952. dim := DynamicDim(type);
  5953. imm := IntermediateCode.Immediate(addressType,dim);
  5954. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5955. baseType := SemanticChecker.ArrayBase(type,dim);
  5956. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5957. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5958. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5959. ReleaseIntermediateOperand(imm);
  5960. (* flags remain empty (=0) for open array *)
  5961. ELSIF type.form = SyntaxTree.Static THEN
  5962. baseType := type.arrayBase;
  5963. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5964. ASSERT(type.staticLength < 1024*1024*1024);
  5965. FOR i := 0 TO type.staticLength-1 DO
  5966. InitFields(baseType,adr,offset+i*size);
  5967. END;
  5968. END;
  5969. END;
  5970. END;
  5971. END InitFields;
  5972. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  5973. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  5974. BEGIN
  5975. type := variable.type.resolved;
  5976. IF (type IS SyntaxTree.MathArrayType) THEN
  5977. WITH type: SyntaxTree.MathArrayType DO
  5978. IF type.form = SyntaxTree.Open THEN
  5979. Symbol(variable,operand);
  5980. InitFields(type, operand.tag,0);
  5981. IF temporary THEN
  5982. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  5983. END;
  5984. ELSIF type.form = SyntaxTree.Tensor THEN
  5985. Symbol(variable, operand);
  5986. MakeMemory(tmp,operand.op,addressType,0);
  5987. ReleaseOperand(operand);
  5988. IF temporary THEN
  5989. (* trick -- temporary object from array base *)
  5990. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  5991. Symbol(symbol,operand);
  5992. MakeMemory(mem,operand.op,addressType,0);
  5993. ReleaseOperand(operand);
  5994. Emit(Mov(position,tmp, mem) );
  5995. ReleaseOperand(operand);
  5996. ELSE
  5997. Emit(Mov(position,tmp, nil ) );
  5998. END;
  5999. ReleaseIntermediateOperand(tmp);
  6000. END;
  6001. END;
  6002. ELSE
  6003. Symbol(variable,operand);
  6004. IF variable.initializer # NIL THEN
  6005. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6006. reference.SetType(variable.type.resolved);
  6007. reference.SetAssignable(TRUE);
  6008. Assign(reference,variable.initializer);
  6009. END;
  6010. InitFields(type, operand.op,0);
  6011. ReleaseOperand(operand);
  6012. END;
  6013. END InitVariable;
  6014. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6015. VAR end: Label;
  6016. BEGIN
  6017. IF type.form = SyntaxTree.Tensor THEN
  6018. InitOperand(result,ModeValue);
  6019. ReuseCopy(result.op,base);
  6020. end := NewLabel();
  6021. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6022. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6023. SetLabel(end);
  6024. Convert(result.op,int32);
  6025. ELSE
  6026. InitOperand(result,ModeValue);
  6027. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6028. END
  6029. END MathArrayDim;
  6030. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6031. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6032. BEGIN
  6033. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6034. MakeMemory(mem,base,addressType,offset);
  6035. Emit(Mov(position,mem,value));
  6036. ReleaseIntermediateOperand(mem);
  6037. END PutMathArrayField;
  6038. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6039. VAR mem: IntermediateCode.Operand;
  6040. BEGIN
  6041. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6042. MakeMemory(mem,base,addressType,offset);
  6043. Emit(Mov(position,mem,value));
  6044. ReleaseIntermediateOperand(mem);
  6045. END PutMathArrayFieldOffset;
  6046. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6047. BEGIN
  6048. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6049. MakeMemory(value,base,addressType,offset);
  6050. END GetMathArrayField;
  6051. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6052. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6053. BEGIN
  6054. IF incr THEN
  6055. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6056. ELSE
  6057. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6058. END;
  6059. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6060. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6061. ELSE
  6062. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6063. Emit(Mov(position,reg,dim));
  6064. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6065. Emit(Add(position,reg,reg,base));
  6066. MakeMemory(mem, reg, addressType, offset);
  6067. ReleaseIntermediateOperand(reg);
  6068. Emit(Mov(position,mem,value));
  6069. ReleaseIntermediateOperand(mem);
  6070. END;
  6071. END PutMathArrayLenOrIncr;
  6072. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6073. BEGIN
  6074. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6075. END PutMathArrayLength;
  6076. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6077. BEGIN
  6078. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6079. END PutMathArrayIncrement;
  6080. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6081. BEGIN
  6082. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6083. END GetMathArrayIncrement;
  6084. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6085. BEGIN
  6086. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6087. END GetMathArrayLength;
  6088. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6089. VAR dimOp: IntermediateCode.Operand;
  6090. BEGIN
  6091. dimOp := IntermediateCode.Immediate(int32, dim);
  6092. GetMathArrayLength(type, operand, dimOp, check, result);
  6093. END GetMathArrayLengthAt;
  6094. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6095. VAR dimOp: IntermediateCode.Operand;
  6096. BEGIN
  6097. dimOp := IntermediateCode.Immediate(int32, dim);
  6098. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6099. END GetMathArrayIncrementAt;
  6100. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6101. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6102. offset: LONGINT;
  6103. BEGIN
  6104. IF increment THEN
  6105. offset := MathIncrOffset;
  6106. ELSE
  6107. offset := MathLenOffset;
  6108. END;
  6109. INC(offset,operand.dimOffset*2);
  6110. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6111. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6112. END;
  6113. (* static dimension *)
  6114. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6115. IF check & (type.form = SyntaxTree.Tensor) THEN
  6116. DimensionCheck(operand.tag,dim,BrltL);
  6117. END;
  6118. val := SHORT(dim.intValue);
  6119. IF type.form # SyntaxTree.Tensor THEN
  6120. t := SemanticChecker.ArrayBase(type,val);
  6121. type := t.resolved(SyntaxTree.MathArrayType);
  6122. IF type.form = SyntaxTree.Static THEN
  6123. IF increment THEN
  6124. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6125. ELSE
  6126. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6127. END;
  6128. InitOperand(result,ModeValue);
  6129. result.op := res;
  6130. RETURN;
  6131. END;
  6132. END;
  6133. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6134. MakeMemory(res,operand.tag,addressType,offset);
  6135. (*
  6136. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6137. *)
  6138. InitOperand(result,ModeValue);
  6139. result.op := res;
  6140. ELSE
  6141. Convert(dim,addressType);
  6142. IF check THEN
  6143. IF type.form = SyntaxTree.Tensor THEN
  6144. DimensionCheck(operand.tag,dim,BrltL);
  6145. ELSIF isUnchecked THEN (* do nothing *)
  6146. ELSE
  6147. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6148. END;
  6149. END;
  6150. end := NewLabel(); next := NIL;
  6151. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6152. Emit(Mov(position,res,dim));
  6153. Convert(res,int32);
  6154. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6155. WHILE t IS SyntaxTree.MathArrayType DO
  6156. type := t(SyntaxTree.MathArrayType);
  6157. IF type.form = SyntaxTree.Static THEN
  6158. imm := IntermediateCode.Immediate(int32,val);
  6159. next := NewLabel();
  6160. BrneL(next,imm,res);
  6161. IF increment THEN
  6162. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6163. ELSE
  6164. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6165. END;
  6166. Emit(MovReplace(position,res,imm));
  6167. BrL(end);
  6168. ELSE hasDynamicPart := TRUE;
  6169. END;
  6170. t := type.arrayBase.resolved;
  6171. val := val + 1;
  6172. IF next # NIL THEN SetLabel(next) END;
  6173. END;
  6174. IF hasDynamicPart THEN
  6175. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6176. Emit(Mov(position,res2,dim));
  6177. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6178. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6179. Emit(Add(position,res2,res2,imm));
  6180. Emit(Add(position,res2,res2,operand.tag));
  6181. IntermediateCode.MakeMemory(res2,int32);
  6182. Emit(MovReplace(position,res,res2));
  6183. ReleaseIntermediateOperand(res2);
  6184. END;
  6185. SetLabel(end);
  6186. Convert(res,int32);
  6187. InitOperand(result,ModeValue);
  6188. result.op := res;
  6189. END;
  6190. END MathArrayLenOrIncr;
  6191. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6192. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6193. offset: LONGINT;
  6194. BEGIN
  6195. offset := operand.dimOffset+DynamicDim(type)-1;
  6196. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6197. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6198. val := SHORT(dim.intValue);
  6199. t := SemanticChecker.ArrayBase(type,val);
  6200. type := t.resolved(SyntaxTree.ArrayType);
  6201. IF type.form = SyntaxTree.Static THEN
  6202. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6203. ELSE
  6204. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6205. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6206. END;
  6207. UseIntermediateOperand(res);
  6208. InitOperand(result,ModeValue);
  6209. result.op := res;
  6210. ELSE
  6211. Convert(dim,addressType);
  6212. IF ~isUnchecked THEN
  6213. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6214. END;
  6215. end := NewLabel(); next := NIL;
  6216. (* ReuseCopy(dim,res); *)
  6217. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6218. Emit(Mov(position,res,dim));
  6219. Convert(res,int32);
  6220. Convert(res,int32);
  6221. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6222. WHILE t IS SyntaxTree.ArrayType DO
  6223. type := t(SyntaxTree.ArrayType);
  6224. IF type.form = SyntaxTree.Static THEN
  6225. imm := IntermediateCode.Immediate(int32,val);
  6226. next := NewLabel();
  6227. BrneL(next,imm,res);
  6228. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6229. Emit(MovReplace(position,res,imm));
  6230. BrL(end);
  6231. ELSE hasDynamicPart := TRUE;
  6232. END;
  6233. t := type.arrayBase.resolved;
  6234. val := val + 1;
  6235. IF next # NIL THEN SetLabel(next) END;
  6236. END;
  6237. IF hasDynamicPart THEN
  6238. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6239. Convert(res2,addressType);
  6240. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6241. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6242. Emit(Sub(position,res2,imm,res2));
  6243. Emit(Add(position,res2,res2,operand.tag));
  6244. IntermediateCode.MakeMemory(res2,int32);
  6245. Emit(MovReplace(position,res,res2));
  6246. ReleaseIntermediateOperand(res2);
  6247. END;
  6248. SetLabel(end);
  6249. Convert(res,int32);
  6250. InitOperand(result,ModeValue);
  6251. result.op := res;
  6252. END;
  6253. END ArrayLen;
  6254. (**
  6255. create a temporary variable in current scope
  6256. **)
  6257. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6258. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6259. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6260. BEGIN
  6261. IF ~register THEN
  6262. variable := temporaries.GetFreeVariable(type, untraced, index);
  6263. ELSE
  6264. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6265. END;
  6266. scope := currentScope;
  6267. IF variable = NIL THEN
  6268. COPY("@hiddenIRVar",string);
  6269. Basic.AppendNumber(string,index);
  6270. name := SyntaxTree.NewIdentifier(string);
  6271. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6272. variable.SetType(type);
  6273. variable.SetAccess(SyntaxTree.Hidden);
  6274. variable.SetUntraced(untraced);
  6275. IF ~register THEN
  6276. temporaries.AddVariable(variable);
  6277. IF scope.lastVariable # NIL THEN
  6278. offset := scope.lastVariable.offsetInBits;
  6279. ELSE
  6280. offset := 0;
  6281. END;
  6282. DEC(offset,system.SizeOf(variable.type));
  6283. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6284. variable(SyntaxTree.Variable).SetOffset(offset);
  6285. scope.AddVariable(variable(SyntaxTree.Variable));
  6286. scope.EnterSymbol(variable, duplicate);
  6287. ASSERT(~duplicate);
  6288. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6289. ELSE
  6290. variable.SetUseRegister(TRUE);
  6291. variable(SyntaxTree.Variable).SetOffset(0);
  6292. END;
  6293. ELSE
  6294. variable.SetUntraced(untraced);
  6295. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6296. (*
  6297. ASSERT(variable.type.resolved = type.resolved)
  6298. *)
  6299. END;
  6300. RETURN variable(SyntaxTree.Variable)
  6301. END GetTemporaryVariable;
  6302. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6303. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6304. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6305. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6306. i: LONGINT; duplicate: BOOLEAN;
  6307. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6308. VAR variable: SyntaxTree.Variable;
  6309. BEGIN
  6310. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6311. variable.SetType(type);
  6312. recordScope.AddVariable(variable);
  6313. END AddVariable;
  6314. BEGIN
  6315. name := "@ArrayDescriptor";
  6316. Basic.AppendNumber(name,dimensions);
  6317. identifier := SyntaxTree.NewIdentifier(name);
  6318. parentScope := module.module.moduleScope;
  6319. symbol := parentScope.FindSymbol(identifier);
  6320. IF symbol # NIL THEN
  6321. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6322. type := typeDeclaration.declaredType;
  6323. ELSE
  6324. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6325. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6326. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6327. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6328. recordType.SetTypeDeclaration(typeDeclaration);
  6329. recordType.SetState(SyntaxTree.Resolved);
  6330. typeDeclaration.SetDeclaredType(recordType);
  6331. AddVariable("@ptr",system.anyType);
  6332. AddVariable("@adr",system.addressType);
  6333. AddVariable("@flags",system.addressType);
  6334. AddVariable("@dim",system.addressType);
  6335. AddVariable("@elementSize",system.addressType);
  6336. FOR i := 0 TO dimensions-1 DO
  6337. name := "@len";
  6338. Basic.AppendNumber(name,i);
  6339. AddVariable(name,system.addressType);
  6340. name := "@incr";
  6341. Basic.AppendNumber(name,i);
  6342. AddVariable(name,system.addressType);
  6343. END;
  6344. parentScope.AddTypeDeclaration(typeDeclaration);
  6345. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6346. ASSERT(~duplicate);
  6347. type := recordType;
  6348. END;
  6349. RETURN type
  6350. END GetMathArrayDescriptorType;
  6351. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6352. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6353. BEGIN
  6354. type := GetMathArrayDescriptorType(dimensions);
  6355. Emit(Push(position,op.op));
  6356. (* push type descriptor *)
  6357. reg := TypeDescriptorAdr(type);
  6358. IF ~newObjectFile THEN
  6359. IntermediateCode.MakeMemory(reg,addressType);
  6360. END;
  6361. Emit(Push(position,reg));
  6362. ReleaseIntermediateOperand(reg);
  6363. (* push realtime flag: false by default *)
  6364. Emit(Push(position,false));
  6365. CallThis(position,"Heaps","NewRec",3);
  6366. END NewMathArrayDescriptor;
  6367. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6368. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6369. BEGIN
  6370. NEW(string, LEN(s)); COPY(s, string^);
  6371. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6372. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6373. sv.SetType(type);
  6374. Designate(sv,res);
  6375. Emit(Push(position,res.tag));
  6376. Emit(Push(position,res.op));
  6377. ReleaseOperand(res);
  6378. END PushConstString;
  6379. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6380. BEGIN
  6381. IF b THEN
  6382. Emit(Push(Basic.invalidPosition, true));
  6383. ELSE
  6384. Emit(Push(Basic.invalidPosition, false));
  6385. END;
  6386. END PushConstBoolean;
  6387. PROCEDURE PushConstSet(v: SET);
  6388. VAR value: SyntaxTree.Value; op: Operand;
  6389. BEGIN
  6390. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6391. value.SetType(system.setType);
  6392. Evaluate(value, op);
  6393. Emit(Push(Basic.invalidPosition, op.op));
  6394. ReleaseOperand(op);
  6395. END PushConstSet;
  6396. PROCEDURE PushConstInteger(v: LONGINT);
  6397. VAR value: SyntaxTree.Value; op: Operand;
  6398. BEGIN
  6399. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6400. value.SetType(system.longintType);
  6401. Evaluate(value, op);
  6402. Emit(Push(Basic.invalidPosition, op.op));
  6403. ReleaseOperand(op);
  6404. END PushConstInteger;
  6405. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6406. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6407. section: IntermediateCode.Section;
  6408. BEGIN
  6409. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6410. Global.GetSymbolSegmentedName(symbol, name);
  6411. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6412. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6413. procedure.SetScope(moduleScope);
  6414. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6415. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6416. procedure.SetAccess(SyntaxTree.Hidden);
  6417. currentScope := procedureScope;
  6418. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6419. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6420. RETURN section;
  6421. END OpenInitializer;
  6422. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6423. BEGIN
  6424. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6425. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6426. section := prev;
  6427. END CloseInitializer;
  6428. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6429. VAR name: SyntaxTree.IdentifierString;
  6430. variable: SyntaxTree.Variable;
  6431. parameter: SyntaxTree.Parameter;
  6432. type: SyntaxTree.Type;
  6433. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6434. BEGIN
  6435. InitOperand(op,ModeReference);
  6436. op.op := fp;
  6437. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6438. Dereference(op, x, FALSE);
  6439. result := op;
  6440. Symbol(symbol, op);
  6441. END Field;
  6442. PROCEDURE Direction(direction: LONGINT): SET;
  6443. BEGIN
  6444. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6445. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6446. ELSE HALT(100);
  6447. END;
  6448. END Direction;
  6449. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6450. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6451. BEGIN
  6452. Field(port, op);
  6453. ToMemory(op.op,addressType,0);
  6454. Emit(Push(Basic.invalidPosition, op.op));
  6455. ReleaseOperand(op);
  6456. Basic.GetString(modifier.identifier, name);
  6457. PushConstString(name);
  6458. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6459. ASSERT(SemanticChecker.IsStringType(value.type));
  6460. Designate(value, op);
  6461. Emit(Push(modifier.position, op.tag));
  6462. Emit(Push(modifier.position, op.op));
  6463. ReleaseOperand(op);
  6464. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6465. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6466. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6467. Evaluate(value, op);
  6468. Emit(Push(modifier.position, op.op));
  6469. ReleaseOperand(op);
  6470. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6471. ELSE
  6472. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6473. END;
  6474. END AddPortProperty;
  6475. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6476. VAR modifier: SyntaxTree.Modifier;
  6477. BEGIN
  6478. modifier := parameter.modifiers;
  6479. WHILE modifier # NIL DO
  6480. AddPortProperty(parameter,modifier, modifier.expression);
  6481. modifier := modifier.nextModifier;
  6482. END;
  6483. END AddPortProperties;
  6484. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6485. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6486. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6487. PROCEDURE PushLens(type: SyntaxTree.Type);
  6488. BEGIN
  6489. IF IsSemiDynamicArray(type) THEN
  6490. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6491. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6492. Emit(Push(Basic.invalidPosition, op.op));
  6493. ReleaseOperand(op);
  6494. INC(dim);
  6495. ELSIF IsStaticArray(type) THEN
  6496. len := len * type(SyntaxTree.ArrayType).staticLength;
  6497. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6498. INC(dim);
  6499. ELSE
  6500. baseType := type;
  6501. END;
  6502. END PushLens;
  6503. BEGIN
  6504. (* cell *)
  6505. IF parameter.type IS SyntaxTree.ArrayType THEN
  6506. type := parameter.type;
  6507. dim := 0;
  6508. len := 1;
  6509. PushLens(type);
  6510. portType := baseType.resolved(SyntaxTree.PortType);
  6511. ELSE
  6512. portType := parameter.type(SyntaxTree.PortType);
  6513. END;
  6514. PushSelfPointer();
  6515. (* port / array of ports *)
  6516. IF IsStaticArray(type) THEN
  6517. PushConstInteger(len);
  6518. END;
  6519. Field(parameter, op);
  6520. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6521. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6522. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6523. Designate(d, op);*)
  6524. Emit(Push(Basic.invalidPosition, op.op));
  6525. ReleaseOperand(op);
  6526. (* name *)
  6527. PushConstString(name);
  6528. (* inout *)
  6529. PushConstSet(Direction(portType.direction));
  6530. (* width *)
  6531. PushConstInteger(portType.sizeInBits);
  6532. IF parameter.type IS SyntaxTree.PortType THEN
  6533. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6534. AddPortProperties(parameter);
  6535. ELSIF IsStaticArray(type)THEN
  6536. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6537. ELSIF IsSemiDynamicArray(type) THEN
  6538. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6539. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6540. Emit(Add(position,reg, sp, size));
  6541. (* dim *)
  6542. PushConstInteger(dim);
  6543. (* len array *)
  6544. Emit(Push(position, reg));
  6545. ReleaseIntermediateOperand(reg);
  6546. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6547. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6548. Emit(Add(position, sp,sp, size));
  6549. ELSE
  6550. HALT(100);
  6551. END;
  6552. END Parameter;
  6553. BEGIN
  6554. IF backend.cellsAreObjects THEN
  6555. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6556. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6557. END;
  6558. parameter := x.firstParameter;
  6559. WHILE (parameter # NIL) DO
  6560. type := parameter.type.resolved;
  6561. WHILE (type IS SyntaxTree.ArrayType) DO
  6562. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6563. END;
  6564. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6565. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6566. Parameter(name,parameter);
  6567. END;
  6568. parameter := parameter.nextParameter;
  6569. END;
  6570. ELSE HALT(200)
  6571. END;
  6572. END AddPorts;
  6573. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6574. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6575. BEGIN
  6576. Symbol(cell,op);
  6577. ToMemory(op.op,addressType,0);
  6578. Emit(Push(position,op.op));
  6579. ReleaseOperand(op);
  6580. property.GetName(name);
  6581. (* does not work when inheritance is used:
  6582. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6583. *)
  6584. PushConstString(name);
  6585. IF (value # NIL) THEN
  6586. ASSERT(
  6587. SemanticChecker.IsStringType(property.type)
  6588. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6589. OR (property.type.resolved IS SyntaxTree.FloatType)
  6590. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6591. OR (property.type.resolved IS SyntaxTree.SetType)
  6592. );
  6593. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6594. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6595. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6596. Designate(d, op);
  6597. IF SemanticChecker.IsStringType(property.type) THEN
  6598. Emit(Push(Basic.invalidPosition, op.tag))
  6599. END;
  6600. Emit(Push(Basic.invalidPosition, op.op));
  6601. ReleaseOperand(op);
  6602. END;
  6603. IF value = NIL THEN
  6604. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6605. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6606. ASSERT(SemanticChecker.IsStringType(value.type));
  6607. Designate(value, op);
  6608. PushString(op, value.type);
  6609. ReleaseOperand(op);
  6610. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6611. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6612. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6613. Evaluate(value, op);
  6614. Emit(Push(property.position, op.op));
  6615. ReleaseOperand(op);
  6616. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6617. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6618. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6619. Evaluate(value, op);
  6620. Emit(Push(property.position, op.op));
  6621. ReleaseOperand(op);
  6622. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6623. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6624. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6625. Evaluate(value, op);
  6626. Emit(Push(property.position, op.op));
  6627. ReleaseOperand(op);
  6628. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6629. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6630. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6631. Evaluate(value, op);
  6632. Emit(Push(property.position, op.op));
  6633. ReleaseOperand(op);
  6634. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6635. ELSE
  6636. HALT(200);
  6637. END;
  6638. END AddProperty;
  6639. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6640. VAR symbol: SyntaxTree.Symbol;
  6641. BEGIN
  6642. WHILE modifier # NIL DO
  6643. symbol := cellType.FindProperty(modifier.identifier);
  6644. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6645. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6646. modifier := modifier.nextModifier;
  6647. END;
  6648. END AddModifiers;
  6649. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6650. VAR last: SyntaxTree.Modifier;
  6651. BEGIN
  6652. IF to = NIL THEN
  6653. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6654. ELSE
  6655. last := to;
  6656. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6657. last := last.nextModifier;
  6658. END;
  6659. IF last.identifier # this.identifier THEN
  6660. ASSERT(last.nextModifier = NIL);
  6661. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6662. END;
  6663. END;
  6664. END AppendModifier;
  6665. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6666. BEGIN
  6667. WHILE this # NIL DO
  6668. AppendModifier(to, this);
  6669. this := this.nextModifier;
  6670. END;
  6671. END AppendModifiers;
  6672. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6673. VAR base: SyntaxTree.Type;
  6674. BEGIN
  6675. AppendModifiers(to, c.modifiers);
  6676. base := c.GetBaseValueType();
  6677. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6678. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6679. END;
  6680. END AppendCellTypeModifiers;
  6681. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6682. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6683. BEGIN
  6684. Basic.GetString(modifier.identifier, name);
  6685. PushConstString(name);
  6686. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6687. ASSERT(SemanticChecker.IsStringType(value.type));
  6688. Designate(value, op);
  6689. PushString(op, value.type);
  6690. ReleaseOperand(op);
  6691. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6692. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6693. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6694. Evaluate(value, op);
  6695. Emit(Push(modifier.position, op.op));
  6696. ReleaseOperand(op);
  6697. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6698. ELSE
  6699. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6700. END;
  6701. END AddPortProperty;
  6702. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6703. BEGIN
  6704. WHILE modifier # NIL DO
  6705. AddPortProperty(modifier, modifier.expression);
  6706. modifier := modifier.nextModifier;
  6707. END;
  6708. END AddPortProperties;
  6709. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6710. VAR op: Operand;
  6711. BEGIN
  6712. Evaluate(p, op);
  6713. Emit(Push(p.position, op.op));
  6714. ReleaseOperand(op);
  6715. IF p IS SyntaxTree.Designator THEN
  6716. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6717. END;
  6718. END PushPort;
  6719. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6720. VAR tmp: IntermediateCode.Operand;
  6721. BEGIN
  6722. actualType := actualType.resolved;
  6723. IF actualType IS SyntaxTree.StringType THEN
  6724. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6725. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6726. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6727. ELSE
  6728. tmp := op.tag;
  6729. IntermediateCode.MakeMemory(tmp,addressType);
  6730. Emit(Push(position,tmp));
  6731. END;
  6732. Emit(Push(position,op.op))
  6733. END PushString;
  6734. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6735. VAR
  6736. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6737. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6738. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6739. tmp:IntermediateCode.Operand;
  6740. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6741. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6742. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6743. dest: IntermediateCode.Operand;
  6744. staticLength: LONGINT; itype: IntermediateCode.Type;
  6745. convert,isTensor: BOOLEAN;
  6746. recordType: SyntaxTree.RecordType;
  6747. baseType: SyntaxTree.Type;
  6748. flags: SET;
  6749. left: SyntaxTree.Expression;
  6750. call: SyntaxTree.Designator;
  6751. procedure: SyntaxTree.Procedure;
  6752. temporaryVariable: SyntaxTree.Variable;
  6753. dummy: IntermediateCode.Operand;
  6754. customBuiltin: SyntaxTree.CustomBuiltin;
  6755. isVarPar: ARRAY 3 OF BOOLEAN;
  6756. callsection: Sections.Section;
  6757. segmentedName: Basic.SegmentedName;
  6758. needsTrace: BOOLEAN;
  6759. n: ARRAY 256 OF CHAR;
  6760. modifier: SyntaxTree.Modifier;
  6761. previous, init: IntermediateCode.Section;
  6762. prevScope: SyntaxTree.Scope;
  6763. firstPar: LONGINT;
  6764. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6765. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6766. priority: IntermediateCode.Operand;
  6767. op,callop: Operand;
  6768. BEGIN
  6769. IF type = NIL THEN RETURN END;
  6770. type := type.resolved;
  6771. IF type IS SyntaxTree.PointerType THEN
  6772. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6773. END;
  6774. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6775. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6776. recordScope := type(SyntaxTree.RecordType).recordScope;
  6777. IF recordScope.bodyProcedure # NIL THEN
  6778. procedure := recordScope.bodyProcedure;
  6779. body := procedure.procedureScope.body;
  6780. Emit(Push(position,self));
  6781. IF body.isActive THEN
  6782. StaticCallOperand(callop,procedure);
  6783. Emit(Push(position,callop.op));
  6784. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6785. Convert(priority,sizeType);
  6786. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6787. END;
  6788. Emit(Push(position,priority));
  6789. ReleaseIntermediateOperand(priority);
  6790. IF backend.cooperative THEN
  6791. Emit(Push(position,self));
  6792. CallThis(position,"Activities","Create",3)
  6793. ELSE
  6794. flags := 0;
  6795. IF body.isSafe THEN
  6796. flags := 1;
  6797. END;
  6798. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6799. Emit(Push(position,self));
  6800. CallThis(position,"Objects","CreateProcess",4)
  6801. END;
  6802. ELSE
  6803. Emit(Push(position,self));
  6804. StaticCallOperand(callop,procedure);
  6805. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6806. END;
  6807. Emit(Pop(position,self));
  6808. END;
  6809. END CallBodies;
  6810. PROCEDURE PushTD(type: SyntaxTree.Type);
  6811. VAR op: IntermediateCode.Operand;
  6812. BEGIN
  6813. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6814. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6815. ELSE
  6816. IF type.resolved IS SyntaxTree.PointerType THEN
  6817. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6818. END;
  6819. op := TypeDescriptorAdr(type.resolved);
  6820. IF ~newObjectFile THEN
  6821. IntermediateCode.MakeMemory(op,addressType);
  6822. END;
  6823. Emit(Push(position,op));
  6824. END
  6825. END PushTD;
  6826. BEGIN
  6827. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6828. dest := destination; destination := emptyOperand;
  6829. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6830. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6831. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6832. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6833. CASE x.id OF
  6834. (* ---- COPY ----- *)
  6835. |Global.Copy:
  6836. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6837. (* ---- EXCL, INCL----- *)
  6838. |Global.Excl,Global.Incl:
  6839. Evaluate(p0,s0);
  6840. Evaluate(p1,s1);
  6841. Convert(s1.op,setType);
  6842. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6843. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6844. END;
  6845. ReuseCopy(res,s0.op);
  6846. ReleaseOperand(s0);
  6847. Reuse1(tmp,s1.op);
  6848. ReleaseOperand(s1);
  6849. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6850. IF x.id = Global.Excl THEN
  6851. Emit(Not(position,tmp,tmp));
  6852. Emit(And(position,res,res,tmp));
  6853. ELSE
  6854. Emit(Or(position,res,res,tmp));
  6855. END;
  6856. ReleaseIntermediateOperand(tmp);
  6857. Designate(p0,s0);
  6858. ToMemory(s0.op,setType,0);
  6859. Emit(Mov(position,s0.op,res));
  6860. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6861. (* ---- DISPOSE ----- *)
  6862. |Global.Dispose:
  6863. Designate(p0,s0);
  6864. Emit(Push(position,s0.op));
  6865. ReleaseOperand(s0);
  6866. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6867. (* ---- GETPROCEDURE ----- *)
  6868. |Global.GetProcedure:
  6869. Designate(p0,s0);
  6870. PushString(s0,p0.type);
  6871. Designate(p1,s1);
  6872. PushString(s1,p1.type);
  6873. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6874. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6875. ELSE PushTD(procedureType.firstParameter.type)
  6876. END;
  6877. PushTD(procedureType.returnType);
  6878. Designate(p2,s2);
  6879. Emit(Push(position,s2.op));
  6880. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6881. CallThis(position,"Modules","GetProcedure", 7);
  6882. (* ---- ASH, LSH, ROT ----- *)
  6883. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6884. Evaluate(p0,s0);
  6885. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6886. (* make unsigned arguments in order to produced a logical shift *)
  6887. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6888. convert:= TRUE;
  6889. itype := s0.op.type;
  6890. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6891. Convert(s0.op,itype);
  6892. ELSE
  6893. convert := FALSE;
  6894. END;
  6895. END;
  6896. Evaluate(p1,s1);
  6897. IF IsIntegerConstant(p1,hint) THEN
  6898. ReuseCopy(reg,s0.op);
  6899. IF hint > 0 THEN
  6900. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6901. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6902. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6903. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6904. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6905. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6906. END;
  6907. ELSIF hint < 0 THEN
  6908. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6909. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6910. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6911. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6912. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6913. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6914. END;
  6915. END;
  6916. ReleaseOperand(s0); ReleaseOperand(s1);
  6917. ELSE
  6918. exit := NewLabel();
  6919. end := NewLabel();
  6920. ReuseCopy(reg,s0.op);
  6921. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6922. Reuse1(tmp,s1.op);
  6923. Emit(Neg(position,tmp,s1.op));
  6924. Convert(tmp,s1.op.type);
  6925. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6926. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6927. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6928. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6929. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6930. END;
  6931. ReleaseIntermediateOperand(tmp);
  6932. BrL(end);
  6933. SetLabel(exit);
  6934. ReuseCopy(tmp,s1.op);
  6935. Convert(tmp,s1.op.type);
  6936. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6937. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6938. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6939. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6940. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6941. END;
  6942. ReleaseIntermediateOperand(tmp);
  6943. SetLabel(end);
  6944. ReleaseOperand(s0); ReleaseOperand(s1);
  6945. END;
  6946. InitOperand(result,ModeValue);
  6947. IF convert THEN
  6948. itype := reg.type;
  6949. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6950. Convert(reg,itype);
  6951. END;
  6952. result.op := reg;
  6953. (* ---- CAP ----- *)
  6954. |Global.Cap:
  6955. Evaluate(p0,result);
  6956. ReuseCopy(reg,result.op);
  6957. ReleaseIntermediateOperand(result.op);
  6958. ignore := NewLabel();
  6959. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6960. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6961. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6962. SetLabel(ignore);
  6963. result.op := reg;
  6964. (* ---- CHR ----- *)
  6965. |Global.Chr, Global.Chr32:
  6966. Evaluate(p0,result);
  6967. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6968. |Global.Entier, Global.EntierH:
  6969. Evaluate(p0,result);
  6970. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6971. (* ---- MIN and MAX ----- *)
  6972. |Global.Max,Global.Min:
  6973. Evaluate(p0,s0);
  6974. Evaluate(p1,s1);
  6975. Reuse2(res,s0.op,s1.op);
  6976. else := NewLabel();
  6977. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6978. ELSE BrltL(else,s1.op,s0.op) END;
  6979. Emit(Mov(position,res,s0.op));
  6980. ReleaseOperand(s0);
  6981. end := NewLabel();
  6982. BrL(end);
  6983. SetLabel(else);
  6984. Emit(MovReplace(position,res,s1.op));
  6985. SetLabel(end);
  6986. ReleaseOperand(s1);
  6987. InitOperand(result,ModeValue);
  6988. result.op := res;
  6989. (* ---- ODD ----- *)
  6990. |Global.Odd:
  6991. IF ~conditional THEN
  6992. ConditionToValue(x)
  6993. ELSE
  6994. Evaluate(p0,result);
  6995. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6996. Reuse1(res,result.op);
  6997. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6998. ReleaseIntermediateOperand(result.op);
  6999. result.op := res;
  7000. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7001. ReleaseOperand(result);
  7002. BrL(falseLabel);
  7003. END;
  7004. (* ---- ORD ----- *)
  7005. |Global.Ord, Global.Ord32:
  7006. Evaluate(p0,result);
  7007. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7008. (* ---- SHORT, LONG ----- *)
  7009. |Global.Short, Global.Long:
  7010. Evaluate(p0,result);
  7011. IF x.type IS SyntaxTree.ComplexType THEN
  7012. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7013. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7014. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7015. ELSE
  7016. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7017. END
  7018. (* ---- HALT, SYSTEM.HALT----- *)
  7019. |Global.Halt, Global.systemHalt:
  7020. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7021. EmitTrap (position, val);
  7022. (* ---- ASSERT ----- *)
  7023. |Global.Assert:
  7024. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7025. trueL := NewLabel();
  7026. falseL := NewLabel();
  7027. Condition(p0,trueL,falseL);
  7028. IF p1 = NIL THEN val := AssertTrap
  7029. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7030. END;
  7031. SetLabel(falseL);
  7032. EmitTrap(position,val);
  7033. SetLabel(trueL);
  7034. END;
  7035. (*
  7036. Emit(TrapC(result.op,val);
  7037. *)
  7038. (* ---- INC, DEC----- *)
  7039. |Global.Inc,Global.Dec:
  7040. Expression(p0); adr := result.op;
  7041. LoadValue(result,p0.type); l := result;
  7042. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7043. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7044. END;
  7045. IF x.id = Global.Inc THEN
  7046. Emit(Add(position,l.op,l.op,r.op));
  7047. ELSE
  7048. Emit(Sub(position,l.op,l.op,r.op));
  7049. END;
  7050. ReleaseOperand(l); ReleaseOperand(r);
  7051. (* ---- LEN ----- *)
  7052. |Global.Len: (* dynamic length, static length done by checker *)
  7053. Designate(p0,operand);
  7054. IF p1 = NIL THEN
  7055. InitOperand(l,ModeValue);
  7056. l.op := IntermediateCode.Immediate(int32,0);
  7057. ELSE
  7058. Evaluate(p1,l);
  7059. END;
  7060. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7061. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7062. Dereference(operand, p0.type.resolved, FALSE);
  7063. END;
  7064. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7065. ReleaseOperand(operand); ReleaseOperand(l);
  7066. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7067. ASSERT(p1 # NIL);
  7068. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7069. Dereference(operand,p0.type.resolved,FALSE);
  7070. END;
  7071. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7072. ReleaseOperand(operand); ReleaseOperand(l);
  7073. ELSE HALT(100);
  7074. END;
  7075. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7076. (* ---- FIRST ---- *)
  7077. |Global.First:
  7078. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7079. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7080. ELSE
  7081. Designate(p0, result)
  7082. END
  7083. (* ---- LAST ---- *)
  7084. |Global.Last:
  7085. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7086. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7087. ELSE
  7088. Designate(p0, result);
  7089. (* make sure result.op is a register *)
  7090. tmp := result.op;
  7091. ReuseCopy(result.op, result.op);
  7092. ReleaseIntermediateOperand(tmp);
  7093. (* add offset to result.op *)
  7094. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7095. END
  7096. (* ---- STEP ---- *)
  7097. |Global.Step:
  7098. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7099. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7100. ELSE
  7101. Designate(p0, result);
  7102. (* make sure result.op is a register *)
  7103. tmp := result.op;
  7104. ReuseCopy(result.op, result.op);
  7105. ReleaseIntermediateOperand(tmp);
  7106. (* add offset to result.op *)
  7107. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7108. END
  7109. (* ---- RE ---- *)
  7110. |Global.Re:
  7111. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7112. Designate(p0, result)
  7113. ELSE
  7114. Evaluate(p0, result)
  7115. END
  7116. (* ---- IM ---- *)
  7117. |Global.Im:
  7118. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7119. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7120. Designate(p0, result);
  7121. (* make sure result.op is a register *)
  7122. tmp := result.op;
  7123. ReuseCopy(result.op, result.op);
  7124. ReleaseIntermediateOperand(tmp);
  7125. (* add offset to result.op *)
  7126. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7127. (* ---- ABS ----- *)
  7128. |Global.Abs:
  7129. Evaluate(p0,operand);
  7130. type := p0.type.resolved;
  7131. InitOperand(result,ModeValue);
  7132. Reuse1a(result.op,operand.op,dest);
  7133. Emit(Abs(position,result.op,operand.op));
  7134. ReleaseOperand(operand);
  7135. (* ---- WAIT ----- *)
  7136. |Global.Wait:
  7137. Evaluate(p0,operand);
  7138. Emit(Push(position,operand.op));
  7139. ReleaseOperand(operand);
  7140. CallThis(position,"Activities","Wait", 1);
  7141. (* ---- NEW ----- *)
  7142. |Global.New:
  7143. (*! the following code is only correct for "standard" Oberon calling convention *)
  7144. IF x.type # NIL THEN
  7145. type := x.type.resolved;
  7146. firstPar := 0;
  7147. ELSE
  7148. type := p0.type.resolved;
  7149. firstPar := 1;
  7150. END;
  7151. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7152. THEN
  7153. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7154. IF backend.cooperative THEN
  7155. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7156. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7157. IF recordType.isObject THEN
  7158. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7159. IF recordType.IsActive() THEN
  7160. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7161. END;
  7162. IF recordType.IsProtected() THEN
  7163. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7164. END;
  7165. ELSE
  7166. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7167. END;
  7168. END;
  7169. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7170. CallThis(position,"Runtime","New", 1);
  7171. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7172. Emit(Result(position, pointer));
  7173. exit := NewLabel();
  7174. BreqL(exit,pointer,nil);
  7175. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7176. GetRecordTypeName (recordType,name);
  7177. IF ~recordType.isObject THEN
  7178. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7179. END;
  7180. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7181. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7182. IF recordType.isObject THEN
  7183. IF recordType.IsProtected() THEN
  7184. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7185. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7186. END;
  7187. IF recordType.IsActive() THEN
  7188. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7189. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7190. END;
  7191. END;
  7192. END;
  7193. (* initialize fields *)
  7194. IF type(SyntaxTree.PointerType).isPlain THEN
  7195. size := 0;
  7196. ELSIF recordType.isObject THEN
  7197. size := BaseObjectTypeSize;
  7198. ELSE
  7199. size := BaseRecordTypeSize;
  7200. END;
  7201. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7202. (* call initializer *)
  7203. constructor := GetConstructor(recordType);
  7204. IF constructor # NIL THEN
  7205. (*! should be unified with ProcedureCallDesignator *)
  7206. Emit(Push(position,pointer));
  7207. ReleaseIntermediateOperand(pointer);
  7208. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7209. FOR i := firstPar TO x.parameters.Length()-1 DO
  7210. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7211. formalParameter := formalParameter.nextParameter;
  7212. END;
  7213. (* static call of the constructor *)
  7214. GetCodeSectionNameForSymbol(constructor,name);
  7215. ASSERT(~constructor.isInline);
  7216. IF constructor.scope.ownerModule # module.module THEN
  7217. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7218. ELSE
  7219. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7220. END;
  7221. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7222. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7223. Emit(Pop(position,pointer));
  7224. END;
  7225. (* call bodies *)
  7226. CallBodies(pointer,type);
  7227. SetLabel(exit);
  7228. needsTrace := p0.NeedsTrace();
  7229. IF needsTrace THEN ModifyAssignments(true) END;
  7230. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7231. Emit(Push(position, pointer));
  7232. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7233. Emit(Pop(position, pointer));
  7234. END;
  7235. Designate(p0,l);
  7236. IF needsTrace THEN
  7237. CallAssignPointer(l.op, pointer);
  7238. ELSE
  7239. ToMemory(l.op,addressType,0);
  7240. Emit(Mov(position,l.op,pointer));
  7241. END;
  7242. ReleaseIntermediateOperand(pointer);
  7243. ReleaseOperand(l);
  7244. IF needsTrace THEN ModifyAssignments(false) END;
  7245. ELSE (* not cooperative backend *)
  7246. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7247. IF temporaryVariable # NIL THEN
  7248. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7249. ELSE
  7250. Designate(p0,l);
  7251. END;
  7252. (* l.op contains address of pointer to record *)
  7253. Emit(Push(position,l.op)); (* address for use after syscall *)
  7254. Emit(Push(position,l.op));
  7255. ReleaseOperand(l);
  7256. (* push type descriptor *)
  7257. reg := TypeDescriptorAdr(recordType);
  7258. IF ~newObjectFile THEN
  7259. IntermediateCode.MakeMemory(reg,addressType);
  7260. END;
  7261. Emit(Push(position,reg));
  7262. ReleaseIntermediateOperand(reg);
  7263. (* push realtime flag *)
  7264. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7265. ELSE Emit(Push(position,false));
  7266. END;
  7267. CallThis(position,"Heaps","NewRec", 3);
  7268. (* check allocation success, if not successful then do not call initializers and bodies *)
  7269. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7270. Emit(Pop(position,pointer));
  7271. MakeMemory(reg,pointer,addressType,0);
  7272. ReleaseIntermediateOperand(pointer);
  7273. pointer := reg;
  7274. exit := NewLabel();
  7275. BreqL(exit,pointer,nil);
  7276. Emit(Push(position,pointer));
  7277. (* initialize fields *)
  7278. InitFields(recordType, pointer,0);
  7279. (* call initializer *)
  7280. constructor := GetConstructor(recordType);
  7281. IF constructor # NIL THEN
  7282. (*! should be unified with ProcedureCallDesignator *)
  7283. Emit(Push(position,pointer));
  7284. ReleaseIntermediateOperand(pointer);
  7285. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7286. FOR i := firstPar TO x.parameters.Length()-1 DO
  7287. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7288. formalParameter := formalParameter.nextParameter;
  7289. END;
  7290. (* static call of the constructor *)
  7291. GetCodeSectionNameForSymbol(constructor,name);
  7292. ASSERT(~constructor.isInline);
  7293. IF constructor.scope.ownerModule # module.module THEN
  7294. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7295. ELSE
  7296. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7297. END;
  7298. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7299. ELSE
  7300. ReleaseIntermediateOperand(pointer);
  7301. END;
  7302. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7303. Emit(Pop(position,pointer));
  7304. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7305. Designate(p0,l);
  7306. ToMemory(l.op,addressType,0);
  7307. Emit(Mov(position,l.op,pointer));
  7308. ReleaseOperand(l);
  7309. result.tag := emptyOperand;
  7310. ELSIF (x.type # NIL) THEN
  7311. result := l; (* temporary variable is the result of NEW Type() *)
  7312. END;
  7313. (* call bodies *)
  7314. CallBodies(pointer,type);
  7315. ReleaseIntermediateOperand(pointer);
  7316. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7317. end := NewLabel();
  7318. BrL(end);
  7319. SetLabel(exit);
  7320. Designate(p0,l);
  7321. ToMemory(l.op,addressType,0);
  7322. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7323. ReleaseOperand(l);
  7324. SetLabel(end);
  7325. ELSE
  7326. SetLabel(exit);
  7327. END;
  7328. END;
  7329. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7330. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7331. IF ~backend.cooperative THEN (* simpler version *)
  7332. (*
  7333. push len0
  7334. push len1
  7335. push len2
  7336. push len_size
  7337. push len_adr
  7338. push tag
  7339. push static elements
  7340. push element size
  7341. push adr
  7342. *)
  7343. dim := 0;
  7344. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7345. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7346. parameter := x.parameters.GetExpression(i);
  7347. Evaluate(parameter,r);
  7348. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7349. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7350. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7351. END;
  7352. Emit(Push(position,r.op));
  7353. ReleaseOperand(r);
  7354. INC(dim);
  7355. END;
  7356. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7357. Emit(Mov(position, adr, sp));
  7358. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7359. Emit(Push(position, adr));
  7360. ReleaseIntermediateOperand(adr);
  7361. openDim := dim;
  7362. staticLength := 1;
  7363. IF type IS SyntaxTree.ArrayType THEN
  7364. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7365. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7366. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7367. END;
  7368. END;
  7369. IF SemanticChecker.ContainsPointer(type) THEN
  7370. tmp := TypeDescriptorAdr(type);
  7371. IF ~newObjectFile THEN
  7372. IntermediateCode.MakeMemory(tmp,addressType);
  7373. END;
  7374. ELSE
  7375. tmp := nil;
  7376. END;
  7377. Emit(Push(position,tmp)); (* type descriptor *)
  7378. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7379. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7380. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7381. Designate(p0,l);
  7382. Emit(Push(position,l.op)); (* address *)
  7383. ReleaseOperand(l);
  7384. CallThis(position,"Heaps","NewArray", 6);
  7385. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7386. Emit(Add(position,sp,sp,tmp));
  7387. ELSE
  7388. dim := 0;
  7389. IntermediateCode.InitOperand(reg);
  7390. IF p1 # NIL THEN
  7391. FOR i := firstPar TO x.parameters.Length()-1 DO
  7392. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7393. parameter := x.parameters.GetExpression(i);
  7394. Evaluate(parameter,r);
  7395. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7396. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7397. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7398. END;
  7399. Emit(Push(position,r.op));
  7400. IF i=1 THEN
  7401. CopyInt(reg,r.op);
  7402. ELSE
  7403. MulInt(reg, reg, r.op);
  7404. END;
  7405. ReleaseOperand(r);
  7406. INC(dim);
  7407. END;
  7408. Convert(reg,addressType);
  7409. ELSE
  7410. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7411. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7412. END;
  7413. openDim := dim;
  7414. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7415. IF backend.cooperative THEN
  7416. size := ToMemoryUnits(system,system.SizeOf(type));
  7417. WHILE type IS SyntaxTree.ArrayType DO
  7418. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7419. END;
  7420. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7421. IF (size # 1) THEN
  7422. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7423. END;
  7424. Emit(Push(position,reg));
  7425. size := ToMemoryUnits(system,system.SizeOf(type));
  7426. IF (size # 1) THEN
  7427. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7428. END;
  7429. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7430. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7431. Emit(Push(position,reg));
  7432. ReleaseIntermediateOperand(reg);
  7433. CallThis(position,"Runtime","New", 1);
  7434. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7435. Emit(Result(position, pointer));
  7436. exit := NewLabel();
  7437. else := NewLabel();
  7438. BreqL(else,pointer,nil);
  7439. IF ~type.hasPointers THEN
  7440. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7441. ELSIF type IS SyntaxTree.RecordType THEN
  7442. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7443. ELSIF type IS SyntaxTree.ProcedureType THEN
  7444. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7445. ELSE
  7446. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7447. END;
  7448. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7449. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7450. 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))));
  7451. IF type IS SyntaxTree.RecordType THEN
  7452. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7453. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7454. ELSE
  7455. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7456. END;
  7457. i := openDim;
  7458. WHILE i > 0 DO
  7459. DEC (i);
  7460. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7461. END;
  7462. needsTrace := p0.NeedsTrace();
  7463. IF needsTrace THEN ModifyAssignments(true) END;
  7464. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7465. Emit(Push(position, pointer));
  7466. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7467. Emit(Pop(position, pointer));
  7468. END;
  7469. Designate(p0,l);
  7470. IF needsTrace THEN
  7471. CallAssignPointer(l.op, pointer);
  7472. ModifyAssignments(false);
  7473. ELSE
  7474. ToMemory(l.op,addressType,0);
  7475. Emit(Mov(position,l.op,pointer));
  7476. END;
  7477. ReleaseIntermediateOperand(pointer);
  7478. ReleaseOperand(l);
  7479. BrL(exit);
  7480. SetLabel(else);
  7481. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7482. Designate(p0,l);
  7483. IF needsTrace THEN
  7484. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7485. ELSE
  7486. ToMemory(l.op,addressType,0);
  7487. Emit(Mov(position,l.op,pointer));
  7488. END;
  7489. ReleaseOperand(l);
  7490. SetLabel(exit);
  7491. ELSE
  7492. (*! the following code is only correct for "standard" Oberon calling convention *)
  7493. IF SemanticChecker.ContainsPointer(type) THEN
  7494. IF type IS SyntaxTree.ArrayType THEN
  7495. staticLength := 1;
  7496. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7497. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7498. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7499. END;
  7500. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7501. MulInt(reg,reg,tmp);
  7502. END;
  7503. Designate(p0,l);
  7504. IF openDim > 0 THEN
  7505. Emit(Push(position,l.op)); (* address for use after syscall *)
  7506. END;
  7507. Emit(Push(position,l.op)); (* address *)
  7508. ReleaseOperand(l);
  7509. tmp := TypeDescriptorAdr(type);
  7510. IF ~newObjectFile THEN
  7511. IntermediateCode.MakeMemory(tmp,addressType);
  7512. END;
  7513. Emit(Push(position,tmp)); (* type descriptor *)
  7514. ReleaseIntermediateOperand(tmp);
  7515. Emit(Push(position,reg)); (* number Elements *)
  7516. ReleaseIntermediateOperand(reg);
  7517. tmp := IntermediateCode.Immediate(addressType,dim);
  7518. Emit(Push(position,tmp)); (* dimensions *)
  7519. (* push realtime flag *)
  7520. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7521. ELSE Emit(Push(position,false));
  7522. END;
  7523. CallThis(position,"Heaps","NewArr",5)
  7524. ELSE
  7525. size := ToMemoryUnits(system,system.SizeOf(type));
  7526. IF (size # 1) THEN
  7527. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7528. (*
  7529. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7530. *)
  7531. END;
  7532. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7533. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7534. AddInt(reg, reg, tmp);
  7535. (*
  7536. Emit(Add(position,reg,reg,tmp));
  7537. *)
  7538. Designate(p0,l);
  7539. IF openDim >0 THEN
  7540. Emit(Push(position,l.op)); (* address for use after syscall *)
  7541. END;
  7542. Emit(Push(position,l.op)); (* address for syscall *)
  7543. ReleaseOperand(l); (* pointer address *)
  7544. Emit(Push(position,reg)); (* size *)
  7545. ReleaseIntermediateOperand(reg);
  7546. (* push realtime flag *)
  7547. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7548. ELSE Emit(Push(position,false));
  7549. END;
  7550. CallThis(position,"Heaps","NewSys", 3)
  7551. END;
  7552. IF openDim > 0 THEN
  7553. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7554. Emit(Pop(position,adr));
  7555. ToMemory(adr,addressType,0);
  7556. ReuseCopy(tmp,adr);
  7557. ReleaseIntermediateOperand(adr);
  7558. adr := tmp;
  7559. else := NewLabel();
  7560. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7561. i := openDim-1;
  7562. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7563. WHILE (i >= 0) DO
  7564. Emit(Pop(position,reg));
  7565. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7566. Emit(Mov(position,res,reg));
  7567. DEC(i);
  7568. END;
  7569. ReleaseIntermediateOperand(adr);
  7570. ReleaseIntermediateOperand(reg);
  7571. exit := NewLabel();
  7572. BrL(exit);
  7573. SetLabel(else);
  7574. (* else part: array could not be allocated *)
  7575. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7576. Emit(Add(position,sp,sp,tmp));
  7577. SetLabel(exit);
  7578. END;
  7579. END;
  7580. END;
  7581. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7582. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7583. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7584. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7585. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7586. left.SetType(procedure.type);
  7587. formalParameter := procedureType.firstParameter;
  7588. (* push array to allocate *)
  7589. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7590. formalParameter :=formalParameter.nextParameter;
  7591. (* push length array *)
  7592. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7593. (* push size *)
  7594. type := t0;
  7595. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7596. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7597. END;
  7598. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7599. Emit(Push(position,tmp));
  7600. (* *)
  7601. IF SemanticChecker.ContainsPointer(type) THEN
  7602. tmp := TypeDescriptorAdr(type);
  7603. IF ~newObjectFile THEN
  7604. IntermediateCode.MakeMemory(tmp,addressType);
  7605. END;
  7606. ELSE
  7607. tmp := IntermediateCode.Immediate(addressType, 0);
  7608. END;
  7609. Emit(Push(position,tmp)); (* type descriptor *)
  7610. StaticCallOperand(result,procedure);
  7611. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7612. ReleaseOperand(result);
  7613. END;
  7614. (*
  7615. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7616. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7617. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7618. *)
  7619. ELSE
  7620. (*
  7621. push len0
  7622. push len1
  7623. push len2
  7624. push size
  7625. push len_adr
  7626. push element_size
  7627. push tag
  7628. push adr
  7629. *)
  7630. dim := 0;
  7631. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7632. isTensor := TRUE;
  7633. ELSE
  7634. isTensor := FALSE;
  7635. END;
  7636. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7637. IF ~isTensor THEN
  7638. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7639. END;
  7640. parameter := x.parameters.GetExpression(i);
  7641. Evaluate(parameter,r);
  7642. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7643. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7644. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7645. END;
  7646. Emit(Push(position,r.op));
  7647. ReleaseOperand(r);
  7648. INC(dim);
  7649. END;
  7650. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7651. Emit(Mov(position, adr, sp));
  7652. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7653. Emit(Push(position, adr));
  7654. ReleaseIntermediateOperand(adr);
  7655. openDim := dim;
  7656. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7657. IF isTensor THEN
  7658. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7659. ELSE
  7660. baseType := SemanticChecker.ArrayBase(type,openDim);
  7661. END;
  7662. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7663. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7664. IF SemanticChecker.ContainsPointer(baseType) THEN
  7665. tmp := TypeDescriptorAdr(baseType);
  7666. IF ~newObjectFile THEN
  7667. IntermediateCode.MakeMemory(tmp,addressType);
  7668. END;
  7669. ELSE
  7670. tmp := nil;
  7671. END;
  7672. Emit(Push(position,tmp)); (* type descriptor *)
  7673. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7674. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7675. ELSE (* error message has already been emited *)
  7676. RETURN;
  7677. END;
  7678. Designate(p0,l);
  7679. IF isTensor THEN
  7680. Emit(Push(position,l.op)); (* address *)
  7681. ELSE
  7682. Emit(Push(position,l.tag)); (* address *)
  7683. END;
  7684. ReleaseOperand(l);
  7685. StaticCallOperand(result,procedure);
  7686. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7687. ReleaseOperand(result);
  7688. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7689. Emit(Add(position,sp,sp,tmp));
  7690. END;
  7691. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7692. THEN
  7693. IF ~backend.cellsAreObjects THEN RETURN END;
  7694. IF InCellScope(currentScope) THEN
  7695. PushSelfPointer()
  7696. ELSE
  7697. Emit(Push(position, nil));
  7698. END;
  7699. (* push temp address *)
  7700. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7701. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7702. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7703. (* l.op contains address of pointer to record *)
  7704. Emit(Push(position,l.op)); (* address for use after syscall *)
  7705. ReleaseOperand(l);
  7706. (* push type descriptor *)
  7707. reg := TypeDescriptorAdr(baseType);
  7708. IF ~newObjectFile THEN
  7709. IntermediateCode.MakeMemory(reg,addressType);
  7710. END;
  7711. Emit(Push(position,reg));
  7712. ReleaseIntermediateOperand(reg);
  7713. (* push name *)
  7714. (*Global.GetSymbolName(p0, n);*)
  7715. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7716. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7717. ELSE
  7718. Global.GetModuleName(module.module, n);
  7719. END;
  7720. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7721. (*type.typeDeclaration.GetName(n);*)
  7722. PushConstString(n);
  7723. (* push cellnet boolean *)
  7724. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7725. (* push engine boolean *)
  7726. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7727. (* allocate *)
  7728. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7729. (* add capabilities *)
  7730. modifier := p0(SyntaxTree.Designator).modifiers;
  7731. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7732. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7733. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7734. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7735. END;
  7736. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7737. (*
  7738. modifier := baseType(SyntaxTree.CellType).modifiers;
  7739. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7740. modifier := p0(SyntaxTree.Designator).modifiers;
  7741. *)
  7742. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7743. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7744. (* l.op contains address of pointer to record *)
  7745. ToMemory(l.op,addressType,0);
  7746. (* l.op contains value of pointer to record *)
  7747. Emit(Push(position,l.op)); (* address for use after syscall *)
  7748. ReleaseOperand(l);
  7749. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7750. prevScope := currentScope;
  7751. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7752. previous := section;
  7753. section := init;
  7754. (* add ports *)
  7755. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7756. CloseInitializer(previous);
  7757. currentScope := prevScope;
  7758. Symbol(temporaryVariable,l);
  7759. ToMemory(l.op,addressType,0);
  7760. Emit(Push(position,l.op));
  7761. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7762. (*
  7763. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7764. IF constructor # NIL THEN
  7765. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7766. FOR i := 1 TO x.parameters.Length()-1 DO
  7767. p := x.parameters.GetExpression(i);
  7768. Global.GetSymbolName(parameter,name);
  7769. Evaluate(p, value);
  7770. ASSERT(value.type # NIL);
  7771. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7772. par := instance.AddParameter(name);
  7773. par.SetInteger(value.integer);
  7774. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7775. par := instance.AddParameter(name);
  7776. par.SetBoolean(value.boolean);
  7777. ELSE Error(x.position,NotYetImplemented)
  7778. END;
  7779. parameter := parameter.nextParameter
  7780. END;
  7781. END;
  7782. *)
  7783. (* call initializer *)
  7784. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7785. IF constructor # NIL THEN
  7786. (*! should be unified with ProcedureCallDesignator *)
  7787. IF backend.cellsAreObjects THEN
  7788. Symbol(temporaryVariable,l);
  7789. ToMemory(l.op,addressType,0);
  7790. Emit(Push(position,l.op));
  7791. ReleaseOperand(l);
  7792. END;
  7793. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7794. FOR i := firstPar TO x.parameters.Length()-1 DO
  7795. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7796. formalParameter := formalParameter.nextParameter;
  7797. END;
  7798. (* static call of the constructor *)
  7799. Global.GetSymbolSegmentedName(constructor,name);
  7800. ASSERT(~constructor.isInline);
  7801. IF constructor.scope.ownerModule # module.module THEN
  7802. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7803. ELSE
  7804. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7805. END;
  7806. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7807. (*ELSE
  7808. ReleaseIntermediateOperand(pointer);*)
  7809. END;
  7810. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7811. ToMemory(l.op, addressType, 0);
  7812. Designate(p0,s0);
  7813. ToMemory(s0.op,addressType,0);
  7814. Emit(Mov(position,s0.op,l.op));
  7815. ReleaseOperand(l);
  7816. ReleaseOperand(s0);
  7817. result.tag := emptyOperand;
  7818. (* start *)
  7819. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7820. (* push cell *)
  7821. Symbol(temporaryVariable, l);
  7822. ToMemory(l.op,addressType,0);
  7823. Emit(Push(Basic.invalidPosition,l.op));
  7824. (* push delegate *)
  7825. Emit(Push(Basic.invalidPosition,l.op));
  7826. ReleaseOperand(l);
  7827. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7828. Emit(Push(position, s1.op));
  7829. ReleaseOperand(s1);
  7830. CallThis(position,"ActiveCellsRuntime","Start",3);
  7831. END;
  7832. (*IF temporaryVariable # NIL THEN
  7833. end := NewLabel();
  7834. BrL(end);
  7835. SetLabel(exit);
  7836. Designate(p0,l);
  7837. ToMemory(l.op,addressType,0);
  7838. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7839. ReleaseOperand(l);
  7840. SetLabel(end);
  7841. ELSE
  7842. SetLabel(exit);
  7843. END;
  7844. *)
  7845. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7846. ELSE (* no pointer to record, no pointer to array *)
  7847. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7848. (* ignore new statement *)
  7849. Warning(p0.position, "cannot run on final hardware");
  7850. ELSE
  7851. HALT(200);
  7852. END;
  7853. END;
  7854. (* ---- ADDRESSOF----- *)
  7855. |Global.systemAdr:
  7856. Designate(p0,s0);
  7857. s0.mode := ModeValue;
  7858. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7859. ReleaseIntermediateOperand(s0.op);
  7860. s0.op := s0.tag;
  7861. IntermediateCode.InitOperand(s0.tag);
  7862. END;
  7863. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7864. result := s0;
  7865. (* ---- BIT ----- *)
  7866. |Global.systemBit:
  7867. Evaluate(p0,s0);
  7868. ToMemory(s0.op,addressType,0);
  7869. ReuseCopy(res,s0.op);
  7870. ReleaseOperand(s0);
  7871. Evaluate(p1,s1);
  7872. Emit(Ror(position,res,res,s1.op));
  7873. ReleaseOperand(s1);
  7874. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7875. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7876. IF ~conditional THEN
  7877. InitOperand(result,ModeValue); result.op := res;
  7878. ELSE
  7879. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7880. BrL(falseLabel);
  7881. ReleaseIntermediateOperand(res);
  7882. END;
  7883. (* --- MSK ----*)
  7884. |Global.systemMsk:
  7885. Evaluate(p0,s0);
  7886. Evaluate(p1,s1);
  7887. ReuseCopy(res,s0.op);
  7888. ReleaseOperand(s0);
  7889. Emit(And(position,res,res,s1.op));
  7890. ReleaseOperand(s1);
  7891. InitOperand(result,ModeValue);
  7892. result.op := res;
  7893. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7894. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7895. Evaluate(p0,s0);
  7896. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7897. ReleaseOperand(s0);
  7898. InitOperand(result,ModeValue);
  7899. result.op := res;
  7900. (* ---- SYSTEM.GetStackPointer ----- *)
  7901. |Global.systemGetStackPointer:
  7902. InitOperand(result,ModeValue);
  7903. result.op := sp;
  7904. (* ---- SYSTEM.GetFramePointer ----- *)
  7905. |Global.systemGetFramePointer:
  7906. InitOperand(result,ModeValue);
  7907. result.op := fp;
  7908. (* ---- SYSTEM.GetActivity ----- *)
  7909. |Global.systemGetActivity:
  7910. ASSERT(backend.cooperative);
  7911. InitOperand(result,ModeValue);
  7912. result.op := ap;
  7913. (* ---- SYSTEM.SetStackPointer ----- *)
  7914. |Global.systemSetStackPointer:
  7915. Evaluate(p0,s0); (* *)
  7916. Emit(Mov(position,sp,s0.op));
  7917. ReleaseOperand(s0);
  7918. (* ---- SYSTEM.SetFramePointer ----- *)
  7919. |Global.systemSetFramePointer:
  7920. Evaluate(p0,s0); (* *)
  7921. Emit(Mov(position,fp,s0.op));
  7922. ReleaseOperand(s0);
  7923. (* ---- SYSTEM.Activity ----- *)
  7924. |Global.systemSetActivity:
  7925. ASSERT(backend.cooperative);
  7926. Evaluate(p0,s0); (* *)
  7927. Emit(Mov(position,ap,s0.op));
  7928. ReleaseOperand(s0);
  7929. (* ---- SYSTEM.VAL ----- *)
  7930. |Global.systemVal:
  7931. Expression(p1);
  7932. s1 := result;
  7933. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7934. IF s1.mode = ModeReference THEN
  7935. (* nothing to be done if not record type, just take over new type *)
  7936. IF (type IS SyntaxTree.RecordType) THEN
  7937. ReleaseIntermediateOperand(s1.tag);
  7938. s1.tag := TypeDescriptorAdr(type);
  7939. IF ~newObjectFile THEN
  7940. IntermediateCode.MakeMemory(s1.tag,addressType);
  7941. END;
  7942. UseIntermediateOperand(s1.tag);
  7943. END;
  7944. result := s1;
  7945. ELSE (* copy over result to different type, may not use convert *)
  7946. itype := IntermediateCode.GetType(system,type);
  7947. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7948. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7949. Emit(Mov(position,s0.op,s1.op));
  7950. ReleaseOperand(s1);
  7951. InitOperand(result,ModeValue);
  7952. result.op := s0.op;
  7953. ELSE (* different size, must convert *)
  7954. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7955. Convert(s1.op, IntermediateCode.GetType(system,type));
  7956. result := s1;
  7957. END;
  7958. END;
  7959. (* ---- SYSTEM.GET ----- *)
  7960. |Global.systemGet:
  7961. Evaluate(p0,s0); (* adr *)
  7962. Designate(p1,s1); (* variable *)
  7963. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7964. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7965. Emit(Mov(position,s1.op,s0.op));
  7966. ReleaseOperand(s1);
  7967. ReleaseOperand(s0);
  7968. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7969. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7970. Evaluate(p0,s0); (* *)
  7971. Evaluate(p1,s1); (* variable *)
  7972. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7973. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7974. (* real part *)
  7975. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7976. Emit(Mov(position,res, s1.op));
  7977. ReleaseIntermediateOperand(res);
  7978. (* imaginary part *)
  7979. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7980. Emit(Mov(position,res, s1.tag));
  7981. ReleaseIntermediateOperand(res);
  7982. ReleaseOperand(s1);
  7983. ReleaseOperand(s0);
  7984. ELSE
  7985. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7986. ReleaseOperand(s0);
  7987. Emit(Mov(position,res,s1.op));
  7988. ReleaseIntermediateOperand(res);
  7989. ReleaseOperand(s1);
  7990. END;
  7991. (* ---- SYSTEM.MOVE ----- *)
  7992. |Global.systemMove:
  7993. Evaluate(p0,s0);
  7994. Evaluate(p1,s1);
  7995. Evaluate(p2,s2);
  7996. Emit(Copy(position,s1.op,s0.op,s2.op));
  7997. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7998. (* ---- SYSTEM.NEW ----- *)
  7999. |Global.systemNew:
  8000. Designate(p0,s0);
  8001. Emit(Push(position,s0.op));
  8002. ReleaseOperand(s0);
  8003. Evaluate(p1,s1);
  8004. Emit(Push(position,s1.op));
  8005. ReleaseOperand(s1);
  8006. (* push realtime flag: false by default *)
  8007. Emit(Push(position,false));
  8008. CallThis(position,"Heaps","NewSys",3);
  8009. (* ---- SYSTEM.CALL ----- *)
  8010. |Global.systemRef:
  8011. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8012. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8013. s0.mode := ModeValue;
  8014. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8015. result := s0
  8016. (* ---- INCR ----- *)
  8017. |Global.Incr:
  8018. Designate(p0,operand);
  8019. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8020. Dereference(operand,p0.type.resolved,FALSE);
  8021. END;
  8022. ASSERT(p1 # NIL);
  8023. Evaluate(p1,l);
  8024. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8025. ReleaseOperand(operand); ReleaseOperand(l);
  8026. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8027. (* ---- SUM ----- *)
  8028. |Global.Sum: HALT(200);
  8029. (* ---- ALL ----- *)
  8030. |Global.All: HALT(200);
  8031. (* ---- CAS ----- *)
  8032. |Global.Cas:
  8033. needsTrace := p0.NeedsTrace();
  8034. IF needsTrace THEN ModifyAssignments(true) END;
  8035. Designate(p0,s0);
  8036. Evaluate(p1,s1);
  8037. Evaluate(p2,s2);
  8038. IF needsTrace THEN
  8039. Emit(Push(position, s0.op));
  8040. Emit(Push(position, s1.op));
  8041. Emit(Push(position, s2.op));
  8042. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8043. ELSE
  8044. Emit(Cas(position,s0.op,s1.op,s2.op));
  8045. END;
  8046. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8047. IF needsTrace THEN ModifyAssignments(false) END;
  8048. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8049. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8050. IF conditional THEN
  8051. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8052. BrL(falseLabel);
  8053. ReleaseIntermediateOperand(res);
  8054. END;
  8055. (* ---- DIM ----- *)
  8056. |Global.Dim:
  8057. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8058. Designate(p0,s0);
  8059. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8060. Dereference(s0,p0.type.resolved,FALSE);
  8061. END;
  8062. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8063. ReleaseOperand(s0);
  8064. (* ---- RESHAPE ----- *)
  8065. |Global.Reshape:
  8066. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8067. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8068. left.SetType(procedure.type);
  8069. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8070. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8071. END;
  8072. (* ---- SYSTEM.TYPECODE ----- *)
  8073. |Global.systemTypeCode:
  8074. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8075. IF type.resolved IS SyntaxTree.PointerType THEN
  8076. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8077. END;
  8078. result.op := TypeDescriptorAdr(type);
  8079. IF ~newObjectFile THEN
  8080. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8081. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8082. END;
  8083. result.mode := ModeValue;
  8084. (* ---- SYSTEM.TRACE ----- *)
  8085. |Global.systemTrace:
  8086. SystemTrace(x.parameters, x.position);
  8087. (* ----- CONNECT ------*)
  8088. |Global.Connect:
  8089. IF backend.cellsAreObjects THEN
  8090. PushPort(p0);
  8091. PushPort(p1);
  8092. IF p2 # NIL THEN
  8093. Evaluate(p2, s2);
  8094. Emit(Push(p2.position, s2.op));
  8095. ReleaseOperand(s2);
  8096. ELSE
  8097. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8098. END;
  8099. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8100. ELSE
  8101. Warning(x.position, "cannot run on final hardware");
  8102. END;
  8103. (* ----- DELEGATE ------*)
  8104. |Global.Delegate:
  8105. IF backend.cellsAreObjects THEN
  8106. PushPort(p0);
  8107. PushPort(p1);
  8108. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8109. ELSE
  8110. Warning(x.position, "cannot run on final hardware");
  8111. END;
  8112. (* ----- SEND ------*)
  8113. |Global.Send:
  8114. Evaluate(p0,s0);
  8115. Evaluate(p1,s1);
  8116. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8117. Emit(Push(position,s0.op));
  8118. Emit(Push(position,s1.op));
  8119. (*
  8120. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8121. *)
  8122. IF ~backend.cellsAreObjects THEN
  8123. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8124. END;
  8125. ReleaseOperand(s0);
  8126. ReleaseOperand(s1);
  8127. IF backend.cellsAreObjects THEN
  8128. CallThis(position,"ActiveCellsRuntime","Send",2);
  8129. ELSE
  8130. CallThis(position,ChannelModuleName,"Send",2);
  8131. END;
  8132. (* ----- RECEIVE ------*)
  8133. |Global.Receive:
  8134. Evaluate(p0,s0);
  8135. Emit(Push(position,s0.op));
  8136. Designate(p1,s1);
  8137. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8138. Emit(Push(position,s1.op));
  8139. IF p2 # NIL THEN
  8140. Designate(p2,s2);
  8141. Emit(Push(position,s2.op));
  8142. END;
  8143. (*
  8144. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8145. *)
  8146. IF ~backend.cellsAreObjects THEN
  8147. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8148. END;
  8149. ReleaseOperand(s0);
  8150. ReleaseOperand(s1);
  8151. ReleaseOperand(s2);
  8152. IF backend.cellsAreObjects THEN
  8153. IF p2 = NIL THEN
  8154. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8155. ELSE
  8156. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8157. END;
  8158. ELSE
  8159. IF p2 = NIL THEN
  8160. CallThis(position,ChannelModuleName,"Receive",2)
  8161. ELSE
  8162. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8163. END;
  8164. END;
  8165. | Global.systemSpecial:
  8166. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8167. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8168. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8169. (* determine if parameters are of the VAR kind *)
  8170. ASSERT(x.parameters.Length() <= 3);
  8171. formalParameter := procedureType.firstParameter;
  8172. FOR i := 0 TO x.parameters.Length() - 1 DO
  8173. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8174. formalParameter := formalParameter.nextParameter
  8175. END;
  8176. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8177. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8178. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8179. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8180. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8181. IF procedureType.returnType # NIL THEN
  8182. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8183. Emit(Result(position, res));
  8184. (*InitOperand(result,ModeValue);
  8185. result.op := res;
  8186. *)
  8187. IF ~conditional THEN
  8188. InitOperand(result,ModeValue); result.op := res;
  8189. ELSE
  8190. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8191. BrL(falseLabel);
  8192. ReleaseIntermediateOperand(res);
  8193. END;
  8194. END
  8195. ELSE (* function not yet implemented *)
  8196. Error(position,"not yet implemented");
  8197. END;
  8198. destination := dest;
  8199. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8200. END VisitBuiltinCallDesignator;
  8201. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8202. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8203. BEGIN
  8204. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8205. dest := destination; destination := emptyOperand;
  8206. Expression(x.left);
  8207. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8208. ELSIF isUnchecked THEN (* no check *)
  8209. ELSE
  8210. trueL := NewLabel();
  8211. falseL := NewLabel();
  8212. IF IsPointerToRecord(x.left.type,recordType) THEN
  8213. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8214. Emit(Mov(position,tag, result.op));
  8215. IF result.mode # ModeValue THEN
  8216. ptr := tag;
  8217. IntermediateCode.MakeMemory(ptr,addressType);
  8218. Emit(Mov(position,tag, ptr));
  8219. END;
  8220. IF ~backend.cooperative THEN
  8221. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8222. END;
  8223. IntermediateCode.MakeMemory(tag,addressType);
  8224. ELSE
  8225. tag := result.tag;
  8226. UseIntermediateOperand(tag);
  8227. END;
  8228. TypeTest(tag,x.type,trueL,falseL);
  8229. ReleaseIntermediateOperand(tag);
  8230. SetLabel(falseL);
  8231. EmitTrap(position,TypeCheckTrap);
  8232. SetLabel(trueL);
  8233. END;
  8234. destination := dest;
  8235. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8236. END VisitTypeGuardDesignator;
  8237. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8238. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8239. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8240. VAR label: Label; pc: LONGINT;
  8241. BEGIN
  8242. IF backend.cooperative & ~isUnchecked THEN
  8243. pc := section.pc;
  8244. label := NewLabel();
  8245. BrneL(label, operand.op, nil);
  8246. EmitTrap(position, NilPointerTrap);
  8247. SetLabel(label);
  8248. INC(statCoopNilCheck, section.pc - pc);
  8249. END;
  8250. END NilCheck;
  8251. BEGIN
  8252. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8253. ReuseCopy(dereferenced,operand.op);
  8254. ReleaseOperand(operand);
  8255. operand.mode := ModeReference;
  8256. operand.op := dereferenced;
  8257. operand.tag := dereferenced;
  8258. UseIntermediateOperand(operand.tag);
  8259. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8260. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8261. ReleaseIntermediateOperand(operand.tag);
  8262. operand.tag := TypeDescriptorAdr(type);
  8263. IF ~newObjectFile THEN
  8264. IntermediateCode.MakeMemory(operand.tag,addressType);
  8265. END;
  8266. ELSE
  8267. IF ~backend.cooperative THEN
  8268. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8269. END;
  8270. IntermediateCode.MakeMemory(operand.tag,addressType);
  8271. END;
  8272. NilCheck(operand.op);
  8273. ELSIF type IS SyntaxTree.ArrayType THEN
  8274. IF isUnsafe THEN
  8275. NilCheck(operand.op);
  8276. ReleaseIntermediateOperand(operand.tag);
  8277. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8278. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8279. ELSE
  8280. operand.tag := emptyOperand;
  8281. END;
  8282. ELSE
  8283. NilCheck(operand.op);
  8284. IF backend.cooperative THEN
  8285. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8286. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8287. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8288. ELSE
  8289. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8290. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8291. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8292. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8293. END;
  8294. END;
  8295. ELSIF type IS SyntaxTree.MathArrayType THEN
  8296. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8297. IntermediateCode.MakeMemory(operand.op,addressType);
  8298. ELSE HALT(100);
  8299. END;
  8300. END Dereference;
  8301. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8302. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8303. BEGIN
  8304. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8305. dest := destination; destination := emptyOperand;
  8306. Evaluate(x.left,d);
  8307. type := x.type.resolved;
  8308. prevIsUnchecked := isUnchecked;
  8309. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8310. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8311. END;
  8312. Dereference(d,type,IsUnsafePointer(x.left.type));
  8313. isUnchecked := prevIsUnchecked;
  8314. result := d;
  8315. 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
  8316. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8317. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8318. END;
  8319. END;
  8320. destination := dest;
  8321. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8322. END VisitDereferenceDesignator;
  8323. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8324. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8325. BEGIN
  8326. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8327. dest := destination; destination := emptyOperand;
  8328. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8329. tag := result.op;
  8330. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8331. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8332. StaticCallOperand(result,procedure.super);
  8333. ReleaseIntermediateOperand(result.tag);
  8334. UseIntermediateOperand(tag); (* necessary ? *)
  8335. result.tag := tag;
  8336. destination := dest;
  8337. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8338. END VisitSupercallDesignator;
  8339. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8340. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8341. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8342. name: Basic.SegmentedName;
  8343. procedure: SyntaxTree.Procedure;
  8344. procedureType: SyntaxTree.ProcedureType;
  8345. BEGIN
  8346. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8347. dest := destination; destination := emptyOperand;
  8348. scope := currentScope;
  8349. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8350. scope := scope.outerScope;
  8351. END;
  8352. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8353. IF newObjectFile THEN
  8354. moduleSection := meta.ModuleSection();
  8355. IF backend.cooperative THEN
  8356. moduleOffset := 0;
  8357. ELSE
  8358. moduleOffset := moduleSection.pc;
  8359. END;
  8360. result.mode := ModeValue;
  8361. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8362. ELSE
  8363. Symbol(moduleSelf,result);
  8364. IntermediateCode.MakeMemory(result.op,addressType);
  8365. END
  8366. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8367. result.mode := ModeValue;
  8368. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8369. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8370. ELSE
  8371. GetBaseRegister(basereg,currentScope,scope);
  8372. InitOperand(result,ModeReference);
  8373. result.op := basereg;
  8374. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8375. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8376. parametersSize := ProcedureParametersSize(system,procedure);
  8377. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8378. IF backend.cooperative THEN
  8379. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8380. END;
  8381. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8382. MakeMemory(result.op, result.op, addressType, 0);
  8383. END;
  8384. (* tag must be loaded when dereferencing SELF pointer *)
  8385. END;
  8386. destination := dest;
  8387. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8388. END VisitSelfDesignator;
  8389. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8390. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8391. BEGIN
  8392. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8393. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8394. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8395. parameter := procedureType.returnParameter;
  8396. IF currentIsInline THEN
  8397. map := currentMapper.Get(NIL);
  8398. IF map # NIL THEN
  8399. Designate(map.to, result);
  8400. ELSE
  8401. HALT(200);
  8402. END;
  8403. RETURN;
  8404. END;
  8405. VisitParameter(parameter);
  8406. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8407. END VisitResultDesignator;
  8408. (** values *)
  8409. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8410. BEGIN
  8411. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8412. IF conditional THEN
  8413. IF x.value THEN BrL(trueLabel)
  8414. ELSE BrL(falseLabel)
  8415. END;
  8416. ELSE
  8417. InitOperand(result,ModeValue);
  8418. IF x.value THEN result.op := true ELSE result.op := false END;
  8419. END;
  8420. END VisitBooleanValue;
  8421. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8422. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8423. BEGIN
  8424. Global.GetModuleSegmentedName(module.module, name);
  8425. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8426. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8427. RETURN section
  8428. END GetDataSection;
  8429. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8430. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8431. BEGIN
  8432. type := vop.type;
  8433. data := GetDataSection();
  8434. pc := EnterImmediate(data,vop);
  8435. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8436. IntermediateCode.MakeMemory(vop, type);
  8437. END GetImmediateMem;
  8438. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8439. BEGIN
  8440. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8441. InitOperand(result,ModeValue);
  8442. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8443. IF ~supportedImmediate(result.op) &~inData THEN
  8444. GetImmediateMem(result.op)
  8445. END;
  8446. END VisitIntegerValue;
  8447. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8448. BEGIN
  8449. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8450. InitOperand(result,ModeValue);
  8451. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8452. END VisitCharacterValue;
  8453. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8454. BEGIN
  8455. IF Trace THEN TraceEnter("VisitSetValue") END;
  8456. InitOperand(result,ModeValue);
  8457. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8458. END VisitSetValue;
  8459. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8460. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8461. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8462. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8463. BEGIN
  8464. numberElements := x.elements.Length();
  8465. FOR i := 0 TO numberElements-1 DO
  8466. expression := x.elements.GetExpression(i);
  8467. IF expression IS SyntaxTree.MathArrayExpression THEN
  8468. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8469. ELSE
  8470. inData := TRUE;
  8471. Evaluate(expression,op);
  8472. irv.Emit(Data(position,op.op));
  8473. inData := FALSE;
  8474. ReleaseOperand(op);
  8475. END;
  8476. END;
  8477. END RecursiveData;
  8478. BEGIN
  8479. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8480. IF ~TryConstantDeclaration() THEN
  8481. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8482. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8483. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8484. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8485. ELSE
  8486. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8487. END;
  8488. RecursiveData(x.array);
  8489. InitOperand(result,ModeReference);
  8490. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8491. END
  8492. END VisitMathArrayValue;
  8493. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8494. VAR constant: Sections.Section;
  8495. BEGIN
  8496. IF constantDeclaration = NIL THEN
  8497. RETURN FALSE
  8498. ELSE
  8499. (* Is a constant in this module: did we generate it already? *)
  8500. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8501. IF constant # NIL THEN
  8502. InitOperand(result,ModeReference);
  8503. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8504. RETURN TRUE;
  8505. END;
  8506. END;
  8507. RETURN FALSE
  8508. END TryConstantDeclaration;
  8509. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8510. BEGIN
  8511. constantDeclaration := x;
  8512. x.value.resolved.Accept(SELF);
  8513. END VisitConstant;
  8514. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8515. BEGIN
  8516. IF Trace THEN TraceEnter("VisitRealValue") END;
  8517. InitOperand(result,ModeValue);
  8518. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8519. END VisitRealValue;
  8520. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8521. VAR
  8522. componentType: SyntaxTree.Type;
  8523. BEGIN
  8524. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8525. ASSERT(x.type IS SyntaxTree.ComplexType);
  8526. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8527. InitOperand(result,ModeValue);
  8528. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8529. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8530. END VisitComplexValue;
  8531. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8532. VAR i: LONGINT; name: Basic.SegmentedName;
  8533. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8534. BEGIN
  8535. IF Trace THEN TraceEnter("VisitStringValue") END;
  8536. IF ~TryConstantDeclaration() THEN
  8537. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8538. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8539. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8540. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8541. ELSE
  8542. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8543. END;
  8544. FOR i := 0 TO x.length-1 DO
  8545. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8546. irv.Emit(Data(position,op));
  8547. END;
  8548. InitOperand(result,ModeReference);
  8549. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8550. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8551. END
  8552. END VisitStringValue;
  8553. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8554. BEGIN
  8555. IF Trace THEN TraceEnter("VisitNilValue") END;
  8556. InitOperand(result,ModeValue);
  8557. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8558. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8559. END VisitNilValue;
  8560. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8561. BEGIN
  8562. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8563. InitOperand(result,ModeValue);
  8564. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8565. END VisitEnumerationValue;
  8566. (** symbols *)
  8567. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8568. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8569. END VisitImport;
  8570. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8571. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8572. BEGIN
  8573. IF scope # baseScope THEN
  8574. (* left := [fp+8] *)
  8575. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8576. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8577. ReuseCopy(left,right);
  8578. ReleaseIntermediateOperand(right);
  8579. scope := scope.outerScope; DEC(level);
  8580. (* { left := [left+8] } *)
  8581. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8582. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8583. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8584. Emit(Mov(position,left,right));
  8585. scope := scope.outerScope; DEC(level);
  8586. END;
  8587. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8588. result := left;
  8589. ELSE
  8590. result := fp;
  8591. END;
  8592. END GetBaseRegister;
  8593. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8594. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8595. BEGIN
  8596. IF Trace THEN TraceEnter("VisitVariable"); END;
  8597. type := x.type.resolved;
  8598. IF (x.useRegister) THEN
  8599. InitOperand(result, ModeValue);
  8600. IF x.registerNumber < 0 THEN
  8601. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8602. reg := x.registerNumber;
  8603. ELSE
  8604. reg := registerUsageCount.Map(x.registerNumber);
  8605. UseRegister(reg);
  8606. END;
  8607. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8608. ELSIF x.externalName # NIL THEN
  8609. InitOperand(result,ModeReference);
  8610. Basic.ToSegmentedName(x.externalName^, name);
  8611. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8612. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8613. InitOperand(result,ModeReference);
  8614. GetBaseRegister(result.op,currentScope,x.scope);
  8615. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8616. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8617. InitOperand(result,ModeReference);
  8618. GetCodeSectionNameForSymbol(x,name);
  8619. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8620. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8621. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8622. InitOperand(result,ModeReference);
  8623. GetCodeSectionNameForSymbol(x,name);
  8624. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8625. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8626. ELSE (* field, left designator must have been emitted *)
  8627. ASSERT(result.mode = ModeReference);
  8628. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8629. ReuseCopy(temp,result.op);
  8630. ReleaseIntermediateOperand(result.op);
  8631. result.op := temp;
  8632. END;
  8633. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8634. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8635. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8636. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8637. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8638. END;
  8639. END;
  8640. END;
  8641. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8642. ValueToCondition(result);
  8643. ELSIF type IS SyntaxTree.ProcedureType THEN
  8644. ReleaseIntermediateOperand(result.tag);
  8645. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8646. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8647. UseIntermediateOperand(result.tag);
  8648. ELSE
  8649. result.tag := nil; (* nil *)
  8650. END;
  8651. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8652. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8653. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8654. ReleaseIntermediateOperand(result.tag);
  8655. Global.GetSymbolSegmentedName(x,name);
  8656. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8657. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8658. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8659. ELSE
  8660. END;
  8661. ELSE
  8662. ReleaseIntermediateOperand(result.tag);
  8663. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8664. END;
  8665. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8666. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8667. ReleaseIntermediateOperand(result.tag);
  8668. result.tag := result.op;
  8669. UseIntermediateOperand(result.tag);
  8670. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8671. IntermediateCode.MakeMemory(result.op,addressType);
  8672. END;
  8673. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8674. ReleaseIntermediateOperand(result.tag);
  8675. result.tag := TypeDescriptorAdr(type);
  8676. IF ~newObjectFile THEN
  8677. IntermediateCode.MakeMemory(result.tag,addressType);
  8678. END;
  8679. UseIntermediateOperand(result.tag);
  8680. (* tag for pointer type computed not here but during dereferencing *)
  8681. END;
  8682. IF Trace THEN TraceExit("VisitVariable") END;
  8683. END VisitVariable;
  8684. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8685. BEGIN
  8686. VisitVariable(property);
  8687. END VisitProperty;
  8688. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8689. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8690. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8691. BEGIN
  8692. type := x.type.resolved;
  8693. IF Trace THEN TraceEnter("VisitParameter") END;
  8694. IF x.ownerType IS SyntaxTree.CellType THEN
  8695. ptype := x.type.resolved;
  8696. IF backend.cellsAreObjects THEN
  8697. ASSERT(result.mode = ModeReference);
  8698. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8699. ReuseCopy(temp,result.op);
  8700. ReleaseIntermediateOperand(result.op);
  8701. result.op := temp;
  8702. END;
  8703. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8704. RETURN;
  8705. ELSE
  8706. InitOperand(result,ModeReference);
  8707. GetCodeSectionNameForSymbol(x,name);
  8708. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8709. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8710. RETURN;
  8711. END;
  8712. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8713. InitOperand(result,ModeReference);
  8714. GetCodeSectionNameForSymbol(x,name);
  8715. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8716. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8717. RETURN
  8718. ELSE
  8719. GetBaseRegister(basereg,currentScope,x.scope);
  8720. InitOperand(result,ModeReference);
  8721. result.op := basereg;
  8722. END;
  8723. IF IsOpenArray(type) THEN
  8724. result.tag := basereg;
  8725. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8726. IntermediateCode.MakeMemory(result.op,addressType);
  8727. IF Global.IsOberonProcedure(x.ownerType) THEN
  8728. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8729. UseIntermediateOperand(result.tag);
  8730. ELSE
  8731. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8732. END;
  8733. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8734. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8735. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8736. ELSIF IsStaticArray(type) THEN
  8737. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8738. IntermediateCode.MakeMemory(result.op,addressType);
  8739. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8740. ELSIF type IS SyntaxTree.MathArrayType THEN
  8741. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8742. WITH type: SyntaxTree.MathArrayType DO
  8743. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8744. IF type.form = SyntaxTree.Tensor THEN
  8745. ELSIF type.form = SyntaxTree.Open THEN
  8746. result.tag := result.op;
  8747. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8748. IntermediateCode.MakeMemory(result.op,addressType);
  8749. UseIntermediateOperand(result.tag);
  8750. ELSIF type.form = SyntaxTree.Static THEN
  8751. IF x.kind = SyntaxTree.ConstParameter THEN
  8752. IntermediateCode.MakeMemory(result.op,addressType);
  8753. END;
  8754. ELSE HALT(100)
  8755. END;
  8756. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8757. IF type.form = SyntaxTree.Tensor THEN
  8758. ToMemory(result.op,addressType,0);
  8759. ELSIF type.form = SyntaxTree.Open THEN
  8760. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8761. ReuseCopy(result.tag, mem);
  8762. ReleaseIntermediateOperand(mem);
  8763. ReleaseIntermediateOperand(result.op);
  8764. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8765. ELSIF type.form = SyntaxTree.Static THEN
  8766. IntermediateCode.MakeMemory(result.op,addressType);
  8767. ELSE HALT(100)
  8768. END;
  8769. ELSE HALT(100)
  8770. END;
  8771. END;
  8772. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8773. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8774. IntermediateCode.MakeMemory(result.op,addressType);
  8775. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8776. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8777. END;
  8778. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8779. ValueToCondition(result);
  8780. ELSIF type IS SyntaxTree.ProcedureType THEN
  8781. ReleaseIntermediateOperand(result.tag);
  8782. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8783. IF x.kind = SyntaxTree.VarParameter THEN
  8784. ReuseCopy(result.tag,result.op);
  8785. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8786. IntermediateCode.MakeMemory(result.tag,addressType);
  8787. ELSE
  8788. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8789. UseIntermediateOperand(result.tag);
  8790. END;
  8791. ELSE
  8792. result.tag := nil;
  8793. END;
  8794. (* tag for pointer type computed not here but during dereferencing *)
  8795. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8796. ReleaseIntermediateOperand(result.tag);
  8797. result.tag := basereg;
  8798. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8799. IntermediateCode.MakeMemory(result.tag,addressType);
  8800. UseIntermediateOperand(result.tag);
  8801. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8802. ReleaseIntermediateOperand(result.tag);
  8803. result.tag := TypeDescriptorAdr(type);
  8804. IF ~newObjectFile THEN
  8805. IntermediateCode.MakeMemory(result.tag,addressType);
  8806. END;
  8807. UseIntermediateOperand(result.tag);
  8808. END;
  8809. IF Trace THEN TraceExit("VisitParameter") END;
  8810. END VisitParameter;
  8811. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8812. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8813. BEGIN
  8814. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8815. (* left.p: left already emitted *)
  8816. tag := result.op; (* value of pointer to left *)
  8817. (* get type desc *)
  8818. tmp := result.tag;
  8819. IntermediateCode.MakeMemory(tmp,addressType);
  8820. (* get method adr *)
  8821. Reuse1(reg,tmp);
  8822. ReleaseIntermediateOperand(tmp);
  8823. IF backend.cooperative THEN
  8824. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8825. WHILE recordType.baseType # NIL DO
  8826. recordType := recordType.GetBaseRecord ();
  8827. END;
  8828. GetRecordTypeName (recordType,name);
  8829. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8830. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8831. offset := 0;
  8832. ELSE
  8833. offset := 2;
  8834. END;
  8835. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8836. ELSE
  8837. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8838. END;
  8839. InitOperand(operand,ModeReference);
  8840. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8841. operand.op := reg;
  8842. operand.tag := tag;
  8843. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8844. END DynamicCallOperand;
  8845. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8846. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8847. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8848. BEGIN
  8849. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8850. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8851. tag := operand.op;
  8852. ReleaseIntermediateOperand(operand.tag);
  8853. ELSE tag := nil
  8854. END;
  8855. IF x.isInline THEN
  8856. sectionType := Sections.InlineCodeSection;
  8857. ELSE
  8858. sectionType := Sections.CodeSection;
  8859. END;
  8860. IF x.externalName # NIL THEN
  8861. Basic.ToSegmentedName(x.externalName^, name);
  8862. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8863. ELSE
  8864. GetCodeSectionNameForSymbol(x, name);
  8865. IF (x.scope.ownerModule = module.module) THEN
  8866. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8867. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8868. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8869. IF source.pc = 0 THEN (* no code yet *)
  8870. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8871. END;
  8872. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8873. bits := x.procedureScope.body.code.inlineCode;
  8874. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8875. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8876. binary.CopyBits(bits, 0, bits.GetSize());
  8877. source.SetResolved(binary);
  8878. ELSE
  8879. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8880. END;
  8881. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8882. END;
  8883. InitOperand(operand,ModeValue);
  8884. operand.op := reg;
  8885. operand.tag := tag;
  8886. IF Trace THEN TraceExit("StaticCallOperand") END;
  8887. END StaticCallOperand;
  8888. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8889. (* handle expressions of the form designator.procedure or procedure *)
  8890. BEGIN
  8891. IF Trace THEN TraceEnter("VisitProcedure") END;
  8892. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8893. DynamicCallOperand(result,x);
  8894. ELSIF x.isInline THEN
  8895. StaticCallOperand(result,x);
  8896. ELSE
  8897. StaticCallOperand(result,x);
  8898. END;
  8899. IF Trace THEN TraceExit("VisitProcedure") END;
  8900. END VisitProcedure;
  8901. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8902. BEGIN
  8903. VisitProcedure(x);
  8904. END VisitOperator;
  8905. (** statements *)
  8906. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8907. BEGIN
  8908. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8909. Expression(x.call);
  8910. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8911. ReleaseOperand(result)
  8912. END;
  8913. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8914. END VisitProcedureCallStatement;
  8915. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8916. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8917. leftBase, rightBase: SyntaxTree.Type;
  8918. procedureName,s: SyntaxTree.IdentifierString;
  8919. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8920. size: LONGINT; rightKind: LONGINT;
  8921. dummy: IntermediateCode.Operand;
  8922. CONST moduleName = "FoxArrayBase";
  8923. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8924. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8925. BEGIN
  8926. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8927. IF base IS SyntaxTree.MathArrayType THEN
  8928. base := OpenArray(base(SyntaxTree.MathArrayType));
  8929. END;
  8930. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8931. result.SetArrayBase(base);
  8932. RETURN result
  8933. END OpenArray;
  8934. BEGIN
  8935. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8936. SaveRegisters();ReleaseUsedRegisters(saved);
  8937. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8938. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8939. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8940. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8941. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8942. IF leftType.form = SyntaxTree.Tensor THEN
  8943. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8944. ELSIF leftType.form = SyntaxTree.Open THEN
  8945. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8946. ELSIF leftType.form = SyntaxTree.Static THEN
  8947. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8948. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8949. END;
  8950. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8951. IF procedure = NIL THEN
  8952. s := "Instruction not supported on target, emulation procedure ";
  8953. Strings.Append(s,moduleName);
  8954. Strings.Append(s,".");
  8955. Strings.Append(s,procedureName);
  8956. Strings.Append(s," not present");
  8957. Error(position,s);
  8958. ELSE
  8959. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8960. parameter.SetType(leftType);
  8961. parameter.SetAccess(SyntaxTree.Internal);
  8962. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8963. parameter.SetKind(rightKind);
  8964. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8965. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8966. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8967. StaticCallOperand(result,procedure);
  8968. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8969. ReleaseOperand(result);
  8970. END;
  8971. RestoreRegisters(saved);
  8972. END;
  8973. END AssignMathArray;
  8974. VAR modifyAssignmentCounter := 0: LONGINT;
  8975. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8976. VAR processor,mem,dst: IntermediateCode.Operand;
  8977. BEGIN
  8978. IF value.intValue = true.intValue THEN
  8979. INC(modifyAssignmentCounter);
  8980. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8981. modifyAssignmentsPC := section.pc;
  8982. ELSE
  8983. DEC(modifyAssignmentCounter);
  8984. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8985. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8986. END;
  8987. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8988. dst := NewRegisterOperand (addressType);
  8989. Emit(Mov(position,dst, processor));
  8990. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8991. Emit(Mov(position,mem, value));
  8992. ReleaseIntermediateOperand(dst);
  8993. END ModifyAssignments;
  8994. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  8995. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  8996. BEGIN
  8997. type := left.type.resolved;
  8998. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8999. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9000. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9001. IF procedureType.returnParameter = parameter THEN
  9002. (* this is the only case where the destination can be dynamically smaller than the source
  9003. in all other cases the dynamic size has to be taken
  9004. *)
  9005. MakeMemory(mem, tag, addressType, 0);
  9006. RETURN mem;
  9007. END;
  9008. END;
  9009. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9010. END CopySize;
  9011. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9012. VAR
  9013. leftO, rightO: Operand;
  9014. arg,mem, sizeOp: IntermediateCode.Operand;
  9015. leftType, rightType, componentType, base: SyntaxTree.Type;
  9016. size: LONGINT;
  9017. parameters: SyntaxTree.ExpressionList;
  9018. procedure: SyntaxTree.Procedure;
  9019. call: SyntaxTree.ProcedureCallDesignator;
  9020. designator: SyntaxTree.Designator;
  9021. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9022. VAR procedureType: SyntaxTree.ProcedureType;
  9023. BEGIN
  9024. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9025. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9026. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9027. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9028. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9029. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9030. IF right.id = Global.Reshape THEN RETURN TRUE
  9031. END;
  9032. END;
  9033. END;
  9034. END;
  9035. RETURN FALSE
  9036. END CanPassAsResultParameter;
  9037. BEGIN
  9038. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9039. leftType := left.type.resolved; rightType:= right.type.resolved;
  9040. IF backend.cooperative & left.NeedsTrace() THEN
  9041. ModifyAssignments(true);
  9042. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9043. Designate(right, rightO);
  9044. Designate(left, leftO);
  9045. ASSERT(leftO.mode = ModeReference);
  9046. TransferToRegister(leftO.op, leftO.op);
  9047. TransferToRegister(rightO.op, rightO.op);
  9048. Emit(Push(position, leftO.op));
  9049. Emit(Push(position, rightO.op));
  9050. CallAssignMethod(leftO.op, rightO.op, left.type);
  9051. Emit(Pop(position, rightO.op));
  9052. Emit(Pop(position, leftO.op));
  9053. sizeOp := CopySize(left, leftO.tag);
  9054. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9055. ReleaseIntermediateOperand(sizeOp);
  9056. ReleaseOperand(leftO);
  9057. ReleaseOperand(rightO);
  9058. ELSE
  9059. Evaluate(right,rightO);
  9060. Designate(left,leftO);
  9061. ASSERT(leftO.mode = ModeReference);
  9062. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9063. (* copy procedure address first *)
  9064. MakeMemory(mem,leftO.op,addressType,0);
  9065. Emit(Mov(position,mem,rightO.op));
  9066. ReleaseIntermediateOperand(mem);
  9067. (* copy pointer address *)
  9068. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9069. CallAssignPointer(leftO.tag, rightO.tag);
  9070. ELSE
  9071. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9072. CallAssignPointer(leftO.op, rightO.op);
  9073. END;
  9074. ReleaseOperand(leftO);
  9075. ReleaseOperand(rightO);
  9076. END;
  9077. ModifyAssignments(false);
  9078. RETURN;
  9079. ELSIF backend.writeBarriers & left.NeedsTrace() THEN
  9080. IF SemanticChecker.IsPointerType(leftType) THEN
  9081. Evaluate(right,rightO);
  9082. Designate(left,leftO);
  9083. Emit(Push(position,leftO.op));
  9084. ReleaseOperand(leftO);
  9085. Emit(Push(position,rightO.op));
  9086. ReleaseOperand(rightO);
  9087. CallThis(position,"Heaps","Assign",2);
  9088. ELSIF leftType.IsRecordType() THEN
  9089. Designate(right,rightO);
  9090. Designate(left,leftO);
  9091. Emit(Push(position,leftO.op));
  9092. Emit(Push(position,leftO.tag)); (* type desc *)
  9093. ReleaseOperand(leftO);
  9094. Emit(Push(position,rightO.op));
  9095. ReleaseOperand(rightO);
  9096. CallThis(position,"Heaps","AssignRecord",3);
  9097. ELSIF IsStaticArray(leftType) THEN
  9098. size := StaticArrayNumElements(leftType);
  9099. base := StaticArrayBaseType(leftType);
  9100. Designate(right,rightO);
  9101. Designate(left,leftO);
  9102. Emit(Push(position,leftO.op));
  9103. ReleaseOperand(leftO);
  9104. arg := TypeDescriptorAdr(base);
  9105. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9106. Emit(Push(position,arg));
  9107. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9108. Emit(Push(position,rightO.op));
  9109. ReleaseOperand(rightO);
  9110. CallThis(position,"Heaps","AssignArray",4);
  9111. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9112. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9113. Evaluate(right,rightO);
  9114. Designate(left,leftO);
  9115. MakeMemory(mem,leftO.op,addressType,0);
  9116. Emit(Mov(position,mem,rightO.op));
  9117. ReleaseIntermediateOperand(mem);
  9118. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9119. Emit (Push(position, leftO.tag));
  9120. ReleaseOperand(leftO);
  9121. Emit (Push(position, rightO.tag));
  9122. ReleaseOperand(rightO);
  9123. CallThis(position,"Heaps","Assign", 2);
  9124. ELSE HALT(100); (* missing ? *)
  9125. END;
  9126. RETURN;
  9127. END;
  9128. IF CanPassAsResultParameter(right) THEN
  9129. procedureResultDesignator := left(SyntaxTree.Designator);
  9130. Expression(right);
  9131. procedureResultDesignator := NIL;
  9132. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9133. (* left <-- ALIAS OF right: zerocopy *)
  9134. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9135. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9136. designator.SetType(procedure.type);
  9137. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9138. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9139. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9140. END;
  9141. ELSIF leftType IS SyntaxTree.RangeType THEN
  9142. (* LHS is of array range type *)
  9143. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9144. Evaluate(right, rightO);
  9145. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9146. (* first *)
  9147. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9148. Emit(Mov(position,mem, rightO.op));
  9149. ReleaseIntermediateOperand(mem);
  9150. (* last *)
  9151. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9152. Emit(Mov(position,mem, rightO.tag));
  9153. ReleaseIntermediateOperand(mem);
  9154. (* step *)
  9155. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9156. Emit(Mov(position,mem, rightO.extra));
  9157. ReleaseIntermediateOperand(mem);
  9158. ReleaseOperand(rightO);
  9159. ReleaseOperand(leftO)
  9160. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9161. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9162. Evaluate(right, rightO);
  9163. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9164. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9165. (* real part *)
  9166. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9167. Emit(Mov(position,mem, rightO.op));
  9168. ReleaseIntermediateOperand(mem);
  9169. (* imaginary part *)
  9170. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9171. Emit(Mov(position,mem, rightO.tag));
  9172. ReleaseIntermediateOperand(mem);
  9173. ReleaseOperand(rightO);
  9174. ReleaseOperand(leftO)
  9175. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9176. OR (leftType IS SyntaxTree.PortType) THEN
  9177. (* rightO := leftO;*)
  9178. Evaluate(right,rightO);
  9179. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9180. Designate(left,leftO);
  9181. IF leftO.mode = ModeReference THEN
  9182. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9183. destination := mem;
  9184. ELSE
  9185. destination := leftO.op;
  9186. END;
  9187. ReleaseOperand(leftO);
  9188. IF destination.mode # IntermediateCode.Undefined THEN
  9189. Emit(Mov(position,destination,rightO.op));
  9190. END;
  9191. ReleaseOperand(rightO);
  9192. ReleaseIntermediateOperand(mem);
  9193. IntermediateCode.InitOperand(destination);
  9194. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9195. Evaluate(right,rightO);
  9196. Designate(left,leftO);
  9197. MakeMemory(mem,leftO.op,addressType,0);
  9198. Emit(Mov(position,mem,rightO.op));
  9199. ReleaseIntermediateOperand(mem);
  9200. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9201. (* delegate *)
  9202. (*
  9203. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9204. *)
  9205. Emit(Mov(position,leftO.tag,rightO.tag));
  9206. END;
  9207. ReleaseOperand(leftO);
  9208. ReleaseOperand(rightO);
  9209. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9210. Designate(right,rightO);
  9211. Designate(left,leftO);
  9212. sizeOp := CopySize(left, leftO.tag);
  9213. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9214. ReleaseIntermediateOperand(sizeOp);
  9215. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9216. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9217. IF (rightType IS SyntaxTree.StringType) THEN
  9218. CopyString(left,right);
  9219. 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
  9220. Designate(right,rightO);
  9221. Designate(left,leftO);
  9222. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9223. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9224. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9225. ELSE
  9226. HALT(201)
  9227. END;
  9228. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9229. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9230. Designate(right,rightO);
  9231. Designate(left,leftO);
  9232. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9233. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9234. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9235. ELSE
  9236. AssignMathArray(left,right);
  9237. END;
  9238. ELSE
  9239. HALT(200);
  9240. END;
  9241. END Assign;
  9242. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9243. BEGIN
  9244. IF Trace THEN TraceEnter("VisitAssignment") END;
  9245. Assign(x.left,x.right);
  9246. IF Trace THEN TraceExit("VisitAssignment") END;
  9247. END VisitAssignment;
  9248. PROCEDURE EmitCooperativeSwitch;
  9249. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9250. BEGIN
  9251. ASSERT (cooperativeSwitches);
  9252. pc := section.pc;
  9253. IF lastSwitchPC = section.pc THEN RETURN END;
  9254. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9255. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9256. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9257. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9258. INC(statCoopSwitch, section.pc - pc);
  9259. END EmitCooperativeSwitch;
  9260. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9261. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9262. BEGIN
  9263. p0 := communication.left; p1 := communication.right;
  9264. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9265. Evaluate(p0,s0);
  9266. Evaluate(p1,s1);
  9267. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9268. Emit(Push(position,s0.op));
  9269. Emit(Push(position,s1.op));
  9270. (*
  9271. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9272. *)
  9273. IF ~backend.cellsAreObjects THEN
  9274. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9275. END;
  9276. ReleaseOperand(s0);
  9277. ReleaseOperand(s1);
  9278. IF backend.cellsAreObjects THEN
  9279. CallThis(position,"ActiveCellsRuntime","Send",2);
  9280. ELSE
  9281. CallThis(position,ChannelModuleName,"Send",2);
  9282. END;
  9283. (* ----- RECEIVE ------*)
  9284. ELSE
  9285. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9286. tmp := p0; p0 := p1; p1 := tmp;
  9287. END;
  9288. Evaluate(p0,s0);
  9289. Emit(Push(position,s0.op));
  9290. Designate(p1,s1);
  9291. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9292. Emit(Push(position,s1.op));
  9293. (*
  9294. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9295. *)
  9296. IF ~backend.cellsAreObjects THEN
  9297. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9298. END;
  9299. ReleaseOperand(s0);
  9300. ReleaseOperand(s1);
  9301. IF backend.cellsAreObjects THEN
  9302. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9303. ELSE
  9304. CallThis(position,ChannelModuleName,"Receive",2)
  9305. END;
  9306. END;
  9307. END VisitCommunicationStatement;
  9308. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9309. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9310. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9311. VAR true, false: Label; condition, value: BOOLEAN;
  9312. BEGIN
  9313. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9314. IF condition THEN
  9315. true := NewLabel();
  9316. false := NewLabel();
  9317. Condition(if.condition,true,false);
  9318. SetLabel(true);
  9319. StatementSequence(if.statements);
  9320. BrL(end);
  9321. SetLabel(false);
  9322. ELSE
  9323. IF value THEN (* always true *)
  9324. escape := TRUE;
  9325. StatementSequence(if.statements);
  9326. (* no branch necessary -- rest skipped *)
  9327. END;
  9328. END;
  9329. END IfPart;
  9330. BEGIN
  9331. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9332. end := NewLabel();
  9333. elsifs := x.ElsifParts();
  9334. IfPart(x.ifPart);
  9335. FOR i := 0 TO elsifs-1 DO
  9336. IF ~escape THEN
  9337. elsif := x.GetElsifPart(i);
  9338. IfPart(elsif);
  9339. END;
  9340. END;
  9341. IF (x.elsePart # NIL) & ~escape THEN
  9342. StatementSequence(x.elsePart);
  9343. END;
  9344. SetLabel(end);
  9345. IF Trace THEN TraceExit("VisitIfStatement") END;
  9346. END VisitIfStatement;
  9347. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9348. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9349. BEGIN
  9350. (*IF x.variable.type.resolved = x.type.resolved THEN
  9351. (* always true, do nothing *)
  9352. ELSE*)
  9353. Designate(x.variable,res);
  9354. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9355. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9356. END;
  9357. trueL := NewLabel();
  9358. TypeTest(res.tag,x.type,trueL,falseL);
  9359. ReleaseOperand(res);
  9360. SetLabel(trueL);
  9361. StatementSequence(x.statements);
  9362. BrL(endL);
  9363. END WithPart;
  9364. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9365. VAR endL,falseL: Label;i: LONGINT;
  9366. BEGIN
  9367. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9368. endL := NewLabel();
  9369. FOR i := 0 TO x.WithParts()-1 DO
  9370. falseL := NewLabel();
  9371. WithPart(x.GetWithPart(i),falseL,endL);
  9372. SetLabel(falseL);
  9373. END;
  9374. IF x.elsePart = NIL THEN
  9375. IF ~isUnchecked THEN
  9376. EmitTrap(position,WithTrap);
  9377. END;
  9378. ELSE
  9379. StatementSequence(x.elsePart)
  9380. END;
  9381. SetLabel(endL);
  9382. IF Trace THEN TraceExit("VisitWithStatement") END;
  9383. END VisitWithStatement;
  9384. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9385. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9386. out,else: Label; label: Label;
  9387. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9388. symbol: SyntaxTree.Symbol;
  9389. BEGIN
  9390. (*! split case statement into if-elsif statements for large case label lists *)
  9391. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9392. size := x.max-x.min+1;
  9393. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9394. END;
  9395. Evaluate(x.variable,var);
  9396. ReuseCopy(tmp,var.op);
  9397. ReleaseIntermediateOperand(var.op);
  9398. var.op := tmp;
  9399. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9400. Convert(var.op,addressType);
  9401. size := x.max-x.min+1;
  9402. else := NewLabel();
  9403. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9404. (*
  9405. UniqueId(name,module.module,"case",caseId);
  9406. *)
  9407. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9408. Global.GetModuleSegmentedName(module.module, name);
  9409. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9410. symbol := SyntaxTree.NewSymbol(name[1]);
  9411. symbol.SetScope(moduleScope);
  9412. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9413. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9414. section.isCaseTable := TRUE;
  9415. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9416. ReuseCopy(res,var.op);
  9417. ReleaseOperand(var);
  9418. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9419. Emit(Add(position,res,res,jmp));
  9420. IntermediateCode.MakeMemory(res,addressType);
  9421. Emit(Br(position,res));
  9422. ReleaseIntermediateOperand(res);
  9423. out := NewLabel();
  9424. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9425. part := x.GetCasePart(i);
  9426. constant := part.firstConstant;
  9427. label := NewLabel();
  9428. SetLabel(label);
  9429. WHILE(constant # NIL) DO (* case labels for this case part *)
  9430. FOR j := constant.min TO constant.max DO
  9431. fixups[j-x.min] := label;
  9432. END;
  9433. constant := constant.next;
  9434. END;
  9435. StatementSequence(part.statements);
  9436. BrL(out);
  9437. END;
  9438. SetLabel(else);
  9439. FOR i := 0 TO size-1 DO
  9440. IF fixups[i] = NIL THEN
  9441. fixups[i] := else;
  9442. END;
  9443. END;
  9444. IF x.elsePart # NIL THEN
  9445. StatementSequence(x.elsePart);
  9446. ELSIF ~isUnchecked THEN
  9447. EmitTrap(position,CaseTrap);
  9448. END;
  9449. SetLabel(out);
  9450. FOR i := 0 TO size-1 DO
  9451. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9452. section.Emit(Data(position,op));
  9453. END;
  9454. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9455. END VisitCaseStatement;
  9456. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9457. VAR start: Label; true,false: Label;
  9458. BEGIN
  9459. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9460. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9461. start := NewLabel();
  9462. true := NewLabel();
  9463. false := NewLabel();
  9464. SetLabel(start);
  9465. Condition(x.condition,true,false);
  9466. SetLabel(true);
  9467. StatementSequence(x.statements);
  9468. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9469. BrL(start);
  9470. SetLabel(false);
  9471. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9472. END VisitWhileStatement;
  9473. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9474. VAR false,true: Label;
  9475. BEGIN
  9476. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9477. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9478. true := NewLabel();
  9479. false := NewLabel();
  9480. SetLabel(false);
  9481. StatementSequence(x.statements);
  9482. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9483. Condition(x.condition,true,false);
  9484. SetLabel(true);
  9485. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9486. END VisitRepeatStatement;
  9487. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9488. VAR
  9489. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9490. temporaryVariable: SyntaxTree.Variable;
  9491. temporaryVariableDesignator : SyntaxTree.Designator;
  9492. BEGIN
  9493. IF Trace THEN TraceEnter("VisitForStatement") END;
  9494. true := NewLabel();
  9495. false := NewLabel();
  9496. start := NewLabel();
  9497. Assign(x.variable,x.from);
  9498. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9499. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9500. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9501. Assign(temporaryVariableDesignator,x.to);
  9502. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9503. IF by > 0 THEN
  9504. cmp := Scanner.LessEqual
  9505. ELSE
  9506. cmp := Scanner.GreaterEqual
  9507. END;
  9508. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9509. binary.SetType(system.booleanType);
  9510. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9511. SetLabel(start);
  9512. Condition(binary,true,false);
  9513. SetLabel(true);
  9514. StatementSequence(x.statements);
  9515. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9516. binary.SetType(x.variable.type);
  9517. Assign(x.variable,binary);
  9518. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9519. BrL(start);
  9520. SetLabel(false);
  9521. IF Trace THEN TraceExit("VisitForStatement") END;
  9522. END VisitForStatement;
  9523. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9524. VAR prevLoop: Label;
  9525. BEGIN
  9526. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9527. prevLoop := currentLoop;
  9528. currentLoop := NewLabel();
  9529. StatementSequence(x.statements);
  9530. SetLabel(currentLoop);
  9531. currentLoop := prevLoop;
  9532. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9533. END VisitExitableBlock;
  9534. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9535. VAR prevLoop,start: Label;
  9536. BEGIN
  9537. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9538. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9539. start := NewLabel();
  9540. prevLoop := currentLoop;
  9541. SetLabel(start);
  9542. currentLoop := NewLabel();
  9543. StatementSequence(x.statements);
  9544. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9545. BrL(start);
  9546. SetLabel(currentLoop);
  9547. currentLoop := prevLoop;
  9548. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9549. END VisitLoopStatement;
  9550. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9551. VAR outer: SyntaxTree.Statement;
  9552. BEGIN
  9553. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9554. IF locked THEN (* r if we jump out of an exclusive block *)
  9555. outer := x.outer;
  9556. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9557. outer := outer.outer;
  9558. END;
  9559. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9560. Lock(FALSE);
  9561. END;
  9562. END;
  9563. BrL(currentLoop);
  9564. IF Trace THEN TraceExit("VisitExitStatement") END;
  9565. END VisitExitStatement;
  9566. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9567. VAR
  9568. expression, parameterDesignator: SyntaxTree.Expression;
  9569. type, componentType: SyntaxTree.Type;
  9570. res, right: Operand;
  9571. left, mem, reg: IntermediateCode.Operand;
  9572. parameter: SyntaxTree.Parameter;
  9573. procedure: SyntaxTree.Procedure;
  9574. procedureType: SyntaxTree.ProcedureType;
  9575. returnTypeOffset: LONGINT;
  9576. delegate: BOOLEAN;
  9577. map: SymbolMap;
  9578. cc, parametersSize: LONGINT;
  9579. BEGIN
  9580. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9581. expression := x.returnValue;
  9582. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9583. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9584. IF currentIsInline THEN
  9585. IF expression # NIL THEN
  9586. map := currentMapper.Get(NIL);
  9587. IF map # NIL THEN
  9588. Assign(map.to, expression);
  9589. ELSE
  9590. Evaluate(expression,res);
  9591. Emit(Return(position,res.op));
  9592. ReleaseOperand(res);
  9593. END;
  9594. END;
  9595. BrL(currentInlineExit);
  9596. RETURN;
  9597. END;
  9598. IF expression # NIL THEN
  9599. type := expression.type.resolved;
  9600. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9601. IF locked THEN Lock(FALSE) END;
  9602. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9603. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9604. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9605. (* return without structured return parameter *)
  9606. Evaluate(expression,res);
  9607. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9608. IF locked OR profile THEN
  9609. Emit(Push(position,res.op));
  9610. IF delegate THEN HALT(200) END;
  9611. ReleaseOperand(res);
  9612. IF locked THEN Lock(FALSE) END;
  9613. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9614. reg := NewRegisterOperand(res.op.type);
  9615. Emit(Pop(position,reg));
  9616. Emit(Return(position,reg));
  9617. ReleaseIntermediateOperand(reg);
  9618. ELSE
  9619. Emit(Return(position,res.op));
  9620. ReleaseOperand(res);
  9621. END;
  9622. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9623. THEN
  9624. (* return using structured return parameter *)
  9625. 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)
  9626. OR SemanticChecker.IsPointerType(type));
  9627. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9628. parameter :=procedureType.returnParameter;
  9629. ASSERT(parameter # NIL);
  9630. returnTypeOffset := parameter.offsetInBits;
  9631. (*
  9632. IF parameter# NIL THEN
  9633. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9634. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9635. ELSE
  9636. returnTypeOffset := system.offsetFirstParameter
  9637. END;
  9638. *)
  9639. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9640. IF type IS SyntaxTree.RangeType THEN
  9641. (* array range type *)
  9642. Evaluate(expression, right);
  9643. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9644. Emit(Mov(position,mem, right.op)); (* first *)
  9645. ReleaseIntermediateOperand(mem);
  9646. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9647. Emit(Mov(position,mem, right.tag)); (* last *)
  9648. ReleaseIntermediateOperand(mem);
  9649. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9650. Emit(Mov(position,mem, right.extra)); (* step *)
  9651. ReleaseIntermediateOperand(mem);
  9652. ReleaseOperand(right);
  9653. ELSIF type IS SyntaxTree.ComplexType THEN
  9654. Evaluate(expression, right);
  9655. componentType := type(SyntaxTree.ComplexType).componentType;
  9656. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9657. Emit(Mov(position,mem, right.op)); (* real part *)
  9658. ReleaseIntermediateOperand(mem);
  9659. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9660. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9661. ReleaseIntermediateOperand(mem);
  9662. ReleaseOperand(right);
  9663. ELSE (* covers cases: pointer / record / array *)
  9664. parameter := procedureType.returnParameter;
  9665. checker.SetCurrentScope(currentScope);
  9666. ASSERT(parameter # NIL);
  9667. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9668. Assign(parameterDesignator,expression);
  9669. END;
  9670. ReleaseIntermediateOperand(left);
  9671. IF locked THEN Lock(FALSE) END;
  9672. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9673. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9674. parameter := procedureType.returnParameter;
  9675. checker.SetCurrentScope(currentScope);
  9676. IF parameter = NIL THEN
  9677. Error(procedure.position, "structured return of parameter of procedure not found");
  9678. ELSE
  9679. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9680. Assign(parameterDesignator,expression);
  9681. END;
  9682. IF locked THEN Lock(FALSE) END;
  9683. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9684. ELSE
  9685. HALT(200);
  9686. END;
  9687. ELSE
  9688. IF locked THEN Lock(FALSE) END;
  9689. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9690. END;
  9691. IF backend.cooperative THEN
  9692. BrL(exitLabel);
  9693. ELSE
  9694. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9695. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9696. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9697. ELSE
  9698. parametersSize := 0;
  9699. END;
  9700. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9701. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9702. END;
  9703. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9704. END VisitReturnStatement;
  9705. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9706. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9707. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9708. statements: SyntaxTree.StatementSequence;
  9709. name, suffix: SyntaxTree.IdentifierString;
  9710. BEGIN
  9711. Strings.IntToStr(awaitProcCounter,suffix);
  9712. Strings.Concat("@AwaitProcedure",suffix,name);
  9713. identifier := SyntaxTree.NewIdentifier(name);
  9714. INC(awaitProcCounter);
  9715. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9716. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9717. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9718. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9719. procedure.SetAccess(SyntaxTree.Hidden);
  9720. procedure.SetScope(currentScope);
  9721. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9722. procedureType.SetReturnType(system.booleanType);
  9723. procedure.SetType(procedureType);
  9724. body := SyntaxTree.NewBody(x.position,procedureScope);
  9725. procedureScope.SetBody(body);
  9726. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9727. returnStatement.SetReturnValue(x.condition);
  9728. statements := SyntaxTree.NewStatementSequence();
  9729. statements.AddStatement(returnStatement);
  9730. body.SetStatementSequence(statements);
  9731. currentScope.AddProcedure(procedure);
  9732. RETURN procedure
  9733. END MakeAwaitProcedure;
  9734. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9735. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9736. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9737. BEGIN
  9738. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9739. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9740. IF backend.cooperative THEN
  9741. start := NewLabel();
  9742. true := NewLabel();
  9743. false := NewLabel();
  9744. SetLabel(start);
  9745. Condition(x.condition,true,false);
  9746. SetLabel(false);
  9747. PushSelfPointer();
  9748. CallThis(position,"ExclusiveBlocks","Await",1);
  9749. BrL(start);
  9750. SetLabel(true);
  9751. PushSelfPointer();
  9752. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9753. ELSE
  9754. proc := MakeAwaitProcedure(x);
  9755. Emit(Push(position,fp));
  9756. GetCodeSectionNameForSymbol(proc,name);
  9757. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9758. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9759. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9760. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9761. Emit(Result(position,res));
  9762. (*
  9763. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9764. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9765. *)
  9766. InitOperand(result,ModeValue);
  9767. result.op := res;
  9768. label := NewLabel();
  9769. BreqL(label, result.op, SELF.true);
  9770. ReleaseOperand(result);
  9771. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9772. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9773. Emit(Push(position,res));
  9774. Emit(Push(position,fp));
  9775. PushSelfPointer();
  9776. Emit(Push(position,nil));
  9777. CallThis(position,"Objects","Await",4);
  9778. SetLabel(label);
  9779. END;
  9780. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9781. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9782. END VisitAwaitStatement;
  9783. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9784. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9785. BEGIN
  9786. FOR i := 0 TO x.Length() - 1 DO
  9787. statement := x.GetStatement( i );
  9788. Statement(statement);
  9789. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9790. END;
  9791. END StatementSequence;
  9792. PROCEDURE PushSelfPointer;
  9793. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9794. procedureType: SyntaxTree.ProcedureType;
  9795. BEGIN
  9796. scope := currentScope;
  9797. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9798. scope := scope.outerScope;
  9799. END;
  9800. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9801. IF ~newObjectFile THEN
  9802. Symbol(moduleSelf,op);
  9803. IntermediateCode.MakeMemory(op.op,addressType);
  9804. ELSE
  9805. moduleSection := meta.ModuleSection();
  9806. IF backend.cooperative THEN
  9807. moduleOffset := 0;
  9808. ELSE
  9809. moduleOffset := moduleSection.pc;
  9810. END;
  9811. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9812. END;
  9813. ELSE
  9814. GetBaseRegister(op.op,currentScope,scope);
  9815. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9816. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9817. parametersSize := ProcedureParametersSize(system,procedure);
  9818. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9819. IF backend.cooperative THEN
  9820. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9821. END;
  9822. IntermediateCode.MakeMemory(op.op,addressType);
  9823. END;
  9824. Emit(Push(position,op.op));
  9825. ReleaseOperand(op);
  9826. END PushSelfPointer;
  9827. PROCEDURE Lock(lock: BOOLEAN);
  9828. BEGIN
  9829. IF Trace THEN TraceEnter("Lock") END;
  9830. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9831. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9832. ASSERT(modifyAssignmentCounter = 0);
  9833. IF dump # NIL THEN
  9834. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9835. dump.Ln;dump.Update;
  9836. END;
  9837. PushSelfPointer;
  9838. IF backend.cooperative THEN
  9839. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9840. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9841. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9842. END;
  9843. ELSE
  9844. Emit(Push(position,true));
  9845. IF lock THEN CallThis(position,"Objects","Lock",2)
  9846. ELSE CallThis(position,"Objects","Unlock",2);
  9847. END;
  9848. END;
  9849. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9850. IF Trace THEN TraceExit("Lock") END;
  9851. END Lock;
  9852. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9853. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9854. BEGIN
  9855. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9856. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9857. previouslyUnchecked := isUnchecked;
  9858. isUnchecked := isUnchecked OR x.isUnchecked;
  9859. previouslyCooperativeSwitches := cooperativeSwitches;
  9860. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9861. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9862. IF x.statements # NIL THEN
  9863. StatementSequence(x.statements);
  9864. END;
  9865. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9866. isUnchecked := previouslyUnchecked;
  9867. cooperativeSwitches := previouslyCooperativeSwitches;
  9868. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9869. END VisitStatementBlock;
  9870. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9871. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9872. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9873. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9874. procedure: SyntaxTree.Procedure;
  9875. map: SymbolMap;
  9876. cc, parametersSize: LONGINT;
  9877. BEGIN
  9878. scope := currentScope;
  9879. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9880. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9881. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9882. return := emptyOperand;
  9883. IF Trace THEN TraceEnter("VisitCode") END;
  9884. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9885. NEW(in, x.inRules.Length());
  9886. FOR i := 0 TO LEN(in)-1 DO
  9887. statement := x.inRules.GetStatement(i);
  9888. WITH statement: SyntaxTree.Assignment DO
  9889. Evaluate(statement.right, operand);
  9890. result := operand.op;
  9891. NEW(str, 64);
  9892. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9893. in[i] := result; IntermediateCode.SetString(in[i], str);
  9894. ReleaseIntermediateOperand(operand.tag);
  9895. END;
  9896. END;
  9897. ELSE in := NIL
  9898. END;
  9899. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9900. NEW(out, x.outRules.Length());
  9901. FOR i := 0 TO LEN(out)-1 DO
  9902. statement := x.outRules.GetStatement(i);
  9903. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9904. WITH statement: SyntaxTree.Assignment DO
  9905. Designate(statement.left, operand);
  9906. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9907. NEW(str, 64);
  9908. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9909. out[i] := result; IntermediateCode.SetString(out[i], str);
  9910. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  9911. |statement: SyntaxTree.ReturnStatement DO
  9912. NEW(str, 64);
  9913. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9914. IF currentIsInline THEN
  9915. map := currentMapper.Get(NIL);
  9916. Designate(map.to, operand);
  9917. IF map.isAddress THEN
  9918. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9919. ELSE
  9920. result := operand.op;
  9921. END;
  9922. (*! only if it does not fit into register
  9923. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9924. *)
  9925. (*Evaluate(map.to, operand);*)
  9926. out[i] := result;
  9927. ELSE
  9928. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9929. END;
  9930. IntermediateCode.SetString(out[i], str);
  9931. ReleaseIntermediateOperand(operand.tag);
  9932. return := out[i];
  9933. ELSE
  9934. END;
  9935. END;
  9936. ELSE out := NIL
  9937. END;
  9938. Emit(Asm(x.position,x.sourceCode, in, out));
  9939. IF in # NIL THEN
  9940. FOR i := 0 TO LEN(in)-1 DO
  9941. ReleaseIntermediateOperand(in[i]);
  9942. END;
  9943. END;
  9944. IF out # NIL THEN
  9945. FOR i := 0 TO LEN(out)-1 DO
  9946. WITH statement: SyntaxTree.Assignment DO
  9947. ReleaseIntermediateOperand(out[i]);
  9948. |statement: SyntaxTree.ReturnStatement DO
  9949. (* release happens below *)
  9950. ELSE
  9951. END;
  9952. statement := x.outRules.GetStatement(i);
  9953. END;
  9954. END;
  9955. IF return.mode # IntermediateCode.Undefined THEN
  9956. IF currentIsInline THEN
  9957. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  9958. Symbol(procedureType.returnParameter, par);
  9959. MakeMemory(mem, par.op, return.type, 0);
  9960. ReleaseOperand(par);
  9961. Emit(Mov(position, mem, return));
  9962. ReleaseIntermediateOperand(mem);
  9963. ELSE
  9964. Emit(Return(position,return));
  9965. END;
  9966. ReleaseIntermediateOperand(return);
  9967. IF currentIsInline THEN RETURN END;
  9968. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9969. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9970. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9971. ELSE
  9972. parametersSize := 0;
  9973. END;
  9974. EmitLeave(section, position,procedure, cc);
  9975. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  9976. END;
  9977. IF Trace THEN TraceExit("VisitCode") END;
  9978. END VisitCode;
  9979. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9980. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9981. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9982. const, call: IntermediateCode.Operand;
  9983. parameterDesignator: SyntaxTree.Expression;
  9984. saved: RegisterEntry;
  9985. name: Basic.SegmentedName;
  9986. BEGIN
  9987. IF Trace THEN TraceEnter("ParameterCopies") END;
  9988. parameter := x.firstParameter;
  9989. WHILE parameter # NIL DO
  9990. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9991. type := parameter.type.resolved;
  9992. IF IsOpenArray(type) THEN
  9993. VisitParameter(parameter);
  9994. op := result;
  9995. IF backend.cooperative & parameter.NeedsTrace() THEN
  9996. length := GetArrayLength(type, op.tag);
  9997. size := NewRegisterOperand(addressType);
  9998. base := ArrayBaseType(type);
  9999. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10000. Emit(Mul(position, size, length, const));
  10001. dst := NewRegisterOperand (addressType);
  10002. Emit(Mov(position, dst, size));
  10003. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10004. Emit(Sub(position,dst,sp,dst));
  10005. Emit(And(position,dst,dst,const));
  10006. Emit(Mov(position,sp,dst));
  10007. par := fp;
  10008. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10009. IntermediateCode.InitImmediate(null, byteType, 0);
  10010. Emit(Fill(position, dst, size, null));
  10011. ReleaseIntermediateOperand(dst);
  10012. ReleaseIntermediateOperand(length);
  10013. SaveRegisters();ReleaseUsedRegisters(saved);
  10014. (* register dst has been freed before SaveRegisters already *)
  10015. base := ArrayBaseType(type);
  10016. (* assign method of open array *)
  10017. IF base.IsRecordType() THEN
  10018. Emit (Push(position, length));
  10019. Emit (Push(position, dst));
  10020. Emit (Push(position, op.op));
  10021. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10022. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10023. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10024. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10025. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10026. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10027. Emit (Push(position,length));
  10028. Emit (Push(position, dst));
  10029. Emit (Push(position, length));
  10030. Emit (Push(position, op.op));
  10031. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10032. ELSE
  10033. Emit (Push(position, length));
  10034. Emit (Push(position, dst));
  10035. Emit (Push(position, length));
  10036. Emit (Push(position, op.op));
  10037. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10038. ASSERT(ArrayBaseType(type).IsPointer());
  10039. END;
  10040. RestoreRegisters(saved);
  10041. ELSE
  10042. temp := GetDynamicSize(type,op.tag);
  10043. ReuseCopy(size,temp);
  10044. ReleaseIntermediateOperand(temp);
  10045. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10046. Emit(Sub(position,size,sp,size));
  10047. Emit(And(position,size,size,const));
  10048. Emit(Mov(position,sp,size));
  10049. par := fp;
  10050. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10051. ReleaseIntermediateOperand(size);
  10052. size := GetDynamicSize(type,op.tag);
  10053. END;
  10054. Emit(Copy(position,sp,op.op,size));
  10055. ReleaseIntermediateOperand(size);
  10056. ReleaseOperand(op);
  10057. IntermediateCode.MakeMemory(par,addressType);
  10058. Emit(Mov(position,par,sp));
  10059. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10060. checker.SetCurrentScope(currentScope);
  10061. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10062. Assign(parameterDesignator,parameterDesignator);
  10063. END;
  10064. END;
  10065. parameter := parameter.nextParameter;
  10066. END;
  10067. IF Trace THEN TraceExit("ParameterCopies") END;
  10068. END ParameterCopies;
  10069. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10070. VAR x: SyntaxTree.Variable;
  10071. BEGIN
  10072. x := scope.firstVariable;
  10073. WHILE x # NIL DO
  10074. InitVariable(x,FALSE);
  10075. x := x.nextVariable;
  10076. END;
  10077. END InitVariables;
  10078. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10079. BEGIN
  10080. IF (symbol # NIL) THEN
  10081. RETURN fingerPrinter.SymbolFP(symbol).public
  10082. ELSE
  10083. RETURN 0
  10084. END;
  10085. END GetFingerprint;
  10086. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10087. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10088. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10089. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10090. name: Basic.SegmentedName;
  10091. offset: LONGINT;
  10092. BEGIN
  10093. IF Trace THEN TraceEnter("Body") END;
  10094. ReleaseUsedRegisters(saved); (* just in case ... *)
  10095. section := ir;
  10096. exitLabel := NewLabel ();
  10097. IF moduleBody THEN moduleBodySection := section END;
  10098. IF ir.comments # NIL THEN
  10099. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10100. commentPrintout.SingleStatement(TRUE);
  10101. dump := ir.comments;
  10102. ELSE
  10103. commentPrintout := NIL;
  10104. dump := NIL;
  10105. END;
  10106. prevScope := currentScope;
  10107. currentScope := scope;
  10108. lastSwitchPC := 0;
  10109. cooperativeSwitches := backend.cooperative;
  10110. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10111. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10112. IF x # NIL THEN
  10113. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10114. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10115. IF moduleBody THEN
  10116. ProfilerInit();
  10117. ELSE
  10118. Basic.SegmentedNameToString(ir.name, string);
  10119. ProfilerAddProcedure(numberProcedures,string);
  10120. ProfilerEnterExit(numberProcedures,TRUE);
  10121. END;
  10122. END;
  10123. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10124. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10125. END;
  10126. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10127. IF moduleBody & ~newObjectFile THEN
  10128. InitVariables(moduleScope)
  10129. END;
  10130. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10131. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10132. IF procedure = cellScope.bodyProcedure THEN
  10133. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10134. StaticCallOperand(op, cellScope.constructor);
  10135. Emit(Call(position,op.op,0));
  10136. END;
  10137. END;
  10138. END;
  10139. InitVariables(scope);
  10140. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10141. GetCodeSectionNameForSymbol(procedure, name);
  10142. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10143. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10144. IF ProtectModulesPointers THEN
  10145. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10146. ELSE
  10147. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10148. END;
  10149. IntermediateCode.SetOffset(right,offset); (* tag *)
  10150. IntermediateCode.InitMemory(left,addressType,fp,0);
  10151. Emit(Mov(position, left, right));
  10152. END;
  10153. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10154. ParameterCopies(procedureType);
  10155. IF x.code = NIL THEN
  10156. VisitStatementBlock(x);
  10157. ELSE
  10158. VisitCode(x.code)
  10159. END;
  10160. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10161. ir.SetFinally(ir.pc);
  10162. StatementSequence(x.finally)
  10163. END;
  10164. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10165. IF ~backend.cooperative THEN
  10166. ProfilerEnterExit(numberProcedures,FALSE);
  10167. END;
  10168. INC(numberProcedures);
  10169. END;
  10170. END;
  10171. IF backend.cooperative THEN
  10172. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10173. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10174. END;
  10175. IF x # NIL THEN
  10176. SELF.position := x.position;
  10177. END;
  10178. CheckRegistersFree();
  10179. ASSERT(modifyAssignmentCounter = 0);
  10180. currentScope := prevScope;
  10181. IF Trace THEN TraceExit("Body") END;
  10182. END Body;
  10183. END ImplementationVisitor;
  10184. MetaDataGenerator=OBJECT
  10185. VAR
  10186. implementationVisitor: ImplementationVisitor;
  10187. declarationVisitor: DeclarationVisitor;
  10188. module: Sections.Module;
  10189. moduleName: ARRAY 128 OF CHAR;
  10190. moduleNamePool: Basic.HashTableInt;
  10191. moduleNamePoolSection: IntermediateCode.Section;
  10192. modulePointerSection: IntermediateCode.Section;
  10193. modulePointerSizePC: LONGINT;
  10194. modulePointerSectionOffset: LONGINT;
  10195. modulePointers: LONGINT;
  10196. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10197. RecordBaseOffset: LONGINT;
  10198. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10199. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10200. TypeTags: LONGINT; (* type extension level support *)
  10201. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10202. patchInfoPC: LONGINT;
  10203. patchCRC: LONGINT;
  10204. CONST
  10205. EmptyBlockOffset = 2;
  10206. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10207. BEGIN
  10208. IF implementationVisitor.backend.cooperative THEN
  10209. TypeTags := MAX(LONGINT);
  10210. BaseTypesTableOffset := 0;
  10211. MethodTableOffset := 2;
  10212. TypeRecordBaseOffset := 0;
  10213. RecordBaseOffset := 0;
  10214. ELSIF simple THEN
  10215. TypeTags := 3; (* only 3 extensions allowed *)
  10216. BaseTypesTableOffset := 1;
  10217. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10218. TypeRecordBaseOffset := 0;
  10219. RecordBaseOffset := 1;
  10220. ELSE
  10221. TypeTags := 16;
  10222. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10223. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10224. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10225. RecordBaseOffset := 8;
  10226. END;
  10227. SELF.simple := simple;
  10228. SELF.implementationVisitor := implementationVisitor;
  10229. SELF.declarationVisitor := declarationVisitor;
  10230. implementationVisitor.meta := SELF;
  10231. declarationVisitor.meta := SELF;
  10232. END InitMetaDataGenerator;
  10233. PROCEDURE SetModule(module: Sections.Module);
  10234. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10235. BEGIN
  10236. SELF.module := module;
  10237. Global.GetModuleName(module.module,moduleName);
  10238. Global.GetSymbolSegmentedName(module.module, name);
  10239. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10240. NEW(moduleNamePool, 32);
  10241. (*! require GC protection *)
  10242. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10243. IF ProtectModulesPointers THEN
  10244. name := "Heaps.AnyPtr";
  10245. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10246. (* set base pointer *)
  10247. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10248. END;
  10249. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10250. modulePointers := 0;
  10251. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10252. AddPointer(moduleNamePoolSection, namePoolOffset);
  10253. END;
  10254. END SetModule;
  10255. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10256. BEGIN
  10257. IF ~implementationVisitor.backend.cooperative THEN
  10258. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10259. INC(modulePointers);
  10260. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10261. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10262. END;
  10263. END AddPointer;
  10264. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10265. BEGIN
  10266. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10267. END GetTypeRecordBaseOffset;
  10268. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10269. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10270. BEGIN
  10271. INC(dataAdrOffset,6);
  10272. Info(section,"headerAdr");
  10273. Address(section,0);
  10274. Info(section,"typeDesc");
  10275. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10276. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10277. NamedSymbol(section, name, symbol, 0, offset);
  10278. Info(section,"mark: LONGINT;");
  10279. Longint(section,-1);
  10280. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  10281. Info(section,"dataAdr-: ADDRESS");
  10282. Symbol(section,section, dataAdrOffset,0);
  10283. Info(section,"size-: SIZE");
  10284. Address(section,0);
  10285. Info(section,"nextRealtime: HeapBlock;");
  10286. Address(section,0);
  10287. END HeapBlock;
  10288. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10289. VAR i: LONGINT;
  10290. BEGIN
  10291. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10292. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10293. Info(section,"count*: LONGINT");
  10294. Longint(section,0);
  10295. Info(section,"locked*: BOOLEAN");
  10296. Longint(section,0);
  10297. Info(section,"awaitingLock*: ProcessQueue");
  10298. Address(section,0);
  10299. Address(section,0);
  10300. Info(section,"awaitingCond*: ProcessQueue");
  10301. Address(section,0);
  10302. Address(section,0);
  10303. Info(section,"lockedBy*: ANY");
  10304. Address(section,0);
  10305. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10306. Longint(section,1);
  10307. FOR i := 2 TO 6 DO
  10308. Longint(section,0);
  10309. END;
  10310. Info(section,"lock*: ANY");
  10311. Address(section,0);
  10312. END ProtectedHeapBlock;
  10313. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10314. BEGIN
  10315. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10316. END Info;
  10317. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10318. VAR op: IntermediateCode.Operand;
  10319. BEGIN
  10320. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10321. section.Emit(Data(Basic.invalidPosition,op));
  10322. END Address;
  10323. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10324. VAR op: IntermediateCode.Operand;
  10325. BEGIN
  10326. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10327. section.Emit(Data(Basic.invalidPosition,op));
  10328. END Size;
  10329. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10330. VAR op: IntermediateCode.Operand;
  10331. BEGIN
  10332. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10333. section.Emit(Data(Basic.invalidPosition,op));
  10334. END Set;
  10335. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10336. VAR op: IntermediateCode.Operand;
  10337. BEGIN
  10338. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10339. section.Emit(Data(Basic.invalidPosition,op));
  10340. END Longint;
  10341. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10342. VAR op,noOperand: IntermediateCode.Operand;
  10343. BEGIN
  10344. IntermediateCode.InitOperand(noOperand);
  10345. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10346. section.PatchOperands(pc,op,noOperand,noOperand);
  10347. END PatchAddress;
  10348. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10349. VAR op,noOperand: IntermediateCode.Operand;
  10350. BEGIN
  10351. IntermediateCode.InitOperand(noOperand);
  10352. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10353. section.PatchOperands(pc,op,noOperand,noOperand);
  10354. END PatchSize;
  10355. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10356. VAR op,noOperand: IntermediateCode.Operand;
  10357. BEGIN
  10358. IntermediateCode.InitOperand(noOperand);
  10359. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10360. section.PatchOperands(pc,op,noOperand,noOperand);
  10361. END PatchLongint;
  10362. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10363. VAR op, noOperand: IntermediateCode.Operand;
  10364. BEGIN
  10365. IntermediateCode.InitOperand(noOperand);
  10366. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10367. section.PatchOperands(pc,op,noOperand,noOperand);
  10368. END PatchSymbol;
  10369. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10370. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10371. BEGIN
  10372. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10373. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10374. section.Emit(Data(Basic.invalidPosition,op));
  10375. END Boolean;
  10376. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10377. VAR op: IntermediateCode.Operand;
  10378. BEGIN
  10379. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10380. section.Emit(Data(Basic.invalidPosition,op));
  10381. END Char;
  10382. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10383. VAR op: IntermediateCode.Operand;
  10384. BEGIN
  10385. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10386. section.Emit(Data(Basic.invalidPosition,op));
  10387. END Integer;
  10388. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10389. VAR i: LONGINT;
  10390. BEGIN
  10391. Info(section,str);
  10392. i := 0;
  10393. WHILE(str[i] # 0X) DO
  10394. Char(section,str[i]);
  10395. INC(i);
  10396. END;
  10397. Char(section,0X);
  10398. END String;
  10399. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10400. VAR s: Basic.SectionName;
  10401. BEGIN
  10402. StringPool.GetString(str, s);
  10403. String(section, s);
  10404. END String0;
  10405. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10406. VAR op: IntermediateCode.Operand;
  10407. BEGIN
  10408. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10409. IntermediateCode.SetOffset(op,realOffset);
  10410. section.Emit(Data(Basic.invalidPosition,op));
  10411. END NamedSymbol;
  10412. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10413. VAR op: IntermediateCode.Operand;
  10414. BEGIN
  10415. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10416. IntermediateCode.SetOffset(op,realOffset);
  10417. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10418. END NamedSymbolAt;
  10419. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10420. BEGIN
  10421. IF symbol= NIL THEN
  10422. Address( section, realOffset);
  10423. ASSERT(virtualOffset = 0);
  10424. ELSE
  10425. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10426. END;
  10427. END Symbol;
  10428. (* OutPointers delivers
  10429. {pointerOffset}
  10430. *)
  10431. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10432. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10433. BEGIN
  10434. type := type.resolved;
  10435. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10436. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10437. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10438. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10439. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10440. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10441. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10442. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10443. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10444. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10445. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10446. ELSIF (type IS SyntaxTree.RecordType) THEN
  10447. (* never treat a record like a pointer, even if the pointer field is set! *)
  10448. WITH type: SyntaxTree.RecordType DO
  10449. base := type.GetBaseRecord();
  10450. IF base # NIL THEN
  10451. Pointers(offset,symbol,section, base,numberPointers);
  10452. END;
  10453. variable := type.recordScope.firstVariable;
  10454. WHILE(variable # NIL) DO
  10455. IF ~(variable.untraced) THEN
  10456. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10457. END;
  10458. variable := variable.nextVariable;
  10459. END;
  10460. END;
  10461. ELSIF (type IS SyntaxTree.CellType) THEN
  10462. WITH type: SyntaxTree.CellType DO
  10463. base := type.GetBaseRecord();
  10464. IF base # NIL THEN
  10465. Pointers(offset,symbol,section, base,numberPointers);
  10466. END;
  10467. variable := type.cellScope.firstVariable;
  10468. WHILE(variable # NIL) DO
  10469. IF ~(variable.untraced) THEN
  10470. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10471. END;
  10472. variable := variable.nextVariable;
  10473. END;
  10474. property := type.firstProperty;
  10475. WHILE(property # NIL) DO
  10476. IF ~(property.untraced) THEN
  10477. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10478. END;
  10479. property := property.nextProperty;
  10480. END;
  10481. parameter := type.firstParameter;
  10482. WHILE(parameter # NIL) DO
  10483. IF ~(parameter.untraced) THEN
  10484. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10485. END;
  10486. parameter := parameter.nextParameter;
  10487. END;
  10488. END;
  10489. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10490. WITH type: SyntaxTree.ArrayType DO
  10491. IF type.form= SyntaxTree.Static THEN
  10492. n := type.staticLength;
  10493. base := type.arrayBase.resolved;
  10494. WHILE(base IS SyntaxTree.ArrayType) DO
  10495. type := base(SyntaxTree.ArrayType);
  10496. n := n* type.staticLength;
  10497. base := type.arrayBase.resolved;
  10498. END;
  10499. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10500. IF SemanticChecker.ContainsPointer(base) THEN
  10501. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10502. FOR i := 0 TO n-1 DO
  10503. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10504. END;
  10505. END;
  10506. ELSE
  10507. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10508. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10509. END;
  10510. END;
  10511. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10512. WITH type: SyntaxTree.MathArrayType DO
  10513. IF type.form = SyntaxTree.Static THEN
  10514. n := type.staticLength;
  10515. base := type.arrayBase.resolved;
  10516. WHILE(base IS SyntaxTree.MathArrayType) DO
  10517. type := base(SyntaxTree.MathArrayType);
  10518. n := n* type.staticLength;
  10519. base := type.arrayBase.resolved;
  10520. END;
  10521. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10522. IF SemanticChecker.ContainsPointer(base) THEN
  10523. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10524. FOR i := 0 TO n-1 DO
  10525. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10526. END;
  10527. END;
  10528. ELSE
  10529. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10530. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10531. END
  10532. END;
  10533. (* ELSE no pointers in type *)
  10534. END;
  10535. END Pointers;
  10536. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10537. VAR position,i: LONGINT; ch: CHAR;
  10538. BEGIN
  10539. IF pool.Has(index) THEN
  10540. RETURN pool.GetInt(index)
  10541. ELSE
  10542. position := source.pc;
  10543. pool.PutInt(index, position);
  10544. Info(source, name);
  10545. i := 0;
  10546. REPEAT
  10547. ch := name[i]; INC(i);
  10548. Char( source, ch);
  10549. UNTIL ch = 0X;
  10550. END;
  10551. RETURN position;
  10552. END EnterDynamicName;
  10553. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10554. VAR name: Basic.SectionName; position: LONGINT;
  10555. BEGIN
  10556. IF pool.Has(index) THEN
  10557. RETURN pool.GetInt(index)
  10558. ELSE
  10559. StringPool.GetString(index, name);
  10560. position := EnterDynamicName(source,name,index, pool);
  10561. END;
  10562. RETURN position;
  10563. END DynamicName;
  10564. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10565. VAR section: IntermediateCode.Section;
  10566. BEGIN
  10567. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10568. IF implementationVisitor.backend.cooperative THEN
  10569. Info(section, "TypeDescriptor");
  10570. Basic.ToSegmentedName("BaseTypes.Array", name);
  10571. NamedSymbol(section, name,NIL, 0, 0);
  10572. BasePointer(section);
  10573. offset := 0;
  10574. ELSE
  10575. IF ProtectModulesPointers THEN
  10576. HeapBlock(mName,typeName,section,2);
  10577. END;
  10578. Info(section, "HeapBlock");
  10579. IF ProtectModulesPointers THEN
  10580. Symbol(section,section,2,0);
  10581. ELSE
  10582. Address(section,0);
  10583. END;
  10584. Info(section, "TypeDescriptor");
  10585. Address(section,0);
  10586. offset := section.pc;
  10587. END;
  10588. RETURN section
  10589. END NamedBlock;
  10590. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10591. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10592. BEGIN
  10593. COPY(moduleName,name);
  10594. Strings.Append(name,suffix);
  10595. Basic.ToSegmentedName(name, pooledName);
  10596. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10597. END Block;
  10598. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10599. VAR name: Basic.SegmentedName;
  10600. BEGIN
  10601. Info(source,"ArrayHeader");
  10602. IF implementationVisitor.backend.cooperative THEN
  10603. sizePC := source.pc;
  10604. Address(source,0);
  10605. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10606. IF baseType # "" THEN
  10607. Basic.ToSegmentedName(baseType, name);
  10608. NamedSymbol(source, name,NIL, 0, 0);
  10609. ELSE
  10610. Address(source,0);
  10611. END;
  10612. Address(source,0);
  10613. ELSE
  10614. Address(source,0);
  10615. Address(source,0);
  10616. (* first pointer for GC *)
  10617. IF hasPointer THEN
  10618. (* points to first element in the array, this is NOT the base type descriptor *)
  10619. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10620. ELSE
  10621. Address(source,0);
  10622. END;
  10623. sizePC := source.pc;
  10624. Address(source,0);
  10625. Info(source,"array data");
  10626. END;
  10627. END ArrayBlock;
  10628. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10629. BEGIN
  10630. IF implementationVisitor.backend.cooperative THEN
  10631. PatchSize(section, pc, size);
  10632. PatchSize(section, pc + 3, size);
  10633. ELSE
  10634. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10635. PatchSize(section, pc, size);
  10636. END;
  10637. END PatchArray;
  10638. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10639. VAR
  10640. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10641. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10642. poolMap: Basic.HashTableInt;
  10643. namePool: IntermediateCode.Section;
  10644. namePoolOffset: LONGINT;
  10645. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10646. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10647. BEGIN
  10648. Basic.SegmentedNameToString(s1.name,n1);
  10649. Basic.SegmentedNameToString(s2.name,n2);
  10650. index := 0;
  10651. ch1 := n1[index];
  10652. ch2 := n2[index];
  10653. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10654. INC(index);
  10655. ch1 := n1[index];
  10656. ch2 := n2[index];
  10657. END;
  10658. RETURN ch1 < ch2;
  10659. END Compare;
  10660. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10661. VAR
  10662. i, j: LONGINT;
  10663. x, t: Sections.Section;
  10664. BEGIN
  10665. IF lo < hi THEN
  10666. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10667. WHILE i <= j DO
  10668. WHILE Compare(list[i], x) DO INC(i) END;
  10669. WHILE Compare(x, list[j]) DO DEC(j) END;
  10670. IF i <= j THEN
  10671. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10672. INC(i); DEC(j)
  10673. END
  10674. END;
  10675. IF lo < j THEN QuickSort(list, lo, j) END;
  10676. IF i < hi THEN QuickSort(list, i, hi) END
  10677. END;
  10678. END QuickSort;
  10679. (*
  10680. ExportDesc* = RECORD
  10681. fp*: ADDRESS;
  10682. name* {UNTRACED}: DynamicName;
  10683. adr*: ADDRESS;
  10684. exports*: LONGINT;
  10685. dsc* {UNTRACED}: ExportArray
  10686. END;
  10687. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10688. *)
  10689. PROCEDURE ExportDesc2(
  10690. source: IntermediateCode.Section;
  10691. namePool: IntermediateCode.Section;
  10692. fingerPrinter: FingerPrinter.FingerPrinter;
  10693. symbol: Sections.Section;
  10694. name: StringPool.Index;
  10695. VAR patchAdr: LONGINT
  10696. ): BOOLEAN;
  10697. VAR fingerPrint: SyntaxTree.FingerPrint;
  10698. BEGIN
  10699. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10700. & (symbol.type # Sections.InlineCodeSection)
  10701. THEN
  10702. *)
  10703. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10704. & (symbol.type # Sections.InlineCodeSection))
  10705. THEN
  10706. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10707. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10708. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10709. Longint(source,fingerPrint.public);
  10710. ELSE
  10711. Longint(source, 0);
  10712. END;
  10713. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10714. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10715. Symbol(source, symbol,0,0);
  10716. patchAdr := source.pc;
  10717. Longint(source, 0);
  10718. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10719. Address(source,0);
  10720. END;
  10721. RETURN TRUE
  10722. ELSE
  10723. RETURN FALSE
  10724. END;
  10725. END ExportDesc2;
  10726. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10727. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10728. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10729. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10730. nextPatch: LONGINT;
  10731. TYPE
  10732. Scope = RECORD
  10733. elements: LONGINT;
  10734. gelements: LONGINT;
  10735. section: IntermediateCode.Section;
  10736. patchAdr: LONGINT;
  10737. arraySizePC: LONGINT;
  10738. beginPC: LONGINT; (* current scope start pc *)
  10739. END;
  10740. BEGIN
  10741. Basic.InitSegmentedName(prev);
  10742. olevel := -1;
  10743. scopes[0].section := source;
  10744. scopes[0].arraySizePC := MIN(LONGINT);
  10745. FOR s := 0 TO LEN(sections)-1 DO
  10746. symbol := sections[s];
  10747. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10748. this := sections[s].name;
  10749. level := 0;
  10750. WHILE (this[level] > 0) DO
  10751. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10752. INC(level);
  10753. END;
  10754. WHILE level < olevel DO
  10755. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10756. IF olevel > 0 THEN
  10757. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10758. nextPatch := scopes[olevel-1].patchAdr+1;
  10759. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10760. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10761. END;
  10762. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10763. DEC(olevel);
  10764. END;
  10765. IF (this[level] > 0) THEN
  10766. IF level > olevel THEN
  10767. (*TRACE("opening",level); *)
  10768. IF scopes[level].section = NIL THEN
  10769. arrayName := ".@ExportArray";
  10770. Strings.AppendInt(arrayName, level);
  10771. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10772. AddPointer(scopes[level].section,offset);
  10773. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10774. END;
  10775. scopes[level].beginPC := scopes[level].section.pc;
  10776. olevel := level;
  10777. scopes[olevel].elements := 0;
  10778. END;
  10779. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10780. sym := sections[s];
  10781. ELSE
  10782. sym := NIL;
  10783. END;
  10784. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10785. THEN
  10786. INC(scopes[olevel].elements);
  10787. END;
  10788. (* enter string in scope *)
  10789. INC(level);
  10790. END;
  10791. END;
  10792. Basic.SegmentedNameToString(this, name);
  10793. prev := this;
  10794. END;
  10795. END;
  10796. WHILE 0 <= olevel DO
  10797. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10798. IF olevel > 0 THEN
  10799. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10800. nextPatch := scopes[olevel-1].patchAdr+1;
  10801. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10802. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10803. END;
  10804. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10805. DEC(olevel);
  10806. END;
  10807. level := 0;
  10808. WHILE (level < LEN(scopes)) DO
  10809. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10810. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10811. END;
  10812. INC(level);
  10813. END;
  10814. END Export;
  10815. BEGIN
  10816. NEW(fingerPrinter);
  10817. NEW(poolMap, 64);
  10818. (* 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 *)
  10819. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10820. NEW(sectionArray, module.allSections.Length());
  10821. FOR i := 0 TO module.allSections.Length() - 1 DO
  10822. section := module.allSections.GetSection(i);
  10823. sectionArray[i] := section;
  10824. END;
  10825. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10826. Export(sectionArray^);
  10827. END ExportDesc;
  10828. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10829. VAR
  10830. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10831. BEGIN
  10832. Info(source, "exception table offsets array descriptor");
  10833. size := 0;
  10834. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10835. Info(source, "exception table content");
  10836. FOR i := 0 TO module.allSections.Length() - 1 DO
  10837. p := module.allSections.GetSection(i);
  10838. IF p.type = Sections.CodeSection THEN
  10839. finallyPC := p(IntermediateCode.Section).finally;
  10840. IF finallyPC>=0 THEN
  10841. Symbol( source, p, 0,0);
  10842. Symbol( source, p, finallyPC, 0);
  10843. Symbol( source, p, finallyPC,0);
  10844. INC(size);
  10845. END;
  10846. END
  10847. END;
  10848. PatchArray(source,sizePC,size);
  10849. END ExceptionArray;
  10850. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10851. VAR i: LONGINT; ch: CHAR;
  10852. BEGIN
  10853. i := 0;
  10854. REPEAT
  10855. ch := name[i]; INC(i);
  10856. Char( section, ch);
  10857. UNTIL ch = 0X;
  10858. WHILE i < 32 DO
  10859. Char( section, 0X); INC(i);
  10860. END;
  10861. END Name;
  10862. PROCEDURE References(section: IntermediateCode.Section);
  10863. CONST
  10864. sfTypeNone = 0X;
  10865. sfTypeCHAR = 01X;
  10866. sfTypeCHAR8 = 02X;
  10867. sfTypeCHAR16 = 03X;
  10868. sfTypeCHAR32 = 04X;
  10869. sfTypeRANGE = 05X;
  10870. sfTypeSHORTINT = 06X;
  10871. sfTypeINTEGER = 07X;
  10872. sfTypeLONGINT = 08X;
  10873. sfTypeHUGEINT = 09X;
  10874. sfTypeWORD = 0AX;
  10875. sfTypeLONGWORD = 0BX;
  10876. sfTypeSIGNED8 = 0CX;
  10877. sfTypeSIGNED16 = 0DX;
  10878. sfTypeSIGNED32 = 0EX;
  10879. sfTypeSIGNED64 = 0FX;
  10880. sfTypeUNSIGNED8 = 10X;
  10881. sfTypeUNSIGNED16 = 11X;
  10882. sfTypeUNSIGNED32 = 12X;
  10883. sfTypeUNSIGNED64 = 13X;
  10884. sfTypeREAL = 14X;
  10885. sfTypeLONGREAL = 15X;
  10886. sfTypeCOMPLEX = 16X;
  10887. sfTypeLONGCOMPLEX = 17X;
  10888. sfTypeBOOLEAN = 18X;
  10889. sfTypeSET = 19X;
  10890. sfTypeANY = 1AX;
  10891. sfTypeOBJECT = 1BX;
  10892. sfTypeBYTE = 1CX;
  10893. sfTypeADDRESS = 1DX;
  10894. sfTypeSIZE = 1EX;
  10895. sfTypeIndirect = 1FX;
  10896. sfTypeRecord = 20X;
  10897. sfTypePointerToRecord = 21X;
  10898. sfTypePointerToArray = 22X;
  10899. sfTypeOpenArray = 23X;
  10900. sfTypeStaticArray = 24X;
  10901. sfTypeDynamicArray = 25X;
  10902. sfTypeMathStaticArray = 26X;
  10903. sfTypeMathOpenArray = 27X;
  10904. sfTypeMathTensor = 28X;
  10905. sfTypeDelegate = 29X;
  10906. sfTypeENUM = 2AX;
  10907. sfTypeCELL = 2BX;
  10908. sfTypePORT = 2CX;
  10909. sfIN = 0X;
  10910. sfOUT = 1X;
  10911. flagDelegate = 0;
  10912. flagConstructor = 1;
  10913. (* variable / parameter addressing modes *)
  10914. sfAbsolute = 0X; (* global vars *)
  10915. sfRelative = 1X; (* variables, value parameters *)
  10916. sfIndirect = 2X; (* var parameters *)
  10917. sfScopeBegin = 0F0X;
  10918. sfScopeEnd = 0F1X;
  10919. sfProcedure = 0F2X;
  10920. sfVariable = 0F3X;
  10921. sfTypeDeclaration = 0F4X;
  10922. sfModule = 0FFX;
  10923. RefInfo = TRUE;
  10924. VAR
  10925. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  10926. indirectTypes: Basic.HashTable;
  10927. PROCEDURE CurrentIndex(): SIZE;
  10928. VAR i: LONGINT;
  10929. BEGIN
  10930. FOR i := startPC TO section.pc -1 DO
  10931. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10932. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10933. END;
  10934. startPC := section.pc;
  10935. RETURN lastOffset;
  10936. END CurrentIndex;
  10937. (*
  10938. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  10939. Module = sfModule prevSymbol:SIZE name:String Scope.
  10940. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  10941. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  10942. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  10943. Type =
  10944. sfTypePointerToRecord
  10945. | sfTypePointerToArray Type
  10946. | sfTypeOpenArray Type
  10947. | sfTypeDynamicArray Type
  10948. | sfTypeStaticArray length:SIZE Type
  10949. | sfTypeMathOpenArray Type
  10950. | sfTypeMathStaticArray length:SIZE Type
  10951. | sfTypeMathTensor Type
  10952. | sfTypeRecord tdAdr:ADDRESS
  10953. | sfTypeDelegate {Parameter} return:Type
  10954. | sfTypePort (sfIN | sfOUT)
  10955. | sfTypeBOOLEAN
  10956. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  10957. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  10958. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  10959. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  10960. | sfTypeWORD | sfTypeLONGWORD
  10961. | sfTypeREAL | sfTypeLONGREAL
  10962. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  10963. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  10964. | sfTypeIndirect offset:SIZE.
  10965. *)
  10966. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  10967. VAR offset: SIZE;
  10968. BEGIN
  10969. IF indirectTypes.Has(type) THEN
  10970. offset := indirectTypes.GetInt(type);
  10971. Char(section, sfTypeIndirect);
  10972. Size(section, offset);
  10973. RETURN TRUE;
  10974. ELSE
  10975. indirectTypes.PutInt(type, CurrentIndex());
  10976. RETURN FALSE;
  10977. END;
  10978. END Indirect;
  10979. PROCEDURE NType(type: SyntaxTree.Type);
  10980. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  10981. segmentedName: Basic.SegmentedName; offset: SIZE; parameter: SyntaxTree.Parameter;
  10982. BEGIN
  10983. IF type = NIL THEN
  10984. Char(section, sfTypeNone)
  10985. ELSE
  10986. type := type.resolved;
  10987. size := type.sizeInBits;
  10988. WITH type:SyntaxTree.PointerType DO
  10989. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  10990. IF RefInfo THEN Info(section,"PointerToRecord") END;
  10991. Char(section, sfTypePointerToRecord);
  10992. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  10993. ELSE
  10994. IF RefInfo THEN Info(section,"PointerToArray") END;
  10995. Char(section, sfTypePointerToArray);
  10996. NType(type.pointerBase);
  10997. END;
  10998. | type: SyntaxTree.ArrayType DO
  10999. IF ~Indirect(type) THEN
  11000. IF type.form = SyntaxTree.Open THEN
  11001. IF RefInfo THEN Info(section,"OpenArray") END;
  11002. Char(section, sfTypeOpenArray);
  11003. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11004. IF RefInfo THEN Info(section,"DynamicArray") END;
  11005. Char(section, sfTypeDynamicArray);
  11006. ELSIF type.form = SyntaxTree.Static THEN
  11007. IF RefInfo THEN Info(section,"StaticArray") END;
  11008. Char(section, sfTypeStaticArray);
  11009. Size(section, type.staticLength);
  11010. ELSE
  11011. HALT(100);
  11012. END;
  11013. NType(type.arrayBase);
  11014. END;
  11015. | type: SyntaxTree.MathArrayType DO
  11016. IF ~Indirect(type) THEN
  11017. IF type.form = SyntaxTree.Open THEN
  11018. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11019. Char(section, sfTypeMathOpenArray);
  11020. ELSIF type.form = SyntaxTree.Static THEN
  11021. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11022. Char(section, sfTypeMathStaticArray);
  11023. Size(section, type.staticLength);
  11024. ELSIF type.form = SyntaxTree.Tensor THEN
  11025. IF RefInfo THEN Info(section,"MathTensor") END;
  11026. Char(section, sfTypeMathTensor);
  11027. ELSE
  11028. HALT(100);
  11029. END;
  11030. NType(type.arrayBase);
  11031. END;
  11032. | type: SyntaxTree.RecordType DO
  11033. IF ~Indirect(type) THEN
  11034. IF type.pointerType # NIL (* OBJECT *) THEN
  11035. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11036. Char(section, sfTypePointerToRecord)
  11037. ELSE
  11038. IF RefInfo THEN Info(section,"Record") END;
  11039. Char(section, sfTypeRecord);
  11040. td := type.typeDeclaration;
  11041. IF RefInfo THEN Info(section,"TD") END;
  11042. IF (td # NIL) THEN
  11043. Global.GetSymbolSegmentedName(td,segmentedName);
  11044. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11045. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11046. ELSE
  11047. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11048. END;
  11049. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11050. Symbol(section, tir, 0, offset);
  11051. ELSE
  11052. Address(section, 0);
  11053. END;
  11054. END;
  11055. END;
  11056. | type: SyntaxTree.CellType DO
  11057. IF ~Indirect(type) THEN
  11058. IF RefInfo THEN Info(section,"Record") END;
  11059. Char(section, sfTypeRecord);
  11060. td := type.typeDeclaration;
  11061. IF RefInfo THEN Info(section,"TD") END;
  11062. IF (td # NIL) THEN
  11063. Global.GetSymbolSegmentedName(td,segmentedName);
  11064. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11065. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11066. ELSE
  11067. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11068. END;
  11069. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11070. Symbol(section, tir, 0, offset);
  11071. ELSE
  11072. Address(section, 0);
  11073. END;
  11074. END;
  11075. | type: SyntaxTree.PortType DO
  11076. Char(section, sfTypePORT);
  11077. IF type.direction = SyntaxTree.OutPort THEN
  11078. Char(section, sfOUT)
  11079. ELSE
  11080. Char(section, sfIN)
  11081. END;
  11082. | type: SyntaxTree.ProcedureType DO
  11083. IF ~Indirect(type) THEN
  11084. Char(section, sfTypeDelegate);
  11085. parameter := type.firstParameter;
  11086. WHILE(parameter # NIL) DO
  11087. NParameter(parameter, -1);
  11088. parameter := parameter.nextParameter;
  11089. END;
  11090. NType(type.returnType);
  11091. END;
  11092. | type:SyntaxTree.EnumerationType DO
  11093. Char(section, sfTypeENUM);
  11094. | type: SyntaxTree.BasicType DO
  11095. WITH type: SyntaxTree.BooleanType DO
  11096. IF RefInfo THEN Info(section,"Boolean") END;
  11097. Char(section, sfTypeBOOLEAN);
  11098. | type: SyntaxTree.CharacterType DO
  11099. IF type = module.system.characterType THEN
  11100. IF RefInfo THEN Info(section,"CHAR") END;
  11101. Char(section, sfTypeCHAR);
  11102. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11103. IF RefInfo THEN Info(section,"CHAR8") END;
  11104. Char(section, sfTypeCHAR8)
  11105. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11106. IF RefInfo THEN Info(section,"CHAR16") END;
  11107. Char(section, sfTypeCHAR16);
  11108. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11109. IF RefInfo THEN Info(section,"CHAR32") END;
  11110. Char(section, sfTypeCHAR32);
  11111. ELSE
  11112. HALT(100);
  11113. END;
  11114. |type: SyntaxTree.IntegerType DO
  11115. IF type(SyntaxTree.IntegerType).signed THEN
  11116. IF (type = module.system.shortintType) THEN
  11117. IF RefInfo THEN Info(section,"SHORTINT") END;
  11118. Char(section, sfTypeSHORTINT)
  11119. ELSIF (type = module.system.integerType) THEN
  11120. IF RefInfo THEN Info(section,"INTEGER") END;
  11121. Char(section, sfTypeINTEGER)
  11122. ELSIF (type = module.system.longintType) THEN
  11123. IF RefInfo THEN Info(section,"LONGINT") END;
  11124. Char(section, sfTypeLONGINT)
  11125. ELSIF (type = module.system.hugeintType) THEN
  11126. IF RefInfo THEN Info(section,"HUGEINT") END;
  11127. Char(section, sfTypeHUGEINT)
  11128. ELSIF (type = module.system.wordType) THEN
  11129. IF RefInfo THEN Info(section,"WORD") END;
  11130. Char(section, sfTypeWORD)
  11131. ELSIF (type = module.system.longWordType) THEN
  11132. IF RefInfo THEN Info(section,"LONGWORD") END;
  11133. Char(section, sfTypeLONGWORD);
  11134. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11135. IF RefInfo THEN Info(section,"SIGNED8") END;
  11136. Char(section, sfTypeSIGNED8)
  11137. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11138. IF RefInfo THEN Info(section,"SIGNED16") END;
  11139. Char(section, sfTypeSIGNED16)
  11140. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11141. IF RefInfo THEN Info(section,"SIGNED32") END;
  11142. Char(section, sfTypeSIGNED32)
  11143. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11144. IF RefInfo THEN Info(section,"SIGNED64") END;
  11145. Char(section, sfTypeSIGNED64)
  11146. ELSE
  11147. HALT(100);
  11148. END
  11149. ELSE (* unsigned *)
  11150. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11151. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11152. Char(section, sfTypeUNSIGNED8)
  11153. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11154. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11155. Char(section, sfTypeUNSIGNED16)
  11156. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11157. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11158. Char(section, sfTypeUNSIGNED32)
  11159. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11160. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11161. Char(section, sfTypeUNSIGNED64)
  11162. ELSE
  11163. HALT(100)
  11164. END
  11165. END;
  11166. | type: SyntaxTree.FloatType DO
  11167. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11168. IF RefInfo THEN Info(section,"REAL") END;
  11169. Char(section, sfTypeREAL);
  11170. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11171. IF RefInfo THEN Info(section,"LONGREAL") END;
  11172. Char(section, sfTypeLONGREAL);
  11173. ELSE
  11174. HALT(100);
  11175. END;
  11176. |type: SyntaxTree.ComplexType DO
  11177. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11178. IF RefInfo THEN Info(section,"COMPLEX") END;
  11179. Char(section, sfTypeCOMPLEX);
  11180. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11181. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11182. Char(section, sfTypeLONGCOMPLEX);
  11183. ELSE
  11184. HALT(100);
  11185. END;
  11186. |type:SyntaxTree.SetType DO
  11187. IF RefInfo THEN Info(section,"SET") END;
  11188. Char(section, sfTypeSET);
  11189. |type:SyntaxTree.AnyType DO
  11190. IF RefInfo THEN Info(section,"ANY") END;
  11191. Char(section, sfTypeANY);
  11192. |type:SyntaxTree.ObjectType DO
  11193. IF RefInfo THEN Info(section,"OBJECT") END;
  11194. Char(section, sfTypeOBJECT);
  11195. |type:SyntaxTree.ByteType DO
  11196. IF RefInfo THEN Info(section,"BYTE") END;
  11197. Char(section, sfTypeBYTE);
  11198. |type:SyntaxTree.RangeType DO
  11199. IF RefInfo THEN Info(section,"RANGE") END;
  11200. Char(section, sfTypeRANGE)
  11201. |type:SyntaxTree.AddressType DO
  11202. IF RefInfo THEN Info(section,"ADDRESS") END;
  11203. Char(section, sfTypeADDRESS)
  11204. |type:SyntaxTree.SizeType DO
  11205. IF RefInfo THEN Info(section,"SIZE") END;
  11206. Char(section, sfTypeSIZE)
  11207. ELSE
  11208. HALT(100)
  11209. END;
  11210. ELSE HALT(101);
  11211. END;
  11212. END;
  11213. END NType;
  11214. (*
  11215. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11216. *)
  11217. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11218. VAR pos: LONGINT; type: SyntaxTree.Type;
  11219. BEGIN
  11220. IF RefInfo THEN Info(section, "Parameter") END;
  11221. Char(section, sfVariable);
  11222. Size(section, procOffset);
  11223. String0(section, parameter.name);
  11224. type := parameter.type.resolved;
  11225. IF parameter.kind = SyntaxTree.VarParameter THEN
  11226. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11227. ELSE Char(section, sfIndirect)
  11228. END;
  11229. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11230. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11231. Char(section, sfIndirect);
  11232. ELSE
  11233. Char(section, sfRelative);
  11234. END;
  11235. ELSE
  11236. Char(section, sfRelative);
  11237. END;
  11238. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11239. NType(parameter.type);
  11240. END NParameter;
  11241. (*
  11242. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11243. *)
  11244. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11245. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11246. flags: SET;
  11247. BEGIN
  11248. IF RefInfo THEN Info(section, "Procedure") END;
  11249. pos := CurrentIndex();
  11250. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11251. Char(section, sfProcedure);
  11252. Size(section, scopeOffset);
  11253. String0(section,procedure.name);
  11254. s := module.allSections.FindBySymbol(procedure);
  11255. Symbol(section,s,0,0); (* start *)
  11256. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11257. flags := {};
  11258. IF procedureType.isDelegate THEN
  11259. INCL(flags, flagDelegate);
  11260. END;
  11261. IF procedure.isConstructor THEN
  11262. INCL(flags, flagConstructor);
  11263. END;
  11264. Set(section, flags);
  11265. IF RefInfo THEN Info(section, "Parameters") END;
  11266. parameter := procedureType.firstParameter;
  11267. WHILE(parameter # NIL) DO
  11268. NParameter(parameter, pos);
  11269. parameter := parameter.nextParameter;
  11270. END;
  11271. IF procedureType.returnParameter # NIL THEN
  11272. NParameter(procedureType.returnParameter, pos);
  11273. END;
  11274. IF procedureType.selfParameter # NIL THEN
  11275. NParameter(procedureType.selfParameter, pos);
  11276. END;
  11277. IF RefInfo THEN Info(section, "ReturnType") END;
  11278. NType(procedureType.returnType);
  11279. NScope(procedure.procedureScope, pos);
  11280. END NProcedure;
  11281. (*
  11282. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11283. *)
  11284. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11285. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11286. BEGIN
  11287. IF RefInfo THEN Info(section, "Variable") END;
  11288. pos := CurrentIndex();
  11289. Char(section, sfVariable);
  11290. Size(section, scopeOffset);
  11291. String0(section, variable.name);
  11292. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11293. Char(section, sfAbsolute);
  11294. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11295. NamedSymbol(section, sn,variable, 0,0);
  11296. ELSE
  11297. Char(section, sfRelative);
  11298. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11299. END;
  11300. NType(variable.type);
  11301. s := module.allSections.FindBySymbol(variable);
  11302. END NVariable;
  11303. (*
  11304. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11305. *)
  11306. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11307. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11308. BEGIN
  11309. IF typeDeclaration = NIL THEN RETURN END;
  11310. pos := CurrentIndex();
  11311. s := module.allSections.FindBySymbol(typeDeclaration);
  11312. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11313. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11314. Char(section, sfTypeDeclaration);
  11315. Size(section, scopeOffset);
  11316. String0(section, typeDeclaration.name);
  11317. declared := typeDeclaration.declaredType.resolved;
  11318. IF (declared IS SyntaxTree.PointerType) THEN
  11319. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11320. END;
  11321. WITH declared: SyntaxTree.RecordType DO
  11322. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11323. Symbol(section, s, 0, offset);
  11324. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11325. Basic.AppendToSegmentedName(name,".@Info");
  11326. s := module.allSections.FindByName(name);
  11327. IF s # NIL THEN (* does not work for coop *)
  11328. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11329. NScope(declared.recordScope, pos);
  11330. END;
  11331. |declared: SyntaxTree.CellType DO
  11332. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11333. Symbol(section, s, 0, offset);
  11334. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11335. Basic.AppendToSegmentedName(name,".@Info");
  11336. s := module.allSections.FindByName(name);
  11337. IF s # NIL THEN
  11338. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11339. NScope(declared.cellScope, pos);
  11340. END;
  11341. ELSE
  11342. Address(section, 0);
  11343. END;
  11344. END NTypeDeclaration;
  11345. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11346. VAR pos: LONGINT;
  11347. BEGIN
  11348. pos := CurrentIndex();
  11349. Char(section,sfModule);
  11350. Size(section, prevSymbol);
  11351. String0(section, module.name);
  11352. NScope(module.moduleScope, pos);
  11353. END NModule;
  11354. (*
  11355. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11356. *)
  11357. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11358. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11359. BEGIN
  11360. IF scope = NIL THEN RETURN END;
  11361. IF RefInfo THEN Info(section, "Scope") END;
  11362. Char(section, sfScopeBegin);
  11363. variable := scope.firstVariable;
  11364. WHILE (variable # NIL) DO
  11365. NVariable(variable, prevSymbol);
  11366. variable := variable.nextVariable;
  11367. END;
  11368. WITH scope: SyntaxTree.ModuleScope DO
  11369. bodyProcedure := scope.bodyProcedure;
  11370. |scope: SyntaxTree.RecordScope DO
  11371. bodyProcedure := scope.bodyProcedure;
  11372. ELSE
  11373. bodyProcedure := NIL;
  11374. END;
  11375. IF bodyProcedure # NIL THEN
  11376. NProcedure(bodyProcedure, prevSymbol)
  11377. END;
  11378. procedure := scope.firstProcedure;
  11379. WHILE procedure # NIL DO
  11380. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11381. procedure := procedure.nextProcedure;
  11382. END;
  11383. typeDeclaration := scope.firstTypeDeclaration;
  11384. WHILE typeDeclaration # NIL DO
  11385. NTypeDeclaration(typeDeclaration, prevSymbol);
  11386. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11387. END;
  11388. Char(section, sfScopeEnd); (* scope ends *)
  11389. END NScope;
  11390. BEGIN
  11391. NEW(indirectTypes, 32);
  11392. ArrayBlock(section,sizePC,"", FALSE);
  11393. IF ~implementationVisitor.backend.cooperative THEN
  11394. startPC := section.pc;
  11395. NModule(module.module, -1);
  11396. PatchArray(section,sizePC,CurrentIndex());
  11397. END;
  11398. END References;
  11399. (*
  11400. Command* = RECORD
  11401. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11402. name*: Name; (* name of the procedure *)
  11403. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11404. entryAdr* : ADDRESS; (* entry address of procedure *)
  11405. END;
  11406. *)
  11407. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11408. VAR
  11409. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11410. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11411. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11412. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11413. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11414. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11415. BEGIN
  11416. RETURN
  11417. (type = NIL) OR
  11418. (type.resolved IS SyntaxTree.RecordType) OR
  11419. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11420. (type.resolved IS SyntaxTree.AnyType);
  11421. END TypeAllowed;
  11422. BEGIN
  11423. numberParameters := procedureType.numberParameters;
  11424. RETURN
  11425. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11426. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11427. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11428. END GetProcedureAllowed;
  11429. PROCEDURE WriteType(type : SyntaxTree.Type);
  11430. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11431. name: Basic.SegmentedName; offset: LONGINT;
  11432. BEGIN
  11433. IF type = NIL THEN
  11434. Address(source,0);
  11435. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11436. Address(source,1);
  11437. ELSE
  11438. type := type.resolved;
  11439. IF type IS SyntaxTree.PointerType THEN
  11440. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11441. END;
  11442. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11443. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11444. name[0] := typeDeclaration.name; name[1] := -1;
  11445. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11446. ASSERT(section # NIL);
  11447. ELSE
  11448. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11449. (* TODO *)
  11450. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11451. END;
  11452. IF implementationVisitor.backend.cooperative THEN
  11453. offset := 0;
  11454. ELSE
  11455. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11456. END;
  11457. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11458. END;
  11459. END WriteType;
  11460. BEGIN
  11461. Info(source, "command array descriptor");
  11462. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11463. numberCommands := 0;
  11464. Info(source, "command array content");
  11465. FOR i := 0 TO module.allSections.Length() - 1 DO
  11466. p := module.allSections.GetSection(i);
  11467. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11468. procedure := p.symbol(SyntaxTree.Procedure);
  11469. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11470. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11471. procedure.GetName(name);
  11472. Name(source,name);
  11473. numberParameters := procedureType.numberParameters;
  11474. (* offset of type of first parameter *)
  11475. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11476. ELSE WriteType(procedureType.firstParameter.type)
  11477. END;
  11478. (* offset of type of return parameter *)
  11479. WriteType(procedureType.returnType);
  11480. (* command name *)
  11481. (* command code offset *)
  11482. Symbol(source,p,0,0);
  11483. INC(numberCommands);
  11484. IF Trace THEN
  11485. D.Ln;
  11486. END;
  11487. END;
  11488. END
  11489. END;
  11490. PatchArray(source,sizePC,numberCommands);
  11491. END CommandArray;
  11492. (* to prevent from double import of different module aliases *)
  11493. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11494. VAR i: SyntaxTree.Import;
  11495. BEGIN
  11496. i := module.module.moduleScope.firstImport;
  11497. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11498. i := i.nextImport;
  11499. END;
  11500. RETURN i = import
  11501. END IsFirstDirectOccurence;
  11502. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11503. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11504. BEGIN
  11505. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11506. ArrayBlock(source,pc,"", FALSE);
  11507. Info(source, "import module array data");
  11508. IF implementationVisitor.backend.cooperative THEN
  11509. offset := 0;
  11510. ELSE
  11511. IF module.system.addressType.sizeInBits = 64 THEN
  11512. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11513. ELSE
  11514. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11515. END;
  11516. END;
  11517. import := module.module.moduleScope.firstImport;
  11518. numberImports := 0;
  11519. WHILE import # NIL DO
  11520. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11521. Global.GetModuleSegmentedName(import.module,name);
  11522. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11523. NamedSymbol(source, name, NIL, 0, offset);
  11524. INC(numberImports);
  11525. END;
  11526. import := import.nextImport
  11527. END;
  11528. PatchArray(source,pc,numberImports);
  11529. END ImportsArray;
  11530. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11531. VAR
  11532. p: Sections.Section; sizePC, size, i: LONGINT;
  11533. BEGIN
  11534. Info(source, "Type info section");
  11535. size := 0;
  11536. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11537. FOR i := 0 TO module.allSections.Length() - 1 DO
  11538. p := module.allSections.GetSection(i);
  11539. WITH p: IntermediateCode.Section DO
  11540. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11541. Symbol(source,p,EmptyBlockOffset,0);
  11542. INC(size);
  11543. END;
  11544. END
  11545. END;
  11546. PatchArray(source,sizePC,size);
  11547. END TypeInfoSection;
  11548. (*
  11549. ProcTableEntry* = RECORD
  11550. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11551. noPtr*: LONGINT;
  11552. END;
  11553. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11554. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11555. *)
  11556. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11557. VAR
  11558. numberPointers: SIZE;
  11559. procedure: SyntaxTree.Procedure;
  11560. BEGIN
  11561. Info(section,"pcFrom");
  11562. Symbol(section,procedureSection,0,0);
  11563. Info(section,"pcTo");
  11564. Symbol(section, procedureSection, procedureSection.pc, 0);
  11565. Info(section,"pointer to offsets array");
  11566. Symbol(section, section,section.pc+1,0);
  11567. Info(section,"offsets array");
  11568. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11569. PointerArray(section, procedure.procedureScope, numberPointers);
  11570. END ProcedureDescriptor;
  11571. (* only for tracing, the descriptor is otherwise not complete ! *)
  11572. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11573. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11574. BEGIN
  11575. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11576. name := procedureSection.name;
  11577. Basic.AppendToSegmentedName(name,".@Info");
  11578. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11579. Address(section,0);
  11580. Symbol(section,section,2,0);
  11581. (*
  11582. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11583. descSize: LONGINT;
  11584. sentinel: LONGINT; (* = MPO-4 *)
  11585. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11586. flags*: SET;
  11587. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11588. name*: Name;
  11589. END;
  11590. *)
  11591. Size(section, 0);
  11592. Longint(section,0);
  11593. Address(section,0);
  11594. Set(section,{});
  11595. moduleSection := ModuleSection();
  11596. Symbol( section, moduleSection, moduleSection.pc,0);
  11597. IF procedureSection.symbol = NIL THEN
  11598. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11599. ELSE
  11600. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11601. END;
  11602. Name(section, infoName);
  11603. Size(section, 0);
  11604. RETURN section;
  11605. END MakeProcedureDescriptorTag;
  11606. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11607. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11608. BEGIN
  11609. name := procedureSection.name;
  11610. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11611. IF CreateProcedureDescInfo THEN
  11612. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11613. Address(dest,0);
  11614. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11615. offset := dest.pc;
  11616. ELSE
  11617. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11618. END;
  11619. ProcedureDescriptor(dest, procedureSection);
  11620. Symbol(section, dest, offset, 0);
  11621. END ProcedureDescriptorPointer;
  11622. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11623. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11624. BEGIN
  11625. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11626. numberProcs := 0;
  11627. FOR i := 0 TO module.allSections.Length() - 1 DO
  11628. destination := module.allSections.GetSection(i);
  11629. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11630. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11631. INC(numberProcs);
  11632. END
  11633. END;
  11634. PatchArray(section, sizePC, numberProcs);
  11635. END ProcedureDescriptorArray;
  11636. (*
  11637. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11638. VAR
  11639. next*: Module; (** once a module is published, all fields are read-only *)
  11640. name*: Name;
  11641. init, published: BOOLEAN;
  11642. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11643. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11644. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11645. command*: POINTER TO ARRAY OF Command;
  11646. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11647. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11648. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11649. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11650. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11651. data*, code*: Bytes;
  11652. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11653. export*: ExportDesc;
  11654. term*: TerminationHandler;
  11655. exTable*: ExceptionTable;
  11656. noProcs*: LONGINT;
  11657. firstProc*: ADDRESS; <- done by loader
  11658. maxPtrs*: LONGINT;
  11659. crc*: LONGINT;
  11660. *)
  11661. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11662. BEGIN
  11663. Info(section, "cycle");
  11664. Size(section,0);
  11665. Info(section, "references");
  11666. Size(section,0);
  11667. Info(section, "nextMarked");
  11668. Address(section,0);
  11669. Info(section, "nextWatched");
  11670. Address(section,0);
  11671. END BasePointer;
  11672. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11673. BEGIN
  11674. BasePointer(section);
  11675. Info(section, "action");
  11676. Address(section,0);
  11677. Info(section, "monitor");
  11678. Address(section,0);
  11679. END BaseObject;
  11680. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11681. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11682. pooledName: Basic.SegmentedName;
  11683. symbol: SyntaxTree.Symbol;
  11684. BEGIN
  11685. Global.GetModuleName(module.module,name);
  11686. Strings.Append(name,".@Module.@Descriptor");
  11687. Basic.ToSegmentedName(name, pooledName);
  11688. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11689. Symbol(section,descriptorSection,0,0);
  11690. Info(descriptorSection, "descriptor");
  11691. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11692. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11693. Address(descriptorSection,0);
  11694. Global.GetModuleName(module.module,name);
  11695. Strings.Append(name,".@Trace");
  11696. Basic.ToSegmentedName(name, pooledName);
  11697. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11698. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11699. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11700. END ModuleDescriptor;
  11701. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11702. VAR name: ARRAY 128 OF CHAR;
  11703. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11704. symbol: SyntaxTree.Symbol;
  11705. BEGIN
  11706. ASSERT(implementationVisitor.backend.newObjectFile);
  11707. Global.GetModuleName(module.module,name);
  11708. Strings.Append(name,".@Module");
  11709. Basic.ToSegmentedName(name, pooledName);
  11710. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11711. moduleSection.SetExported(TRUE);
  11712. IF moduleSection.pc = 0 THEN
  11713. IF implementationVisitor.backend.cooperative THEN
  11714. Info(moduleSection, "descriptor");
  11715. ModuleDescriptor(moduleSection);
  11716. BaseObject(moduleSection);
  11717. implementationVisitor.CreateTraceModuleMethod(module.module);
  11718. ELSE
  11719. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11720. Info(moduleSection, "HeapBlock");
  11721. Symbol(moduleSection,moduleSection,2,0);
  11722. Info(moduleSection, "TypeDescriptor");
  11723. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11724. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11725. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11726. END;
  11727. END;
  11728. RETURN moduleSection;
  11729. END ModuleSection;
  11730. PROCEDURE NewModuleInfo();
  11731. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11732. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11733. sectionName: Basic.SectionName;
  11734. CONST MPO=-40000000H;
  11735. BEGIN
  11736. (*
  11737. TypeDesc* = POINTER TO RECORD
  11738. descSize: SIZE;
  11739. sentinel: LONGINT; (* = MPO-4 *)
  11740. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11741. flags*: SET;
  11742. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11743. name*: Name;
  11744. refsOffset: SIZE;
  11745. END;
  11746. *)
  11747. (*name is missing prefixes sometimes*)
  11748. Global.GetModuleSegmentedName(module.module,name);
  11749. Basic.AppendToSegmentedName(name,".@Info");
  11750. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11751. Info(source, "HeapBlock");
  11752. Address(source,0); (* an empty heap block prevents GC marking *)
  11753. Info(source, "TypeDescriptor");
  11754. Address(source,0);
  11755. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11756. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11757. Address(source,MPO-4);
  11758. Info(source, "type tag pointer");
  11759. Address( source,0);
  11760. Info(source, "type flags");
  11761. flags := {};
  11762. Set( source, flags);
  11763. Info(source, "pointer to module");
  11764. moduleSection := ModuleSection();
  11765. Symbol( source, moduleSection, moduleSection.pc,0);
  11766. Info(source, "type name");
  11767. i := 0;
  11768. sectionName := "@Self";
  11769. (*
  11770. Global.GetSymbolSegmentedName(td,name);
  11771. Basic.SegmentedNameToString(name, sectionName);
  11772. *)
  11773. Name(source,sectionName);
  11774. source.SetReferenced(FALSE);
  11775. patchInfoPC := source.pc;
  11776. Size(source, 0);
  11777. END NewModuleInfo;
  11778. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11779. VAR
  11780. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11781. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11782. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11783. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11784. referenceSectionOffset : LONGINT;
  11785. name: Basic.SegmentedName; offset: LONGINT;
  11786. flags: SET;
  11787. BEGIN
  11788. NewModuleInfo();
  11789. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11790. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11791. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11792. ImportsArray(importSection);
  11793. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11794. CommandArray(commandsSection);
  11795. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11796. ExceptionArray(exceptionSection);
  11797. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11798. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11799. TypeInfoSection(typeInfoSection);
  11800. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11801. References(referenceSection);
  11802. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11803. ProcedureDescriptorArray(procTableSection, numberProcs);
  11804. IF ProtectModulesPointers THEN
  11805. name := "Heaps.AnyPtr";
  11806. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11807. (* set base pointer *)
  11808. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11809. END;
  11810. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11811. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11812. moduleSection := ModuleSection();
  11813. Info(moduleSection, "nextRoot*: RootObject");
  11814. Address(moduleSection,0);
  11815. Info(moduleSection, "next*: Module");
  11816. Address(moduleSection,0);
  11817. Info(moduleSection, "name*: Name");
  11818. Name(moduleSection,moduleName);
  11819. Info(moduleSection, "init, published: BOOLEAN");
  11820. Boolean(moduleSection,FALSE);
  11821. Boolean(moduleSection,FALSE);
  11822. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11823. Boolean(moduleSection,FALSE);
  11824. Boolean(moduleSection,FALSE);
  11825. Info(moduleSection, "refcnt*: LONGINT");
  11826. Longint(moduleSection,0);
  11827. Info(moduleSection, "sb*: ADDRESS");
  11828. Address(moduleSection,0);
  11829. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11830. Address(moduleSection,0);
  11831. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11832. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11833. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11834. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11835. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11836. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11837. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11838. Symbol(moduleSection,importSection,importSectionOffset,0);
  11839. Info(moduleSection, "procTable*: ProcTable");
  11840. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11841. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11842. Address(moduleSection,0);
  11843. Address(moduleSection,0);
  11844. Address(moduleSection,0);
  11845. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11846. Info(moduleSection, "export*: ExportDesc");
  11847. ExportDesc(moduleSection);
  11848. Info(moduleSection, "term*: TerminationHandler");
  11849. Address(moduleSection,0);
  11850. Info(moduleSection, "exTable*: ExceptionTable");
  11851. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11852. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11853. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11854. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11855. Info(moduleSection, "crc*: LONGINT");
  11856. patchCRC:= moduleSection.pc;
  11857. Longint(moduleSection, 0); (*! must be implemented *)
  11858. Info(moduleSection, "body*: ADDRESS");
  11859. Symbol(moduleSection, bodyProc, 0,0);
  11860. Info(moduleSection, "module flags");
  11861. flags := {};
  11862. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11863. Set( moduleSection, flags);
  11864. IF implementationVisitor.backend.cooperative THEN
  11865. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11866. Info(moduleSection, "monitor.owner");
  11867. Address(moduleSection,0);
  11868. Info(moduleSection, "monitor.nestingLevel");
  11869. Address(moduleSection,0);
  11870. Info(moduleSection, "monitor.blockedQueue");
  11871. Address(moduleSection,0); Address(moduleSection,0);
  11872. Info(moduleSection, "monitor.waitingQueue");
  11873. Address(moduleSection,0); Address(moduleSection,0);
  11874. Info(moduleSection, "monitor.waitingSentinel");
  11875. Address(moduleSection,0);
  11876. END;
  11877. END Module;
  11878. PROCEDURE PatchCRC(crc: LONGINT);
  11879. BEGIN
  11880. PatchLongint(ModuleSection(), patchCRC, crc);
  11881. END PatchCRC;
  11882. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11883. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: SIZE;
  11884. BEGIN
  11885. ArrayBlock(source,pc,"",FALSE);
  11886. Info(source, "pointer offsets array data");
  11887. IF scope IS SyntaxTree.RecordScope THEN
  11888. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11889. ELSIF scope IS SyntaxTree.CellScope THEN
  11890. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11891. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11892. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11893. WHILE variable # NIL DO
  11894. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11895. symbol := module.allSections.FindBySymbol(variable);
  11896. ASSERT(symbol # NIL);
  11897. Pointers(0,symbol, source,variable.type,numberPointers);
  11898. END;
  11899. variable := variable.nextVariable;
  11900. END;
  11901. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  11902. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11903. WHILE parameter # NIL DO
  11904. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11905. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  11906. END;
  11907. parameter := parameter.nextParameter;
  11908. END;
  11909. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  11910. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  11911. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  11912. IF implementationVisitor.backend.preciseGC THEN
  11913. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  11914. END;
  11915. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  11916. END;
  11917. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  11918. WHILE(variable # NIL) DO
  11919. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11920. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  11921. END;
  11922. variable := variable.nextVariable
  11923. END;
  11924. END;
  11925. PatchArray(source,pc,numberPointers);
  11926. END PointerArray;
  11927. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11928. VAR
  11929. name: Basic.SegmentedName;
  11930. section: IntermediateCode.Section;
  11931. BEGIN
  11932. ASSERT(implementationVisitor.newObjectFile);
  11933. Global.GetSymbolSegmentedName(symbol,name);
  11934. Basic.AppendToSegmentedName(name,suffix);
  11935. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  11936. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11937. Info(section, "HeapBlock");
  11938. Address(section,0); (* empty such that GC does not go on traversing *)
  11939. Info(section, suffix);
  11940. Address(section,0);
  11941. pc := section.pc;
  11942. RETURN section;
  11943. END SymbolSection;
  11944. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11945. VAR recordType: SyntaxTree.RecordType;
  11946. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11947. section: Sections.Section; cellType: SyntaxTree.CellType;
  11948. tdInfoOffset: LONGINT;
  11949. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  11950. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11951. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11952. sectionName: Basic.SectionName;
  11953. CONST MPO=-40000000H;
  11954. BEGIN
  11955. (*
  11956. TypeDesc* = POINTER TO RECORD
  11957. descSize: SIZE;
  11958. sentinel: LONGINT; (* = MPO-4 *)
  11959. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11960. flags*: SET;
  11961. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11962. name*: Name;
  11963. refsOffset: SIZE;
  11964. END;
  11965. *)
  11966. (* source := module.sections.FindByName(...) *)
  11967. Global.GetSymbolSegmentedName(td,name);
  11968. Basic.AppendToSegmentedName(name,".@Info");
  11969. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11970. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  11971. Address(source,0);
  11972. Info(source, "TypeDescriptor");
  11973. Address(source,0);
  11974. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11975. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11976. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  11977. Info(source, "type tag pointer");
  11978. Symbol( source, tag, offset, 0);
  11979. Info(source, "type flags");
  11980. flags := {};
  11981. IF isProtected THEN INCL(flags,31) END;
  11982. Set( source, flags);
  11983. Info(source, "pointer to module");
  11984. moduleSection := ModuleSection();
  11985. Symbol( source, moduleSection, moduleSection.pc,0);
  11986. Info(source, "type name");
  11987. i := 0;
  11988. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11989. (*
  11990. Global.GetSymbolSegmentedName(td,name);
  11991. Basic.SegmentedNameToString(name, sectionName);
  11992. *)
  11993. Name(source,sectionName);
  11994. source.SetReferenced(FALSE);
  11995. Size(source, 0);
  11996. RETURN source;
  11997. END NewTypeDescriptorInfo;
  11998. PROCEDURE NewTypeDescriptor;
  11999. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12000. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12001. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12002. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12003. CONST MPO=-40000000H;
  12004. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12005. VAR i: LONGINT;
  12006. PROCEDURE Td(record: SyntaxTree.RecordType);
  12007. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12008. BEGIN
  12009. IF record # NIL THEN
  12010. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12011. baseTD := record.typeDeclaration;
  12012. Global.GetSymbolSegmentedName(baseTD,name);
  12013. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12014. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12015. ELSE
  12016. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12017. END;
  12018. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12019. Symbol(source, tir, 0, offset);
  12020. IF reverse THEN Td(record.GetBaseRecord()) END;
  12021. END;
  12022. END Td;
  12023. BEGIN
  12024. Info(source, "tag table");
  12025. baseRecord := recordType;
  12026. i := 0;
  12027. WHILE baseRecord # NIL DO
  12028. INC(i);
  12029. baseRecord := baseRecord.GetBaseRecord();
  12030. END;
  12031. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12032. IF ~reverse THEN Td(recordType) END;
  12033. WHILE i < size DO
  12034. Address(source,0);
  12035. INC(i);
  12036. END;
  12037. IF reverse THEN Td(recordType) END;
  12038. END TdTable;
  12039. PROCEDURE MethodTable(reverse: BOOLEAN);
  12040. VAR i,methods: LONGINT;
  12041. BEGIN
  12042. Info(source, "method table");
  12043. IF recordType # NIL THEN
  12044. methods := recordType.recordScope.numberMethods;
  12045. IF reverse THEN
  12046. FOR i := methods-1 TO 0 BY -1 DO
  12047. procedure := recordType.recordScope.FindMethod(i);
  12048. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12049. NamedSymbol(source, name,procedure, 0,0);
  12050. END;
  12051. ELSE
  12052. FOR i := 0 TO methods-1 DO
  12053. procedure := recordType.recordScope.FindMethod(i);
  12054. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12055. NamedSymbol(source, name,procedure, 0,0);
  12056. END;
  12057. END;
  12058. END;
  12059. END MethodTable;
  12060. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12061. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12062. BEGIN
  12063. Info(source, "method table");
  12064. baseRecord := recordType;
  12065. WHILE baseRecord.baseType # NIL DO
  12066. baseRecord := baseRecord.GetBaseRecord ();
  12067. END;
  12068. GetRecordTypeName (baseRecord, name);
  12069. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12070. IF name = stackFrame THEN
  12071. start := 0;
  12072. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12073. baseRecord := recordType;
  12074. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12075. baseRecord := baseRecord.GetBaseRecord ();
  12076. END;
  12077. IF baseRecord # NIL THEN
  12078. GetRecordTypeName (baseRecord, name);
  12079. IF pointer & ~baseRecord.isObject THEN
  12080. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12081. END;
  12082. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12083. ELSIF recordType.isObject THEN
  12084. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12085. ELSIF pointer THEN
  12086. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12087. ELSE
  12088. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12089. END;
  12090. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12091. Symbol(source, tir, 0, 0);
  12092. start := 0;
  12093. baseRecord := recordType;
  12094. WHILE (baseRecord # NIL) DO
  12095. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12096. baseRecord := baseRecord.GetBaseRecord ();
  12097. END;
  12098. ELSE
  12099. (* explicit trace method: *)
  12100. procedure := recordType.recordScope.FindMethod(0);
  12101. IF ~procedure.isFinalizer THEN
  12102. Global.GetSymbolSegmentedName(procedure, name);
  12103. NamedSymbol(source, name,procedure, 0,0);
  12104. END;
  12105. start := 1;
  12106. END;
  12107. IF (name # stackFrame) & recordType.isObject THEN
  12108. baseRecord := recordType;
  12109. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12110. baseRecord := baseRecord.GetBaseRecord ();
  12111. END;
  12112. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12113. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12114. ELSE
  12115. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12116. END;
  12117. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12118. Symbol(source, tir, 0, 0);
  12119. END;
  12120. methods := recordType.recordScope.numberMethods;
  12121. FOR i := start TO methods-1 DO
  12122. procedure := recordType.recordScope.FindMethod(i);
  12123. IF ~procedure.isFinalizer THEN
  12124. Global.GetSymbolSegmentedName(procedure, name);
  12125. NamedSymbol(source, name,procedure, 0,0);
  12126. END;
  12127. END;
  12128. END CooperativeMethodTable;
  12129. BEGIN
  12130. Global.GetSymbolSegmentedName(td,name);
  12131. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12132. source.SetExported(IsExported(td));
  12133. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12134. IF implementationVisitor.backend.cooperative THEN
  12135. base := NIL;
  12136. baseRecord := recordType.GetBaseRecord();
  12137. IF baseRecord # NIL THEN
  12138. baseTD := baseRecord.typeDeclaration;
  12139. END;
  12140. IF ~recordType.isObject THEN
  12141. Info(source, "parent");
  12142. IF baseRecord # NIL THEN
  12143. Global.GetSymbolSegmentedName(baseTD,name);
  12144. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12145. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12146. ELSE
  12147. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12148. END;
  12149. Symbol(source, tir, 0, 0);
  12150. ELSE
  12151. Address(source,0);
  12152. END;
  12153. Info(source, "record size");
  12154. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12155. source.SetReferenced(FALSE);
  12156. CooperativeMethodTable(FALSE);
  12157. base := source;
  12158. Global.GetSymbolSegmentedName(td,name);
  12159. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12160. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12161. source.SetExported(IsExported(td));
  12162. source.SetReferenced(FALSE);
  12163. END;
  12164. Info(source, "parent");
  12165. IF baseRecord # NIL THEN
  12166. Global.GetSymbolSegmentedName(baseTD,name);
  12167. sym := baseTD;
  12168. IF ~recordType.isObject THEN
  12169. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12170. sym := NIL;
  12171. END;
  12172. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12173. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12174. ELSE
  12175. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12176. END;
  12177. Symbol(source, tir, 0, 0);
  12178. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12179. Address(source,0);
  12180. ELSE
  12181. IF recordType.isObject THEN
  12182. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12183. ELSE
  12184. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12185. END;
  12186. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12187. Symbol(source, tir, 0, 0);
  12188. END;
  12189. Info(source, "base record descriptor");
  12190. Symbol(source, base, 0, 0);
  12191. CooperativeMethodTable(TRUE);
  12192. source.SetReferenced(FALSE);
  12193. IF recordType.hasPointers THEN
  12194. IF ~HasExplicitTraceMethod (recordType) THEN
  12195. implementationVisitor.CreateTraceMethod(recordType);
  12196. END;
  12197. implementationVisitor.CreateResetProcedure(recordType);
  12198. implementationVisitor.CreateAssignProcedure(recordType);
  12199. END;
  12200. ELSIF ~simple THEN
  12201. (*
  12202. MethodEnd = MPO
  12203. ---
  12204. methods (# methods)
  12205. ---
  12206. tags (16)
  12207. ---
  12208. TypeDesc = TypeInfoAdr
  12209. ---
  12210. td adr ---> rec size
  12211. ----
  12212. pointer offsets
  12213. ----
  12214. (padding)
  12215. -----
  12216. empty [2 addresses aligned]
  12217. empty
  12218. empty
  12219. numPtrs
  12220. ---
  12221. pointer offsets
  12222. ---
  12223. *)
  12224. Info(source, "MethodEnd = MPO");
  12225. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12226. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12227. MethodTable(TRUE);
  12228. TdTable(TypeTags, TRUE);
  12229. Info(source, "type descriptor info pointer");
  12230. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12231. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12232. IF (cellType # NIL) THEN
  12233. IF cellType.sizeInBits < 0 THEN
  12234. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12235. END;
  12236. Info(source, "cell size");
  12237. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12238. ELSE
  12239. Info(source, "record size");
  12240. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12241. END;
  12242. Info(source, "pointer offsets pointer");
  12243. padding := 1- source.pc MOD 2;
  12244. Symbol(source, source, source.pc+1+padding,0);
  12245. IF padding >0 THEN
  12246. Info(source, "padding");
  12247. FOR i := 1 TO padding DO Address(source,0) END;
  12248. END;
  12249. IF cellType # NIL THEN
  12250. PointerArray(source, cellType.cellScope, numberPointers);
  12251. ELSE
  12252. PointerArray(source, recordType.recordScope, numberPointers);
  12253. END;
  12254. ELSE
  12255. (*
  12256. simple:
  12257. td adr --> size
  12258. tag(1)
  12259. tag(2)
  12260. tag(3)
  12261. methods ->
  12262. *)
  12263. Info(source, "record size");
  12264. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12265. TdTable(TypeTags, FALSE);
  12266. MethodTable(FALSE);
  12267. source.SetReferenced(FALSE);
  12268. END;
  12269. END NewTypeDescriptor;
  12270. BEGIN
  12271. x := x.resolved;
  12272. IF (x IS SyntaxTree.PointerType) THEN
  12273. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12274. END;
  12275. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12276. recordType := x(SyntaxTree.RecordType);
  12277. td := x.typeDeclaration;
  12278. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12279. ASSERT(td # NIL);
  12280. section := module.allSections.FindBySymbol(td); (* TODO *)
  12281. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12282. IF implementationVisitor.newObjectFile THEN
  12283. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12284. NewTypeDescriptor
  12285. END;
  12286. ELSE
  12287. (* data section in intermediate code *)
  12288. Global.GetSymbolSegmentedName(td,name);
  12289. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12290. Basic.SuffixSegmentedName (name, module.module.name);
  12291. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12292. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12293. tir.Emit(Data(Basic.invalidPosition,op));
  12294. END;
  12295. END;
  12296. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12297. cellType := x(SyntaxTree.CellType);
  12298. td := x.typeDeclaration;
  12299. section := module.allSections.FindBySymbol(td); (* TODO *)
  12300. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12301. IF implementationVisitor.newObjectFile THEN
  12302. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12303. NewTypeDescriptor
  12304. END;
  12305. END;
  12306. END;
  12307. END
  12308. END CheckTypeDeclaration
  12309. END MetaDataGenerator;
  12310. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12311. VAR
  12312. trace-: BOOLEAN;
  12313. traceString-: SyntaxTree.IdentifierString;
  12314. traceModuleName-: SyntaxTree.IdentifierString;
  12315. newObjectFile-: BOOLEAN;
  12316. profile-: BOOLEAN;
  12317. noRuntimeChecks: BOOLEAN;
  12318. simpleMetaData-: BOOLEAN;
  12319. noAsserts: BOOLEAN;
  12320. optimize-: BOOLEAN;
  12321. cooperative-: BOOLEAN;
  12322. preregisterStatic-: BOOLEAN;
  12323. dump-: Basic.Writer;
  12324. cellsAreObjects: BOOLEAN;
  12325. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12326. experiment: BOOLEAN;
  12327. PROCEDURE &InitIntermediateBackend*;
  12328. BEGIN
  12329. simpleMetaData := FALSE;
  12330. newObjectFile := FALSE;
  12331. InitBackend;
  12332. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12333. SetTraceModuleName(DefaultTraceModuleName);
  12334. END InitIntermediateBackend;
  12335. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12336. VAR
  12337. declarationVisitor: DeclarationVisitor;
  12338. implementationVisitor: ImplementationVisitor;
  12339. module: Sections.Module;
  12340. name, platformName: SyntaxTree.IdentifierString;
  12341. meta: MetaDataGenerator;
  12342. crc: CRC.CRC32Stream;
  12343. BEGIN
  12344. ResetError;
  12345. Global.GetSymbolName(x,name);
  12346. NEW(module,x,system); (* backend structures *)
  12347. Global.GetModuleName(x, name);
  12348. module.SetModuleName(name);
  12349. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12350. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12351. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12352. declarationVisitor.Module(x,module);
  12353. IF newObjectFile & ~meta.simple THEN
  12354. meta.Module(implementationVisitor.moduleBodySection);
  12355. END;
  12356. GetDescription(platformName);
  12357. module.SetPlatformName(platformName);
  12358. IF newObjectFile THEN
  12359. NEW(crc);
  12360. module.allSections.WriteRaw(crc);
  12361. crc.Update;
  12362. meta.PatchCRC(crc.GetCRC());
  12363. END;
  12364. RETURN module
  12365. END GenerateIntermediate;
  12366. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12367. BEGIN RETURN TRUE
  12368. END SupportedImmediate;
  12369. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12370. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12371. END ProcessSyntaxTreeModule;
  12372. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12373. VAR
  12374. result: Sections.Module;
  12375. traceName: Basic.MessageString;
  12376. BEGIN
  12377. ASSERT(intermediateCodeModule IS Sections.Module);
  12378. result := intermediateCodeModule(Sections.Module);
  12379. IF trace THEN
  12380. traceName := "intermediate code trace: ";
  12381. Strings.Append(traceName,traceString);
  12382. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12383. IF (traceString="") OR (traceString="*") THEN
  12384. result.Dump(dump);
  12385. dump.Update
  12386. ELSE
  12387. Sections.DumpFiltered(dump, result, traceString);
  12388. END
  12389. END;
  12390. RETURN result
  12391. END ProcessIntermediateCodeModule;
  12392. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12393. BEGIN instructionSet := "Intermediate";
  12394. END GetDescription;
  12395. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12396. BEGIN
  12397. SELF.newObjectFile := newObjectFile;
  12398. SELF.simpleMetaData := simpleMetaData;
  12399. END SetNewObjectFile;
  12400. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12401. BEGIN COPY(name, traceModuleName)
  12402. END SetTraceModuleName;
  12403. PROCEDURE DefineOptions(options: Options.Options);
  12404. BEGIN
  12405. DefineOptions^(options);
  12406. options.Add(0X,"trace",Options.String);
  12407. options.Add(0X,"runtime",Options.String);
  12408. options.Add(0X,"newObjectFile",Options.Flag);
  12409. options.Add(0X,"traceModule",Options.String);
  12410. options.Add(0X,"profile",Options.Flag);
  12411. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12412. options.Add(0X,"noAsserts",Options.Flag);
  12413. options.Add(0X,"metaData",Options.String);
  12414. options.Add('o',"optimize", Options.Flag);
  12415. options.Add(0X,"preregisterStatic", Options.Flag);
  12416. options.Add(0X,"cellsAreObjects", Options.Flag);
  12417. options.Add(0X,"preciseGC", Options.Flag);
  12418. options.Add(0X,"trackLeave", Options.Flag);
  12419. options.Add(0X,"writeBarriers", Options.Flag);
  12420. options.Add(0X,"experiment", Options.Flag);
  12421. END DefineOptions;
  12422. PROCEDURE GetOptions(options: Options.Options);
  12423. VAR name,string: SyntaxTree.IdentifierString;
  12424. BEGIN
  12425. GetOptions^(options);
  12426. trace := options.GetString("trace",traceString);
  12427. profile := options.GetFlag("profile");
  12428. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12429. noAsserts := options.GetFlag("noAsserts");
  12430. cooperative := options.GetFlag("cooperative");
  12431. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12432. IF cooperative THEN
  12433. SetRuntimeModuleName("CPU") END
  12434. END;
  12435. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12436. simpleMetaData := TRUE
  12437. END;
  12438. IF options.GetString("metaData",string) THEN
  12439. IF string = "simple" THEN simpleMetaData := TRUE
  12440. ELSIF string ="full" THEN simpleMetaData := FALSE
  12441. END;
  12442. END;
  12443. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12444. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12445. optimize := options.GetFlag("optimize");
  12446. preregisterStatic := options.GetFlag("preregisterStatic");
  12447. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12448. preciseGC := options.GetFlag("preciseGC");
  12449. trackLeave := options.GetFlag("trackLeave");
  12450. writeBarriers := options.GetFlag("writeBarriers");
  12451. experiment := options.GetFlag("experiment");
  12452. END GetOptions;
  12453. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12454. BEGIN RETURN SymbolFileFormat.Get()
  12455. END DefaultSymbolFileFormat;
  12456. END IntermediateBackend;
  12457. (* ----------------------------------- register allocation ------------------------------------- *)
  12458. (* register mapping scheme
  12459. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12460. spill offset
  12461. part(n) --> ticket <--> physical register
  12462. spill offset
  12463. *)
  12464. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12465. emptyOperand: IntermediateCode.Operand;
  12466. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12467. statCoopResetVariables: LONGINT;
  12468. statCoopModifyAssignments: LONGINT;
  12469. modifyAssignmentsPC : LONGINT;
  12470. statCoopNilCheck: LONGINT;
  12471. statCoopSwitch: LONGINT;
  12472. statCoopAssignProcedure: LONGINT;
  12473. statCoopTraceMethod: LONGINT;
  12474. statCoopResetProcedure: LONGINT;
  12475. statCoopTraceModule: LONGINT;
  12476. PROCEDURE ResetStatistics*;
  12477. BEGIN
  12478. statCoopResetVariables := 0;
  12479. statCoopModifyAssignments := 0;
  12480. statCoopNilCheck:= 0;
  12481. statCoopSwitch:= 0;
  12482. statCoopAssignProcedure:= 0;
  12483. statCoopTraceMethod:= 0;
  12484. statCoopResetProcedure:= 0;
  12485. statCoopTraceModule:= 0;
  12486. END ResetStatistics;
  12487. PROCEDURE Statistics*;
  12488. BEGIN
  12489. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12490. TRACE(statCoopNilCheck, statCoopSwitch);
  12491. TRACE(statCoopAssignProcedure,
  12492. statCoopTraceMethod,
  12493. statCoopResetProcedure,
  12494. statCoopTraceModule)
  12495. END Statistics;
  12496. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12497. VAR h: LONGINT;
  12498. BEGIN
  12499. WHILE b # 0 DO
  12500. h := a MOD b;
  12501. a := b;
  12502. b := h;
  12503. END;
  12504. RETURN a
  12505. END GCD;
  12506. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12507. BEGIN
  12508. RETURN a*b DIV GCD(a,b)
  12509. END SCM;
  12510. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12511. BEGIN
  12512. (*TRACE(a,b);*)
  12513. IF a = 0 THEN RETURN b
  12514. ELSIF b = 0 THEN RETURN a
  12515. ELSE RETURN SCM(a,b)
  12516. END;
  12517. END CommonAlignment;
  12518. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12519. BEGIN
  12520. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12521. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12522. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12523. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12524. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12525. END
  12526. END PassBySingleReference;
  12527. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12528. BEGIN
  12529. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12530. END PassInRegister;
  12531. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12532. VAR new: RegisterEntry;
  12533. BEGIN
  12534. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12535. IF queue = NIL THEN
  12536. queue := new
  12537. ELSE
  12538. new.next := queue;
  12539. IF queue#NIL THEN queue.prev := new END;
  12540. queue := new
  12541. END;
  12542. END AddRegisterEntry;
  12543. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12544. VAR this: RegisterEntry;
  12545. BEGIN
  12546. this := queue;
  12547. WHILE (this # NIL) & (this.register # register) DO
  12548. this := this.next;
  12549. END;
  12550. IF this = NIL THEN
  12551. RETURN FALSE
  12552. END;
  12553. ASSERT(this # NIL);
  12554. IF this = queue THEN queue := queue.next END;
  12555. IF this.prev # NIL THEN this.prev.next := this.next END;
  12556. IF this.next # NIL THEN this.next.prev := this.prev END;
  12557. RETURN TRUE
  12558. END RemoveRegisterEntry;
  12559. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12560. BEGIN ASSERT(cond);
  12561. END Assert;
  12562. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12563. BEGIN
  12564. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12565. END ReusableRegister;
  12566. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12567. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12568. BEGIN
  12569. procedure := moduleScope.bodyProcedure;
  12570. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12571. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12572. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12573. procedure.SetScope(moduleScope);
  12574. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12575. procedure.SetAccess(SyntaxTree.Hidden);
  12576. moduleScope.SetBodyProcedure(procedure);
  12577. moduleScope.AddProcedure(procedure);
  12578. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12579. END;
  12580. END EnsureBodyProcedure;
  12581. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12582. VAR import: SyntaxTree.Import;
  12583. selfName: SyntaxTree.IdentifierString;
  12584. module: SyntaxTree.Module;
  12585. BEGIN
  12586. scope.ownerModule.GetName(selfName);
  12587. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12588. module := scope.ownerModule
  12589. ELSE
  12590. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12591. IF import = NIL THEN
  12592. RETURN NIL
  12593. ELSIF import.module = NIL THEN
  12594. RETURN NIL
  12595. ELSE module := import.module
  12596. END;
  12597. END;
  12598. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12599. END GetSymbol;
  12600. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12601. BEGIN
  12602. op.mode := mode;
  12603. IntermediateCode.InitOperand(op.op);
  12604. IntermediateCode.InitOperand(op.tag);
  12605. IntermediateCode.InitOperand(op.extra);
  12606. op.dimOffset := 0;
  12607. END InitOperand;
  12608. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12609. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12610. BEGIN RETURN IntermediateCode.GetType(system, type)
  12611. END GetType;
  12612. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12613. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12614. BEGIN
  12615. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12616. (*
  12617. UniqueId(name,module,name,adr);
  12618. *)
  12619. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12620. constant.SetValue(value);
  12621. constant.SetAccess(SyntaxTree.Hidden);
  12622. module.moduleScope.AddConstant(constant);
  12623. constant.SetScope(module.moduleScope);
  12624. RETURN constant
  12625. END BuildConstant;
  12626. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12627. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12628. BEGIN
  12629. variable := scope.firstVariable;
  12630. WHILE variable # NIL DO
  12631. IF variable.NeedsTrace() THEN
  12632. RETURN TRUE;
  12633. END;
  12634. variable := variable.nextVariable;
  12635. END;
  12636. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12637. WHILE parameter # NIL DO
  12638. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12639. RETURN TRUE;
  12640. END;
  12641. parameter := parameter.nextParameter;
  12642. END;
  12643. RETURN FALSE;
  12644. END HasPointers;
  12645. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12646. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) OR (parameter.type.resolved IS SyntaxTree.MathArrayType));
  12647. END IsVariableParameter;
  12648. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12649. VAR parameter: SyntaxTree.Parameter;
  12650. BEGIN
  12651. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12652. WHILE parameter # NIL DO
  12653. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12654. IF parameter.movable THEN RETURN TRUE END;
  12655. parameter := parameter.nextParameter;
  12656. END;
  12657. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12658. END HasVariableParameters;
  12659. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12660. BEGIN
  12661. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12662. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12663. END HasExplicitTraceMethod;
  12664. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12665. BEGIN
  12666. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12667. IF (expression IS SyntaxTree.IntegerValue) THEN
  12668. val := expression(SyntaxTree.IntegerValue).value;
  12669. RETURN TRUE
  12670. ELSE
  12671. RETURN FALSE
  12672. END;
  12673. END IsIntegerConstant;
  12674. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12675. BEGIN
  12676. IF val <= 0 THEN RETURN FALSE END;
  12677. exp := 0;
  12678. WHILE ~ODD(val) DO
  12679. val := val DIV 2;
  12680. INC(exp)
  12681. END;
  12682. RETURN val = 1
  12683. END PowerOf2;
  12684. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12685. VAR procedure: SyntaxTree.Procedure;
  12686. BEGIN
  12687. procedure := record.recordScope.constructor;
  12688. IF procedure = NIL THEN
  12689. record := record.GetBaseRecord();
  12690. IF record # NIL THEN
  12691. procedure := GetConstructor(record)
  12692. END;
  12693. END;
  12694. RETURN procedure;
  12695. END GetConstructor;
  12696. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12697. BEGIN
  12698. value := SHORT(op.intValue);
  12699. RETURN op.mode = IntermediateCode.ModeImmediate;
  12700. END IsIntegerImmediate;
  12701. (** whether a type strictily is a pointer to record or object type
  12702. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12703. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12704. BEGIN
  12705. IF type = NIL THEN
  12706. RETURN FALSE
  12707. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12708. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12709. ELSE
  12710. RETURN FALSE
  12711. END
  12712. END IsStrictlyPointerToRecord;
  12713. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12714. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12715. END IsUnsafePointer;
  12716. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12717. BEGIN type := type.resolved;
  12718. IF type IS SyntaxTree.PointerType THEN
  12719. type := type(SyntaxTree.PointerType).pointerBase;
  12720. type := type.resolved;
  12721. IF type IS SyntaxTree.RecordType THEN
  12722. recordType := type(SyntaxTree.RecordType);
  12723. RETURN TRUE
  12724. ELSE
  12725. RETURN FALSE
  12726. END
  12727. ELSIF type IS SyntaxTree.RecordType THEN
  12728. recordType := type(SyntaxTree.RecordType);
  12729. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12730. ELSIF type IS SyntaxTree.ObjectType THEN
  12731. RETURN TRUE
  12732. ELSIF type IS SyntaxTree.AnyType THEN
  12733. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12734. ELSE
  12735. RETURN FALSE
  12736. END;
  12737. END IsPointerToRecord;
  12738. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12739. BEGIN
  12740. type := type.resolved;
  12741. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12742. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12743. END IsArrayOfSystemByte;
  12744. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12745. BEGIN
  12746. IF type = NIL THEN RETURN FALSE END;
  12747. type := type.resolved;
  12748. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12749. END IsOpenArray;
  12750. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12751. BEGIN
  12752. IF type = NIL THEN RETURN FALSE END;
  12753. type := type.resolved;
  12754. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12755. END IsSemiDynamicArray;
  12756. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12757. BEGIN
  12758. IF type = NIL THEN RETURN FALSE END;
  12759. type := type.resolved;
  12760. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12761. END IsStaticArray;
  12762. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12763. VAR size: LONGINT;
  12764. BEGIN
  12765. size := 1;
  12766. WHILE (IsStaticArray(type)) DO
  12767. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12768. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12769. END;
  12770. RETURN size;
  12771. END StaticArrayNumElements;
  12772. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12773. BEGIN
  12774. WHILE (IsStaticArray(type)) DO
  12775. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12776. END;
  12777. RETURN type;
  12778. END StaticArrayBaseType;
  12779. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12780. BEGIN
  12781. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12782. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12783. END;
  12784. RETURN type;
  12785. END ArrayBaseType;
  12786. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12787. BEGIN
  12788. IF type = NIL THEN RETURN FALSE END;
  12789. type := type.resolved;
  12790. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12791. END IsDelegate;
  12792. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12793. VAR i: LONGINT;
  12794. BEGIN
  12795. i := 0; type := type.resolved;
  12796. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12797. INC(i);
  12798. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12799. END;
  12800. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12801. INC(i);
  12802. type := type(SyntaxTree.MathArrayType).arrayBase;
  12803. IF type # NIL THEN type := type.resolved END;
  12804. END;
  12805. RETURN i
  12806. END DynamicDim;
  12807. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12808. BEGIN
  12809. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12810. type := type(SyntaxTree.ArrayType).arrayBase;
  12811. END;
  12812. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12813. type := type(SyntaxTree.MathArrayType).arrayBase;
  12814. END;
  12815. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12816. END StaticSize;
  12817. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12818. BEGIN
  12819. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12820. END IsImmediate;
  12821. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12822. BEGIN
  12823. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12824. END IsAddress;
  12825. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12826. BEGIN
  12827. RETURN (x.mode = IntermediateCode.ModeRegister);
  12828. END IsRegister;
  12829. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12830. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12831. BEGIN
  12832. typeDeclaration := recordType.typeDeclaration;
  12833. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12834. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12835. END GetRecordTypeName;
  12836. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12837. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12838. BEGIN
  12839. parSize := 0;
  12840. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12841. parameter := procedureType.returnParameter;
  12842. INC(parSize,system.SizeOfParameter(parameter));
  12843. parSize := parSize + (-parSize) MOD system.addressSize;
  12844. END;
  12845. parameter :=procedureType.lastParameter;
  12846. WHILE (parameter # NIL) DO
  12847. INC(parSize,system.SizeOfParameter(parameter));
  12848. parSize := parSize + (-parSize) MOD system.addressSize;
  12849. parameter := parameter.prevParameter;
  12850. END;
  12851. IF procedureType.selfParameter # NIL THEN
  12852. parameter := procedureType.selfParameter;
  12853. INC(parSize,system.SizeOfParameter(parameter));
  12854. parSize := parSize + (-parSize) MOD system.addressSize;
  12855. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12856. END; (* method => self pointer *)
  12857. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12858. RETURN ToMemoryUnits(system,parSize)
  12859. END ParametersSize;
  12860. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12861. BEGIN
  12862. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12863. END IsNested;
  12864. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12865. BEGIN
  12866. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12867. scope := scope.outerScope;
  12868. END;
  12869. RETURN scope # NIL;
  12870. END InCellScope;
  12871. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12872. BEGIN
  12873. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12874. RETURN 0
  12875. ELSE
  12876. *)
  12877. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12878. (*END;*)
  12879. END ProcedureParametersSize;
  12880. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12881. VAR dataUnit: LONGINT;
  12882. BEGIN dataUnit := system.dataUnit;
  12883. ASSERT(size MOD system.dataUnit = 0);
  12884. RETURN size DIV system.dataUnit
  12885. END ToMemoryUnits;
  12886. PROCEDURE Get*(): Backend.Backend;
  12887. VAR backend: IntermediateBackend;
  12888. BEGIN NEW(backend); RETURN backend
  12889. END Get;
  12890. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  12891. VAR instruction: IntermediateCode.Instruction;
  12892. BEGIN
  12893. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12894. RETURN instruction
  12895. END Nop;
  12896. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12897. VAR instruction: IntermediateCode.Instruction;
  12898. BEGIN
  12899. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12900. RETURN instruction
  12901. END Mov;
  12902. (* like Mov but ensures that no new register will be allocated for dest *)
  12903. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12904. VAR instruction: IntermediateCode.Instruction;
  12905. BEGIN
  12906. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12907. RETURN instruction
  12908. END MovReplace;
  12909. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12910. VAR instruction: IntermediateCode.Instruction;
  12911. BEGIN
  12912. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12913. RETURN instruction
  12914. END Conv;
  12915. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12916. BEGIN
  12917. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12918. END SysvABI;
  12919. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12920. BEGIN
  12921. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12922. END SysvABIorWINAPI;
  12923. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12924. VAR instruction: IntermediateCode.Instruction;
  12925. BEGIN
  12926. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12927. RETURN instruction
  12928. END Call;
  12929. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  12930. VAR op1, op2, op3: IntermediateCode.Operand;
  12931. VAR instruction: IntermediateCode.Instruction;
  12932. BEGIN
  12933. IntermediateCode.InitNumber(op1,pcOffset);
  12934. IntermediateCode.InitNumber(op2,callingConvention);
  12935. IntermediateCode.InitNumber(op3,unwind);
  12936. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  12937. RETURN instruction
  12938. END Exit;
  12939. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12940. VAR instruction: IntermediateCode.Instruction;
  12941. BEGIN
  12942. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12943. RETURN instruction
  12944. END Return;
  12945. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12946. VAR instruction: IntermediateCode.Instruction;
  12947. BEGIN
  12948. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12949. RETURN instruction
  12950. END Result;
  12951. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  12952. VAR op1: IntermediateCode.Operand;
  12953. VAR instruction: IntermediateCode.Instruction;
  12954. BEGIN
  12955. IntermediateCode.InitNumber(op1,nr);
  12956. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12957. RETURN instruction
  12958. END Trap;
  12959. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12960. VAR instruction: IntermediateCode.Instruction;
  12961. BEGIN
  12962. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12963. RETURN instruction
  12964. END Br;
  12965. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12966. VAR instruction: IntermediateCode.Instruction;
  12967. BEGIN
  12968. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12969. RETURN instruction
  12970. END Breq;
  12971. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12972. VAR instruction: IntermediateCode.Instruction;
  12973. BEGIN
  12974. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12975. RETURN instruction
  12976. END Brne;
  12977. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12978. VAR instruction: IntermediateCode.Instruction;
  12979. BEGIN
  12980. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12981. RETURN instruction
  12982. END Brge;
  12983. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12984. VAR instruction: IntermediateCode.Instruction;
  12985. BEGIN
  12986. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12987. RETURN instruction
  12988. END Brlt;
  12989. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12990. VAR instruction: IntermediateCode.Instruction;
  12991. BEGIN
  12992. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12993. RETURN instruction
  12994. END Pop;
  12995. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12996. VAR instruction: IntermediateCode.Instruction;
  12997. BEGIN
  12998. ASSERT(op.mode # IntermediateCode.Undefined);
  12999. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13000. RETURN instruction
  13001. END Push;
  13002. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13003. VAR instruction: IntermediateCode.Instruction;
  13004. BEGIN
  13005. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13006. RETURN instruction
  13007. END Neg;
  13008. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13009. VAR instruction: IntermediateCode.Instruction;
  13010. BEGIN
  13011. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13012. RETURN instruction
  13013. END Not;
  13014. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13015. VAR instruction: IntermediateCode.Instruction;
  13016. BEGIN
  13017. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13018. RETURN instruction
  13019. END Abs;
  13020. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13021. VAR instruction: IntermediateCode.Instruction;
  13022. BEGIN
  13023. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13024. ASSERT(~IsImmediate(instruction.op1));
  13025. RETURN instruction
  13026. END Mul;
  13027. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13028. VAR instruction: IntermediateCode.Instruction;
  13029. BEGIN
  13030. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13031. RETURN instruction
  13032. END Div;
  13033. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13034. VAR instruction: IntermediateCode.Instruction;
  13035. BEGIN
  13036. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13037. RETURN instruction
  13038. END Mod;
  13039. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13040. VAR instruction: IntermediateCode.Instruction;
  13041. BEGIN
  13042. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13043. RETURN instruction
  13044. END Sub;
  13045. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13046. VAR instruction: IntermediateCode.Instruction;
  13047. BEGIN
  13048. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13049. RETURN instruction
  13050. END Add;
  13051. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13052. VAR instruction: IntermediateCode.Instruction;
  13053. BEGIN
  13054. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13055. RETURN instruction
  13056. END And;
  13057. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13058. VAR instruction: IntermediateCode.Instruction;
  13059. BEGIN
  13060. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13061. RETURN instruction
  13062. END Or;
  13063. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13064. VAR instruction: IntermediateCode.Instruction;
  13065. BEGIN
  13066. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13067. RETURN instruction
  13068. END Xor;
  13069. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13070. VAR instruction: IntermediateCode.Instruction;
  13071. BEGIN
  13072. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13073. RETURN instruction
  13074. END Shl;
  13075. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13076. VAR instruction: IntermediateCode.Instruction;
  13077. BEGIN
  13078. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13079. RETURN instruction
  13080. END Shr;
  13081. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13082. VAR instruction: IntermediateCode.Instruction;
  13083. BEGIN
  13084. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13085. RETURN instruction
  13086. END Rol;
  13087. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13088. VAR instruction: IntermediateCode.Instruction;
  13089. BEGIN
  13090. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13091. RETURN instruction
  13092. END Ror;
  13093. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13094. VAR instruction: IntermediateCode.Instruction;
  13095. BEGIN
  13096. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13097. RETURN instruction
  13098. END Cas;
  13099. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13100. VAR instruction: IntermediateCode.Instruction;
  13101. BEGIN
  13102. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13103. RETURN instruction
  13104. END Copy;
  13105. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13106. VAR instruction: IntermediateCode.Instruction;
  13107. BEGIN
  13108. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13109. RETURN instruction
  13110. END Fill;
  13111. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13112. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13113. BEGIN
  13114. string := IntermediateCode.String(s);
  13115. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13116. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13117. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13118. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13119. RETURN instruction
  13120. END Asm;
  13121. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13122. VAR instruction: IntermediateCode.Instruction;
  13123. BEGIN
  13124. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13125. RETURN instruction
  13126. END Data;
  13127. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13128. VAR instruction: IntermediateCode.Instruction;
  13129. BEGIN
  13130. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13131. IntermediateCode.SetSubType(instruction, subtype);
  13132. RETURN instruction
  13133. END SpecialInstruction;
  13134. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13135. VAR op1: IntermediateCode.Operand;
  13136. VAR instruction: IntermediateCode.Instruction;
  13137. BEGIN
  13138. (*! generate a warning if size exceeds a certain limit *)
  13139. (*
  13140. ASSERT(bytes < 1000000); (* sanity check *)
  13141. *)
  13142. ASSERT(0 <= units); (* sanity check *)
  13143. IntermediateCode.InitNumber(op1,units);
  13144. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13145. RETURN instruction
  13146. END Reserve;
  13147. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13148. VAR op1: IntermediateCode.Operand;
  13149. VAR instruction: IntermediateCode.Instruction;
  13150. BEGIN
  13151. IntermediateCode.InitNumber(op1,position.start);
  13152. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13153. RETURN instruction
  13154. END LabelInstruction;
  13155. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13156. VAR pc: LONGINT;
  13157. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13158. BEGIN
  13159. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13160. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13161. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13162. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13163. IF instr.op1.type.form = IntermediateCode.Float THEN
  13164. RETURN instr.op1.floatValue = op.floatValue
  13165. ELSE
  13166. RETURN instr.op1.intValue = op.intValue
  13167. END;
  13168. END ProvidesValue;
  13169. BEGIN
  13170. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13171. pc := 0;
  13172. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13173. INC(pc);
  13174. END;
  13175. IF pc = data.pc THEN
  13176. data.Emit(Data(Basic.invalidPosition,vop));
  13177. END;
  13178. RETURN pc
  13179. END EnterImmediate;
  13180. PROCEDURE Init;
  13181. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13182. BEGIN
  13183. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13184. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13185. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13186. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13187. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13188. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13189. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13190. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13191. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13192. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13193. IntermediateCode.InitOperand(emptyOperand);
  13194. FOR i := 0 TO NumberSystemCalls-1 DO
  13195. name := "@SystemCall";
  13196. Basic.AppendNumber(name,i);
  13197. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13198. END;
  13199. END Init;
  13200. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13201. BEGIN
  13202. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13203. END IsExported;
  13204. BEGIN
  13205. Init;
  13206. END FoxIntermediateBackend.
  13207. Compiler.Compile FoxIntermediateBackend.Mod ~
  13208. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13209. # StaticLinker.Link --fileFormat=PE32 --fileName=A2Z.exe --extension=GofW --displacement=401000H --path="/temp/obg/" Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13210. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13211. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13212. FSTools.CloseFiles A2Z.exe ~
  13213. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13214. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13215. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13216. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13217. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13218. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13219. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13220. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13221. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13222. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13223. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod