FoxIntermediateBackend.Mod 569 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560
  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 ("@StackDescriptor"));
  1357. ELSE
  1358. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1359. END;
  1360. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1361. IntermediateCode.AddOffset(op1, 1);
  1362. Emit(Push(Basic.invalidPosition,op1));
  1363. Emit(Mov(Basic.invalidPosition,fp, sp));
  1364. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1365. NEW(call, section);
  1366. NEW(nocall, section);
  1367. reg := NewRegisterOperand(addressType);
  1368. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1369. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1370. BrltL(call, sp, reg);
  1371. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1372. BrgeL(nocall, sp, op2);
  1373. call.Resolve(section.pc);
  1374. Emit(Push(Basic.invalidPosition, reg));
  1375. ReleaseIntermediateOperand(reg);
  1376. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1377. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1378. Emit(Push(Basic.invalidPosition, op2));
  1379. CallThis(position, "Activities","ExpandStack",2);
  1380. Emit(Result(Basic.invalidPosition, sp));
  1381. nocall.Resolve(section.pc);
  1382. END;
  1383. ELSE
  1384. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1385. Emit(Push(Basic.invalidPosition, one)) ;
  1386. procedureType.SetParametersOffset(1);
  1387. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1388. END;
  1389. Emit(Mov(Basic.invalidPosition, fp, sp));
  1390. END;
  1391. END;
  1392. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1393. SELF.section := prevSection;
  1394. dump := prevDump;
  1395. END EmitEnter;
  1396. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1397. VAR op1,op2: IntermediateCode.Operand;
  1398. VAR instruction: IntermediateCode.Instruction;
  1399. BEGIN
  1400. IntermediateCode.InitNumber(op1,callconv);
  1401. IntermediateCode.InitNumber(op2,varSize);
  1402. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1403. RETURN instruction
  1404. END Enter;
  1405. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1406. VAR op1: IntermediateCode.Operand;
  1407. VAR instruction: IntermediateCode.Instruction;
  1408. BEGIN
  1409. IntermediateCode.InitNumber(op1,callconv);
  1410. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1411. RETURN instruction
  1412. END Leave;
  1413. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1414. VAR prevSection: IntermediateCode.Section;
  1415. VAR op2, size: IntermediateCode.Operand;
  1416. VAR body: SyntaxTree.Body;
  1417. BEGIN
  1418. prevSection := SELF.section;
  1419. SELF.section := section;
  1420. Emit(Leave(position, callconv));
  1421. IF procedure # NIL THEN
  1422. body := procedure.procedureScope.body;
  1423. ELSE
  1424. body := NIL;
  1425. END;
  1426. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1427. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1428. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1429. Emit(Add(position, sp, fp, op2));
  1430. ELSE
  1431. Emit(Mov(position, sp, fp));
  1432. END;
  1433. Emit(Pop(position, fp));
  1434. END;
  1435. SELF.section := prevSection;
  1436. END EmitLeave;
  1437. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1438. VAR m: SymbolMap;
  1439. BEGIN
  1440. position := x.position;
  1441. IF currentIsInline THEN
  1442. m := currentMapper.Get(x);
  1443. IF m # NIL THEN
  1444. (*
  1445. Printout.Info("mapping from", x);
  1446. Printout.Info("mapping to ", m.to);
  1447. *)
  1448. m.to.Accept(SELF);
  1449. op := result;
  1450. IF m.tag # NIL THEN
  1451. ReleaseIntermediateOperand(result.tag);
  1452. m.tag.Accept(SELF);
  1453. op.tag := result.op;
  1454. ReleaseIntermediateOperand(result.tag);
  1455. END;
  1456. RETURN
  1457. END;
  1458. END;
  1459. x.Accept(SELF);
  1460. op := result;
  1461. END Symbol;
  1462. PROCEDURE Expression(x: SyntaxTree.Expression);
  1463. BEGIN
  1464. position := x.position;
  1465. constantDeclaration := NIL;
  1466. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1467. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1468. END;
  1469. IF x.resolved # NIL THEN
  1470. x.resolved.Accept(SELF)
  1471. ELSE
  1472. x.Accept(SELF)
  1473. END;
  1474. (* check this, was commented out in ActiveCells3 *)
  1475. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1476. Error(x.position, "unsupported modifier");
  1477. END;
  1478. END Expression;
  1479. (*
  1480. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1481. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1482. BEGIN
  1483. temporaries.GetUsage(current);
  1484. FOR i := 0 TO LEN(current)-1 DO
  1485. set := current[i] - previous[i];
  1486. IF set # {} THEN
  1487. FOR j := 0 TO MAX(SET)-1 DO
  1488. IF j IN set THEN
  1489. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1490. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1491. Symbol(variable, op);
  1492. MakeMemory(tmp,op.op,addressType,0);
  1493. ReleaseOperand(op);
  1494. Emit(Mov(position,tmp, nil ) );
  1495. ReleaseIntermediateOperand(tmp);
  1496. END;
  1497. END;
  1498. END;
  1499. END;
  1500. END;
  1501. END ResetUsedTemporaries;
  1502. *)
  1503. PROCEDURE Statement(x: SyntaxTree.Statement);
  1504. VAR use: VariableUse;
  1505. BEGIN
  1506. temporaries.GetUsage(use);
  1507. position := x.position;
  1508. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1509. IF commentPrintout # NIL THEN
  1510. commentPrintout.Statement(x);
  1511. dump.Ln;
  1512. (*dump.Update;*)
  1513. END;
  1514. x.Accept(SELF);
  1515. (*
  1516. CheckRegistersFree();
  1517. *)
  1518. (*ResetUsedTemporaries(use);*)
  1519. temporaries.SetUsage(use);
  1520. END Statement;
  1521. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1522. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1523. *)
  1524. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1525. BEGIN
  1526. ASSERT(op.mode # IntermediateCode.Undefined);
  1527. IF op.mode = IntermediateCode.ModeMemory THEN
  1528. ReuseCopy(res,op);
  1529. ELSE
  1530. res := op;
  1531. UseIntermediateOperand(res);
  1532. END;
  1533. IntermediateCode.AddOffset(res,offset);
  1534. IntermediateCode.MakeMemory(res,type);
  1535. END MakeMemory;
  1536. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1537. VAR mem: IntermediateCode.Operand;
  1538. BEGIN
  1539. MakeMemory(mem,res,type,offset);
  1540. ReleaseIntermediateOperand(res);
  1541. res := mem;
  1542. END ToMemory;
  1543. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1544. VAR mem: IntermediateCode.Operand;
  1545. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1546. componentType: SyntaxTree.Type;
  1547. BEGIN
  1548. type := type.resolved;
  1549. IF operand.mode = ModeReference THEN
  1550. IF type IS SyntaxTree.RangeType THEN
  1551. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1552. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1553. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1554. ReleaseOperand(operand);
  1555. operand.op := firstOp;
  1556. operand.tag := lastOp;
  1557. operand.extra := stepOp;
  1558. ELSIF type IS SyntaxTree.ComplexType THEN
  1559. componentType := type(SyntaxTree.ComplexType).componentType;
  1560. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1561. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1562. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1563. ReleaseOperand(operand);
  1564. operand.op := firstOp;
  1565. operand.tag := lastOp
  1566. ELSE
  1567. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1568. ReleaseIntermediateOperand(operand.op);
  1569. operand.op := mem;
  1570. END;
  1571. operand.mode := ModeValue;
  1572. END;
  1573. ASSERT(operand.mode = ModeValue);
  1574. END LoadValue;
  1575. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1576. VAR prevConditional: BOOLEAN;
  1577. BEGIN
  1578. prevConditional := conditional;
  1579. conditional := FALSE;
  1580. InitOperand(result, ModeUndefined);
  1581. Expression(x);
  1582. op := result;
  1583. LoadValue(op,x.type.resolved);
  1584. conditional := prevConditional;
  1585. END Evaluate;
  1586. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1587. VAR prevConditional: BOOLEAN;
  1588. BEGIN
  1589. prevConditional := conditional;
  1590. conditional := FALSE;
  1591. InitOperand(result,ModeUndefined);
  1592. Expression(x);
  1593. op := result;
  1594. (*
  1595. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1596. *)
  1597. conditional := prevConditional;
  1598. END Designate;
  1599. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1600. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1601. BEGIN
  1602. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1603. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1604. conditional := TRUE;
  1605. trueLabel := trueL; falseLabel := falseL;
  1606. Expression(x);
  1607. trueL := trueLabel; falseL := falseLabel;
  1608. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1609. END Condition;
  1610. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1611. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1612. BEGIN
  1613. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1614. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1615. RETURN op
  1616. END NewRegisterOperand;
  1617. PROCEDURE UnuseRegister(register: LONGINT);
  1618. BEGIN
  1619. IF (register > 0) THEN
  1620. register := registerUsageCount.Map(register);
  1621. registerUsageCount.DecUse(register);
  1622. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1623. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1624. END;
  1625. IF registerUsageCount.Use(register)=0 THEN
  1626. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1627. Warning(position, "register cannot be removed");
  1628. END;
  1629. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1630. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1631. END;
  1632. ELSIF registerUsageCount.Use(register)<0 THEN
  1633. Warning(position, "register removed too often");
  1634. IF dump # NIL THEN
  1635. dump.String("register removed too often"); dump.Ln; dump.Update;
  1636. END;
  1637. END;
  1638. END;
  1639. END UnuseRegister;
  1640. PROCEDURE UseRegister(register: LONGINT);
  1641. BEGIN
  1642. IF (register > 0) THEN
  1643. register := registerUsageCount.Map(register);
  1644. registerUsageCount.IncUse(register);
  1645. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1646. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1647. END;
  1648. IF registerUsageCount.Use(register)=1 THEN
  1649. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1650. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1651. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1652. END;
  1653. END;
  1654. END;
  1655. END UseRegister;
  1656. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1657. BEGIN
  1658. UnuseRegister(op.register)
  1659. END ReleaseIntermediateOperand;
  1660. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1661. BEGIN
  1662. UseRegister(op.register)
  1663. END UseIntermediateOperand;
  1664. PROCEDURE ReleaseOperand(CONST op: Operand);
  1665. BEGIN
  1666. UnuseRegister(op.op.register);
  1667. UnuseRegister(op.tag.register);
  1668. UnuseRegister(op.extra.register);
  1669. END ReleaseOperand;
  1670. (* save registers marked in array "markedRegisters" to the stack
  1671. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1672. *)
  1673. PROCEDURE SaveRegisters();
  1674. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1675. BEGIN
  1676. entry := usedRegisters;
  1677. WHILE entry # NIL DO
  1678. type := registerUsageCount.used[entry.register].type;
  1679. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1680. Emit(Push(position,op));
  1681. entry := entry.next;
  1682. END;
  1683. END SaveRegisters;
  1684. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1685. BEGIN
  1686. saved := usedRegisters;
  1687. usedRegisters := NIL;
  1688. END ReleaseUsedRegisters;
  1689. (** remove parameter registers from used queue *)
  1690. PROCEDURE ReleaseParameterRegisters;
  1691. VAR entry,prev,next: RegisterEntry;
  1692. BEGIN
  1693. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1694. WHILE entry # NIL DO
  1695. next := entry.next;
  1696. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1697. registerUsageCount.DecUse(entry.register);
  1698. ASSERT(registerUsageCount.Use(entry.register)=0);
  1699. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1700. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1701. END;
  1702. ELSIF prev = NIL THEN
  1703. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1704. ELSE
  1705. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1706. END;
  1707. entry := next;
  1708. END;
  1709. END ReleaseParameterRegisters;
  1710. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1711. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1712. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1713. BEGIN
  1714. entry := saved;
  1715. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1716. entry := prev;
  1717. WHILE entry # NIL DO
  1718. prev := entry.prev;
  1719. type := entry.type;
  1720. class := entry.registerClass;
  1721. IntermediateCode.InitRegister(op,type,class,entry.register);
  1722. (*
  1723. new := registerUsageCount.Next(type,class);
  1724. registerUsageCount.Remap(entry.register,new);
  1725. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1726. dump.String("remap register "); dump.Int(entry.register,1);
  1727. dump.String("to "); dump.Int(new,1);
  1728. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1729. END;
  1730. entry.register := new;
  1731. *)
  1732. Emit(Pop(position,op));
  1733. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1734. entry := prev;
  1735. END;
  1736. (*
  1737. usedRegisters := saved;
  1738. *)
  1739. END RestoreRegisters;
  1740. PROCEDURE CheckRegistersFree;
  1741. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1742. BEGIN
  1743. IF usedRegisters # NIL THEN
  1744. r := usedRegisters;
  1745. WHILE r # NIL DO
  1746. warning := "register ";
  1747. Strings.AppendInt(warning, r.register);
  1748. Strings.Append(warning, " not released.");
  1749. Warning(position,warning);
  1750. r := r .next;
  1751. END;
  1752. END;
  1753. FOR i := 0 TO registerUsageCount.count-1 DO
  1754. IF registerUsageCount.used[i].count < 0 THEN
  1755. warning := "register ";
  1756. Strings.AppendInt(warning, i);
  1757. Strings.Append(warning, " unused too often.");
  1758. Warning(position,warning);
  1759. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1760. warning := "register ";
  1761. Strings.AppendInt(warning, i);
  1762. Strings.Append(warning, " not unused often enough.");
  1763. Warning(position,warning);
  1764. END;
  1765. END;
  1766. END CheckRegistersFree;
  1767. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1768. Otherwise allocate a new register.
  1769. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1770. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1771. BEGIN
  1772. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1773. UseIntermediateOperand(result);
  1774. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1775. UseIntermediateOperand(result);
  1776. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1777. END;
  1778. END Reuse2;
  1779. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1780. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1781. If not then allocate a new register.
  1782. Does NOT necessarily keep the content of src1 or src2 in result!
  1783. *)
  1784. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1785. BEGIN
  1786. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1787. UseIntermediateOperand(result);
  1788. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1789. UseIntermediateOperand(result);
  1790. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1791. result := alternative; alternative := emptyOperand;
  1792. UseIntermediateOperand(result);
  1793. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1794. END;
  1795. END Reuse2a;
  1796. (* like reuse2 but only one source *)
  1797. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1798. BEGIN
  1799. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1800. UseIntermediateOperand(result);
  1801. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1802. END;
  1803. END Reuse1;
  1804. (* like reuse2a but only one source *)
  1805. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1806. BEGIN
  1807. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1808. UseIntermediateOperand(result);
  1809. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1810. UseIntermediateOperand(result);
  1811. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1812. END;
  1813. END Reuse1a;
  1814. (* like reuse1 but guarantees that content of src1 is in result *)
  1815. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1816. BEGIN
  1817. IF ReusableRegister(src1) THEN
  1818. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1819. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1820. UseIntermediateOperand(result);
  1821. ELSE
  1822. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1823. Emit(Mov(position,result,src1));
  1824. END
  1825. END ReuseCopy;
  1826. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1827. BEGIN
  1828. IF ReusableRegister(src) THEN
  1829. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1830. ELSE
  1831. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1832. Emit(Mov(position,result,src));
  1833. ReleaseIntermediateOperand(src);
  1834. END
  1835. END TransferToRegister;
  1836. (** labels and branches **)
  1837. PROCEDURE NewLabel(): Label;
  1838. VAR label: Label;
  1839. BEGIN
  1840. NEW(label,section); RETURN label;
  1841. END NewLabel;
  1842. PROCEDURE SetLabel(label: Label);
  1843. BEGIN label.Resolve(section.pc);
  1844. END SetLabel;
  1845. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1846. BEGIN
  1847. ASSERT(label # NIL);
  1848. IF label.pc < 0 THEN (* label not yet set *)
  1849. label.AddFixup(section.pc);
  1850. END;
  1851. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1852. END LabelOperand;
  1853. PROCEDURE BrL(label: Label);
  1854. BEGIN
  1855. Emit(Br(position,LabelOperand(label)));
  1856. END BrL;
  1857. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1858. BEGIN
  1859. Emit(Brge(position,LabelOperand(label),left,right));
  1860. END BrgeL;
  1861. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1862. BEGIN
  1863. Emit(Brlt(position,LabelOperand(label),left,right));
  1864. END BrltL;
  1865. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1866. BEGIN
  1867. Emit(Breq(position,LabelOperand(label),left,right));
  1868. END BreqL;
  1869. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1870. BEGIN
  1871. Emit(Brne(position,LabelOperand(label),left,right));
  1872. END BrneL;
  1873. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1874. VAR new: IntermediateCode.Operand;
  1875. BEGIN
  1876. IF Trace THEN TraceEnter("Convert") END;
  1877. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1878. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1879. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1880. & (operand.offset = 0)
  1881. THEN
  1882. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1883. Emit(Conv(position,new,operand));
  1884. ELSE
  1885. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1886. Emit(Conv(position,new,operand));
  1887. ReleaseIntermediateOperand(operand);
  1888. END;
  1889. operand := new;
  1890. 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
  1891. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1892. ELSE
  1893. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1894. Emit(Conv(position,new,operand));
  1895. ReleaseIntermediateOperand(operand);
  1896. operand := new;
  1897. END;
  1898. IF Trace THEN TraceExit("Convert") END;
  1899. END Convert;
  1900. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1901. VAR exit: Label;
  1902. BEGIN
  1903. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1904. exit := NewLabel();
  1905. br(exit,left,right);
  1906. EmitTrap(position,trapNo);
  1907. SetLabel(exit);
  1908. END TrapC;
  1909. (** expressions *)
  1910. (** emit necessary runtime check for set elements **)
  1911. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1912. VAR max: IntermediateCode.Operand;
  1913. BEGIN
  1914. IF isUnchecked THEN RETURN END;
  1915. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1916. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1917. TrapC(BrgeL, max, o, SetElementTrap);
  1918. END;
  1919. END CheckSetElement;
  1920. (** the set that a range represents **)
  1921. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1922. VAR
  1923. operand: Operand;
  1924. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1925. BEGIN
  1926. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1927. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1928. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1929. one := IntermediateCode.Immediate(setType, 1);
  1930. Evaluate(x, operand);
  1931. Convert(operand.op, setType);
  1932. Convert(operand.tag, setType);
  1933. CheckSetElement(operand.op);
  1934. CheckSetElement(operand.tag);
  1935. (* create mask for lower bound
  1936. i.e. shift 11111111 to the left by the value of the lower bound
  1937. *)
  1938. Reuse1(temp, operand.op);
  1939. Emit(Shl(position,temp, allBits, operand.op));
  1940. ReleaseIntermediateOperand(operand.op);
  1941. operand.op := temp;
  1942. (* create mask for upper bound
  1943. i.e. shift 11111111 to the right by the difference between the
  1944. upper bound and the maximum number of set elements
  1945. *)
  1946. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1947. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1948. Reuse1(temp, operand.tag);
  1949. ELSE
  1950. Reuse1(temp, operand.tag);
  1951. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1952. Emit(Sub(position,temp, size, operand.tag));
  1953. END;
  1954. Emit(Shr(position,temp, allBits, operand.tag));
  1955. ReleaseIntermediateOperand(operand.tag);
  1956. operand.tag := temp;
  1957. Reuse2(resultingSet, operand.op, operand.tag);
  1958. (* intersect the two masks *)
  1959. Emit(And(position,resultingSet, operand.op, operand.tag));
  1960. ReleaseOperand(operand);
  1961. RETURN resultingSet
  1962. END SetFromRange;
  1963. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1964. VAR
  1965. res, operand: Operand;
  1966. temp, one, noBits, dest: IntermediateCode.Operand;
  1967. expression: SyntaxTree.Expression;
  1968. i: LONGINT;
  1969. BEGIN
  1970. IF Trace THEN TraceEnter("VisitSet") END;
  1971. dest := destination;
  1972. destination := emptyOperand;
  1973. noBits := IntermediateCode.Immediate(setType, 0);
  1974. one := IntermediateCode.Immediate(setType, 1);
  1975. (* start off with the empty set *)
  1976. InitOperand(res, ModeValue);
  1977. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1978. Emit(Mov(position,res.op, noBits));
  1979. FOR i := 0 TO x.elements.Length() - 1 DO
  1980. expression := x.elements.GetExpression(i);
  1981. IF expression IS SyntaxTree.RangeExpression THEN
  1982. (* range of set elements *)
  1983. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1984. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1985. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1986. ReleaseIntermediateOperand(temp)
  1987. ELSE
  1988. (* singelton element *)
  1989. Evaluate(expression, operand);
  1990. Convert(operand.op, setType);
  1991. CheckSetElement(operand.op);
  1992. (* create subset containing single element *)
  1993. Reuse1(temp, operand.op);
  1994. Emit(Shl(position,temp, one, operand.op));
  1995. ReleaseOperand(operand);
  1996. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1997. ReleaseIntermediateOperand(temp);
  1998. END
  1999. END;
  2000. result := res;
  2001. destination := dest;
  2002. IF Trace THEN TraceExit("VisitSet") END;
  2003. END VisitSet;
  2004. (* math arrays of the form [a,b,c]
  2005. x is a static array and thus does not provide any pointers
  2006. *)
  2007. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2008. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2009. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2010. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2011. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2012. element: SyntaxTree.IntegerValue;
  2013. BEGIN
  2014. numberElements := x.elements.Length();
  2015. expression := index.parameters.GetExpression(dim);
  2016. element := expression(SyntaxTree.IntegerValue);
  2017. FOR i := 0 TO numberElements-1 DO
  2018. expression := x.elements.GetExpression(i);
  2019. element.SetValue(i);
  2020. IF expression IS SyntaxTree.MathArrayExpression THEN
  2021. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2022. ELSE
  2023. Assign(index,expression);
  2024. END;
  2025. END;
  2026. END RecursiveAssignment;
  2027. BEGIN
  2028. (*static math array not providing pointers anyway *)
  2029. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2030. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2031. designator.SetType(variable.type);
  2032. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2033. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2034. FOR i := 0 TO dim-1 DO
  2035. element := SyntaxTree.NewIntegerValue(x.position,0);
  2036. element.SetType(system.longintType);
  2037. index.parameters.AddExpression(element);
  2038. END;
  2039. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2040. RecursiveAssignment(x,0);
  2041. Expression(designator);
  2042. END VisitMathArrayExpression;
  2043. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2044. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2045. BEGIN
  2046. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2047. dest := destination; destination := emptyOperand;
  2048. IF x.operator = Scanner.Not THEN
  2049. IF conditional THEN
  2050. Condition(x.left,falseLabel,trueLabel)
  2051. ELSE
  2052. Evaluate(x.left,operand);
  2053. InitOperand(result,ModeValue);
  2054. Reuse1a(result.op,operand.op,dest);
  2055. Emit(Xor(position,result.op,operand.op,true));
  2056. ReleaseOperand(operand);
  2057. END;
  2058. ELSIF x.operator = Scanner.Minus THEN
  2059. Evaluate(x.left,operand);
  2060. InitOperand(result,ModeValue);
  2061. Reuse1a(result.op,operand.op,dest);
  2062. type := x.left.type.resolved;
  2063. IF type IS SyntaxTree.SetType THEN
  2064. Emit(Not(position,result.op,operand.op));
  2065. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2066. Reuse1(result.tag,operand.tag);
  2067. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2068. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2069. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2070. Emit(Neg(position,result.op,operand.op));
  2071. ELSE HALT(200)
  2072. END;
  2073. ReleaseOperand(operand);
  2074. ELSIF x.operator = Scanner.Address THEN
  2075. Designate(x.left,operand);
  2076. operand.mode := ModeValue;
  2077. t0 := x.left.type.resolved;
  2078. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2079. ReleaseIntermediateOperand(operand.op);
  2080. operand.op := operand.tag;
  2081. IntermediateCode.InitOperand(operand.tag);
  2082. END;
  2083. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2084. result := operand;
  2085. ELSE HALT(100)
  2086. END;
  2087. destination := dest;
  2088. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2089. END VisitUnaryExpression;
  2090. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2091. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2092. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2093. BEGIN
  2094. type := type.resolved;
  2095. originalType := type;
  2096. IF type IS SyntaxTree.PointerType THEN
  2097. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2098. END;
  2099. IF type IS SyntaxTree.ObjectType THEN
  2100. BrL(trueL);
  2101. ELSE
  2102. ASSERT(type IS SyntaxTree.RecordType);
  2103. (*
  2104. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2105. *)
  2106. ReuseCopy(left,tag);
  2107. right := TypeDescriptorAdr(type);
  2108. IF ~newObjectFile THEN
  2109. IntermediateCode.MakeMemory(right,addressType);
  2110. END;
  2111. IF backend.cooperative THEN
  2112. repeatL := NewLabel();
  2113. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2114. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2115. END;
  2116. SetLabel(repeatL);
  2117. BreqL(trueL,left,right);
  2118. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2119. BrneL(repeatL,left,nil);
  2120. ELSIF meta.simple THEN
  2121. level := type(SyntaxTree.RecordType).Level();
  2122. (* get type desc tag of level relative to base tag *)
  2123. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2124. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2125. IntermediateCode.MakeMemory(left,addressType);
  2126. BreqL(trueL,left,right);
  2127. ELSE
  2128. level := type(SyntaxTree.RecordType).Level();
  2129. (* get type desc tag of level relative to base tag *)
  2130. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2131. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2132. IntermediateCode.MakeMemory(left,addressType);
  2133. BreqL(trueL,left,right);
  2134. END;
  2135. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2136. BrL(falseL);
  2137. END;
  2138. END TypeTest;
  2139. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2140. BEGIN
  2141. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2142. IF dump # NIL THEN
  2143. dump.String(s); dump.Ln;
  2144. END;
  2145. END Error;
  2146. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2147. BEGIN
  2148. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2149. IF dump # NIL THEN
  2150. dump.String(s); dump.Ln; dump.Update;
  2151. END;
  2152. END Warning;
  2153. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2154. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2155. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2156. operand:Operand;
  2157. BEGIN
  2158. previousSection := section;
  2159. Global.GetModuleName(mod,name);
  2160. Strings.Append(name,".@Trace");
  2161. Basic.ToSegmentedName(name, pooledName);
  2162. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2163. IF dump # NIL THEN dump := section.comments END;
  2164. IF backend.hasLinkRegister THEN
  2165. Emit(Push(Basic.invalidPosition, lr));
  2166. END;
  2167. variable := mod.moduleScope.firstVariable;
  2168. WHILE variable # NIL DO
  2169. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2170. Symbol(variable, operand);
  2171. register := operand.op;
  2172. CallTraceMethod(register, variable.type);
  2173. ReleaseIntermediateOperand(register);
  2174. END;
  2175. variable := variable.nextVariable;
  2176. END;
  2177. IF backend.hasLinkRegister THEN
  2178. Emit(Pop(Basic.invalidPosition, lr));
  2179. END;
  2180. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2181. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2182. Emit(Br(position,op));
  2183. INC(statCoopTraceModule, section.pc);
  2184. section := previousSection;
  2185. IF dump # NIL THEN dump := section.comments END;
  2186. END CreateTraceModuleMethod;
  2187. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2188. BEGIN
  2189. Emit (Push(position, dst));
  2190. Emit (Push(position, src));
  2191. CallThis(position,"GarbageCollector","Assign", 2);
  2192. END CallAssignPointer;
  2193. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2194. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2195. BEGIN
  2196. IF SemanticChecker.IsPointerType (type) THEN
  2197. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2198. ELSIF type.IsRecordType() THEN
  2199. Emit (Push(position,dst));
  2200. Emit (Push(position,src));
  2201. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2202. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2203. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2204. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2205. ELSIF IsStaticArray(type) THEN
  2206. size := StaticArrayNumElements(type);
  2207. base := StaticArrayBaseType(type);
  2208. IF base.IsRecordType() THEN
  2209. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2210. Emit (Push(position, dst));
  2211. Emit (Push(position, src));
  2212. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2213. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2214. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2215. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2216. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2217. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2218. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2219. Emit (Push(position, dst));
  2220. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2221. Emit (Push(position, src));
  2222. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2223. ELSE
  2224. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2225. Emit (Push(position, dst));
  2226. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2227. Emit (Push(position, src));
  2228. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2229. ASSERT(StaticArrayBaseType(type).IsPointer());
  2230. END;
  2231. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2232. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2233. Emit (Push(position, dst));
  2234. Emit (Push(position, src));
  2235. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2236. ELSE HALT(100); (* missing ? *)
  2237. END;
  2238. END CallAssignMethod;
  2239. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2240. VAR name: Basic.SegmentedName;
  2241. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2242. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2243. context: Context;
  2244. BEGIN
  2245. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2246. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2247. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2248. GetRecordTypeName (recordType,name);
  2249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2250. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2251. IF dump # NIL THEN dump := section.comments END;
  2252. IF backend.hasLinkRegister THEN
  2253. Emit(Push(Basic.invalidPosition, lr));
  2254. END;
  2255. variable := recordType.recordScope.firstVariable;
  2256. WHILE variable # NIL DO
  2257. IF variable.NeedsTrace() THEN
  2258. dst := NewRegisterOperand (addressType);
  2259. src := NewRegisterOperand (addressType);
  2260. Emit (Mov(position, dst, parameter1));
  2261. Emit (Mov(position, src, parameter2));
  2262. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2263. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2264. CallAssignMethod(dst, src, variable.type);
  2265. ReleaseIntermediateOperand(src);
  2266. ReleaseIntermediateOperand(dst);
  2267. END;
  2268. variable := variable.nextVariable;
  2269. END;
  2270. recordBase := recordType.GetBaseRecord();
  2271. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2272. IF backend.hasLinkRegister THEN
  2273. Emit(Pop(Basic.invalidPosition, lr));
  2274. END;
  2275. GetRecordTypeName (recordBase,name);
  2276. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2277. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2278. Emit(Br(position,op));
  2279. ELSE
  2280. Emit(Exit(position,0,0, 0));
  2281. END;
  2282. IF ~recordType.isObject THEN
  2283. GetRecordTypeName (recordType,name);
  2284. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2285. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2286. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2287. NEW(registerUsageCount);
  2288. usedRegisters := NIL;
  2289. dst := NewRegisterOperand (addressType);
  2290. src := NewRegisterOperand (addressType);
  2291. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2292. Emit(Mov(position, dst, parameter1));
  2293. Emit(Mov(position, src, parameter2));
  2294. label := NewLabel();
  2295. SetLabel(label);
  2296. Emit(Push(position, dst));
  2297. Emit(Push(position, src));
  2298. GetRecordTypeName (recordType,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2300. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2301. Emit(Call(position, op, 0));
  2302. Emit(Pop(position, src));
  2303. Emit(Pop(position, dst));
  2304. Emit(Add(position, dst, dst, ofs));
  2305. Emit(Add(position, src, src, ofs));
  2306. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2307. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2308. Emit(Exit(position,0,0, 0));
  2309. END;
  2310. INC(statCoopAssignProcedure, section.pc);
  2311. ReturnToContext(context);
  2312. IF dump # NIL THEN dump := section.comments END;
  2313. END CreateAssignProcedure;
  2314. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2315. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2316. BEGIN
  2317. IF IsUnsafePointer (type) THEN
  2318. skip := NewLabel();
  2319. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2320. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2321. BreqL (skip, op, nil);
  2322. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2323. SetLabel (skip);
  2324. ELSIF SemanticChecker.IsPointerType (type) THEN
  2325. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2326. CallThis(position,"GarbageCollector","Mark", 1);
  2327. ELSIF type.IsRecordType() THEN
  2328. Emit (Push(position,register));
  2329. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2330. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2331. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2332. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2333. ELSIF IsStaticArray(type) THEN
  2334. size := StaticArrayNumElements(type);
  2335. base := StaticArrayBaseType(type);
  2336. IF base.IsRecordType() THEN
  2337. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2338. Emit (Push(position, register));
  2339. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2340. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2341. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2342. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2343. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2344. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2345. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2346. Emit (Push(position, register));
  2347. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2348. ELSE
  2349. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2350. Emit (Push(position, register));
  2351. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2352. ASSERT(base.IsPointer());
  2353. END;
  2354. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2355. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2356. CallThis(position,"GarbageCollector","Mark", 1);
  2357. ELSE HALT(100); (* missing ? *)
  2358. END;
  2359. END CallTraceMethod;
  2360. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2361. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2362. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2363. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2364. BEGIN
  2365. previousSection := section;
  2366. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2367. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2368. GetRecordTypeName (recordType,name);
  2369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2370. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2371. IF dump # NIL THEN dump := section.comments END;
  2372. IF backend.hasLinkRegister THEN
  2373. Emit(Push(Basic.invalidPosition, lr));
  2374. END;
  2375. variable := recordType.recordScope.firstVariable;
  2376. WHILE variable # NIL DO
  2377. IF variable.NeedsTrace() THEN
  2378. register := NewRegisterOperand (addressType);
  2379. Emit (Mov(position,register,parameter1));
  2380. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2381. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2382. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2383. END;
  2384. CallTraceMethod(register, variable.type);
  2385. ReleaseIntermediateOperand(register);
  2386. END;
  2387. variable := variable.nextVariable;
  2388. END;
  2389. recordBase := recordType.GetBaseRecord();
  2390. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2391. recordBase := recordBase.GetBaseRecord();
  2392. END;
  2393. IF recordBase # NIL THEN
  2394. IF backend.hasLinkRegister THEN
  2395. Emit(Pop(Basic.invalidPosition, lr));
  2396. END;
  2397. GetRecordTypeName (recordBase,name);
  2398. IF HasExplicitTraceMethod (recordBase) THEN
  2399. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2400. ELSE
  2401. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2402. END;
  2403. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2404. Emit(Br(position,op));
  2405. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2406. Emit(Exit(position,0,0,0));
  2407. ELSE
  2408. IF backend.hasLinkRegister THEN
  2409. Emit(Pop(Basic.invalidPosition, lr));
  2410. END;
  2411. IF recordType.isObject THEN
  2412. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2413. ELSE
  2414. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2415. END;
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2417. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2418. Emit(Br(position,op));
  2419. END;
  2420. IF ~recordType.isObject THEN
  2421. GetRecordTypeName (recordType,name);
  2422. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2423. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2424. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2425. NEW(registerUsageCount);
  2426. usedRegisters := NIL;
  2427. IF dump # NIL THEN dump := section.comments END;
  2428. register := NewRegisterOperand (addressType);
  2429. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2430. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2431. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2432. END;
  2433. Emit (Push(position,register));
  2434. GetRecordTypeName (recordType,name);
  2435. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2436. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2437. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2438. ReleaseIntermediateOperand(register);
  2439. Emit(Exit(position,0,0,0));
  2440. GetRecordTypeName (recordType,name);
  2441. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2443. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2444. NEW(registerUsageCount);
  2445. usedRegisters := NIL;
  2446. register := NewRegisterOperand (addressType);
  2447. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2448. Emit(Mov(position, register, parameter1));
  2449. label := NewLabel();
  2450. SetLabel(label);
  2451. Emit(Push(position, register));
  2452. GetRecordTypeName (recordType,name);
  2453. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2454. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2455. Emit(Call(position, op, 0));
  2456. Emit(Pop(position, register));
  2457. Emit(Add(position, register, register, ofs));
  2458. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2459. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2460. Emit(Exit(position,0,0,0));
  2461. END;
  2462. INC(statCoopTraceMethod, section.pc);
  2463. ReturnToContext(context);
  2464. IF dump # NIL THEN dump := section.comments END;
  2465. END CreateTraceMethod;
  2466. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2467. VAR name: Basic.SegmentedName;
  2468. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2469. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2470. context: Context;
  2471. BEGIN
  2472. IF recordType.isObject THEN RETURN END;
  2473. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2474. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2475. GetRecordTypeName (recordType,name);
  2476. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2477. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2478. IF dump # NIL THEN dump := section.comments END;
  2479. IF backend.hasLinkRegister THEN
  2480. Emit(Push(Basic.invalidPosition, lr));
  2481. END;
  2482. variable := recordType.recordScope.firstVariable;
  2483. WHILE variable # NIL DO
  2484. IF variable.NeedsTrace() THEN
  2485. dst := NewRegisterOperand (addressType);
  2486. Emit (Mov(position, dst, parameter1));
  2487. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2488. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2489. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2490. END;
  2491. CallResetProcedure(dst, nil, variable.type);
  2492. ReleaseIntermediateOperand(dst);
  2493. END;
  2494. variable := variable.nextVariable;
  2495. END;
  2496. recordBase := recordType.GetBaseRecord();
  2497. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2498. IF backend.hasLinkRegister THEN
  2499. Emit(Pop(Basic.invalidPosition, lr));
  2500. END;
  2501. GetRecordTypeName (recordBase,name);
  2502. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2503. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2504. Emit(Br(position,op));
  2505. ELSE
  2506. Emit(Exit(position,0,0, 0));
  2507. END;
  2508. GetRecordTypeName (recordType,name);
  2509. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2510. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2511. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2512. NEW(registerUsageCount);
  2513. usedRegisters := NIL;
  2514. dst := NewRegisterOperand (addressType);
  2515. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2516. Emit(Mov(position, dst, parameter1));
  2517. label := NewLabel();
  2518. SetLabel(label);
  2519. Emit(Push(position, dst));
  2520. GetRecordTypeName (recordType,name);
  2521. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2522. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2523. Emit(Call(position, op, 0));
  2524. Emit(Pop(position, dst));
  2525. Emit(Add(position, dst, dst, ofs));
  2526. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2527. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2528. Emit(Exit(position,0,0, 0));
  2529. INC(statCoopResetProcedure, section.pc);
  2530. ReturnToContext(context);
  2531. IF dump # NIL THEN dump := section.comments END;
  2532. END CreateResetProcedure;
  2533. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2534. VAR name: Basic.SegmentedName; context: Context;
  2535. BEGIN
  2536. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2537. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2538. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2539. IF dump # NIL THEN dump := section.comments END;
  2540. IF backend.hasLinkRegister THEN
  2541. Emit(Push(Basic.invalidPosition, lr));
  2542. END;
  2543. Emit(Push(position,fp));
  2544. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2545. ResetVariables(scope);
  2546. Emit(Pop(position,fp));
  2547. Emit(Exit(position,0,0, 0));
  2548. ReturnToContext(context);
  2549. IF dump # NIL THEN dump := section.comments END;
  2550. END CreateResetMethod;
  2551. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2552. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2553. BEGIN
  2554. IF SemanticChecker.IsPointerType (type) THEN
  2555. Emit (Push(position, dest));
  2556. CallThis(position,"GarbageCollector","Reset", 1);
  2557. ELSIF type.IsRecordType() THEN
  2558. Emit (Push(position, dest));
  2559. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2560. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2561. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2562. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2563. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2564. size := GetArrayLength(type, tag);
  2565. base := ArrayBaseType(type);
  2566. IF base.IsRecordType() THEN
  2567. Emit (Push(position, size));
  2568. Emit (Push(position, dest));
  2569. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2570. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2571. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2572. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2573. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2574. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2575. Emit (Push(position, size));
  2576. Emit (Push(position, dest));
  2577. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2578. ELSE
  2579. Emit (Push(position, size));
  2580. Emit (Push(position, dest));
  2581. CallThis(position,"GarbageCollector","ResetArray", 2);
  2582. ASSERT(ArrayBaseType(type).IsPointer());
  2583. END;
  2584. ReleaseIntermediateOperand(size);
  2585. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2586. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2587. Emit (Push(position, dest));
  2588. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2589. ELSE HALT(100); (* missing ? *)
  2590. END;
  2591. END CallResetProcedure;
  2592. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2593. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2594. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2595. VAR operand: Operand;
  2596. BEGIN
  2597. Symbol (symbol, operand);
  2598. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2599. ReleaseOperand(operand);
  2600. END Reset;
  2601. BEGIN
  2602. previousScope := currentScope;
  2603. currentScope := scope;
  2604. pc := section.pc;
  2605. variable := scope.firstVariable;
  2606. WHILE variable # NIL DO
  2607. IF variable.NeedsTrace() THEN
  2608. Reset (variable);
  2609. END;
  2610. variable := variable.nextVariable;
  2611. END;
  2612. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2613. WHILE parameter # NIL DO
  2614. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2615. Reset (parameter);
  2616. END;
  2617. parameter := parameter.nextParameter;
  2618. END;
  2619. INC(statCoopResetVariables, section.pc - pc);
  2620. currentScope := previousScope;
  2621. END ResetVariables;
  2622. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2623. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2624. VAR op: IntermediateCode.Operand; context: Context;
  2625. BEGIN
  2626. previousSection := section;
  2627. GetCodeSectionNameForSymbol(procedure, name);
  2628. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2629. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2630. IF dump # NIL THEN dump := section.comments END;
  2631. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2632. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2633. Emit(Data(position,op));
  2634. Emit(Data(position,nil));
  2635. IF HasPointers (procedure.procedureScope) THEN
  2636. GetCodeSectionNameForSymbol(procedure, name);
  2637. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2638. ELSE
  2639. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2640. END;
  2641. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2642. Emit(Data(position,op));
  2643. ReturnToContext(context);
  2644. IF dump # NIL THEN dump := section.comments END;
  2645. END CreateProcedureDescriptor;
  2646. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2647. VAR import: SyntaxTree.Import;
  2648. s: Basic.MessageString;
  2649. selfName: SyntaxTree.IdentifierString;
  2650. BEGIN
  2651. moduleScope.ownerModule.GetName(selfName);
  2652. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2653. module := moduleScope.ownerModule
  2654. ELSE
  2655. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2656. IF import = NIL THEN
  2657. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2658. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2659. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2660. s := "Module ";
  2661. Strings.Append(s,moduleName);
  2662. Strings.Append(s," cannot be imported.");
  2663. IF force THEN
  2664. Error(position,s);
  2665. ELSIF canBeLoaded THEN
  2666. IF WarningDynamicLoading THEN
  2667. Strings.Append(s, "=> no dynamic linking.");
  2668. Warning(position, s);
  2669. END;
  2670. canBeLoaded := FALSE;
  2671. END;
  2672. RETURN FALSE
  2673. ELSE
  2674. SELF.module.imports.AddName(moduleName)
  2675. END;
  2676. ELSIF import.module = NIL THEN (* already tried *)
  2677. RETURN FALSE
  2678. END;
  2679. module := import.module;
  2680. END;
  2681. RETURN TRUE
  2682. END AddImport;
  2683. (* needed for old binary object file format*)
  2684. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2685. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2686. BEGIN
  2687. IF AddImport(moduleName,module,TRUE) THEN
  2688. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2689. IF procedure = NIL THEN
  2690. s := "Instruction not supported on target, emulation procedure ";
  2691. Strings.Append(s,moduleName);
  2692. Strings.Append(s,".");
  2693. Strings.Append(s,procedureName);
  2694. Strings.Append(s," not present");
  2695. Error(position,s);
  2696. ELSE
  2697. StaticCallOperand(r,procedure);
  2698. ReleaseOperand(r);
  2699. fp := GetFingerprint(procedure);
  2700. END;
  2701. END;
  2702. END EnsureSymbol;
  2703. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2704. VAR exit: Label; trueL,falseL: Label;
  2705. BEGIN
  2706. trueL := NewLabel();
  2707. falseL := NewLabel();
  2708. exit := NewLabel();
  2709. Condition(x,trueL,falseL);
  2710. InitOperand(result,ModeValue);
  2711. SetLabel(trueL);
  2712. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2713. Emit(Mov(position,result.op,true));
  2714. BrL(exit);
  2715. SetLabel(falseL);
  2716. Emit(MovReplace(position,result.op,false));
  2717. SetLabel(exit);
  2718. END ConditionToValue;
  2719. PROCEDURE ValueToCondition(VAR op: Operand);
  2720. BEGIN
  2721. LoadValue(op,system.booleanType);
  2722. BrneL(trueLabel,op.op, false);
  2723. ReleaseOperand(op);
  2724. BrL(falseLabel);
  2725. END ValueToCondition;
  2726. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2727. VAR size: LONGINT;
  2728. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2729. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2730. BEGIN
  2731. ASSERT(type.form = SyntaxTree.Open);
  2732. baseType := type.arrayBase.resolved;
  2733. IF IsOpenArray(baseType) THEN
  2734. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2735. ELSE
  2736. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2737. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2738. END;
  2739. len := tag;
  2740. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2741. IntermediateCode.MakeMemory(len,addressType);
  2742. UseIntermediateOperand(len);
  2743. Reuse2(res,sizeOperand,len);
  2744. Emit(Mul(position,res,sizeOperand,len));
  2745. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2746. RETURN res
  2747. END GetArraySize;
  2748. BEGIN
  2749. type := type.resolved;
  2750. IF IsOpenArray(type) THEN
  2751. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2752. RETURN tag
  2753. ELSE
  2754. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2755. END;
  2756. ELSE
  2757. size := ToMemoryUnits(system,system.SizeOf(type));
  2758. RETURN IntermediateCode.Immediate(addressType,size)
  2759. END;
  2760. END GetDynamicSize;
  2761. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2762. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2763. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2764. BEGIN
  2765. ASSERT(type.form = SyntaxTree.Open);
  2766. baseType := type.arrayBase.resolved;
  2767. IF IsOpenArray(baseType) THEN
  2768. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2769. ELSE
  2770. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2771. END;
  2772. len := tag;
  2773. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2774. IntermediateCode.MakeMemory(len,addressType);
  2775. UseIntermediateOperand(len);
  2776. Reuse2(res,sizeOperand,len);
  2777. Emit(Mul(position,res,sizeOperand,len));
  2778. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2779. RETURN res
  2780. END GetLength;
  2781. BEGIN
  2782. type := type.resolved;
  2783. IF IsOpenArray(type) THEN
  2784. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2785. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2786. ELSIF type IS SyntaxTree.StringType THEN
  2787. RETURN tag;
  2788. ELSE
  2789. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2790. END;
  2791. END GetArrayLength;
  2792. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2793. VAR result: IntermediateCode.Operand;
  2794. BEGIN
  2795. IF backend.cooperative THEN
  2796. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2797. ELSE
  2798. MakeMemory(result, tag, addressType, 0);
  2799. END;
  2800. RETURN result
  2801. END GetSizeFromTag;
  2802. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2803. VAR parameter: SyntaxTree.Parameter;
  2804. BEGIN
  2805. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2806. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2807. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2808. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2809. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2810. END;
  2811. RETURN GetDynamicSize(e.type, tag);
  2812. END GetArrayOfBytesSize;
  2813. (*
  2814. to find imported symbol. not needed ?
  2815. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2816. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2817. BEGIN
  2818. IF AddImport(moduleName,importedModule,FALSE) THEN
  2819. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2820. RETURN symbol
  2821. ELSE
  2822. RETURN NIL
  2823. END
  2824. END SymbolByName;
  2825. *)
  2826. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2827. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2828. BEGIN
  2829. IF AddImport(moduleName,runtimeModule,force) THEN
  2830. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2831. IF procedure = NIL THEN
  2832. s := "Procedure ";
  2833. Strings.Append(s,moduleName);
  2834. Strings.Append(s,".");
  2835. Strings.Append(s,procedureName);
  2836. Strings.Append(s," not present");
  2837. Error(position,s);
  2838. RETURN FALSE
  2839. ELSE
  2840. RETURN TRUE
  2841. END;
  2842. ELSE RETURN FALSE
  2843. END;
  2844. END GetRuntimeProcedure;
  2845. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2846. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2847. s: Basic.MessageString;
  2848. BEGIN
  2849. Basic.InitSegmentedName(name);
  2850. name[0] := Basic.MakeString(moduleName);
  2851. name[1] := Basic.MakeString(typeName);
  2852. name[2] := -1;
  2853. IF AddImport(moduleName,importedModule, FALSE) THEN
  2854. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2855. IF symbol = NIL THEN
  2856. s := "type ";
  2857. Strings.Append(s,moduleName);
  2858. Strings.Append(s,".");
  2859. Strings.Append(s,typeName);
  2860. Strings.Append(s," not present");
  2861. Error(position,s);
  2862. END;
  2863. ELSE symbol := NIL;
  2864. END;
  2865. IF importedModule = moduleScope.ownerModule THEN
  2866. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2867. ELSE
  2868. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2869. END;
  2870. RETURN symbol
  2871. END GetTypeDescriptor;
  2872. (* 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. *)
  2873. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2874. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2875. pooledName: Basic.SegmentedName; size: LONGINT;
  2876. BEGIN
  2877. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2878. StaticCallOperand(result,procedure);
  2879. IF numberParameters < 0 THEN
  2880. size := ProcedureParametersSize(system,procedure);
  2881. ELSE
  2882. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2883. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2884. Error(position,"runtime call parameter count mismatch");
  2885. END;
  2886. END;
  2887. Emit(Call(position, result.op, size));
  2888. ReleaseOperand(result);
  2889. ELSE (* only static linking possible *)
  2890. ASSERT(numberParameters >= 0);
  2891. Basic.InitSegmentedName(pooledName);
  2892. pooledName[0] := Basic.MakeString(moduleName);
  2893. pooledName[1] := Basic.MakeString(procedureName);
  2894. pooledName[2] := -1;
  2895. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2896. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2897. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2898. END;
  2899. END CallThisChecked;
  2900. (* 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. *)
  2901. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2902. BEGIN
  2903. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2904. END CallThis;
  2905. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2906. VAR
  2907. left,right: Operand;
  2908. leftSize, rightSize: IntermediateCode.Operand;
  2909. saved: RegisterEntry;
  2910. reg: IntermediateCode.Operand;
  2911. procedureName: SyntaxTree.IdentifierString;
  2912. BEGIN
  2913. procedureName := "CompareString";
  2914. SaveRegisters();ReleaseUsedRegisters(saved);
  2915. Designate(leftExpression,left);
  2916. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2917. Emit(Push(position,leftSize));
  2918. ReleaseIntermediateOperand(leftSize);
  2919. Emit(Push(position,left.op));
  2920. ReleaseOperand(left);
  2921. Designate(rightExpression,right);
  2922. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2923. Emit(Push(position,rightSize));
  2924. ReleaseIntermediateOperand(rightSize);
  2925. Emit(Push(position,right.op));
  2926. ReleaseOperand(right);
  2927. IF backend.cooperative THEN
  2928. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2929. ELSE
  2930. CallThis(position,runtimeModuleName,procedureName, 4);
  2931. END;
  2932. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2933. Emit(Result(position,reg));
  2934. (*
  2935. AcquireThisRegister(int8,IntermediateCode.Result);
  2936. *)
  2937. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2938. (*
  2939. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2940. *)
  2941. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2942. ReleaseIntermediateOperand(reg);
  2943. BrL(falseLabel);
  2944. END CompareString;
  2945. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2946. VAR
  2947. left,right: Operand;
  2948. leftSize, rightSize: IntermediateCode.Operand;
  2949. saved: RegisterEntry;
  2950. procedureName: SyntaxTree.IdentifierString;
  2951. BEGIN
  2952. procedureName := "CopyString";
  2953. SaveRegisters();ReleaseUsedRegisters(saved);
  2954. Designate(leftExpression,left);
  2955. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2956. Emit(Push(position,leftSize));
  2957. ReleaseIntermediateOperand(leftSize);
  2958. Emit(Push(position,left.op));
  2959. ReleaseOperand(left);
  2960. Designate(rightExpression,right);
  2961. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2962. Emit(Push(position,rightSize));
  2963. ReleaseIntermediateOperand(rightSize);
  2964. Emit(Push(position,right.op));
  2965. ReleaseOperand(right);
  2966. IF backend.cooperative THEN
  2967. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2968. ELSE
  2969. CallThis(position,runtimeModuleName,procedureName,4);
  2970. END;
  2971. RestoreRegisters(saved);
  2972. END CopyString;
  2973. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2974. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2975. leftType,rightType: SyntaxTree.Type;
  2976. leftExpression,rightExpression : SyntaxTree.Expression;
  2977. componentType: IntermediateCode.Type;
  2978. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2979. size: LONGINT;
  2980. BEGIN
  2981. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2982. dest := destination; destination := emptyOperand;
  2983. leftType := x.left.type.resolved;
  2984. rightType := x.right.type.resolved;
  2985. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2986. CASE x.operator OF
  2987. Scanner.Or:
  2988. (* shortcut evaluation of left OR right *)
  2989. IF ~conditional THEN ConditionToValue(x);
  2990. ELSE
  2991. next := NewLabel();
  2992. Condition(x.left,trueLabel,next);
  2993. SetLabel(next);
  2994. Condition(x.right,trueLabel,falseLabel);
  2995. END;
  2996. |Scanner.And:
  2997. (* shortcut evaluation of left & right *)
  2998. IF ~conditional THEN ConditionToValue(x);
  2999. ELSE
  3000. next := NewLabel();
  3001. Condition(x.left,next,falseLabel);
  3002. SetLabel(next);
  3003. Condition(x.right,trueLabel,falseLabel);
  3004. END;
  3005. |Scanner.Is:
  3006. IF ~conditional THEN ConditionToValue(x);
  3007. ELSE
  3008. (* get type desc tag *)
  3009. IF IsPointerToRecord(leftType,recordType) THEN
  3010. Evaluate(x.left,left);
  3011. Dereference(left,recordType,IsUnsafePointer(leftType))
  3012. ELSE
  3013. Designate(x.left,left);
  3014. END;
  3015. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3016. ReleaseOperand(left);
  3017. END;
  3018. |Scanner.Plus:
  3019. Evaluate(x.left,left);
  3020. Evaluate(x.right,right);
  3021. IF leftType IS SyntaxTree.SetType THEN
  3022. InitOperand(result,ModeValue);
  3023. Reuse2a(result.op,left.op,right.op,dest);
  3024. Emit(Or(position,result.op,left.op,right.op));
  3025. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3026. InitOperand(result,ModeValue);
  3027. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3028. Reuse2(result.tag,left.tag,right.tag);
  3029. Emit(Add(position,result.op,left.op,right.op));
  3030. Emit(Add(position,result.tag,left.tag,right.tag))
  3031. ELSE
  3032. InitOperand(result,ModeValue);
  3033. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3034. AddInt(result.op, left.op, right.op) ;
  3035. ELSE
  3036. *)
  3037. Reuse2a(result.op,left.op,right.op,dest);
  3038. Emit(Add(position,result.op,left.op,right.op));
  3039. (*
  3040. END;
  3041. *)
  3042. END;
  3043. ReleaseOperand(left); ReleaseOperand(right);
  3044. |Scanner.Minus:
  3045. Evaluate(x.left,left);
  3046. Evaluate(x.right,right);
  3047. IF leftType IS SyntaxTree.SetType THEN
  3048. InitOperand(result,ModeValue);
  3049. Reuse1(result.op,right.op);
  3050. Emit(Not(position,result.op,right.op));
  3051. ReleaseOperand(right);
  3052. Emit(And(position,result.op,result.op,left.op));
  3053. ReleaseOperand(left);
  3054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3055. InitOperand(result,ModeValue);
  3056. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3057. Reuse2(result.tag,left.tag,right.tag);
  3058. Emit(Sub(position,result.op,left.op,right.op));
  3059. Emit(Sub(position,result.tag,left.tag,right.tag));
  3060. ReleaseOperand(left); ReleaseOperand(right)
  3061. ELSE
  3062. InitOperand(result,ModeValue);
  3063. Reuse2a(result.op,left.op,right.op,dest);
  3064. Emit(Sub(position,result.op,left.op,right.op));
  3065. ReleaseOperand(left); ReleaseOperand(right);
  3066. END;
  3067. |Scanner.Times:
  3068. Evaluate(x.left,left);
  3069. Evaluate(x.right,right);
  3070. IF leftType IS SyntaxTree.SetType THEN
  3071. InitOperand(result,ModeValue);
  3072. Reuse2a(result.op,left.op,right.op,dest);
  3073. Emit(And(position,result.op,left.op,right.op));
  3074. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3075. InitOperand(result, ModeValue);
  3076. componentType := left.op.type;
  3077. (* TODO: review this *)
  3078. (*
  3079. result.op = left.op * right.op - left.tag * right.tag
  3080. result.tag = left.tag * right.op + left.op * right.tag
  3081. *)
  3082. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3083. Emit(Mul(position,result.op, left.op, right.op));
  3084. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3085. Emit(Mul(position,tempReg, left.tag, right.tag));
  3086. Emit(Sub(position,result.op, result.op, tempReg));
  3087. Reuse2(result.tag, left.tag, right.op);
  3088. Emit(Mul(position,result.tag, left.tag, right.op));
  3089. Emit(Mul(position,tempReg, left.op, right.tag));
  3090. Emit(Add(position,result.tag, result.tag, tempReg));
  3091. ReleaseIntermediateOperand(tempReg)
  3092. ELSE
  3093. InitOperand(result,ModeValue);
  3094. Reuse2a(result.op,left.op,right.op,dest);
  3095. Emit(Mul(position,result.op,left.op,right.op));
  3096. END;
  3097. ReleaseOperand(left); ReleaseOperand(right);
  3098. |Scanner.Div:
  3099. Evaluate(x.left,left);
  3100. Evaluate(x.right,right);
  3101. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3102. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3103. IF ~isUnchecked THEN
  3104. exit := NewLabel();
  3105. BrltL(exit,zero,right.op);
  3106. EmitTrap(position,NegativeDivisorTrap);
  3107. SetLabel(exit);
  3108. END;
  3109. END;
  3110. InitOperand(result,ModeValue);
  3111. Reuse2a(result.op,left.op,right.op,dest);
  3112. Emit(Div(position,result.op,left.op,right.op));
  3113. ReleaseOperand(left); ReleaseOperand(right);
  3114. |Scanner.Mod:
  3115. Evaluate(x.left,left);
  3116. Evaluate(x.right,right);
  3117. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3118. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3119. IF ~isUnchecked THEN
  3120. exit := NewLabel();
  3121. BrltL(exit,zero,right.op);
  3122. EmitTrap(position,NegativeDivisorTrap);
  3123. SetLabel(exit);
  3124. END;
  3125. END;
  3126. InitOperand(result,ModeValue);
  3127. Reuse2a(result.op,left.op,right.op,dest);
  3128. Emit(Mod(position,result.op,left.op,right.op));
  3129. ReleaseOperand(left); ReleaseOperand(right);
  3130. |Scanner.Slash:
  3131. Evaluate(x.left,left);
  3132. Evaluate(x.right,right);
  3133. IF leftType IS SyntaxTree.SetType THEN
  3134. InitOperand(result,ModeValue);
  3135. Reuse2a(result.op,left.op,right.op,dest);
  3136. Emit(Xor(position,result.op,left.op,right.op));
  3137. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3138. InitOperand(result,ModeValue);
  3139. componentType := left.op.type;
  3140. (* review this *)
  3141. (*
  3142. divisor = right.op * right.op + right.tag * right.tag
  3143. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3144. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3145. *)
  3146. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3147. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3148. Emit(Mul(position,tempReg, right.op, right.op));
  3149. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3150. Emit(Add(position,tempReg, tempReg, tempReg2));
  3151. result.op := tempReg2;
  3152. Emit(Mul(position,result.op, left.op, right.op));
  3153. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3154. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3155. Emit(Add(position,result.op, result.op, tempReg2));
  3156. Emit(Div(position,result.op, result.op, tempReg));
  3157. Reuse2(result.tag, left.tag, right.op);
  3158. Emit(Mul(position,result.tag, left.tag, right.op));
  3159. Emit(Mul(position,tempReg2, left.op, right.tag));
  3160. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3161. Emit(Div(position,result.tag, result.tag, tempReg));
  3162. ReleaseIntermediateOperand(tempReg);
  3163. ReleaseIntermediateOperand(tempReg2)
  3164. ELSE
  3165. InitOperand(result,ModeValue);
  3166. Reuse2a(result.op,left.op,right.op,dest);
  3167. Emit(Div(position,result.op,left.op,right.op));
  3168. END;
  3169. ReleaseOperand(left); ReleaseOperand(right);
  3170. |Scanner.Equal:
  3171. IF ~conditional THEN ConditionToValue(x);
  3172. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3173. CompareString(BreqL,x.left,x.right);
  3174. ELSE
  3175. Evaluate(x.left,left);
  3176. Evaluate(x.right,right);
  3177. IF leftType IS SyntaxTree.RangeType THEN
  3178. ASSERT(rightType IS SyntaxTree.RangeType);
  3179. BrneL(falseLabel, left.op, right.op); (* first *)
  3180. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3181. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3182. ReleaseOperand(left); ReleaseOperand(right);
  3183. BrL(trueLabel)
  3184. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3185. BrneL(falseLabel, left.op, right.op); (* first *)
  3186. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3187. ReleaseOperand(left); ReleaseOperand(right);
  3188. BrL(trueLabel)
  3189. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3190. (* TODO: review this *)
  3191. BrneL(falseLabel, left.op, right.op); (* real part *)
  3192. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3193. ReleaseOperand(left); ReleaseOperand(right);
  3194. BrL(trueLabel)
  3195. ELSE
  3196. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3197. ReleaseOperand(left); ReleaseOperand(right);
  3198. BrL(trueLabel);
  3199. END;
  3200. END;
  3201. |Scanner.LessEqual:
  3202. IF ~conditional THEN ConditionToValue(x);
  3203. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3204. CompareString(BrgeL,x.right,x.left);
  3205. ELSE
  3206. Evaluate(x.left,left);
  3207. Evaluate(x.right,right);
  3208. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3209. Reuse1(temp.op,right.op);
  3210. Emit(And(position,temp.op,left.op,right.op));
  3211. ReleaseOperand(right);
  3212. BreqL(trueLabel,temp.op,left.op);
  3213. BrL(falseLabel);
  3214. ReleaseOperand(temp);ReleaseOperand(left);
  3215. ELSE
  3216. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3217. ReleaseOperand(left); ReleaseOperand(right);
  3218. BrL(trueLabel);
  3219. END;
  3220. END;
  3221. |Scanner.Less:
  3222. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3223. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3224. leftExpression.SetType(system.booleanType);
  3225. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3226. rightExpression.SetType(system.booleanType);
  3227. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3228. leftExpression.SetType(system.booleanType);
  3229. Expression(leftExpression);
  3230. ELSIF ~conditional THEN ConditionToValue(x);
  3231. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3232. CompareString(BrltL,x.left,x.right);
  3233. ELSE
  3234. Evaluate(x.left,left);
  3235. Evaluate(x.right,right);
  3236. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3237. ReleaseOperand(left); ReleaseOperand(right);
  3238. BrL(trueLabel);
  3239. END;
  3240. |Scanner.Greater:
  3241. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3242. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3243. leftExpression.SetType(system.booleanType);
  3244. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3245. rightExpression.SetType(system.booleanType);
  3246. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3247. leftExpression.SetType(system.booleanType);
  3248. Expression(leftExpression);
  3249. ELSIF ~conditional THEN ConditionToValue(x);
  3250. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3251. CompareString(BrltL,x.right,x.left);
  3252. ELSE
  3253. Evaluate(x.left,left);
  3254. Evaluate(x.right,right);
  3255. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3256. ReleaseOperand(left); ReleaseOperand(right);
  3257. BrL(trueLabel);
  3258. END;
  3259. |Scanner.GreaterEqual:
  3260. IF ~conditional THEN ConditionToValue(x);
  3261. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3262. CompareString(BrgeL,x.left,x.right);
  3263. ELSE
  3264. Evaluate(x.left,left);
  3265. Evaluate(x.right,right);
  3266. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3267. Reuse1(temp.op,left.op);
  3268. Emit(And(position,temp.op,left.op,right.op));
  3269. ReleaseOperand(left);
  3270. BreqL(trueLabel, temp.op,right.op);
  3271. ReleaseOperand(temp); ReleaseOperand(right);
  3272. BrL(falseLabel);
  3273. ELSE
  3274. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3275. ReleaseOperand(left); ReleaseOperand(right);
  3276. BrL(trueLabel);
  3277. END;
  3278. END;
  3279. |Scanner.Unequal:
  3280. IF ~conditional THEN ConditionToValue(x);
  3281. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3282. CompareString(BrneL,x.left,x.right);
  3283. ELSE
  3284. Evaluate(x.left,left);
  3285. Evaluate(x.right,right);
  3286. IF leftType IS SyntaxTree.RangeType THEN
  3287. ASSERT(rightType IS SyntaxTree.RangeType);
  3288. BrneL(trueLabel, left.op, right.op); (* first *)
  3289. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3290. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. BrL(falseLabel)
  3293. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3294. BrneL(trueLabel, left.op, right.op); (* first *)
  3295. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3296. ReleaseOperand(left); ReleaseOperand(right);
  3297. BrL(falseLabel)
  3298. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3299. (* TODO: review this *)
  3300. BrneL(trueLabel, left.op, right.op); (* real part *)
  3301. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3302. ReleaseOperand(left); ReleaseOperand(right);
  3303. BrL(falseLabel)
  3304. ELSE
  3305. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3306. ReleaseOperand(left); ReleaseOperand(right);
  3307. BrL(trueLabel);
  3308. END;
  3309. END;
  3310. |Scanner.In:
  3311. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3312. Evaluate(x.left,left);
  3313. Evaluate(x.right,right);
  3314. Convert(left.op,setType);
  3315. ReuseCopy(temp.op,right.op);
  3316. Emit(Shr(position,temp.op,temp.op,left.op));
  3317. ReleaseOperand(right); ReleaseOperand(left);
  3318. IntermediateCode.InitImmediate(one,setType,1);
  3319. Emit(And(position,temp.op,temp.op,one));
  3320. IF conditional THEN
  3321. IntermediateCode.InitImmediate(zero,setType,0);
  3322. BrneL(trueLabel,temp.op,zero);
  3323. ReleaseOperand(temp);
  3324. BrL(falseLabel);
  3325. ELSE
  3326. Convert(temp.op,bool);
  3327. result.mode := ModeValue;
  3328. result.op := temp.op;
  3329. result.tag := nil; (* may be left over from calls to evaluate *)
  3330. END;
  3331. ELSE
  3332. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3333. IF x.operator = Scanner.Questionmarks THEN
  3334. leftExpression := x.left;
  3335. rightExpression := x.right;
  3336. ELSE
  3337. leftExpression := x.right;
  3338. rightExpression := x.left;
  3339. END;
  3340. Evaluate(leftExpression, left);
  3341. Emit(Push(position,left.op));
  3342. ReleaseOperand(left);
  3343. Designate(rightExpression, right);
  3344. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3345. IF ~backend.cellsAreObjects THEN
  3346. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3347. END;
  3348. Emit(Push(position,right.op));
  3349. ReleaseOperand(right);
  3350. IF backend.cellsAreObjects THEN
  3351. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3352. ELSE
  3353. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3354. END;
  3355. InitOperand(result, ModeValue);
  3356. result.op := NewRegisterOperand(bool);
  3357. Emit(Result(position,result.op));
  3358. IF conditional THEN
  3359. IntermediateCode.InitImmediate(zero,setType,0);
  3360. BrneL(trueLabel,result.op,zero);
  3361. ReleaseOperand(result);
  3362. BrL(falseLabel);
  3363. END;
  3364. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3365. leftExpression := x.left;
  3366. rightExpression := x.right;
  3367. Evaluate(leftExpression, left);
  3368. Emit(Push(position,left.op));
  3369. ReleaseOperand(left);
  3370. Evaluate(rightExpression, right);
  3371. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3372. IF ~backend.cellsAreObjects THEN
  3373. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3374. END;
  3375. Emit(Push(position,right.op));
  3376. ReleaseOperand(right);
  3377. IF backend.cellsAreObjects THEN
  3378. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3379. ELSE
  3380. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3381. END;
  3382. InitOperand(result, ModeValue);
  3383. result.op := NewRegisterOperand(bool);
  3384. Emit(Result(position,result.op));
  3385. IF conditional THEN
  3386. IntermediateCode.InitImmediate(zero,setType,0);
  3387. BrneL(trueLabel,result.op,zero);
  3388. ReleaseOperand(result);
  3389. BrL(falseLabel);
  3390. END;
  3391. ELSE
  3392. HALT(100);
  3393. END;
  3394. END;
  3395. destination := dest;
  3396. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3397. END VisitBinaryExpression;
  3398. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3399. VAR localResult, operand: Operand;
  3400. BEGIN
  3401. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3402. InitOperand(localResult, ModeValue);
  3403. ASSERT(x.first # NIL);
  3404. Evaluate(x.first, operand);
  3405. localResult.op := operand.op;
  3406. ReleaseOperand(operand);
  3407. UseIntermediateOperand(localResult.op);
  3408. ASSERT(x.last # NIL);
  3409. Evaluate(x.last, operand);
  3410. localResult.tag := operand.op;
  3411. ReleaseOperand(operand);
  3412. UseIntermediateOperand(localResult.tag);
  3413. IF x.step # NIL THEN
  3414. Evaluate(x.step, operand);
  3415. localResult.extra := operand.op;
  3416. ReleaseOperand(operand);
  3417. UseIntermediateOperand(localResult.extra);
  3418. END;
  3419. result := localResult;
  3420. IF Trace THEN TraceExit("VisitRangeExpression") END
  3421. END VisitRangeExpression;
  3422. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3423. BEGIN
  3424. HALT(100); (* should never be evaluated *)
  3425. END VisitTensorRangeExpression;
  3426. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3427. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3428. BEGIN
  3429. IF Trace THEN TraceEnter("VisitConversion") END;
  3430. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3431. dest := destination; destination := emptyOperand;
  3432. Evaluate(x.expression,old);
  3433. InitOperand(result,ModeValue);
  3434. result.op := old.op;
  3435. ASSERT(result.op.mode # 0);
  3436. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3437. (* convert TO a complex number *)
  3438. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3439. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3440. ASSERT(result.op.mode # 0);
  3441. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3442. (* convert FROM a complex number TO a complex number*)
  3443. result.tag := old.tag;
  3444. ASSERT(result.tag.mode # 0);
  3445. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3446. ASSERT(result.tag.mode # 0)
  3447. ELSE
  3448. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3449. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3450. END
  3451. ELSE
  3452. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3453. ASSERT(result.op.mode # 0);
  3454. result.tag := old.tag; (*! probably never used *)
  3455. END;
  3456. destination := dest;
  3457. IF Trace THEN TraceExit("VisitConversion") END;
  3458. END VisitConversion;
  3459. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3460. BEGIN
  3461. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3462. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3463. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3464. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3465. END VisitTypeDeclaration;
  3466. (** designators (expressions) *)
  3467. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3468. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3469. BEGIN
  3470. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3471. IF x.left # NIL THEN Expression(x.left) END;
  3472. Symbol(x.symbol,result);
  3473. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3474. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3475. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3476. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3477. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3478. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3479. END;
  3480. END;
  3481. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3482. END VisitSymbolDesignator;
  3483. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3484. BEGIN
  3485. IF isUnchecked THEN RETURN END;
  3486. IF tagsAvailable THEN
  3487. TrapC(BrltL,index,length,IndexCheckTrap);
  3488. END;
  3489. END BoundCheck;
  3490. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3491. VAR d: IntermediateCode.Operand;
  3492. BEGIN
  3493. IF isUnchecked THEN RETURN END;
  3494. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3495. TrapC(op,dim,d,ArraySizeTrap);
  3496. ReleaseIntermediateOperand(d);
  3497. END DimensionCheck;
  3498. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3499. VAR
  3500. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3501. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3502. expression: SyntaxTree.Expression;
  3503. resultingType, leftType, baseType: SyntaxTree.Type;
  3504. skipLabel1: Label;
  3505. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3506. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3507. variableOp: Operand;
  3508. variable: SyntaxTree.Variable;
  3509. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3510. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3511. VAR e: SyntaxTree.Expression; i: LONGINT;
  3512. BEGIN
  3513. tensorFound := FALSE;
  3514. FOR i := 0 TO parameters.Length()-1 DO
  3515. e := parameters.GetExpression(i);
  3516. IF e IS SyntaxTree.TensorRangeExpression THEN
  3517. ASSERT(~tensorFound);
  3518. tensorFound := TRUE;
  3519. ELSIF e IS SyntaxTree.RangeExpression THEN
  3520. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3521. ELSE
  3522. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3523. END;
  3524. END;
  3525. END CountIndices;
  3526. BEGIN
  3527. ASSERT(tagsAvailable);
  3528. resultingType := x.type.resolved; (* resulting type *)
  3529. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3530. InitOperand(localResult, ModeReference);
  3531. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3532. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3533. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3534. (* a globally defined array destination tag is available -> use and invalidate it*)
  3535. localResult.tag := arrayDestinationTag;
  3536. IntermediateCode.InitOperand(arrayDestinationTag)
  3537. ELSE
  3538. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3539. (* the result is of array range type and thus does not provide any collectable pointers *)
  3540. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3541. Symbol(variable, variableOp);
  3542. ReuseCopy(localResult.tag, variableOp.op);
  3543. ReleaseOperand(variableOp);
  3544. END
  3545. END;
  3546. indexListSize := x.parameters.Length();
  3547. CountIndices(x.parameters);
  3548. (*ASSERT(tensorRangeCount <= 1);*)
  3549. (* designate the array to be indexed over, perform tensor range check if known *)
  3550. Designate(x.left, array);
  3551. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3552. Dereference(array, leftType,FALSE);
  3553. IF ~tensorFound THEN
  3554. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, prefixRanges + prefixIndices), BreqL)
  3555. END
  3556. END;
  3557. (* default base offset *)
  3558. srcDimOffset := 0;
  3559. destDimOffset := 0;
  3560. indexDim := 0;
  3561. (* use address of source array as basis *)
  3562. localResult.op := array.op;
  3563. UseIntermediateOperand(localResult.op);
  3564. (* go through the index list *)
  3565. FOR i := 0 TO indexListSize - 1 DO
  3566. expression := x.parameters.GetExpression(i);
  3567. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3568. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3569. srcDimOffset := -indexListSize;
  3570. destDimOffset := -suffixRanges;
  3571. ELSE
  3572. (* determine which dimension of source array is currently looked at *)
  3573. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3574. (* get the memory operand pointing to array descriptor dimension *)
  3575. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3576. (* make a reusable register from it *)
  3577. ReuseCopy(srcDim, tmp);
  3578. ReleaseIntermediateOperand(tmp);
  3579. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3580. ELSE
  3581. srcDim := IntermediateCode.Immediate(int32, i);
  3582. END;
  3583. (* get length and increment of source array for current dimension *)
  3584. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3585. Convert(sourceLength.op, sizeType);
  3586. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3587. Convert(sourceIncrement.op, sizeType);
  3588. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3589. ReleaseIntermediateOperand(srcDim);
  3590. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3591. (* SINGLE INDEX *)
  3592. Evaluate(expression, index);
  3593. ReleaseIntermediateOperand(index.tag);
  3594. index.tag := emptyOperand;
  3595. Convert(index.op, sizeType);
  3596. (* lower bound check *)
  3597. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3598. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3599. ELSIF isUnchecked THEN (* do nothing *)
  3600. ELSE
  3601. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3602. END;
  3603. (* upper bound check *)
  3604. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3605. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3606. ELSIF isUnchecked THEN (* do nothing *)
  3607. ELSE
  3608. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3609. END;
  3610. ReleaseOperand(sourceLength);
  3611. Convert(index.op, addressType);
  3612. summand := index.op;
  3613. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3614. (* RANGE OF INDICES *)
  3615. Evaluate(expression, range);
  3616. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3617. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3618. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3619. ReleaseOperand(range);
  3620. Convert(firstIndex, sizeType);
  3621. Convert(lastIndex, sizeType);
  3622. Convert(stepSize, sizeType);
  3623. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3624. if it is 'MAX(LONGINT)' *)
  3625. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3626. TransferToRegister(lastIndex, lastIndex);
  3627. skipLabel1 := NewLabel();
  3628. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3629. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3630. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3631. SetLabel(skipLabel1)
  3632. END;
  3633. (* check if step size is valid *)
  3634. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3635. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3636. ELSIF isUnchecked THEN (* do nothing *)
  3637. ELSE
  3638. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3639. END;
  3640. (* check lower bound check *)
  3641. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3642. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3643. ELSIF isUnchecked THEN (* do nothing *)
  3644. ELSE
  3645. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3646. END;
  3647. (* check upper bound check *)
  3648. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3649. (* statically open range: nothing to do *)
  3650. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3651. ASSERT(staticLastIndex < staticSourceLength)
  3652. ELSIF isUnchecked THEN (* do nothing *)
  3653. ELSE
  3654. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3655. END;
  3656. (* determine length of target array for current dimension *)
  3657. (* 1. incorporate last index: *)
  3658. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3659. (* last index is static *)
  3660. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3661. targetLength := sourceLength.op
  3662. ELSE
  3663. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3664. END;
  3665. UseIntermediateOperand(targetLength);
  3666. ELSE
  3667. (* targetLength := lastIndex + 1
  3668. Reuse1(targetLength, lastIndex);
  3669. *)
  3670. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3671. END;
  3672. ReleaseOperand(sourceLength);
  3673. ReleaseIntermediateOperand(lastIndex);
  3674. (* 2. incorporate first index: *)
  3675. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3676. (* first index and current target length are static *)
  3677. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3678. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3679. (* first index = 0: nothing to do *)
  3680. ELSE
  3681. (* targetLength := targetLength - firstIndex *)
  3682. TransferToRegister(targetLength, targetLength);
  3683. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3684. END;
  3685. (* clip negative lengths to 0 *)
  3686. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3687. IF staticTargetLength < 0 THEN
  3688. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3689. END
  3690. ELSE
  3691. skipLabel1 := NewLabel();
  3692. TransferToRegister(targetLength, targetLength);
  3693. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3694. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3695. SetLabel(skipLabel1)
  3696. END;
  3697. (* 3. incorporate index step size: *)
  3698. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3699. (*step size and current target length are static *)
  3700. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3701. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3702. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3703. (* step size = 1: nothing to do *)
  3704. ELSE
  3705. (* emit code for this:
  3706. targetLength := (targetLength-1) DIV stepSize +1;
  3707. *)
  3708. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3709. DivInt(targetLength, targetLength, stepSize);
  3710. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3711. END;
  3712. (* determine increment of target array for current dimension *)
  3713. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3714. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3715. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3716. (* step size = 1 *)
  3717. targetIncrement := sourceIncrement.op;
  3718. UseIntermediateOperand(targetIncrement)
  3719. ELSE
  3720. (* targetIncrement := sourceIncrement * stepSize *)
  3721. Reuse1(targetIncrement, stepSize);
  3722. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3723. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3724. END;
  3725. ReleaseIntermediateOperand(stepSize);
  3726. (* write length and increment of target array to descriptor *)
  3727. IF destDimOffset < 0 THEN
  3728. (* determine which dimension of target array is currently looked at *)
  3729. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3730. TransferToRegister(destDim, tmp);
  3731. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3732. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3733. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3734. ReleaseIntermediateOperand(destDim);
  3735. INC(destDimOffset);
  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.resolved(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. ELSIF temporary THEN
  6010. IF SemanticChecker.IsPointerType(variable.type) THEN
  6011. Symbol(variable, operand);
  6012. MakeMemory(tmp,operand.op,addressType,0);
  6013. ReleaseOperand(operand);
  6014. Emit(Mov(position,tmp, nil ) );
  6015. ReleaseIntermediateOperand(tmp);
  6016. END;
  6017. END;
  6018. InitFields(type, operand.op,0);
  6019. ReleaseOperand(operand);
  6020. END;
  6021. END InitVariable;
  6022. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6023. VAR end: Label;
  6024. BEGIN
  6025. IF type.form = SyntaxTree.Tensor THEN
  6026. InitOperand(result,ModeValue);
  6027. ReuseCopy(result.op,base);
  6028. end := NewLabel();
  6029. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6030. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6031. SetLabel(end);
  6032. Convert(result.op,int32);
  6033. ELSE
  6034. InitOperand(result,ModeValue);
  6035. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6036. END
  6037. END MathArrayDim;
  6038. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6039. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6040. BEGIN
  6041. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6042. MakeMemory(mem,base,addressType,offset);
  6043. Emit(Mov(position,mem,value));
  6044. ReleaseIntermediateOperand(mem);
  6045. END PutMathArrayField;
  6046. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6047. VAR mem: IntermediateCode.Operand;
  6048. BEGIN
  6049. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6050. MakeMemory(mem,base,addressType,offset);
  6051. Emit(Mov(position,mem,value));
  6052. ReleaseIntermediateOperand(mem);
  6053. END PutMathArrayFieldOffset;
  6054. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6055. BEGIN
  6056. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6057. MakeMemory(value,base,addressType,offset);
  6058. END GetMathArrayField;
  6059. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6060. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6061. BEGIN
  6062. IF incr THEN
  6063. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6064. ELSE
  6065. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6066. END;
  6067. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6068. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6069. ELSE
  6070. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6071. Emit(Mov(position,reg,dim));
  6072. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6073. Emit(Add(position,reg,reg,base));
  6074. MakeMemory(mem, reg, addressType, offset);
  6075. ReleaseIntermediateOperand(reg);
  6076. Emit(Mov(position,mem,value));
  6077. ReleaseIntermediateOperand(mem);
  6078. END;
  6079. END PutMathArrayLenOrIncr;
  6080. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6081. BEGIN
  6082. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6083. END PutMathArrayLength;
  6084. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6085. BEGIN
  6086. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6087. END PutMathArrayIncrement;
  6088. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6089. BEGIN
  6090. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6091. END GetMathArrayIncrement;
  6092. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6093. BEGIN
  6094. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6095. END GetMathArrayLength;
  6096. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6097. VAR dimOp: IntermediateCode.Operand;
  6098. BEGIN
  6099. dimOp := IntermediateCode.Immediate(int32, dim);
  6100. GetMathArrayLength(type, operand, dimOp, check, result);
  6101. END GetMathArrayLengthAt;
  6102. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6103. VAR dimOp: IntermediateCode.Operand;
  6104. BEGIN
  6105. dimOp := IntermediateCode.Immediate(int32, dim);
  6106. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6107. END GetMathArrayIncrementAt;
  6108. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6109. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6110. offset: LONGINT;
  6111. BEGIN
  6112. IF increment THEN
  6113. offset := MathIncrOffset;
  6114. ELSE
  6115. offset := MathLenOffset;
  6116. END;
  6117. INC(offset,operand.dimOffset*2);
  6118. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6119. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6120. END;
  6121. (* static dimension *)
  6122. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6123. IF check & (type.form = SyntaxTree.Tensor) THEN
  6124. DimensionCheck(operand.tag,dim,BrltL);
  6125. END;
  6126. val := SHORT(dim.intValue);
  6127. IF type.form # SyntaxTree.Tensor THEN
  6128. t := SemanticChecker.ArrayBase(type,val);
  6129. type := t.resolved(SyntaxTree.MathArrayType);
  6130. IF type.form = SyntaxTree.Static THEN
  6131. IF increment THEN
  6132. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6133. ELSE
  6134. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6135. END;
  6136. InitOperand(result,ModeValue);
  6137. result.op := res;
  6138. RETURN;
  6139. END;
  6140. END;
  6141. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6142. MakeMemory(res,operand.tag,addressType,offset);
  6143. (*
  6144. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6145. *)
  6146. InitOperand(result,ModeValue);
  6147. result.op := res;
  6148. ELSE
  6149. Convert(dim,addressType);
  6150. IF check THEN
  6151. IF type.form = SyntaxTree.Tensor THEN
  6152. DimensionCheck(operand.tag,dim,BrltL);
  6153. ELSIF isUnchecked THEN (* do nothing *)
  6154. ELSE
  6155. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6156. END;
  6157. END;
  6158. end := NewLabel(); next := NIL;
  6159. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6160. Emit(Mov(position,res,dim));
  6161. Convert(res,int32);
  6162. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6163. WHILE t IS SyntaxTree.MathArrayType DO
  6164. type := t(SyntaxTree.MathArrayType);
  6165. IF type.form = SyntaxTree.Static THEN
  6166. imm := IntermediateCode.Immediate(int32,val);
  6167. next := NewLabel();
  6168. BrneL(next,imm,res);
  6169. IF increment THEN
  6170. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6171. ELSE
  6172. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6173. END;
  6174. Emit(MovReplace(position,res,imm));
  6175. BrL(end);
  6176. ELSE hasDynamicPart := TRUE;
  6177. END;
  6178. t := type.arrayBase.resolved;
  6179. val := val + 1;
  6180. IF next # NIL THEN SetLabel(next) END;
  6181. END;
  6182. IF hasDynamicPart THEN
  6183. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6184. Emit(Mov(position,res2,dim));
  6185. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6186. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6187. Emit(Add(position,res2,res2,imm));
  6188. Emit(Add(position,res2,res2,operand.tag));
  6189. IntermediateCode.MakeMemory(res2,int32);
  6190. Emit(MovReplace(position,res,res2));
  6191. ReleaseIntermediateOperand(res2);
  6192. END;
  6193. SetLabel(end);
  6194. Convert(res,int32);
  6195. InitOperand(result,ModeValue);
  6196. result.op := res;
  6197. END;
  6198. END MathArrayLenOrIncr;
  6199. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6200. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6201. offset: LONGINT;
  6202. BEGIN
  6203. offset := operand.dimOffset+DynamicDim(type)-1;
  6204. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6205. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6206. val := SHORT(dim.intValue);
  6207. t := SemanticChecker.ArrayBase(type,val);
  6208. type := t.resolved(SyntaxTree.ArrayType);
  6209. IF type.form = SyntaxTree.Static THEN
  6210. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6211. ELSE
  6212. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6213. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6214. END;
  6215. UseIntermediateOperand(res);
  6216. InitOperand(result,ModeValue);
  6217. result.op := res;
  6218. ELSE
  6219. Convert(dim,addressType);
  6220. IF ~isUnchecked THEN
  6221. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6222. END;
  6223. end := NewLabel(); next := NIL;
  6224. (* ReuseCopy(dim,res); *)
  6225. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6226. Emit(Mov(position,res,dim));
  6227. Convert(res,int32);
  6228. Convert(res,int32);
  6229. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6230. WHILE t IS SyntaxTree.ArrayType DO
  6231. type := t(SyntaxTree.ArrayType);
  6232. IF type.form = SyntaxTree.Static THEN
  6233. imm := IntermediateCode.Immediate(int32,val);
  6234. next := NewLabel();
  6235. BrneL(next,imm,res);
  6236. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6237. Emit(MovReplace(position,res,imm));
  6238. BrL(end);
  6239. ELSE hasDynamicPart := TRUE;
  6240. END;
  6241. t := type.arrayBase.resolved;
  6242. val := val + 1;
  6243. IF next # NIL THEN SetLabel(next) END;
  6244. END;
  6245. IF hasDynamicPart THEN
  6246. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6247. Convert(res2,addressType);
  6248. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6249. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6250. Emit(Sub(position,res2,imm,res2));
  6251. Emit(Add(position,res2,res2,operand.tag));
  6252. IntermediateCode.MakeMemory(res2,int32);
  6253. Emit(MovReplace(position,res,res2));
  6254. ReleaseIntermediateOperand(res2);
  6255. END;
  6256. SetLabel(end);
  6257. Convert(res,int32);
  6258. InitOperand(result,ModeValue);
  6259. result.op := res;
  6260. END;
  6261. END ArrayLen;
  6262. (**
  6263. create a temporary variable in current scope
  6264. **)
  6265. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6266. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6267. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6268. BEGIN
  6269. IF ~register THEN
  6270. variable := temporaries.GetFreeVariable(type, untraced, index);
  6271. ELSE
  6272. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6273. END;
  6274. scope := currentScope;
  6275. IF variable = NIL THEN
  6276. COPY("@hiddenIRVar",string);
  6277. Basic.AppendNumber(string,index);
  6278. name := SyntaxTree.NewIdentifier(string);
  6279. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6280. variable.SetType(type);
  6281. variable.SetAccess(SyntaxTree.Hidden);
  6282. variable.SetUntraced(untraced);
  6283. IF ~register THEN
  6284. temporaries.AddVariable(variable);
  6285. IF scope.lastVariable # NIL THEN
  6286. offset := scope.lastVariable.offsetInBits;
  6287. ELSE
  6288. offset := 0;
  6289. END;
  6290. DEC(offset,system.SizeOf(variable.type));
  6291. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6292. variable(SyntaxTree.Variable).SetOffset(offset);
  6293. scope.AddVariable(variable(SyntaxTree.Variable));
  6294. scope.EnterSymbol(variable, duplicate);
  6295. ASSERT(~duplicate);
  6296. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6297. ELSE
  6298. variable.SetUseRegister(TRUE);
  6299. variable(SyntaxTree.Variable).SetOffset(0);
  6300. END;
  6301. ELSE
  6302. variable.SetUntraced(untraced);
  6303. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6304. (*
  6305. ASSERT(variable.type.resolved = type.resolved)
  6306. *)
  6307. END;
  6308. RETURN variable(SyntaxTree.Variable)
  6309. END GetTemporaryVariable;
  6310. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6311. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6312. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6313. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6314. i: LONGINT; duplicate: BOOLEAN;
  6315. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6316. VAR variable: SyntaxTree.Variable;
  6317. BEGIN
  6318. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6319. variable.SetType(type);
  6320. recordScope.AddVariable(variable);
  6321. END AddVariable;
  6322. BEGIN
  6323. name := "@ArrayDescriptor";
  6324. Basic.AppendNumber(name,dimensions);
  6325. identifier := SyntaxTree.NewIdentifier(name);
  6326. parentScope := module.module.moduleScope;
  6327. symbol := parentScope.FindSymbol(identifier);
  6328. IF symbol # NIL THEN
  6329. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6330. type := typeDeclaration.declaredType;
  6331. ELSE
  6332. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6333. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6334. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6335. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6336. recordType.SetTypeDeclaration(typeDeclaration);
  6337. recordType.SetState(SyntaxTree.Resolved);
  6338. typeDeclaration.SetDeclaredType(recordType);
  6339. AddVariable("@ptr",system.anyType);
  6340. AddVariable("@adr",system.addressType);
  6341. AddVariable("@flags",system.addressType);
  6342. AddVariable("@dim",system.addressType);
  6343. AddVariable("@elementSize",system.addressType);
  6344. FOR i := 0 TO dimensions-1 DO
  6345. name := "@len";
  6346. Basic.AppendNumber(name,i);
  6347. AddVariable(name,system.addressType);
  6348. name := "@incr";
  6349. Basic.AppendNumber(name,i);
  6350. AddVariable(name,system.addressType);
  6351. END;
  6352. parentScope.AddTypeDeclaration(typeDeclaration);
  6353. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6354. ASSERT(~duplicate);
  6355. type := recordType;
  6356. END;
  6357. RETURN type
  6358. END GetMathArrayDescriptorType;
  6359. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6360. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6361. BEGIN
  6362. type := GetMathArrayDescriptorType(dimensions);
  6363. Emit(Push(position,op.op));
  6364. (* push type descriptor *)
  6365. reg := TypeDescriptorAdr(type);
  6366. IF ~newObjectFile THEN
  6367. IntermediateCode.MakeMemory(reg,addressType);
  6368. END;
  6369. Emit(Push(position,reg));
  6370. ReleaseIntermediateOperand(reg);
  6371. (* push realtime flag: false by default *)
  6372. Emit(Push(position,false));
  6373. CallThis(position,"Heaps","NewRec",3);
  6374. END NewMathArrayDescriptor;
  6375. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6376. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6377. BEGIN
  6378. NEW(string, LEN(s)); COPY(s, string^);
  6379. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6380. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6381. sv.SetType(type);
  6382. Designate(sv,res);
  6383. Emit(Push(position,res.tag));
  6384. Emit(Push(position,res.op));
  6385. ReleaseOperand(res);
  6386. END PushConstString;
  6387. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6388. BEGIN
  6389. IF b THEN
  6390. Emit(Push(Basic.invalidPosition, true));
  6391. ELSE
  6392. Emit(Push(Basic.invalidPosition, false));
  6393. END;
  6394. END PushConstBoolean;
  6395. PROCEDURE PushConstSet(v: SET);
  6396. VAR value: SyntaxTree.Value; op: Operand;
  6397. BEGIN
  6398. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6399. value.SetType(system.setType);
  6400. Evaluate(value, op);
  6401. Emit(Push(Basic.invalidPosition, op.op));
  6402. ReleaseOperand(op);
  6403. END PushConstSet;
  6404. PROCEDURE PushConstInteger(v: LONGINT);
  6405. VAR value: SyntaxTree.Value; op: Operand;
  6406. BEGIN
  6407. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6408. value.SetType(system.longintType);
  6409. Evaluate(value, op);
  6410. Emit(Push(Basic.invalidPosition, op.op));
  6411. ReleaseOperand(op);
  6412. END PushConstInteger;
  6413. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6414. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6415. section: IntermediateCode.Section;
  6416. BEGIN
  6417. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6418. Global.GetSymbolSegmentedName(symbol, name);
  6419. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6420. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6421. procedure.SetScope(moduleScope);
  6422. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6423. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6424. procedure.SetAccess(SyntaxTree.Hidden);
  6425. currentScope := procedureScope;
  6426. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6427. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6428. RETURN section;
  6429. END OpenInitializer;
  6430. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6431. BEGIN
  6432. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6433. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6434. section := prev;
  6435. END CloseInitializer;
  6436. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6437. VAR name: SyntaxTree.IdentifierString;
  6438. variable: SyntaxTree.Variable;
  6439. parameter: SyntaxTree.Parameter;
  6440. type: SyntaxTree.Type;
  6441. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6442. BEGIN
  6443. InitOperand(op,ModeReference);
  6444. op.op := fp;
  6445. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6446. Dereference(op, x, FALSE);
  6447. result := op;
  6448. Symbol(symbol, op);
  6449. END Field;
  6450. PROCEDURE Direction(direction: LONGINT): SET;
  6451. BEGIN
  6452. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6453. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6454. ELSE HALT(100);
  6455. END;
  6456. END Direction;
  6457. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6458. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6459. BEGIN
  6460. Field(port, op);
  6461. ToMemory(op.op,addressType,0);
  6462. Emit(Push(Basic.invalidPosition, op.op));
  6463. ReleaseOperand(op);
  6464. Basic.GetString(modifier.identifier, name);
  6465. PushConstString(name);
  6466. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6467. ASSERT(SemanticChecker.IsStringType(value.type));
  6468. Designate(value, op);
  6469. Emit(Push(modifier.position, op.tag));
  6470. Emit(Push(modifier.position, op.op));
  6471. ReleaseOperand(op);
  6472. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6473. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6474. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6475. Evaluate(value, op);
  6476. Emit(Push(modifier.position, op.op));
  6477. ReleaseOperand(op);
  6478. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6479. ELSE
  6480. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6481. END;
  6482. END AddPortProperty;
  6483. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6484. VAR modifier: SyntaxTree.Modifier;
  6485. BEGIN
  6486. modifier := parameter.modifiers;
  6487. WHILE modifier # NIL DO
  6488. AddPortProperty(parameter,modifier, modifier.expression);
  6489. modifier := modifier.nextModifier;
  6490. END;
  6491. END AddPortProperties;
  6492. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6493. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6494. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6495. PROCEDURE PushLens(type: SyntaxTree.Type);
  6496. BEGIN
  6497. IF IsSemiDynamicArray(type) THEN
  6498. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6499. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6500. Emit(Push(Basic.invalidPosition, op.op));
  6501. ReleaseOperand(op);
  6502. INC(dim);
  6503. ELSIF IsStaticArray(type) THEN
  6504. len := len * type(SyntaxTree.ArrayType).staticLength;
  6505. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6506. INC(dim);
  6507. ELSE
  6508. baseType := type;
  6509. END;
  6510. END PushLens;
  6511. BEGIN
  6512. (* cell *)
  6513. IF parameter.type IS SyntaxTree.ArrayType THEN
  6514. type := parameter.type;
  6515. dim := 0;
  6516. len := 1;
  6517. PushLens(type);
  6518. portType := baseType.resolved(SyntaxTree.PortType);
  6519. ELSE
  6520. portType := parameter.type(SyntaxTree.PortType);
  6521. END;
  6522. PushSelfPointer();
  6523. (* port / array of ports *)
  6524. IF IsStaticArray(type) THEN
  6525. PushConstInteger(len);
  6526. END;
  6527. Field(parameter, op);
  6528. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6529. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6530. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6531. Designate(d, op);*)
  6532. Emit(Push(Basic.invalidPosition, op.op));
  6533. ReleaseOperand(op);
  6534. (* name *)
  6535. PushConstString(name);
  6536. (* inout *)
  6537. PushConstSet(Direction(portType.direction));
  6538. (* width *)
  6539. PushConstInteger(portType.sizeInBits);
  6540. IF parameter.type IS SyntaxTree.PortType THEN
  6541. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6542. AddPortProperties(parameter);
  6543. ELSIF IsStaticArray(type)THEN
  6544. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6545. ELSIF IsSemiDynamicArray(type) THEN
  6546. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6547. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6548. Emit(Add(position,reg, sp, size));
  6549. (* dim *)
  6550. PushConstInteger(dim);
  6551. (* len array *)
  6552. Emit(Push(position, reg));
  6553. ReleaseIntermediateOperand(reg);
  6554. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6555. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6556. Emit(Add(position, sp,sp, size));
  6557. ELSE
  6558. HALT(100);
  6559. END;
  6560. END Parameter;
  6561. BEGIN
  6562. IF backend.cellsAreObjects THEN
  6563. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6564. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6565. END;
  6566. parameter := x.firstParameter;
  6567. WHILE (parameter # NIL) DO
  6568. type := parameter.type.resolved;
  6569. WHILE (type IS SyntaxTree.ArrayType) DO
  6570. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6571. END;
  6572. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6573. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6574. Parameter(name,parameter);
  6575. END;
  6576. parameter := parameter.nextParameter;
  6577. END;
  6578. ELSE HALT(200)
  6579. END;
  6580. END AddPorts;
  6581. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6582. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6583. BEGIN
  6584. Symbol(cell,op);
  6585. ToMemory(op.op,addressType,0);
  6586. Emit(Push(position,op.op));
  6587. ReleaseOperand(op);
  6588. property.GetName(name);
  6589. (* does not work when inheritance is used:
  6590. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6591. *)
  6592. PushConstString(name);
  6593. IF (value # NIL) THEN
  6594. ASSERT(
  6595. SemanticChecker.IsStringType(property.type)
  6596. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6597. OR (property.type.resolved IS SyntaxTree.FloatType)
  6598. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6599. OR (property.type.resolved IS SyntaxTree.SetType)
  6600. );
  6601. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6602. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6603. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6604. Designate(d, op);
  6605. IF SemanticChecker.IsStringType(property.type) THEN
  6606. Emit(Push(Basic.invalidPosition, op.tag))
  6607. END;
  6608. Emit(Push(Basic.invalidPosition, op.op));
  6609. ReleaseOperand(op);
  6610. END;
  6611. IF value = NIL THEN
  6612. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6613. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6614. ASSERT(SemanticChecker.IsStringType(value.type));
  6615. Designate(value, op);
  6616. PushString(op, value.type);
  6617. ReleaseOperand(op);
  6618. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6619. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6620. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6621. Evaluate(value, op);
  6622. Emit(Push(property.position, op.op));
  6623. ReleaseOperand(op);
  6624. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6625. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6626. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6627. Evaluate(value, op);
  6628. Emit(Push(property.position, op.op));
  6629. ReleaseOperand(op);
  6630. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6631. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6632. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6633. Evaluate(value, op);
  6634. Emit(Push(property.position, op.op));
  6635. ReleaseOperand(op);
  6636. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6637. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6638. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6639. Evaluate(value, op);
  6640. Emit(Push(property.position, op.op));
  6641. ReleaseOperand(op);
  6642. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6643. ELSE
  6644. HALT(200);
  6645. END;
  6646. END AddProperty;
  6647. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6648. VAR symbol: SyntaxTree.Symbol;
  6649. BEGIN
  6650. WHILE modifier # NIL DO
  6651. symbol := cellType.FindProperty(modifier.identifier);
  6652. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6653. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6654. modifier := modifier.nextModifier;
  6655. END;
  6656. END AddModifiers;
  6657. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6658. VAR last: SyntaxTree.Modifier;
  6659. BEGIN
  6660. IF to = NIL THEN
  6661. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6662. ELSE
  6663. last := to;
  6664. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6665. last := last.nextModifier;
  6666. END;
  6667. IF last.identifier # this.identifier THEN
  6668. ASSERT(last.nextModifier = NIL);
  6669. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6670. END;
  6671. END;
  6672. END AppendModifier;
  6673. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6674. BEGIN
  6675. WHILE this # NIL DO
  6676. AppendModifier(to, this);
  6677. this := this.nextModifier;
  6678. END;
  6679. END AppendModifiers;
  6680. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6681. VAR base: SyntaxTree.Type;
  6682. BEGIN
  6683. AppendModifiers(to, c.modifiers);
  6684. base := c.GetBaseValueType();
  6685. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6686. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6687. END;
  6688. END AppendCellTypeModifiers;
  6689. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6690. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6691. BEGIN
  6692. Basic.GetString(modifier.identifier, name);
  6693. PushConstString(name);
  6694. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6695. ASSERT(SemanticChecker.IsStringType(value.type));
  6696. Designate(value, op);
  6697. PushString(op, value.type);
  6698. ReleaseOperand(op);
  6699. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6700. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6701. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6702. Evaluate(value, op);
  6703. Emit(Push(modifier.position, op.op));
  6704. ReleaseOperand(op);
  6705. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6706. ELSE
  6707. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6708. END;
  6709. END AddPortProperty;
  6710. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6711. BEGIN
  6712. WHILE modifier # NIL DO
  6713. AddPortProperty(modifier, modifier.expression);
  6714. modifier := modifier.nextModifier;
  6715. END;
  6716. END AddPortProperties;
  6717. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6718. VAR op: Operand;
  6719. BEGIN
  6720. Evaluate(p, op);
  6721. Emit(Push(p.position, op.op));
  6722. ReleaseOperand(op);
  6723. IF p IS SyntaxTree.Designator THEN
  6724. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6725. END;
  6726. END PushPort;
  6727. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6728. VAR tmp: IntermediateCode.Operand;
  6729. BEGIN
  6730. actualType := actualType.resolved;
  6731. IF actualType IS SyntaxTree.StringType THEN
  6732. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6733. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6734. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6735. ELSE
  6736. tmp := op.tag;
  6737. IntermediateCode.MakeMemory(tmp,addressType);
  6738. Emit(Push(position,tmp));
  6739. END;
  6740. Emit(Push(position,op.op))
  6741. END PushString;
  6742. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6743. VAR
  6744. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6745. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6746. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6747. tmp:IntermediateCode.Operand;
  6748. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6749. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6750. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6751. dest: IntermediateCode.Operand;
  6752. staticLength: LONGINT; itype: IntermediateCode.Type;
  6753. convert,isTensor: BOOLEAN;
  6754. recordType: SyntaxTree.RecordType;
  6755. baseType: SyntaxTree.Type;
  6756. flags: SET;
  6757. left: SyntaxTree.Expression;
  6758. call: SyntaxTree.Designator;
  6759. procedure: SyntaxTree.Procedure;
  6760. temporaryVariable: SyntaxTree.Variable;
  6761. dummy: IntermediateCode.Operand;
  6762. customBuiltin: SyntaxTree.CustomBuiltin;
  6763. isVarPar: ARRAY 3 OF BOOLEAN;
  6764. callsection: Sections.Section;
  6765. segmentedName: Basic.SegmentedName;
  6766. needsTrace: BOOLEAN;
  6767. n: ARRAY 256 OF CHAR;
  6768. modifier: SyntaxTree.Modifier;
  6769. previous, init: IntermediateCode.Section;
  6770. prevScope: SyntaxTree.Scope;
  6771. firstPar: LONGINT;
  6772. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6773. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6774. priority: IntermediateCode.Operand;
  6775. op,callop: Operand;
  6776. BEGIN
  6777. IF type = NIL THEN RETURN END;
  6778. type := type.resolved;
  6779. IF type IS SyntaxTree.PointerType THEN
  6780. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6781. END;
  6782. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6783. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6784. recordScope := type(SyntaxTree.RecordType).recordScope;
  6785. IF recordScope.bodyProcedure # NIL THEN
  6786. procedure := recordScope.bodyProcedure;
  6787. body := procedure.procedureScope.body;
  6788. Emit(Push(position,self));
  6789. IF body.isActive THEN
  6790. StaticCallOperand(callop,procedure);
  6791. Emit(Push(position,callop.op));
  6792. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6793. Convert(priority,sizeType);
  6794. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6795. END;
  6796. Emit(Push(position,priority));
  6797. ReleaseIntermediateOperand(priority);
  6798. IF backend.cooperative THEN
  6799. Emit(Push(position,self));
  6800. CallThis(position,"Activities","Create",3)
  6801. ELSE
  6802. flags := 0;
  6803. IF body.isSafe THEN
  6804. flags := 1;
  6805. END;
  6806. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6807. Emit(Push(position,self));
  6808. CallThis(position,"Objects","CreateProcess",4)
  6809. END;
  6810. ELSE
  6811. Emit(Push(position,self));
  6812. StaticCallOperand(callop,procedure);
  6813. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6814. END;
  6815. Emit(Pop(position,self));
  6816. END;
  6817. END CallBodies;
  6818. PROCEDURE PushTD(type: SyntaxTree.Type);
  6819. VAR op: IntermediateCode.Operand;
  6820. BEGIN
  6821. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6822. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6823. ELSE
  6824. IF type.resolved IS SyntaxTree.PointerType THEN
  6825. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6826. END;
  6827. op := TypeDescriptorAdr(type.resolved);
  6828. IF ~newObjectFile THEN
  6829. IntermediateCode.MakeMemory(op,addressType);
  6830. END;
  6831. Emit(Push(position,op));
  6832. END
  6833. END PushTD;
  6834. BEGIN
  6835. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6836. dest := destination; destination := emptyOperand;
  6837. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6838. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6839. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6840. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6841. CASE x.id OF
  6842. (* ---- COPY ----- *)
  6843. |Global.Copy:
  6844. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6845. (* ---- EXCL, INCL----- *)
  6846. |Global.Excl,Global.Incl:
  6847. Evaluate(p0,s0);
  6848. Evaluate(p1,s1);
  6849. Convert(s1.op,setType);
  6850. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6851. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6852. END;
  6853. ReuseCopy(res,s0.op);
  6854. ReleaseOperand(s0);
  6855. Reuse1(tmp,s1.op);
  6856. ReleaseOperand(s1);
  6857. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6858. IF x.id = Global.Excl THEN
  6859. Emit(Not(position,tmp,tmp));
  6860. Emit(And(position,res,res,tmp));
  6861. ELSE
  6862. Emit(Or(position,res,res,tmp));
  6863. END;
  6864. ReleaseIntermediateOperand(tmp);
  6865. Designate(p0,s0);
  6866. ToMemory(s0.op,setType,0);
  6867. Emit(Mov(position,s0.op,res));
  6868. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6869. (* ---- DISPOSE ----- *)
  6870. |Global.Dispose:
  6871. Designate(p0,s0);
  6872. Emit(Push(position,s0.op));
  6873. ReleaseOperand(s0);
  6874. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6875. (* ---- GETPROCEDURE ----- *)
  6876. |Global.GetProcedure:
  6877. Designate(p0,s0);
  6878. PushString(s0,p0.type);
  6879. Designate(p1,s1);
  6880. PushString(s1,p1.type);
  6881. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6882. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6883. ELSE PushTD(procedureType.firstParameter.type)
  6884. END;
  6885. PushTD(procedureType.returnType);
  6886. Designate(p2,s2);
  6887. Emit(Push(position,s2.op));
  6888. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6889. CallThis(position,"Modules","GetProcedure", 7);
  6890. (* ---- ASH, LSH, ROT ----- *)
  6891. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6892. Evaluate(p0,s0);
  6893. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6894. (* make unsigned arguments in order to produced a logical shift *)
  6895. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6896. convert:= TRUE;
  6897. itype := s0.op.type;
  6898. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6899. Convert(s0.op,itype);
  6900. ELSE
  6901. convert := FALSE;
  6902. END;
  6903. END;
  6904. Evaluate(p1,s1);
  6905. IF IsIntegerConstant(p1,hint) THEN
  6906. ReuseCopy(reg,s0.op);
  6907. IF hint > 0 THEN
  6908. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6909. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6910. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6911. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6912. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6913. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6914. END;
  6915. ELSIF hint < 0 THEN
  6916. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6917. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6918. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6919. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6920. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6921. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6922. END;
  6923. END;
  6924. ReleaseOperand(s0); ReleaseOperand(s1);
  6925. ELSE
  6926. exit := NewLabel();
  6927. end := NewLabel();
  6928. ReuseCopy(reg,s0.op);
  6929. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6930. Reuse1(tmp,s1.op);
  6931. Emit(Neg(position,tmp,s1.op));
  6932. Convert(tmp,s1.op.type);
  6933. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6934. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6935. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6936. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6937. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6938. END;
  6939. ReleaseIntermediateOperand(tmp);
  6940. BrL(end);
  6941. SetLabel(exit);
  6942. ReuseCopy(tmp,s1.op);
  6943. Convert(tmp,s1.op.type);
  6944. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6945. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6946. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6947. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6948. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6949. END;
  6950. ReleaseIntermediateOperand(tmp);
  6951. SetLabel(end);
  6952. ReleaseOperand(s0); ReleaseOperand(s1);
  6953. END;
  6954. InitOperand(result,ModeValue);
  6955. IF convert THEN
  6956. itype := reg.type;
  6957. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6958. Convert(reg,itype);
  6959. END;
  6960. result.op := reg;
  6961. (* ---- CAP ----- *)
  6962. |Global.Cap:
  6963. Evaluate(p0,result);
  6964. ReuseCopy(reg,result.op);
  6965. ReleaseIntermediateOperand(result.op);
  6966. ignore := NewLabel();
  6967. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6968. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6969. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6970. SetLabel(ignore);
  6971. result.op := reg;
  6972. (* ---- CHR ----- *)
  6973. |Global.Chr, Global.Chr32:
  6974. Evaluate(p0,result);
  6975. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6976. |Global.Entier, Global.EntierH:
  6977. Evaluate(p0,result);
  6978. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6979. (* ---- MIN and MAX ----- *)
  6980. |Global.Max,Global.Min:
  6981. Evaluate(p0,s0);
  6982. Evaluate(p1,s1);
  6983. Reuse2(res,s0.op,s1.op);
  6984. else := NewLabel();
  6985. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6986. ELSE BrltL(else,s1.op,s0.op) END;
  6987. Emit(Mov(position,res,s0.op));
  6988. ReleaseOperand(s0);
  6989. end := NewLabel();
  6990. BrL(end);
  6991. SetLabel(else);
  6992. Emit(MovReplace(position,res,s1.op));
  6993. SetLabel(end);
  6994. ReleaseOperand(s1);
  6995. InitOperand(result,ModeValue);
  6996. result.op := res;
  6997. (* ---- ODD ----- *)
  6998. |Global.Odd:
  6999. IF ~conditional THEN
  7000. ConditionToValue(x)
  7001. ELSE
  7002. Evaluate(p0,result);
  7003. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7004. Reuse1(res,result.op);
  7005. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7006. ReleaseIntermediateOperand(result.op);
  7007. result.op := res;
  7008. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7009. ReleaseOperand(result);
  7010. BrL(falseLabel);
  7011. END;
  7012. (* ---- ORD ----- *)
  7013. |Global.Ord, Global.Ord32:
  7014. Evaluate(p0,result);
  7015. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7016. (* ---- SHORT, LONG ----- *)
  7017. |Global.Short, Global.Long:
  7018. Evaluate(p0,result);
  7019. IF x.type IS SyntaxTree.ComplexType THEN
  7020. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7021. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7022. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7023. ELSE
  7024. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7025. END
  7026. (* ---- HALT, SYSTEM.HALT----- *)
  7027. |Global.Halt, Global.systemHalt:
  7028. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7029. EmitTrap (position, val);
  7030. (* ---- ASSERT ----- *)
  7031. |Global.Assert:
  7032. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7033. trueL := NewLabel();
  7034. falseL := NewLabel();
  7035. Condition(p0,trueL,falseL);
  7036. IF p1 = NIL THEN val := AssertTrap
  7037. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7038. END;
  7039. SetLabel(falseL);
  7040. EmitTrap(position,val);
  7041. SetLabel(trueL);
  7042. END;
  7043. (*
  7044. Emit(TrapC(result.op,val);
  7045. *)
  7046. (* ---- INC, DEC----- *)
  7047. |Global.Inc,Global.Dec:
  7048. Expression(p0); adr := result.op;
  7049. LoadValue(result,p0.type); l := result;
  7050. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7051. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7052. END;
  7053. IF x.id = Global.Inc THEN
  7054. Emit(Add(position,l.op,l.op,r.op));
  7055. ELSE
  7056. Emit(Sub(position,l.op,l.op,r.op));
  7057. END;
  7058. ReleaseOperand(l); ReleaseOperand(r);
  7059. (* ---- LEN ----- *)
  7060. |Global.Len: (* dynamic length, static length done by checker *)
  7061. Designate(p0,operand);
  7062. IF p1 = NIL THEN
  7063. InitOperand(l,ModeValue);
  7064. l.op := IntermediateCode.Immediate(int32,0);
  7065. ELSE
  7066. Evaluate(p1,l);
  7067. END;
  7068. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7069. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7070. Dereference(operand, p0.type.resolved, FALSE);
  7071. END;
  7072. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7073. ReleaseOperand(operand); ReleaseOperand(l);
  7074. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7075. ASSERT(p1 # NIL);
  7076. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7077. Dereference(operand,p0.type.resolved,FALSE);
  7078. END;
  7079. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7080. ReleaseOperand(operand); ReleaseOperand(l);
  7081. ELSE HALT(100);
  7082. END;
  7083. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7084. (* ---- FIRST ---- *)
  7085. |Global.First:
  7086. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7087. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7088. ELSE
  7089. Designate(p0, result)
  7090. END
  7091. (* ---- LAST ---- *)
  7092. |Global.Last:
  7093. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7094. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7095. ELSE
  7096. Designate(p0, result);
  7097. (* make sure result.op is a register *)
  7098. tmp := result.op;
  7099. ReuseCopy(result.op, result.op);
  7100. ReleaseIntermediateOperand(tmp);
  7101. (* add offset to result.op *)
  7102. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7103. END
  7104. (* ---- STEP ---- *)
  7105. |Global.Step:
  7106. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7107. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7108. ELSE
  7109. Designate(p0, result);
  7110. (* make sure result.op is a register *)
  7111. tmp := result.op;
  7112. ReuseCopy(result.op, result.op);
  7113. ReleaseIntermediateOperand(tmp);
  7114. (* add offset to result.op *)
  7115. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7116. END
  7117. (* ---- RE ---- *)
  7118. |Global.Re:
  7119. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7120. Designate(p0, result)
  7121. ELSE
  7122. Evaluate(p0, result)
  7123. END
  7124. (* ---- IM ---- *)
  7125. |Global.Im:
  7126. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7127. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7128. Designate(p0, result);
  7129. (* make sure result.op is a register *)
  7130. tmp := result.op;
  7131. ReuseCopy(result.op, result.op);
  7132. ReleaseIntermediateOperand(tmp);
  7133. (* add offset to result.op *)
  7134. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7135. (* ---- ABS ----- *)
  7136. |Global.Abs:
  7137. Evaluate(p0,operand);
  7138. type := p0.type.resolved;
  7139. InitOperand(result,ModeValue);
  7140. Reuse1a(result.op,operand.op,dest);
  7141. Emit(Abs(position,result.op,operand.op));
  7142. ReleaseOperand(operand);
  7143. (* ---- WAIT ----- *)
  7144. |Global.Wait:
  7145. Evaluate(p0,operand);
  7146. Emit(Push(position,operand.op));
  7147. ReleaseOperand(operand);
  7148. CallThis(position,"Activities","Wait", 1);
  7149. (* ---- NEW ----- *)
  7150. |Global.New:
  7151. (*! the following code is only correct for "standard" Oberon calling convention *)
  7152. IF x.type # NIL THEN
  7153. type := x.type.resolved;
  7154. firstPar := 0;
  7155. ELSE
  7156. type := p0.type.resolved;
  7157. firstPar := 1;
  7158. END;
  7159. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7160. THEN
  7161. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7162. IF backend.cooperative THEN
  7163. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7164. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7165. IF recordType.isObject THEN
  7166. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7167. IF recordType.IsActive() THEN
  7168. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7169. END;
  7170. IF recordType.IsProtected() THEN
  7171. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7172. END;
  7173. ELSE
  7174. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7175. END;
  7176. END;
  7177. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7178. CallThis(position,"Runtime","New", 1);
  7179. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7180. Emit(Result(position, pointer));
  7181. exit := NewLabel();
  7182. BreqL(exit,pointer,nil);
  7183. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7184. GetRecordTypeName (recordType,name);
  7185. IF ~recordType.isObject THEN
  7186. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7187. END;
  7188. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7189. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7190. IF recordType.isObject THEN
  7191. IF recordType.IsProtected() THEN
  7192. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7193. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7194. END;
  7195. IF recordType.IsActive() THEN
  7196. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7197. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7198. END;
  7199. END;
  7200. END;
  7201. (* initialize fields *)
  7202. IF type(SyntaxTree.PointerType).isPlain THEN
  7203. size := 0;
  7204. ELSIF recordType.isObject THEN
  7205. size := BaseObjectTypeSize;
  7206. ELSE
  7207. size := BaseRecordTypeSize;
  7208. END;
  7209. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7210. (* call initializer *)
  7211. constructor := GetConstructor(recordType);
  7212. IF constructor # NIL THEN
  7213. (*! should be unified with ProcedureCallDesignator *)
  7214. Emit(Push(position,pointer));
  7215. ReleaseIntermediateOperand(pointer);
  7216. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7217. FOR i := firstPar TO x.parameters.Length()-1 DO
  7218. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7219. formalParameter := formalParameter.nextParameter;
  7220. END;
  7221. (* static call of the constructor *)
  7222. GetCodeSectionNameForSymbol(constructor,name);
  7223. ASSERT(~constructor.isInline);
  7224. IF constructor.scope.ownerModule # module.module THEN
  7225. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7226. ELSE
  7227. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7228. END;
  7229. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7230. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7231. Emit(Pop(position,pointer));
  7232. END;
  7233. (* call bodies *)
  7234. CallBodies(pointer,type);
  7235. SetLabel(exit);
  7236. needsTrace := p0.NeedsTrace();
  7237. IF needsTrace THEN ModifyAssignments(true) END;
  7238. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7239. Emit(Push(position, pointer));
  7240. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7241. Emit(Pop(position, pointer));
  7242. END;
  7243. Designate(p0,l);
  7244. IF needsTrace THEN
  7245. CallAssignPointer(l.op, pointer);
  7246. ELSE
  7247. ToMemory(l.op,addressType,0);
  7248. Emit(Mov(position,l.op,pointer));
  7249. END;
  7250. ReleaseIntermediateOperand(pointer);
  7251. ReleaseOperand(l);
  7252. IF needsTrace THEN ModifyAssignments(false) END;
  7253. ELSE (* not cooperative backend *)
  7254. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7255. IF temporaryVariable # NIL THEN
  7256. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7257. ELSE
  7258. Designate(p0,l);
  7259. END;
  7260. (* l.op contains address of pointer to record *)
  7261. Emit(Push(position,l.op)); (* address for use after syscall *)
  7262. Emit(Push(position,l.op));
  7263. ReleaseOperand(l);
  7264. (* push type descriptor *)
  7265. reg := TypeDescriptorAdr(recordType);
  7266. IF ~newObjectFile THEN
  7267. IntermediateCode.MakeMemory(reg,addressType);
  7268. END;
  7269. Emit(Push(position,reg));
  7270. ReleaseIntermediateOperand(reg);
  7271. (* push realtime flag *)
  7272. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7273. ELSE Emit(Push(position,false));
  7274. END;
  7275. CallThis(position,"Heaps","NewRec", 3);
  7276. (* check allocation success, if not successful then do not call initializers and bodies *)
  7277. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7278. Emit(Pop(position,pointer));
  7279. MakeMemory(reg,pointer,addressType,0);
  7280. ReleaseIntermediateOperand(pointer);
  7281. pointer := reg;
  7282. exit := NewLabel();
  7283. BreqL(exit,pointer,nil);
  7284. Emit(Push(position,pointer));
  7285. (* initialize fields *)
  7286. InitFields(recordType, pointer,0);
  7287. (* call initializer *)
  7288. constructor := GetConstructor(recordType);
  7289. IF constructor # NIL THEN
  7290. (*! should be unified with ProcedureCallDesignator *)
  7291. Emit(Push(position,pointer));
  7292. ReleaseIntermediateOperand(pointer);
  7293. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7294. FOR i := firstPar TO x.parameters.Length()-1 DO
  7295. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7296. formalParameter := formalParameter.nextParameter;
  7297. END;
  7298. (* static call of the constructor *)
  7299. GetCodeSectionNameForSymbol(constructor,name);
  7300. ASSERT(~constructor.isInline);
  7301. IF constructor.scope.ownerModule # module.module THEN
  7302. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7303. ELSE
  7304. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7305. END;
  7306. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7307. ELSE
  7308. ReleaseIntermediateOperand(pointer);
  7309. END;
  7310. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7311. Emit(Pop(position,pointer));
  7312. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7313. Designate(p0,l);
  7314. ToMemory(l.op,addressType,0);
  7315. Emit(Mov(position,l.op,pointer));
  7316. ReleaseOperand(l);
  7317. result.tag := emptyOperand;
  7318. ELSIF (x.type # NIL) THEN
  7319. result := l; (* temporary variable is the result of NEW Type() *)
  7320. END;
  7321. (* call bodies *)
  7322. CallBodies(pointer,type);
  7323. ReleaseIntermediateOperand(pointer);
  7324. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7325. end := NewLabel();
  7326. BrL(end);
  7327. SetLabel(exit);
  7328. Designate(p0,l);
  7329. ToMemory(l.op,addressType,0);
  7330. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7331. ReleaseOperand(l);
  7332. SetLabel(end);
  7333. ELSE
  7334. SetLabel(exit);
  7335. END;
  7336. END;
  7337. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7338. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7339. IF ~backend.cooperative THEN (* simpler version *)
  7340. (*
  7341. push len0
  7342. push len1
  7343. push len2
  7344. push len_size
  7345. push len_adr
  7346. push tag
  7347. push static elements
  7348. push element size
  7349. push adr
  7350. *)
  7351. dim := 0;
  7352. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7353. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7354. parameter := x.parameters.GetExpression(i);
  7355. Evaluate(parameter,r);
  7356. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7357. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7358. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7359. END;
  7360. Emit(Push(position,r.op));
  7361. ReleaseOperand(r);
  7362. INC(dim);
  7363. END;
  7364. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7365. Emit(Mov(position, adr, sp));
  7366. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7367. Emit(Push(position, adr));
  7368. ReleaseIntermediateOperand(adr);
  7369. openDim := dim;
  7370. staticLength := 1;
  7371. IF type IS SyntaxTree.ArrayType THEN
  7372. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7373. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7374. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7375. END;
  7376. END;
  7377. IF SemanticChecker.ContainsPointer(type) THEN
  7378. tmp := TypeDescriptorAdr(type);
  7379. IF ~newObjectFile THEN
  7380. IntermediateCode.MakeMemory(tmp,addressType);
  7381. END;
  7382. ELSE
  7383. tmp := nil;
  7384. END;
  7385. Emit(Push(position,tmp)); (* type descriptor *)
  7386. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7387. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7388. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7389. Designate(p0,l);
  7390. Emit(Push(position,l.op)); (* address *)
  7391. ReleaseOperand(l);
  7392. CallThis(position,"Heaps","NewArray", 6);
  7393. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7394. Emit(Add(position,sp,sp,tmp));
  7395. ELSE
  7396. dim := 0;
  7397. IntermediateCode.InitOperand(reg);
  7398. IF p1 # NIL THEN
  7399. FOR i := firstPar TO x.parameters.Length()-1 DO
  7400. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7401. parameter := x.parameters.GetExpression(i);
  7402. Evaluate(parameter,r);
  7403. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7404. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7405. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7406. END;
  7407. Emit(Push(position,r.op));
  7408. IF i=1 THEN
  7409. CopyInt(reg,r.op);
  7410. ELSE
  7411. MulInt(reg, reg, r.op);
  7412. END;
  7413. ReleaseOperand(r);
  7414. INC(dim);
  7415. END;
  7416. Convert(reg,addressType);
  7417. ELSE
  7418. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7419. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7420. END;
  7421. openDim := dim;
  7422. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7423. IF backend.cooperative THEN
  7424. size := ToMemoryUnits(system,system.SizeOf(type));
  7425. WHILE type IS SyntaxTree.ArrayType DO
  7426. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7427. END;
  7428. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7429. IF (size # 1) THEN
  7430. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7431. END;
  7432. Emit(Push(position,reg));
  7433. size := ToMemoryUnits(system,system.SizeOf(type));
  7434. IF (size # 1) THEN
  7435. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7436. END;
  7437. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7438. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7439. Emit(Push(position,reg));
  7440. ReleaseIntermediateOperand(reg);
  7441. CallThis(position,"Runtime","New", 1);
  7442. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7443. Emit(Result(position, pointer));
  7444. exit := NewLabel();
  7445. else := NewLabel();
  7446. BreqL(else,pointer,nil);
  7447. IF ~type.hasPointers THEN
  7448. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7449. ELSIF type IS SyntaxTree.RecordType THEN
  7450. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7451. ELSIF type IS SyntaxTree.ProcedureType THEN
  7452. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7453. ELSE
  7454. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7455. END;
  7456. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7457. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7458. 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))));
  7459. IF type IS SyntaxTree.RecordType THEN
  7460. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7461. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7462. ELSE
  7463. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7464. END;
  7465. i := openDim;
  7466. WHILE i > 0 DO
  7467. DEC (i);
  7468. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7469. END;
  7470. needsTrace := p0.NeedsTrace();
  7471. IF needsTrace THEN ModifyAssignments(true) END;
  7472. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7473. Emit(Push(position, pointer));
  7474. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7475. Emit(Pop(position, pointer));
  7476. END;
  7477. Designate(p0,l);
  7478. IF needsTrace THEN
  7479. CallAssignPointer(l.op, pointer);
  7480. ModifyAssignments(false);
  7481. ELSE
  7482. ToMemory(l.op,addressType,0);
  7483. Emit(Mov(position,l.op,pointer));
  7484. END;
  7485. ReleaseIntermediateOperand(pointer);
  7486. ReleaseOperand(l);
  7487. BrL(exit);
  7488. SetLabel(else);
  7489. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7490. Designate(p0,l);
  7491. IF needsTrace THEN
  7492. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7493. ELSE
  7494. ToMemory(l.op,addressType,0);
  7495. Emit(Mov(position,l.op,pointer));
  7496. END;
  7497. ReleaseOperand(l);
  7498. SetLabel(exit);
  7499. ELSE
  7500. (*! the following code is only correct for "standard" Oberon calling convention *)
  7501. IF SemanticChecker.ContainsPointer(type) THEN
  7502. IF type IS SyntaxTree.ArrayType THEN
  7503. staticLength := 1;
  7504. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7505. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7506. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7507. END;
  7508. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7509. MulInt(reg,reg,tmp);
  7510. END;
  7511. Designate(p0,l);
  7512. IF openDim > 0 THEN
  7513. Emit(Push(position,l.op)); (* address for use after syscall *)
  7514. END;
  7515. Emit(Push(position,l.op)); (* address *)
  7516. ReleaseOperand(l);
  7517. tmp := TypeDescriptorAdr(type);
  7518. IF ~newObjectFile THEN
  7519. IntermediateCode.MakeMemory(tmp,addressType);
  7520. END;
  7521. Emit(Push(position,tmp)); (* type descriptor *)
  7522. ReleaseIntermediateOperand(tmp);
  7523. Emit(Push(position,reg)); (* number Elements *)
  7524. ReleaseIntermediateOperand(reg);
  7525. tmp := IntermediateCode.Immediate(addressType,dim);
  7526. Emit(Push(position,tmp)); (* dimensions *)
  7527. (* push realtime flag *)
  7528. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7529. ELSE Emit(Push(position,false));
  7530. END;
  7531. CallThis(position,"Heaps","NewArr",5)
  7532. ELSE
  7533. size := ToMemoryUnits(system,system.SizeOf(type));
  7534. IF (size # 1) THEN
  7535. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7536. (*
  7537. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7538. *)
  7539. END;
  7540. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7541. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7542. AddInt(reg, reg, tmp);
  7543. (*
  7544. Emit(Add(position,reg,reg,tmp));
  7545. *)
  7546. Designate(p0,l);
  7547. IF openDim >0 THEN
  7548. Emit(Push(position,l.op)); (* address for use after syscall *)
  7549. END;
  7550. Emit(Push(position,l.op)); (* address for syscall *)
  7551. ReleaseOperand(l); (* pointer address *)
  7552. Emit(Push(position,reg)); (* size *)
  7553. ReleaseIntermediateOperand(reg);
  7554. (* push realtime flag *)
  7555. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7556. ELSE Emit(Push(position,false));
  7557. END;
  7558. CallThis(position,"Heaps","NewSys", 3)
  7559. END;
  7560. IF openDim > 0 THEN
  7561. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7562. Emit(Pop(position,adr));
  7563. ToMemory(adr,addressType,0);
  7564. ReuseCopy(tmp,adr);
  7565. ReleaseIntermediateOperand(adr);
  7566. adr := tmp;
  7567. else := NewLabel();
  7568. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7569. i := openDim-1;
  7570. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7571. WHILE (i >= 0) DO
  7572. Emit(Pop(position,reg));
  7573. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7574. Emit(Mov(position,res,reg));
  7575. DEC(i);
  7576. END;
  7577. ReleaseIntermediateOperand(adr);
  7578. ReleaseIntermediateOperand(reg);
  7579. exit := NewLabel();
  7580. BrL(exit);
  7581. SetLabel(else);
  7582. (* else part: array could not be allocated *)
  7583. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7584. Emit(Add(position,sp,sp,tmp));
  7585. SetLabel(exit);
  7586. END;
  7587. END;
  7588. END;
  7589. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7590. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7591. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7592. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7593. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7594. left.SetType(procedure.type);
  7595. formalParameter := procedureType.firstParameter;
  7596. (* push array to allocate *)
  7597. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7598. formalParameter :=formalParameter.nextParameter;
  7599. (* push length array *)
  7600. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7601. (* push size *)
  7602. type := t0;
  7603. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7604. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7605. END;
  7606. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7607. Emit(Push(position,tmp));
  7608. (* *)
  7609. IF SemanticChecker.ContainsPointer(type) THEN
  7610. tmp := TypeDescriptorAdr(type);
  7611. IF ~newObjectFile THEN
  7612. IntermediateCode.MakeMemory(tmp,addressType);
  7613. END;
  7614. ELSE
  7615. tmp := IntermediateCode.Immediate(addressType, 0);
  7616. END;
  7617. Emit(Push(position,tmp)); (* type descriptor *)
  7618. StaticCallOperand(result,procedure);
  7619. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7620. ReleaseOperand(result);
  7621. END;
  7622. (*
  7623. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7624. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7625. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7626. *)
  7627. ELSE
  7628. (*
  7629. push len0
  7630. push len1
  7631. push len2
  7632. push size
  7633. push len_adr
  7634. push element_size
  7635. push tag
  7636. push adr
  7637. *)
  7638. dim := 0;
  7639. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7640. isTensor := TRUE;
  7641. ELSE
  7642. isTensor := FALSE;
  7643. END;
  7644. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7645. IF ~isTensor THEN
  7646. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7647. END;
  7648. parameter := x.parameters.GetExpression(i);
  7649. Evaluate(parameter,r);
  7650. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7651. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7652. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7653. END;
  7654. Emit(Push(position,r.op));
  7655. ReleaseOperand(r);
  7656. INC(dim);
  7657. END;
  7658. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7659. Emit(Mov(position, adr, sp));
  7660. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7661. Emit(Push(position, adr));
  7662. ReleaseIntermediateOperand(adr);
  7663. openDim := dim;
  7664. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7665. IF isTensor THEN
  7666. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7667. ELSE
  7668. baseType := SemanticChecker.ArrayBase(type,openDim);
  7669. END;
  7670. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7671. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7672. IF SemanticChecker.ContainsPointer(baseType) THEN
  7673. tmp := TypeDescriptorAdr(baseType);
  7674. IF ~newObjectFile THEN
  7675. IntermediateCode.MakeMemory(tmp,addressType);
  7676. END;
  7677. ELSE
  7678. tmp := nil;
  7679. END;
  7680. Emit(Push(position,tmp)); (* type descriptor *)
  7681. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7682. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7683. ELSE (* error message has already been emited *)
  7684. RETURN;
  7685. END;
  7686. Designate(p0,l);
  7687. IF isTensor THEN
  7688. Emit(Push(position,l.op)); (* address *)
  7689. ELSE
  7690. Emit(Push(position,l.tag)); (* address *)
  7691. END;
  7692. ReleaseOperand(l);
  7693. StaticCallOperand(result,procedure);
  7694. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7695. ReleaseOperand(result);
  7696. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7697. Emit(Add(position,sp,sp,tmp));
  7698. END;
  7699. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7700. THEN
  7701. IF ~backend.cellsAreObjects THEN RETURN END;
  7702. IF InCellScope(currentScope) THEN
  7703. PushSelfPointer()
  7704. ELSE
  7705. Emit(Push(position, nil));
  7706. END;
  7707. (* push temp address *)
  7708. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7709. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7710. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7711. (* l.op contains address of pointer to record *)
  7712. Emit(Push(position,l.op)); (* address for use after syscall *)
  7713. ReleaseOperand(l);
  7714. (* push type descriptor *)
  7715. reg := TypeDescriptorAdr(baseType);
  7716. IF ~newObjectFile THEN
  7717. IntermediateCode.MakeMemory(reg,addressType);
  7718. END;
  7719. Emit(Push(position,reg));
  7720. ReleaseIntermediateOperand(reg);
  7721. (* push name *)
  7722. (*Global.GetSymbolName(p0, n);*)
  7723. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7724. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7725. ELSE
  7726. Global.GetModuleName(module.module, n);
  7727. END;
  7728. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7729. (*type.typeDeclaration.GetName(n);*)
  7730. PushConstString(n);
  7731. (* push cellnet boolean *)
  7732. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7733. (* push engine boolean *)
  7734. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7735. (* allocate *)
  7736. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7737. (* add capabilities *)
  7738. modifier := p0(SyntaxTree.Designator).modifiers;
  7739. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7740. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7741. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7742. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7743. END;
  7744. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7745. (*
  7746. modifier := baseType(SyntaxTree.CellType).modifiers;
  7747. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7748. modifier := p0(SyntaxTree.Designator).modifiers;
  7749. *)
  7750. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7751. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7752. (* l.op contains address of pointer to record *)
  7753. ToMemory(l.op,addressType,0);
  7754. (* l.op contains value of pointer to record *)
  7755. Emit(Push(position,l.op)); (* address for use after syscall *)
  7756. ReleaseOperand(l);
  7757. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7758. prevScope := currentScope;
  7759. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7760. previous := section;
  7761. section := init;
  7762. (* add ports *)
  7763. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7764. CloseInitializer(previous);
  7765. currentScope := prevScope;
  7766. Symbol(temporaryVariable,l);
  7767. ToMemory(l.op,addressType,0);
  7768. Emit(Push(position,l.op));
  7769. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7770. (*
  7771. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7772. IF constructor # NIL THEN
  7773. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7774. FOR i := 1 TO x.parameters.Length()-1 DO
  7775. p := x.parameters.GetExpression(i);
  7776. Global.GetSymbolName(parameter,name);
  7777. Evaluate(p, value);
  7778. ASSERT(value.type # NIL);
  7779. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7780. par := instance.AddParameter(name);
  7781. par.SetInteger(value.integer);
  7782. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7783. par := instance.AddParameter(name);
  7784. par.SetBoolean(value.boolean);
  7785. ELSE Error(x.position,NotYetImplemented)
  7786. END;
  7787. parameter := parameter.nextParameter
  7788. END;
  7789. END;
  7790. *)
  7791. (* call initializer *)
  7792. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7793. IF constructor # NIL THEN
  7794. (*! should be unified with ProcedureCallDesignator *)
  7795. IF backend.cellsAreObjects THEN
  7796. Symbol(temporaryVariable,l);
  7797. ToMemory(l.op,addressType,0);
  7798. Emit(Push(position,l.op));
  7799. ReleaseOperand(l);
  7800. END;
  7801. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7802. FOR i := firstPar TO x.parameters.Length()-1 DO
  7803. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7804. formalParameter := formalParameter.nextParameter;
  7805. END;
  7806. (* static call of the constructor *)
  7807. Global.GetSymbolSegmentedName(constructor,name);
  7808. ASSERT(~constructor.isInline);
  7809. IF constructor.scope.ownerModule # module.module THEN
  7810. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7811. ELSE
  7812. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7813. END;
  7814. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7815. (*ELSE
  7816. ReleaseIntermediateOperand(pointer);*)
  7817. END;
  7818. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7819. ToMemory(l.op, addressType, 0);
  7820. Designate(p0,s0);
  7821. ToMemory(s0.op,addressType,0);
  7822. Emit(Mov(position,s0.op,l.op));
  7823. ReleaseOperand(l);
  7824. ReleaseOperand(s0);
  7825. result.tag := emptyOperand;
  7826. (* start *)
  7827. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7828. (* push cell *)
  7829. Symbol(temporaryVariable, l);
  7830. ToMemory(l.op,addressType,0);
  7831. Emit(Push(Basic.invalidPosition,l.op));
  7832. (* push delegate *)
  7833. Emit(Push(Basic.invalidPosition,l.op));
  7834. ReleaseOperand(l);
  7835. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7836. Emit(Push(position, s1.op));
  7837. ReleaseOperand(s1);
  7838. CallThis(position,"ActiveCellsRuntime","Start",3);
  7839. END;
  7840. (*IF temporaryVariable # NIL THEN
  7841. end := NewLabel();
  7842. BrL(end);
  7843. SetLabel(exit);
  7844. Designate(p0,l);
  7845. ToMemory(l.op,addressType,0);
  7846. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7847. ReleaseOperand(l);
  7848. SetLabel(end);
  7849. ELSE
  7850. SetLabel(exit);
  7851. END;
  7852. *)
  7853. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7854. ELSE (* no pointer to record, no pointer to array *)
  7855. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7856. (* ignore new statement *)
  7857. Warning(p0.position, "cannot run on final hardware");
  7858. ELSE
  7859. HALT(200);
  7860. END;
  7861. END;
  7862. (* ---- ADDRESSOF----- *)
  7863. |Global.systemAdr:
  7864. Designate(p0,s0);
  7865. s0.mode := ModeValue;
  7866. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7867. ReleaseIntermediateOperand(s0.op);
  7868. s0.op := s0.tag;
  7869. IntermediateCode.InitOperand(s0.tag);
  7870. END;
  7871. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7872. result := s0;
  7873. (* ---- BIT ----- *)
  7874. |Global.systemBit:
  7875. Evaluate(p0,s0);
  7876. ToMemory(s0.op,addressType,0);
  7877. ReuseCopy(res,s0.op);
  7878. ReleaseOperand(s0);
  7879. Evaluate(p1,s1);
  7880. Emit(Ror(position,res,res,s1.op));
  7881. ReleaseOperand(s1);
  7882. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7883. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7884. IF ~conditional THEN
  7885. InitOperand(result,ModeValue); result.op := res;
  7886. ELSE
  7887. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7888. BrL(falseLabel);
  7889. ReleaseIntermediateOperand(res);
  7890. END;
  7891. (* --- MSK ----*)
  7892. |Global.systemMsk:
  7893. Evaluate(p0,s0);
  7894. Evaluate(p1,s1);
  7895. ReuseCopy(res,s0.op);
  7896. ReleaseOperand(s0);
  7897. Emit(And(position,res,res,s1.op));
  7898. ReleaseOperand(s1);
  7899. InitOperand(result,ModeValue);
  7900. result.op := res;
  7901. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7902. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7903. Evaluate(p0,s0);
  7904. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7905. ReleaseOperand(s0);
  7906. InitOperand(result,ModeValue);
  7907. result.op := res;
  7908. (* ---- SYSTEM.GetStackPointer ----- *)
  7909. |Global.systemGetStackPointer:
  7910. InitOperand(result,ModeValue);
  7911. result.op := sp;
  7912. (* ---- SYSTEM.GetFramePointer ----- *)
  7913. |Global.systemGetFramePointer:
  7914. InitOperand(result,ModeValue);
  7915. result.op := fp;
  7916. (* ---- SYSTEM.GetActivity ----- *)
  7917. |Global.systemGetActivity:
  7918. ASSERT(backend.cooperative);
  7919. InitOperand(result,ModeValue);
  7920. result.op := ap;
  7921. (* ---- SYSTEM.SetStackPointer ----- *)
  7922. |Global.systemSetStackPointer:
  7923. Evaluate(p0,s0); (* *)
  7924. Emit(Mov(position,sp,s0.op));
  7925. ReleaseOperand(s0);
  7926. (* ---- SYSTEM.SetFramePointer ----- *)
  7927. |Global.systemSetFramePointer:
  7928. Evaluate(p0,s0); (* *)
  7929. Emit(Mov(position,fp,s0.op));
  7930. ReleaseOperand(s0);
  7931. (* ---- SYSTEM.Activity ----- *)
  7932. |Global.systemSetActivity:
  7933. ASSERT(backend.cooperative);
  7934. Evaluate(p0,s0); (* *)
  7935. Emit(Mov(position,ap,s0.op));
  7936. ReleaseOperand(s0);
  7937. (* ---- SYSTEM.VAL ----- *)
  7938. |Global.systemVal:
  7939. Expression(p1);
  7940. s1 := result;
  7941. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7942. IF s1.mode = ModeReference THEN
  7943. (* nothing to be done if not record type, just take over new type *)
  7944. IF (type IS SyntaxTree.RecordType) THEN
  7945. ReleaseIntermediateOperand(s1.tag);
  7946. s1.tag := TypeDescriptorAdr(type);
  7947. IF ~newObjectFile THEN
  7948. IntermediateCode.MakeMemory(s1.tag,addressType);
  7949. END;
  7950. UseIntermediateOperand(s1.tag);
  7951. END;
  7952. result := s1;
  7953. ELSE (* copy over result to different type, may not use convert *)
  7954. itype := IntermediateCode.GetType(system,type);
  7955. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7956. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7957. Emit(Mov(position,s0.op,s1.op));
  7958. ReleaseOperand(s1);
  7959. InitOperand(result,ModeValue);
  7960. result.op := s0.op;
  7961. ELSE (* different size, must convert *)
  7962. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7963. Convert(s1.op, IntermediateCode.GetType(system,type));
  7964. result := s1;
  7965. END;
  7966. END;
  7967. (* ---- SYSTEM.GET ----- *)
  7968. |Global.systemGet:
  7969. Evaluate(p0,s0); (* adr *)
  7970. Designate(p1,s1); (* variable *)
  7971. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7972. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7973. Emit(Mov(position,s1.op,s0.op));
  7974. ReleaseOperand(s1);
  7975. ReleaseOperand(s0);
  7976. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7977. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7978. Evaluate(p0,s0); (* *)
  7979. Evaluate(p1,s1); (* variable *)
  7980. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7981. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7982. (* real part *)
  7983. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7984. Emit(Mov(position,res, s1.op));
  7985. ReleaseIntermediateOperand(res);
  7986. (* imaginary part *)
  7987. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7988. Emit(Mov(position,res, s1.tag));
  7989. ReleaseIntermediateOperand(res);
  7990. ReleaseOperand(s1);
  7991. ReleaseOperand(s0);
  7992. ELSE
  7993. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7994. ReleaseOperand(s0);
  7995. Emit(Mov(position,res,s1.op));
  7996. ReleaseIntermediateOperand(res);
  7997. ReleaseOperand(s1);
  7998. END;
  7999. (* ---- SYSTEM.MOVE ----- *)
  8000. |Global.systemMove:
  8001. Evaluate(p0,s0);
  8002. Evaluate(p1,s1);
  8003. Evaluate(p2,s2);
  8004. Emit(Copy(position,s1.op,s0.op,s2.op));
  8005. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8006. (* ---- SYSTEM.NEW ----- *)
  8007. |Global.systemNew:
  8008. Designate(p0,s0);
  8009. Emit(Push(position,s0.op));
  8010. ReleaseOperand(s0);
  8011. Evaluate(p1,s1);
  8012. Emit(Push(position,s1.op));
  8013. ReleaseOperand(s1);
  8014. (* push realtime flag: false by default *)
  8015. Emit(Push(position,false));
  8016. CallThis(position,"Heaps","NewSys",3);
  8017. (* ---- SYSTEM.CALL ----- *)
  8018. |Global.systemRef:
  8019. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8020. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8021. s0.mode := ModeValue;
  8022. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8023. result := s0
  8024. (* ---- INCR ----- *)
  8025. |Global.Incr:
  8026. Designate(p0,operand);
  8027. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8028. Dereference(operand,p0.type.resolved,FALSE);
  8029. END;
  8030. ASSERT(p1 # NIL);
  8031. Evaluate(p1,l);
  8032. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8033. ReleaseOperand(operand); ReleaseOperand(l);
  8034. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8035. (* ---- SUM ----- *)
  8036. |Global.Sum: HALT(200);
  8037. (* ---- ALL ----- *)
  8038. |Global.All: HALT(200);
  8039. (* ---- CAS ----- *)
  8040. |Global.Cas:
  8041. needsTrace := p0.NeedsTrace();
  8042. IF needsTrace THEN ModifyAssignments(true) END;
  8043. Designate(p0,s0);
  8044. Evaluate(p1,s1);
  8045. Evaluate(p2,s2);
  8046. IF needsTrace THEN
  8047. Emit(Push(position, s0.op));
  8048. Emit(Push(position, s1.op));
  8049. Emit(Push(position, s2.op));
  8050. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8051. ELSE
  8052. Emit(Cas(position,s0.op,s1.op,s2.op));
  8053. END;
  8054. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8055. IF needsTrace THEN ModifyAssignments(false) END;
  8056. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8057. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8058. IF conditional THEN
  8059. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8060. BrL(falseLabel);
  8061. ReleaseIntermediateOperand(res);
  8062. END;
  8063. (* ---- DIM ----- *)
  8064. |Global.Dim:
  8065. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8066. Designate(p0,s0);
  8067. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8068. Dereference(s0,p0.type.resolved,FALSE);
  8069. END;
  8070. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8071. ReleaseOperand(s0);
  8072. (* ---- RESHAPE ----- *)
  8073. |Global.Reshape:
  8074. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8075. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8076. left.SetType(procedure.type);
  8077. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8078. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8079. END;
  8080. (* ---- SYSTEM.TYPECODE ----- *)
  8081. |Global.systemTypeCode:
  8082. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8083. IF type.resolved IS SyntaxTree.PointerType THEN
  8084. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8085. END;
  8086. result.op := TypeDescriptorAdr(type);
  8087. IF ~newObjectFile THEN
  8088. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8089. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8090. END;
  8091. result.mode := ModeValue;
  8092. (* ---- SYSTEM.TRACE ----- *)
  8093. |Global.systemTrace:
  8094. SystemTrace(x.parameters, x.position);
  8095. (* ----- CONNECT ------*)
  8096. |Global.Connect:
  8097. IF backend.cellsAreObjects THEN
  8098. PushPort(p0);
  8099. PushPort(p1);
  8100. IF p2 # NIL THEN
  8101. Evaluate(p2, s2);
  8102. Emit(Push(p2.position, s2.op));
  8103. ReleaseOperand(s2);
  8104. ELSE
  8105. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8106. END;
  8107. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8108. ELSE
  8109. Warning(x.position, "cannot run on final hardware");
  8110. END;
  8111. (* ----- DELEGATE ------*)
  8112. |Global.Delegate:
  8113. IF backend.cellsAreObjects THEN
  8114. PushPort(p0);
  8115. PushPort(p1);
  8116. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8117. ELSE
  8118. Warning(x.position, "cannot run on final hardware");
  8119. END;
  8120. (* ----- SEND ------*)
  8121. |Global.Send:
  8122. Evaluate(p0,s0);
  8123. Evaluate(p1,s1);
  8124. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8125. Emit(Push(position,s0.op));
  8126. Emit(Push(position,s1.op));
  8127. (*
  8128. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8129. *)
  8130. IF ~backend.cellsAreObjects THEN
  8131. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8132. END;
  8133. ReleaseOperand(s0);
  8134. ReleaseOperand(s1);
  8135. IF backend.cellsAreObjects THEN
  8136. CallThis(position,"ActiveCellsRuntime","Send",2);
  8137. ELSE
  8138. CallThis(position,ChannelModuleName,"Send",2);
  8139. END;
  8140. (* ----- RECEIVE ------*)
  8141. |Global.Receive:
  8142. Evaluate(p0,s0);
  8143. Emit(Push(position,s0.op));
  8144. Designate(p1,s1);
  8145. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8146. Emit(Push(position,s1.op));
  8147. IF p2 # NIL THEN
  8148. Designate(p2,s2);
  8149. Emit(Push(position,s2.op));
  8150. END;
  8151. (*
  8152. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8153. *)
  8154. IF ~backend.cellsAreObjects THEN
  8155. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8156. END;
  8157. ReleaseOperand(s0);
  8158. ReleaseOperand(s1);
  8159. ReleaseOperand(s2);
  8160. IF backend.cellsAreObjects THEN
  8161. IF p2 = NIL THEN
  8162. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8163. ELSE
  8164. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8165. END;
  8166. ELSE
  8167. IF p2 = NIL THEN
  8168. CallThis(position,ChannelModuleName,"Receive",2)
  8169. ELSE
  8170. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8171. END;
  8172. END;
  8173. | Global.systemSpecial:
  8174. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8175. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8176. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8177. (* determine if parameters are of the VAR kind *)
  8178. ASSERT(x.parameters.Length() <= 3);
  8179. formalParameter := procedureType.firstParameter;
  8180. FOR i := 0 TO x.parameters.Length() - 1 DO
  8181. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8182. formalParameter := formalParameter.nextParameter
  8183. END;
  8184. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8185. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8186. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8187. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8188. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8189. IF procedureType.returnType # NIL THEN
  8190. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8191. Emit(Result(position, res));
  8192. (*InitOperand(result,ModeValue);
  8193. result.op := res;
  8194. *)
  8195. IF ~conditional THEN
  8196. InitOperand(result,ModeValue); result.op := res;
  8197. ELSE
  8198. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8199. BrL(falseLabel);
  8200. ReleaseIntermediateOperand(res);
  8201. END;
  8202. END
  8203. ELSE (* function not yet implemented *)
  8204. Error(position,"not yet implemented");
  8205. END;
  8206. destination := dest;
  8207. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8208. END VisitBuiltinCallDesignator;
  8209. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8210. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8211. BEGIN
  8212. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8213. dest := destination; destination := emptyOperand;
  8214. Expression(x.left);
  8215. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8216. ELSIF isUnchecked THEN (* no check *)
  8217. ELSE
  8218. trueL := NewLabel();
  8219. falseL := NewLabel();
  8220. IF IsPointerToRecord(x.left.type,recordType) THEN
  8221. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8222. Emit(Mov(position,tag, result.op));
  8223. IF result.mode # ModeValue THEN
  8224. ptr := tag;
  8225. IntermediateCode.MakeMemory(ptr,addressType);
  8226. Emit(Mov(position,tag, ptr));
  8227. END;
  8228. IF ~backend.cooperative THEN
  8229. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8230. END;
  8231. IntermediateCode.MakeMemory(tag,addressType);
  8232. ELSE
  8233. tag := result.tag;
  8234. UseIntermediateOperand(tag);
  8235. END;
  8236. TypeTest(tag,x.type,trueL,falseL);
  8237. ReleaseIntermediateOperand(tag);
  8238. SetLabel(falseL);
  8239. EmitTrap(position,TypeCheckTrap);
  8240. SetLabel(trueL);
  8241. END;
  8242. destination := dest;
  8243. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8244. END VisitTypeGuardDesignator;
  8245. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8246. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8247. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8248. VAR label: Label; pc: LONGINT;
  8249. BEGIN
  8250. IF backend.cooperative & ~isUnchecked THEN
  8251. pc := section.pc;
  8252. label := NewLabel();
  8253. BrneL(label, operand.op, nil);
  8254. EmitTrap(position, NilPointerTrap);
  8255. SetLabel(label);
  8256. INC(statCoopNilCheck, section.pc - pc);
  8257. END;
  8258. END NilCheck;
  8259. BEGIN
  8260. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8261. ReuseCopy(dereferenced,operand.op);
  8262. ReleaseOperand(operand);
  8263. operand.mode := ModeReference;
  8264. operand.op := dereferenced;
  8265. operand.tag := dereferenced;
  8266. UseIntermediateOperand(operand.tag);
  8267. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8268. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8269. ReleaseIntermediateOperand(operand.tag);
  8270. operand.tag := TypeDescriptorAdr(type);
  8271. IF ~newObjectFile THEN
  8272. IntermediateCode.MakeMemory(operand.tag,addressType);
  8273. END;
  8274. ELSE
  8275. IF ~backend.cooperative THEN
  8276. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8277. END;
  8278. IntermediateCode.MakeMemory(operand.tag,addressType);
  8279. END;
  8280. NilCheck(operand.op);
  8281. ELSIF type IS SyntaxTree.ArrayType THEN
  8282. IF isUnsafe THEN
  8283. NilCheck(operand.op);
  8284. ReleaseIntermediateOperand(operand.tag);
  8285. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8286. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8287. ELSE
  8288. operand.tag := emptyOperand;
  8289. END;
  8290. ELSE
  8291. NilCheck(operand.op);
  8292. IF backend.cooperative THEN
  8293. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8294. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8295. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8296. ELSE
  8297. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8298. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8299. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8300. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8301. END;
  8302. END;
  8303. ELSIF type IS SyntaxTree.MathArrayType THEN
  8304. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8305. IntermediateCode.MakeMemory(operand.op,addressType);
  8306. ELSE HALT(100);
  8307. END;
  8308. END Dereference;
  8309. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8310. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8311. BEGIN
  8312. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8313. dest := destination; destination := emptyOperand;
  8314. Evaluate(x.left,d);
  8315. type := x.type.resolved;
  8316. prevIsUnchecked := isUnchecked;
  8317. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8318. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8319. END;
  8320. Dereference(d,type,IsUnsafePointer(x.left.type));
  8321. isUnchecked := prevIsUnchecked;
  8322. result := d;
  8323. 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
  8324. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8325. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8326. END;
  8327. END;
  8328. destination := dest;
  8329. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8330. END VisitDereferenceDesignator;
  8331. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8332. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8333. BEGIN
  8334. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8335. dest := destination; destination := emptyOperand;
  8336. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8337. tag := result.op;
  8338. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8339. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8340. StaticCallOperand(result,procedure.super);
  8341. ReleaseIntermediateOperand(result.tag);
  8342. UseIntermediateOperand(tag); (* necessary ? *)
  8343. result.tag := tag;
  8344. destination := dest;
  8345. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8346. END VisitSupercallDesignator;
  8347. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8348. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8349. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8350. name: Basic.SegmentedName;
  8351. procedure: SyntaxTree.Procedure;
  8352. procedureType: SyntaxTree.ProcedureType;
  8353. BEGIN
  8354. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8355. dest := destination; destination := emptyOperand;
  8356. scope := currentScope;
  8357. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8358. scope := scope.outerScope;
  8359. END;
  8360. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8361. IF newObjectFile THEN
  8362. moduleSection := meta.ModuleSection();
  8363. IF backend.cooperative THEN
  8364. moduleOffset := 0;
  8365. ELSE
  8366. moduleOffset := moduleSection.pc;
  8367. END;
  8368. result.mode := ModeValue;
  8369. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8370. ELSE
  8371. Symbol(moduleSelf,result);
  8372. IntermediateCode.MakeMemory(result.op,addressType);
  8373. END
  8374. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8375. result.mode := ModeValue;
  8376. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8377. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8378. ELSE
  8379. GetBaseRegister(basereg,currentScope,scope);
  8380. InitOperand(result,ModeReference);
  8381. result.op := basereg;
  8382. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8383. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8384. parametersSize := ProcedureParametersSize(system,procedure);
  8385. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8386. IF backend.cooperative THEN
  8387. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8388. END;
  8389. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8390. MakeMemory(result.op, result.op, addressType, 0);
  8391. END;
  8392. (* tag must be loaded when dereferencing SELF pointer *)
  8393. END;
  8394. destination := dest;
  8395. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8396. END VisitSelfDesignator;
  8397. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8398. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8399. BEGIN
  8400. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8401. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8402. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8403. parameter := procedureType.returnParameter;
  8404. IF currentIsInline THEN
  8405. map := currentMapper.Get(NIL);
  8406. IF map # NIL THEN
  8407. Designate(map.to, result);
  8408. ELSE
  8409. HALT(200);
  8410. END;
  8411. RETURN;
  8412. END;
  8413. VisitParameter(parameter);
  8414. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8415. END VisitResultDesignator;
  8416. (** values *)
  8417. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8418. BEGIN
  8419. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8420. IF conditional THEN
  8421. IF x.value THEN BrL(trueLabel)
  8422. ELSE BrL(falseLabel)
  8423. END;
  8424. ELSE
  8425. InitOperand(result,ModeValue);
  8426. IF x.value THEN result.op := true ELSE result.op := false END;
  8427. END;
  8428. END VisitBooleanValue;
  8429. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8430. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8431. BEGIN
  8432. Global.GetModuleSegmentedName(module.module, name);
  8433. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8434. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8435. RETURN section
  8436. END GetDataSection;
  8437. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8438. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8439. BEGIN
  8440. type := vop.type;
  8441. data := GetDataSection();
  8442. pc := EnterImmediate(data,vop);
  8443. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8444. IntermediateCode.MakeMemory(vop, type);
  8445. END GetImmediateMem;
  8446. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8447. BEGIN
  8448. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8449. InitOperand(result,ModeValue);
  8450. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8451. IF ~supportedImmediate(result.op) &~inData THEN
  8452. GetImmediateMem(result.op)
  8453. END;
  8454. END VisitIntegerValue;
  8455. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8456. BEGIN
  8457. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8458. InitOperand(result,ModeValue);
  8459. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8460. END VisitCharacterValue;
  8461. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8462. BEGIN
  8463. IF Trace THEN TraceEnter("VisitSetValue") END;
  8464. InitOperand(result,ModeValue);
  8465. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8466. END VisitSetValue;
  8467. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8468. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8469. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8470. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8471. BEGIN
  8472. numberElements := x.elements.Length();
  8473. FOR i := 0 TO numberElements-1 DO
  8474. expression := x.elements.GetExpression(i);
  8475. IF expression IS SyntaxTree.MathArrayExpression THEN
  8476. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8477. ELSE
  8478. inData := TRUE;
  8479. Evaluate(expression,op);
  8480. irv.Emit(Data(position,op.op));
  8481. inData := FALSE;
  8482. ReleaseOperand(op);
  8483. END;
  8484. END;
  8485. END RecursiveData;
  8486. BEGIN
  8487. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8488. IF ~TryConstantDeclaration() THEN
  8489. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8490. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8491. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8492. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8493. ELSE
  8494. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8495. END;
  8496. RecursiveData(x.array);
  8497. InitOperand(result,ModeReference);
  8498. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8499. END
  8500. END VisitMathArrayValue;
  8501. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8502. VAR constant: Sections.Section;
  8503. BEGIN
  8504. IF constantDeclaration = NIL THEN
  8505. RETURN FALSE
  8506. ELSE
  8507. (* Is a constant in this module: did we generate it already? *)
  8508. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8509. IF constant # NIL THEN
  8510. InitOperand(result,ModeReference);
  8511. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8512. RETURN TRUE;
  8513. END;
  8514. END;
  8515. RETURN FALSE
  8516. END TryConstantDeclaration;
  8517. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8518. BEGIN
  8519. constantDeclaration := x;
  8520. x.value.resolved.Accept(SELF);
  8521. END VisitConstant;
  8522. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8523. BEGIN
  8524. IF Trace THEN TraceEnter("VisitRealValue") END;
  8525. InitOperand(result,ModeValue);
  8526. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8527. END VisitRealValue;
  8528. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8529. VAR
  8530. componentType: SyntaxTree.Type;
  8531. BEGIN
  8532. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8533. ASSERT(x.type IS SyntaxTree.ComplexType);
  8534. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8535. InitOperand(result,ModeValue);
  8536. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8537. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8538. END VisitComplexValue;
  8539. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8540. VAR i: LONGINT; name: Basic.SegmentedName;
  8541. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8542. BEGIN
  8543. IF Trace THEN TraceEnter("VisitStringValue") END;
  8544. IF ~TryConstantDeclaration() THEN
  8545. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8546. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8547. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8548. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8549. ELSE
  8550. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8551. END;
  8552. FOR i := 0 TO x.length-1 DO
  8553. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8554. irv.Emit(Data(position,op));
  8555. END;
  8556. InitOperand(result,ModeReference);
  8557. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8558. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8559. END
  8560. END VisitStringValue;
  8561. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8562. BEGIN
  8563. IF Trace THEN TraceEnter("VisitNilValue") END;
  8564. InitOperand(result,ModeValue);
  8565. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8566. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8567. END VisitNilValue;
  8568. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8569. BEGIN
  8570. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8571. InitOperand(result,ModeValue);
  8572. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8573. END VisitEnumerationValue;
  8574. (** symbols *)
  8575. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8576. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8577. END VisitImport;
  8578. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8579. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8580. BEGIN
  8581. IF scope # baseScope THEN
  8582. (* left := [fp+8] *)
  8583. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8584. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8585. ReuseCopy(left,right);
  8586. ReleaseIntermediateOperand(right);
  8587. scope := scope.outerScope; DEC(level);
  8588. (* { left := [left+8] } *)
  8589. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8590. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8591. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8592. Emit(Mov(position,left,right));
  8593. scope := scope.outerScope; DEC(level);
  8594. END;
  8595. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8596. result := left;
  8597. ELSE
  8598. result := fp;
  8599. END;
  8600. END GetBaseRegister;
  8601. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8602. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8603. BEGIN
  8604. IF Trace THEN TraceEnter("VisitVariable"); END;
  8605. type := x.type.resolved;
  8606. IF (x.useRegister) THEN
  8607. InitOperand(result, ModeValue);
  8608. IF x.registerNumber < 0 THEN
  8609. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8610. reg := x.registerNumber;
  8611. ELSE
  8612. reg := registerUsageCount.Map(x.registerNumber);
  8613. UseRegister(reg);
  8614. END;
  8615. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8616. ELSIF x.externalName # NIL THEN
  8617. InitOperand(result,ModeReference);
  8618. Basic.ToSegmentedName(x.externalName^, name);
  8619. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8620. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8621. InitOperand(result,ModeReference);
  8622. GetBaseRegister(result.op,currentScope,x.scope);
  8623. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8624. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8625. InitOperand(result,ModeReference);
  8626. GetCodeSectionNameForSymbol(x,name);
  8627. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8628. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8629. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8630. InitOperand(result,ModeReference);
  8631. GetCodeSectionNameForSymbol(x,name);
  8632. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8633. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8634. ELSE (* field, left designator must have been emitted *)
  8635. ASSERT(result.mode = ModeReference);
  8636. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8637. ReuseCopy(temp,result.op);
  8638. ReleaseIntermediateOperand(result.op);
  8639. result.op := temp;
  8640. END;
  8641. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8642. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8643. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8644. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8645. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8646. END;
  8647. END;
  8648. END;
  8649. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8650. ValueToCondition(result);
  8651. ELSIF type IS SyntaxTree.ProcedureType THEN
  8652. ReleaseIntermediateOperand(result.tag);
  8653. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8654. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8655. UseIntermediateOperand(result.tag);
  8656. ELSE
  8657. result.tag := nil; (* nil *)
  8658. END;
  8659. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8660. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8661. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8662. ReleaseIntermediateOperand(result.tag);
  8663. Global.GetSymbolSegmentedName(x,name);
  8664. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8665. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8666. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8667. ELSE
  8668. END;
  8669. ELSE
  8670. ReleaseIntermediateOperand(result.tag);
  8671. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8672. END;
  8673. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8674. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8675. ReleaseIntermediateOperand(result.tag);
  8676. result.tag := result.op;
  8677. UseIntermediateOperand(result.tag);
  8678. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8679. IntermediateCode.MakeMemory(result.op,addressType);
  8680. END;
  8681. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8682. ReleaseIntermediateOperand(result.tag);
  8683. result.tag := TypeDescriptorAdr(type);
  8684. IF ~newObjectFile THEN
  8685. IntermediateCode.MakeMemory(result.tag,addressType);
  8686. END;
  8687. UseIntermediateOperand(result.tag);
  8688. (* tag for pointer type computed not here but during dereferencing *)
  8689. END;
  8690. IF Trace THEN TraceExit("VisitVariable") END;
  8691. END VisitVariable;
  8692. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8693. BEGIN
  8694. VisitVariable(property);
  8695. END VisitProperty;
  8696. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8697. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8698. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8699. BEGIN
  8700. type := x.type.resolved;
  8701. IF Trace THEN TraceEnter("VisitParameter") END;
  8702. IF x.ownerType IS SyntaxTree.CellType THEN
  8703. ptype := x.type.resolved;
  8704. IF backend.cellsAreObjects THEN
  8705. ASSERT(result.mode = ModeReference);
  8706. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8707. ReuseCopy(temp,result.op);
  8708. ReleaseIntermediateOperand(result.op);
  8709. result.op := temp;
  8710. END;
  8711. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8712. RETURN;
  8713. ELSE
  8714. InitOperand(result,ModeReference);
  8715. GetCodeSectionNameForSymbol(x,name);
  8716. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8717. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8718. RETURN;
  8719. END;
  8720. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8721. InitOperand(result,ModeReference);
  8722. GetCodeSectionNameForSymbol(x,name);
  8723. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8724. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8725. RETURN
  8726. ELSE
  8727. GetBaseRegister(basereg,currentScope,x.scope);
  8728. InitOperand(result,ModeReference);
  8729. result.op := basereg;
  8730. END;
  8731. IF IsOpenArray(type) THEN
  8732. result.tag := basereg;
  8733. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8734. IntermediateCode.MakeMemory(result.op,addressType);
  8735. IF Global.IsOberonProcedure(x.ownerType) THEN
  8736. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8737. UseIntermediateOperand(result.tag);
  8738. ELSE
  8739. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8740. END;
  8741. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8742. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8743. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8744. ELSIF IsStaticArray(type) THEN
  8745. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8746. IntermediateCode.MakeMemory(result.op,addressType);
  8747. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8748. ELSIF type IS SyntaxTree.MathArrayType THEN
  8749. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8750. WITH type: SyntaxTree.MathArrayType DO
  8751. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8752. IF type.form = SyntaxTree.Tensor THEN
  8753. ELSIF type.form = SyntaxTree.Open THEN
  8754. result.tag := result.op;
  8755. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8756. IntermediateCode.MakeMemory(result.op,addressType);
  8757. UseIntermediateOperand(result.tag);
  8758. ELSIF type.form = SyntaxTree.Static THEN
  8759. IF x.kind = SyntaxTree.ConstParameter THEN
  8760. IntermediateCode.MakeMemory(result.op,addressType);
  8761. END;
  8762. ELSE HALT(100)
  8763. END;
  8764. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8765. IF type.form = SyntaxTree.Tensor THEN
  8766. ToMemory(result.op,addressType,0);
  8767. ELSIF type.form = SyntaxTree.Open THEN
  8768. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8769. ReuseCopy(result.tag, mem);
  8770. ReleaseIntermediateOperand(mem);
  8771. ReleaseIntermediateOperand(result.op);
  8772. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8773. ELSIF type.form = SyntaxTree.Static THEN
  8774. IntermediateCode.MakeMemory(result.op,addressType);
  8775. ELSE HALT(100)
  8776. END;
  8777. ELSE HALT(100)
  8778. END;
  8779. END;
  8780. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8781. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8782. IntermediateCode.MakeMemory(result.op,addressType);
  8783. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8784. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8785. END;
  8786. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8787. ValueToCondition(result);
  8788. ELSIF type IS SyntaxTree.ProcedureType THEN
  8789. ReleaseIntermediateOperand(result.tag);
  8790. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8791. IF x.kind = SyntaxTree.VarParameter THEN
  8792. ReuseCopy(result.tag,result.op);
  8793. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8794. IntermediateCode.MakeMemory(result.tag,addressType);
  8795. ELSE
  8796. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8797. UseIntermediateOperand(result.tag);
  8798. END;
  8799. ELSE
  8800. result.tag := nil;
  8801. END;
  8802. (* tag for pointer type computed not here but during dereferencing *)
  8803. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8804. ReleaseIntermediateOperand(result.tag);
  8805. result.tag := basereg;
  8806. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8807. IntermediateCode.MakeMemory(result.tag,addressType);
  8808. UseIntermediateOperand(result.tag);
  8809. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8810. ReleaseIntermediateOperand(result.tag);
  8811. result.tag := TypeDescriptorAdr(type);
  8812. IF ~newObjectFile THEN
  8813. IntermediateCode.MakeMemory(result.tag,addressType);
  8814. END;
  8815. UseIntermediateOperand(result.tag);
  8816. END;
  8817. IF Trace THEN TraceExit("VisitParameter") END;
  8818. END VisitParameter;
  8819. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8820. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8821. BEGIN
  8822. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8823. (* left.p: left already emitted *)
  8824. tag := result.op; (* value of pointer to left *)
  8825. (* get type desc *)
  8826. tmp := result.tag;
  8827. IntermediateCode.MakeMemory(tmp,addressType);
  8828. (* get method adr *)
  8829. Reuse1(reg,tmp);
  8830. ReleaseIntermediateOperand(tmp);
  8831. IF backend.cooperative THEN
  8832. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8833. WHILE recordType.baseType # NIL DO
  8834. recordType := recordType.GetBaseRecord ();
  8835. END;
  8836. GetRecordTypeName (recordType,name);
  8837. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8838. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8839. offset := 0;
  8840. ELSE
  8841. offset := 2;
  8842. END;
  8843. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8844. ELSE
  8845. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8846. END;
  8847. InitOperand(operand,ModeReference);
  8848. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8849. operand.op := reg;
  8850. operand.tag := tag;
  8851. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8852. END DynamicCallOperand;
  8853. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8854. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8855. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8856. BEGIN
  8857. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8858. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8859. tag := operand.op;
  8860. ReleaseIntermediateOperand(operand.tag);
  8861. ELSE tag := nil
  8862. END;
  8863. IF x.isInline THEN
  8864. sectionType := Sections.InlineCodeSection;
  8865. ELSE
  8866. sectionType := Sections.CodeSection;
  8867. END;
  8868. IF x.externalName # NIL THEN
  8869. Basic.ToSegmentedName(x.externalName^, name);
  8870. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8871. ELSE
  8872. GetCodeSectionNameForSymbol(x, name);
  8873. IF (x.scope.ownerModule = module.module) THEN
  8874. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8875. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8876. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8877. IF source.pc = 0 THEN (* no code yet *)
  8878. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8879. END;
  8880. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8881. bits := x.procedureScope.body.code.inlineCode;
  8882. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8883. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8884. binary.CopyBits(bits, 0, bits.GetSize());
  8885. source.SetResolved(binary);
  8886. ELSE
  8887. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8888. END;
  8889. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8890. END;
  8891. InitOperand(operand,ModeValue);
  8892. operand.op := reg;
  8893. operand.tag := tag;
  8894. IF Trace THEN TraceExit("StaticCallOperand") END;
  8895. END StaticCallOperand;
  8896. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8897. (* handle expressions of the form designator.procedure or procedure *)
  8898. BEGIN
  8899. IF Trace THEN TraceEnter("VisitProcedure") END;
  8900. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8901. DynamicCallOperand(result,x);
  8902. ELSIF x.isInline THEN
  8903. StaticCallOperand(result,x);
  8904. ELSE
  8905. StaticCallOperand(result,x);
  8906. END;
  8907. IF Trace THEN TraceExit("VisitProcedure") END;
  8908. END VisitProcedure;
  8909. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8910. BEGIN
  8911. VisitProcedure(x);
  8912. END VisitOperator;
  8913. (** statements *)
  8914. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8915. BEGIN
  8916. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8917. Expression(x.call);
  8918. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8919. ReleaseOperand(result)
  8920. END;
  8921. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8922. END VisitProcedureCallStatement;
  8923. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8924. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8925. leftBase, rightBase: SyntaxTree.Type;
  8926. procedureName,s: SyntaxTree.IdentifierString;
  8927. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8928. size: LONGINT; rightKind: LONGINT;
  8929. dummy: IntermediateCode.Operand;
  8930. CONST moduleName = "FoxArrayBase";
  8931. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8932. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8933. BEGIN
  8934. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8935. IF base IS SyntaxTree.MathArrayType THEN
  8936. base := OpenArray(base(SyntaxTree.MathArrayType));
  8937. END;
  8938. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8939. result.SetArrayBase(base);
  8940. RETURN result
  8941. END OpenArray;
  8942. BEGIN
  8943. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8944. SaveRegisters();ReleaseUsedRegisters(saved);
  8945. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8946. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8947. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8948. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8949. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8950. IF leftType.form = SyntaxTree.Tensor THEN
  8951. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8952. ELSIF leftType.form = SyntaxTree.Open THEN
  8953. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8954. ELSIF leftType.form = SyntaxTree.Static THEN
  8955. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8956. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8957. END;
  8958. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8959. IF procedure = NIL THEN
  8960. s := "Instruction not supported on target, emulation procedure ";
  8961. Strings.Append(s,moduleName);
  8962. Strings.Append(s,".");
  8963. Strings.Append(s,procedureName);
  8964. Strings.Append(s," not present");
  8965. Error(position,s);
  8966. ELSE
  8967. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8968. parameter.SetType(leftType);
  8969. parameter.SetAccess(SyntaxTree.Internal);
  8970. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8971. parameter.SetKind(rightKind);
  8972. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8973. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8974. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8975. StaticCallOperand(result,procedure);
  8976. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8977. ReleaseOperand(result);
  8978. END;
  8979. RestoreRegisters(saved);
  8980. END;
  8981. END AssignMathArray;
  8982. VAR modifyAssignmentCounter := 0: LONGINT;
  8983. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8984. VAR processor,mem,dst: IntermediateCode.Operand;
  8985. BEGIN
  8986. IF value.intValue = true.intValue THEN
  8987. INC(modifyAssignmentCounter);
  8988. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8989. modifyAssignmentsPC := section.pc;
  8990. ELSE
  8991. DEC(modifyAssignmentCounter);
  8992. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8993. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8994. END;
  8995. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8996. dst := NewRegisterOperand (addressType);
  8997. Emit(Mov(position,dst, processor));
  8998. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8999. Emit(Mov(position,mem, value));
  9000. ReleaseIntermediateOperand(dst);
  9001. END ModifyAssignments;
  9002. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9003. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9004. BEGIN
  9005. type := left.type.resolved;
  9006. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9007. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9008. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9009. IF procedureType.returnParameter = parameter THEN
  9010. (* this is the only case where the destination can be dynamically smaller than the source
  9011. in all other cases the dynamic size has to be taken
  9012. *)
  9013. MakeMemory(mem, tag, addressType, 0);
  9014. RETURN mem;
  9015. END;
  9016. END;
  9017. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9018. END CopySize;
  9019. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9020. VAR
  9021. leftO, rightO: Operand;
  9022. arg,mem, sizeOp: IntermediateCode.Operand;
  9023. leftType, rightType, componentType, base: SyntaxTree.Type;
  9024. size: LONGINT;
  9025. parameters: SyntaxTree.ExpressionList;
  9026. procedure: SyntaxTree.Procedure;
  9027. call: SyntaxTree.ProcedureCallDesignator;
  9028. designator: SyntaxTree.Designator;
  9029. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9030. VAR procedureType: SyntaxTree.ProcedureType;
  9031. BEGIN
  9032. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9033. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9034. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9035. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9036. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9037. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9038. IF right.id = Global.Reshape THEN RETURN TRUE
  9039. END;
  9040. END;
  9041. END;
  9042. END;
  9043. RETURN FALSE
  9044. END CanPassAsResultParameter;
  9045. BEGIN
  9046. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9047. leftType := left.type.resolved; rightType:= right.type.resolved;
  9048. IF backend.cooperative & left.NeedsTrace() THEN
  9049. ModifyAssignments(true);
  9050. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9051. Designate(right, rightO);
  9052. Designate(left, leftO);
  9053. ASSERT(leftO.mode = ModeReference);
  9054. TransferToRegister(leftO.op, leftO.op);
  9055. TransferToRegister(rightO.op, rightO.op);
  9056. Emit(Push(position, leftO.op));
  9057. Emit(Push(position, rightO.op));
  9058. CallAssignMethod(leftO.op, rightO.op, left.type);
  9059. Emit(Pop(position, rightO.op));
  9060. Emit(Pop(position, leftO.op));
  9061. sizeOp := CopySize(left, leftO.tag);
  9062. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9063. ReleaseIntermediateOperand(sizeOp);
  9064. ReleaseOperand(leftO);
  9065. ReleaseOperand(rightO);
  9066. ELSE
  9067. Evaluate(right,rightO);
  9068. Designate(left,leftO);
  9069. ASSERT(leftO.mode = ModeReference);
  9070. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9071. (* copy procedure address first *)
  9072. MakeMemory(mem,leftO.op,addressType,0);
  9073. Emit(Mov(position,mem,rightO.op));
  9074. ReleaseIntermediateOperand(mem);
  9075. (* copy pointer address *)
  9076. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9077. CallAssignPointer(leftO.tag, rightO.tag);
  9078. ELSE
  9079. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9080. CallAssignPointer(leftO.op, rightO.op);
  9081. END;
  9082. ReleaseOperand(leftO);
  9083. ReleaseOperand(rightO);
  9084. END;
  9085. ModifyAssignments(false);
  9086. RETURN;
  9087. ELSIF backend.writeBarriers & left.NeedsTrace() THEN
  9088. IF SemanticChecker.IsPointerType(leftType) THEN
  9089. Evaluate(right,rightO);
  9090. Designate(left,leftO);
  9091. Emit(Push(position,leftO.op));
  9092. ReleaseOperand(leftO);
  9093. Emit(Push(position,rightO.op));
  9094. ReleaseOperand(rightO);
  9095. CallThis(position,"Heaps","Assign",2);
  9096. ELSIF leftType.IsRecordType() THEN
  9097. Designate(right,rightO);
  9098. Designate(left,leftO);
  9099. Emit(Push(position,leftO.op));
  9100. Emit(Push(position,leftO.tag)); (* type desc *)
  9101. ReleaseOperand(leftO);
  9102. Emit(Push(position,rightO.op));
  9103. ReleaseOperand(rightO);
  9104. CallThis(position,"Heaps","AssignRecord",3);
  9105. ELSIF IsStaticArray(leftType) THEN
  9106. size := StaticArrayNumElements(leftType);
  9107. base := StaticArrayBaseType(leftType);
  9108. Designate(right,rightO);
  9109. Designate(left,leftO);
  9110. Emit(Push(position,leftO.op));
  9111. ReleaseOperand(leftO);
  9112. arg := TypeDescriptorAdr(base);
  9113. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9114. Emit(Push(position,arg));
  9115. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9116. Emit(Push(position,rightO.op));
  9117. ReleaseOperand(rightO);
  9118. CallThis(position,"Heaps","AssignArray",4);
  9119. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9120. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9121. Evaluate(right,rightO);
  9122. Designate(left,leftO);
  9123. MakeMemory(mem,leftO.op,addressType,0);
  9124. Emit(Mov(position,mem,rightO.op));
  9125. ReleaseIntermediateOperand(mem);
  9126. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9127. Emit (Push(position, leftO.tag));
  9128. ReleaseOperand(leftO);
  9129. Emit (Push(position, rightO.tag));
  9130. ReleaseOperand(rightO);
  9131. CallThis(position,"Heaps","Assign", 2);
  9132. ELSE HALT(100); (* missing ? *)
  9133. END;
  9134. RETURN;
  9135. END;
  9136. IF CanPassAsResultParameter(right) THEN
  9137. procedureResultDesignator := left(SyntaxTree.Designator);
  9138. Expression(right);
  9139. procedureResultDesignator := NIL;
  9140. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9141. (* left <-- ALIAS OF right: zerocopy *)
  9142. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9143. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9144. designator.SetType(procedure.type);
  9145. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9146. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9147. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9148. END;
  9149. ELSIF leftType IS SyntaxTree.RangeType THEN
  9150. (* LHS is of array range type *)
  9151. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9152. Evaluate(right, rightO);
  9153. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9154. (* first *)
  9155. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9156. Emit(Mov(position,mem, rightO.op));
  9157. ReleaseIntermediateOperand(mem);
  9158. (* last *)
  9159. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9160. Emit(Mov(position,mem, rightO.tag));
  9161. ReleaseIntermediateOperand(mem);
  9162. (* step *)
  9163. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9164. Emit(Mov(position,mem, rightO.extra));
  9165. ReleaseIntermediateOperand(mem);
  9166. ReleaseOperand(rightO);
  9167. ReleaseOperand(leftO)
  9168. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9169. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9170. Evaluate(right, rightO);
  9171. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9172. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9173. (* real part *)
  9174. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9175. Emit(Mov(position,mem, rightO.op));
  9176. ReleaseIntermediateOperand(mem);
  9177. (* imaginary part *)
  9178. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9179. Emit(Mov(position,mem, rightO.tag));
  9180. ReleaseIntermediateOperand(mem);
  9181. ReleaseOperand(rightO);
  9182. ReleaseOperand(leftO)
  9183. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9184. OR (leftType IS SyntaxTree.PortType) THEN
  9185. (* rightO := leftO;*)
  9186. Evaluate(right,rightO);
  9187. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9188. Designate(left,leftO);
  9189. IF leftO.mode = ModeReference THEN
  9190. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9191. destination := mem;
  9192. ELSE
  9193. destination := leftO.op;
  9194. END;
  9195. ReleaseOperand(leftO);
  9196. IF destination.mode # IntermediateCode.Undefined THEN
  9197. Emit(Mov(position,destination,rightO.op));
  9198. END;
  9199. ReleaseOperand(rightO);
  9200. ReleaseIntermediateOperand(mem);
  9201. IntermediateCode.InitOperand(destination);
  9202. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9203. Evaluate(right,rightO);
  9204. Designate(left,leftO);
  9205. MakeMemory(mem,leftO.op,addressType,0);
  9206. Emit(Mov(position,mem,rightO.op));
  9207. ReleaseIntermediateOperand(mem);
  9208. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9209. (* delegate *)
  9210. (*
  9211. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9212. *)
  9213. Emit(Mov(position,leftO.tag,rightO.tag));
  9214. END;
  9215. ReleaseOperand(leftO);
  9216. ReleaseOperand(rightO);
  9217. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9218. Designate(right,rightO);
  9219. Designate(left,leftO);
  9220. sizeOp := CopySize(left, leftO.tag);
  9221. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9222. ReleaseIntermediateOperand(sizeOp);
  9223. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9224. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9225. IF (rightType IS SyntaxTree.StringType) THEN
  9226. CopyString(left,right);
  9227. 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
  9228. Designate(right,rightO);
  9229. Designate(left,leftO);
  9230. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9231. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9232. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9233. ELSE
  9234. HALT(201)
  9235. END;
  9236. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9237. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9238. Designate(right,rightO);
  9239. Designate(left,leftO);
  9240. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9241. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9242. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9243. ELSE
  9244. AssignMathArray(left,right);
  9245. END;
  9246. ELSE
  9247. HALT(200);
  9248. END;
  9249. END Assign;
  9250. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9251. BEGIN
  9252. IF Trace THEN TraceEnter("VisitAssignment") END;
  9253. Assign(x.left,x.right);
  9254. IF Trace THEN TraceExit("VisitAssignment") END;
  9255. END VisitAssignment;
  9256. PROCEDURE EmitCooperativeSwitch;
  9257. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9258. BEGIN
  9259. ASSERT (cooperativeSwitches);
  9260. pc := section.pc;
  9261. IF lastSwitchPC = section.pc THEN RETURN END;
  9262. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9263. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9264. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9265. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9266. INC(statCoopSwitch, section.pc - pc);
  9267. END EmitCooperativeSwitch;
  9268. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9269. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9270. BEGIN
  9271. p0 := communication.left; p1 := communication.right;
  9272. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9273. Evaluate(p0,s0);
  9274. Evaluate(p1,s1);
  9275. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9276. Emit(Push(position,s0.op));
  9277. Emit(Push(position,s1.op));
  9278. (*
  9279. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9280. *)
  9281. IF ~backend.cellsAreObjects THEN
  9282. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9283. END;
  9284. ReleaseOperand(s0);
  9285. ReleaseOperand(s1);
  9286. IF backend.cellsAreObjects THEN
  9287. CallThis(position,"ActiveCellsRuntime","Send",2);
  9288. ELSE
  9289. CallThis(position,ChannelModuleName,"Send",2);
  9290. END;
  9291. (* ----- RECEIVE ------*)
  9292. ELSE
  9293. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9294. tmp := p0; p0 := p1; p1 := tmp;
  9295. END;
  9296. Evaluate(p0,s0);
  9297. Emit(Push(position,s0.op));
  9298. Designate(p1,s1);
  9299. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9300. Emit(Push(position,s1.op));
  9301. (*
  9302. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9303. *)
  9304. IF ~backend.cellsAreObjects THEN
  9305. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9306. END;
  9307. ReleaseOperand(s0);
  9308. ReleaseOperand(s1);
  9309. IF backend.cellsAreObjects THEN
  9310. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9311. ELSE
  9312. CallThis(position,ChannelModuleName,"Receive",2)
  9313. END;
  9314. END;
  9315. END VisitCommunicationStatement;
  9316. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9317. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9318. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9319. VAR true, false: Label; condition, value: BOOLEAN;
  9320. BEGIN
  9321. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9322. IF condition THEN
  9323. true := NewLabel();
  9324. false := NewLabel();
  9325. Condition(if.condition,true,false);
  9326. SetLabel(true);
  9327. StatementSequence(if.statements);
  9328. BrL(end);
  9329. SetLabel(false);
  9330. ELSE
  9331. IF value THEN (* always true *)
  9332. escape := TRUE;
  9333. StatementSequence(if.statements);
  9334. (* no branch necessary -- rest skipped *)
  9335. END;
  9336. END;
  9337. END IfPart;
  9338. BEGIN
  9339. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9340. end := NewLabel();
  9341. elsifs := x.ElsifParts();
  9342. IfPart(x.ifPart);
  9343. FOR i := 0 TO elsifs-1 DO
  9344. IF ~escape THEN
  9345. elsif := x.GetElsifPart(i);
  9346. IfPart(elsif);
  9347. END;
  9348. END;
  9349. IF (x.elsePart # NIL) & ~escape THEN
  9350. StatementSequence(x.elsePart);
  9351. END;
  9352. SetLabel(end);
  9353. IF Trace THEN TraceExit("VisitIfStatement") END;
  9354. END VisitIfStatement;
  9355. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9356. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9357. BEGIN
  9358. (*IF x.variable.type.resolved = x.type.resolved THEN
  9359. (* always true, do nothing *)
  9360. ELSE*)
  9361. Designate(x.variable,res);
  9362. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9363. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9364. END;
  9365. trueL := NewLabel();
  9366. TypeTest(res.tag,x.type,trueL,falseL);
  9367. ReleaseOperand(res);
  9368. SetLabel(trueL);
  9369. StatementSequence(x.statements);
  9370. BrL(endL);
  9371. END WithPart;
  9372. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9373. VAR endL,falseL: Label;i: LONGINT;
  9374. BEGIN
  9375. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9376. endL := NewLabel();
  9377. FOR i := 0 TO x.WithParts()-1 DO
  9378. falseL := NewLabel();
  9379. WithPart(x.GetWithPart(i),falseL,endL);
  9380. SetLabel(falseL);
  9381. END;
  9382. IF x.elsePart = NIL THEN
  9383. IF ~isUnchecked THEN
  9384. EmitTrap(position,WithTrap);
  9385. END;
  9386. ELSE
  9387. StatementSequence(x.elsePart)
  9388. END;
  9389. SetLabel(endL);
  9390. IF Trace THEN TraceExit("VisitWithStatement") END;
  9391. END VisitWithStatement;
  9392. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9393. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9394. out,else: Label; label: Label;
  9395. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9396. symbol: SyntaxTree.Symbol;
  9397. BEGIN
  9398. (*! split case statement into if-elsif statements for large case label lists *)
  9399. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9400. size := x.max-x.min+1;
  9401. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9402. END;
  9403. Evaluate(x.variable,var);
  9404. ReuseCopy(tmp,var.op);
  9405. ReleaseIntermediateOperand(var.op);
  9406. var.op := tmp;
  9407. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9408. Convert(var.op,addressType);
  9409. size := x.max-x.min+1;
  9410. else := NewLabel();
  9411. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9412. (*
  9413. UniqueId(name,module.module,"case",caseId);
  9414. *)
  9415. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9416. Global.GetModuleSegmentedName(module.module, name);
  9417. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9418. symbol := SyntaxTree.NewSymbol(name[1]);
  9419. symbol.SetScope(moduleScope);
  9420. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9421. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9422. section.isCaseTable := TRUE;
  9423. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9424. ReuseCopy(res,var.op);
  9425. ReleaseOperand(var);
  9426. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9427. Emit(Add(position,res,res,jmp));
  9428. IntermediateCode.MakeMemory(res,addressType);
  9429. Emit(Br(position,res));
  9430. ReleaseIntermediateOperand(res);
  9431. out := NewLabel();
  9432. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9433. part := x.GetCasePart(i);
  9434. constant := part.firstConstant;
  9435. label := NewLabel();
  9436. SetLabel(label);
  9437. WHILE(constant # NIL) DO (* case labels for this case part *)
  9438. FOR j := constant.min TO constant.max DO
  9439. fixups[j-x.min] := label;
  9440. END;
  9441. constant := constant.next;
  9442. END;
  9443. StatementSequence(part.statements);
  9444. BrL(out);
  9445. END;
  9446. SetLabel(else);
  9447. FOR i := 0 TO size-1 DO
  9448. IF fixups[i] = NIL THEN
  9449. fixups[i] := else;
  9450. END;
  9451. END;
  9452. IF x.elsePart # NIL THEN
  9453. StatementSequence(x.elsePart);
  9454. ELSIF ~isUnchecked THEN
  9455. EmitTrap(position,CaseTrap);
  9456. END;
  9457. SetLabel(out);
  9458. FOR i := 0 TO size-1 DO
  9459. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9460. section.Emit(Data(position,op));
  9461. END;
  9462. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9463. END VisitCaseStatement;
  9464. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9465. VAR start: Label; true,false: Label;
  9466. BEGIN
  9467. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9468. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9469. start := NewLabel();
  9470. true := NewLabel();
  9471. false := NewLabel();
  9472. SetLabel(start);
  9473. Condition(x.condition,true,false);
  9474. SetLabel(true);
  9475. StatementSequence(x.statements);
  9476. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9477. BrL(start);
  9478. SetLabel(false);
  9479. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9480. END VisitWhileStatement;
  9481. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9482. VAR false,true: Label;
  9483. BEGIN
  9484. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9485. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9486. true := NewLabel();
  9487. false := NewLabel();
  9488. SetLabel(false);
  9489. StatementSequence(x.statements);
  9490. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9491. Condition(x.condition,true,false);
  9492. SetLabel(true);
  9493. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9494. END VisitRepeatStatement;
  9495. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9496. VAR
  9497. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9498. temporaryVariable: SyntaxTree.Variable;
  9499. temporaryVariableDesignator : SyntaxTree.Designator;
  9500. BEGIN
  9501. IF Trace THEN TraceEnter("VisitForStatement") END;
  9502. true := NewLabel();
  9503. false := NewLabel();
  9504. start := NewLabel();
  9505. Assign(x.variable,x.from);
  9506. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9507. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9508. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9509. Assign(temporaryVariableDesignator,x.to);
  9510. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9511. IF by > 0 THEN
  9512. cmp := Scanner.LessEqual
  9513. ELSE
  9514. cmp := Scanner.GreaterEqual
  9515. END;
  9516. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9517. binary.SetType(system.booleanType);
  9518. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9519. SetLabel(start);
  9520. Condition(binary,true,false);
  9521. SetLabel(true);
  9522. StatementSequence(x.statements);
  9523. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9524. binary.SetType(x.variable.type);
  9525. Assign(x.variable,binary);
  9526. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9527. BrL(start);
  9528. SetLabel(false);
  9529. IF Trace THEN TraceExit("VisitForStatement") END;
  9530. END VisitForStatement;
  9531. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9532. VAR prevLoop: Label;
  9533. BEGIN
  9534. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9535. prevLoop := currentLoop;
  9536. currentLoop := NewLabel();
  9537. StatementSequence(x.statements);
  9538. SetLabel(currentLoop);
  9539. currentLoop := prevLoop;
  9540. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9541. END VisitExitableBlock;
  9542. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9543. VAR prevLoop,start: Label;
  9544. BEGIN
  9545. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9546. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9547. start := NewLabel();
  9548. prevLoop := currentLoop;
  9549. SetLabel(start);
  9550. currentLoop := NewLabel();
  9551. StatementSequence(x.statements);
  9552. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9553. BrL(start);
  9554. SetLabel(currentLoop);
  9555. currentLoop := prevLoop;
  9556. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9557. END VisitLoopStatement;
  9558. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9559. VAR outer: SyntaxTree.Statement;
  9560. BEGIN
  9561. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9562. IF locked THEN (* r if we jump out of an exclusive block *)
  9563. outer := x.outer;
  9564. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9565. outer := outer.outer;
  9566. END;
  9567. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9568. Lock(FALSE);
  9569. END;
  9570. END;
  9571. BrL(currentLoop);
  9572. IF Trace THEN TraceExit("VisitExitStatement") END;
  9573. END VisitExitStatement;
  9574. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9575. VAR
  9576. expression, parameterDesignator: SyntaxTree.Expression;
  9577. type, componentType: SyntaxTree.Type;
  9578. res, right: Operand;
  9579. left, mem, reg: IntermediateCode.Operand;
  9580. parameter: SyntaxTree.Parameter;
  9581. procedure: SyntaxTree.Procedure;
  9582. procedureType: SyntaxTree.ProcedureType;
  9583. returnTypeOffset: LONGINT;
  9584. delegate: BOOLEAN;
  9585. map: SymbolMap;
  9586. cc, parametersSize: LONGINT;
  9587. BEGIN
  9588. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9589. expression := x.returnValue;
  9590. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9591. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9592. IF currentIsInline THEN
  9593. IF expression # NIL THEN
  9594. map := currentMapper.Get(NIL);
  9595. IF map # NIL THEN
  9596. Assign(map.to, expression);
  9597. ELSE
  9598. Evaluate(expression,res);
  9599. Emit(Return(position,res.op));
  9600. ReleaseOperand(res);
  9601. END;
  9602. END;
  9603. BrL(currentInlineExit);
  9604. RETURN;
  9605. END;
  9606. IF expression # NIL THEN
  9607. type := expression.type.resolved;
  9608. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9609. IF locked THEN Lock(FALSE) END;
  9610. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9611. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9612. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9613. (* return without structured return parameter *)
  9614. Evaluate(expression,res);
  9615. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9616. IF locked OR profile THEN
  9617. Emit(Push(position,res.op));
  9618. IF delegate THEN HALT(200) END;
  9619. ReleaseOperand(res);
  9620. IF locked THEN Lock(FALSE) END;
  9621. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9622. reg := NewRegisterOperand(res.op.type);
  9623. Emit(Pop(position,reg));
  9624. Emit(Return(position,reg));
  9625. ReleaseIntermediateOperand(reg);
  9626. ELSE
  9627. Emit(Return(position,res.op));
  9628. ReleaseOperand(res);
  9629. END;
  9630. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9631. THEN
  9632. (* return using structured return parameter *)
  9633. 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)
  9634. OR SemanticChecker.IsPointerType(type));
  9635. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9636. parameter :=procedureType.returnParameter;
  9637. ASSERT(parameter # NIL);
  9638. returnTypeOffset := parameter.offsetInBits;
  9639. (*
  9640. IF parameter# NIL THEN
  9641. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9642. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9643. ELSE
  9644. returnTypeOffset := system.offsetFirstParameter
  9645. END;
  9646. *)
  9647. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9648. IF type IS SyntaxTree.RangeType THEN
  9649. (* array range type *)
  9650. Evaluate(expression, right);
  9651. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9652. Emit(Mov(position,mem, right.op)); (* first *)
  9653. ReleaseIntermediateOperand(mem);
  9654. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9655. Emit(Mov(position,mem, right.tag)); (* last *)
  9656. ReleaseIntermediateOperand(mem);
  9657. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9658. Emit(Mov(position,mem, right.extra)); (* step *)
  9659. ReleaseIntermediateOperand(mem);
  9660. ReleaseOperand(right);
  9661. ELSIF type IS SyntaxTree.ComplexType THEN
  9662. Evaluate(expression, right);
  9663. componentType := type(SyntaxTree.ComplexType).componentType;
  9664. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9665. Emit(Mov(position,mem, right.op)); (* real part *)
  9666. ReleaseIntermediateOperand(mem);
  9667. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9668. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9669. ReleaseIntermediateOperand(mem);
  9670. ReleaseOperand(right);
  9671. ELSE (* covers cases: pointer / record / array *)
  9672. parameter := procedureType.returnParameter;
  9673. checker.SetCurrentScope(currentScope);
  9674. ASSERT(parameter # NIL);
  9675. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9676. Assign(parameterDesignator,expression);
  9677. END;
  9678. ReleaseIntermediateOperand(left);
  9679. IF locked THEN Lock(FALSE) END;
  9680. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9681. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9682. parameter := procedureType.returnParameter;
  9683. checker.SetCurrentScope(currentScope);
  9684. IF parameter = NIL THEN
  9685. Error(procedure.position, "structured return of parameter of procedure not found");
  9686. ELSE
  9687. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9688. Assign(parameterDesignator,expression);
  9689. END;
  9690. IF locked THEN Lock(FALSE) END;
  9691. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9692. ELSE
  9693. HALT(200);
  9694. END;
  9695. ELSE
  9696. IF locked THEN Lock(FALSE) END;
  9697. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9698. END;
  9699. IF backend.cooperative THEN
  9700. BrL(exitLabel);
  9701. ELSE
  9702. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9703. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9704. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9705. ELSE
  9706. parametersSize := 0;
  9707. END;
  9708. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9709. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9710. END;
  9711. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9712. END VisitReturnStatement;
  9713. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9714. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9715. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9716. statements: SyntaxTree.StatementSequence;
  9717. name, suffix: SyntaxTree.IdentifierString;
  9718. BEGIN
  9719. Strings.IntToStr(awaitProcCounter,suffix);
  9720. Strings.Concat("@AwaitProcedure",suffix,name);
  9721. identifier := SyntaxTree.NewIdentifier(name);
  9722. INC(awaitProcCounter);
  9723. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9724. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9725. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9726. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9727. procedure.SetAccess(SyntaxTree.Hidden);
  9728. procedure.SetScope(currentScope);
  9729. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9730. procedureType.SetReturnType(system.booleanType);
  9731. procedure.SetType(procedureType);
  9732. body := SyntaxTree.NewBody(x.position,procedureScope);
  9733. procedureScope.SetBody(body);
  9734. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9735. returnStatement.SetReturnValue(x.condition);
  9736. statements := SyntaxTree.NewStatementSequence();
  9737. statements.AddStatement(returnStatement);
  9738. body.SetStatementSequence(statements);
  9739. currentScope.AddProcedure(procedure);
  9740. RETURN procedure
  9741. END MakeAwaitProcedure;
  9742. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9743. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9744. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9745. BEGIN
  9746. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9747. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9748. IF backend.cooperative THEN
  9749. start := NewLabel();
  9750. true := NewLabel();
  9751. false := NewLabel();
  9752. SetLabel(start);
  9753. Condition(x.condition,true,false);
  9754. SetLabel(false);
  9755. PushSelfPointer();
  9756. CallThis(position,"ExclusiveBlocks","Await",1);
  9757. BrL(start);
  9758. SetLabel(true);
  9759. PushSelfPointer();
  9760. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9761. ELSE
  9762. proc := MakeAwaitProcedure(x);
  9763. Emit(Push(position,fp));
  9764. GetCodeSectionNameForSymbol(proc,name);
  9765. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9766. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9767. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9768. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9769. Emit(Result(position,res));
  9770. (*
  9771. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9772. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9773. *)
  9774. InitOperand(result,ModeValue);
  9775. result.op := res;
  9776. label := NewLabel();
  9777. BreqL(label, result.op, SELF.true);
  9778. ReleaseOperand(result);
  9779. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9780. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9781. Emit(Push(position,res));
  9782. Emit(Push(position,fp));
  9783. PushSelfPointer();
  9784. Emit(Push(position,nil));
  9785. CallThis(position,"Objects","Await",4);
  9786. SetLabel(label);
  9787. END;
  9788. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9789. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9790. END VisitAwaitStatement;
  9791. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9792. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9793. BEGIN
  9794. FOR i := 0 TO x.Length() - 1 DO
  9795. statement := x.GetStatement( i );
  9796. Statement(statement);
  9797. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9798. END;
  9799. END StatementSequence;
  9800. PROCEDURE PushSelfPointer;
  9801. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9802. procedureType: SyntaxTree.ProcedureType;
  9803. BEGIN
  9804. scope := currentScope;
  9805. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9806. scope := scope.outerScope;
  9807. END;
  9808. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9809. IF ~newObjectFile THEN
  9810. Symbol(moduleSelf,op);
  9811. IntermediateCode.MakeMemory(op.op,addressType);
  9812. ELSE
  9813. moduleSection := meta.ModuleSection();
  9814. IF backend.cooperative THEN
  9815. moduleOffset := 0;
  9816. ELSE
  9817. moduleOffset := moduleSection.pc;
  9818. END;
  9819. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9820. END;
  9821. ELSE
  9822. GetBaseRegister(op.op,currentScope,scope);
  9823. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9824. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9825. parametersSize := ProcedureParametersSize(system,procedure);
  9826. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9827. IF backend.cooperative THEN
  9828. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9829. END;
  9830. IntermediateCode.MakeMemory(op.op,addressType);
  9831. END;
  9832. Emit(Push(position,op.op));
  9833. ReleaseOperand(op);
  9834. END PushSelfPointer;
  9835. PROCEDURE Lock(lock: BOOLEAN);
  9836. BEGIN
  9837. IF Trace THEN TraceEnter("Lock") END;
  9838. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9839. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9840. ASSERT(modifyAssignmentCounter = 0);
  9841. IF dump # NIL THEN
  9842. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9843. dump.Ln;dump.Update;
  9844. END;
  9845. PushSelfPointer;
  9846. IF backend.cooperative THEN
  9847. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9848. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9849. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9850. END;
  9851. ELSE
  9852. Emit(Push(position,true));
  9853. IF lock THEN CallThis(position,"Objects","Lock",2)
  9854. ELSE CallThis(position,"Objects","Unlock",2);
  9855. END;
  9856. END;
  9857. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9858. IF Trace THEN TraceExit("Lock") END;
  9859. END Lock;
  9860. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9861. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9862. BEGIN
  9863. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9864. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9865. previouslyUnchecked := isUnchecked;
  9866. isUnchecked := isUnchecked OR x.isUnchecked;
  9867. previouslyCooperativeSwitches := cooperativeSwitches;
  9868. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9869. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9870. IF x.statements # NIL THEN
  9871. StatementSequence(x.statements);
  9872. END;
  9873. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9874. isUnchecked := previouslyUnchecked;
  9875. cooperativeSwitches := previouslyCooperativeSwitches;
  9876. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9877. END VisitStatementBlock;
  9878. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9879. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9880. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9881. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9882. procedure: SyntaxTree.Procedure;
  9883. map: SymbolMap;
  9884. cc, parametersSize: LONGINT;
  9885. BEGIN
  9886. scope := currentScope;
  9887. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9888. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9889. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9890. return := emptyOperand;
  9891. IF Trace THEN TraceEnter("VisitCode") END;
  9892. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9893. NEW(in, x.inRules.Length());
  9894. FOR i := 0 TO LEN(in)-1 DO
  9895. statement := x.inRules.GetStatement(i);
  9896. WITH statement: SyntaxTree.Assignment DO
  9897. Evaluate(statement.right, operand);
  9898. result := operand.op;
  9899. NEW(str, 64);
  9900. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9901. in[i] := result; IntermediateCode.SetString(in[i], str);
  9902. ReleaseIntermediateOperand(operand.tag);
  9903. END;
  9904. END;
  9905. ELSE in := NIL
  9906. END;
  9907. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9908. NEW(out, x.outRules.Length());
  9909. FOR i := 0 TO LEN(out)-1 DO
  9910. statement := x.outRules.GetStatement(i);
  9911. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9912. WITH statement: SyntaxTree.Assignment DO
  9913. Designate(statement.left, operand);
  9914. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9915. NEW(str, 64);
  9916. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9917. out[i] := result; IntermediateCode.SetString(out[i], str);
  9918. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  9919. |statement: SyntaxTree.ReturnStatement DO
  9920. NEW(str, 64);
  9921. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9922. IF currentIsInline THEN
  9923. map := currentMapper.Get(NIL);
  9924. Designate(map.to, operand);
  9925. IF map.isAddress THEN
  9926. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9927. ELSE
  9928. result := operand.op;
  9929. END;
  9930. (*! only if it does not fit into register
  9931. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9932. *)
  9933. (*Evaluate(map.to, operand);*)
  9934. out[i] := result;
  9935. ELSE
  9936. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9937. END;
  9938. IntermediateCode.SetString(out[i], str);
  9939. ReleaseIntermediateOperand(operand.tag);
  9940. return := out[i];
  9941. ELSE
  9942. END;
  9943. END;
  9944. ELSE out := NIL
  9945. END;
  9946. Emit(Asm(x.position,x.sourceCode, in, out));
  9947. IF in # NIL THEN
  9948. FOR i := 0 TO LEN(in)-1 DO
  9949. ReleaseIntermediateOperand(in[i]);
  9950. END;
  9951. END;
  9952. IF out # NIL THEN
  9953. FOR i := 0 TO LEN(out)-1 DO
  9954. WITH statement: SyntaxTree.Assignment DO
  9955. ReleaseIntermediateOperand(out[i]);
  9956. |statement: SyntaxTree.ReturnStatement DO
  9957. (* release happens below *)
  9958. ELSE
  9959. END;
  9960. statement := x.outRules.GetStatement(i);
  9961. END;
  9962. END;
  9963. IF return.mode # IntermediateCode.Undefined THEN
  9964. IF currentIsInline THEN
  9965. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  9966. Symbol(procedureType.returnParameter, par);
  9967. MakeMemory(mem, par.op, return.type, 0);
  9968. ReleaseOperand(par);
  9969. Emit(Mov(position, mem, return));
  9970. ReleaseIntermediateOperand(mem);
  9971. ELSE
  9972. Emit(Return(position,return));
  9973. END;
  9974. ReleaseIntermediateOperand(return);
  9975. IF currentIsInline THEN RETURN END;
  9976. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9977. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9978. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9979. ELSE
  9980. parametersSize := 0;
  9981. END;
  9982. EmitLeave(section, position,procedure, cc);
  9983. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  9984. END;
  9985. IF Trace THEN TraceExit("VisitCode") END;
  9986. END VisitCode;
  9987. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9988. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9989. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9990. const, call: IntermediateCode.Operand;
  9991. parameterDesignator: SyntaxTree.Expression;
  9992. saved: RegisterEntry;
  9993. name: Basic.SegmentedName;
  9994. BEGIN
  9995. IF Trace THEN TraceEnter("ParameterCopies") END;
  9996. parameter := x.firstParameter;
  9997. WHILE parameter # NIL DO
  9998. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9999. type := parameter.type.resolved;
  10000. IF IsOpenArray(type) THEN
  10001. VisitParameter(parameter);
  10002. op := result;
  10003. IF backend.cooperative & parameter.NeedsTrace() THEN
  10004. length := GetArrayLength(type, op.tag);
  10005. size := NewRegisterOperand(addressType);
  10006. base := ArrayBaseType(type);
  10007. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10008. Emit(Mul(position, size, length, const));
  10009. dst := NewRegisterOperand (addressType);
  10010. Emit(Mov(position, dst, size));
  10011. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10012. Emit(Sub(position,dst,sp,dst));
  10013. Emit(And(position,dst,dst,const));
  10014. Emit(Mov(position,sp,dst));
  10015. par := fp;
  10016. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10017. IntermediateCode.InitImmediate(null, byteType, 0);
  10018. Emit(Fill(position, dst, size, null));
  10019. ReleaseIntermediateOperand(dst);
  10020. ReleaseIntermediateOperand(length);
  10021. SaveRegisters();ReleaseUsedRegisters(saved);
  10022. (* register dst has been freed before SaveRegisters already *)
  10023. base := ArrayBaseType(type);
  10024. (* assign method of open array *)
  10025. IF base.IsRecordType() THEN
  10026. Emit (Push(position, length));
  10027. Emit (Push(position, dst));
  10028. Emit (Push(position, op.op));
  10029. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10030. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10031. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10032. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10033. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10034. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10035. Emit (Push(position,length));
  10036. Emit (Push(position, dst));
  10037. Emit (Push(position, length));
  10038. Emit (Push(position, op.op));
  10039. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10040. ELSE
  10041. Emit (Push(position, length));
  10042. Emit (Push(position, dst));
  10043. Emit (Push(position, length));
  10044. Emit (Push(position, op.op));
  10045. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10046. ASSERT(ArrayBaseType(type).IsPointer());
  10047. END;
  10048. RestoreRegisters(saved);
  10049. ELSE
  10050. temp := GetDynamicSize(type,op.tag);
  10051. ReuseCopy(size,temp);
  10052. ReleaseIntermediateOperand(temp);
  10053. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10054. Emit(Sub(position,size,sp,size));
  10055. Emit(And(position,size,size,const));
  10056. Emit(Mov(position,sp,size));
  10057. par := fp;
  10058. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10059. ReleaseIntermediateOperand(size);
  10060. size := GetDynamicSize(type,op.tag);
  10061. END;
  10062. Emit(Copy(position,sp,op.op,size));
  10063. ReleaseIntermediateOperand(size);
  10064. ReleaseOperand(op);
  10065. IntermediateCode.MakeMemory(par,addressType);
  10066. Emit(Mov(position,par,sp));
  10067. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10068. checker.SetCurrentScope(currentScope);
  10069. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10070. Assign(parameterDesignator,parameterDesignator);
  10071. END;
  10072. END;
  10073. parameter := parameter.nextParameter;
  10074. END;
  10075. IF Trace THEN TraceExit("ParameterCopies") END;
  10076. END ParameterCopies;
  10077. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10078. VAR x: SyntaxTree.Variable;
  10079. BEGIN
  10080. x := scope.firstVariable;
  10081. WHILE x # NIL DO
  10082. InitVariable(x,FALSE);
  10083. x := x.nextVariable;
  10084. END;
  10085. END InitVariables;
  10086. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10087. BEGIN
  10088. IF (symbol # NIL) THEN
  10089. RETURN fingerPrinter.SymbolFP(symbol).public
  10090. ELSE
  10091. RETURN 0
  10092. END;
  10093. END GetFingerprint;
  10094. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10095. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10096. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10097. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10098. name: Basic.SegmentedName;
  10099. offset: LONGINT;
  10100. BEGIN
  10101. IF Trace THEN TraceEnter("Body") END;
  10102. ReleaseUsedRegisters(saved); (* just in case ... *)
  10103. section := ir;
  10104. exitLabel := NewLabel ();
  10105. IF moduleBody THEN moduleBodySection := section END;
  10106. IF ir.comments # NIL THEN
  10107. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10108. commentPrintout.SingleStatement(TRUE);
  10109. dump := ir.comments;
  10110. ELSE
  10111. commentPrintout := NIL;
  10112. dump := NIL;
  10113. END;
  10114. prevScope := currentScope;
  10115. currentScope := scope;
  10116. lastSwitchPC := 0;
  10117. cooperativeSwitches := backend.cooperative;
  10118. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10119. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10120. IF x # NIL THEN
  10121. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10122. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10123. IF moduleBody THEN
  10124. ProfilerInit();
  10125. ELSE
  10126. Basic.SegmentedNameToString(ir.name, string);
  10127. ProfilerAddProcedure(numberProcedures,string);
  10128. ProfilerEnterExit(numberProcedures,TRUE);
  10129. END;
  10130. END;
  10131. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10132. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10133. END;
  10134. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10135. IF moduleBody & ~newObjectFile THEN
  10136. InitVariables(moduleScope)
  10137. END;
  10138. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10139. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10140. IF procedure = cellScope.bodyProcedure THEN
  10141. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10142. StaticCallOperand(op, cellScope.constructor);
  10143. Emit(Call(position,op.op,0));
  10144. END;
  10145. END;
  10146. END;
  10147. InitVariables(scope);
  10148. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10149. GetCodeSectionNameForSymbol(procedure, name);
  10150. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10151. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10152. IF ProtectModulesPointers THEN
  10153. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10154. ELSE
  10155. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10156. END;
  10157. IntermediateCode.SetOffset(right,offset); (* tag *)
  10158. IntermediateCode.InitMemory(left,addressType,fp,0);
  10159. Emit(Mov(position, left, right));
  10160. END;
  10161. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10162. ParameterCopies(procedureType);
  10163. IF x.code = NIL THEN
  10164. VisitStatementBlock(x);
  10165. ELSE
  10166. VisitCode(x.code)
  10167. END;
  10168. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10169. ir.SetFinally(ir.pc);
  10170. StatementSequence(x.finally)
  10171. END;
  10172. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10173. IF ~backend.cooperative THEN
  10174. ProfilerEnterExit(numberProcedures,FALSE);
  10175. END;
  10176. INC(numberProcedures);
  10177. END;
  10178. END;
  10179. IF backend.cooperative THEN
  10180. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10181. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10182. END;
  10183. IF x # NIL THEN
  10184. SELF.position := x.position;
  10185. END;
  10186. CheckRegistersFree();
  10187. ASSERT(modifyAssignmentCounter = 0);
  10188. currentScope := prevScope;
  10189. IF Trace THEN TraceExit("Body") END;
  10190. END Body;
  10191. END ImplementationVisitor;
  10192. MetaDataGenerator=OBJECT
  10193. VAR
  10194. implementationVisitor: ImplementationVisitor;
  10195. declarationVisitor: DeclarationVisitor;
  10196. module: Sections.Module;
  10197. moduleName: ARRAY 128 OF CHAR;
  10198. moduleNamePool: Basic.HashTableInt;
  10199. moduleNamePoolSection: IntermediateCode.Section;
  10200. modulePointerSection: IntermediateCode.Section;
  10201. modulePointerSizePC: LONGINT;
  10202. modulePointerSectionOffset: LONGINT;
  10203. modulePointers: LONGINT;
  10204. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10205. RecordBaseOffset: LONGINT;
  10206. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10207. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10208. TypeTags: LONGINT; (* type extension level support *)
  10209. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10210. patchInfoPC: LONGINT;
  10211. patchCRC: LONGINT;
  10212. CONST
  10213. EmptyBlockOffset = 2;
  10214. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10215. BEGIN
  10216. IF implementationVisitor.backend.cooperative THEN
  10217. TypeTags := MAX(LONGINT);
  10218. BaseTypesTableOffset := 0;
  10219. MethodTableOffset := 2;
  10220. TypeRecordBaseOffset := 0;
  10221. RecordBaseOffset := 0;
  10222. ELSIF simple THEN
  10223. TypeTags := 3; (* only 3 extensions allowed *)
  10224. BaseTypesTableOffset := 1;
  10225. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10226. TypeRecordBaseOffset := 0;
  10227. RecordBaseOffset := 1;
  10228. ELSE
  10229. TypeTags := 16;
  10230. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10231. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10232. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10233. (* change this when Heaps.HeapBlock is modified *)
  10234. RecordBaseOffset := 8;
  10235. END;
  10236. SELF.simple := simple;
  10237. SELF.implementationVisitor := implementationVisitor;
  10238. SELF.declarationVisitor := declarationVisitor;
  10239. implementationVisitor.meta := SELF;
  10240. declarationVisitor.meta := SELF;
  10241. END InitMetaDataGenerator;
  10242. PROCEDURE SetModule(module: Sections.Module);
  10243. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10244. BEGIN
  10245. SELF.module := module;
  10246. Global.GetModuleName(module.module,moduleName);
  10247. Global.GetSymbolSegmentedName(module.module, name);
  10248. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10249. NEW(moduleNamePool, 32);
  10250. (*! require GC protection *)
  10251. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10252. IF ProtectModulesPointers THEN
  10253. name := "Heaps.AnyPtr";
  10254. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10255. (* set base pointer *)
  10256. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10257. END;
  10258. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10259. modulePointers := 0;
  10260. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10261. AddPointer(moduleNamePoolSection, namePoolOffset);
  10262. END;
  10263. END SetModule;
  10264. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10265. BEGIN
  10266. IF ~implementationVisitor.backend.cooperative THEN
  10267. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10268. INC(modulePointers);
  10269. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10270. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10271. END;
  10272. END AddPointer;
  10273. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10274. BEGIN
  10275. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10276. END GetTypeRecordBaseOffset;
  10277. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10278. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10279. BEGIN
  10280. (* change this when Heaps.HeapBlock is modified *)
  10281. INC(dataAdrOffset,6);
  10282. Info(section,"headerAdr");
  10283. Address(section,0);
  10284. Info(section,"typeDesc");
  10285. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10286. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10287. NamedSymbol(section, name, symbol, 0, offset);
  10288. Info(section,"mark: LONGINT;");
  10289. Longint(section,-1);
  10290. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10291. Info(section,"dataAdr-: ADDRESS");
  10292. Symbol(section,section, dataAdrOffset,0);
  10293. Info(section,"size-: SIZE");
  10294. Address(section,0);
  10295. Info(section,"nextMark: HeapBlock;");
  10296. Address(section,0);
  10297. (*
  10298. Info(section,"generation");
  10299. Longint(section,0);
  10300. *)
  10301. END HeapBlock;
  10302. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10303. VAR i: LONGINT;
  10304. BEGIN
  10305. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10306. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10307. Info(section,"count*: LONGINT");
  10308. Longint(section,0);
  10309. Info(section,"locked*: BOOLEAN");
  10310. Longint(section,0);
  10311. Info(section,"awaitingLock*: ProcessQueue");
  10312. Address(section,0);
  10313. Address(section,0);
  10314. Info(section,"awaitingCond*: ProcessQueue");
  10315. Address(section,0);
  10316. Address(section,0);
  10317. Info(section,"lockedBy*: ANY");
  10318. Address(section,0);
  10319. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10320. Longint(section,1);
  10321. FOR i := 2 TO 6 DO
  10322. Longint(section,0);
  10323. END;
  10324. Info(section,"lock*: ANY");
  10325. Address(section,0);
  10326. END ProtectedHeapBlock;
  10327. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10328. BEGIN
  10329. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10330. END Info;
  10331. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10332. VAR op: IntermediateCode.Operand;
  10333. BEGIN
  10334. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10335. section.Emit(Data(Basic.invalidPosition,op));
  10336. END Address;
  10337. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10338. VAR op: IntermediateCode.Operand;
  10339. BEGIN
  10340. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10341. section.Emit(Data(Basic.invalidPosition,op));
  10342. END Size;
  10343. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10344. VAR op: IntermediateCode.Operand;
  10345. BEGIN
  10346. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10347. section.Emit(Data(Basic.invalidPosition,op));
  10348. END Set;
  10349. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10350. VAR op: IntermediateCode.Operand;
  10351. BEGIN
  10352. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10353. section.Emit(Data(Basic.invalidPosition,op));
  10354. END Longint;
  10355. PROCEDURE PatchAddress(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.addressType),value);
  10360. section.PatchOperands(pc,op,noOperand,noOperand);
  10361. END PatchAddress;
  10362. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10363. VAR op,noOperand: IntermediateCode.Operand;
  10364. BEGIN
  10365. IntermediateCode.InitOperand(noOperand);
  10366. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10367. section.PatchOperands(pc,op,noOperand,noOperand);
  10368. END PatchSize;
  10369. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10370. VAR op,noOperand: IntermediateCode.Operand;
  10371. BEGIN
  10372. IntermediateCode.InitOperand(noOperand);
  10373. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10374. section.PatchOperands(pc,op,noOperand,noOperand);
  10375. END PatchLongint;
  10376. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10377. VAR op, noOperand: IntermediateCode.Operand;
  10378. BEGIN
  10379. IntermediateCode.InitOperand(noOperand);
  10380. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10381. section.PatchOperands(pc,op,noOperand,noOperand);
  10382. END PatchSymbol;
  10383. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10384. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10385. BEGIN
  10386. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10387. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10388. section.Emit(Data(Basic.invalidPosition,op));
  10389. END Boolean;
  10390. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10391. VAR op: IntermediateCode.Operand;
  10392. BEGIN
  10393. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10394. section.Emit(Data(Basic.invalidPosition,op));
  10395. END Char;
  10396. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10397. VAR op: IntermediateCode.Operand;
  10398. BEGIN
  10399. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10400. section.Emit(Data(Basic.invalidPosition,op));
  10401. END Integer;
  10402. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10403. VAR i: LONGINT;
  10404. BEGIN
  10405. Info(section,str);
  10406. i := 0;
  10407. WHILE(str[i] # 0X) DO
  10408. Char(section,str[i]);
  10409. INC(i);
  10410. END;
  10411. Char(section,0X);
  10412. END String;
  10413. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10414. VAR s: Basic.SectionName;
  10415. BEGIN
  10416. StringPool.GetString(str, s);
  10417. String(section, s);
  10418. END String0;
  10419. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10420. VAR op: IntermediateCode.Operand;
  10421. BEGIN
  10422. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10423. IntermediateCode.SetOffset(op,realOffset);
  10424. section.Emit(Data(Basic.invalidPosition,op));
  10425. END NamedSymbol;
  10426. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10427. VAR op: IntermediateCode.Operand;
  10428. BEGIN
  10429. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10430. IntermediateCode.SetOffset(op,realOffset);
  10431. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10432. END NamedSymbolAt;
  10433. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10434. BEGIN
  10435. IF symbol= NIL THEN
  10436. Address( section, realOffset);
  10437. ASSERT(virtualOffset = 0);
  10438. ELSE
  10439. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10440. END;
  10441. END Symbol;
  10442. (* OutPointers delivers
  10443. {pointerOffset}
  10444. *)
  10445. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10446. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10447. BEGIN
  10448. type := type.resolved;
  10449. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10450. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10451. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10452. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10453. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10454. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10455. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10456. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10457. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10458. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10459. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10460. ELSIF (type IS SyntaxTree.RecordType) THEN
  10461. (* never treat a record like a pointer, even if the pointer field is set! *)
  10462. WITH type: SyntaxTree.RecordType DO
  10463. base := type.GetBaseRecord();
  10464. IF base # NIL THEN
  10465. Pointers(offset,symbol,section, base,numberPointers);
  10466. END;
  10467. variable := type.recordScope.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. END;
  10475. ELSIF (type IS SyntaxTree.CellType) THEN
  10476. WITH type: SyntaxTree.CellType DO
  10477. base := type.GetBaseRecord();
  10478. IF base # NIL THEN
  10479. Pointers(offset,symbol,section, base,numberPointers);
  10480. END;
  10481. variable := type.cellScope.firstVariable;
  10482. WHILE(variable # NIL) DO
  10483. IF ~(variable.untraced) THEN
  10484. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10485. END;
  10486. variable := variable.nextVariable;
  10487. END;
  10488. property := type.firstProperty;
  10489. WHILE(property # NIL) DO
  10490. IF ~(property.untraced) THEN
  10491. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10492. END;
  10493. property := property.nextProperty;
  10494. END;
  10495. parameter := type.firstParameter;
  10496. WHILE(parameter # NIL) DO
  10497. IF ~(parameter.untraced) THEN
  10498. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10499. END;
  10500. parameter := parameter.nextParameter;
  10501. END;
  10502. END;
  10503. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10504. WITH type: SyntaxTree.ArrayType DO
  10505. IF type.form= SyntaxTree.Static THEN
  10506. n := type.staticLength;
  10507. base := type.arrayBase.resolved;
  10508. WHILE(base IS SyntaxTree.ArrayType) DO
  10509. type := base(SyntaxTree.ArrayType);
  10510. n := n* type.staticLength;
  10511. base := type.arrayBase.resolved;
  10512. END;
  10513. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10514. IF SemanticChecker.ContainsPointer(base) THEN
  10515. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10516. FOR i := 0 TO n-1 DO
  10517. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10518. END;
  10519. END;
  10520. ELSE
  10521. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10522. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10523. END;
  10524. END;
  10525. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10526. WITH type: SyntaxTree.MathArrayType DO
  10527. IF type.form = SyntaxTree.Static THEN
  10528. n := type.staticLength;
  10529. base := type.arrayBase.resolved;
  10530. WHILE(base IS SyntaxTree.MathArrayType) DO
  10531. type := base(SyntaxTree.MathArrayType);
  10532. n := n* type.staticLength;
  10533. base := type.arrayBase.resolved;
  10534. END;
  10535. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10536. IF SemanticChecker.ContainsPointer(base) THEN
  10537. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10538. FOR i := 0 TO n-1 DO
  10539. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10540. END;
  10541. END;
  10542. ELSE
  10543. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10544. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10545. END
  10546. END;
  10547. (* ELSE no pointers in type *)
  10548. END;
  10549. END Pointers;
  10550. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10551. VAR position,i: LONGINT; ch: CHAR;
  10552. BEGIN
  10553. IF pool.Has(index) THEN
  10554. RETURN pool.GetInt(index)
  10555. ELSE
  10556. position := source.pc;
  10557. pool.PutInt(index, position);
  10558. Info(source, name);
  10559. i := 0;
  10560. REPEAT
  10561. ch := name[i]; INC(i);
  10562. Char( source, ch);
  10563. UNTIL ch = 0X;
  10564. END;
  10565. RETURN position;
  10566. END EnterDynamicName;
  10567. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10568. VAR name: Basic.SectionName; position: LONGINT;
  10569. BEGIN
  10570. IF pool.Has(index) THEN
  10571. RETURN pool.GetInt(index)
  10572. ELSE
  10573. StringPool.GetString(index, name);
  10574. position := EnterDynamicName(source,name,index, pool);
  10575. END;
  10576. RETURN position;
  10577. END DynamicName;
  10578. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10579. VAR section: IntermediateCode.Section;
  10580. BEGIN
  10581. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10582. IF implementationVisitor.backend.cooperative THEN
  10583. Info(section, "TypeDescriptor");
  10584. Basic.ToSegmentedName("BaseTypes.Array", name);
  10585. NamedSymbol(section, name,NIL, 0, 0);
  10586. BasePointer(section);
  10587. offset := 0;
  10588. ELSE
  10589. IF ProtectModulesPointers THEN
  10590. HeapBlock(mName,typeName,section,2);
  10591. END;
  10592. Info(section, "HeapBlock");
  10593. IF ProtectModulesPointers THEN
  10594. Symbol(section,section,2,0);
  10595. ELSE
  10596. Address(section,0);
  10597. END;
  10598. Info(section, "TypeDescriptor");
  10599. Address(section,0);
  10600. offset := section.pc;
  10601. END;
  10602. RETURN section
  10603. END NamedBlock;
  10604. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10605. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10606. BEGIN
  10607. COPY(moduleName,name);
  10608. Strings.Append(name,suffix);
  10609. Basic.ToSegmentedName(name, pooledName);
  10610. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10611. END Block;
  10612. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10613. VAR name: Basic.SegmentedName;
  10614. BEGIN
  10615. Info(source,"ArrayHeader");
  10616. IF implementationVisitor.backend.cooperative THEN
  10617. sizePC := source.pc;
  10618. Address(source,0);
  10619. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10620. IF baseType # "" THEN
  10621. Basic.ToSegmentedName(baseType, name);
  10622. NamedSymbol(source, name,NIL, 0, 0);
  10623. ELSE
  10624. Address(source,0);
  10625. END;
  10626. Address(source,0);
  10627. ELSE
  10628. Address(source,0);
  10629. Address(source,0);
  10630. (* first pointer for GC *)
  10631. IF hasPointer THEN
  10632. (* points to first element in the array, this is NOT the base type descriptor *)
  10633. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10634. ELSE
  10635. Address(source,0);
  10636. END;
  10637. sizePC := source.pc;
  10638. Address(source,0);
  10639. Info(source,"array data");
  10640. END;
  10641. END ArrayBlock;
  10642. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10643. BEGIN
  10644. IF implementationVisitor.backend.cooperative THEN
  10645. PatchSize(section, pc, size);
  10646. PatchSize(section, pc + 3, size);
  10647. ELSE
  10648. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10649. PatchSize(section, pc, size);
  10650. END;
  10651. END PatchArray;
  10652. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10653. VAR
  10654. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10655. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10656. poolMap: Basic.HashTableInt;
  10657. namePool: IntermediateCode.Section;
  10658. namePoolOffset: LONGINT;
  10659. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10660. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10661. BEGIN
  10662. Basic.SegmentedNameToString(s1.name,n1);
  10663. Basic.SegmentedNameToString(s2.name,n2);
  10664. index := 0;
  10665. ch1 := n1[index];
  10666. ch2 := n2[index];
  10667. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10668. INC(index);
  10669. ch1 := n1[index];
  10670. ch2 := n2[index];
  10671. END;
  10672. RETURN ch1 < ch2;
  10673. END Compare;
  10674. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10675. VAR
  10676. i, j: LONGINT;
  10677. x, t: Sections.Section;
  10678. BEGIN
  10679. IF lo < hi THEN
  10680. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10681. WHILE i <= j DO
  10682. WHILE Compare(list[i], x) DO INC(i) END;
  10683. WHILE Compare(x, list[j]) DO DEC(j) END;
  10684. IF i <= j THEN
  10685. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10686. INC(i); DEC(j)
  10687. END
  10688. END;
  10689. IF lo < j THEN QuickSort(list, lo, j) END;
  10690. IF i < hi THEN QuickSort(list, i, hi) END
  10691. END;
  10692. END QuickSort;
  10693. (*
  10694. ExportDesc* = RECORD
  10695. fp*: ADDRESS;
  10696. name* {UNTRACED}: DynamicName;
  10697. adr*: ADDRESS;
  10698. exports*: LONGINT;
  10699. dsc* {UNTRACED}: ExportArray
  10700. END;
  10701. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10702. *)
  10703. PROCEDURE ExportDesc2(
  10704. source: IntermediateCode.Section;
  10705. namePool: IntermediateCode.Section;
  10706. fingerPrinter: FingerPrinter.FingerPrinter;
  10707. symbol: Sections.Section;
  10708. name: StringPool.Index;
  10709. VAR patchAdr: LONGINT
  10710. ): BOOLEAN;
  10711. VAR fingerPrint: SyntaxTree.FingerPrint;
  10712. BEGIN
  10713. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10714. & (symbol.type # Sections.InlineCodeSection)
  10715. THEN
  10716. *)
  10717. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10718. & (symbol.type # Sections.InlineCodeSection))
  10719. THEN
  10720. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10721. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10722. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10723. Longint(source,fingerPrint.public);
  10724. ELSE
  10725. Longint(source, 0);
  10726. END;
  10727. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10728. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10729. Symbol(source, symbol,0,0);
  10730. patchAdr := source.pc;
  10731. Longint(source, 0);
  10732. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10733. Address(source,0);
  10734. END;
  10735. RETURN TRUE
  10736. ELSE
  10737. RETURN FALSE
  10738. END;
  10739. END ExportDesc2;
  10740. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10741. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10742. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10743. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10744. nextPatch: LONGINT;
  10745. TYPE
  10746. Scope = RECORD
  10747. elements: LONGINT;
  10748. gelements: LONGINT;
  10749. section: IntermediateCode.Section;
  10750. patchAdr: LONGINT;
  10751. arraySizePC: LONGINT;
  10752. beginPC: LONGINT; (* current scope start pc *)
  10753. END;
  10754. BEGIN
  10755. Basic.InitSegmentedName(prev);
  10756. olevel := -1;
  10757. scopes[0].section := source;
  10758. scopes[0].arraySizePC := MIN(LONGINT);
  10759. FOR s := 0 TO LEN(sections)-1 DO
  10760. symbol := sections[s];
  10761. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10762. this := sections[s].name;
  10763. level := 0;
  10764. WHILE (this[level] > 0) DO
  10765. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10766. INC(level);
  10767. END;
  10768. WHILE level < olevel DO
  10769. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10770. IF olevel > 0 THEN
  10771. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10772. nextPatch := scopes[olevel-1].patchAdr+1;
  10773. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10774. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10775. END;
  10776. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10777. DEC(olevel);
  10778. END;
  10779. IF (this[level] > 0) THEN
  10780. IF level > olevel THEN
  10781. (*TRACE("opening",level); *)
  10782. IF scopes[level].section = NIL THEN
  10783. arrayName := ".@ExportArray";
  10784. Strings.AppendInt(arrayName, level);
  10785. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10786. AddPointer(scopes[level].section,offset);
  10787. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10788. END;
  10789. scopes[level].beginPC := scopes[level].section.pc;
  10790. olevel := level;
  10791. scopes[olevel].elements := 0;
  10792. END;
  10793. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10794. sym := sections[s];
  10795. ELSE
  10796. sym := NIL;
  10797. END;
  10798. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10799. THEN
  10800. INC(scopes[olevel].elements);
  10801. END;
  10802. (* enter string in scope *)
  10803. INC(level);
  10804. END;
  10805. END;
  10806. Basic.SegmentedNameToString(this, name);
  10807. prev := this;
  10808. END;
  10809. END;
  10810. WHILE 0 <= olevel DO
  10811. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10812. IF olevel > 0 THEN
  10813. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10814. nextPatch := scopes[olevel-1].patchAdr+1;
  10815. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10816. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10817. END;
  10818. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10819. DEC(olevel);
  10820. END;
  10821. level := 0;
  10822. WHILE (level < LEN(scopes)) DO
  10823. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10824. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10825. END;
  10826. INC(level);
  10827. END;
  10828. END Export;
  10829. BEGIN
  10830. NEW(fingerPrinter);
  10831. NEW(poolMap, 64);
  10832. (* 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 *)
  10833. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10834. NEW(sectionArray, module.allSections.Length());
  10835. FOR i := 0 TO module.allSections.Length() - 1 DO
  10836. section := module.allSections.GetSection(i);
  10837. sectionArray[i] := section;
  10838. END;
  10839. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10840. Export(sectionArray^);
  10841. END ExportDesc;
  10842. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10843. VAR
  10844. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10845. BEGIN
  10846. Info(source, "exception table offsets array descriptor");
  10847. size := 0;
  10848. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10849. Info(source, "exception table content");
  10850. FOR i := 0 TO module.allSections.Length() - 1 DO
  10851. p := module.allSections.GetSection(i);
  10852. IF p.type = Sections.CodeSection THEN
  10853. finallyPC := p(IntermediateCode.Section).finally;
  10854. IF finallyPC>=0 THEN
  10855. Symbol( source, p, 0,0);
  10856. Symbol( source, p, finallyPC, 0);
  10857. Symbol( source, p, finallyPC,0);
  10858. INC(size);
  10859. END;
  10860. END
  10861. END;
  10862. PatchArray(source,sizePC,size);
  10863. END ExceptionArray;
  10864. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10865. VAR i: LONGINT; ch: CHAR;
  10866. BEGIN
  10867. i := 0;
  10868. REPEAT
  10869. ch := name[i]; INC(i);
  10870. Char( section, ch);
  10871. UNTIL ch = 0X;
  10872. WHILE i < 32 DO
  10873. Char( section, 0X); INC(i);
  10874. END;
  10875. END Name;
  10876. PROCEDURE References(section: IntermediateCode.Section);
  10877. CONST
  10878. sfTypeNone = 0X;
  10879. sfTypeCHAR = 01X;
  10880. sfTypeCHAR8 = 02X;
  10881. sfTypeCHAR16 = 03X;
  10882. sfTypeCHAR32 = 04X;
  10883. sfTypeRANGE = 05X;
  10884. sfTypeSHORTINT = 06X;
  10885. sfTypeINTEGER = 07X;
  10886. sfTypeLONGINT = 08X;
  10887. sfTypeHUGEINT = 09X;
  10888. sfTypeWORD = 0AX;
  10889. sfTypeLONGWORD = 0BX;
  10890. sfTypeSIGNED8 = 0CX;
  10891. sfTypeSIGNED16 = 0DX;
  10892. sfTypeSIGNED32 = 0EX;
  10893. sfTypeSIGNED64 = 0FX;
  10894. sfTypeUNSIGNED8 = 10X;
  10895. sfTypeUNSIGNED16 = 11X;
  10896. sfTypeUNSIGNED32 = 12X;
  10897. sfTypeUNSIGNED64 = 13X;
  10898. sfTypeREAL = 14X;
  10899. sfTypeLONGREAL = 15X;
  10900. sfTypeCOMPLEX = 16X;
  10901. sfTypeLONGCOMPLEX = 17X;
  10902. sfTypeBOOLEAN = 18X;
  10903. sfTypeSET = 19X;
  10904. sfTypeANY = 1AX;
  10905. sfTypeOBJECT = 1BX;
  10906. sfTypeBYTE = 1CX;
  10907. sfTypeADDRESS = 1DX;
  10908. sfTypeSIZE = 1EX;
  10909. sfTypeIndirect = 1FX;
  10910. sfTypeRecord = 20X;
  10911. sfTypePointerToRecord = 21X;
  10912. sfTypePointerToArray = 22X;
  10913. sfTypeOpenArray = 23X;
  10914. sfTypeStaticArray = 24X;
  10915. sfTypeDynamicArray = 25X;
  10916. sfTypeMathStaticArray = 26X;
  10917. sfTypeMathOpenArray = 27X;
  10918. sfTypeMathTensor = 28X;
  10919. sfTypeDelegate = 29X;
  10920. sfTypeENUM = 2AX;
  10921. sfTypeCELL = 2BX;
  10922. sfTypePORT = 2CX;
  10923. sfIN = 0X;
  10924. sfOUT = 1X;
  10925. flagDelegate = 0;
  10926. flagConstructor = 1;
  10927. (* variable / parameter addressing modes *)
  10928. sfAbsolute = 0X; (* global vars *)
  10929. sfRelative = 1X; (* variables, value parameters *)
  10930. sfIndirect = 2X; (* var parameters *)
  10931. sfScopeBegin = 0F0X;
  10932. sfScopeEnd = 0F1X;
  10933. sfProcedure = 0F2X;
  10934. sfVariable = 0F3X;
  10935. sfTypeDeclaration = 0F4X;
  10936. sfModule = 0FFX;
  10937. RefInfo = TRUE;
  10938. VAR
  10939. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  10940. indirectTypes: Basic.HashTable;
  10941. PROCEDURE CurrentIndex(): SIZE;
  10942. VAR i: LONGINT;
  10943. BEGIN
  10944. FOR i := startPC TO section.pc -1 DO
  10945. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10946. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10947. END;
  10948. startPC := section.pc;
  10949. RETURN lastOffset;
  10950. END CurrentIndex;
  10951. (*
  10952. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  10953. Module = sfModule prevSymbol:SIZE name:String Scope.
  10954. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  10955. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  10956. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  10957. Type =
  10958. sfTypePointerToRecord
  10959. | sfTypePointerToArray Type
  10960. | sfTypeOpenArray Type
  10961. | sfTypeDynamicArray Type
  10962. | sfTypeStaticArray length:SIZE Type
  10963. | sfTypeMathOpenArray Type
  10964. | sfTypeMathStaticArray length:SIZE Type
  10965. | sfTypeMathTensor Type
  10966. | sfTypeRecord tdAdr:ADDRESS
  10967. | sfTypeDelegate {Parameter} return:Type
  10968. | sfTypePort (sfIN | sfOUT)
  10969. | sfTypeBOOLEAN
  10970. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  10971. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  10972. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  10973. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  10974. | sfTypeWORD | sfTypeLONGWORD
  10975. | sfTypeREAL | sfTypeLONGREAL
  10976. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  10977. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  10978. | sfTypeIndirect offset:SIZE.
  10979. *)
  10980. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  10981. VAR offset: SIZE;
  10982. BEGIN
  10983. IF indirectTypes.Has(type) THEN
  10984. offset := indirectTypes.GetInt(type);
  10985. Char(section, sfTypeIndirect);
  10986. Size(section, offset);
  10987. RETURN TRUE;
  10988. ELSE
  10989. indirectTypes.PutInt(type, CurrentIndex());
  10990. RETURN FALSE;
  10991. END;
  10992. END Indirect;
  10993. PROCEDURE NType(type: SyntaxTree.Type);
  10994. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  10995. segmentedName: Basic.SegmentedName; offset: SIZE; parameter: SyntaxTree.Parameter;
  10996. BEGIN
  10997. IF type = NIL THEN
  10998. Char(section, sfTypeNone)
  10999. ELSE
  11000. type := type.resolved;
  11001. size := type.sizeInBits;
  11002. WITH type:SyntaxTree.PointerType DO
  11003. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11004. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11005. Char(section, sfTypePointerToRecord);
  11006. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11007. ELSE
  11008. IF RefInfo THEN Info(section,"PointerToArray") END;
  11009. Char(section, sfTypePointerToArray);
  11010. NType(type.pointerBase);
  11011. END;
  11012. | type: SyntaxTree.ArrayType DO
  11013. IF ~Indirect(type) THEN
  11014. IF type.form = SyntaxTree.Open THEN
  11015. IF RefInfo THEN Info(section,"OpenArray") END;
  11016. Char(section, sfTypeOpenArray);
  11017. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11018. IF RefInfo THEN Info(section,"DynamicArray") END;
  11019. Char(section, sfTypeDynamicArray);
  11020. ELSIF type.form = SyntaxTree.Static THEN
  11021. IF RefInfo THEN Info(section,"StaticArray") END;
  11022. Char(section, sfTypeStaticArray);
  11023. Size(section, type.staticLength);
  11024. ELSE
  11025. HALT(100);
  11026. END;
  11027. NType(type.arrayBase);
  11028. END;
  11029. | type: SyntaxTree.MathArrayType DO
  11030. IF ~Indirect(type) THEN
  11031. IF type.form = SyntaxTree.Open THEN
  11032. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11033. Char(section, sfTypeMathOpenArray);
  11034. ELSIF type.form = SyntaxTree.Static THEN
  11035. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11036. Char(section, sfTypeMathStaticArray);
  11037. Size(section, type.staticLength);
  11038. ELSIF type.form = SyntaxTree.Tensor THEN
  11039. IF RefInfo THEN Info(section,"MathTensor") END;
  11040. Char(section, sfTypeMathTensor);
  11041. ELSE
  11042. HALT(100);
  11043. END;
  11044. NType(type.arrayBase);
  11045. END;
  11046. | type: SyntaxTree.RecordType DO
  11047. IF ~Indirect(type) THEN
  11048. IF type.pointerType # NIL (* OBJECT *) THEN
  11049. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11050. Char(section, sfTypePointerToRecord)
  11051. ELSE
  11052. IF RefInfo THEN Info(section,"Record") END;
  11053. Char(section, sfTypeRecord);
  11054. td := type.typeDeclaration;
  11055. IF RefInfo THEN Info(section,"TD") END;
  11056. IF (td # NIL) THEN
  11057. Global.GetSymbolSegmentedName(td,segmentedName);
  11058. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11059. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11060. ELSE
  11061. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11062. END;
  11063. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11064. Symbol(section, tir, 0, offset);
  11065. ELSE
  11066. Address(section, 0);
  11067. END;
  11068. END;
  11069. END;
  11070. | type: SyntaxTree.CellType DO
  11071. IF ~Indirect(type) THEN
  11072. IF RefInfo THEN Info(section,"Record") END;
  11073. Char(section, sfTypeRecord);
  11074. td := type.typeDeclaration;
  11075. IF RefInfo THEN Info(section,"TD") END;
  11076. IF (td # NIL) THEN
  11077. Global.GetSymbolSegmentedName(td,segmentedName);
  11078. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11079. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11080. ELSE
  11081. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11082. END;
  11083. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11084. Symbol(section, tir, 0, offset);
  11085. ELSE
  11086. Address(section, 0);
  11087. END;
  11088. END;
  11089. | type: SyntaxTree.PortType DO
  11090. Char(section, sfTypePORT);
  11091. IF type.direction = SyntaxTree.OutPort THEN
  11092. Char(section, sfOUT)
  11093. ELSE
  11094. Char(section, sfIN)
  11095. END;
  11096. | type: SyntaxTree.ProcedureType DO
  11097. IF ~Indirect(type) THEN
  11098. Char(section, sfTypeDelegate);
  11099. parameter := type.firstParameter;
  11100. WHILE(parameter # NIL) DO
  11101. NParameter(parameter, -1);
  11102. parameter := parameter.nextParameter;
  11103. END;
  11104. NType(type.returnType);
  11105. END;
  11106. | type:SyntaxTree.EnumerationType DO
  11107. Char(section, sfTypeENUM);
  11108. | type: SyntaxTree.BasicType DO
  11109. WITH type: SyntaxTree.BooleanType DO
  11110. IF RefInfo THEN Info(section,"Boolean") END;
  11111. Char(section, sfTypeBOOLEAN);
  11112. | type: SyntaxTree.CharacterType DO
  11113. IF type = module.system.characterType THEN
  11114. IF RefInfo THEN Info(section,"CHAR") END;
  11115. Char(section, sfTypeCHAR);
  11116. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11117. IF RefInfo THEN Info(section,"CHAR8") END;
  11118. Char(section, sfTypeCHAR8)
  11119. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11120. IF RefInfo THEN Info(section,"CHAR16") END;
  11121. Char(section, sfTypeCHAR16);
  11122. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11123. IF RefInfo THEN Info(section,"CHAR32") END;
  11124. Char(section, sfTypeCHAR32);
  11125. ELSE
  11126. HALT(100);
  11127. END;
  11128. |type: SyntaxTree.IntegerType DO
  11129. IF type(SyntaxTree.IntegerType).signed THEN
  11130. IF (type = module.system.shortintType) THEN
  11131. IF RefInfo THEN Info(section,"SHORTINT") END;
  11132. Char(section, sfTypeSHORTINT)
  11133. ELSIF (type = module.system.integerType) THEN
  11134. IF RefInfo THEN Info(section,"INTEGER") END;
  11135. Char(section, sfTypeINTEGER)
  11136. ELSIF (type = module.system.longintType) THEN
  11137. IF RefInfo THEN Info(section,"LONGINT") END;
  11138. Char(section, sfTypeLONGINT)
  11139. ELSIF (type = module.system.hugeintType) THEN
  11140. IF RefInfo THEN Info(section,"HUGEINT") END;
  11141. Char(section, sfTypeHUGEINT)
  11142. ELSIF (type = module.system.wordType) THEN
  11143. IF RefInfo THEN Info(section,"WORD") END;
  11144. Char(section, sfTypeWORD)
  11145. ELSIF (type = module.system.longWordType) THEN
  11146. IF RefInfo THEN Info(section,"LONGWORD") END;
  11147. Char(section, sfTypeLONGWORD);
  11148. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11149. IF RefInfo THEN Info(section,"SIGNED8") END;
  11150. Char(section, sfTypeSIGNED8)
  11151. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11152. IF RefInfo THEN Info(section,"SIGNED16") END;
  11153. Char(section, sfTypeSIGNED16)
  11154. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11155. IF RefInfo THEN Info(section,"SIGNED32") END;
  11156. Char(section, sfTypeSIGNED32)
  11157. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11158. IF RefInfo THEN Info(section,"SIGNED64") END;
  11159. Char(section, sfTypeSIGNED64)
  11160. ELSE
  11161. HALT(100);
  11162. END
  11163. ELSE (* unsigned *)
  11164. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11165. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11166. Char(section, sfTypeUNSIGNED8)
  11167. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11168. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11169. Char(section, sfTypeUNSIGNED16)
  11170. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11171. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11172. Char(section, sfTypeUNSIGNED32)
  11173. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11174. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11175. Char(section, sfTypeUNSIGNED64)
  11176. ELSE
  11177. HALT(100)
  11178. END
  11179. END;
  11180. | type: SyntaxTree.FloatType DO
  11181. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11182. IF RefInfo THEN Info(section,"REAL") END;
  11183. Char(section, sfTypeREAL);
  11184. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11185. IF RefInfo THEN Info(section,"LONGREAL") END;
  11186. Char(section, sfTypeLONGREAL);
  11187. ELSE
  11188. HALT(100);
  11189. END;
  11190. |type: SyntaxTree.ComplexType DO
  11191. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11192. IF RefInfo THEN Info(section,"COMPLEX") END;
  11193. Char(section, sfTypeCOMPLEX);
  11194. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11195. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11196. Char(section, sfTypeLONGCOMPLEX);
  11197. ELSE
  11198. HALT(100);
  11199. END;
  11200. |type:SyntaxTree.SetType DO
  11201. IF RefInfo THEN Info(section,"SET") END;
  11202. Char(section, sfTypeSET);
  11203. |type:SyntaxTree.AnyType DO
  11204. IF RefInfo THEN Info(section,"ANY") END;
  11205. Char(section, sfTypeANY);
  11206. |type:SyntaxTree.ObjectType DO
  11207. IF RefInfo THEN Info(section,"OBJECT") END;
  11208. Char(section, sfTypeOBJECT);
  11209. |type:SyntaxTree.ByteType DO
  11210. IF RefInfo THEN Info(section,"BYTE") END;
  11211. Char(section, sfTypeBYTE);
  11212. |type:SyntaxTree.RangeType DO
  11213. IF RefInfo THEN Info(section,"RANGE") END;
  11214. Char(section, sfTypeRANGE)
  11215. |type:SyntaxTree.AddressType DO
  11216. IF RefInfo THEN Info(section,"ADDRESS") END;
  11217. Char(section, sfTypeADDRESS)
  11218. |type:SyntaxTree.SizeType DO
  11219. IF RefInfo THEN Info(section,"SIZE") END;
  11220. Char(section, sfTypeSIZE)
  11221. ELSE
  11222. HALT(100)
  11223. END;
  11224. ELSE HALT(101);
  11225. END;
  11226. END;
  11227. END NType;
  11228. (*
  11229. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11230. *)
  11231. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11232. VAR pos: LONGINT; type: SyntaxTree.Type;
  11233. BEGIN
  11234. IF RefInfo THEN Info(section, "Parameter") END;
  11235. Char(section, sfVariable);
  11236. Size(section, procOffset);
  11237. String0(section, parameter.name);
  11238. type := parameter.type.resolved;
  11239. IF parameter.kind = SyntaxTree.VarParameter THEN
  11240. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11241. ELSE Char(section, sfIndirect)
  11242. END;
  11243. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11244. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11245. Char(section, sfIndirect);
  11246. ELSE
  11247. Char(section, sfRelative);
  11248. END;
  11249. ELSE
  11250. Char(section, sfRelative);
  11251. END;
  11252. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11253. NType(parameter.type);
  11254. END NParameter;
  11255. (*
  11256. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11257. *)
  11258. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11259. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11260. flags: SET;
  11261. BEGIN
  11262. IF procedure.externalName # NIL THEN RETURN END;
  11263. IF RefInfo THEN Info(section, "Procedure") END;
  11264. pos := CurrentIndex();
  11265. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11266. Char(section, sfProcedure);
  11267. Size(section, scopeOffset);
  11268. String0(section,procedure.name);
  11269. s := module.allSections.FindBySymbol(procedure);
  11270. Symbol(section,s,0,0); (* start *)
  11271. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11272. flags := {};
  11273. IF procedureType.isDelegate THEN
  11274. INCL(flags, flagDelegate);
  11275. END;
  11276. IF procedure.isConstructor THEN
  11277. INCL(flags, flagConstructor);
  11278. END;
  11279. Set(section, flags);
  11280. IF RefInfo THEN Info(section, "Parameters") END;
  11281. parameter := procedureType.firstParameter;
  11282. WHILE(parameter # NIL) DO
  11283. NParameter(parameter, pos);
  11284. parameter := parameter.nextParameter;
  11285. END;
  11286. IF procedureType.returnParameter # NIL THEN
  11287. NParameter(procedureType.returnParameter, pos);
  11288. END;
  11289. IF procedureType.selfParameter # NIL THEN
  11290. NParameter(procedureType.selfParameter, pos);
  11291. END;
  11292. IF RefInfo THEN Info(section, "ReturnType") END;
  11293. NType(procedureType.returnType);
  11294. NScope(procedure.procedureScope, pos);
  11295. END NProcedure;
  11296. (*
  11297. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11298. *)
  11299. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11300. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11301. BEGIN
  11302. IF RefInfo THEN Info(section, "Variable") END;
  11303. pos := CurrentIndex();
  11304. Char(section, sfVariable);
  11305. Size(section, scopeOffset);
  11306. String0(section, variable.name);
  11307. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11308. Char(section, sfAbsolute);
  11309. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11310. NamedSymbol(section, sn,variable, 0,0);
  11311. ELSE
  11312. Char(section, sfRelative);
  11313. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11314. END;
  11315. NType(variable.type);
  11316. s := module.allSections.FindBySymbol(variable);
  11317. END NVariable;
  11318. (*
  11319. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11320. *)
  11321. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11322. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11323. BEGIN
  11324. IF typeDeclaration = NIL THEN RETURN END;
  11325. pos := CurrentIndex();
  11326. s := module.allSections.FindBySymbol(typeDeclaration);
  11327. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11328. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11329. Char(section, sfTypeDeclaration);
  11330. Size(section, scopeOffset);
  11331. String0(section, typeDeclaration.name);
  11332. declared := typeDeclaration.declaredType.resolved;
  11333. IF (declared IS SyntaxTree.PointerType) THEN
  11334. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11335. END;
  11336. WITH declared: SyntaxTree.RecordType DO
  11337. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11338. Symbol(section, s, 0, offset);
  11339. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11340. Basic.AppendToSegmentedName(name,".@Info");
  11341. s := module.allSections.FindByName(name);
  11342. IF s # NIL THEN (* does not work for coop *)
  11343. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11344. END;
  11345. NScope(declared.recordScope, pos);
  11346. |declared: SyntaxTree.CellType DO
  11347. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11348. Symbol(section, s, 0, offset);
  11349. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11350. Basic.AppendToSegmentedName(name,".@Info");
  11351. s := module.allSections.FindByName(name);
  11352. IF s # NIL THEN
  11353. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11354. END;
  11355. NScope(declared.cellScope, pos);
  11356. ELSE
  11357. Address(section, 0);
  11358. END;
  11359. END NTypeDeclaration;
  11360. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11361. VAR pos: LONGINT;
  11362. BEGIN
  11363. pos := CurrentIndex();
  11364. Char(section,sfModule);
  11365. Size(section, prevSymbol);
  11366. String0(section, module.name);
  11367. NScope(module.moduleScope, pos);
  11368. END NModule;
  11369. (*
  11370. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11371. *)
  11372. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11373. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11374. BEGIN
  11375. IF scope = NIL THEN RETURN END;
  11376. IF RefInfo THEN Info(section, "Scope") END;
  11377. Char(section, sfScopeBegin);
  11378. variable := scope.firstVariable;
  11379. WHILE (variable # NIL) DO
  11380. NVariable(variable, prevSymbol);
  11381. variable := variable.nextVariable;
  11382. END;
  11383. WITH scope: SyntaxTree.ModuleScope DO
  11384. bodyProcedure := scope.bodyProcedure;
  11385. |scope: SyntaxTree.RecordScope DO
  11386. bodyProcedure := scope.bodyProcedure;
  11387. ELSE
  11388. bodyProcedure := NIL;
  11389. END;
  11390. IF bodyProcedure # NIL THEN
  11391. NProcedure(bodyProcedure, prevSymbol)
  11392. END;
  11393. procedure := scope.firstProcedure;
  11394. WHILE procedure # NIL DO
  11395. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11396. procedure := procedure.nextProcedure;
  11397. END;
  11398. typeDeclaration := scope.firstTypeDeclaration;
  11399. WHILE typeDeclaration # NIL DO
  11400. NTypeDeclaration(typeDeclaration, prevSymbol);
  11401. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11402. END;
  11403. Char(section, sfScopeEnd); (* scope ends *)
  11404. END NScope;
  11405. BEGIN
  11406. NEW(indirectTypes, 32);
  11407. ArrayBlock(section,sizePC,"", FALSE);
  11408. startPC := section.pc;
  11409. NModule(module.module, -1);
  11410. PatchArray(section,sizePC,CurrentIndex());
  11411. END References;
  11412. (*
  11413. Command* = RECORD
  11414. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11415. name*: Name; (* name of the procedure *)
  11416. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11417. entryAdr* : ADDRESS; (* entry address of procedure *)
  11418. END;
  11419. *)
  11420. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11421. VAR
  11422. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11423. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11424. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11425. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11426. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11427. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11428. BEGIN
  11429. RETURN
  11430. (type = NIL) OR
  11431. (type.resolved IS SyntaxTree.RecordType) OR
  11432. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11433. (type.resolved IS SyntaxTree.AnyType);
  11434. END TypeAllowed;
  11435. BEGIN
  11436. numberParameters := procedureType.numberParameters;
  11437. RETURN
  11438. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11439. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11440. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11441. END GetProcedureAllowed;
  11442. PROCEDURE WriteType(type : SyntaxTree.Type);
  11443. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11444. name: Basic.SegmentedName; offset: LONGINT;
  11445. BEGIN
  11446. IF type = NIL THEN
  11447. Address(source,0);
  11448. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11449. Address(source,1);
  11450. ELSE
  11451. type := type.resolved;
  11452. IF type IS SyntaxTree.PointerType THEN
  11453. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11454. END;
  11455. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11456. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11457. name[0] := typeDeclaration.name; name[1] := -1;
  11458. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11459. ASSERT(section # NIL);
  11460. ELSE
  11461. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11462. (* TODO *)
  11463. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11464. END;
  11465. IF implementationVisitor.backend.cooperative THEN
  11466. offset := 0;
  11467. ELSE
  11468. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11469. END;
  11470. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11471. END;
  11472. END WriteType;
  11473. BEGIN
  11474. Info(source, "command array descriptor");
  11475. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11476. numberCommands := 0;
  11477. Info(source, "command array content");
  11478. FOR i := 0 TO module.allSections.Length() - 1 DO
  11479. p := module.allSections.GetSection(i);
  11480. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11481. procedure := p.symbol(SyntaxTree.Procedure);
  11482. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11483. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11484. procedure.GetName(name);
  11485. Name(source,name);
  11486. numberParameters := procedureType.numberParameters;
  11487. (* offset of type of first parameter *)
  11488. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11489. ELSE WriteType(procedureType.firstParameter.type)
  11490. END;
  11491. (* offset of type of return parameter *)
  11492. WriteType(procedureType.returnType);
  11493. (* command name *)
  11494. (* command code offset *)
  11495. Symbol(source,p,0,0);
  11496. INC(numberCommands);
  11497. IF Trace THEN
  11498. D.Ln;
  11499. END;
  11500. END;
  11501. END
  11502. END;
  11503. PatchArray(source,sizePC,numberCommands);
  11504. END CommandArray;
  11505. (* to prevent from double import of different module aliases *)
  11506. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11507. VAR i: SyntaxTree.Import;
  11508. BEGIN
  11509. i := module.module.moduleScope.firstImport;
  11510. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11511. i := i.nextImport;
  11512. END;
  11513. RETURN i = import
  11514. END IsFirstDirectOccurence;
  11515. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11516. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11517. BEGIN
  11518. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11519. ArrayBlock(source,pc,"", FALSE);
  11520. Info(source, "import module array data");
  11521. IF implementationVisitor.backend.cooperative THEN
  11522. offset := 0;
  11523. ELSE
  11524. IF module.system.addressType.sizeInBits = 64 THEN
  11525. (* change this when Heaps.HeapBlock is modified *)
  11526. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11527. ELSE
  11528. (* change this when Heaps.HeapBlock is modified *)
  11529. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11530. END;
  11531. END;
  11532. import := module.module.moduleScope.firstImport;
  11533. numberImports := 0;
  11534. WHILE import # NIL DO
  11535. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11536. Global.GetModuleSegmentedName(import.module,name);
  11537. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11538. NamedSymbol(source, name, NIL, 0, offset);
  11539. INC(numberImports);
  11540. END;
  11541. import := import.nextImport
  11542. END;
  11543. PatchArray(source,pc,numberImports);
  11544. END ImportsArray;
  11545. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11546. VAR
  11547. p: Sections.Section; sizePC, size, i: LONGINT;
  11548. BEGIN
  11549. Info(source, "Type info section");
  11550. size := 0;
  11551. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11552. FOR i := 0 TO module.allSections.Length() - 1 DO
  11553. p := module.allSections.GetSection(i);
  11554. WITH p: IntermediateCode.Section DO
  11555. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11556. Symbol(source,p,EmptyBlockOffset,0);
  11557. INC(size);
  11558. END;
  11559. END
  11560. END;
  11561. PatchArray(source,sizePC,size);
  11562. END TypeInfoSection;
  11563. (*
  11564. ProcTableEntry* = RECORD
  11565. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11566. noPtr*: LONGINT;
  11567. END;
  11568. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11569. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11570. *)
  11571. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11572. VAR
  11573. numberPointers: SIZE;
  11574. procedure: SyntaxTree.Procedure;
  11575. BEGIN
  11576. Info(section,"pcFrom");
  11577. Symbol(section,procedureSection,0,0);
  11578. Info(section,"pcTo");
  11579. Symbol(section, procedureSection, procedureSection.pc, 0);
  11580. Info(section,"pointer to offsets array");
  11581. Symbol(section, section,section.pc+1,0);
  11582. Info(section,"offsets array");
  11583. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11584. PointerArray(section, procedure.procedureScope, numberPointers);
  11585. END ProcedureDescriptor;
  11586. (* only for tracing, the descriptor is otherwise not complete ! *)
  11587. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11588. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11589. BEGIN
  11590. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11591. name := procedureSection.name;
  11592. Basic.AppendToSegmentedName(name,".@Info");
  11593. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11594. Address(section,0);
  11595. Symbol(section,section,2,0);
  11596. (*
  11597. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11598. descSize: LONGINT;
  11599. sentinel: LONGINT; (* = MPO-4 *)
  11600. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11601. flags*: SET;
  11602. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11603. name*: Name;
  11604. END;
  11605. *)
  11606. Size(section, 0);
  11607. Longint(section,0);
  11608. Address(section,0);
  11609. Set(section,{});
  11610. moduleSection := ModuleSection();
  11611. Symbol( section, moduleSection, moduleSection.pc,0);
  11612. IF procedureSection.symbol = NIL THEN
  11613. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11614. ELSE
  11615. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11616. END;
  11617. Name(section, infoName);
  11618. Size(section, 0);
  11619. RETURN section;
  11620. END MakeProcedureDescriptorTag;
  11621. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11622. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11623. BEGIN
  11624. name := procedureSection.name;
  11625. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11626. IF implementationVisitor.backend.cooperative THEN
  11627. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11628. Info(section, "TypeDescriptor");
  11629. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11630. NamedSymbol(dest, name,NIL, 0, 0);
  11631. BaseRecord(dest);
  11632. offset := 0;
  11633. ELSIF CreateProcedureDescInfo THEN
  11634. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11635. Address(dest,0);
  11636. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11637. offset := dest.pc;
  11638. ELSE
  11639. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11640. END;
  11641. ProcedureDescriptor(dest, procedureSection);
  11642. Symbol(section, dest, offset, 0);
  11643. END ProcedureDescriptorPointer;
  11644. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11645. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11646. BEGIN
  11647. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11648. numberProcs := 0;
  11649. FOR i := 0 TO module.allSections.Length() - 1 DO
  11650. destination := module.allSections.GetSection(i);
  11651. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11652. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11653. INC(numberProcs);
  11654. END
  11655. END;
  11656. PatchArray(section, sizePC, numberProcs);
  11657. END ProcedureDescriptorArray;
  11658. (*
  11659. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11660. VAR
  11661. next*: Module; (** once a module is published, all fields are read-only *)
  11662. name*: Name;
  11663. init, published: BOOLEAN;
  11664. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11665. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11666. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11667. command*: POINTER TO ARRAY OF Command;
  11668. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11669. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11670. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11671. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11672. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11673. data*, code*: Bytes;
  11674. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11675. export*: ExportDesc;
  11676. term*: TerminationHandler;
  11677. exTable*: ExceptionTable;
  11678. noProcs*: LONGINT;
  11679. firstProc*: ADDRESS; <- done by loader
  11680. maxPtrs*: LONGINT;
  11681. crc*: LONGINT;
  11682. *)
  11683. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11684. BEGIN
  11685. Info(section, "cycle");
  11686. Size(section,0);
  11687. Info(section, "references");
  11688. Size(section,0);
  11689. Info(section, "nextMarked");
  11690. Address(section,0);
  11691. Info(section, "nextWatched");
  11692. Address(section,0);
  11693. END BasePointer;
  11694. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11695. BEGIN
  11696. BasePointer(section);
  11697. Info(section, "action");
  11698. Address(section,0);
  11699. Info(section, "monitor");
  11700. Address(section,0);
  11701. END BaseObject;
  11702. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11703. BEGIN
  11704. BasePointer(section);
  11705. Info(section, "action");
  11706. Address(section,0);
  11707. Info(section, "monitor");
  11708. Address(section,0);
  11709. END BaseRecord;
  11710. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11711. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11712. pooledName: Basic.SegmentedName;
  11713. symbol: SyntaxTree.Symbol;
  11714. BEGIN
  11715. Global.GetModuleName(module.module,name);
  11716. Strings.Append(name,".@Module.@Descriptor");
  11717. Basic.ToSegmentedName(name, pooledName);
  11718. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11719. Symbol(section,descriptorSection,0,0);
  11720. Info(descriptorSection, "descriptor");
  11721. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11722. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11723. Address(descriptorSection,0);
  11724. Global.GetModuleName(module.module,name);
  11725. Strings.Append(name,".@Trace");
  11726. Basic.ToSegmentedName(name, pooledName);
  11727. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11728. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11729. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11730. END ModuleDescriptor;
  11731. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11732. VAR name: ARRAY 128 OF CHAR;
  11733. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11734. symbol: SyntaxTree.Symbol;
  11735. BEGIN
  11736. ASSERT(implementationVisitor.backend.newObjectFile);
  11737. Global.GetModuleName(module.module,name);
  11738. Strings.Append(name,".@Module");
  11739. Basic.ToSegmentedName(name, pooledName);
  11740. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11741. moduleSection.SetExported(TRUE);
  11742. IF moduleSection.pc = 0 THEN
  11743. IF implementationVisitor.backend.cooperative THEN
  11744. Info(moduleSection, "descriptor");
  11745. ModuleDescriptor(moduleSection);
  11746. BaseObject(moduleSection);
  11747. implementationVisitor.CreateTraceModuleMethod(module.module);
  11748. ELSE
  11749. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11750. Info(moduleSection, "HeapBlock");
  11751. Symbol(moduleSection,moduleSection,2,0);
  11752. Info(moduleSection, "TypeDescriptor");
  11753. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11754. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11755. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11756. END;
  11757. END;
  11758. RETURN moduleSection;
  11759. END ModuleSection;
  11760. PROCEDURE NewModuleInfo();
  11761. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11762. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11763. sectionName: Basic.SectionName;
  11764. CONST MPO=-40000000H;
  11765. BEGIN
  11766. (*
  11767. TypeDesc* = POINTER TO RECORD
  11768. descSize: SIZE;
  11769. sentinel: LONGINT; (* = MPO-4 *)
  11770. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11771. flags*: SET;
  11772. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11773. name*: Name;
  11774. refsOffset: SIZE;
  11775. END;
  11776. *)
  11777. (*name is missing prefixes sometimes*)
  11778. Global.GetModuleSegmentedName(module.module,name);
  11779. Basic.AppendToSegmentedName(name,".@Info");
  11780. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11781. Info(source, "HeapBlock");
  11782. Address(source,0); (* an empty heap block prevents GC marking *)
  11783. Info(source, "TypeDescriptor");
  11784. Address(source,0);
  11785. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11786. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11787. Address(source,MPO-4);
  11788. Info(source, "type tag pointer");
  11789. Address( source,0);
  11790. Info(source, "type flags");
  11791. flags := {};
  11792. Set( source, flags);
  11793. Info(source, "pointer to module");
  11794. moduleSection := ModuleSection();
  11795. Symbol( source, moduleSection, moduleSection.pc,0);
  11796. Info(source, "type name");
  11797. i := 0;
  11798. sectionName := "@Self";
  11799. (*
  11800. Global.GetSymbolSegmentedName(td,name);
  11801. Basic.SegmentedNameToString(name, sectionName);
  11802. *)
  11803. Name(source,sectionName);
  11804. source.SetReferenced(FALSE);
  11805. patchInfoPC := source.pc;
  11806. Size(source, 0);
  11807. END NewModuleInfo;
  11808. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11809. VAR
  11810. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11811. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11812. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11813. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11814. referenceSectionOffset : LONGINT;
  11815. name: Basic.SegmentedName; offset: LONGINT;
  11816. flags: SET;
  11817. BEGIN
  11818. NewModuleInfo();
  11819. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11820. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11821. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11822. ImportsArray(importSection);
  11823. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11824. CommandArray(commandsSection);
  11825. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11826. ExceptionArray(exceptionSection);
  11827. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11828. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11829. TypeInfoSection(typeInfoSection);
  11830. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11831. References(referenceSection);
  11832. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11833. ProcedureDescriptorArray(procTableSection, numberProcs);
  11834. IF ProtectModulesPointers THEN
  11835. name := "Heaps.AnyPtr";
  11836. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11837. (* set base pointer *)
  11838. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11839. END;
  11840. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11841. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11842. moduleSection := ModuleSection();
  11843. Info(moduleSection, "nextRoot*: RootObject");
  11844. Address(moduleSection,0);
  11845. Info(moduleSection, "next*: Module");
  11846. Address(moduleSection,0);
  11847. Info(moduleSection, "name*: Name");
  11848. Name(moduleSection,moduleName);
  11849. Info(moduleSection, "init, published: BOOLEAN");
  11850. Boolean(moduleSection,FALSE);
  11851. Boolean(moduleSection,FALSE);
  11852. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11853. Boolean(moduleSection,FALSE);
  11854. Boolean(moduleSection,FALSE);
  11855. Info(moduleSection, "refcnt*: LONGINT");
  11856. Longint(moduleSection,0);
  11857. Info(moduleSection, "sb*: ADDRESS");
  11858. Address(moduleSection,0);
  11859. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11860. Address(moduleSection,0);
  11861. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11862. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11863. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11864. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11865. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11866. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11867. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11868. Symbol(moduleSection,importSection,importSectionOffset,0);
  11869. Info(moduleSection, "procTable*: ProcTable");
  11870. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11871. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11872. Address(moduleSection,0);
  11873. Address(moduleSection,0);
  11874. Address(moduleSection,0);
  11875. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11876. Info(moduleSection, "export*: ExportDesc");
  11877. ExportDesc(moduleSection);
  11878. Info(moduleSection, "term*: TerminationHandler");
  11879. Address(moduleSection,0);
  11880. Info(moduleSection, "exTable*: ExceptionTable");
  11881. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11882. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11883. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11884. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11885. Info(moduleSection, "crc*: LONGINT");
  11886. patchCRC:= moduleSection.pc;
  11887. Longint(moduleSection, 0); (*! must be implemented *)
  11888. Info(moduleSection, "body*: ADDRESS");
  11889. Symbol(moduleSection, bodyProc, 0,0);
  11890. Info(moduleSection, "module flags");
  11891. flags := {};
  11892. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11893. Set( moduleSection, flags);
  11894. IF implementationVisitor.backend.cooperative THEN
  11895. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11896. Info(moduleSection, "monitor.owner");
  11897. Address(moduleSection,0);
  11898. Info(moduleSection, "monitor.nestingLevel");
  11899. Address(moduleSection,0);
  11900. Info(moduleSection, "monitor.blockedQueue");
  11901. Address(moduleSection,0); Address(moduleSection,0);
  11902. Info(moduleSection, "monitor.waitingQueue");
  11903. Address(moduleSection,0); Address(moduleSection,0);
  11904. Info(moduleSection, "monitor.waitingSentinel");
  11905. Address(moduleSection,0);
  11906. END;
  11907. END Module;
  11908. PROCEDURE PatchCRC(crc: LONGINT);
  11909. BEGIN
  11910. PatchLongint(ModuleSection(), patchCRC, crc);
  11911. END PatchCRC;
  11912. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11913. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: SIZE;
  11914. BEGIN
  11915. ArrayBlock(source,pc,"",FALSE);
  11916. Info(source, "pointer offsets array data");
  11917. IF scope IS SyntaxTree.RecordScope THEN
  11918. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11919. ELSIF scope IS SyntaxTree.CellScope THEN
  11920. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11921. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11922. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11923. WHILE variable # NIL DO
  11924. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11925. symbol := module.allSections.FindBySymbol(variable);
  11926. ASSERT(symbol # NIL);
  11927. Pointers(0,symbol, source,variable.type,numberPointers);
  11928. END;
  11929. variable := variable.nextVariable;
  11930. END;
  11931. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  11932. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11933. WHILE parameter # NIL DO
  11934. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11935. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  11936. END;
  11937. parameter := parameter.nextParameter;
  11938. END;
  11939. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  11940. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  11941. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  11942. IF implementationVisitor.backend.preciseGC THEN
  11943. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  11944. END;
  11945. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  11946. END;
  11947. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  11948. WHILE(variable # NIL) DO
  11949. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11950. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  11951. END;
  11952. variable := variable.nextVariable
  11953. END;
  11954. END;
  11955. PatchArray(source,pc,numberPointers);
  11956. END PointerArray;
  11957. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11958. VAR
  11959. name: Basic.SegmentedName;
  11960. section: IntermediateCode.Section;
  11961. BEGIN
  11962. ASSERT(implementationVisitor.newObjectFile);
  11963. Global.GetSymbolSegmentedName(symbol,name);
  11964. Basic.AppendToSegmentedName(name,suffix);
  11965. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  11966. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11967. Info(section, "HeapBlock");
  11968. Address(section,0); (* empty such that GC does not go on traversing *)
  11969. Info(section, suffix);
  11970. Address(section,0);
  11971. pc := section.pc;
  11972. RETURN section;
  11973. END SymbolSection;
  11974. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11975. VAR recordType: SyntaxTree.RecordType;
  11976. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11977. section: Sections.Section; cellType: SyntaxTree.CellType;
  11978. tdInfoOffset: LONGINT;
  11979. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  11980. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11981. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11982. sectionName: Basic.SectionName;
  11983. CONST MPO=-40000000H;
  11984. BEGIN
  11985. (*
  11986. TypeDesc* = POINTER TO RECORD
  11987. descSize: SIZE;
  11988. sentinel: LONGINT; (* = MPO-4 *)
  11989. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11990. flags*: SET;
  11991. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11992. name*: Name;
  11993. refsOffset: SIZE;
  11994. END;
  11995. *)
  11996. (* source := module.sections.FindByName(...) *)
  11997. Global.GetSymbolSegmentedName(td,name);
  11998. Basic.AppendToSegmentedName(name,".@Info");
  11999. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12000. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12001. Address(source,0);
  12002. Info(source, "TypeDescriptor");
  12003. Address(source,0);
  12004. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12005. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12006. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12007. Info(source, "type tag pointer");
  12008. Symbol( source, tag, offset, 0);
  12009. Info(source, "type flags");
  12010. flags := {};
  12011. IF isProtected THEN INCL(flags,31) END;
  12012. Set( source, flags);
  12013. Info(source, "pointer to module");
  12014. moduleSection := ModuleSection();
  12015. Symbol( source, moduleSection, moduleSection.pc,0);
  12016. Info(source, "type name");
  12017. i := 0;
  12018. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12019. (*
  12020. Global.GetSymbolSegmentedName(td,name);
  12021. Basic.SegmentedNameToString(name, sectionName);
  12022. *)
  12023. Name(source,sectionName);
  12024. source.SetReferenced(FALSE);
  12025. Size(source, 0);
  12026. RETURN source;
  12027. END NewTypeDescriptorInfo;
  12028. PROCEDURE NewTypeDescriptor;
  12029. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12030. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12031. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12032. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12033. CONST MPO=-40000000H;
  12034. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12035. VAR i: LONGINT;
  12036. PROCEDURE Td(record: SyntaxTree.RecordType);
  12037. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12038. BEGIN
  12039. IF record # NIL THEN
  12040. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12041. baseTD := record.typeDeclaration;
  12042. Global.GetSymbolSegmentedName(baseTD,name);
  12043. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12044. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12045. ELSE
  12046. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12047. END;
  12048. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12049. Symbol(source, tir, 0, offset);
  12050. IF reverse THEN Td(record.GetBaseRecord()) END;
  12051. END;
  12052. END Td;
  12053. BEGIN
  12054. Info(source, "tag table");
  12055. baseRecord := recordType;
  12056. i := 0;
  12057. WHILE baseRecord # NIL DO
  12058. INC(i);
  12059. baseRecord := baseRecord.GetBaseRecord();
  12060. END;
  12061. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12062. IF ~reverse THEN Td(recordType) END;
  12063. WHILE i < size DO
  12064. Address(source,0);
  12065. INC(i);
  12066. END;
  12067. IF reverse THEN Td(recordType) END;
  12068. END TdTable;
  12069. PROCEDURE MethodTable(reverse: BOOLEAN);
  12070. VAR i,methods: LONGINT;
  12071. BEGIN
  12072. Info(source, "method table");
  12073. IF recordType # NIL THEN
  12074. methods := recordType.recordScope.numberMethods;
  12075. IF reverse THEN
  12076. FOR i := methods-1 TO 0 BY -1 DO
  12077. procedure := recordType.recordScope.FindMethod(i);
  12078. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12079. NamedSymbol(source, name,procedure, 0,0);
  12080. END;
  12081. ELSE
  12082. FOR i := 0 TO methods-1 DO
  12083. procedure := recordType.recordScope.FindMethod(i);
  12084. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12085. NamedSymbol(source, name,procedure, 0,0);
  12086. END;
  12087. END;
  12088. END;
  12089. END MethodTable;
  12090. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12091. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12092. BEGIN
  12093. Info(source, "method table");
  12094. baseRecord := recordType;
  12095. WHILE baseRecord.baseType # NIL DO
  12096. baseRecord := baseRecord.GetBaseRecord ();
  12097. END;
  12098. GetRecordTypeName (baseRecord, name);
  12099. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12100. IF name = stackFrame THEN
  12101. start := 0;
  12102. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12103. baseRecord := recordType;
  12104. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12105. baseRecord := baseRecord.GetBaseRecord ();
  12106. END;
  12107. IF baseRecord # NIL THEN
  12108. GetRecordTypeName (baseRecord, name);
  12109. IF pointer & ~baseRecord.isObject THEN
  12110. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12111. END;
  12112. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12113. ELSIF recordType.isObject THEN
  12114. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12115. ELSIF pointer THEN
  12116. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12117. ELSE
  12118. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12119. END;
  12120. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12121. Symbol(source, tir, 0, 0);
  12122. start := 0;
  12123. baseRecord := recordType;
  12124. WHILE (baseRecord # NIL) DO
  12125. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12126. baseRecord := baseRecord.GetBaseRecord ();
  12127. END;
  12128. ELSE
  12129. (* explicit trace method: *)
  12130. procedure := recordType.recordScope.FindMethod(0);
  12131. IF ~procedure.isFinalizer THEN
  12132. Global.GetSymbolSegmentedName(procedure, name);
  12133. NamedSymbol(source, name,procedure, 0,0);
  12134. END;
  12135. start := 1;
  12136. END;
  12137. IF (name # stackFrame) & recordType.isObject THEN
  12138. baseRecord := recordType;
  12139. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12140. baseRecord := baseRecord.GetBaseRecord ();
  12141. END;
  12142. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12143. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12144. ELSE
  12145. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12146. END;
  12147. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12148. Symbol(source, tir, 0, 0);
  12149. END;
  12150. methods := recordType.recordScope.numberMethods;
  12151. FOR i := start TO methods-1 DO
  12152. procedure := recordType.recordScope.FindMethod(i);
  12153. IF ~procedure.isFinalizer THEN
  12154. Global.GetSymbolSegmentedName(procedure, name);
  12155. NamedSymbol(source, name,procedure, 0,0);
  12156. END;
  12157. END;
  12158. END CooperativeMethodTable;
  12159. BEGIN
  12160. Global.GetSymbolSegmentedName(td,name);
  12161. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12162. source.SetExported(IsExported(td));
  12163. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12164. IF implementationVisitor.backend.cooperative THEN
  12165. base := NIL;
  12166. baseRecord := recordType.GetBaseRecord();
  12167. IF baseRecord # NIL THEN
  12168. baseTD := baseRecord.typeDeclaration;
  12169. END;
  12170. IF ~recordType.isObject THEN
  12171. Info(source, "parent");
  12172. IF baseRecord # NIL THEN
  12173. Global.GetSymbolSegmentedName(baseTD,name);
  12174. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12175. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12176. ELSE
  12177. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12178. END;
  12179. Symbol(source, tir, 0, 0);
  12180. ELSE
  12181. Address(source,0);
  12182. END;
  12183. Info(source, "record size");
  12184. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12185. source.SetReferenced(FALSE);
  12186. CooperativeMethodTable(FALSE);
  12187. base := source;
  12188. Global.GetSymbolSegmentedName(td,name);
  12189. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12190. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12191. source.SetExported(IsExported(td));
  12192. source.SetReferenced(FALSE);
  12193. END;
  12194. Info(source, "parent");
  12195. IF baseRecord # NIL THEN
  12196. Global.GetSymbolSegmentedName(baseTD,name);
  12197. sym := baseTD;
  12198. IF ~recordType.isObject THEN
  12199. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12200. sym := NIL;
  12201. END;
  12202. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12203. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12204. ELSE
  12205. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12206. END;
  12207. Symbol(source, tir, 0, 0);
  12208. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12209. Address(source,0);
  12210. ELSE
  12211. IF recordType.isObject THEN
  12212. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12213. ELSE
  12214. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12215. END;
  12216. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12217. Symbol(source, tir, 0, 0);
  12218. END;
  12219. Info(source, "base record descriptor");
  12220. Symbol(source, base, 0, 0);
  12221. CooperativeMethodTable(TRUE);
  12222. source.SetReferenced(FALSE);
  12223. IF recordType.hasPointers THEN
  12224. IF ~HasExplicitTraceMethod (recordType) THEN
  12225. implementationVisitor.CreateTraceMethod(recordType);
  12226. END;
  12227. implementationVisitor.CreateResetProcedure(recordType);
  12228. implementationVisitor.CreateAssignProcedure(recordType);
  12229. END;
  12230. ELSIF ~simple THEN
  12231. (*
  12232. MethodEnd = MPO
  12233. ---
  12234. methods (# methods)
  12235. ---
  12236. tags (16)
  12237. ---
  12238. TypeDesc = TypeInfoAdr
  12239. ---
  12240. td adr ---> rec size
  12241. ----
  12242. pointer offsets
  12243. ----
  12244. (padding)
  12245. -----
  12246. empty [2 addresses aligned]
  12247. empty
  12248. empty
  12249. numPtrs
  12250. ---
  12251. pointer offsets
  12252. ---
  12253. *)
  12254. Info(source, "MethodEnd = MPO");
  12255. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12256. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12257. MethodTable(TRUE);
  12258. TdTable(TypeTags, TRUE);
  12259. Info(source, "type descriptor info pointer");
  12260. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12261. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12262. IF (cellType # NIL) THEN
  12263. IF cellType.sizeInBits < 0 THEN
  12264. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12265. END;
  12266. Info(source, "cell size");
  12267. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12268. ELSE
  12269. Info(source, "record size");
  12270. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12271. END;
  12272. Info(source, "pointer offsets pointer");
  12273. padding := 1- source.pc MOD 2;
  12274. Symbol(source, source, source.pc+1+padding,0);
  12275. IF padding >0 THEN
  12276. Info(source, "padding");
  12277. FOR i := 1 TO padding DO Address(source,0) END;
  12278. END;
  12279. IF cellType # NIL THEN
  12280. PointerArray(source, cellType.cellScope, numberPointers);
  12281. ELSE
  12282. PointerArray(source, recordType.recordScope, numberPointers);
  12283. END;
  12284. ELSE
  12285. (*
  12286. simple:
  12287. td adr --> size
  12288. tag(1)
  12289. tag(2)
  12290. tag(3)
  12291. methods ->
  12292. *)
  12293. Info(source, "record size");
  12294. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12295. TdTable(TypeTags, FALSE);
  12296. MethodTable(FALSE);
  12297. source.SetReferenced(FALSE);
  12298. END;
  12299. END NewTypeDescriptor;
  12300. BEGIN
  12301. x := x.resolved;
  12302. IF (x IS SyntaxTree.PointerType) THEN
  12303. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12304. END;
  12305. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12306. recordType := x(SyntaxTree.RecordType);
  12307. td := x.typeDeclaration;
  12308. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12309. ASSERT(td # NIL);
  12310. section := module.allSections.FindBySymbol(td); (* TODO *)
  12311. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12312. IF implementationVisitor.newObjectFile THEN
  12313. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12314. NewTypeDescriptor
  12315. END;
  12316. ELSE
  12317. (* data section in intermediate code *)
  12318. Global.GetSymbolSegmentedName(td,name);
  12319. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12320. Basic.SuffixSegmentedName (name, module.module.name);
  12321. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12322. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12323. tir.Emit(Data(Basic.invalidPosition,op));
  12324. END;
  12325. END;
  12326. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12327. cellType := x(SyntaxTree.CellType);
  12328. td := x.typeDeclaration;
  12329. section := module.allSections.FindBySymbol(td); (* TODO *)
  12330. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12331. IF implementationVisitor.newObjectFile THEN
  12332. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12333. NewTypeDescriptor
  12334. END;
  12335. END;
  12336. END;
  12337. END
  12338. END CheckTypeDeclaration
  12339. END MetaDataGenerator;
  12340. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12341. VAR
  12342. trace-: BOOLEAN;
  12343. traceString-: SyntaxTree.IdentifierString;
  12344. traceModuleName-: SyntaxTree.IdentifierString;
  12345. newObjectFile-: BOOLEAN;
  12346. profile-: BOOLEAN;
  12347. noRuntimeChecks: BOOLEAN;
  12348. simpleMetaData-: BOOLEAN;
  12349. noAsserts: BOOLEAN;
  12350. optimize-: BOOLEAN;
  12351. cooperative-: BOOLEAN;
  12352. preregisterStatic-: BOOLEAN;
  12353. dump-: Basic.Writer;
  12354. cellsAreObjects: BOOLEAN;
  12355. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12356. experiment: BOOLEAN;
  12357. PROCEDURE &InitIntermediateBackend*;
  12358. BEGIN
  12359. simpleMetaData := FALSE;
  12360. newObjectFile := FALSE;
  12361. InitBackend;
  12362. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12363. SetTraceModuleName(DefaultTraceModuleName);
  12364. END InitIntermediateBackend;
  12365. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12366. VAR
  12367. declarationVisitor: DeclarationVisitor;
  12368. implementationVisitor: ImplementationVisitor;
  12369. module: Sections.Module;
  12370. name, platformName: SyntaxTree.IdentifierString;
  12371. meta: MetaDataGenerator;
  12372. crc: CRC.CRC32Stream;
  12373. BEGIN
  12374. ResetError;
  12375. Global.GetSymbolName(x,name);
  12376. NEW(module,x,system); (* backend structures *)
  12377. Global.GetModuleName(x, name);
  12378. module.SetModuleName(name);
  12379. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12380. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12381. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12382. declarationVisitor.Module(x,module);
  12383. IF newObjectFile & ~meta.simple THEN
  12384. meta.Module(implementationVisitor.moduleBodySection);
  12385. END;
  12386. GetDescription(platformName);
  12387. module.SetPlatformName(platformName);
  12388. IF newObjectFile THEN
  12389. NEW(crc);
  12390. module.allSections.WriteRaw(crc);
  12391. crc.Update;
  12392. meta.PatchCRC(crc.GetCRC());
  12393. END;
  12394. RETURN module
  12395. END GenerateIntermediate;
  12396. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12397. BEGIN RETURN TRUE
  12398. END SupportedImmediate;
  12399. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12400. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12401. END ProcessSyntaxTreeModule;
  12402. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12403. VAR
  12404. result: Sections.Module;
  12405. traceName: Basic.MessageString;
  12406. BEGIN
  12407. ASSERT(intermediateCodeModule IS Sections.Module);
  12408. result := intermediateCodeModule(Sections.Module);
  12409. IF trace THEN
  12410. traceName := "intermediate code trace: ";
  12411. Strings.Append(traceName,traceString);
  12412. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12413. IF (traceString="") OR (traceString="*") THEN
  12414. result.Dump(dump);
  12415. dump.Update
  12416. ELSE
  12417. Sections.DumpFiltered(dump, result, traceString);
  12418. END
  12419. END;
  12420. RETURN result
  12421. END ProcessIntermediateCodeModule;
  12422. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12423. BEGIN instructionSet := "Intermediate";
  12424. END GetDescription;
  12425. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12426. BEGIN
  12427. SELF.newObjectFile := newObjectFile;
  12428. SELF.simpleMetaData := simpleMetaData;
  12429. END SetNewObjectFile;
  12430. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12431. BEGIN COPY(name, traceModuleName)
  12432. END SetTraceModuleName;
  12433. PROCEDURE DefineOptions(options: Options.Options);
  12434. BEGIN
  12435. DefineOptions^(options);
  12436. options.Add(0X,"trace",Options.String);
  12437. options.Add(0X,"runtime",Options.String);
  12438. options.Add(0X,"newObjectFile",Options.Flag);
  12439. options.Add(0X,"traceModule",Options.String);
  12440. options.Add(0X,"profile",Options.Flag);
  12441. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12442. options.Add(0X,"noAsserts",Options.Flag);
  12443. options.Add(0X,"metaData",Options.String);
  12444. options.Add('o',"optimize", Options.Flag);
  12445. options.Add(0X,"preregisterStatic", Options.Flag);
  12446. options.Add(0X,"cellsAreObjects", Options.Flag);
  12447. options.Add(0X,"preciseGC", Options.Flag);
  12448. options.Add(0X,"trackLeave", Options.Flag);
  12449. options.Add(0X,"writeBarriers", Options.Flag);
  12450. options.Add(0X,"experiment", Options.Flag);
  12451. END DefineOptions;
  12452. PROCEDURE GetOptions(options: Options.Options);
  12453. VAR name,string: SyntaxTree.IdentifierString;
  12454. BEGIN
  12455. GetOptions^(options);
  12456. trace := options.GetString("trace",traceString);
  12457. profile := options.GetFlag("profile");
  12458. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12459. noAsserts := options.GetFlag("noAsserts");
  12460. cooperative := options.GetFlag("cooperative");
  12461. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12462. IF cooperative THEN
  12463. SetRuntimeModuleName("CPU") END
  12464. END;
  12465. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12466. simpleMetaData := TRUE
  12467. END;
  12468. IF options.GetString("metaData",string) THEN
  12469. IF string = "simple" THEN simpleMetaData := TRUE
  12470. ELSIF string ="full" THEN simpleMetaData := FALSE
  12471. END;
  12472. END;
  12473. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12474. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12475. optimize := options.GetFlag("optimize");
  12476. preregisterStatic := options.GetFlag("preregisterStatic");
  12477. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12478. preciseGC := options.GetFlag("preciseGC");
  12479. trackLeave := options.GetFlag("trackLeave");
  12480. writeBarriers := options.GetFlag("writeBarriers");
  12481. experiment := options.GetFlag("experiment");
  12482. END GetOptions;
  12483. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12484. BEGIN RETURN SymbolFileFormat.Get()
  12485. END DefaultSymbolFileFormat;
  12486. END IntermediateBackend;
  12487. (* ----------------------------------- register allocation ------------------------------------- *)
  12488. (* register mapping scheme
  12489. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12490. spill offset
  12491. part(n) --> ticket <--> physical register
  12492. spill offset
  12493. *)
  12494. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12495. emptyOperand: IntermediateCode.Operand;
  12496. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12497. statCoopResetVariables: LONGINT;
  12498. statCoopModifyAssignments: LONGINT;
  12499. modifyAssignmentsPC : LONGINT;
  12500. statCoopNilCheck: LONGINT;
  12501. statCoopSwitch: LONGINT;
  12502. statCoopAssignProcedure: LONGINT;
  12503. statCoopTraceMethod: LONGINT;
  12504. statCoopResetProcedure: LONGINT;
  12505. statCoopTraceModule: LONGINT;
  12506. PROCEDURE ResetStatistics*;
  12507. BEGIN
  12508. statCoopResetVariables := 0;
  12509. statCoopModifyAssignments := 0;
  12510. statCoopNilCheck:= 0;
  12511. statCoopSwitch:= 0;
  12512. statCoopAssignProcedure:= 0;
  12513. statCoopTraceMethod:= 0;
  12514. statCoopResetProcedure:= 0;
  12515. statCoopTraceModule:= 0;
  12516. END ResetStatistics;
  12517. PROCEDURE Statistics*;
  12518. BEGIN
  12519. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12520. TRACE(statCoopNilCheck, statCoopSwitch);
  12521. TRACE(statCoopAssignProcedure,
  12522. statCoopTraceMethod,
  12523. statCoopResetProcedure,
  12524. statCoopTraceModule)
  12525. END Statistics;
  12526. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12527. VAR h: LONGINT;
  12528. BEGIN
  12529. WHILE b # 0 DO
  12530. h := a MOD b;
  12531. a := b;
  12532. b := h;
  12533. END;
  12534. RETURN a
  12535. END GCD;
  12536. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12537. BEGIN
  12538. RETURN a*b DIV GCD(a,b)
  12539. END SCM;
  12540. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12541. BEGIN
  12542. (*TRACE(a,b);*)
  12543. IF a = 0 THEN RETURN b
  12544. ELSIF b = 0 THEN RETURN a
  12545. ELSE RETURN SCM(a,b)
  12546. END;
  12547. END CommonAlignment;
  12548. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12549. BEGIN
  12550. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12551. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12552. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12553. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12554. 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)
  12555. END
  12556. END PassBySingleReference;
  12557. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12558. BEGIN
  12559. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12560. END PassInRegister;
  12561. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12562. VAR new: RegisterEntry;
  12563. BEGIN
  12564. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12565. IF queue = NIL THEN
  12566. queue := new
  12567. ELSE
  12568. new.next := queue;
  12569. IF queue#NIL THEN queue.prev := new END;
  12570. queue := new
  12571. END;
  12572. END AddRegisterEntry;
  12573. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12574. VAR this: RegisterEntry;
  12575. BEGIN
  12576. this := queue;
  12577. WHILE (this # NIL) & (this.register # register) DO
  12578. this := this.next;
  12579. END;
  12580. IF this = NIL THEN
  12581. RETURN FALSE
  12582. END;
  12583. ASSERT(this # NIL);
  12584. IF this = queue THEN queue := queue.next END;
  12585. IF this.prev # NIL THEN this.prev.next := this.next END;
  12586. IF this.next # NIL THEN this.next.prev := this.prev END;
  12587. RETURN TRUE
  12588. END RemoveRegisterEntry;
  12589. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12590. BEGIN ASSERT(cond);
  12591. END Assert;
  12592. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12593. BEGIN
  12594. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12595. END ReusableRegister;
  12596. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12597. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12598. BEGIN
  12599. procedure := moduleScope.bodyProcedure;
  12600. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12601. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12602. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12603. procedure.SetScope(moduleScope);
  12604. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12605. procedure.SetAccess(SyntaxTree.Hidden);
  12606. moduleScope.SetBodyProcedure(procedure);
  12607. moduleScope.AddProcedure(procedure);
  12608. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12609. END;
  12610. END EnsureBodyProcedure;
  12611. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12612. VAR import: SyntaxTree.Import;
  12613. selfName: SyntaxTree.IdentifierString;
  12614. module: SyntaxTree.Module;
  12615. BEGIN
  12616. scope.ownerModule.GetName(selfName);
  12617. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12618. module := scope.ownerModule
  12619. ELSE
  12620. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12621. IF import = NIL THEN
  12622. RETURN NIL
  12623. ELSIF import.module = NIL THEN
  12624. RETURN NIL
  12625. ELSE module := import.module
  12626. END;
  12627. END;
  12628. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12629. END GetSymbol;
  12630. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12631. BEGIN
  12632. op.mode := mode;
  12633. IntermediateCode.InitOperand(op.op);
  12634. IntermediateCode.InitOperand(op.tag);
  12635. IntermediateCode.InitOperand(op.extra);
  12636. op.dimOffset := 0;
  12637. END InitOperand;
  12638. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12639. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12640. BEGIN RETURN IntermediateCode.GetType(system, type)
  12641. END GetType;
  12642. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12643. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12644. BEGIN
  12645. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12646. (*
  12647. UniqueId(name,module,name,adr);
  12648. *)
  12649. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12650. constant.SetValue(value);
  12651. constant.SetAccess(SyntaxTree.Hidden);
  12652. module.moduleScope.AddConstant(constant);
  12653. constant.SetScope(module.moduleScope);
  12654. RETURN constant
  12655. END BuildConstant;
  12656. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12657. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12658. BEGIN
  12659. variable := scope.firstVariable;
  12660. WHILE variable # NIL DO
  12661. IF variable.NeedsTrace() THEN
  12662. RETURN TRUE;
  12663. END;
  12664. variable := variable.nextVariable;
  12665. END;
  12666. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12667. WHILE parameter # NIL DO
  12668. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12669. RETURN TRUE;
  12670. END;
  12671. parameter := parameter.nextParameter;
  12672. END;
  12673. RETURN FALSE;
  12674. END HasPointers;
  12675. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12676. 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));
  12677. END IsVariableParameter;
  12678. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12679. VAR parameter: SyntaxTree.Parameter;
  12680. BEGIN
  12681. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12682. WHILE parameter # NIL DO
  12683. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12684. IF parameter.movable THEN RETURN TRUE END;
  12685. parameter := parameter.nextParameter;
  12686. END;
  12687. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12688. END HasVariableParameters;
  12689. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12690. BEGIN
  12691. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12692. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12693. END HasExplicitTraceMethod;
  12694. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12695. BEGIN
  12696. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12697. IF (expression IS SyntaxTree.IntegerValue) THEN
  12698. val := expression(SyntaxTree.IntegerValue).value;
  12699. RETURN TRUE
  12700. ELSE
  12701. RETURN FALSE
  12702. END;
  12703. END IsIntegerConstant;
  12704. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12705. BEGIN
  12706. IF val <= 0 THEN RETURN FALSE END;
  12707. exp := 0;
  12708. WHILE ~ODD(val) DO
  12709. val := val DIV 2;
  12710. INC(exp)
  12711. END;
  12712. RETURN val = 1
  12713. END PowerOf2;
  12714. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12715. VAR procedure: SyntaxTree.Procedure;
  12716. BEGIN
  12717. procedure := record.recordScope.constructor;
  12718. IF procedure = NIL THEN
  12719. record := record.GetBaseRecord();
  12720. IF record # NIL THEN
  12721. procedure := GetConstructor(record)
  12722. END;
  12723. END;
  12724. RETURN procedure;
  12725. END GetConstructor;
  12726. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12727. BEGIN
  12728. value := SHORT(op.intValue);
  12729. RETURN op.mode = IntermediateCode.ModeImmediate;
  12730. END IsIntegerImmediate;
  12731. (** whether a type strictily is a pointer to record or object type
  12732. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12733. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12734. BEGIN
  12735. IF type = NIL THEN
  12736. RETURN FALSE
  12737. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12738. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12739. ELSE
  12740. RETURN FALSE
  12741. END
  12742. END IsStrictlyPointerToRecord;
  12743. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12744. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12745. END IsUnsafePointer;
  12746. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12747. BEGIN type := type.resolved;
  12748. IF type IS SyntaxTree.PointerType THEN
  12749. type := type(SyntaxTree.PointerType).pointerBase;
  12750. type := type.resolved;
  12751. IF type IS SyntaxTree.RecordType THEN
  12752. recordType := type(SyntaxTree.RecordType);
  12753. RETURN TRUE
  12754. ELSE
  12755. RETURN FALSE
  12756. END
  12757. ELSIF type IS SyntaxTree.RecordType THEN
  12758. recordType := type(SyntaxTree.RecordType);
  12759. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12760. ELSIF type IS SyntaxTree.ObjectType THEN
  12761. RETURN TRUE
  12762. ELSIF type IS SyntaxTree.AnyType THEN
  12763. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12764. ELSE
  12765. RETURN FALSE
  12766. END;
  12767. END IsPointerToRecord;
  12768. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12769. BEGIN
  12770. type := type.resolved;
  12771. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12772. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12773. END IsArrayOfSystemByte;
  12774. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12775. BEGIN
  12776. IF type = NIL THEN RETURN FALSE END;
  12777. type := type.resolved;
  12778. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12779. END IsOpenArray;
  12780. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12781. BEGIN
  12782. IF type = NIL THEN RETURN FALSE END;
  12783. type := type.resolved;
  12784. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12785. END IsSemiDynamicArray;
  12786. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12787. BEGIN
  12788. IF type = NIL THEN RETURN FALSE END;
  12789. type := type.resolved;
  12790. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12791. END IsStaticArray;
  12792. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12793. VAR size: LONGINT;
  12794. BEGIN
  12795. size := 1;
  12796. WHILE (IsStaticArray(type)) DO
  12797. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12798. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12799. END;
  12800. RETURN size;
  12801. END StaticArrayNumElements;
  12802. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12803. BEGIN
  12804. WHILE (IsStaticArray(type)) DO
  12805. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12806. END;
  12807. RETURN type;
  12808. END StaticArrayBaseType;
  12809. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12810. BEGIN
  12811. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12812. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12813. END;
  12814. RETURN type;
  12815. END ArrayBaseType;
  12816. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12817. BEGIN
  12818. IF type = NIL THEN RETURN FALSE END;
  12819. type := type.resolved;
  12820. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12821. END IsDelegate;
  12822. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12823. VAR i: LONGINT;
  12824. BEGIN
  12825. i := 0; type := type.resolved;
  12826. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12827. INC(i);
  12828. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12829. END;
  12830. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12831. INC(i);
  12832. type := type(SyntaxTree.MathArrayType).arrayBase;
  12833. IF type # NIL THEN type := type.resolved END;
  12834. END;
  12835. RETURN i
  12836. END DynamicDim;
  12837. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12838. BEGIN
  12839. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12840. type := type(SyntaxTree.ArrayType).arrayBase;
  12841. END;
  12842. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12843. type := type(SyntaxTree.MathArrayType).arrayBase;
  12844. END;
  12845. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12846. END StaticSize;
  12847. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12848. BEGIN
  12849. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12850. END IsImmediate;
  12851. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12852. BEGIN
  12853. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12854. END IsAddress;
  12855. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12856. BEGIN
  12857. RETURN (x.mode = IntermediateCode.ModeRegister);
  12858. END IsRegister;
  12859. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12860. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12861. BEGIN
  12862. typeDeclaration := recordType.typeDeclaration;
  12863. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12864. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12865. END GetRecordTypeName;
  12866. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12867. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12868. BEGIN
  12869. parSize := 0;
  12870. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12871. parameter := procedureType.returnParameter;
  12872. INC(parSize,system.SizeOfParameter(parameter));
  12873. parSize := parSize + (-parSize) MOD system.addressSize;
  12874. END;
  12875. parameter :=procedureType.lastParameter;
  12876. WHILE (parameter # NIL) DO
  12877. INC(parSize,system.SizeOfParameter(parameter));
  12878. parSize := parSize + (-parSize) MOD system.addressSize;
  12879. parameter := parameter.prevParameter;
  12880. END;
  12881. IF procedureType.selfParameter # NIL THEN
  12882. parameter := procedureType.selfParameter;
  12883. INC(parSize,system.SizeOfParameter(parameter));
  12884. parSize := parSize + (-parSize) MOD system.addressSize;
  12885. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12886. END; (* method => self pointer *)
  12887. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12888. RETURN ToMemoryUnits(system,parSize)
  12889. END ParametersSize;
  12890. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12891. BEGIN
  12892. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12893. END IsNested;
  12894. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12895. BEGIN
  12896. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12897. scope := scope.outerScope;
  12898. END;
  12899. RETURN scope # NIL;
  12900. END InCellScope;
  12901. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12902. BEGIN
  12903. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12904. RETURN 0
  12905. ELSE
  12906. *)
  12907. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12908. (*END;*)
  12909. END ProcedureParametersSize;
  12910. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12911. VAR dataUnit: LONGINT;
  12912. BEGIN dataUnit := system.dataUnit;
  12913. ASSERT(size MOD system.dataUnit = 0);
  12914. RETURN size DIV system.dataUnit
  12915. END ToMemoryUnits;
  12916. PROCEDURE Get*(): Backend.Backend;
  12917. VAR backend: IntermediateBackend;
  12918. BEGIN NEW(backend); RETURN backend
  12919. END Get;
  12920. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  12921. VAR instruction: IntermediateCode.Instruction;
  12922. BEGIN
  12923. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12924. RETURN instruction
  12925. END Nop;
  12926. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12927. VAR instruction: IntermediateCode.Instruction;
  12928. BEGIN
  12929. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12930. RETURN instruction
  12931. END Mov;
  12932. (* like Mov but ensures that no new register will be allocated for dest *)
  12933. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12934. VAR instruction: IntermediateCode.Instruction;
  12935. BEGIN
  12936. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12937. RETURN instruction
  12938. END MovReplace;
  12939. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12940. VAR instruction: IntermediateCode.Instruction;
  12941. BEGIN
  12942. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12943. RETURN instruction
  12944. END Conv;
  12945. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12946. BEGIN
  12947. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12948. END SysvABI;
  12949. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12950. BEGIN
  12951. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12952. END SysvABIorWINAPI;
  12953. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12954. VAR instruction: IntermediateCode.Instruction;
  12955. BEGIN
  12956. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12957. RETURN instruction
  12958. END Call;
  12959. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  12960. VAR op1, op2, op3: IntermediateCode.Operand;
  12961. VAR instruction: IntermediateCode.Instruction;
  12962. BEGIN
  12963. IntermediateCode.InitNumber(op1,pcOffset);
  12964. IntermediateCode.InitNumber(op2,callingConvention);
  12965. IntermediateCode.InitNumber(op3,unwind);
  12966. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  12967. RETURN instruction
  12968. END Exit;
  12969. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12970. VAR instruction: IntermediateCode.Instruction;
  12971. BEGIN
  12972. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12973. RETURN instruction
  12974. END Return;
  12975. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12976. VAR instruction: IntermediateCode.Instruction;
  12977. BEGIN
  12978. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12979. RETURN instruction
  12980. END Result;
  12981. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  12982. VAR op1: IntermediateCode.Operand;
  12983. VAR instruction: IntermediateCode.Instruction;
  12984. BEGIN
  12985. IntermediateCode.InitNumber(op1,nr);
  12986. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12987. RETURN instruction
  12988. END Trap;
  12989. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12990. VAR instruction: IntermediateCode.Instruction;
  12991. BEGIN
  12992. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12993. RETURN instruction
  12994. END Br;
  12995. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12996. VAR instruction: IntermediateCode.Instruction;
  12997. BEGIN
  12998. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12999. RETURN instruction
  13000. END Breq;
  13001. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13002. VAR instruction: IntermediateCode.Instruction;
  13003. BEGIN
  13004. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13005. RETURN instruction
  13006. END Brne;
  13007. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13008. VAR instruction: IntermediateCode.Instruction;
  13009. BEGIN
  13010. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13011. RETURN instruction
  13012. END Brge;
  13013. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13014. VAR instruction: IntermediateCode.Instruction;
  13015. BEGIN
  13016. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13017. RETURN instruction
  13018. END Brlt;
  13019. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13020. VAR instruction: IntermediateCode.Instruction;
  13021. BEGIN
  13022. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13023. RETURN instruction
  13024. END Pop;
  13025. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13026. VAR instruction: IntermediateCode.Instruction;
  13027. BEGIN
  13028. ASSERT(op.mode # IntermediateCode.Undefined);
  13029. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13030. RETURN instruction
  13031. END Push;
  13032. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13033. VAR instruction: IntermediateCode.Instruction;
  13034. BEGIN
  13035. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13036. RETURN instruction
  13037. END Neg;
  13038. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13039. VAR instruction: IntermediateCode.Instruction;
  13040. BEGIN
  13041. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13042. RETURN instruction
  13043. END Not;
  13044. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13045. VAR instruction: IntermediateCode.Instruction;
  13046. BEGIN
  13047. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13048. RETURN instruction
  13049. END Abs;
  13050. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13051. VAR instruction: IntermediateCode.Instruction;
  13052. BEGIN
  13053. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13054. ASSERT(~IsImmediate(instruction.op1));
  13055. RETURN instruction
  13056. END Mul;
  13057. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13058. VAR instruction: IntermediateCode.Instruction;
  13059. BEGIN
  13060. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13061. RETURN instruction
  13062. END Div;
  13063. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13064. VAR instruction: IntermediateCode.Instruction;
  13065. BEGIN
  13066. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13067. RETURN instruction
  13068. END Mod;
  13069. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13070. VAR instruction: IntermediateCode.Instruction;
  13071. BEGIN
  13072. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13073. RETURN instruction
  13074. END Sub;
  13075. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13076. VAR instruction: IntermediateCode.Instruction;
  13077. BEGIN
  13078. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13079. RETURN instruction
  13080. END Add;
  13081. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13082. VAR instruction: IntermediateCode.Instruction;
  13083. BEGIN
  13084. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13085. RETURN instruction
  13086. END And;
  13087. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13088. VAR instruction: IntermediateCode.Instruction;
  13089. BEGIN
  13090. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13091. RETURN instruction
  13092. END Or;
  13093. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13094. VAR instruction: IntermediateCode.Instruction;
  13095. BEGIN
  13096. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13097. RETURN instruction
  13098. END Xor;
  13099. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13100. VAR instruction: IntermediateCode.Instruction;
  13101. BEGIN
  13102. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13103. RETURN instruction
  13104. END Shl;
  13105. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13106. VAR instruction: IntermediateCode.Instruction;
  13107. BEGIN
  13108. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13109. RETURN instruction
  13110. END Shr;
  13111. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13112. VAR instruction: IntermediateCode.Instruction;
  13113. BEGIN
  13114. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13115. RETURN instruction
  13116. END Rol;
  13117. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13118. VAR instruction: IntermediateCode.Instruction;
  13119. BEGIN
  13120. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13121. RETURN instruction
  13122. END Ror;
  13123. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13124. VAR instruction: IntermediateCode.Instruction;
  13125. BEGIN
  13126. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13127. RETURN instruction
  13128. END Cas;
  13129. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13130. VAR instruction: IntermediateCode.Instruction;
  13131. BEGIN
  13132. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13133. RETURN instruction
  13134. END Copy;
  13135. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13136. VAR instruction: IntermediateCode.Instruction;
  13137. BEGIN
  13138. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13139. RETURN instruction
  13140. END Fill;
  13141. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13142. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13143. BEGIN
  13144. string := IntermediateCode.String(s);
  13145. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13146. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13147. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13148. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13149. RETURN instruction
  13150. END Asm;
  13151. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13152. VAR instruction: IntermediateCode.Instruction;
  13153. BEGIN
  13154. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13155. RETURN instruction
  13156. END Data;
  13157. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13158. VAR instruction: IntermediateCode.Instruction;
  13159. BEGIN
  13160. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13161. IntermediateCode.SetSubType(instruction, subtype);
  13162. RETURN instruction
  13163. END SpecialInstruction;
  13164. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13165. VAR op1: IntermediateCode.Operand;
  13166. VAR instruction: IntermediateCode.Instruction;
  13167. BEGIN
  13168. (*! generate a warning if size exceeds a certain limit *)
  13169. (*
  13170. ASSERT(bytes < 1000000); (* sanity check *)
  13171. *)
  13172. ASSERT(0 <= units); (* sanity check *)
  13173. IntermediateCode.InitNumber(op1,units);
  13174. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13175. RETURN instruction
  13176. END Reserve;
  13177. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13178. VAR op1: IntermediateCode.Operand;
  13179. VAR instruction: IntermediateCode.Instruction;
  13180. BEGIN
  13181. IntermediateCode.InitNumber(op1,position.start);
  13182. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13183. RETURN instruction
  13184. END LabelInstruction;
  13185. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13186. VAR pc: LONGINT;
  13187. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13188. BEGIN
  13189. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13190. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13191. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13192. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13193. IF instr.op1.type.form = IntermediateCode.Float THEN
  13194. RETURN instr.op1.floatValue = op.floatValue
  13195. ELSE
  13196. RETURN instr.op1.intValue = op.intValue
  13197. END;
  13198. END ProvidesValue;
  13199. BEGIN
  13200. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13201. pc := 0;
  13202. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13203. INC(pc);
  13204. END;
  13205. IF pc = data.pc THEN
  13206. data.Emit(Data(Basic.invalidPosition,vop));
  13207. END;
  13208. RETURN pc
  13209. END EnterImmediate;
  13210. PROCEDURE Init;
  13211. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13212. BEGIN
  13213. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13214. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13215. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13216. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13217. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13218. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13219. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13220. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13221. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13222. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13223. IntermediateCode.InitOperand(emptyOperand);
  13224. FOR i := 0 TO NumberSystemCalls-1 DO
  13225. name := "@SystemCall";
  13226. Basic.AppendNumber(name,i);
  13227. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13228. END;
  13229. END Init;
  13230. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13231. BEGIN
  13232. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13233. END IsExported;
  13234. BEGIN
  13235. Init;
  13236. END FoxIntermediateBackend.
  13237. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13238. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13239. # 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 ~
  13240. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13241. # 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 ~
  13242. FSTools.CloseFiles A2Z.exe ~
  13243. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13244. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13245. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13246. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13247. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13248. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13249. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13250. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13251. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13252. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13253. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod