FoxIntermediateBackend.Mod 617 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852148531485414855148561485714858148591486014861148621486314864148651486614867148681486914870148711487214873148741487514876148771487814879148801488114882148831488414885148861488714888148891489014891148921489314894148951489614897148981489914900149011490214903149041490514906149071490814909149101491114912149131491414915149161491714918149191492014921149221492314924149251492614927149281492914930149311493214933149341493514936149371493814939149401494114942149431494414945149461494714948149491495014951149521495314954149551495614957149581495914960149611496214963149641496514966149671496814969149701497114972149731497414975149761497714978149791498014981149821498314984149851498614987149881498914990149911499214993149941499514996149971499814999150001500115002150031500415005150061500715008150091501015011150121501315014150151501615017150181501915020150211502215023150241502515026150271502815029150301503115032150331503415035150361503715038150391504015041150421504315044150451504615047150481504915050150511505215053150541505515056150571505815059150601506115062150631506415065150661506715068150691507015071150721507315074150751507615077150781507915080150811508215083150841508515086150871508815089150901509115092150931509415095150961509715098150991510015101151021510315104151051510615107151081510915110151111511215113151141511515116151171511815119151201512115122151231512415125151261512715128151291513015131151321513315134151351513615137151381513915140151411514215143151441514515146151471514815149151501515115152151531515415155151561515715158151591516015161151621516315164151651516615167151681516915170151711517215173151741517515176151771517815179151801518115182151831518415185151861518715188151891519015191151921519315194151951519615197151981519915200152011520215203152041520515206152071520815209152101521115212152131521415215152161521715218152191522015221152221522315224152251522615227152281522915230152311523215233152341523515236152371523815239152401524115242152431524415245152461524715248152491525015251152521525315254152551525615257152581525915260152611526215263152641526515266152671526815269152701527115272152731527415275152761527715278152791528015281152821528315284152851528615287152881528915290152911529215293152941529515296152971529815299153001530115302153031530415305153061530715308153091531015311153121531315314153151531615317153181531915320153211532215323153241532515326153271532815329153301533115332153331533415335153361533715338153391534015341153421534315344153451534615347153481534915350153511535215353153541535515356153571535815359153601536115362153631536415365153661536715368153691537015371153721537315374153751537615377153781537915380153811538215383153841538515386153871538815389153901539115392153931539415395153961539715398153991540015401154021540315404154051540615407154081540915410154111541215413154141541515416154171541815419154201542115422154231542415425154261542715428154291543015431154321543315434154351543615437154381543915440154411544215443154441544515446154471544815449154501545115452154531545415455154561545715458154591546015461154621546315464154651546615467154681546915470154711547215473154741547515476154771547815479154801548115482154831548415485154861548715488154891549015491154921549315494154951549615497154981549915500155011550215503155041550515506155071550815509155101551115512155131551415515155161551715518155191552015521155221552315524155251552615527155281552915530155311553215533155341553515536155371553815539155401554115542155431554415545155461554715548155491555015551155521555315554155551555615557155581555915560155611556215563155641556515566155671556815569155701557115572155731557415575155761557715578155791558015581155821558315584155851558615587155881558915590155911559215593155941559515596155971559815599156001560115602156031560415605156061560715608156091561015611156121561315614156151561615617156181561915620156211562215623156241562515626156271562815629156301563115632156331563415635156361563715638156391564015641156421564315644156451564615647156481564915650156511565215653156541565515656156571565815659156601566115662156631566415665156661566715668156691567015671156721567315674156751567615677156781567915680156811568215683156841568515686156871568815689156901569115692156931569415695156961569715698156991570015701157021570315704157051570615707157081570915710157111571215713157141571515716157171571815719157201572115722157231572415725157261572715728157291573015731157321573315734157351573615737157381573915740157411574215743157441574515746157471574815749157501575115752157531575415755157561575715758157591576015761157621576315764157651576615767157681576915770157711577215773157741577515776157771577815779157801578115782157831578415785157861578715788157891579015791157921579315794157951579615797157981579915800158011580215803158041580515806158071580815809158101581115812158131581415815158161581715818158191582015821158221582315824158251582615827158281582915830158311583215833158341583515836158371583815839
  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, 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. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. BasePointerTypeSize = 5;
  59. BaseArrayTypeSize = BasePointerTypeSize + 3;
  60. LengthOffset = BasePointerTypeSize + 0;
  61. DataOffset = BasePointerTypeSize + 1;
  62. DescriptorOffset = BasePointerTypeSize + 2;
  63. BaseRecordTypeSize = BasePointerTypeSize + 2;
  64. ActionOffset = BasePointerTypeSize + 0;
  65. MonitorOffset = BasePointerTypeSize + 1;
  66. BaseObjectTypeSize = BaseRecordTypeSize;
  67. ActionTypeSize = 3;
  68. MonitorTypeSize = 7;
  69. ProcessorOffset = BaseObjectTypeSize + 1;
  70. StackLimitOffset* = BaseObjectTypeSize + 3;
  71. QuantumOffset = BaseObjectTypeSize + 4;
  72. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  73. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  74. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  75. Size2Flag = 4; (* size = 2 *)
  76. Size3Flag = 5; (* size = 3 *)
  77. Size4Flag = 6; (* size = 4 *)
  78. Size5Flag = 7; (* size = 5 *)
  79. Size6Flag = 8; (* size = 6 *)
  80. Size7Flag = 9; (* size = 7 *)
  81. Size8Flag = 10; (* size = 8 *)
  82. ReflectionSupport = TRUE;
  83. (* 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:
  84. 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
  85. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  86. *)
  87. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  88. ProtectModulesPointers = FALSE;
  89. CreateProcedureDescInfo = TRUE;
  90. WarningDynamicLoading = FALSE;
  91. SysvABI = {SyntaxTree.CCallingConvention};
  92. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  93. TYPE
  94. Position=SyntaxTree.Position;
  95. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  96. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  97. WriteBackCall = POINTER TO RECORD
  98. call: SyntaxTree.ProcedureCallDesignator;
  99. next: WriteBackCall;
  100. END;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. availability: WORD; (* index *)
  108. END;
  109. Fixup= POINTER TO RECORD
  110. pc: LONGINT;
  111. nextFixup: Fixup;
  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
  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, Streams.Invalid, s);
  164. END Error;
  165. (** types **)
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. WITH x:
  169. SyntaxTree.QualifiedType DO QualifiedType(x)
  170. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  171. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  172. |SyntaxTree.RecordType DO RecordType(x)
  173. |SyntaxTree.CellType DO CellType(x)
  174. ELSE
  175. END;
  176. END Type;
  177. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  178. VAR type: SyntaxTree.Type;
  179. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  180. type := x.resolved;
  181. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  182. meta.CheckTypeDeclaration(type);
  183. END;
  184. END QualifiedType;
  185. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  186. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  187. BEGIN
  188. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  189. WHILE (this # NIL) & (this.identifier# id) DO
  190. this := this.nextModifier;
  191. END;
  192. RETURN this # NIL
  193. END HasFlag;
  194. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  195. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  196. BEGIN (* no code emission *)
  197. meta.CheckTypeDeclaration(x);
  198. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  199. IF x.pointerType.typeDeclaration # NIL THEN
  200. td := x.pointerType.typeDeclaration
  201. ELSE
  202. td := x.typeDeclaration
  203. END;
  204. Global.GetSymbolName(td,name);
  205. (* code section for object *)
  206. END;
  207. Scope(x.recordScope);
  208. END RecordType;
  209. PROCEDURE CellType(x: SyntaxTree.CellType);
  210. VAR capabilities: SET;
  211. BEGIN
  212. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  213. capabilities := {};
  214. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  215. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  216. backend.SetCapabilities(capabilities);
  217. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  218. Scope(x.cellScope);
  219. END;
  220. END CellType;
  221. (* symbols *)
  222. PROCEDURE Variable(x: SyntaxTree.Variable);
  223. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  224. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  225. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  226. BEGIN
  227. type := type.resolved;
  228. IF type IS SyntaxTree.RecordType THEN
  229. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  230. ELSIF (type IS SyntaxTree.ArrayType) THEN
  231. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  232. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  233. END;
  234. ELSIF type IS SyntaxTree.MathArrayType THEN
  235. WITH type: SyntaxTree.MathArrayType DO
  236. IF type.form = SyntaxTree.Open THEN
  237. RETURN TRUE
  238. ELSIF type.form = SyntaxTree.Static THEN
  239. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  240. END;
  241. END;
  242. END;
  243. RETURN FALSE
  244. END TypeNeedsInitialization;
  245. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  246. VAR variable: SyntaxTree.Variable;
  247. BEGIN
  248. variable := scope.firstVariable;
  249. WHILE variable # NIL DO
  250. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  251. IF variable.initializer # NIL THEN RETURN TRUE END;
  252. variable := variable.nextVariable;
  253. END;
  254. RETURN FALSE
  255. END ScopeNeedsInitialization;
  256. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  257. VAR size: LONGINT;
  258. BEGIN
  259. size := offset - lastUpdated;
  260. IF size > 0 THEN
  261. irv.Emit(Reserve(x.position,size));
  262. END;
  263. irv.Emit(Data(x.position, op));
  264. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  265. END SingleInitialize;
  266. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  267. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  268. BEGIN
  269. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  270. WITH type:
  271. SyntaxTree.RecordType DO
  272. baseType := type.baseType;
  273. IF baseType # NIL THEN
  274. baseType := baseType.resolved;
  275. IF baseType IS SyntaxTree.PointerType THEN
  276. baseType := baseType(SyntaxTree.PointerType).pointerBase
  277. END;
  278. Initialize(baseType,NIL, offset);
  279. END;
  280. variable := type.recordScope.firstVariable;
  281. WHILE variable # NIL DO
  282. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  283. variable := variable.nextVariable
  284. END;
  285. | SyntaxTree.ArrayType DO
  286. IF type.form = SyntaxTree.Static THEN
  287. baseType := type.arrayBase;
  288. IF TypeNeedsInitialization(baseType) THEN
  289. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  290. FOR i := 0 TO type.staticLength-1 DO
  291. Initialize(baseType,NIL,offset+i*size);
  292. END;
  293. END;
  294. END;
  295. | SyntaxTree.MathArrayType DO
  296. IF type.form = SyntaxTree.Open THEN
  297. dim := DynamicDim(type);
  298. baseType := SemanticChecker.ArrayBase(type,dim);
  299. imm := IntermediateCode.Immediate(addressType,dim);
  300. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  301. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  303. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  304. (* flags remain empty (=0) for open array *)
  305. ELSIF type.form = SyntaxTree.Static THEN
  306. baseType := type.arrayBase;
  307. IF TypeNeedsInitialization(baseType) THEN
  308. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  309. ASSERT(type.staticLength < 1024*1024*1024);
  310. FOR i := 0 TO type.staticLength-1 DO
  311. Initialize(baseType,NIL,offset+i*size);
  312. END;
  313. END;
  314. END;
  315. ELSE
  316. IF initializer # NIL THEN
  317. implementationVisitor.Evaluate(initializer, op);
  318. SingleInitialize(op.op, offset);
  319. END;
  320. END;
  321. END Initialize;
  322. BEGIN
  323. IF x.externalName # NIL THEN RETURN END;
  324. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  325. (* code section for variable *)
  326. Global.GetSymbolSegmentedName(x,name);
  327. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  328. irv.SetExported(IsExported(x));
  329. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  330. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  331. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  333. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  334. FOR i := 0 TO DynamicDim(x.type)-1 DO
  335. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  336. END;
  337. ELSE
  338. lastUpdated:= 0;
  339. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  340. Initialize(x.type, x.initializer, 0);
  341. END;
  342. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  343. IF size > 0 THEN
  344. irv.Emit(Reserve(x.position,size));
  345. END;
  346. IF ~x.fixed THEN
  347. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  348. ELSE
  349. align := x.alignment;
  350. END;
  351. irv.SetPositionOrAlignment(x.fixed, align);
  352. meta.CheckTypeDeclaration(x.type);
  353. END;
  354. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  355. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  356. END;
  357. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  358. END Variable;
  359. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  360. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  361. size: LONGINT; lastUpdated: LONGINT;
  362. BEGIN
  363. ASSERT(currentScope IS SyntaxTree.CellScope);
  364. Global.GetSymbolSegmentedName(x,name);
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  366. irv.SetExported(IsExported(x));
  367. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  368. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  371. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  372. FOR i := 0 TO DynamicDim(x.type)-1 DO
  373. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  374. END;
  375. ELSE
  376. lastUpdated:= 0;
  377. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  378. IF size > 0 THEN
  379. irv.Emit(Reserve(x.position,size));
  380. END;
  381. IF ~x.fixed THEN
  382. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  383. ELSE
  384. align := x.alignment;
  385. END;
  386. irv.SetPositionOrAlignment(x.fixed, align);
  387. meta.CheckTypeDeclaration(x.type);
  388. END;
  389. END Parameter;
  390. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  391. BEGIN
  392. Type(x.declaredType); (* => code in objects *)
  393. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  394. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  395. END;
  396. END TypeDeclaration;
  397. PROCEDURE Constant(x: SyntaxTree.Constant);
  398. BEGIN
  399. IF (SyntaxTree.Public * x.access # {}) THEN
  400. implementationVisitor.VisitConstant(x);
  401. END;
  402. END Constant;
  403. PROCEDURE Scope(x: SyntaxTree.Scope);
  404. VAR procedure: SyntaxTree.Procedure;
  405. constant: SyntaxTree.Constant;
  406. variable: SyntaxTree.Variable;
  407. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  408. cell: SyntaxTree.CellType;
  409. parameter: SyntaxTree.Parameter;
  410. property: SyntaxTree.Property;
  411. BEGIN
  412. prevScope := currentScope;
  413. currentScope := x;
  414. (* constants treated in implementation visitor *)
  415. WITH x: SyntaxTree.CellScope DO
  416. cell := x.ownerCell;
  417. parameter := cell.firstParameter;
  418. WHILE parameter # NIL DO
  419. Parameter(parameter);
  420. parameter := parameter.nextParameter;
  421. END;
  422. property := cell.firstProperty;
  423. WHILE property # NIL DO
  424. Variable(property);
  425. property := property.nextProperty;
  426. END;
  427. ELSE
  428. END;
  429. typeDeclaration := x.firstTypeDeclaration;
  430. WHILE typeDeclaration # NIL DO
  431. TypeDeclaration(typeDeclaration);
  432. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  433. END;
  434. variable := x.firstVariable;
  435. WHILE variable # NIL DO
  436. Variable(variable);
  437. variable := variable.nextVariable;
  438. END;
  439. procedure := x.firstProcedure;
  440. WHILE procedure # NIL DO
  441. Procedure(procedure);
  442. procedure := procedure.nextProcedure;
  443. END;
  444. constant := x.firstConstant;
  445. WHILE constant # NIL DO
  446. Constant(constant);
  447. constant := constant.nextConstant;
  448. END;
  449. currentScope := prevScope;
  450. END Scope;
  451. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  452. VAR parameter: SyntaxTree.Parameter;
  453. BEGIN
  454. parameter := first;
  455. WHILE parameter # NIL DO
  456. Parameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. END Parameters;
  460. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  461. VAR scope: SyntaxTree.ProcedureScope;
  462. prevScope: SyntaxTree.Scope;
  463. inline, finalizer: BOOLEAN;
  464. procedureType: SyntaxTree.ProcedureType;
  465. pc: LONGINT;
  466. memorySize: Basic.Integer; stackSize: LONGINT;
  467. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  468. null,size,src,dest,fp,res: IntermediateCode.Operand;
  469. callingConvention: LONGINT;
  470. cellType: SyntaxTree.CellType;
  471. register: WORD;
  472. registerClass: IntermediateCode.RegisterClass;
  473. type: IntermediateCode.Type;
  474. formalParameter: SyntaxTree.Parameter;
  475. recordType: SyntaxTree.RecordType;
  476. isModuleBody: BOOLEAN;
  477. parametersSize: LONGINT;
  478. position: LONGINT;
  479. variable: SyntaxTree.Variable;
  480. nonParameterRegisters: WORD;
  481. PROCEDURE Signature;
  482. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  483. BEGIN
  484. procedureType := x.type(SyntaxTree.ProcedureType);
  485. returnType := procedureType.returnType;
  486. IF returnType # NIL THEN
  487. meta.CheckTypeDeclaration(returnType)
  488. END;
  489. parameter := procedureType.firstParameter;
  490. WHILE parameter # NIL DO
  491. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  492. parameter := parameter.nextParameter;
  493. END;
  494. END Signature;
  495. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  496. VAR result: BOOLEAN;
  497. BEGIN
  498. result := FALSE;
  499. IF x = SyntaxTree.invalidExpression THEN
  500. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  501. result := TRUE;
  502. value := x.resolved(SyntaxTree.IntegerValue).value;
  503. ELSE
  504. Error(x.position,"expression is not an integer constant");
  505. END;
  506. RETURN result;
  507. END CheckIntegerValue;
  508. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  509. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  510. BEGIN
  511. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  512. WHILE (this # NIL) & (this.identifier # id) DO
  513. this := this.nextModifier;
  514. END;
  515. IF this # NIL THEN
  516. IF this.expression = NIL THEN
  517. Error(this.position,"expected expression value");
  518. ELSIF CheckIntegerValue(this.expression,value) THEN
  519. END;
  520. RETURN TRUE
  521. ELSE RETURN FALSE
  522. END;
  523. END HasValue;
  524. CONST DefaultDataMemorySize=512;
  525. BEGIN
  526. IF x.externalName # NIL THEN RETURN END;
  527. (*
  528. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  529. *)
  530. (* code section for this procedure *)
  531. position := x.position.start;
  532. scope := x.procedureScope;
  533. prevScope := currentScope;
  534. currentScope := scope;
  535. procedureType := x.type(SyntaxTree.ProcedureType);
  536. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  537. implementationVisitor.temporaries.Clear;
  538. implementationVisitor.usedRegisters := NIL;
  539. implementationVisitor.registerUsageCount.Init;
  540. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  541. IF (scope.body # NIL) & (x.isInline) THEN
  542. inline := TRUE;
  543. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  544. ir.SetExported(IsExported(x));
  545. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  546. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  547. IF backend.cellsAreObjects THEN
  548. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  549. ir.SetExported(IsExported(x));
  550. ELSE
  551. RETURN; (* cellnet cannot be compiled for final static hardware *)
  552. END;
  553. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  554. inline := FALSE;
  555. AddBodyCallStub(x);
  556. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  557. ir.SetExported(IsExported(x));
  558. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  559. inline := FALSE;
  560. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  561. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  562. AddBodyCallStub(x);
  563. AddStackAllocation(x,memorySize);
  564. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  565. ir.SetExported(IsExported(x));
  566. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  567. inline := FALSE;
  568. Parameters(procedureType.firstParameter);
  569. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  570. ir.SetExported(IsExported(x));
  571. ELSE
  572. inline := FALSE;
  573. IF x.isEntry OR x.isExit THEN
  574. IF x.isEntry THEN
  575. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  576. ELSE
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  578. END;
  579. ir.SetExported(TRUE);
  580. ELSE
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  583. END;
  584. END;
  585. callingConvention := procedureType.callingConvention;
  586. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  587. parametersSize := ProcedureParametersSize(backend.system,x);
  588. ELSE
  589. parametersSize := 0;
  590. END;
  591. IF scope.body # NIL THEN
  592. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  593. IF ~inline THEN
  594. IF scope.lastVariable = NIL THEN
  595. stackSize := 0
  596. ELSE
  597. stackSize := scope.lastVariable.offsetInBits;
  598. END;
  599. IF scope.minVariableOffset < stackSize THEN
  600. stackSize := scope.minVariableOffset;
  601. END;
  602. IF stackSize <0 THEN stackSize := -stackSize END;
  603. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  604. (*
  605. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  606. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  607. *)
  608. (*
  609. ir.Emit(Nop(position)); (* placeholder for fill *)
  610. *)
  611. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  612. backend.ResetParameterRegisters();
  613. (* assumption: registers are passed left to right and left parameters are in registers *)
  614. formalParameter := procedureType.firstParameter;
  615. WHILE (formalParameter # NIL) DO
  616. IF PassInRegister(formalParameter, callingConvention) THEN
  617. IF formalParameter.type.IsRecordType() THEN
  618. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  619. type := addressType;
  620. ELSE
  621. type := GetType(system, formalParameter.type);
  622. END;
  623. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  624. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  625. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  626. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  627. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  628. implementationVisitor.ReleaseIntermediateOperand(src);
  629. END;
  630. END;
  631. formalParameter := formalParameter.nextParameter;
  632. END;
  633. END;
  634. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  635. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  636. END;
  637. pc := ir.pc-1;
  638. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  639. backend.ResetParameterRegisters();
  640. nonParameterRegisters := 0;
  641. (* assumption: registers are passed left to right and left parameters are in registers *)
  642. formalParameter := procedureType.firstParameter;
  643. WHILE (formalParameter # NIL) DO
  644. IF PassInRegister(formalParameter, callingConvention) THEN
  645. IF formalParameter.type.IsRecordType() THEN
  646. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  647. type := addressType;
  648. ELSE
  649. type := GetType(system, formalParameter.type);
  650. END;
  651. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  652. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  653. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  654. implementationVisitor.currentScope := currentScope;
  655. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  656. formalParameter.SetOffset(variable.offsetInBits);
  657. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  658. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  659. implementationVisitor.ReleaseIntermediateOperand(src);
  660. ELSE
  661. INC(nonParameterRegisters);
  662. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  663. END;
  664. END;
  665. formalParameter := formalParameter.nextParameter;
  666. END;
  667. END;
  668. END;
  669. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  670. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  671. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  672. IF scope.lastVariable # NIL THEN
  673. stackSize := scope.lastVariable.offsetInBits;
  674. END;
  675. IF scope.minVariableOffset < stackSize THEN
  676. stackSize := scope.minVariableOffset;
  677. END;
  678. IF stackSize <0 THEN stackSize := -stackSize END;
  679. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  680. END;
  681. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  682. (*
  683. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  684. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  685. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  686. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  687. ir.EmitAt(pc,Push(size));
  688. implementationVisitor.StaticCallOperand(result,procedure);
  689. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  690. END;
  691. *)
  692. END;
  693. *)
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  712. parametersSize := ProcedureParametersSize(backend.system,x);
  713. ELSE
  714. parametersSize := 0;
  715. END;
  716. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  717. finalizer := FALSE;
  718. IF backend.cooperative & x.isFinalizer THEN
  719. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  720. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  721. GetRecordTypeName(recordType,name);
  722. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  723. END;
  724. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  725. IF backend.cooperative THEN
  726. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  727. IF implementationVisitor.profile & ~isModuleBody THEN
  728. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  729. END;
  730. ELSE
  731. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  732. END;
  733. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  734. IF finalizer THEN
  735. IF backend.hasLinkRegister THEN
  736. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  737. END;
  738. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  739. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  740. ir.Emit(Br(x.position,dest));
  741. ELSE
  742. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  743. END;
  744. ELSE
  745. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  746. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  747. END;
  748. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  749. IF backend.cooperative THEN
  750. IF HasPointers (scope) THEN
  751. IF ~SemanticChecker.ReturnedAsParameter(system,procedureType.returnType) THEN
  752. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  753. ir.Emit(Result(x.position, res));
  754. ir.Emit(Push(x.position, res));
  755. implementationVisitor.ResetVariables(scope);
  756. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  757. ir.Emit(Pop(x.position, res));
  758. ir.Emit(Return(x.position, res));
  759. ELSE
  760. implementationVisitor.ResetVariables(scope);
  761. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  762. END;
  763. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  764. IF ~SemanticChecker.ReturnedAsParameter(system,procedureType.returnType) THEN
  765. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  766. ir.Emit(Result(x.position, res));
  767. ir.Emit(Push(x.position, res));
  768. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  769. ir.Emit(Pop(x.position, res));
  770. ir.Emit(Return(x.position, res));
  771. ELSE
  772. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  773. END;
  774. END;
  775. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  776. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  777. ELSE
  778. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  779. ir.Emit(Nop(x.position));
  780. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  781. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  782. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  783. END;
  784. END;
  785. END
  786. ELSIF ~inline THEN
  787. ir.Emit(Nop(x.position)); (* jump label *)
  788. END;
  789. ELSE (* force body for procedures *)
  790. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  791. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  792. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  793. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  794. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  795. END;
  796. Scope(scope);
  797. Signature;
  798. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  799. currentScope := prevScope;
  800. END Procedure;
  801. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  802. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  803. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  804. BEGIN
  805. ASSERT (bodyProcedure # NIL);
  806. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  807. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  808. procedure.SetScope(bodyProcedure.scope);
  809. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  810. procedure.SetAccess(SyntaxTree.Hidden);
  811. Global.GetSymbolSegmentedName (procedure,name);
  812. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  813. ir.SetExported(TRUE);
  814. Global.GetSymbolSegmentedName (bodyProcedure,name);
  815. IF ~meta.simple THEN
  816. implementationVisitor.currentScope := module.module.moduleScope;
  817. implementationVisitor.section := ir;
  818. implementationVisitor.PushSelfPointer();
  819. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  820. ELSIF backend.preregisterStatic THEN
  821. implementationVisitor.currentScope := module.module.moduleScope;
  822. implementationVisitor.section := ir;
  823. implementationVisitor.PushSelfPointer();
  824. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  825. ELSE
  826. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  827. ir.Emit(Call(bodyProcedure.position,op, 0));
  828. END;
  829. END AddBodyCallStub;
  830. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  831. VAR name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. Global.GetSymbolSegmentedName (symbol,name);
  835. Basic.RemoveSuffix(name);
  836. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  837. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  838. ir.SetExported(TRUE);
  839. IntermediateCode.InitImmediate(op,addressType,initStack);
  840. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  841. END AddStackAllocation;
  842. (** entry function to visit a complete module *)
  843. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  844. VAR
  845. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  846. hasDynamicOperatorDeclarations: BOOLEAN;
  847. operator: SyntaxTree.Operator;
  848. import: SyntaxTree.Import;
  849. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  850. BEGIN
  851. type := type.resolved;
  852. IF type IS SyntaxTree.RecordType THEN
  853. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  854. ELSIF (type IS SyntaxTree.ArrayType) THEN
  855. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  856. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  857. END;
  858. ELSIF type IS SyntaxTree.MathArrayType THEN
  859. WITH type: SyntaxTree.MathArrayType DO
  860. IF type.form = SyntaxTree.Open THEN
  861. RETURN TRUE
  862. ELSIF type.form = SyntaxTree.Static THEN
  863. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  864. END;
  865. END;
  866. END;
  867. RETURN FALSE
  868. END TypeNeedsInitialization;
  869. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  870. VAR variable: SyntaxTree.Variable;
  871. BEGIN
  872. variable := scope.firstVariable;
  873. WHILE variable # NIL DO
  874. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  875. IF variable.initializer # NIL THEN RETURN TRUE END;
  876. variable := variable.nextVariable;
  877. END;
  878. RETURN FALSE
  879. END ScopeNeedsInitialization;
  880. BEGIN
  881. ASSERT(x # NIL); ASSERT(module # NIL);
  882. SELF.module := module;
  883. (* add import names to the generated Sections.Module *)
  884. import := x.moduleScope.firstImport;
  885. WHILE import # NIL DO
  886. import.module.GetName(idstr);
  887. module.imports.AddName(idstr);
  888. import := import.nextImport
  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 ~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);
  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);
  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. nameIndex: LONGINT;
  1010. PROCEDURE & Init;
  1011. VAR i: LONGINT;
  1012. BEGIN
  1013. InitList(16);
  1014. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1015. registerIndex := 1024;
  1016. nameIndex := 0;
  1017. END Init;
  1018. PROCEDURE Clear*;
  1019. VAR i: LONGINT;
  1020. BEGIN
  1021. Clear^;
  1022. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1023. registerIndex := 1024;
  1024. nameIndex := 0;
  1025. END Clear;
  1026. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1027. VAR string: SyntaxTree.IdentifierString ;
  1028. BEGIN
  1029. COPY("@hiddenIRVar",string);
  1030. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1031. RETURN SyntaxTree.NewIdentifier(string);
  1032. END GetUID;
  1033. PROCEDURE GetUsage(VAR use: VariableUse);
  1034. BEGIN
  1035. use := inUse;
  1036. END GetUsage;
  1037. PROCEDURE SetUsage(CONST use: VariableUse);
  1038. BEGIN
  1039. inUse := use;
  1040. END SetUsage;
  1041. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1042. VAR any: ANY;
  1043. BEGIN
  1044. any := Get(i);
  1045. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1046. END GetVariable;
  1047. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1048. BEGIN
  1049. Set(pos, v);
  1050. END SetVariable;
  1051. PROCEDURE Occupy(pos: LONGINT);
  1052. BEGIN
  1053. INCL(inUse[pos DIV 32], pos MOD 32);
  1054. END Occupy;
  1055. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1056. BEGIN
  1057. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1058. END Occupied;
  1059. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1060. BEGIN
  1061. Occupy(Length());
  1062. Add(v);
  1063. END AddVariable;
  1064. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1065. BEGIN
  1066. t1 := t1.resolved;
  1067. t2 := t2.resolved;
  1068. (*RETURN t1.SameType(t2); *)
  1069. RETURN
  1070. (t1.SameType(t2))
  1071. OR
  1072. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1073. OR
  1074. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1075. OR
  1076. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1077. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1078. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1079. OR
  1080. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1081. (DynamicDim(t1) = DynamicDim(t2))
  1082. );
  1083. END CompatibleType;
  1084. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1085. VAR var : SyntaxTree.Variable; i: LONGINT;
  1086. BEGIN
  1087. pos := Length();
  1088. FOR i := 0 TO pos-1 DO
  1089. IF ~(Occupied(i)) THEN
  1090. var := GetVariable(i);
  1091. IF (~var.preferRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1092. pos := i;
  1093. Occupy(i);
  1094. RETURN var;
  1095. END;
  1096. END;
  1097. END;
  1098. RETURN NIL
  1099. END GetFreeVariable;
  1100. END Variables;
  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. result: Operand; (* result of the most recent expression / statement *)
  1118. destination: IntermediateCode.Operand;
  1119. arrayDestinationTag: IntermediateCode.Operand;
  1120. arrayDestinationDimension:LONGINT;
  1121. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1122. exitLabel: Label;
  1123. locked: BOOLEAN;
  1124. (*
  1125. usedRegisters: Registers;
  1126. *)
  1127. registerUsageCount: RegisterUsageCount;
  1128. usedRegisters: RegisterEntry;
  1129. (* useful operands and types *)
  1130. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1131. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1132. commentPrintout: Printout.Printer;
  1133. dump: Streams.Writer;
  1134. tagsAvailable : BOOLEAN;
  1135. supportedInstruction: SupportedInstructionProcedure;
  1136. supportedImmediate: SupportedImmediateProcedure;
  1137. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1138. emitLabels: BOOLEAN;
  1139. builtinsModuleName : SyntaxTree.IdentifierString;
  1140. indexCounter: LONGINT;
  1141. profile: BOOLEAN;
  1142. profileId, profileInit: IntermediateCode.Section;
  1143. profileInitPatchPosition: LONGINT;
  1144. numberProcedures: LONGINT;
  1145. procedureResultDesignator : SyntaxTree.Designator;
  1146. operatorInitializationCodeSection: IntermediateCode.Section;
  1147. fingerprinter: Fingerprinter.Fingerprinter;
  1148. temporaries: Variables;
  1149. canBeLoaded : BOOLEAN;
  1150. currentIsInline: BOOLEAN;
  1151. currentInlineExit: Label;
  1152. moduleBodySection: IntermediateCode.Section;
  1153. NeedDescriptor : BOOLEAN;
  1154. cooperativeSwitches: BOOLEAN;
  1155. lastSwitchPC: LONGINT;
  1156. isUnchecked: BOOLEAN;
  1157. (* EXPERIMENTAL *)
  1158. availableSymbols: ARRAY 1024 OF
  1159. RECORD
  1160. symbol: SyntaxTree.Symbol;
  1161. inMemory, inRegister: BOOLEAN;
  1162. register: IntermediateCode.Operand;
  1163. memory: IntermediateCode.Operand;
  1164. END;
  1165. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1166. BEGIN
  1167. SELF.system := system;
  1168. SELF.builtinsModuleName := runtime;
  1169. currentScope := NIL;
  1170. hiddenPointerType := NIL;
  1171. delegatePointerType := NIL;
  1172. awaitProcCounter := 0;
  1173. labelId := 0; constId := 0; labelId := 0;
  1174. SELF.checker := checker;
  1175. SELF.backend := backend;
  1176. position := Basic.invalidPosition;
  1177. locked := FALSE;
  1178. InitOperand(result,ModeUndefined);
  1179. addressType := IntermediateCode.GetType(system,system.addressType);
  1180. setType := IntermediateCode.GetType(system,system.setType);
  1181. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1182. lenType := IntermediateCode.GetType(system, system.lenType);
  1183. byteType := IntermediateCode.GetType(system, system.byteType);
  1184. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1185. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1186. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1187. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1188. nil := IntermediateCode.Immediate(addressType,0);
  1189. one := IntermediateCode.Immediate(addressType,1);
  1190. IntermediateCode.InitOperand(destination);
  1191. tagsAvailable := TRUE;
  1192. supportedInstruction := supportedInstructionProcedure;
  1193. supportedImmediate := supportedImmediateProcedure;
  1194. inData := FALSE;
  1195. SELF.emitLabels := emitLabels;
  1196. IntermediateCode.InitOperand(arrayDestinationTag);
  1197. bool := IntermediateCode.GetType(system,system.booleanType);
  1198. IntermediateCode.InitImmediate(false,bool,0);
  1199. IntermediateCode.InitImmediate(true,bool,1);
  1200. indexCounter := 0;
  1201. NEW(registerUsageCount);
  1202. usedRegisters := NIL;
  1203. procedureResultDesignator := NIL;
  1204. NEW(fingerprinter);
  1205. NEW(temporaries);
  1206. currentIsInline := FALSE;
  1207. NeedDescriptor := FALSE;
  1208. isUnchecked := backend.noRuntimeChecks;
  1209. END Init;
  1210. TYPE Context = RECORD
  1211. section: IntermediateCode.Section;
  1212. registerUsageCount: RegisterUsageCount;
  1213. usedRegisters: RegisterEntry;
  1214. temporaries: Variables;
  1215. END;
  1216. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1217. VAR context: Context;
  1218. BEGIN
  1219. context.section := section;
  1220. context.registerUsageCount := registerUsageCount;
  1221. context.usedRegisters := usedRegisters;
  1222. context.temporaries := temporaries;
  1223. section := new;
  1224. NEW(registerUsageCount);
  1225. NEW(temporaries);
  1226. usedRegisters := NIL;
  1227. RETURN context;
  1228. END SwitchContext;
  1229. PROCEDURE ReturnToContext(context: Context);
  1230. BEGIN
  1231. section := context.section;
  1232. registerUsageCount := context.registerUsageCount;
  1233. usedRegisters := context.usedRegisters;
  1234. temporaries := context.temporaries;
  1235. END ReturnToContext;
  1236. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1237. VAR fp: SyntaxTree.Fingerprint; section: IntermediateCode.Section;
  1238. BEGIN
  1239. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1240. fp := fingerprinter.SymbolFP(syntaxTreeSymbol)
  1241. END;
  1242. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1243. section.SetExported(IsExported(syntaxTreeSymbol));
  1244. RETURN section
  1245. END NewSection;
  1246. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1247. VAR new: LONGINT;
  1248. BEGIN
  1249. new := registerUsageCount.Next(type,class);
  1250. UseRegister(new);
  1251. RETURN new
  1252. END AcquireRegister;
  1253. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1254. VAR
  1255. fingerprint: SyntaxTree.Fingerprint;
  1256. fingerprintString: ARRAY SIZE OF Basic.Fingerprint * 2 + 1 OF CHAR;
  1257. BEGIN
  1258. fingerprint := fingerprinter.SymbolFP(symbol);
  1259. string := "[";
  1260. Strings.IntToHexStr(fingerprint.public, SIZE OF Basic.Fingerprint * 2, fingerprintString);
  1261. Strings.Append(string, fingerprintString);
  1262. Strings.Append(string, "]");
  1263. END GetFingerprintString;
  1264. (** get the name for the code section that represens a certain symbol
  1265. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1266. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1267. VAR string: ARRAY 32 OF CHAR;
  1268. BEGIN
  1269. Global.GetSymbolSegmentedName(symbol, name);
  1270. (* if the symbol is an operator, then append the fingerprint to the name *)
  1271. IF symbol IS SyntaxTree.Operator THEN
  1272. GetFingerprintString(symbol, string);
  1273. Basic.AppendToSegmentedName(name,string);
  1274. END
  1275. END GetCodeSectionNameForSymbol;
  1276. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1277. BEGIN
  1278. IF dump # NIL THEN
  1279. dump.String("enter "); dump.String(s); dump.Ln;
  1280. END;
  1281. END TraceEnter;
  1282. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1283. BEGIN
  1284. IF dump # NIL THEN
  1285. dump.String("exit "); dump.String(s); dump.Ln;
  1286. END;
  1287. END TraceExit;
  1288. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1289. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1290. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1291. VAR i: LONGINT;
  1292. BEGIN
  1293. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1294. IF op.rule # NIL THEN
  1295. FOR i := 0 TO LEN(op.rule)-1 DO
  1296. CheckRegister(op.rule[i])
  1297. END;
  1298. END;
  1299. END CheckRegister;
  1300. BEGIN
  1301. CheckRegister(instruction.op1);
  1302. CheckRegister(instruction.op2);
  1303. CheckRegister(instruction.op3);
  1304. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1305. ELSE section.Emit(instruction);
  1306. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1307. END;
  1308. END Emit;
  1309. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1310. VAR saved: RegisterEntry;
  1311. BEGIN
  1312. IF backend.cooperative THEN
  1313. ReleaseUsedRegisters(saved);
  1314. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1315. CallThis(position,"Runtime","Trap",1);
  1316. RestoreRegisterUse(saved);
  1317. ELSE
  1318. Emit(Trap(position,trapNo));
  1319. END;
  1320. END EmitTrap;
  1321. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1322. VAR name: Basic.SegmentedName;
  1323. VAR op1, op2, reg: IntermediateCode.Operand;
  1324. VAR call, nocall: Label;
  1325. VAR parametersSize: LONGINT;
  1326. VAR prevSection: IntermediateCode.Section;
  1327. VAR prevDump: Streams.Writer;
  1328. VAR body: SyntaxTree.Body;
  1329. VAR procedureType: SyntaxTree.ProcedureType;
  1330. VAR nm: ARRAY 256 OF CHAR;
  1331. BEGIN
  1332. procedure.GetName(nm);
  1333. IF procedure # NIL THEN
  1334. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1335. ELSE procedureType := NIL;
  1336. END;
  1337. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1338. prevSection := SELF.section;
  1339. SELF.section := section;
  1340. prevDump := dump;
  1341. dump := section.comments;
  1342. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1343. IF backend.hasLinkRegister THEN
  1344. Emit(Push(Basic.invalidPosition, lr));
  1345. END;
  1346. Emit(Push(Basic.invalidPosition,fp));
  1347. IF procedure # NIL THEN
  1348. body := procedure.procedureScope.body;
  1349. ELSE
  1350. body := NIL;
  1351. END;
  1352. IF backend.cooperative THEN
  1353. IF callconv IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention} THEN
  1354. Emit(Push(Basic.invalidPosition, one)) ;
  1355. ELSE
  1356. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1357. GetCodeSectionNameForSymbol(procedure, name);
  1358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1359. ELSE
  1360. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1361. END;
  1362. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1363. IntermediateCode.AddOffset(op1, 1);
  1364. Emit(Push(Basic.invalidPosition,op1));
  1365. END;
  1366. Emit(Mov(Basic.invalidPosition,fp, sp));
  1367. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1368. NEW(call, section);
  1369. NEW(nocall, section);
  1370. reg := NewRegisterOperand(addressType);
  1371. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1372. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1373. BrltL(call, sp, reg);
  1374. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1375. BrgeL(nocall, sp, op2);
  1376. call.Resolve(section.pc);
  1377. Emit(Push(Basic.invalidPosition, reg));
  1378. ReleaseIntermediateOperand(reg);
  1379. parametersSize := ProcParametersSize(procedure);
  1380. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1381. Emit(Push(Basic.invalidPosition, op2));
  1382. CallThis(position, "Activities","ExpandStack",2);
  1383. Emit(Result(Basic.invalidPosition, sp));
  1384. nocall.Resolve(section.pc);
  1385. END;
  1386. ELSE
  1387. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1388. Emit(Push(Basic.invalidPosition, one)) ;
  1389. procedureType.SetParametersOffset(1);
  1390. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1391. END;
  1392. Emit(Mov(Basic.invalidPosition, fp, sp));
  1393. END;
  1394. END;
  1395. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1396. SELF.section := prevSection;
  1397. dump := prevDump;
  1398. END EmitEnter;
  1399. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1400. VAR op1,op2: IntermediateCode.Operand;
  1401. VAR instruction: IntermediateCode.Instruction;
  1402. BEGIN
  1403. IntermediateCode.InitNumber(op1,callconv);
  1404. IntermediateCode.InitNumber(op2,varSize);
  1405. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1406. RETURN instruction
  1407. END Enter;
  1408. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1409. VAR op1: IntermediateCode.Operand;
  1410. VAR instruction: IntermediateCode.Instruction;
  1411. BEGIN
  1412. IntermediateCode.InitNumber(op1,callconv);
  1413. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1414. RETURN instruction
  1415. END Leave;
  1416. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1417. VAR prevSection: IntermediateCode.Section;
  1418. VAR op2: IntermediateCode.Operand;
  1419. VAR body: SyntaxTree.Body;
  1420. BEGIN
  1421. prevSection := SELF.section;
  1422. SELF.section := section;
  1423. Emit(Leave(position, callconv));
  1424. IF procedure # NIL THEN
  1425. body := procedure.procedureScope.body;
  1426. ELSE
  1427. body := NIL;
  1428. END;
  1429. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1430. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1431. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1432. Emit(Add(position, sp, fp, op2));
  1433. ELSE
  1434. Emit(Mov(position, sp, fp));
  1435. END;
  1436. Emit(Pop(position, fp));
  1437. END;
  1438. SELF.section := prevSection;
  1439. END EmitLeave;
  1440. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1441. BEGIN
  1442. position := x.position;
  1443. VSymbol(x);
  1444. op := result;
  1445. END Symbol;
  1446. PROCEDURE Expression(x: SyntaxTree.Expression);
  1447. VAR pos: LONGINT;
  1448. BEGIN
  1449. position := x.position;
  1450. pos := position.start;
  1451. IF x.resolved # NIL THEN
  1452. VExpression(x.resolved);
  1453. ELSE
  1454. VExpression(x);
  1455. END;
  1456. (* check this, was commented out in ActiveCells3 *)
  1457. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1458. Error(x.position, "unsupported modifier");
  1459. END;
  1460. END Expression;
  1461. (*
  1462. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1463. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1464. BEGIN
  1465. temporaries.GetUsage(current);
  1466. FOR i := 0 TO LEN(current)-1 DO
  1467. set := current[i] - previous[i];
  1468. IF set # {} THEN
  1469. FOR j := 0 TO MAX(SET)-1 DO
  1470. IF j IN set THEN
  1471. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1472. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1473. Symbol(variable, op);
  1474. MakeMemory(tmp,op.op,addressType,0);
  1475. ReleaseOperand(op);
  1476. Emit(Mov(position,tmp, nil ) );
  1477. ReleaseIntermediateOperand(tmp);
  1478. END;
  1479. END;
  1480. END;
  1481. END;
  1482. END;
  1483. END ResetUsedTemporaries;
  1484. *)
  1485. PROCEDURE Statement(x: SyntaxTree.Statement);
  1486. VAR use: VariableUse;
  1487. BEGIN
  1488. temporaries.GetUsage(use);
  1489. position := x.position;
  1490. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1491. IF commentPrintout # NIL THEN
  1492. commentPrintout.Statement(x);
  1493. dump.Ln;
  1494. (*dump.Update;*)
  1495. END;
  1496. VStatement(x);
  1497. (*
  1498. CheckRegistersFree();
  1499. *)
  1500. (*ResetUsedTemporaries(use);*)
  1501. temporaries.SetUsage(use);
  1502. END Statement;
  1503. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1504. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1505. *)
  1506. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1507. BEGIN
  1508. ASSERT(op.mode # IntermediateCode.Undefined);
  1509. IF op.mode = IntermediateCode.ModeMemory THEN
  1510. ReuseCopy(res,op);
  1511. ELSE
  1512. res := op;
  1513. UseIntermediateOperand(res);
  1514. END;
  1515. IntermediateCode.AddOffset(res,offset);
  1516. IntermediateCode.MakeMemory(res,type);
  1517. END MakeMemory;
  1518. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1519. VAR mem: IntermediateCode.Operand;
  1520. BEGIN
  1521. MakeMemory(mem,res,type,offset);
  1522. ReleaseIntermediateOperand(res);
  1523. res := mem;
  1524. END ToMemory;
  1525. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1526. VAR mem: IntermediateCode.Operand;
  1527. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1528. componentType: SyntaxTree.Type;
  1529. BEGIN
  1530. type := type.resolved;
  1531. IF operand.mode = ModeReference THEN
  1532. IF type IS SyntaxTree.RangeType THEN
  1533. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1534. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1535. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1536. ReleaseOperand(operand);
  1537. operand.op := firstOp;
  1538. operand.tag := lastOp;
  1539. operand.extra := stepOp;
  1540. ELSIF type IS SyntaxTree.ComplexType THEN
  1541. componentType := type(SyntaxTree.ComplexType).componentType;
  1542. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1543. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1544. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1545. ReleaseOperand(operand);
  1546. operand.op := firstOp;
  1547. operand.tag := lastOp
  1548. ELSE
  1549. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1550. ReleaseIntermediateOperand(operand.op);
  1551. (* EXPERIMENTAL *)
  1552. IF operand.availability >= 0 THEN
  1553. IF availableSymbols[operand.availability].inRegister THEN
  1554. operand.op := availableSymbols[operand.availability].register;
  1555. UseIntermediateOperand(operand.op);
  1556. ELSE
  1557. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1558. availableSymbols[operand.availability].memory := mem;
  1559. operand.op := availableSymbols[operand.availability].register;
  1560. Emit(Mov(position, operand.op, mem));
  1561. availableSymbols[operand.availability].inRegister := TRUE;
  1562. END;
  1563. ReleaseIntermediateOperand(mem);
  1564. ELSE
  1565. operand.op := mem;
  1566. END;
  1567. END;
  1568. operand.mode := ModeValue;
  1569. END;
  1570. ASSERT(operand.mode = ModeValue);
  1571. END LoadValue;
  1572. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1573. BEGIN
  1574. InitOperand(result, ModeUndefined);
  1575. Expression(x);
  1576. op := result;
  1577. LoadValue(op,x.type.resolved);
  1578. END Evaluate;
  1579. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1580. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1581. BEGIN
  1582. Evaluate(x, result); RETURN;
  1583. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1584. WITH x:
  1585. SyntaxTree.UnaryExpression DO
  1586. EvaluateUnaryExpression(x, result);
  1587. RETURN;
  1588. |SyntaxTree.BinaryExpression DO
  1589. EvaluateBinaryExpression(x, result);
  1590. RETURN;
  1591. |SyntaxTree.Set DO
  1592. EvaluateSet(x, result);
  1593. RETURN;
  1594. |SyntaxTree.RangeExpression DO
  1595. InitOperand(result, ModeValue);
  1596. ASSERT(x.first # NIL);
  1597. EvaluateX(x.first, operand);
  1598. result.op := operand.op;
  1599. UseIntermediateOperand(result.op);
  1600. ReleaseOperand(operand);
  1601. ASSERT(x.last # NIL);
  1602. EvaluateX(x.last, operand);
  1603. result.tag := operand.op;
  1604. UseIntermediateOperand(result.tag);
  1605. ReleaseOperand(operand);
  1606. IF x.step # NIL THEN
  1607. EvaluateX(x.step, operand);
  1608. result.extra := operand.op;
  1609. UseIntermediateOperand(result.extra);
  1610. ReleaseOperand(operand);
  1611. END;
  1612. |SyntaxTree.SymbolDesignator DO
  1613. symbol := x.symbol;
  1614. WITH symbol: SyntaxTree.Constant DO
  1615. EvaluateX(symbol.value, result);
  1616. RETURN
  1617. ELSE (* designate and load --> below *)
  1618. END;
  1619. |SyntaxTree.BuiltinCallDesignator DO
  1620. EvaluateBuiltinCallDesignator(x,result);
  1621. (*
  1622. |SyntaxTree.Conversion DO
  1623. |SyntaxTree.ProcedureCallDesignator
  1624. |SyntaxTree.TypeGuardDesignator
  1625. |SyntaxTree.DereferenceDesignator
  1626. |SyntaxTree.SupercallDesignator
  1627. |SyntaxTree.SelfDesignator
  1628. *)
  1629. |SyntaxTree.BooleanValue DO
  1630. InitOperand(result,ModeValue);
  1631. IF x.value THEN result.op := true ELSE result.op := false END;
  1632. RETURN;
  1633. |SyntaxTree.IntegerValue DO
  1634. InitOperand(result,ModeValue);
  1635. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1636. IF ~supportedImmediate(result.op) &~inData THEN
  1637. GetImmediateMem(result.op)
  1638. END;
  1639. RETURN;
  1640. |SyntaxTree.CharacterValue DO
  1641. InitOperand(result,ModeValue);
  1642. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1643. RETURN;
  1644. |SyntaxTree.RealValue DO
  1645. InitOperand(result,ModeValue);
  1646. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1647. RETURN;
  1648. |SyntaxTree.ComplexValue DO
  1649. ASSERT(x.type IS SyntaxTree.ComplexType);
  1650. type := x.type(SyntaxTree.ComplexType).componentType;
  1651. InitOperand(result,ModeValue);
  1652. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1653. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1654. RETURN;
  1655. |SyntaxTree.NilValue DO
  1656. InitOperand(result,ModeValue);
  1657. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1658. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1659. RETURN;
  1660. |SyntaxTree.EnumerationValue DO
  1661. InitOperand(result,ModeValue);
  1662. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1663. RETURN;
  1664. ELSE (* other designators *)
  1665. END;
  1666. Designate(x, result);
  1667. LoadValue(result, x.type);
  1668. END EvaluateX;
  1669. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1670. BEGIN
  1671. InitOperand(result,ModeUndefined);
  1672. Expression(x);
  1673. (* ASSERT(x.mode = ModeReference *)
  1674. op := result;
  1675. END Designate;
  1676. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1677. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1678. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1679. leftExpression, rightExpression: SyntaxTree.Expression;
  1680. BEGIN
  1681. ASSERT(label # NIL);
  1682. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1683. WITH x:
  1684. SyntaxTree.UnaryExpression DO
  1685. CASE x.operator OF
  1686. Scanner.Not:
  1687. Condition(x.left,label,~reason);
  1688. RETURN;
  1689. ELSE
  1690. END;
  1691. | SyntaxTree.BinaryExpression DO
  1692. leftType := x.left.type.resolved;
  1693. rightType := x.right.type.resolved;
  1694. CASE x.operator OF
  1695. Scanner.Or:
  1696. (* shortcut evaluation of left OR right *)
  1697. IF reason THEN (*left or right*)
  1698. Condition(x.left,label,TRUE);
  1699. Condition(x.right,label,TRUE);
  1700. ELSE (* ~ (left or right) = ~left & ~right *)
  1701. skip := NewLabel();
  1702. Condition(x.left,skip,TRUE);
  1703. Condition(x.right,label,FALSE);
  1704. SetLabel(skip);
  1705. END;
  1706. RETURN;
  1707. |Scanner.And:
  1708. (* shortcut evaluation of left & right *)
  1709. IF reason THEN (* left and right *)
  1710. skip := NewLabel();
  1711. Condition(x.left,skip,FALSE);
  1712. Condition(x.right,label,TRUE);
  1713. SetLabel(skip);
  1714. ELSE (* ~(left and right) = ~left or ~right *)
  1715. Condition(x.left,label,FALSE);
  1716. Condition(x.right,label,FALSE);
  1717. END;
  1718. RETURN;
  1719. |Scanner.Is:
  1720. (* get type desc tag *)
  1721. IF IsPointerToRecord(x.left.type,recordType) THEN
  1722. EvaluateX(x.left, left);
  1723. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1724. ELSE
  1725. Designate(x.left,left);
  1726. END;
  1727. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1728. ReleaseOperand(left);
  1729. RETURN;
  1730. |Scanner.Equal:
  1731. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1732. IF reason THEN
  1733. CompareString(BreqL,label,x.left,x.right);
  1734. ELSE
  1735. CompareString(BrneL,label,x.left,x.right);
  1736. END;
  1737. ELSE
  1738. Evaluate(x.left,left);
  1739. Evaluate(x.right,right);
  1740. IF leftType IS SyntaxTree.RangeType THEN
  1741. ASSERT(rightType IS SyntaxTree.RangeType);
  1742. IF reason THEN
  1743. skip := NewLabel();
  1744. BrneL(skip, left.op, right.op); (* first *)
  1745. BrneL(skip, left.tag, right.tag); (* last *)
  1746. BreqL(label, left.extra, right.extra); (* step *)
  1747. SetLabel(skip);
  1748. ELSE
  1749. BrneL(label, left.op, right.op); (* first *)
  1750. BrneL(label, left.tag, right.tag); (* last *)
  1751. BrneL(label, left.extra, right.extra); (* step *)
  1752. END;
  1753. ReleaseOperand(left); ReleaseOperand(right);
  1754. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1755. IF reason THEN
  1756. skip := NewLabel();
  1757. BrneL(skip, left.op, right.op); (* first *)
  1758. BreqL(label, left.tag, right.tag); (* last *)
  1759. SetLabel(skip);
  1760. ELSE
  1761. BrneL(label, left.op, right.op); (* first *)
  1762. BrneL(label, left.tag, right.tag); (* last *)
  1763. END;
  1764. ReleaseOperand(left); ReleaseOperand(right);
  1765. ELSE
  1766. IF reason THEN
  1767. BreqL(label,left.op,right.op);
  1768. ELSE
  1769. BrneL(label,left.op,right.op);
  1770. END;
  1771. ReleaseOperand(left); ReleaseOperand(right);
  1772. END;
  1773. END;
  1774. RETURN;
  1775. |Scanner.LessEqual:
  1776. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1777. IF reason THEN
  1778. CompareString(BrgeL,label,x.right,x.left);
  1779. ELSE
  1780. CompareString(BrltL,label,x.right,x.left);
  1781. END;
  1782. ELSE
  1783. Evaluate(x.left,left);
  1784. Evaluate(x.right,right);
  1785. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1786. Reuse1(temp,right.op);
  1787. Emit(And(position,temp,left.op,right.op));
  1788. ReleaseOperand(right);
  1789. IF reason THEN
  1790. BreqL(label,temp,left.op);
  1791. ELSE
  1792. BrneL(label,temp,left.op);
  1793. END;
  1794. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1795. ELSE
  1796. IF reason THEN
  1797. BrgeL(label,right.op,left.op);
  1798. ELSE
  1799. BrltL(label,right.op,left.op);
  1800. END;
  1801. ReleaseOperand(left); ReleaseOperand(right);
  1802. END;
  1803. END;
  1804. RETURN;
  1805. |Scanner.Less:
  1806. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1807. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1808. leftExpression.SetType(system.booleanType);
  1809. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1810. rightExpression.SetType(system.booleanType);
  1811. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1812. leftExpression.SetType(system.booleanType);
  1813. Condition(leftExpression,label,reason);
  1814. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1815. IF reason THEN
  1816. CompareString(BrltL,label,x.left,x.right);
  1817. ELSE
  1818. CompareString(BrgeL,label,x.left,x.right);
  1819. END;
  1820. ELSE
  1821. Evaluate(x.left,left);
  1822. Evaluate(x.right,right);
  1823. IF reason THEN
  1824. BrltL(label,left.op,right.op);
  1825. ELSE
  1826. BrgeL(label,left.op,right.op);
  1827. END;
  1828. ReleaseOperand(left); ReleaseOperand(right);
  1829. END;
  1830. RETURN;
  1831. |Scanner.Greater:
  1832. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1833. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1834. leftExpression.SetType(system.booleanType);
  1835. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1836. rightExpression.SetType(system.booleanType);
  1837. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1838. leftExpression.SetType(system.booleanType);
  1839. Condition(leftExpression,label,reason);
  1840. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1841. IF reason THEN
  1842. CompareString(BrltL,label,x.right,x.left);
  1843. ELSE
  1844. CompareString(BrgeL,label,x.right,x.left);
  1845. END;
  1846. ELSE
  1847. Evaluate(x.left,left);
  1848. Evaluate(x.right,right);
  1849. IF reason THEN
  1850. BrltL(label, right.op,left.op);
  1851. ELSE
  1852. BrgeL(label, right.op,left.op);
  1853. END;
  1854. ReleaseOperand(left); ReleaseOperand(right);
  1855. END;
  1856. RETURN;
  1857. |Scanner.GreaterEqual:
  1858. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1859. IF reason THEN
  1860. CompareString(BrgeL,label,x.left,x.right);
  1861. ELSE
  1862. CompareString(BrltL,label,x.left,x.right);
  1863. END;
  1864. ELSE
  1865. Evaluate(x.left,left);
  1866. Evaluate(x.right,right);
  1867. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1868. Reuse1(temp,left.op);
  1869. Emit(And(position,temp,left.op,right.op));
  1870. ReleaseOperand(left);
  1871. IF reason THEN
  1872. BreqL(label, temp, right.op);
  1873. ELSE
  1874. BrneL(label, temp, right.op);
  1875. END;
  1876. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1877. ELSE
  1878. IF reason THEN
  1879. BrgeL(label,left.op,right.op);
  1880. ELSE
  1881. BrltL(label, left.op,right.op);
  1882. END;
  1883. ReleaseOperand(left); ReleaseOperand(right);
  1884. END;
  1885. END;
  1886. RETURN;
  1887. |Scanner.Unequal:
  1888. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1889. IF reason THEN
  1890. CompareString(BrneL,label,x.left,x.right);
  1891. ELSE
  1892. CompareString(BreqL,label,x.left,x.right);
  1893. END
  1894. ELSE
  1895. Evaluate(x.left,left);
  1896. Evaluate(x.right,right);
  1897. IF leftType IS SyntaxTree.RangeType THEN
  1898. ASSERT(rightType IS SyntaxTree.RangeType);
  1899. IF ~reason THEN
  1900. skip := NewLabel();
  1901. BrneL(skip, left.op, right.op); (* first *)
  1902. BrneL(skip, left.tag, right.tag); (* last *)
  1903. BreqL(label, left.extra, right.extra); (* step *)
  1904. SetLabel(skip);
  1905. ELSE
  1906. BrneL(label, left.op, right.op); (* first *)
  1907. BrneL(label, left.tag, right.tag); (* last *)
  1908. BrneL(label, left.extra, right.extra); (* step *)
  1909. END;
  1910. ReleaseOperand(left); ReleaseOperand(right);
  1911. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1912. IF reason THEN
  1913. BrneL(label, left.op, right.op);
  1914. BrneL(label, left.tag, right.tag);
  1915. ELSE
  1916. skip := NewLabel();
  1917. BrneL(skip, left.op, right.op);
  1918. BreqL(label, left.tag, right.tag);
  1919. SetLabel(skip);
  1920. END;
  1921. ReleaseOperand(left); ReleaseOperand(right);
  1922. ELSE
  1923. IF reason THEN
  1924. BrneL(label,left.op,right.op);
  1925. ELSE
  1926. BreqL(label,left.op,right.op);
  1927. END;
  1928. ReleaseOperand(left); ReleaseOperand(right);
  1929. END;
  1930. END;
  1931. RETURN;
  1932. ELSE (* case *)
  1933. END;
  1934. |SyntaxTree.BooleanValue DO
  1935. IF reason = x.value THEN BrL(label) END;
  1936. RETURN;
  1937. ELSE (* with *)
  1938. END;
  1939. (* default case: evaluate and compare result *)
  1940. EvaluateX(x,left);
  1941. IF reason THEN
  1942. BrneL(label,left.op, false);
  1943. ELSE
  1944. BreqL(label,left.op, false);
  1945. END;
  1946. ReleaseOperand(left);
  1947. END Condition;
  1948. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1949. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1950. BEGIN
  1951. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1952. dest := destination; destination := emptyOperand;
  1953. CASE x.operator OF
  1954. Scanner.Not:
  1955. EvaluateX(x.left, operand);
  1956. InitOperand(result,ModeValue);
  1957. Reuse1a(result.op,operand.op,dest);
  1958. Emit(Xor(position,result.op,operand.op,true));
  1959. ReleaseOperand(operand);
  1960. |Scanner.Minus:
  1961. EvaluateX(x.left, operand);
  1962. InitOperand(result,ModeValue);
  1963. Reuse1a(result.op,operand.op,dest);
  1964. type := x.left.type.resolved;
  1965. IF type IS SyntaxTree.SetType THEN
  1966. Emit(Not(position,result.op,operand.op));
  1967. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1968. Reuse1(result.tag,operand.tag);
  1969. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1970. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1971. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1972. Emit(Neg(position,result.op,operand.op));
  1973. ELSE HALT(200)
  1974. END;
  1975. ReleaseOperand(operand);
  1976. |Scanner.Address:
  1977. Designate(x.left,result);
  1978. result.mode := ModeValue;
  1979. t0 := x.left.type.resolved;
  1980. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1981. ReleaseIntermediateOperand(result.op);
  1982. result.op := result.tag;
  1983. IntermediateCode.InitOperand(result.tag);
  1984. END;
  1985. Convert(result.op,IntermediateCode.GetType(system,x.type));
  1986. END;
  1987. destination := dest;
  1988. IF Trace THEN TraceExit("UnaryExpression") END;
  1989. END EvaluateUnaryExpression;
  1990. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  1991. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  1992. leftType,rightType: SyntaxTree.Type;
  1993. leftExpression,rightExpression : SyntaxTree.Expression;
  1994. componentType: IntermediateCode.Type;
  1995. exit: Label; dest: IntermediateCode.Operand;
  1996. size: LONGINT;
  1997. BEGIN
  1998. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  1999. dest := destination; destination := emptyOperand;
  2000. leftType := x.left.type.resolved;
  2001. rightType := x.right.type.resolved;
  2002. CASE x.operator OF
  2003. Scanner.Or, Scanner.And, Scanner.Is:
  2004. result := ConditionValue(x);
  2005. |Scanner.Plus:
  2006. EvaluateX(x.left,left);
  2007. EvaluateX(x.right,right);
  2008. IF leftType IS SyntaxTree.SetType THEN
  2009. InitOperand(result,ModeValue);
  2010. Reuse2a(result.op,left.op,right.op,dest);
  2011. Emit(Or(position,result.op,left.op,right.op));
  2012. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2013. InitOperand(result,ModeValue);
  2014. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2015. Reuse2(result.tag,left.tag,right.tag);
  2016. Emit(Add(position,result.op,left.op,right.op));
  2017. Emit(Add(position,result.tag,left.tag,right.tag))
  2018. ELSE
  2019. InitOperand(result,ModeValue);
  2020. Reuse2a(result.op,left.op,right.op,dest);
  2021. Emit(Add(position,result.op,left.op,right.op));
  2022. END;
  2023. ReleaseOperand(left); ReleaseOperand(right);
  2024. |Scanner.Minus:
  2025. EvaluateX(x.left,left);
  2026. EvaluateX(x.right,right);
  2027. IF leftType IS SyntaxTree.SetType THEN
  2028. InitOperand(result,ModeValue);
  2029. Reuse1(result.op,right.op);
  2030. Emit(Not(position,result.op,right.op));
  2031. ReleaseOperand(right);
  2032. Emit(And(position,result.op,result.op,left.op));
  2033. ReleaseOperand(left);
  2034. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2035. InitOperand(result,ModeValue);
  2036. Reuse2a(result.op,left.op,right.op,dest);
  2037. Reuse2(result.tag,left.tag,right.tag);
  2038. Emit(Sub(position,result.op,left.op,right.op));
  2039. Emit(Sub(position,result.tag,left.tag,right.tag));
  2040. ReleaseOperand(left); ReleaseOperand(right)
  2041. ELSE
  2042. InitOperand(result,ModeValue);
  2043. Reuse2a(result.op,left.op,right.op,dest);
  2044. Emit(Sub(position,result.op,left.op,right.op));
  2045. ReleaseOperand(left); ReleaseOperand(right);
  2046. END;
  2047. |Scanner.Times:
  2048. EvaluateX(x.left, left);
  2049. EvaluateX(x.right, right);
  2050. IF leftType IS SyntaxTree.SetType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest);
  2053. Emit(And(position,result.op,left.op,right.op));
  2054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2055. InitOperand(result, ModeValue);
  2056. componentType := left.op.type;
  2057. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2058. Emit(Mul(position,result.op, left.op, right.op));
  2059. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2060. Emit(Mul(position,tempReg, left.tag, right.tag));
  2061. Emit(Sub(position,result.op, result.op, tempReg));
  2062. Reuse2(result.tag, left.tag, right.op);
  2063. Emit(Mul(position,result.tag, left.tag, right.op));
  2064. Emit(Mul(position,tempReg, left.op, right.tag));
  2065. Emit(Add(position,result.tag, result.tag, tempReg));
  2066. ReleaseIntermediateOperand(tempReg)
  2067. ELSE
  2068. InitOperand(result,ModeValue);
  2069. Reuse2a(result.op,left.op,right.op,dest);
  2070. Emit(Mul(position,result.op,left.op,right.op));
  2071. END;
  2072. ReleaseOperand(left); ReleaseOperand(right);
  2073. |Scanner.Div:
  2074. EvaluateX(x.left, left);
  2075. EvaluateX(x.right, right);
  2076. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2077. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2078. IF ~isUnchecked THEN
  2079. exit := NewLabel();
  2080. BrltL(exit,zero,right.op);
  2081. EmitTrap(position,NegativeDivisorTrap);
  2082. SetLabel(exit);
  2083. END;
  2084. END;
  2085. InitOperand(result,ModeValue);
  2086. Reuse2a(result.op,left.op,right.op,dest);
  2087. Emit(Div(position,result.op,left.op,right.op));
  2088. ReleaseOperand(left); ReleaseOperand(right);
  2089. |Scanner.Mod:
  2090. EvaluateX(x.left, left);
  2091. EvaluateX(x.right, right);
  2092. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2093. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2094. IF ~isUnchecked THEN
  2095. exit := NewLabel();
  2096. BrltL(exit,zero,right.op);
  2097. EmitTrap(position,NegativeDivisorTrap);
  2098. SetLabel(exit);
  2099. END;
  2100. END;
  2101. InitOperand(result,ModeValue);
  2102. Reuse2a(result.op,left.op,right.op,dest);
  2103. Emit(Mod(position,result.op,left.op,right.op));
  2104. ReleaseOperand(left); ReleaseOperand(right);
  2105. |Scanner.Slash:
  2106. EvaluateX(x.left, left);
  2107. EvaluateX(x.right, right);
  2108. IF leftType IS SyntaxTree.SetType THEN
  2109. InitOperand(result,ModeValue);
  2110. Reuse2a(result.op,left.op,right.op,dest);
  2111. Emit(Xor(position,result.op,left.op,right.op));
  2112. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2113. InitOperand(result,ModeValue);
  2114. componentType := left.op.type;
  2115. (*
  2116. divisor = right.op * right.op + right.tag * right.tag
  2117. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2118. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2119. *)
  2120. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2121. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2122. Emit(Mul(position,tempReg, right.op, right.op));
  2123. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2124. Emit(Add(position,tempReg, tempReg, tempReg2));
  2125. result.op := tempReg2;
  2126. Emit(Mul(position,result.op, left.op, right.op));
  2127. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2128. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2129. Emit(Add(position,result.op, result.op, tempReg2));
  2130. Emit(Div(position,result.op, result.op, tempReg));
  2131. Reuse2(result.tag, left.tag, right.op);
  2132. Emit(Mul(position,result.tag, left.tag, right.op));
  2133. Emit(Mul(position,tempReg2, left.op, right.tag));
  2134. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2135. Emit(Div(position,result.tag, result.tag, tempReg));
  2136. ReleaseIntermediateOperand(tempReg);
  2137. ReleaseIntermediateOperand(tempReg2)
  2138. ELSE
  2139. InitOperand(result,ModeValue);
  2140. Reuse2a(result.op,left.op,right.op,dest);
  2141. Emit(Div(position,result.op,left.op,right.op));
  2142. END;
  2143. ReleaseOperand(left); ReleaseOperand(right);
  2144. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2145. result := ConditionValue(x);
  2146. |Scanner.In:
  2147. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2148. EvaluateX(x.left, left);
  2149. EvaluateX(x.right, right);
  2150. Convert(left.op,setType);
  2151. Convert(right.op,setType);
  2152. result.mode := ModeValue;
  2153. result.tag := nil; (* may be left over from calls to evaluate *)
  2154. ReuseCopy(result.op,right.op);
  2155. Emit(Shr(position,result.op,result.op,left.op));
  2156. ReleaseOperand(right); ReleaseOperand(left);
  2157. IntermediateCode.InitImmediate(one,setType,1);
  2158. Emit(And(position,result.op,result.op,one));
  2159. Convert(result.op,bool);
  2160. ELSE
  2161. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2162. IF x.operator = Scanner.Questionmarks THEN
  2163. leftExpression := x.left;
  2164. rightExpression := x.right;
  2165. ELSE
  2166. leftExpression := x.right;
  2167. rightExpression := x.left;
  2168. END;
  2169. EvaluateX(leftExpression, left);
  2170. Emit(Push(position,left.op));
  2171. ReleaseOperand(left);
  2172. Designate(rightExpression, right);
  2173. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2174. IF ~backend.cellsAreObjects THEN
  2175. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2176. END;
  2177. Emit(Push(position,right.op));
  2178. ReleaseOperand(right);
  2179. IF backend.cellsAreObjects THEN
  2180. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2181. ELSE
  2182. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2183. END;
  2184. InitOperand(result, ModeValue);
  2185. result.op := NewRegisterOperand(bool);
  2186. Emit(Result(position,result.op));
  2187. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2188. leftExpression := x.left;
  2189. rightExpression := x.right;
  2190. EvaluateX(leftExpression, left);
  2191. Emit(Push(position,left.op));
  2192. ReleaseOperand(left);
  2193. EvaluateX(rightExpression, right);
  2194. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2195. IF ~backend.cellsAreObjects THEN
  2196. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2197. END;
  2198. Emit(Push(position,right.op));
  2199. ReleaseOperand(right);
  2200. IF backend.cellsAreObjects THEN
  2201. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2202. ELSE
  2203. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2204. END;
  2205. InitOperand(result, ModeValue);
  2206. result.op := NewRegisterOperand(bool);
  2207. Emit(Result(position,result.op));
  2208. ELSE
  2209. HALT(100);
  2210. END;
  2211. END;
  2212. destination := dest;
  2213. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2214. END EvaluateBinaryExpression;
  2215. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2216. VAR
  2217. operand: Operand;
  2218. temp, one, noBits, dest: IntermediateCode.Operand;
  2219. expression: SyntaxTree.Expression;
  2220. i: LONGINT;
  2221. BEGIN
  2222. IF Trace THEN TraceEnter("VisitSet") END;
  2223. dest := destination;
  2224. destination := emptyOperand;
  2225. noBits := IntermediateCode.Immediate(setType, 0);
  2226. one := IntermediateCode.Immediate(setType, 1);
  2227. (* start off with the empty set *)
  2228. InitOperand(result, ModeValue);
  2229. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2230. Emit(Mov(position,result.op, noBits));
  2231. FOR i := 0 TO x.elements.Length() - 1 DO
  2232. expression := x.elements.GetExpression(i);
  2233. IF expression IS SyntaxTree.RangeExpression THEN
  2234. (* range of set elements *)
  2235. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2236. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2237. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2238. ReleaseIntermediateOperand(temp)
  2239. ELSE
  2240. (* singelton element *)
  2241. Evaluate(expression, operand);
  2242. Convert(operand.op, setType);
  2243. CheckSetElement(operand.op);
  2244. (* create subset containing single element *)
  2245. Reuse1(temp, operand.op);
  2246. Emit(Shl(position,temp, one, operand.op));
  2247. ReleaseOperand(operand);
  2248. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2249. ReleaseIntermediateOperand(temp);
  2250. END
  2251. END;
  2252. destination := dest;
  2253. IF Trace THEN TraceExit("VisitSet") END;
  2254. END EvaluateSet;
  2255. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2256. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2257. BEGIN
  2258. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2259. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2260. RETURN op
  2261. END NewRegisterOperand;
  2262. PROCEDURE UnuseRegister(register: LONGINT);
  2263. BEGIN
  2264. IF (register > 0) THEN
  2265. register := registerUsageCount.Map(register);
  2266. registerUsageCount.DecUse(register);
  2267. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2268. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2269. END;
  2270. IF registerUsageCount.Use(register)=0 THEN
  2271. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2272. Warning(position, "register cannot be removed");
  2273. END;
  2274. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2275. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2276. END;
  2277. ELSIF registerUsageCount.Use(register)<0 THEN
  2278. Warning(position, "register removed too often");
  2279. IF dump # NIL THEN
  2280. dump.String("register removed too often"); dump.Ln; dump.Update;
  2281. END;
  2282. END;
  2283. END;
  2284. END UnuseRegister;
  2285. PROCEDURE UseRegister(register: LONGINT);
  2286. BEGIN
  2287. IF (register > 0) THEN
  2288. register := registerUsageCount.Map(register);
  2289. registerUsageCount.IncUse(register);
  2290. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2291. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2292. END;
  2293. IF registerUsageCount.Use(register)=1 THEN
  2294. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2295. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2296. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2297. END;
  2298. END;
  2299. END;
  2300. END UseRegister;
  2301. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2302. BEGIN
  2303. UnuseRegister(op.register)
  2304. END ReleaseIntermediateOperand;
  2305. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2306. BEGIN
  2307. UseRegister(op.register)
  2308. END UseIntermediateOperand;
  2309. PROCEDURE ReleaseOperand(CONST op: Operand);
  2310. BEGIN
  2311. UnuseRegister(op.op.register);
  2312. UnuseRegister(op.tag.register);
  2313. UnuseRegister(op.extra.register);
  2314. END ReleaseOperand;
  2315. (* save registers marked in array "markedRegisters" to the stack
  2316. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2317. *)
  2318. PROCEDURE SaveRegisters();
  2319. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2320. BEGIN
  2321. entry := usedRegisters;
  2322. WHILE entry # NIL DO
  2323. type := registerUsageCount.used[entry.register].type;
  2324. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2325. Emit(Push(position,op));
  2326. entry := entry.next;
  2327. END;
  2328. END SaveRegisters;
  2329. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2330. BEGIN
  2331. saved := usedRegisters;
  2332. usedRegisters := NIL;
  2333. END ReleaseUsedRegisters;
  2334. (** remove parameter registers from used queue *)
  2335. PROCEDURE ReleaseParameterRegisters;
  2336. VAR entry,prev,next: RegisterEntry;
  2337. BEGIN
  2338. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2339. WHILE entry # NIL DO
  2340. next := entry.next;
  2341. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2342. registerUsageCount.DecUse(entry.register);
  2343. ASSERT(registerUsageCount.Use(entry.register)=0);
  2344. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2345. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2346. END;
  2347. ELSIF prev = NIL THEN
  2348. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2349. ELSE
  2350. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2351. END;
  2352. entry := next;
  2353. END;
  2354. END ReleaseParameterRegisters;
  2355. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2356. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2357. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2358. BEGIN
  2359. entry := saved;
  2360. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2361. entry := prev;
  2362. WHILE entry # NIL DO
  2363. prev := entry.prev;
  2364. type := entry.type;
  2365. class := entry.registerClass;
  2366. IntermediateCode.InitRegister(op,type,class,entry.register);
  2367. Emit(Pop(position,op));
  2368. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2369. entry := prev;
  2370. END;
  2371. END RestoreRegisters;
  2372. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2373. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2374. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2375. BEGIN
  2376. entry := saved;
  2377. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2378. entry := prev;
  2379. WHILE entry # NIL DO
  2380. prev := entry.prev;
  2381. type := entry.type;
  2382. class := entry.registerClass;
  2383. IntermediateCode.InitRegister(op,type,class,entry.register);
  2384. Emit(Mov(position,op,op));
  2385. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2386. entry := prev;
  2387. END;
  2388. END RestoreRegisterUse;
  2389. PROCEDURE CheckRegistersFree;
  2390. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2391. BEGIN
  2392. IF usedRegisters # NIL THEN
  2393. r := usedRegisters;
  2394. WHILE r # NIL DO
  2395. warning := "register ";
  2396. Strings.AppendInt(warning, r.register);
  2397. Strings.Append(warning, " not released.");
  2398. Warning(position,warning);
  2399. r := r .next;
  2400. END;
  2401. END;
  2402. FOR i := 0 TO registerUsageCount.count-1 DO
  2403. IF registerUsageCount.used[i].count < 0 THEN
  2404. warning := "register ";
  2405. Strings.AppendInt(warning, i);
  2406. Strings.Append(warning, " unused too often.");
  2407. Warning(position,warning);
  2408. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2409. warning := "register ";
  2410. Strings.AppendInt(warning, i);
  2411. Strings.Append(warning, " not unused often enough.");
  2412. Warning(position,warning);
  2413. END;
  2414. END;
  2415. END CheckRegistersFree;
  2416. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2417. Otherwise allocate a new register.
  2418. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2419. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2420. BEGIN
  2421. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2422. UseIntermediateOperand(result);
  2423. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2424. UseIntermediateOperand(result);
  2425. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2426. END;
  2427. END Reuse2;
  2428. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2429. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2430. If not then allocate a new register.
  2431. Does NOT necessarily keep the content of src1 or src2 in result!
  2432. *)
  2433. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2434. BEGIN
  2435. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2436. UseIntermediateOperand(result);
  2437. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2438. UseIntermediateOperand(result);
  2439. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2440. result := alternative; alternative := emptyOperand;
  2441. UseIntermediateOperand(result);
  2442. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2443. END;
  2444. END Reuse2a;
  2445. (* like reuse2 but only one source *)
  2446. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2447. BEGIN
  2448. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2449. UseIntermediateOperand(result);
  2450. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2451. END;
  2452. END Reuse1;
  2453. (* like reuse2a but only one source *)
  2454. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2455. BEGIN
  2456. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2457. UseIntermediateOperand(result);
  2458. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2459. UseIntermediateOperand(result);
  2460. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2461. END;
  2462. END Reuse1a;
  2463. (* like reuse1 but guarantees that content of src1 is in result *)
  2464. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2465. BEGIN
  2466. IF ReusableRegister(src1) THEN
  2467. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2468. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2469. UseIntermediateOperand(result);
  2470. ELSE
  2471. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2472. Emit(Mov(position,result,src1));
  2473. END
  2474. END ReuseCopy;
  2475. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2476. BEGIN
  2477. IF ReusableRegister(src) THEN
  2478. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2479. ELSE
  2480. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2481. Emit(Mov(position,result,src));
  2482. ReleaseIntermediateOperand(src);
  2483. END
  2484. END TransferToRegister;
  2485. (** labels and branches **)
  2486. PROCEDURE NewLabel(): Label;
  2487. VAR label: Label;
  2488. BEGIN
  2489. NEW(label,section); RETURN label;
  2490. END NewLabel;
  2491. (* EXPERIMENTAL *)
  2492. PROCEDURE EndBasicBlock;
  2493. VAR i: LONGINT;
  2494. BEGIN
  2495. i := 0;
  2496. WHILE (availableSymbols[i].symbol # NIL) DO
  2497. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2498. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2499. END;
  2500. availableSymbols[i].symbol := NIL;
  2501. INC(i);
  2502. END;
  2503. END EndBasicBlock;
  2504. (* EXPERIMENTAL *)
  2505. PROCEDURE BeginBasicBlock;
  2506. BEGIN
  2507. ASSERT(availableSymbols[0].symbol = NIL);
  2508. END BeginBasicBlock;
  2509. PROCEDURE SetLabel(label: Label);
  2510. BEGIN
  2511. (* EXPERIMENTAL *)
  2512. EndBasicBlock;
  2513. BeginBasicBlock;
  2514. label.Resolve(section.pc);
  2515. END SetLabel;
  2516. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2517. BEGIN
  2518. ASSERT(label # NIL);
  2519. IF label.pc < 0 THEN (* label not yet set *)
  2520. label.AddFixup(section.pc);
  2521. END;
  2522. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2523. END LabelOperand;
  2524. PROCEDURE BrL(label: Label);
  2525. BEGIN
  2526. (* EXPERIMENTAL *)
  2527. EndBasicBlock;
  2528. Emit(Br(position,LabelOperand(label)));
  2529. END BrL;
  2530. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2531. BEGIN
  2532. Emit(Brge(position,LabelOperand(label),left,right));
  2533. END BrgeL;
  2534. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2535. BEGIN
  2536. Emit(Brlt(position,LabelOperand(label),left,right));
  2537. END BrltL;
  2538. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2539. BEGIN
  2540. Emit(Breq(position,LabelOperand(label),left,right));
  2541. END BreqL;
  2542. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2543. BEGIN
  2544. Emit(Brne(position,LabelOperand(label),left,right));
  2545. END BrneL;
  2546. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2547. VAR new: IntermediateCode.Operand;
  2548. BEGIN
  2549. IF Trace THEN TraceEnter("Convert") END;
  2550. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2551. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2552. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2553. & (operand.offset = 0)
  2554. THEN
  2555. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2556. Emit(Conv(position,new,operand));
  2557. ELSE
  2558. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2559. Emit(Conv(position,new,operand));
  2560. ReleaseIntermediateOperand(operand);
  2561. END;
  2562. operand := new;
  2563. 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
  2564. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2565. ELSE
  2566. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2567. Emit(Conv(position,new,operand));
  2568. ReleaseIntermediateOperand(operand);
  2569. operand := new;
  2570. END;
  2571. IF Trace THEN TraceExit("Convert") END;
  2572. END Convert;
  2573. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2574. VAR exit: Label;
  2575. BEGIN
  2576. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2577. exit := NewLabel();
  2578. br(exit,left,right);
  2579. EmitTrap(position,trapNo);
  2580. SetLabel(exit);
  2581. END TrapC;
  2582. (** expressions *)
  2583. (** emit necessary runtime check for set elements **)
  2584. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2585. VAR max: IntermediateCode.Operand;
  2586. BEGIN
  2587. IF isUnchecked THEN RETURN END;
  2588. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2589. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2590. TrapC(BrgeL, max, o, SetElementTrap);
  2591. END;
  2592. END CheckSetElement;
  2593. (** the set that a range represents **)
  2594. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2595. VAR
  2596. operand: Operand;
  2597. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2598. BEGIN
  2599. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2600. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2601. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2602. one := IntermediateCode.Immediate(setType, 1);
  2603. Evaluate(x, operand);
  2604. Convert(operand.op, setType);
  2605. Convert(operand.tag, setType);
  2606. CheckSetElement(operand.op);
  2607. CheckSetElement(operand.tag);
  2608. (* create mask for lower bound
  2609. i.e. shift 11111111 to the left by the value of the lower bound
  2610. *)
  2611. Reuse1(temp, operand.op);
  2612. Emit(Shl(position,temp, allBits, operand.op));
  2613. ReleaseIntermediateOperand(operand.op);
  2614. operand.op := temp;
  2615. (* create mask for upper bound
  2616. i.e. shift 11111111 to the right by the difference between the
  2617. upper bound and the maximum number of set elements
  2618. *)
  2619. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2620. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2621. Reuse1(temp, operand.tag);
  2622. ELSE
  2623. Reuse1(temp, operand.tag);
  2624. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2625. Emit(Sub(position,temp, size, operand.tag));
  2626. END;
  2627. Emit(Shr(position,temp, allBits, operand.tag));
  2628. ReleaseIntermediateOperand(operand.tag);
  2629. operand.tag := temp;
  2630. Reuse2(resultingSet, operand.op, operand.tag);
  2631. (* intersect the two masks *)
  2632. Emit(And(position,resultingSet, operand.op, operand.tag));
  2633. ReleaseOperand(operand);
  2634. RETURN resultingSet
  2635. END SetFromRange;
  2636. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2637. VAR
  2638. res, operand: Operand;
  2639. temp, one, noBits, dest: IntermediateCode.Operand;
  2640. expression: SyntaxTree.Expression;
  2641. i: LONGINT;
  2642. BEGIN
  2643. IF Trace THEN TraceEnter("VisitSet") END;
  2644. dest := destination;
  2645. destination := emptyOperand;
  2646. noBits := IntermediateCode.Immediate(setType, 0);
  2647. one := IntermediateCode.Immediate(setType, 1);
  2648. (* start off with the empty set *)
  2649. InitOperand(res, ModeValue);
  2650. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2651. Emit(Mov(position,res.op, noBits));
  2652. FOR i := 0 TO x.elements.Length() - 1 DO
  2653. expression := x.elements.GetExpression(i);
  2654. IF expression IS SyntaxTree.RangeExpression THEN
  2655. (* range of set elements *)
  2656. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2657. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2658. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2659. ReleaseIntermediateOperand(temp)
  2660. ELSE
  2661. (* singelton element *)
  2662. Evaluate(expression, operand);
  2663. Convert(operand.op, setType);
  2664. CheckSetElement(operand.op);
  2665. (* create subset containing single element *)
  2666. Reuse1(temp, operand.op);
  2667. Emit(Shl(position,temp, one, operand.op));
  2668. ReleaseOperand(operand);
  2669. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2670. ReleaseIntermediateOperand(temp);
  2671. END
  2672. END;
  2673. result := res;
  2674. destination := dest;
  2675. IF Trace THEN TraceExit("VisitSet") END;
  2676. END VisitSet;
  2677. (* math arrays of the form [a,b,c]
  2678. x is a static array and thus does not provide any pointers
  2679. *)
  2680. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2681. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2682. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2683. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2684. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2685. element: SyntaxTree.IntegerValue;
  2686. BEGIN
  2687. numberElements := x.elements.Length();
  2688. expression := index.parameters.GetExpression(dim);
  2689. element := expression(SyntaxTree.IntegerValue);
  2690. FOR i := 0 TO numberElements-1 DO
  2691. expression := x.elements.GetExpression(i);
  2692. element.SetValue(i);
  2693. IF expression IS SyntaxTree.MathArrayExpression THEN
  2694. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2695. ELSE
  2696. Assign(index,expression);
  2697. END;
  2698. END;
  2699. END RecursiveAssignment;
  2700. PROCEDURE Dimension(): LONGINT;
  2701. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2702. BEGIN
  2703. dim := 0;
  2704. expression := x;
  2705. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2706. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2707. INC(dim);
  2708. END;
  2709. RETURN dim;
  2710. END Dimension;
  2711. BEGIN
  2712. (*static math array not providing pointers anyway *)
  2713. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2714. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,NIL, variable);
  2715. designator.SetType(variable.type);
  2716. dim := Dimension();
  2717. index := SyntaxTree.NewIndexDesignator(x.position,NIL,designator, SyntaxTree.NewExpressionList());
  2718. FOR i := 0 TO dim-1 DO
  2719. element := SyntaxTree.NewIntegerValue(x.position,0);
  2720. element.SetType(system.longintType);
  2721. index.parameters.AddExpression(element);
  2722. END;
  2723. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2724. RecursiveAssignment(x,0);
  2725. Expression(designator);
  2726. END VisitMathArrayExpression;
  2727. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2728. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2729. BEGIN
  2730. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2731. dest := destination; destination := emptyOperand;
  2732. IF x.operator = Scanner.Not THEN
  2733. Evaluate(x.left,operand);
  2734. InitOperand(result,ModeValue);
  2735. Reuse1a(result.op,operand.op,dest);
  2736. Emit(Xor(position,result.op,operand.op,true));
  2737. ReleaseOperand(operand);
  2738. ELSIF x.operator = Scanner.Minus THEN
  2739. Evaluate(x.left,operand);
  2740. InitOperand(result,ModeValue);
  2741. Reuse1a(result.op,operand.op,dest);
  2742. type := x.left.type.resolved;
  2743. IF type IS SyntaxTree.SetType THEN
  2744. Emit(Not(position,result.op,operand.op));
  2745. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2746. Reuse1(result.tag,operand.tag);
  2747. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2748. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2749. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2750. Emit(Neg(position,result.op,operand.op));
  2751. ELSE HALT(200)
  2752. END;
  2753. ReleaseOperand(operand);
  2754. ELSIF x.operator = Scanner.Address THEN
  2755. Designate(x.left,operand);
  2756. operand.mode := ModeValue;
  2757. t0 := x.left.type.resolved;
  2758. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2759. ReleaseIntermediateOperand(operand.op);
  2760. operand.op := operand.tag;
  2761. IntermediateCode.InitOperand(operand.tag);
  2762. END;
  2763. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2764. result := operand;
  2765. ELSE HALT(100)
  2766. END;
  2767. destination := dest;
  2768. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2769. END VisitUnaryExpression;
  2770. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2771. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2772. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2773. BEGIN
  2774. type := type.resolved;
  2775. originalType := type;
  2776. IF type IS SyntaxTree.PointerType THEN
  2777. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2778. END;
  2779. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2780. BrL(label);
  2781. ELSE
  2782. ASSERT(type IS SyntaxTree.RecordType);
  2783. (*
  2784. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2785. *)
  2786. IF withPart THEN
  2787. left := tag;
  2788. ELSE
  2789. ReuseCopy(left,tag);
  2790. END;
  2791. right := TypeDescriptorAdr(type);
  2792. IF backend.cooperative THEN
  2793. repeatL := NewLabel();
  2794. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2795. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2796. END;
  2797. SetLabel(repeatL);
  2798. IF reason THEN
  2799. BreqL(label,left,right);
  2800. ELSE
  2801. skip := NewLabel();
  2802. BreqL(skip,left,right);
  2803. END;
  2804. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2805. BrneL(repeatL,left,nil);
  2806. IF ~reason THEN
  2807. BrL(label);
  2808. SetLabel(skip);
  2809. END;
  2810. ELSIF meta.simple THEN
  2811. level := type(SyntaxTree.RecordType).Level();
  2812. (* get type desc tag of level relative to base tag *)
  2813. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2814. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2815. IntermediateCode.MakeMemory(left,addressType);
  2816. IF reason THEN
  2817. BreqL(label,left,right);
  2818. ELSE
  2819. BrneL(label,left,right);
  2820. END;
  2821. ELSE
  2822. level := type(SyntaxTree.RecordType).Level();
  2823. (* get type desc tag of level relative to base tag *)
  2824. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2825. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2826. IntermediateCode.MakeMemory(left,addressType);
  2827. IF reason THEN
  2828. BreqL(label,left,right);
  2829. ELSE
  2830. BrneL(label,left,right);
  2831. END;
  2832. END;
  2833. IF ~withPart THEN
  2834. ReleaseIntermediateOperand(left);
  2835. END;
  2836. ReleaseIntermediateOperand(right);
  2837. END;
  2838. END TypeTest;
  2839. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2840. BEGIN
  2841. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2842. IF dump # NIL THEN
  2843. dump.String(s); dump.Ln;
  2844. END;
  2845. END Error;
  2846. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2847. BEGIN
  2848. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2849. IF dump # NIL THEN
  2850. dump.String(s); dump.Ln; dump.Update;
  2851. END;
  2852. END Warning;
  2853. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2854. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; context: Context;
  2855. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2856. operand:Operand;
  2857. BEGIN
  2858. Global.GetModuleName(mod,name);
  2859. Strings.Append(name,".@Trace");
  2860. Basic.ToSegmentedName(name, pooledName);
  2861. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE));
  2862. IF dump # NIL THEN dump := section.comments END;
  2863. IF backend.hasLinkRegister THEN
  2864. Emit(Push(Basic.invalidPosition, lr));
  2865. END;
  2866. variable := mod.moduleScope.firstVariable;
  2867. WHILE variable # NIL DO
  2868. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2869. Symbol(variable, operand);
  2870. register := operand.op;
  2871. CallTraceMethod(register, variable.type);
  2872. ReleaseIntermediateOperand(register);
  2873. END;
  2874. variable := variable.nextVariable;
  2875. END;
  2876. IF backend.hasLinkRegister THEN
  2877. Emit(Pop(Basic.invalidPosition, lr));
  2878. END;
  2879. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2880. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2881. Emit(Br(position,op));
  2882. INC(statCoopTraceModule, section.pc);
  2883. ReturnToContext(context);
  2884. IF dump # NIL THEN dump := section.comments END;
  2885. END CreateTraceModuleMethod;
  2886. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2887. BEGIN
  2888. Emit (Push(position, dst));
  2889. Emit (Push(position, src));
  2890. CallThis(position,"GarbageCollector","Assign", 2);
  2891. END CallAssignPointer;
  2892. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2893. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2894. BEGIN
  2895. IF SemanticChecker.IsPointerType (type) THEN
  2896. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2897. ELSIF type.IsRecordType() THEN
  2898. Emit (Push(position,dst));
  2899. Emit (Push(position,src));
  2900. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2901. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2902. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2903. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2904. ELSIF IsStaticArray(type) THEN
  2905. size := StaticArrayNumElements(type);
  2906. base := StaticArrayBaseType(type);
  2907. IF base.IsRecordType() THEN
  2908. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2909. Emit (Push(position, dst));
  2910. Emit (Push(position, src));
  2911. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2912. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2913. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2914. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2915. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2916. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2917. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2918. Emit (Push(position, dst));
  2919. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2920. Emit (Push(position, src));
  2921. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2922. ELSE
  2923. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2924. Emit (Push(position, dst));
  2925. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2926. Emit (Push(position, src));
  2927. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2928. ASSERT(StaticArrayBaseType(type).IsPointer());
  2929. END;
  2930. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2931. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2932. Emit (Push(position, dst));
  2933. Emit (Push(position, src));
  2934. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2935. ELSE HALT(100); (* missing ? *)
  2936. END;
  2937. END CallAssignMethod;
  2938. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2939. VAR name: Basic.SegmentedName;
  2940. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2941. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2942. context: Context;
  2943. BEGIN
  2944. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2945. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2946. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2947. GetRecordTypeName (recordType,name);
  2948. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2949. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  2950. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2951. section.SetExported (TRUE);
  2952. IF dump # NIL THEN dump := section.comments END;
  2953. IF backend.hasLinkRegister THEN
  2954. Emit(Push(Basic.invalidPosition, lr));
  2955. END;
  2956. variable := recordType.recordScope.firstVariable;
  2957. WHILE variable # NIL DO
  2958. IF variable.NeedsTrace() THEN
  2959. dst := NewRegisterOperand (addressType);
  2960. src := NewRegisterOperand (addressType);
  2961. Emit (Mov(position, dst, parameter1));
  2962. Emit (Mov(position, src, parameter2));
  2963. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2964. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2965. CallAssignMethod(dst, src, variable.type);
  2966. ReleaseIntermediateOperand(src);
  2967. ReleaseIntermediateOperand(dst);
  2968. END;
  2969. variable := variable.nextVariable;
  2970. END;
  2971. recordBase := recordType.GetBaseRecord();
  2972. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2973. IF backend.hasLinkRegister THEN
  2974. Emit(Pop(Basic.invalidPosition, lr));
  2975. END;
  2976. GetRecordTypeName (recordBase,name);
  2977. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2978. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2979. Emit(Br(position,op));
  2980. ELSE
  2981. Emit(Exit(position,0,0, 0));
  2982. END;
  2983. INC(statCoopAssignProcedure, section.pc);
  2984. ReturnToContext(context);
  2985. IF ~recordType.isObject THEN
  2986. GetRecordTypeName (recordType,name);
  2987. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2988. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2989. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2990. section.SetExported (TRUE);
  2991. dst := NewRegisterOperand (addressType);
  2992. src := NewRegisterOperand (addressType);
  2993. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2994. Emit(Mov(position, dst, parameter1));
  2995. Emit(Mov(position, src, parameter2));
  2996. label := NewLabel();
  2997. SetLabel(label);
  2998. Emit(Push(position, dst));
  2999. Emit(Push(position, src));
  3000. GetRecordTypeName (recordType,name);
  3001. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3002. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3003. Emit(Call(position, op, 0));
  3004. Emit(Pop(position, src));
  3005. Emit(Pop(position, dst));
  3006. Emit(Add(position, dst, dst, ofs));
  3007. Emit(Add(position, src, src, ofs));
  3008. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3009. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3010. Emit(Exit(position,0,0, 0));
  3011. ReturnToContext(context);
  3012. END;
  3013. IF dump # NIL THEN dump := section.comments END;
  3014. END CreateAssignProcedure;
  3015. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3016. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3017. BEGIN
  3018. IF IsUnsafePointer (type) THEN
  3019. skip := NewLabel();
  3020. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3021. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3022. BreqL (skip, op, nil);
  3023. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3024. SetLabel (skip);
  3025. ELSIF SemanticChecker.IsPointerType (type) THEN
  3026. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3027. CallThis(position,"GarbageCollector","Mark", 1);
  3028. ELSIF type.IsRecordType() THEN
  3029. Emit (Push(position,register));
  3030. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3031. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3032. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3033. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3034. ELSIF IsStaticArray(type) THEN
  3035. size := StaticArrayNumElements(type);
  3036. base := StaticArrayBaseType(type);
  3037. IF base.IsRecordType() THEN
  3038. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3039. Emit (Push(position, register));
  3040. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3041. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3042. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3043. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3044. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3045. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3046. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3047. Emit (Push(position, register));
  3048. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3049. ELSE
  3050. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3051. Emit (Push(position, register));
  3052. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3053. ASSERT(base.IsPointer());
  3054. END;
  3055. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3056. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3057. CallThis(position,"GarbageCollector","Mark", 1);
  3058. ELSE HALT(100); (* missing ? *)
  3059. END;
  3060. END CallTraceMethod;
  3061. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3062. VAR name: Basic.SegmentedName; variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3063. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3064. BEGIN
  3065. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3066. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3067. GetRecordTypeName (recordType,name);
  3068. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3069. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  3070. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3071. section.SetExported (TRUE);
  3072. IF dump # NIL THEN dump := section.comments END;
  3073. IF backend.hasLinkRegister THEN
  3074. Emit(Push(Basic.invalidPosition, lr));
  3075. END;
  3076. variable := recordType.recordScope.firstVariable;
  3077. WHILE variable # NIL DO
  3078. IF variable.NeedsTrace() THEN
  3079. register := NewRegisterOperand (addressType);
  3080. Emit (Mov(position,register,parameter1));
  3081. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3082. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3083. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3084. END;
  3085. CallTraceMethod(register, variable.type);
  3086. ReleaseIntermediateOperand(register);
  3087. END;
  3088. variable := variable.nextVariable;
  3089. END;
  3090. recordBase := recordType.GetBaseRecord();
  3091. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3092. recordBase := recordBase.GetBaseRecord();
  3093. END;
  3094. IF recordBase # NIL THEN
  3095. IF backend.hasLinkRegister THEN
  3096. Emit(Pop(Basic.invalidPosition, lr));
  3097. END;
  3098. GetRecordTypeName (recordBase,name);
  3099. IF HasExplicitTraceMethod (recordBase) THEN
  3100. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3101. ELSE
  3102. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3103. END;
  3104. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3105. Emit(Br(position,op));
  3106. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3107. Emit(Exit(position,0,0,0));
  3108. ELSE
  3109. IF backend.hasLinkRegister THEN
  3110. Emit(Pop(Basic.invalidPosition, lr));
  3111. END;
  3112. IF recordType.isObject THEN
  3113. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3114. ELSE
  3115. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3116. END;
  3117. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3118. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3119. Emit(Br(position,op));
  3120. END;
  3121. INC(statCoopTraceMethod, section.pc);
  3122. ReturnToContext(context);
  3123. IF ~recordType.isObject THEN
  3124. GetRecordTypeName (recordType,name);
  3125. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3126. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3127. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3128. section.SetExported (TRUE);
  3129. IF dump # NIL THEN dump := section.comments END;
  3130. register := NewRegisterOperand (addressType);
  3131. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3132. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3133. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3134. END;
  3135. Emit (Push(position,register));
  3136. GetRecordTypeName (recordType,name);
  3137. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3138. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3139. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3140. ReleaseIntermediateOperand(register);
  3141. Emit(Exit(position,0,0,0));
  3142. ReturnToContext(context);
  3143. GetRecordTypeName (recordType,name);
  3144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3145. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3146. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3147. section.SetExported (TRUE);
  3148. register := NewRegisterOperand (addressType);
  3149. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3150. Emit(Mov(position, register, parameter1));
  3151. label := NewLabel();
  3152. SetLabel(label);
  3153. Emit(Push(position, register));
  3154. GetRecordTypeName (recordType,name);
  3155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3156. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3157. Emit(Call(position, op, 0));
  3158. Emit(Pop(position, register));
  3159. Emit(Add(position, register, register, ofs));
  3160. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3161. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3162. Emit(Exit(position,0,0,0));
  3163. ReturnToContext(context);
  3164. END;
  3165. IF dump # NIL THEN dump := section.comments END;
  3166. END CreateTraceMethod;
  3167. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3168. VAR name: Basic.SegmentedName;
  3169. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3170. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3171. context: Context;
  3172. BEGIN
  3173. IF recordType.isObject THEN RETURN END;
  3174. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3175. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3176. GetRecordTypeName (recordType,name);
  3177. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3178. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  3179. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3180. section.SetExported (TRUE);
  3181. IF dump # NIL THEN dump := section.comments END;
  3182. IF backend.hasLinkRegister THEN
  3183. Emit(Push(Basic.invalidPosition, lr));
  3184. END;
  3185. variable := recordType.recordScope.firstVariable;
  3186. WHILE variable # NIL DO
  3187. IF variable.NeedsTrace() THEN
  3188. dst := NewRegisterOperand (addressType);
  3189. Emit (Mov(position, dst, parameter1));
  3190. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3191. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3192. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3193. END;
  3194. CallResetProcedure(dst, nil, variable.type);
  3195. ReleaseIntermediateOperand(dst);
  3196. END;
  3197. variable := variable.nextVariable;
  3198. END;
  3199. recordBase := recordType.GetBaseRecord();
  3200. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3201. IF backend.hasLinkRegister THEN
  3202. Emit(Pop(Basic.invalidPosition, lr));
  3203. END;
  3204. GetRecordTypeName (recordBase,name);
  3205. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3206. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3207. Emit(Br(position,op));
  3208. ELSE
  3209. Emit(Exit(position,0,0, 0));
  3210. END;
  3211. INC(statCoopResetProcedure, section.pc);
  3212. ReturnToContext(context);
  3213. GetRecordTypeName (recordType,name);
  3214. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3216. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3217. section.SetExported (TRUE);
  3218. dst := NewRegisterOperand (addressType);
  3219. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3220. Emit(Mov(position, dst, parameter1));
  3221. label := NewLabel();
  3222. SetLabel(label);
  3223. Emit(Push(position, dst));
  3224. GetRecordTypeName (recordType,name);
  3225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3226. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3227. Emit(Call(position, op, 0));
  3228. Emit(Pop(position, dst));
  3229. Emit(Add(position, dst, dst, ofs));
  3230. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3231. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3232. Emit(Exit(position,0,0, 0));
  3233. ReturnToContext(context);
  3234. IF dump # NIL THEN dump := section.comments END;
  3235. END CreateResetProcedure;
  3236. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3237. VAR name: Basic.SegmentedName; context: Context;
  3238. BEGIN
  3239. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3241. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3242. IF dump # NIL THEN dump := section.comments END;
  3243. IF backend.hasLinkRegister THEN
  3244. Emit(Push(Basic.invalidPosition, lr));
  3245. END;
  3246. Emit(Push(position,fp));
  3247. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3248. ResetVariables(scope);
  3249. Emit(Pop(position,fp));
  3250. Emit(Exit(position,0,0, 0));
  3251. ReturnToContext(context);
  3252. IF dump # NIL THEN dump := section.comments END;
  3253. END CreateResetMethod;
  3254. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3255. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3256. BEGIN
  3257. IF SemanticChecker.IsPointerType (type) THEN
  3258. Emit (Push(position, dest));
  3259. CallThis(position,"GarbageCollector","Reset", 1);
  3260. ELSIF type.IsRecordType() THEN
  3261. Emit (Push(position, dest));
  3262. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3263. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3264. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3265. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3266. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3267. size := GetArrayLength(type, tag);
  3268. base := ArrayBaseType(type);
  3269. IF base.IsRecordType() THEN
  3270. Emit (Push(position, size));
  3271. Emit (Push(position, dest));
  3272. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3273. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3275. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3276. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3277. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3278. Emit (Push(position, size));
  3279. Emit (Push(position, dest));
  3280. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3281. ELSE
  3282. Emit (Push(position, size));
  3283. Emit (Push(position, dest));
  3284. CallThis(position,"GarbageCollector","ResetArray", 2);
  3285. ASSERT(ArrayBaseType(type).IsPointer());
  3286. END;
  3287. ReleaseIntermediateOperand(size);
  3288. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3289. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3290. Emit (Push(position, dest));
  3291. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3292. ELSE HALT(100); (* missing ? *)
  3293. END;
  3294. END CallResetProcedure;
  3295. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3296. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3297. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3298. VAR operand: Operand;
  3299. BEGIN
  3300. Symbol (symbol, operand);
  3301. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3302. ReleaseOperand(operand);
  3303. END Reset;
  3304. BEGIN
  3305. previousScope := currentScope;
  3306. currentScope := scope;
  3307. pc := section.pc;
  3308. prevOffset := MAX(SIZE);
  3309. variable := scope.firstVariable;
  3310. WHILE variable # NIL DO
  3311. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3312. Reset (variable);
  3313. prevOffset := variable.offsetInBits;
  3314. END;
  3315. variable := variable.nextVariable;
  3316. END;
  3317. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3318. WHILE parameter # NIL DO
  3319. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3320. Reset (parameter);
  3321. END;
  3322. parameter := parameter.nextParameter;
  3323. END;
  3324. INC(statCoopResetVariables, section.pc - pc);
  3325. currentScope := previousScope;
  3326. END ResetVariables;
  3327. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3328. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3329. BEGIN
  3330. type := symbol.type.resolved;
  3331. SaveRegisters();ReleaseUsedRegisters(saved);
  3332. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3333. Symbol(symbol, operand);
  3334. ToMemory(operand.op,addressType,0);
  3335. Emit(Push(position,operand.op));
  3336. IF refer THEN
  3337. CallThis(position,"Heaps","Refer",1);
  3338. ELSE
  3339. CallThis(position,"Heaps","Reset",1);
  3340. END;
  3341. ELSIF type.IsRecordType() THEN
  3342. Symbol(symbol, operand);
  3343. Emit(Push(position,operand.op));
  3344. Emit(Push(position,operand.tag)); (* type desc *)
  3345. IF refer THEN
  3346. CallThis(position,"Heaps","ReferRecord",2);
  3347. ELSE
  3348. CallThis(position,"Heaps","ResetRecord",2);
  3349. END;
  3350. ELSIF IsStaticArray(type) THEN
  3351. size := StaticArrayNumElements(type);
  3352. base := StaticArrayBaseType(type);
  3353. Symbol(symbol, operand);
  3354. arg := TypeDescriptorAdr(base);
  3355. Emit(Push(position,operand.op));
  3356. Emit(Push(position,arg));
  3357. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3358. ReleaseIntermediateOperand(arg);
  3359. IF refer THEN
  3360. CallThis(position,"Heaps","ReferArray",3);
  3361. ELSE
  3362. CallThis(position,"Heaps","ResetArray",3);
  3363. END;
  3364. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3365. size := StaticMathArrayNumElements(type);
  3366. base := StaticMathArrayBaseType(type);
  3367. Symbol(symbol, operand);
  3368. arg := TypeDescriptorAdr(base);
  3369. Emit(Push(position,operand.op));
  3370. Emit(Push(position,arg));
  3371. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3372. ReleaseIntermediateOperand(arg);
  3373. IF refer THEN
  3374. CallThis(position,"Heaps","ReferArray",3);
  3375. ELSE
  3376. CallThis(position,"Heaps","ResetArray",3);
  3377. END;
  3378. ELSIF type IS SyntaxTree.MathArrayType THEN
  3379. Symbol(symbol, operand);
  3380. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3381. Emit (Push(position, operand.op));
  3382. ELSE
  3383. Emit (Push(position, operand.tag));
  3384. END;
  3385. IF refer THEN
  3386. CallThis(position,"Heaps","ReferMathArray", 1);
  3387. ELSE
  3388. CallThis(position,"Heaps","ResetMathArray", 1);
  3389. END;
  3390. ELSIF type IS SyntaxTree.ProcedureType THEN
  3391. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3392. Symbol(symbol, operand);
  3393. Emit (Push(position, operand.tag));
  3394. IF refer THEN
  3395. CallThis(position,"Heaps","Refer", 1);
  3396. ELSE
  3397. CallThis(position,"Heaps","Reset", 1);
  3398. END;
  3399. ELSE HALT(100); (* missing ? *)
  3400. END;
  3401. ReleaseOperand(operand);
  3402. RestoreRegisters(saved);
  3403. END Reset;
  3404. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3405. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3406. BEGIN
  3407. previousScope := currentScope;
  3408. currentScope := scope;
  3409. pc := section.pc;
  3410. IF ~ refer THEN
  3411. variable := scope.firstVariable;
  3412. prevOffset := MAX(SIZE);
  3413. WHILE variable # NIL DO
  3414. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3415. Reset (variable,refer);
  3416. prevOffset := variable.offsetInBits;
  3417. END;
  3418. variable := variable.nextVariable;
  3419. END;
  3420. END;
  3421. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3422. WHILE parameter # NIL DO
  3423. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3424. Reset (parameter,refer);
  3425. END;
  3426. parameter := parameter.nextParameter;
  3427. END;
  3428. INC(statCoopResetVariables, section.pc - pc);
  3429. currentScope := previousScope;
  3430. END ResetVariables2;
  3431. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3432. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; context: Context;
  3433. BEGIN
  3434. GetCodeSectionNameForSymbol(procedure, name);
  3435. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3436. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3437. IF dump # NIL THEN dump := section.comments END;
  3438. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3439. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3440. Emit(Data(position,op));
  3441. Emit(Data(position,nil));
  3442. IF HasPointers (procedure.procedureScope) THEN
  3443. GetCodeSectionNameForSymbol(procedure, name);
  3444. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3445. ELSE
  3446. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3447. END;
  3448. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3449. Emit(Data(position,op));
  3450. ReturnToContext(context);
  3451. IF dump # NIL THEN dump := section.comments END;
  3452. END CreateProcedureDescriptor;
  3453. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3454. VAR import: SyntaxTree.Import;
  3455. s: Basic.MessageString;
  3456. selfName: SyntaxTree.IdentifierString;
  3457. BEGIN
  3458. moduleScope.ownerModule.GetName(selfName);
  3459. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3460. module := moduleScope.ownerModule
  3461. ELSE
  3462. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3463. IF import = NIL THEN
  3464. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3465. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3466. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3467. s := "Module ";
  3468. Strings.Append(s,moduleName);
  3469. Strings.Append(s," cannot be imported.");
  3470. IF force THEN
  3471. Error(position,s);
  3472. ELSIF canBeLoaded THEN
  3473. IF WarningDynamicLoading THEN
  3474. Strings.Append(s, "=> no dynamic linking.");
  3475. Warning(position, s);
  3476. END;
  3477. canBeLoaded := FALSE;
  3478. END;
  3479. RETURN FALSE
  3480. ELSE
  3481. SELF.module.imports.AddName(moduleName)
  3482. END;
  3483. ELSIF import.module = NIL THEN (* already tried *)
  3484. RETURN FALSE
  3485. END;
  3486. module := import.module;
  3487. END;
  3488. RETURN TRUE
  3489. END AddImport;
  3490. (* needed for old binary object file format*)
  3491. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3492. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: Basic.Fingerprint;
  3493. BEGIN
  3494. IF AddImport(moduleName,module,TRUE) THEN
  3495. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3496. IF procedure = NIL THEN
  3497. s := "Instruction not supported on target, emulation procedure ";
  3498. Strings.Append(s,moduleName);
  3499. Strings.Append(s,".");
  3500. Strings.Append(s,procedureName);
  3501. Strings.Append(s," not present");
  3502. Error(position,s);
  3503. ELSE
  3504. StaticCallOperand(r,procedure);
  3505. ReleaseOperand(r);
  3506. fp := GetFingerprint(procedure);
  3507. END;
  3508. END;
  3509. END EnsureSymbol;
  3510. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3511. VAR trueL, exitL: Label; op: Operand;
  3512. BEGIN
  3513. InitOperand(op,ModeValue);
  3514. trueL := NewLabel();
  3515. exitL := NewLabel();
  3516. Condition(x,trueL,TRUE);
  3517. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3518. Emit(Mov(position,op.op,false));
  3519. BrL(exitL);
  3520. SetLabel(trueL);
  3521. Emit(MovReplace(position,op.op,true));
  3522. SetLabel(exitL);
  3523. RETURN op;
  3524. END ConditionValue;
  3525. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3526. VAR size: LONGINT;
  3527. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3528. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3529. BEGIN
  3530. ASSERT(type.form = SyntaxTree.Open);
  3531. baseType := type.arrayBase.resolved;
  3532. IF IsOpenArray(baseType) THEN
  3533. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3534. ELSE
  3535. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3536. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3537. END;
  3538. len := tag;
  3539. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3540. IntermediateCode.MakeMemory(len,addressType);
  3541. UseIntermediateOperand(len);
  3542. Reuse2(res,sizeOperand,len);
  3543. Emit(Mul(position,res,sizeOperand,len));
  3544. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3545. RETURN res
  3546. END GetArraySize;
  3547. BEGIN
  3548. type := type.resolved;
  3549. IF IsOpenArray(type) THEN
  3550. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3551. RETURN tag
  3552. ELSE
  3553. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3554. END;
  3555. ELSE
  3556. size := ToMemoryUnits(system,system.SizeOf(type));
  3557. RETURN IntermediateCode.Immediate(addressType,size)
  3558. END;
  3559. END GetDynamicSize;
  3560. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3561. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3562. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3563. BEGIN
  3564. ASSERT(type.form = SyntaxTree.Open);
  3565. baseType := type.arrayBase.resolved;
  3566. IF IsOpenArray(baseType) THEN
  3567. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3568. ELSE
  3569. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3570. END;
  3571. len := tag;
  3572. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3573. IntermediateCode.MakeMemory(len,addressType);
  3574. UseIntermediateOperand(len);
  3575. Reuse2(res,sizeOperand,len);
  3576. Emit(Mul(position,res,sizeOperand,len));
  3577. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3578. RETURN res
  3579. END GetLength;
  3580. BEGIN
  3581. type := type.resolved;
  3582. IF IsOpenArray(type) THEN
  3583. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3584. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3585. ELSIF type IS SyntaxTree.StringType THEN
  3586. RETURN tag;
  3587. ELSE
  3588. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3589. END;
  3590. END GetArrayLength;
  3591. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3592. VAR result: IntermediateCode.Operand;
  3593. BEGIN
  3594. IF backend.cooperative THEN
  3595. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3596. ELSE
  3597. MakeMemory(result, tag, addressType, 0);
  3598. END;
  3599. RETURN result
  3600. END GetSizeFromTag;
  3601. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3602. VAR parameter: SyntaxTree.Parameter;
  3603. BEGIN
  3604. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3605. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3606. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3607. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3608. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3609. END;
  3610. RETURN GetDynamicSize(e.type, tag);
  3611. END GetArrayOfBytesSize;
  3612. (*
  3613. to find imported symbol. not needed ?
  3614. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3615. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3616. BEGIN
  3617. IF AddImport(moduleName,importedModule,FALSE) THEN
  3618. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3619. RETURN symbol
  3620. ELSE
  3621. RETURN NIL
  3622. END
  3623. END SymbolByName;
  3624. *)
  3625. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3626. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3627. BEGIN
  3628. IF AddImport(moduleName,runtimeModule,force) THEN
  3629. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3630. IF procedure = NIL THEN
  3631. s := "Procedure ";
  3632. Strings.Append(s,moduleName);
  3633. Strings.Append(s,".");
  3634. Strings.Append(s,procedureName);
  3635. Strings.Append(s," not present");
  3636. Error(position,s);
  3637. RETURN FALSE
  3638. ELSE
  3639. RETURN TRUE
  3640. END;
  3641. ELSE RETURN FALSE
  3642. END;
  3643. END GetRuntimeProcedure;
  3644. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3645. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3646. s: Basic.MessageString;
  3647. BEGIN
  3648. Basic.InitSegmentedName(name);
  3649. name[0] := Basic.MakeString(moduleName);
  3650. name[1] := Basic.MakeString(typeName);
  3651. name[2] := -1;
  3652. IF AddImport(moduleName,importedModule, FALSE) THEN
  3653. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3654. IF symbol = NIL THEN
  3655. s := "type ";
  3656. Strings.Append(s,moduleName);
  3657. Strings.Append(s,".");
  3658. Strings.Append(s,typeName);
  3659. Strings.Append(s," not present");
  3660. Error(position,s);
  3661. END;
  3662. ELSE symbol := NIL;
  3663. END;
  3664. IF importedModule = moduleScope.ownerModule THEN
  3665. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3666. ELSE
  3667. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3668. END;
  3669. RETURN symbol
  3670. END GetTypeDescriptor;
  3671. (* 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. *)
  3672. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3673. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3674. pooledName: Basic.SegmentedName; size: LONGINT;
  3675. BEGIN
  3676. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3677. StaticCallOperand(result,procedure);
  3678. IF numberParameters < 0 THEN
  3679. size := ProcParametersSize(procedure);
  3680. ELSE
  3681. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3682. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3683. Error(position,"runtime call parameter count mismatch");
  3684. END;
  3685. END;
  3686. Emit(Call(position, result.op, size));
  3687. ReleaseOperand(result);
  3688. ELSE (* only static linking possible *)
  3689. ASSERT(numberParameters >= 0);
  3690. Basic.InitSegmentedName(pooledName);
  3691. pooledName[0] := Basic.MakeString(moduleName);
  3692. pooledName[1] := Basic.MakeString(procedureName);
  3693. pooledName[2] := -1;
  3694. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3695. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3696. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3697. END;
  3698. END CallThisChecked;
  3699. (* 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. *)
  3700. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3701. BEGIN
  3702. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3703. END CallThis;
  3704. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3705. VAR
  3706. left,right: Operand;
  3707. leftSize, rightSize: IntermediateCode.Operand;
  3708. saved: RegisterEntry;
  3709. reg: IntermediateCode.Operand;
  3710. procedureName: SyntaxTree.IdentifierString;
  3711. BEGIN
  3712. procedureName := "CompareString";
  3713. SaveRegisters();ReleaseUsedRegisters(saved);
  3714. Designate(leftExpression,left);
  3715. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3716. Emit(Push(position,leftSize));
  3717. ReleaseIntermediateOperand(leftSize);
  3718. Emit(Push(position,left.op));
  3719. ReleaseOperand(left);
  3720. Designate(rightExpression,right);
  3721. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3722. Emit(Push(position,rightSize));
  3723. ReleaseIntermediateOperand(rightSize);
  3724. Emit(Push(position,right.op));
  3725. ReleaseOperand(right);
  3726. CallThis(position,builtinsModuleName,procedureName, 4);
  3727. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3728. Emit(Result(position,reg));
  3729. RestoreRegisters(saved);
  3730. br(label,reg,IntermediateCode.Immediate(int8,0));
  3731. ReleaseIntermediateOperand(reg);
  3732. END CompareString;
  3733. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3734. VAR
  3735. left,right: Operand;
  3736. leftSize, rightSize: IntermediateCode.Operand;
  3737. saved: RegisterEntry;
  3738. procedureName: SyntaxTree.IdentifierString;
  3739. BEGIN
  3740. procedureName := "CopyString";
  3741. SaveRegisters();ReleaseUsedRegisters(saved);
  3742. Designate(leftExpression,left);
  3743. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3744. Emit(Push(position,leftSize));
  3745. ReleaseIntermediateOperand(leftSize);
  3746. Emit(Push(position,left.op));
  3747. ReleaseOperand(left);
  3748. Designate(rightExpression,right);
  3749. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3750. Emit(Push(position,rightSize));
  3751. ReleaseIntermediateOperand(rightSize);
  3752. Emit(Push(position,right.op));
  3753. ReleaseOperand(right);
  3754. CallThis(position,builtinsModuleName,procedureName,4);
  3755. RestoreRegisters(saved);
  3756. END CopyString;
  3757. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3758. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3759. leftType,rightType: SyntaxTree.Type;
  3760. leftExpression,rightExpression : SyntaxTree.Expression;
  3761. componentType: IntermediateCode.Type;
  3762. exit: Label; dest: IntermediateCode.Operand;
  3763. size: LONGINT;
  3764. BEGIN
  3765. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3766. dest := destination; destination := emptyOperand;
  3767. leftType := x.left.type.resolved;
  3768. rightType := x.right.type.resolved;
  3769. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3770. CASE x.operator OF
  3771. Scanner.Or, Scanner.And, Scanner.Is:
  3772. result := ConditionValue(x);
  3773. |Scanner.Plus:
  3774. Evaluate(x.left,left);
  3775. Evaluate(x.right,right);
  3776. IF leftType IS SyntaxTree.SetType THEN
  3777. InitOperand(result,ModeValue);
  3778. Reuse2a(result.op,left.op,right.op,dest);
  3779. Emit(Or(position,result.op,left.op,right.op));
  3780. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3781. InitOperand(result,ModeValue);
  3782. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3783. Reuse2(result.tag,left.tag,right.tag);
  3784. Emit(Add(position,result.op,left.op,right.op));
  3785. Emit(Add(position,result.tag,left.tag,right.tag))
  3786. ELSE
  3787. InitOperand(result,ModeValue);
  3788. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3789. AddInt(result.op, left.op, right.op) ;
  3790. ELSE
  3791. *)
  3792. Reuse2a(result.op,left.op,right.op,dest);
  3793. Emit(Add(position,result.op,left.op,right.op));
  3794. (*
  3795. END;
  3796. *)
  3797. END;
  3798. ReleaseOperand(left); ReleaseOperand(right);
  3799. |Scanner.Minus:
  3800. Evaluate(x.left,left);
  3801. Evaluate(x.right,right);
  3802. IF leftType IS SyntaxTree.SetType THEN
  3803. InitOperand(result,ModeValue);
  3804. Reuse1(result.op,right.op);
  3805. Emit(Not(position,result.op,right.op));
  3806. ReleaseOperand(right);
  3807. Emit(And(position,result.op,result.op,left.op));
  3808. ReleaseOperand(left);
  3809. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3810. InitOperand(result,ModeValue);
  3811. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3812. Reuse2(result.tag,left.tag,right.tag);
  3813. Emit(Sub(position,result.op,left.op,right.op));
  3814. Emit(Sub(position,result.tag,left.tag,right.tag));
  3815. ReleaseOperand(left); ReleaseOperand(right)
  3816. ELSE
  3817. InitOperand(result,ModeValue);
  3818. Reuse2a(result.op,left.op,right.op,dest);
  3819. Emit(Sub(position,result.op,left.op,right.op));
  3820. ReleaseOperand(left); ReleaseOperand(right);
  3821. END;
  3822. |Scanner.Times:
  3823. Evaluate(x.left,left);
  3824. Evaluate(x.right,right);
  3825. IF leftType IS SyntaxTree.SetType THEN
  3826. InitOperand(result,ModeValue);
  3827. Reuse2a(result.op,left.op,right.op,dest);
  3828. Emit(And(position,result.op,left.op,right.op));
  3829. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3830. InitOperand(result, ModeValue);
  3831. componentType := left.op.type;
  3832. (* TODO: review this *)
  3833. (*
  3834. result.op = left.op * right.op - left.tag * right.tag
  3835. result.tag = left.tag * right.op + left.op * right.tag
  3836. *)
  3837. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3838. Emit(Mul(position,result.op, left.op, right.op));
  3839. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3840. Emit(Mul(position,tempReg, left.tag, right.tag));
  3841. Emit(Sub(position,result.op, result.op, tempReg));
  3842. Reuse2(result.tag, left.tag, right.op);
  3843. Emit(Mul(position,result.tag, left.tag, right.op));
  3844. Emit(Mul(position,tempReg, left.op, right.tag));
  3845. Emit(Add(position,result.tag, result.tag, tempReg));
  3846. ReleaseIntermediateOperand(tempReg)
  3847. ELSE
  3848. InitOperand(result,ModeValue);
  3849. Reuse2a(result.op,left.op,right.op,dest);
  3850. Emit(Mul(position,result.op,left.op,right.op));
  3851. END;
  3852. ReleaseOperand(left); ReleaseOperand(right);
  3853. |Scanner.Div:
  3854. Evaluate(x.left,left);
  3855. Evaluate(x.right,right);
  3856. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3857. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3858. IF ~isUnchecked THEN
  3859. exit := NewLabel();
  3860. BrltL(exit,zero,right.op);
  3861. EmitTrap(position,NegativeDivisorTrap);
  3862. SetLabel(exit);
  3863. END;
  3864. END;
  3865. InitOperand(result,ModeValue);
  3866. Reuse2a(result.op,left.op,right.op,dest);
  3867. Emit(Div(position,result.op,left.op,right.op));
  3868. ReleaseOperand(left); ReleaseOperand(right);
  3869. |Scanner.Mod:
  3870. Evaluate(x.left,left);
  3871. Evaluate(x.right,right);
  3872. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3873. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3874. IF ~isUnchecked THEN
  3875. exit := NewLabel();
  3876. BrltL(exit,zero,right.op);
  3877. EmitTrap(position,NegativeDivisorTrap);
  3878. SetLabel(exit);
  3879. END;
  3880. END;
  3881. InitOperand(result,ModeValue);
  3882. Reuse2a(result.op,left.op,right.op,dest);
  3883. Emit(Mod(position,result.op,left.op,right.op));
  3884. ReleaseOperand(left); ReleaseOperand(right);
  3885. |Scanner.Slash:
  3886. Evaluate(x.left,left);
  3887. Evaluate(x.right,right);
  3888. IF leftType IS SyntaxTree.SetType THEN
  3889. InitOperand(result,ModeValue);
  3890. Reuse2a(result.op,left.op,right.op,dest);
  3891. Emit(Xor(position,result.op,left.op,right.op));
  3892. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3893. InitOperand(result,ModeValue);
  3894. componentType := left.op.type;
  3895. (* review this *)
  3896. (*
  3897. divisor = right.op * right.op + right.tag * right.tag
  3898. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3899. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3900. *)
  3901. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3902. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3903. Emit(Mul(position,tempReg, right.op, right.op));
  3904. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3905. Emit(Add(position,tempReg, tempReg, tempReg2));
  3906. result.op := tempReg2;
  3907. Emit(Mul(position,result.op, left.op, right.op));
  3908. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3909. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3910. Emit(Add(position,result.op, result.op, tempReg2));
  3911. Emit(Div(position,result.op, result.op, tempReg));
  3912. Reuse2(result.tag, left.tag, right.op);
  3913. Emit(Mul(position,result.tag, left.tag, right.op));
  3914. Emit(Mul(position,tempReg2, left.op, right.tag));
  3915. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3916. Emit(Div(position,result.tag, result.tag, tempReg));
  3917. ReleaseIntermediateOperand(tempReg);
  3918. ReleaseIntermediateOperand(tempReg2)
  3919. ELSE
  3920. InitOperand(result,ModeValue);
  3921. Reuse2a(result.op,left.op,right.op,dest);
  3922. Emit(Div(position,result.op,left.op,right.op));
  3923. END;
  3924. ReleaseOperand(left); ReleaseOperand(right);
  3925. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3926. result := ConditionValue(x);
  3927. |Scanner.In:
  3928. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3929. Evaluate(x.left,left);
  3930. Evaluate(x.right,right);
  3931. Convert(left.op,setType);
  3932. Convert(right.op,setType);
  3933. ReuseCopy(temp.op,right.op);
  3934. Emit(Shr(position,temp.op,temp.op,left.op));
  3935. ReleaseOperand(right); ReleaseOperand(left);
  3936. IntermediateCode.InitImmediate(one,setType,1);
  3937. Emit(And(position,temp.op,temp.op,one));
  3938. Convert(temp.op,bool);
  3939. result.mode := ModeValue;
  3940. result.op := temp.op;
  3941. result.tag := nil; (* may be left over from calls to evaluate *)
  3942. ELSE
  3943. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3944. IF x.operator = Scanner.Questionmarks THEN
  3945. leftExpression := x.left;
  3946. rightExpression := x.right;
  3947. ELSE
  3948. leftExpression := x.right;
  3949. rightExpression := x.left;
  3950. END;
  3951. Evaluate(leftExpression, left);
  3952. Emit(Push(position,left.op));
  3953. ReleaseOperand(left);
  3954. Designate(rightExpression, right);
  3955. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3956. IF ~backend.cellsAreObjects THEN
  3957. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3958. END;
  3959. Emit(Push(position,right.op));
  3960. ReleaseOperand(right);
  3961. IF backend.cellsAreObjects THEN
  3962. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3963. ELSE
  3964. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3965. END;
  3966. InitOperand(result, ModeValue);
  3967. result.op := NewRegisterOperand(bool);
  3968. Emit(Result(position,result.op));
  3969. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3970. leftExpression := x.left;
  3971. rightExpression := x.right;
  3972. Evaluate(leftExpression, left);
  3973. Emit(Push(position,left.op));
  3974. ReleaseOperand(left);
  3975. Evaluate(rightExpression, right);
  3976. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3977. IF ~backend.cellsAreObjects THEN
  3978. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3979. END;
  3980. Emit(Push(position,right.op));
  3981. ReleaseOperand(right);
  3982. IF backend.cellsAreObjects THEN
  3983. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3984. ELSE
  3985. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3986. END;
  3987. InitOperand(result, ModeValue);
  3988. result.op := NewRegisterOperand(bool);
  3989. Emit(Result(position,result.op));
  3990. ELSE
  3991. HALT(100);
  3992. END;
  3993. END;
  3994. destination := dest;
  3995. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3996. END VisitBinaryExpression;
  3997. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3998. VAR localResult, operand: Operand;
  3999. BEGIN
  4000. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4001. InitOperand(localResult, ModeValue);
  4002. ASSERT(x.first # NIL);
  4003. Evaluate(x.first, operand);
  4004. localResult.op := operand.op;
  4005. ReleaseOperand(operand);
  4006. UseIntermediateOperand(localResult.op);
  4007. ASSERT(x.last # NIL);
  4008. Evaluate(x.last, operand);
  4009. localResult.tag := operand.op;
  4010. ReleaseOperand(operand);
  4011. UseIntermediateOperand(localResult.tag);
  4012. IF x.step # NIL THEN
  4013. Evaluate(x.step, operand);
  4014. localResult.extra := operand.op;
  4015. ReleaseOperand(operand);
  4016. UseIntermediateOperand(localResult.extra);
  4017. END;
  4018. result := localResult;
  4019. IF Trace THEN TraceExit("VisitRangeExpression") END
  4020. END VisitRangeExpression;
  4021. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4022. BEGIN
  4023. HALT(100); (* should never be evaluated *)
  4024. END VisitTensorRangeExpression;
  4025. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4026. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4027. BEGIN
  4028. IF Trace THEN TraceEnter("VisitConversion") END;
  4029. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4030. dest := destination; destination := emptyOperand;
  4031. Evaluate(x.expression,old);
  4032. InitOperand(result,ModeValue);
  4033. result.op := old.op;
  4034. ASSERT(result.op.mode # 0);
  4035. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4036. (* convert TO a complex number *)
  4037. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4038. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4039. ASSERT(result.op.mode # 0);
  4040. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4041. (* convert FROM a complex number TO a complex number*)
  4042. result.tag := old.tag;
  4043. ASSERT(result.tag.mode # 0);
  4044. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4045. ASSERT(result.tag.mode # 0)
  4046. ELSE
  4047. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4048. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4049. END
  4050. ELSE
  4051. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4052. ASSERT(result.op.mode # 0);
  4053. result.tag := old.tag; (*! probably never used *)
  4054. END;
  4055. destination := dest;
  4056. IF Trace THEN TraceExit("VisitConversion") END;
  4057. END VisitConversion;
  4058. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4059. BEGIN
  4060. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4061. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4062. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4063. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4064. END VisitTypeDeclaration;
  4065. (** designators (expressions) *)
  4066. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4067. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4068. BEGIN
  4069. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4070. IF x.left # NIL THEN Expression(x.left) END;
  4071. Symbol(x.symbol,result);
  4072. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4073. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4074. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4075. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4076. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4077. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4078. END;
  4079. END;
  4080. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4081. END VisitSymbolDesignator;
  4082. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4083. BEGIN
  4084. IF isUnchecked THEN RETURN END;
  4085. IF tagsAvailable THEN
  4086. TrapC(BrltL,index,length,IndexCheckTrap);
  4087. END;
  4088. END BoundCheck;
  4089. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4090. VAR d: IntermediateCode.Operand;
  4091. BEGIN
  4092. IF isUnchecked THEN RETURN END;
  4093. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4094. TrapC(op,dim,d,ArraySizeTrap);
  4095. ReleaseIntermediateOperand(d);
  4096. END DimensionCheck;
  4097. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4098. VAR
  4099. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4100. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4101. expression: SyntaxTree.Expression;
  4102. resultingType, leftType, baseType: SyntaxTree.Type;
  4103. skipLabel1: Label;
  4104. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4105. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4106. variableOp: Operand;
  4107. variable: SyntaxTree.Variable;
  4108. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4109. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4110. VAR e: SyntaxTree.Expression; i: LONGINT;
  4111. BEGIN
  4112. tensorFound := FALSE;
  4113. FOR i := 0 TO parameters.Length()-1 DO
  4114. e := parameters.GetExpression(i);
  4115. IF e IS SyntaxTree.TensorRangeExpression THEN
  4116. ASSERT(~tensorFound);
  4117. tensorFound := TRUE;
  4118. ELSIF e IS SyntaxTree.RangeExpression THEN
  4119. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4120. ELSE
  4121. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4122. END;
  4123. END;
  4124. END CountIndices;
  4125. BEGIN
  4126. ASSERT(tagsAvailable);
  4127. resultingType := x.type.resolved; (* resulting type *)
  4128. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4129. InitOperand(localResult, ModeReference);
  4130. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4131. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4132. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4133. (* a globally defined array destination tag is available -> use and invalidate it*)
  4134. localResult.tag := arrayDestinationTag;
  4135. IntermediateCode.InitOperand(arrayDestinationTag)
  4136. ELSE
  4137. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4138. (* the result is of array range type and thus does not provide any collectable pointers *)
  4139. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4140. Symbol(variable, variableOp);
  4141. ReuseCopy(localResult.tag, variableOp.op);
  4142. ReleaseOperand(variableOp);
  4143. END
  4144. END;
  4145. indexListSize := x.parameters.Length();
  4146. CountIndices(x.parameters);
  4147. (*ASSERT(tensorRangeCount <= 1);*)
  4148. (* designate the array to be indexed over, perform tensor range check if known *)
  4149. Designate(x.left, array);
  4150. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4151. Dereference(array, leftType,FALSE);
  4152. IF ~tensorFound THEN
  4153. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4154. END
  4155. END;
  4156. (* default base offset *)
  4157. srcDimOffset := 0;
  4158. destDimOffset := 0;
  4159. indexDim := 0;
  4160. (* use address of source array as basis *)
  4161. localResult.op := array.op;
  4162. UseIntermediateOperand(localResult.op);
  4163. (* go through the index list *)
  4164. FOR i := 0 TO indexListSize - 1 DO
  4165. expression := x.parameters.GetExpression(i);
  4166. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4167. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4168. srcDimOffset := -indexListSize;
  4169. destDimOffset := -suffixRanges;
  4170. ELSE
  4171. (* determine which dimension of source array is currently looked at *)
  4172. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4173. (* get the memory operand pointing to array descriptor dimension *)
  4174. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4175. (* make a reusable register from it *)
  4176. ReuseCopy(srcDim, tmp);
  4177. ReleaseIntermediateOperand(tmp);
  4178. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4179. ELSE
  4180. srcDim := IntermediateCode.Immediate(sizeType, i);
  4181. END;
  4182. (* get length and increment of source array for current dimension *)
  4183. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4184. Convert(sourceLength.op, sizeType);
  4185. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4186. Convert(sourceIncrement.op, sizeType);
  4187. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4188. ReleaseIntermediateOperand(srcDim);
  4189. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4190. (* SINGLE INDEX *)
  4191. Evaluate(expression, index);
  4192. ReleaseIntermediateOperand(index.tag);
  4193. index.tag := emptyOperand;
  4194. Convert(index.op, sizeType);
  4195. (* lower bound check *)
  4196. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4197. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4198. ELSIF isUnchecked THEN (* do nothing *)
  4199. ELSE
  4200. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4201. END;
  4202. (* upper bound check *)
  4203. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4204. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4205. ELSIF isUnchecked THEN (* do nothing *)
  4206. ELSE
  4207. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4208. END;
  4209. ReleaseOperand(sourceLength);
  4210. Convert(index.op, addressType);
  4211. summand := index.op;
  4212. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4213. (* RANGE OF INDICES *)
  4214. Evaluate(expression, range);
  4215. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4216. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4217. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4218. ReleaseOperand(range);
  4219. Convert(firstIndex, sizeType);
  4220. Convert(lastIndex, sizeType);
  4221. Convert(stepSize, sizeType);
  4222. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4223. if it is 'MAX(LONGINT)' *)
  4224. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4225. TransferToRegister(lastIndex, lastIndex);
  4226. skipLabel1 := NewLabel();
  4227. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4228. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4229. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4230. SetLabel(skipLabel1)
  4231. END;
  4232. (* check if step size is valid *)
  4233. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4234. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4235. ELSIF isUnchecked THEN (* do nothing *)
  4236. ELSE
  4237. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4238. END;
  4239. (* check lower bound check *)
  4240. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4241. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4242. ELSIF isUnchecked THEN (* do nothing *)
  4243. ELSE
  4244. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4245. END;
  4246. (* check upper bound check *)
  4247. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4248. (* statically open range: nothing to do *)
  4249. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4250. ASSERT(staticLastIndex < staticSourceLength)
  4251. ELSIF isUnchecked THEN (* do nothing *)
  4252. ELSE
  4253. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4254. END;
  4255. (* determine length of target array for current dimension *)
  4256. (* 1. incorporate last index: *)
  4257. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4258. (* last index is static *)
  4259. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4260. targetLength := sourceLength.op
  4261. ELSE
  4262. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4263. END;
  4264. UseIntermediateOperand(targetLength);
  4265. ELSE
  4266. (* targetLength := lastIndex + 1
  4267. Reuse1(targetLength, lastIndex);
  4268. *)
  4269. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4270. END;
  4271. ReleaseOperand(sourceLength);
  4272. ReleaseIntermediateOperand(lastIndex);
  4273. (* 2. incorporate first index: *)
  4274. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4275. (* first index and current target length are static *)
  4276. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4277. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4278. (* first index = 0: nothing to do *)
  4279. ELSE
  4280. (* targetLength := targetLength - firstIndex *)
  4281. TransferToRegister(targetLength, targetLength);
  4282. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4283. END;
  4284. (* clip negative lengths to 0 *)
  4285. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4286. IF staticTargetLength < 0 THEN
  4287. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4288. END
  4289. ELSE
  4290. skipLabel1 := NewLabel();
  4291. TransferToRegister(targetLength, targetLength);
  4292. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4293. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4294. SetLabel(skipLabel1)
  4295. END;
  4296. (* 3. incorporate index step size: *)
  4297. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4298. (*step size and current target length are static *)
  4299. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4300. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4301. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4302. (* step size = 1: nothing to do *)
  4303. ELSE
  4304. (* emit code for this:
  4305. targetLength := (targetLength-1) DIV stepSize +1;
  4306. *)
  4307. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4308. DivInt(targetLength, targetLength, stepSize);
  4309. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4310. END;
  4311. (* determine increment of target array for current dimension *)
  4312. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4313. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4314. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4315. (* step size = 1 *)
  4316. targetIncrement := sourceIncrement.op;
  4317. UseIntermediateOperand(targetIncrement)
  4318. ELSE
  4319. (* targetIncrement := sourceIncrement * stepSize *)
  4320. Reuse1(targetIncrement, stepSize);
  4321. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4322. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4323. END;
  4324. ReleaseIntermediateOperand(stepSize);
  4325. (* write length and increment of target array to descriptor *)
  4326. IF destDimOffset < 0 THEN
  4327. (* determine which dimension of target array is currently looked at *)
  4328. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4329. TransferToRegister(destDim, tmp);
  4330. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4331. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4332. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4333. ReleaseIntermediateOperand(destDim);
  4334. INC(destDimOffset);
  4335. ELSE
  4336. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4337. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4338. END;
  4339. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4340. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4341. INC(indexDim);
  4342. Convert(firstIndex, addressType);
  4343. TransferToRegister(summand, firstIndex);
  4344. ELSE HALT(100);
  4345. END;
  4346. (*
  4347. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4348. *)
  4349. Convert(sourceIncrement.op, addressType);
  4350. Convert(summand, addressType);
  4351. MulInt(summand, summand, sourceIncrement.op);
  4352. ReleaseIntermediateOperand(sourceIncrement.op);
  4353. AddInt(localResult.op, localResult.op, summand);
  4354. ReleaseIntermediateOperand(summand);
  4355. END
  4356. END;
  4357. result := localResult;
  4358. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4359. ReleaseIntermediateOperand(result.tag);
  4360. result.tag := TypeDescriptorAdr(resultingType);
  4361. ELSIF IsDelegate(resultingType) THEN
  4362. ReleaseIntermediateOperand(result.tag);
  4363. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4364. UseIntermediateOperand(result.tag);
  4365. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4366. ReleaseIntermediateOperand(result.tag);
  4367. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4368. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4369. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4370. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4371. (* finalize target array descriptor *)
  4372. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4373. (* write lengths and increments of target array for remaining dimensions *)
  4374. i := indexListSize;
  4375. WHILE indexDim < targetArrayDimensionality DO
  4376. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4377. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4378. ReleaseOperand(sourceLength);
  4379. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4380. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4381. ReleaseOperand(sourceIncrement);
  4382. INC(i); INC(indexDim);
  4383. END;
  4384. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4385. tmp := nil;
  4386. ELSE
  4387. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4388. END;
  4389. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4390. ReleaseIntermediateOperand(tmp);
  4391. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4392. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4393. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4394. ELSE
  4395. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4396. END;
  4397. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4398. ReleaseIntermediateOperand(tmp);
  4399. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4400. (* write dimensionality *)
  4401. IF targetArrayDimensionality # 0 THEN
  4402. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4403. END;
  4404. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4405. END;
  4406. ReleaseOperand(array);
  4407. END MathIndexDesignator;
  4408. (* get the length of an array , trying to make use of static information *)
  4409. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4410. VAR res: IntermediateCode.Operand; size: LONGINT;
  4411. BEGIN
  4412. type := type.resolved;
  4413. IF type IS SyntaxTree.ArrayType THEN
  4414. WITH type: SyntaxTree.ArrayType DO
  4415. IF type.form = SyntaxTree.Static THEN
  4416. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4417. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4418. Evaluate(type.length, op);
  4419. ReleaseIntermediateOperand(op.tag);
  4420. RETURN op.op;*)
  4421. ELSE
  4422. res := tag;
  4423. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4424. IntermediateCode.MakeMemory(res,addressType);
  4425. UseIntermediateOperand(res);
  4426. RETURN res
  4427. END
  4428. END;
  4429. ELSE
  4430. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4431. RETURN IntermediateCode.Immediate(addressType,size);
  4432. END;
  4433. END ArrayLength;
  4434. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4435. BEGIN
  4436. IF IsImmediate(x) THEN
  4437. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4438. ELSE
  4439. IF ~ReusableRegister(res) THEN
  4440. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4441. ELSE
  4442. UseIntermediateOperand(res);
  4443. END;
  4444. Emit(Mov(position,res,x))
  4445. END;
  4446. END CopyInt;
  4447. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4448. BEGIN
  4449. ReleaseIntermediateOperand(res);
  4450. IF IsImmediate(x) & IsImmediate(y) THEN
  4451. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4452. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4453. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4454. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4455. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4456. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4457. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4458. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4459. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4460. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4461. UseIntermediateOperand(res);
  4462. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4463. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4464. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4465. UseIntermediateOperand(res);
  4466. ELSE
  4467. IF ~ReusableRegister(res) THEN
  4468. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4469. ELSE
  4470. UseIntermediateOperand(res);
  4471. END;
  4472. IF IsImmediate(x) & (x.intValue = 0) THEN
  4473. Emit(Mov(position,res,y))
  4474. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4475. Emit(Mov(position,res,x))
  4476. ELSE
  4477. Emit(Add(position,res, x, y));
  4478. END;
  4479. END;
  4480. END AddInt;
  4481. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4482. BEGIN
  4483. ReleaseIntermediateOperand(res);
  4484. IF IsImmediate(x) & IsImmediate(y) THEN
  4485. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4486. ELSE
  4487. IF ~ReusableRegister(res) THEN
  4488. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4489. ELSE UseIntermediateOperand(res);
  4490. END;
  4491. IF IsImmediate(x) & (x.intValue = 1) THEN
  4492. Emit(Mov(position,res,y))
  4493. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4494. Emit(Mov(position,res,x))
  4495. ELSE
  4496. Emit(Mul(position,res, x, y));
  4497. END;
  4498. END;
  4499. END MulInt;
  4500. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4501. BEGIN
  4502. ReleaseIntermediateOperand(res);
  4503. IF IsImmediate(x) & IsImmediate(y) THEN
  4504. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4505. ELSE
  4506. IF ~ReusableRegister(res) THEN
  4507. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4508. ELSE UseIntermediateOperand(res);
  4509. END;
  4510. IF IsImmediate(x) & (x.intValue = 1) THEN
  4511. Emit(Mov(position,res,y))
  4512. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4513. Emit(Mov(position,res,x))
  4514. ELSE
  4515. Emit(Div(position,res, x, y));
  4516. END;
  4517. END;
  4518. END DivInt;
  4519. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4520. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4521. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4522. BEGIN
  4523. type := x.left.type.resolved;
  4524. IF type IS SyntaxTree.StringType THEN
  4525. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4526. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4527. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4528. type := atype;
  4529. x.left.SetType(type);
  4530. END;
  4531. IntermediateCode.InitImmediate(res,addressType,0);
  4532. maxDim := x.parameters.Length()-1;
  4533. (*
  4534. computation rule:
  4535. a: ARRAY X,Y,Z OF Element with size S
  4536. a[i,j,k] -->
  4537. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4538. *)
  4539. FOR i := 0 TO maxDim DO
  4540. e := x.parameters.GetExpression(i);
  4541. Evaluate(e,index);
  4542. Convert(index.op,addressType);
  4543. AddInt(res, res, index.op);
  4544. IF i = 0 THEN
  4545. (*
  4546. ReuseCopy(res, index.op);
  4547. *)
  4548. Designate(x.left,array);
  4549. type := x.left.type.resolved;
  4550. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4551. Dereference(array, type, FALSE);
  4552. END;
  4553. (*
  4554. ELSE AddInt(res, res, index.op);
  4555. *)
  4556. END;
  4557. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4558. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4559. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4560. BoundCheck(index.op, length);
  4561. END;
  4562. ReleaseIntermediateOperand(length);
  4563. END;
  4564. ReleaseOperand(index);
  4565. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4566. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4567. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4568. MulInt(res,res,length);
  4569. END;
  4570. ReleaseIntermediateOperand(length);
  4571. END;
  4572. (* remaining open dimensions -- compute address *)
  4573. i := maxDim+1;
  4574. IF type IS SyntaxTree.ArrayType THEN
  4575. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4576. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4577. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4578. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4579. MulInt(res,res,length);
  4580. END;
  4581. ReleaseIntermediateOperand(length);
  4582. INC(i);
  4583. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4584. END;
  4585. END;
  4586. IF (type IS SyntaxTree.ArrayType) THEN
  4587. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4588. size := StaticSize(system, type);
  4589. IF size # 1 THEN
  4590. length := IntermediateCode.Immediate(addressType,size);
  4591. MulInt(res,res,length);
  4592. END;
  4593. ELSE
  4594. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4595. IF size # 1 THEN
  4596. length := IntermediateCode.Immediate(addressType,size);
  4597. MulInt(res,res,length);
  4598. END;
  4599. END;
  4600. END;
  4601. AddInt(res,res,array.op);
  4602. InitOperand(result,ModeReference);
  4603. result.op := res;
  4604. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4605. ReleaseIntermediateOperand(result.tag);
  4606. result.tag := TypeDescriptorAdr(type);
  4607. ELSIF IsDelegate(type) THEN
  4608. ReleaseIntermediateOperand(result.tag);
  4609. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4610. UseIntermediateOperand(result.tag);
  4611. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4612. ReleaseIntermediateOperand(result.tag);
  4613. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4614. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4615. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4616. END;
  4617. ReleaseOperand(array);
  4618. END IndexDesignator;
  4619. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4620. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4621. BEGIN
  4622. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4623. dest := destination; destination := emptyOperand;
  4624. type := x.left.type.resolved;
  4625. IF type IS SyntaxTree.MathArrayType THEN
  4626. MathIndexDesignator(x);
  4627. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4628. IndexDesignator(x);
  4629. END;
  4630. destination := dest;
  4631. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4632. END VisitIndexDesignator;
  4633. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4634. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4635. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4636. procedure: SyntaxTree.Procedure;
  4637. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4638. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4639. BEGIN
  4640. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4641. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4642. parameters := expression.parameters;
  4643. moduleName := "FoxArrayBase";
  4644. procedureName := "CopyDescriptor";
  4645. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4646. SaveRegisters();ReleaseUsedRegisters(saved);
  4647. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4648. IF procedure = NIL THEN
  4649. s := "procedure ";
  4650. Strings.Append(s,moduleName);
  4651. Strings.Append(s,".");
  4652. Strings.Append(s,procedureName);
  4653. Strings.Append(s," not present");
  4654. Error(position,s);
  4655. ELSE
  4656. (* push address of temporary variable *)
  4657. Symbol(variable,destOperand);
  4658. Emit(Push(position,destOperand.op));
  4659. ReleaseOperand(destOperand);
  4660. (* push src *)
  4661. Evaluate(expression.left,srcOperand);
  4662. (*
  4663. Dereference(srcOperand,expression.type.resolved);
  4664. Emit(Push(position,srcOperand.tag));
  4665. *)
  4666. Emit(Push(position,srcOperand.op));
  4667. ReleaseOperand(srcOperand);
  4668. tensorFound := FALSE;
  4669. FOR i := 0 TO parameters.Length()-1 DO
  4670. e := parameters.GetExpression(i);
  4671. IF e IS SyntaxTree.TensorRangeExpression THEN
  4672. tensorFound := TRUE;
  4673. ELSIF e IS SyntaxTree.RangeExpression THEN
  4674. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4675. ELSE
  4676. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4677. END;
  4678. END;
  4679. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4680. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4681. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4682. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4683. StaticCallOperand(procOp,procedure);
  4684. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4685. ReleaseOperand(procOp);
  4686. END;
  4687. RestoreRegisters(saved);
  4688. END;
  4689. RETURN variable
  4690. END PrepareTensorDescriptor;
  4691. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4692. VAR
  4693. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4694. operand, tmpOperand, variableOp, variable2Op: Operand;
  4695. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4696. variable, variable2: SyntaxTree.Variable;
  4697. dim, i, size: LONGINT;
  4698. (* TODO: needed? *)
  4699. oldArrayDestinationTag: IntermediateCode.Operand;
  4700. oldArrayDestinationDimension: LONGINT;
  4701. position: Position;
  4702. saved: RegisterEntry;
  4703. arrayFlags: SET;
  4704. m, n: LONGINT;
  4705. PROCEDURE Pass(op: IntermediateCode.Operand);
  4706. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4707. BEGIN
  4708. IF register >= 0 THEN
  4709. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4710. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4711. Emit(Mov(position,parameterRegister, op));
  4712. ELSE
  4713. Emit(Push(position,op))
  4714. END
  4715. END Pass;
  4716. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4717. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4718. BEGIN
  4719. formalType := formalType.resolved; actualType := actualType.resolved;
  4720. IF IsOpenArray(formalType)THEN
  4721. IF actualType IS SyntaxTree.StringType THEN
  4722. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4723. RETURN;
  4724. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4725. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4726. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4727. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4728. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4729. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4730. ELSE
  4731. tmp := baseReg;
  4732. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4733. IntermediateCode.MakeMemory(tmp,addressType);
  4734. Pass((tmp));
  4735. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4736. END;
  4737. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4738. END;
  4739. END PushArrayLens;
  4740. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4741. BEGIN
  4742. CASE size OF
  4743. |2: INCL(flags,Size2Flag);
  4744. |3: INCL(flags,Size3Flag);
  4745. |4: INCL(flags,Size4Flag);
  4746. |5: INCL(flags,Size5Flag);
  4747. |6: INCL(flags,Size6Flag);
  4748. |7: INCL(flags,Size7Flag);
  4749. |8: INCL(flags,Size8Flag);
  4750. END;
  4751. END SetSmallArraySizeFlag;
  4752. BEGIN
  4753. IF Trace THEN TraceEnter("PushParameter") END;
  4754. position := expression.position;
  4755. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4756. type := expression.type.resolved;
  4757. IF ~( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4758. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4759. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4760. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4761. ) THEN Printout.Info("type",type);
  4762. TRACE(position.start);
  4763. Printout.Info("parameter",parameter);
  4764. END;
  4765. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4766. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4767. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4768. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4769. );
  4770. (* TODO: needed? *)
  4771. oldArrayDestinationTag := arrayDestinationTag;
  4772. oldArrayDestinationDimension := arrayDestinationDimension;
  4773. IF IsArrayOfSystemByte(parameter.type) THEN
  4774. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4775. Designate(expression,operand);
  4776. ELSE
  4777. Evaluate(expression, tmpOperand);
  4778. (* array of system byte does not provide any pointers *)
  4779. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4780. Symbol(variable, operand);
  4781. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4782. Emit(Mov(position,tmp, tmpOperand.op));
  4783. ReleaseOperand(tmpOperand);
  4784. END;
  4785. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4786. ReleaseIntermediateOperand(operand.tag);
  4787. operand.tag := tmp;
  4788. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4789. Pass((operand.tag));
  4790. END;
  4791. Pass((operand.op));
  4792. ELSIF IsOpenArray(parameter.type) THEN
  4793. Designate(expression,operand);
  4794. baseReg := operand.tag;
  4795. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4796. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4797. END;
  4798. Pass((operand.op)); (* address of the array *)
  4799. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4800. (* case 1
  4801. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4802. *)
  4803. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4804. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4805. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4806. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4807. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4808. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4809. arrayDestinationTag := sp;
  4810. (* case 1b
  4811. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4812. *)
  4813. IF expression IS SyntaxTree.IndexDesignator THEN
  4814. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4815. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4816. arrayDestinationDimension := dim;
  4817. Designate(expression,operand);
  4818. (* case 1a
  4819. P(...,A,...) push: push array descriptor to stack
  4820. *)
  4821. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4822. Designate(expression,operand);
  4823. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4824. i := 0;
  4825. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4826. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4827. INC(i);
  4828. END;
  4829. type := expression.type.resolved;
  4830. WHILE (i<dim) DO (* remaining static dimensions *)
  4831. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4832. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4833. ReleaseOperand(tmpOperand);
  4834. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4835. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4836. ReleaseOperand(tmpOperand);
  4837. INC(i);
  4838. END;
  4839. dimOp := IntermediateCode.Immediate(addressType,dim);
  4840. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4841. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4842. (* case 1d
  4843. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4844. + case 1e
  4845. P(.. PT() ... );
  4846. *)
  4847. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4848. Designate(expression,operand);
  4849. Dereference(operand,type.resolved,FALSE);
  4850. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4851. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4852. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4853. (* case 1f
  4854. P(...,S,...) push: create array descriptor to S on stack
  4855. case 1g
  4856. P(... PS()...)
  4857. *)
  4858. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4859. Designate(expression,operand);
  4860. FOR i := 0 TO dim-1 DO
  4861. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4862. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4863. ReleaseOperand(tmpOperand);
  4864. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4865. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4866. ReleaseOperand(tmpOperand);
  4867. END;
  4868. (*******
  4869. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4870. *)
  4871. arrayFlags := {StaticFlag};
  4872. IF dim = 1 THEN
  4873. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4874. ReleaseOperand(tmpOperand);
  4875. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4876. m := LONGINT(tmpOperand.op.intValue);
  4877. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4878. ELSIF dim = 2 THEN
  4879. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4880. ReleaseOperand(tmpOperand);
  4881. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4882. m := LONGINT(tmpOperand.op.intValue);
  4883. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4884. ReleaseOperand(tmpOperand);
  4885. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4886. n := LONGINT(tmpOperand.op.intValue);
  4887. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4888. INCL(arrayFlags,SmallMatrixFlag);
  4889. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4890. END;
  4891. END;
  4892. (*******)
  4893. dimOp := IntermediateCode.Immediate(addressType,dim);
  4894. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4895. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4896. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4897. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4898. baseType := SemanticChecker.ArrayBase(type,dim);
  4899. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4900. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4901. ELSE HALT(100);
  4902. END;
  4903. (* case 2
  4904. procedure P([left args], var A: array [*,*] of Type, [right args])
  4905. *)
  4906. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4907. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4908. (* case 2b
  4909. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4910. push: push reference to pushed array descriptor
  4911. post: remove array descriptor.
  4912. *)
  4913. IF expression IS SyntaxTree.IndexDesignator THEN
  4914. descriptorType := GetMathArrayDescriptorType(dim);
  4915. (* range type : no allocation possible, should be untraced *)
  4916. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4917. Symbol(variable,variableOp);
  4918. arrayDestinationTag := variableOp.op;
  4919. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4920. arrayDestinationDimension := dim;
  4921. NeedDescriptor := TRUE;
  4922. Designate(expression,operand);
  4923. Pass((operand.tag));
  4924. NeedDescriptor := FALSE;
  4925. (* case 2a
  4926. P(...,A,...)
  4927. push: push reference to array descriptor on stack
  4928. *)
  4929. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4930. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4931. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4932. INC(i);
  4933. END;
  4934. IF i = dim THEN
  4935. Designate(expression,operand);
  4936. Pass((operand.tag));
  4937. ELSE (* open-static *)
  4938. type := expression.type.resolved;
  4939. descriptorType := GetMathArrayDescriptorType(dim);
  4940. (* static array , cannot be reallocated, untraced !*)
  4941. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4942. Symbol(variable,variableOp);
  4943. arrayDestinationTag := variableOp.op;
  4944. Designate(expression,operand);
  4945. FOR i := 0 TO dim-1 DO
  4946. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4947. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4948. ReleaseOperand(tmpOperand);
  4949. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4950. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4951. ReleaseOperand(tmpOperand);
  4952. END;
  4953. dimOp := IntermediateCode.Immediate(addressType,dim);
  4954. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4955. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4956. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4957. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4958. baseType := SemanticChecker.ArrayBase(type,dim);
  4959. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4960. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4961. Pass((arrayDestinationTag));
  4962. END;
  4963. (* case 2d
  4964. P(...,T,...) push: emit dimension check, push T
  4965. *)
  4966. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4967. Designate(expression,operand);
  4968. Dereference(operand,type.resolved,FALSE);
  4969. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4970. Pass((operand.tag));
  4971. (* case 2f
  4972. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4973. push: push reference to pushed array descriptor
  4974. post: remove array descriptor
  4975. *)
  4976. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4977. descriptorType := GetMathArrayDescriptorType(dim);
  4978. (* static array -- cannot be reallocatated, untraced *)
  4979. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4980. Symbol(variable,variableOp);
  4981. arrayDestinationTag := variableOp.op;
  4982. Designate(expression,operand);
  4983. FOR i := 0 TO dim-1 DO
  4984. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4985. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4986. ReleaseOperand(tmpOperand);
  4987. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4988. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4989. ReleaseOperand(tmpOperand);
  4990. END;
  4991. (*
  4992. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4993. *)
  4994. arrayFlags := {StaticFlag};
  4995. IF dim = 1 THEN
  4996. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4997. ReleaseOperand(tmpOperand);
  4998. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4999. m := LONGINT(tmpOperand.op.intValue);
  5000. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5001. ELSIF dim = 2 THEN
  5002. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5003. ReleaseOperand(tmpOperand);
  5004. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5005. m := LONGINT(tmpOperand.op.intValue);
  5006. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5007. ReleaseOperand(tmpOperand);
  5008. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5009. n := LONGINT(tmpOperand.op.intValue);
  5010. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5011. INCL(arrayFlags,SmallMatrixFlag);
  5012. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5013. END;
  5014. END;
  5015. (*******)
  5016. dimOp := IntermediateCode.Immediate(addressType,dim);
  5017. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5018. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5019. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5020. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5021. baseType := SemanticChecker.ArrayBase(type,dim);
  5022. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5023. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5024. Pass((arrayDestinationTag));
  5025. ELSE HALT(100);
  5026. END;
  5027. (* case 3
  5028. procedure P([left args], [const] A: array [?] of Type, [right args])
  5029. *)
  5030. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5031. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5032. (* case 3b
  5033. P(...,A[a..b,c..d],...)
  5034. *)
  5035. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5036. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5037. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5038. Symbol(variable,variableOp);
  5039. LoadValue(variableOp,system.addressType);
  5040. ELSE
  5041. descriptorType := GetMathArrayDescriptorType(dim);
  5042. (* range -- cannot be reallocated *)
  5043. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5044. Symbol(variable,variableOp);
  5045. END;
  5046. arrayDestinationTag := variableOp.op;
  5047. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5048. arrayDestinationDimension := 0;
  5049. Designate(expression,operand);
  5050. Pass((operand.tag));
  5051. (* case 3a
  5052. P(...,A,...)
  5053. *)
  5054. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5055. i := 0;
  5056. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5057. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5058. INC(i);
  5059. END;
  5060. IF i = dim THEN
  5061. Designate(expression,operand);
  5062. Pass((operand.tag));
  5063. ELSE (* open-static *)
  5064. type := expression.type.resolved;
  5065. descriptorType := GetMathArrayDescriptorType(dim);
  5066. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5067. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5068. Symbol(variable,variableOp);
  5069. arrayDestinationTag := variableOp.op;
  5070. Designate(expression,operand);
  5071. FOR i := 0 TO dim-1 DO
  5072. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5073. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5074. ReleaseOperand(tmpOperand);
  5075. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5076. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5077. ReleaseOperand(tmpOperand);
  5078. END;
  5079. dimOp := IntermediateCode.Immediate(addressType,dim);
  5080. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5081. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5082. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5083. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5084. baseType := SemanticChecker.ArrayBase(type,dim);
  5085. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5086. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5087. Pass((arrayDestinationTag));
  5088. END;
  5089. (* case 3d
  5090. P(...,T,...)
  5091. case 3e
  5092. P(...,PT(...),...)
  5093. *)
  5094. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5095. Designate(expression,operand);
  5096. Dereference(operand,type.resolved,FALSE);
  5097. Pass((operand.tag));
  5098. (* case 3f
  5099. P(...,S,...)
  5100. case 3g
  5101. P(...,PS(...),...)
  5102. *)
  5103. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5104. descriptorType := GetMathArrayDescriptorType(dim);
  5105. (* static array does not need to be traced *)
  5106. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5107. Symbol(variable,variableOp);
  5108. arrayDestinationTag := variableOp.op;
  5109. Designate(expression,operand);
  5110. IF operand.op.type.length >1 THEN (* vector register *)
  5111. (* static array does not need to be traced *)
  5112. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5113. Symbol(variable2, variable2Op);
  5114. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5115. Emit(Mov(position,tmp, operand.op));
  5116. ReleaseOperand(operand);
  5117. Symbol(variable2, operand);
  5118. END;
  5119. FOR i := 0 TO dim-1 DO
  5120. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5121. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5122. ReleaseOperand(tmpOperand);
  5123. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5124. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5125. ReleaseOperand(tmpOperand);
  5126. END;
  5127. dimOp := IntermediateCode.Immediate(addressType,dim);
  5128. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5129. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5130. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5131. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5132. baseType := SemanticChecker.ArrayBase(type,dim);
  5133. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5134. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5135. Pass((arrayDestinationTag));
  5136. ELSE HALT(100);
  5137. END;
  5138. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5139. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5140. (* case 4b
  5141. P(...,A[a..b,c..d],...)
  5142. *)
  5143. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5144. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5145. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5146. Symbol(variable,variableOp);
  5147. LoadValue(variableOp,system.addressType);
  5148. ELSE
  5149. descriptorType := GetMathArrayDescriptorType(dim);
  5150. (* range array -- cannot be allocated *)
  5151. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5152. Symbol(variable,variableOp);
  5153. END;
  5154. arrayDestinationTag := variableOp.op;
  5155. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5156. arrayDestinationDimension := 0;
  5157. Designate(expression,operand);
  5158. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5159. Symbol(variable,variableOp);
  5160. ELSE
  5161. (* alias to range -- untraced *)
  5162. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5163. Symbol(variable,variableOp);
  5164. MakeMemory(tmp,variableOp.op,addressType,0);
  5165. Emit(Mov(position,tmp,operand.tag));
  5166. ReleaseIntermediateOperand(tmp);
  5167. END;
  5168. Pass((variableOp.op));
  5169. ReleaseOperand(variableOp);
  5170. (* case 4a
  5171. P(...,A,...)
  5172. *)
  5173. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5174. i := 0;
  5175. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5176. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5177. INC(i);
  5178. END;
  5179. IF i = dim THEN
  5180. Designate(expression,operand);
  5181. arrayDestinationTag := operand.tag;
  5182. ELSE (* open-static *)
  5183. type := expression.type.resolved;
  5184. descriptorType := GetMathArrayDescriptorType(dim);
  5185. (* static array -- untraced *)
  5186. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5187. Symbol(variable,variableOp);
  5188. arrayDestinationTag := variableOp.op;
  5189. Designate(expression,operand);
  5190. FOR i := 0 TO dim-1 DO
  5191. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5192. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5193. ReleaseOperand(tmpOperand);
  5194. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5195. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5196. ReleaseOperand(tmpOperand);
  5197. END;
  5198. dimOp := IntermediateCode.Immediate(addressType,dim);
  5199. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5200. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5201. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5202. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5203. baseType := SemanticChecker.ArrayBase(type,dim);
  5204. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5205. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5206. END;
  5207. (* tensor alias to open array -- untraced *)
  5208. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5209. Symbol(variable,variableOp);
  5210. MakeMemory(tmp,variableOp.op,addressType,0);
  5211. Emit(Mov(position,tmp,arrayDestinationTag));
  5212. ReleaseIntermediateOperand(tmp);
  5213. Pass((variableOp.op));
  5214. ReleaseOperand(variableOp);
  5215. (* case 4d
  5216. P(...,T,...)
  5217. *)
  5218. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5219. Designate(expression,operand);
  5220. Pass((operand.op));
  5221. (* case 4f
  5222. P(...,S,...)
  5223. *)
  5224. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5225. descriptorType := GetMathArrayDescriptorType(dim);
  5226. (* static array -- cannot be reallocated, untraced *)
  5227. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5228. Symbol(variable,variableOp);
  5229. arrayDestinationTag := variableOp.op;
  5230. Designate(expression,operand);
  5231. FOR i := 0 TO dim-1 DO
  5232. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5233. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5234. ReleaseOperand(tmpOperand);
  5235. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5236. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5237. ReleaseOperand(tmpOperand);
  5238. END;
  5239. dimOp := IntermediateCode.Immediate(addressType,dim);
  5240. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5241. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5242. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5243. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5244. baseType := SemanticChecker.ArrayBase(type,dim);
  5245. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5246. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5247. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5248. Symbol(variable,variableOp);
  5249. MakeMemory(tmp,variableOp.op,addressType,0);
  5250. Emit(Mov(position,tmp,arrayDestinationTag));
  5251. ReleaseIntermediateOperand(tmp);
  5252. Pass((variableOp.op));
  5253. ReleaseOperand(variableOp);
  5254. ELSE HALT(100);
  5255. END;
  5256. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5257. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5258. IF SemanticChecker.CanPassInRegister(system,parameter.type.resolved) THEN
  5259. Evaluate(expression, operand);
  5260. Emit(Push(position, operand.op));
  5261. (*
  5262. ELSIF operand.op.type.length > 1 THEN
  5263. Emit(Push(position, operand.op));
  5264. *)
  5265. ELSE
  5266. Designate(expression,operand);
  5267. ASSERT(operand.op.type.length =1);
  5268. size := system.SizeOf(type);
  5269. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5270. size := ToMemoryUnits(system,size);
  5271. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5272. arrayDestinationTag := sp;
  5273. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5274. END;
  5275. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5276. Designate(expression,operand);
  5277. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5278. (* static array no pointer *)
  5279. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5280. Symbol(variable,variableOp);
  5281. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5282. Emit(Mov(position,tmp,operand.op));
  5283. Emit(Push(position,variableOp.op));
  5284. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5285. Pass((operand.op));
  5286. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5287. END;
  5288. ELSE HALT(200)
  5289. END;
  5290. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5291. IF parameter.kind = SyntaxTree.VarParameter THEN
  5292. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5293. Designate(expression, operand);
  5294. Pass((operand.op));
  5295. ELSE
  5296. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5297. Evaluate(expression, operand);
  5298. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5299. Pass((operand.extra)); (* step *)
  5300. Pass((operand.tag)); (* last *)
  5301. Pass((operand.op)); (* first *)
  5302. ELSE
  5303. (* pass range as structure in order to comply with the variable alignment of its components *)
  5304. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5305. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5306. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5307. tmp := sp;
  5308. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5309. Emit(Mov(position,tmp,operand.op)); (* first *)
  5310. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5311. IntermediateCode.AddOffset(tmp,size);
  5312. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5313. IntermediateCode.AddOffset(tmp,size);
  5314. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5315. END;
  5316. END
  5317. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5318. IF parameter.kind = SyntaxTree.VarParameter THEN
  5319. Designate(expression, operand);
  5320. Pass((operand.op));
  5321. ELSE
  5322. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5323. Evaluate(expression, operand);
  5324. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5325. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5326. Pass((operand.tag)); (* imaginary part *)
  5327. Pass((operand.op)) (* real part *)
  5328. ELSE
  5329. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5330. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5331. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5332. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5333. tmp := sp;
  5334. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5335. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5336. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5337. IntermediateCode.AddOffset(tmp,size);
  5338. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5339. END
  5340. END
  5341. ELSE
  5342. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5343. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5344. Designate(expression,operand);
  5345. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5346. (* stack allocation *)
  5347. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5348. (*! parameter alignment to be discussed ... *)
  5349. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5350. size := type(SyntaxTree.StringType).length;
  5351. END;
  5352. IF backend.cooperative & parameter.NeedsTrace() THEN
  5353. dst := NewRegisterOperand (addressType);
  5354. Emit(Mov(position,dst, sp));
  5355. IntermediateCode.InitImmediate(null, byteType, 0);
  5356. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5357. ReleaseIntermediateOperand(dst);
  5358. SaveRegisters();ReleaseUsedRegisters(saved);
  5359. (* register dst has been freed before SaveRegisters already *)
  5360. CallAssignMethod(dst, operand.op, parameter.type);
  5361. RestoreRegisters(saved);
  5362. END;
  5363. IF operand.op.type.length > 1 THEN (* vector *)
  5364. MakeMemory(tmp,sp,operand.op.type,0);
  5365. Emit(Mov(position, tmp, operand.op));
  5366. ELSE
  5367. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5368. END;
  5369. ELSIF IsOpenArray(parameter.type) THEN
  5370. Designate(expression,operand);
  5371. baseReg := operand.tag;
  5372. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5373. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5374. END;
  5375. Pass((operand.op)); (* address of the array *)
  5376. ELSIF IsDelegate(parameter.type) THEN
  5377. Evaluate(expression,operand);
  5378. IF backend.cooperative & parameter.NeedsTrace() THEN
  5379. Emit(Push(position, nil));
  5380. dst := NewRegisterOperand (addressType);
  5381. Emit(Mov(position,dst, sp));
  5382. ReleaseIntermediateOperand(dst);
  5383. SaveRegisters();ReleaseUsedRegisters(saved);
  5384. Emit(Push(position, dst));
  5385. (* register dst has been freed before SaveRegisters already *)
  5386. Emit(Push(position, operand.tag));
  5387. CallThis(position,"GarbageCollector","Assign",2);
  5388. RestoreRegisters(saved);
  5389. ELSE
  5390. Pass((operand.tag));
  5391. END;
  5392. Pass((operand.op));
  5393. ELSE
  5394. Evaluate(expression,operand);
  5395. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5396. Emit(Push(position, nil));
  5397. dst := NewRegisterOperand (addressType);
  5398. Emit(Mov(position,dst, sp));
  5399. ReleaseIntermediateOperand(dst);
  5400. SaveRegisters();ReleaseUsedRegisters(saved);
  5401. Emit(Push(position, dst));
  5402. (* register dst has been freed before SaveRegisters already *)
  5403. Emit(Push(position, operand.op));
  5404. CallThis(position,"GarbageCollector","Assign",2);
  5405. RestoreRegisters(saved);
  5406. ELSE
  5407. Pass((operand.op));
  5408. END;
  5409. END;
  5410. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5411. Evaluate(expression,operand);
  5412. Pass((operand.op));
  5413. ELSE (* var parameter *)
  5414. Designate(expression,operand);
  5415. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5416. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5417. Pass((operand.tag));
  5418. END;
  5419. END;
  5420. Pass((operand.op));
  5421. END;
  5422. END;
  5423. (* TODO: needed? *)
  5424. arrayDestinationTag := oldArrayDestinationTag;
  5425. arrayDestinationDimension := oldArrayDestinationDimension;
  5426. IF needsParameterBackup THEN
  5427. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5428. ReuseCopy(parameterBackup, operand.op)
  5429. END;
  5430. ReleaseOperand(operand);
  5431. IF Trace THEN TraceExit("PushParameter") END;
  5432. END PushParameter;
  5433. PROCEDURE VisitInlineCallDesignator*(x: SyntaxTree.InlineCallDesignator);
  5434. VAR recentScope: SyntaxTree.Scope; duplicate: BOOLEAN;
  5435. wasInline: BOOLEAN; var: SyntaxTree.Variable; variableDesignator: SyntaxTree.Expression;
  5436. prevInlineExit: Label;
  5437. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5438. VAR
  5439. variable: SyntaxTree.Variable;
  5440. variableDesignator: SyntaxTree.Designator;
  5441. BEGIN
  5442. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5443. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, NIL, variable);
  5444. variableDesignator.SetType(type);
  5445. RETURN variableDesignator
  5446. END GetTemp;
  5447. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5448. BEGIN
  5449. RETURN SemanticChecker.CanPassInRegister(system,type)
  5450. END FitsInRegister;
  5451. BEGIN
  5452. recentScope := currentScope;
  5453. wasInline := currentIsInline;
  5454. prevInlineExit := currentInlineExit;
  5455. currentInlineExit := NewLabel();
  5456. currentIsInline := TRUE;
  5457. ASSERT(module.system.GenerateVariableOffsets(currentScope));
  5458. (* must be done by checker because the symbol is otherwise not resolved
  5459. localVariable := x.block.scope.firstVariable;
  5460. WHILE (localVariable # NIL) DO
  5461. variableDesignator := GetTemp(localVariable.type, localVariable..);
  5462. x.block.scope.EnterSymbol(SyntaxTree.NewAlias(x.position, localVariable.name, variableDesignator), duplicate);
  5463. ASSERT(~duplicate);
  5464. localVariable := localVariable.nextVariable;
  5465. END;
  5466. *)
  5467. IF x.block.scope # NIL THEN
  5468. IF x.block.scope.outerScope # currentScope THEN
  5469. Printout.Info("x.block.scope",x.block.scope);
  5470. Printout.Info("currentScope",currentScope);
  5471. HALT(100);
  5472. END;
  5473. currentScope := x.block.scope;
  5474. ASSERT(module.system.GenerateVariableOffsets(currentScope));
  5475. var := currentScope.firstVariable;
  5476. WHILE var # NIL DO
  5477. IF var.preferRegister THEN
  5478. IF var.registerNumber < 0 THEN
  5479. var.RegisterNumber(AcquireRegister(IntermediateCode.GetType(system,var.type),IntermediateCode.GeneralPurposeRegister));
  5480. UnuseRegister(var.registerNumber);
  5481. END;
  5482. END;
  5483. IF var.initializer # NIL THEN
  5484. variableDesignator := SyntaxTree.NewSymbolDesignator(var.position,NIL, NIL,var);
  5485. variableDesignator.SetType(var.type.resolved);
  5486. variableDesignator.SetAssignable(TRUE);
  5487. IF SemanticChecker.IsReference(var) THEN
  5488. AssignReference(variableDesignator, var.initializer);
  5489. ELSE
  5490. Assign(variableDesignator,var.initializer);
  5491. END;
  5492. END;
  5493. IF var.registerNumber >= 0 THEN UseRegister(var.registerNumber) END;
  5494. var := var.nextVariable;
  5495. END;
  5496. END;
  5497. IF x.type # NIL THEN
  5498. IF procedureResultDesignator # NIL THEN
  5499. x.block.scope.EnterSymbol(SyntaxTree.NewAlias(x.position, ResultDesignatorName, procedureResultDesignator), duplicate);
  5500. procedureResultDesignator := NIL;
  5501. ELSE
  5502. variableDesignator := GetTemp(x.type, TRUE (* try to allocate register *));
  5503. x.SetResult(variableDesignator);
  5504. x.block.scope.EnterSymbol(SyntaxTree.NewAlias(x.position, ResultDesignatorName, variableDesignator), duplicate);
  5505. END;
  5506. END;
  5507. VisitStatementBlock(x.block);
  5508. SetLabel(currentInlineExit);
  5509. var := currentScope.firstVariable;
  5510. WHILE var # NIL DO
  5511. IF var.preferRegister THEN
  5512. Emit(Use(var.position, IntermediateCode.Register(IntermediateCode.GetType(system,var.type),IntermediateCode.GeneralPurposeRegister, var.registerNumber)));
  5513. UnuseRegister(var.registerNumber);
  5514. END;
  5515. var := var.nextVariable;
  5516. END;
  5517. (* can the inline scope end here? Or should the evaluation of the result be in the scope? *)
  5518. currentScope := recentScope;
  5519. IF (x.type # NIL) & (x.result # NIL) THEN
  5520. (* IF structuredReturnType THEN
  5521. RestoreRegisters(saved);
  5522. InitOperand(result,ModeReference);
  5523. Symbol(variable,result);
  5524. ELSE
  5525. *)
  5526. Designate(x.result, result);
  5527. (*
  5528. END;
  5529. *)
  5530. END;
  5531. currentInlineExit := prevInlineExit;
  5532. currentIsInline := wasInline;
  5533. END VisitInlineCallDesignator;
  5534. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5535. VAR
  5536. parameters: SyntaxTree.ExpressionList;
  5537. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5538. procedureType: SyntaxTree.ProcedureType;
  5539. formalParameter: SyntaxTree.Parameter;
  5540. operand: Operand;
  5541. reg, size, mask, dest: IntermediateCode.Operand;
  5542. saved,saved2: RegisterEntry;
  5543. symbol: SyntaxTree.Symbol;
  5544. variable: SyntaxTree.Variable;
  5545. i, parametersSize : LONGINT;
  5546. structuredReturnType: BOOLEAN;
  5547. gap, alignment: LONGINT; (*fld*)
  5548. return: IntermediateCode.Operand;
  5549. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5550. arg: IntermediateCode.Operand;
  5551. dummy: IntermediateCode.Operand;
  5552. recordType: SyntaxTree.RecordType;
  5553. operatorSelectionProcedureOperand: Operand;
  5554. operatorSelectionProcedure: SyntaxTree.Procedure;
  5555. fingerprint: SyntaxTree.Fingerprint;
  5556. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5557. identifierNumber: LONGINT;
  5558. parameterRegisters: SIZE;
  5559. registers: ARRAY 64 OF WORD;
  5560. callingConvention: SyntaxTree.CallingConvention;
  5561. type: IntermediateCode.Type;
  5562. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5563. (** do preparations before parameter push for array-structured object types (ASOTs):
  5564. if ASOT is passed as VAR parameter:
  5565. - allocate temporary variable of math array type
  5566. - copy contents of ASOT to be passed to temporary variable
  5567. - use temporary variable as the actual parameter instead
  5568. - 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)
  5569. **)
  5570. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5571. VAR
  5572. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5573. BEGIN
  5574. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5575. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5576. (* prepare writeback for any other "normal" indexer *)
  5577. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5578. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, NIL, variable);
  5579. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5580. Assign(tempVariableDesignator, actualParameter);
  5581. IF firstWriteBackCall = NIL THEN
  5582. NEW(firstWriteBackCall);
  5583. currentWriteBackCall := firstWriteBackCall
  5584. ELSE
  5585. ASSERT(currentWriteBackCall # NIL);
  5586. NEW(currentWriteBackCall.next);
  5587. currentWriteBackCall := currentWriteBackCall.next
  5588. END;
  5589. (* a [^] . P[] ()*)
  5590. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5591. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5592. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5593. left := left(SyntaxTree.Designator).left;
  5594. END;
  5595. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5596. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5597. END;
  5598. actualParameter := tempVariableDesignator;
  5599. END
  5600. END PrepareParameter;
  5601. BEGIN
  5602. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5603. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5604. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5605. callingConvention := procedureType.callingConvention;
  5606. dest := destination; destination := emptyOperand;
  5607. SaveRegisters();ReleaseUsedRegisters(saved);
  5608. parameters := x.parameters;
  5609. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5610. (* an operator is called *)
  5611. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5612. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5613. (* check if a dynamic operator call should be performed *)
  5614. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5615. ELSE
  5616. isCallOfDynamicOperator := FALSE
  5617. END;
  5618. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5619. Emit(Push(position, ap));
  5620. END;
  5621. alignment := procedureType.stackAlignment;
  5622. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5623. alignment := 16 (* bytes *);
  5624. END;
  5625. IF alignment > 1 THEN
  5626. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5627. Emit(Mov(position,reg, sp));
  5628. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5629. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5630. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5631. gap := 4*ToMemoryUnits(system,system.addressSize);
  5632. END;
  5633. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5634. backend.ResetParameterRegisters();
  5635. formalParameter := procedureType.firstParameter;
  5636. FOR i := 0 TO parameters.Length()-1 DO
  5637. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5638. type := addressType;
  5639. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5640. type := addressType;
  5641. ELSE
  5642. type := GetType(system, formalParameter.type);
  5643. END;
  5644. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5645. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5646. END;
  5647. formalParameter := formalParameter.nextParameter;
  5648. END;
  5649. IF gap < 0 THEN
  5650. gap := 0
  5651. END;
  5652. ELSE
  5653. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5654. END;
  5655. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5656. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5657. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5658. Emit(And(position,sp, sp, mask));
  5659. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5660. Emit(Push(position,reg));
  5661. ReleaseIntermediateOperand(reg);
  5662. END;
  5663. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5664. (* align stack to 16-byte boundary *)
  5665. IntermediateCode.InitImmediate(mask,addressType,-16);
  5666. Emit(And(position,sp, sp, mask));
  5667. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5668. IF gap # 0 THEN
  5669. IntermediateCode.InitImmediate(size,addressType,gap);
  5670. Emit(Sub(position,sp,sp,size))
  5671. END;
  5672. END;
  5673. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5674. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5675. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5676. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5677. ELSE
  5678. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5679. END;
  5680. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5681. Designate(x.left(SyntaxTree.Designator).left, operand);
  5682. Emit(Push(position, operand.tag));
  5683. Emit(Push(position, operand.op));
  5684. Symbol(symbol, operand);
  5685. LoadValue(operand, symbol.type);
  5686. (*
  5687. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5688. Evaluate(x.left, operand);
  5689. *)
  5690. ELSE
  5691. Evaluate(x.left, operand);
  5692. IF symbol IS SyntaxTree.Procedure THEN
  5693. IF (procedureType.selfParameter # NIL) THEN
  5694. Emit(Push(position,operand.tag));
  5695. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5696. Emit(Push(position,operand.tag));
  5697. ELSIF (procedureType.isDelegate) THEN
  5698. Emit(Push(position,operand.tag));
  5699. END;
  5700. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5701. IF (procedureType.selfParameter # NIL) THEN
  5702. Emit(Push(position,operand.tag));
  5703. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5704. Emit(Push(position,operand.tag));
  5705. END;
  5706. ELSE HALT(200);
  5707. END;
  5708. END;
  5709. ReleaseIntermediateOperand(operand.tag);
  5710. operand.tag := emptyOperand;
  5711. (* determine if a structured return type is needed *)
  5712. structuredReturnType := SemanticChecker.StructuredReturnType(system,procedureType);
  5713. IF structuredReturnType THEN
  5714. IF resultDesignator # NIL THEN
  5715. d := resultDesignator;
  5716. ELSE
  5717. (* temporary result that might be allocated, must potentially be traced *)
  5718. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5719. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,NIL, variable);
  5720. d.SetType(variable.type);
  5721. END;
  5722. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5723. Designate(d,returnValue);
  5724. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5725. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5726. Emit(Push(position,size));
  5727. Emit(Push(position,returnValue.op));
  5728. ReleaseOperand(returnValue);
  5729. ELSE*)
  5730. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5731. (*
  5732. END;
  5733. *)
  5734. END;
  5735. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5736. parameterRegisters := 0;
  5737. backend.ResetParameterRegisters();
  5738. formalParameter := procedureType.firstParameter;
  5739. FOR i := 0 TO parameters.Length()-1 DO
  5740. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5741. type := addressType;
  5742. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5743. type := addressType;
  5744. ELSE
  5745. type := GetType(system, formalParameter.type);
  5746. END;
  5747. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5748. INC(parameterRegisters);
  5749. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5750. Error(actualParameter.position,"cannot be passed by register")
  5751. END;
  5752. ELSE
  5753. registers[i] := -1;
  5754. END;
  5755. formalParameter := formalParameter.nextParameter;
  5756. END;
  5757. formalParameter := procedureType.lastParameter;
  5758. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5759. actualParameter := parameters.GetExpression(i);
  5760. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5761. formalParameter := formalParameter.prevParameter;
  5762. END;
  5763. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5764. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5765. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5766. END;
  5767. ELSE
  5768. hasDynamicOperands := FALSE;
  5769. formalParameter := procedureType.firstParameter;
  5770. FOR i := 0 TO parameters.Length() - 1 DO
  5771. actualParameter := parameters.GetExpression(i);
  5772. PrepareParameter(actualParameter, formalParameter);
  5773. IF formalParameter # NIL THEN (* TENTATIVE *)
  5774. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5775. ASSERT(i < 2);
  5776. hasDynamicOperands := TRUE;
  5777. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5778. ELSE
  5779. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5780. END;
  5781. formalParameter := formalParameter.nextParameter;
  5782. END;
  5783. END;
  5784. END;
  5785. IF symbol IS SyntaxTree.Procedure THEN
  5786. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5787. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5788. Emit(Push(position,reg));
  5789. ReleaseIntermediateOperand(reg);
  5790. END;
  5791. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5792. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5793. parametersSize := ParametersSize(system,procedureType, FALSE);
  5794. END;
  5795. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5796. (*
  5797. dynamic operator overloading:
  5798. first push parameters, regularly:
  5799. [self]
  5800. par1
  5801. par2
  5802. then push parameters for GetOperator
  5803. identifier
  5804. ptr1
  5805. tag
  5806. ptr2
  5807. tag
  5808. call GetOperatorRuntimeProc
  5809. call Operator
  5810. *)
  5811. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5812. (* push ID *)
  5813. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5814. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5815. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5816. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5817. formalParameter := procedureType.firstParameter;
  5818. FOR i := 0 TO parameters.Length() - 1 DO
  5819. IF formalParameter.access # SyntaxTree.Hidden THEN
  5820. ASSERT(i < 2);
  5821. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5822. (* push pointer *)
  5823. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5824. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5825. (* add dereference *)
  5826. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5827. (*! better: do refer to stack above than using parameter backups !!*)
  5828. ReleaseIntermediateOperand(parameterBackups[i]);
  5829. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5830. END;
  5831. Emit(Push(position,parameterBackups[i]));
  5832. ReleaseIntermediateOperand(parameterBackups[i]);
  5833. (* push typetag *)
  5834. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5835. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5836. arg := TypeDescriptorAdr(recordType);
  5837. Emit(Push(position,arg));
  5838. ELSE
  5839. (* push 'NonPointer' *)
  5840. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5841. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5842. (* push fingerprint *)
  5843. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5844. fingerprint := fingerprinter.TypeFP(formalParameter.type.resolved);
  5845. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public))) (* TODO: push the type's fingerprint *)
  5846. END
  5847. END;
  5848. formalParameter := formalParameter.nextParameter
  5849. END;
  5850. (* for unary operators: complete the information for the second parameter *)
  5851. IF procedureType.numberParameters < 2 THEN
  5852. (* push 'NonPointer' *)
  5853. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5854. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5855. (* push 'NoType' *)
  5856. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5857. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5858. END;
  5859. (* call operator selection procedure *)
  5860. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5861. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5862. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5863. ReleaseOperand(operatorSelectionProcedureOperand);
  5864. (* use the address that the operator selection procedure returned as the target address of the call *)
  5865. InitOperand(operand, ModeValue);
  5866. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5867. Emit(Result(position,operand.op))
  5868. END
  5869. END;
  5870. ReleaseParameterRegisters();
  5871. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5872. SaveRegisters();ReleaseUsedRegisters(saved2);
  5873. CallThis(position,"Objects","LeaveA2",0);
  5874. RestoreRegisters(saved2);
  5875. END;
  5876. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5877. Emit(Call(position,operand.op,0));
  5878. ELSE
  5879. Emit(Call(position,operand.op,parametersSize));
  5880. END;
  5881. ReleaseOperand(operand);
  5882. IF procedureType.noReturn THEN
  5883. EmitTrap(position,NoReturnTrap);
  5884. END;
  5885. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5886. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5887. Emit(Result(position,return));
  5888. END;
  5889. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5890. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5891. Emit(Push(position, return));
  5892. CallThis(position,"Objects","ReenterA2",0);
  5893. Emit(Pop(position, return));
  5894. ELSE
  5895. CallThis(position,"Objects","ReenterA2",0);
  5896. END;
  5897. END;
  5898. (* === return parameter space === *)
  5899. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5900. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5901. (* cleanup all space for all parameters *)
  5902. IF parametersSize < 32 THEN
  5903. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5904. parametersSize := 32
  5905. END;
  5906. size := IntermediateCode.Immediate(addressType,parametersSize);
  5907. Emit(Add(position,sp,sp,size))
  5908. END;
  5909. IF (callingConvention IN SysvABI) THEN
  5910. IF parameterRegisters > 0 THEN
  5911. IF parameters.Length() > parameterRegisters THEN
  5912. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5913. ELSE
  5914. parametersSize := 0
  5915. END;
  5916. ELSE
  5917. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5918. INC( parametersSize, (-parametersSize) MOD 16 )
  5919. END;
  5920. IF parametersSize > 0 THEN
  5921. size := IntermediateCode.Immediate(addressType,parametersSize);
  5922. Emit(Add(position,sp,sp,size))
  5923. END;
  5924. END;
  5925. IF alignment > 1 THEN
  5926. Emit(Pop(position,sp));
  5927. END;
  5928. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5929. Emit(Pop(position, ap));
  5930. END;
  5931. IF firstWriteBackCall # NIL THEN
  5932. SaveRegisters(); ReleaseUsedRegisters(saved2);
  5933. (* perform all write-back calls in the list *)
  5934. currentWriteBackCall := firstWriteBackCall;
  5935. WHILE currentWriteBackCall # NIL DO
  5936. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5937. currentWriteBackCall := currentWriteBackCall.next
  5938. END;
  5939. RestoreRegisters(saved2);
  5940. END;
  5941. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5942. IF structuredReturnType THEN
  5943. RestoreRegisters(saved);
  5944. InitOperand(result,ModeReference);
  5945. Symbol(variable,result);
  5946. ELSE
  5947. RestoreRegisters(saved);
  5948. InitOperand(result,ModeValue);
  5949. result.op := return;
  5950. END;
  5951. END;
  5952. destination := dest;
  5953. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5954. END VisitProcedureCallDesignator;
  5955. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5956. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5957. td: SyntaxTree.Symbol;
  5958. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5959. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5960. BEGIN
  5961. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5962. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5963. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5964. variable.SetType(system.anyType);
  5965. scope.AddVariable(variable);
  5966. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5967. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5968. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5969. typeDeclaration.SetScope(module.module.moduleScope);
  5970. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5971. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5972. END;
  5973. RETURN hiddenPointerType;
  5974. END GetHiddenPointerType;
  5975. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5976. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5977. BEGIN
  5978. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5979. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5980. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5981. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5982. scope.AddVariable(variable);
  5983. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5984. variable.SetType(system.anyType);
  5985. scope.AddVariable(variable);
  5986. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5987. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5988. typeDeclaration.SetDeclaredType(delegatePointerType);
  5989. typeDeclaration.SetScope(module.module.moduleScope);
  5990. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5991. delegatePointerType.SetState(SyntaxTree.Resolved);
  5992. END;
  5993. RETURN delegatePointerType
  5994. END GetDelegateType;
  5995. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5996. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5997. such as in VAR a: RECORD ... END;
  5998. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5999. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6000. *)
  6001. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6002. baseRecord: SyntaxTree.RecordType;
  6003. BEGIN (* no code emission *)
  6004. source := NIL;
  6005. x := x.resolved;
  6006. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6007. x := GetHiddenPointerType();
  6008. ELSIF IsDelegate(x) THEN
  6009. x := GetDelegateType();
  6010. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6011. ELSE HALT(200);
  6012. END;
  6013. td := x.typeDeclaration;
  6014. IF td = NIL THEN
  6015. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6016. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6017. ASSERT(td # NIL);
  6018. END;
  6019. GetCodeSectionNameForSymbol(td,name);
  6020. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6021. meta.CheckTypeDeclaration(x);
  6022. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6023. ELSE
  6024. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6025. END;
  6026. IF backend.cooperative OR meta.simple THEN
  6027. offset := 0;
  6028. ELSE
  6029. IF x IS SyntaxTree.CellType THEN
  6030. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6031. IF baseRecord = NIL THEN
  6032. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6033. ELSE
  6034. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6035. END;
  6036. ELSE
  6037. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6038. END;
  6039. END;
  6040. RETURN td
  6041. END GetBackendType;
  6042. BEGIN
  6043. (*td := t.typeDeclaration;*)
  6044. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6045. (*
  6046. IF t IS SyntaxTree.PointerType THEN
  6047. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6048. ELSE
  6049. source := GetBackendType(t);
  6050. END;
  6051. *)
  6052. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6053. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6054. IntermediateCode.SetOffset(res,offset);
  6055. (*
  6056. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6057. make memory should be used when tag is used, not earlier
  6058. *)
  6059. RETURN res
  6060. END TypeDescriptorAdr;
  6061. (*
  6062. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6063. VAR result: IntermediateCode.Operand;
  6064. BEGIN
  6065. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6066. operand.tag := TypeDescriptorAdr(operand.type);
  6067. IntermediateCode.MakeMemory(operand.tag,addressType);
  6068. UseIntermediateOperand(operand.tag);
  6069. END;
  6070. END MakeTypeTag;
  6071. *)
  6072. PROCEDURE ProfilerInit;
  6073. VAR reg: IntermediateCode.Operand;
  6074. BEGIN
  6075. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6076. Emit(Call(position,reg,0));
  6077. END ProfilerInit;
  6078. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6079. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6080. BEGIN
  6081. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6082. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6083. THEN
  6084. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6085. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6086. Emit(Push(position,reg));
  6087. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6088. Emit(Push(position,reg));
  6089. StaticCallOperand(result,procedure);
  6090. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6091. ReleaseOperand(result);
  6092. END;
  6093. END ProfilerEnterExit;
  6094. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6095. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6096. BEGIN
  6097. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6098. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6099. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6100. profileInit.Emit(Push(position,reg));
  6101. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6102. profileInit.Emit(Push(position,reg));
  6103. NEW(string, LEN(name)); COPY(name, string^);
  6104. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6105. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6106. sv.SetType(type);
  6107. Designate(sv,result);
  6108. profileInit.Emit(Push(position,result.tag));
  6109. profileInit.Emit(Push(position,result.op));
  6110. StaticCallOperand(result,procedure);
  6111. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6112. ReleaseOperand(result);
  6113. END;
  6114. END ProfilerAddProcedure;
  6115. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6116. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6117. BEGIN
  6118. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6119. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6120. profileInit.Emit(Push(position,reg));
  6121. profileInitPatchPosition := profileInit.pc;
  6122. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6123. NEW(string, LEN(name)); COPY(name, string^);
  6124. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6125. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6126. sv.SetType(type);
  6127. Designate(sv,result);
  6128. profileInit.Emit(Push(position,result.tag));
  6129. profileInit.Emit(Push(position,result.op));
  6130. StaticCallOperand(result,procedure);
  6131. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6132. ReleaseOperand(result);
  6133. END;
  6134. END ProfilerAddModule;
  6135. PROCEDURE ProfilerPatchInit;
  6136. VAR reg: IntermediateCode.Operand;
  6137. BEGIN
  6138. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6139. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6140. EmitLeave(profileInit,position,NIL,0);
  6141. profileInit.Emit(Exit(position,0,0,0));
  6142. END ProfilerPatchInit;
  6143. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6144. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6145. VAR
  6146. id: LONGINT;
  6147. leftType, rightType: SyntaxTree.Type;
  6148. procedureType: SyntaxTree.ProcedureType;
  6149. runtimeProcedure: SyntaxTree.Procedure;
  6150. runtimeProcedureOperand, operatorOperand: Operand;
  6151. kind: SET;
  6152. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6153. VAR
  6154. arg: IntermediateCode.Operand;
  6155. recordType: SyntaxTree.RecordType;
  6156. fingerprint: SyntaxTree.Fingerprint;
  6157. BEGIN
  6158. IF type = NIL THEN
  6159. (* no type: push 'NoType' *)
  6160. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6161. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6162. ELSIF IsStrictlyPointerToRecord(type) THEN
  6163. (* pointer to record type: push typetag *)
  6164. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6165. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6166. arg := TypeDescriptorAdr(recordType);
  6167. ELSE
  6168. (* non-pointer to record type: push fingerprint *)
  6169. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6170. fingerprint := fingerprinter.TypeFP(type.resolved);
  6171. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public)
  6172. END;
  6173. operatorInitializationCodeSection.Emit(Push(position,arg))
  6174. END PushTypeInfo;
  6175. BEGIN
  6176. ASSERT(operatorInitializationCodeSection # NIL);
  6177. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6178. procedureType := operator.type(SyntaxTree.ProcedureType);
  6179. (* determine types *)
  6180. leftType := procedureType.firstParameter.type;
  6181. IF procedureType.numberParameters = 2 THEN
  6182. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6183. rightType := procedureType.firstParameter.nextParameter.type;
  6184. ELSE
  6185. rightType := NIL
  6186. END;
  6187. (* determine operator kind *)
  6188. IF IsStrictlyPointerToRecord(leftType) THEN
  6189. kind := {LhsIsPointer}
  6190. ELSE
  6191. kind := {}
  6192. END;
  6193. IF IsStrictlyPointerToRecord(rightType) THEN
  6194. kind := kind + {RhsIsPointer}
  6195. END;
  6196. IF kind # {} THEN (* TODO: to be removed later on *)
  6197. (* at least one of the types is a pointer to record *)
  6198. (* emit a code that registers this specific operator in the runtime *)
  6199. dump := operatorInitializationCodeSection.comments;
  6200. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6201. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6202. (* push ID *)
  6203. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6204. id := Global.GetSymbol(module.module.case, operator.name);
  6205. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6206. (* push kind *)
  6207. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6208. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6209. (* push type infos *)
  6210. PushTypeInfo(leftType);
  6211. PushTypeInfo(rightType);
  6212. (* push operator address *)
  6213. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6214. StaticCallOperand(operatorOperand, operator);
  6215. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6216. ReleaseOperand(operatorOperand);
  6217. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6218. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6219. ReleaseOperand(runtimeProcedureOperand)
  6220. END
  6221. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6222. END
  6223. END RegisterDynamicOperator;
  6224. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6225. VAR
  6226. traceModule: SyntaxTree.Module;
  6227. procedure: SyntaxTree.Procedure;
  6228. procedureVariable: SyntaxTree.Variable;
  6229. s,msg: Basic.MessageString;
  6230. res: Operand;
  6231. i: LONGINT;
  6232. sv: SyntaxTree.StringValue;
  6233. type: SyntaxTree.Type;
  6234. recordType: SyntaxTree.RecordType;
  6235. printout: Printout.Printer;
  6236. stringWriter: Streams.StringWriter;
  6237. expression: SyntaxTree.Expression;
  6238. saved: RegisterEntry;
  6239. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6240. BEGIN
  6241. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6242. IF procedure = NIL THEN
  6243. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6244. END;
  6245. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6246. s := "procedure ";
  6247. Strings.Append(s,backend.traceModuleName);
  6248. Strings.Append(s,".");
  6249. Strings.Append(s,procedureName);
  6250. Strings.Append(s," not present");
  6251. Error(position,s);
  6252. RETURN FALSE
  6253. ELSE
  6254. RETURN TRUE
  6255. END;
  6256. END GetProcedure;
  6257. PROCEDURE CallProcedure;
  6258. VAR size: LONGINT;
  6259. BEGIN
  6260. IF procedure # NIL THEN
  6261. StaticCallOperand(result,procedure);
  6262. size := ProcParametersSize(procedure);
  6263. ELSE
  6264. Symbol(procedureVariable, result);
  6265. LoadValue(result, procedureVariable.type.resolved);
  6266. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6267. END;
  6268. Emit(Call(position,result.op,size));
  6269. END CallProcedure;
  6270. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6271. VAR res: Operand; string: SyntaxTree.String;
  6272. BEGIN
  6273. SaveRegisters();ReleaseUsedRegisters(saved);
  6274. IF GetProcedure("String") THEN
  6275. NEW(string, LEN(s)); COPY(s, string^);
  6276. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6277. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6278. sv.SetType(type);
  6279. Designate(sv,res);
  6280. Emit(Push(position,res.tag));
  6281. Emit(Push(position,res.op));
  6282. ReleaseOperand(res);
  6283. CallProcedure;
  6284. END;
  6285. RestoreRegisters(saved);
  6286. END String;
  6287. PROCEDURE Integer(op: IntermediateCode.Operand);
  6288. BEGIN
  6289. SaveRegisters();ReleaseUsedRegisters(saved);
  6290. IF GetProcedure("Int") THEN
  6291. Emit(Push(position,op));
  6292. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6293. CallProcedure;
  6294. END;
  6295. RestoreRegisters(saved);
  6296. END Integer;
  6297. PROCEDURE Float(op: IntermediateCode.Operand);
  6298. BEGIN
  6299. SaveRegisters();ReleaseUsedRegisters(saved);
  6300. IF GetProcedure("HIntHex") THEN
  6301. Emit(Push(position,op));
  6302. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6303. CallProcedure;
  6304. END;
  6305. RestoreRegisters(saved);
  6306. END Float;
  6307. PROCEDURE Set(op: IntermediateCode.Operand);
  6308. BEGIN
  6309. SaveRegisters();ReleaseUsedRegisters(saved);
  6310. IF GetProcedure("Set") THEN
  6311. Emit(Push(position,op));
  6312. (*
  6313. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6314. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6315. *)
  6316. CallProcedure;
  6317. END;
  6318. RestoreRegisters(saved);
  6319. END Set;
  6320. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6321. BEGIN
  6322. SaveRegisters();ReleaseUsedRegisters(saved);
  6323. IF GetProcedure("Boolean") THEN
  6324. Emit(Push(position,op));
  6325. CallProcedure;
  6326. END;
  6327. RestoreRegisters(saved);
  6328. END Boolean;
  6329. PROCEDURE Char(op: IntermediateCode.Operand);
  6330. BEGIN
  6331. SaveRegisters();ReleaseUsedRegisters(saved);
  6332. IF GetProcedure("Char") THEN
  6333. Emit(Push(position,op));
  6334. CallProcedure;
  6335. END;
  6336. RestoreRegisters(saved);
  6337. END Char;
  6338. PROCEDURE Address(op: IntermediateCode.Operand);
  6339. BEGIN
  6340. SaveRegisters();ReleaseUsedRegisters(saved);
  6341. IF GetProcedure("Address") THEN
  6342. Emit(Push(position,op));
  6343. CallProcedure;
  6344. END;
  6345. RestoreRegisters(saved);
  6346. END Address;
  6347. PROCEDURE Size(op: IntermediateCode.Operand);
  6348. BEGIN
  6349. SaveRegisters();ReleaseUsedRegisters(saved);
  6350. IF GetProcedure("Size") THEN
  6351. Emit(Push(position,op));
  6352. CallProcedure;
  6353. END;
  6354. RestoreRegisters(saved);
  6355. END Size;
  6356. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6357. VAR len: IntermediateCode.Operand;
  6358. BEGIN
  6359. SaveRegisters();ReleaseUsedRegisters(saved);
  6360. IF GetProcedure("String") THEN
  6361. len := GetArrayLength(type, op.tag);
  6362. Emit(Push(position,len));
  6363. ReleaseIntermediateOperand(len);
  6364. Emit(Push(position,op.op));
  6365. CallProcedure;
  6366. END;
  6367. RestoreRegisters(saved);
  6368. END StringOperand;
  6369. PROCEDURE Ln;
  6370. BEGIN
  6371. SaveRegisters();ReleaseUsedRegisters(saved);
  6372. IF GetProcedure("Ln") THEN
  6373. CallProcedure;
  6374. END;
  6375. RestoreRegisters(saved);
  6376. END Ln;
  6377. BEGIN
  6378. IF backend.traceModuleName = "" THEN RETURN END;
  6379. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6380. IF GetProcedure("Enter") THEN
  6381. SaveRegisters();ReleaseUsedRegisters(saved);
  6382. CallProcedure;
  6383. RestoreRegisters(saved);
  6384. END;
  6385. NEW(stringWriter,LEN(s));
  6386. FOR i := 0 TO x.Length()-1 DO
  6387. msg := "";
  6388. expression := x.GetExpression(i);
  6389. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6390. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6391. ELSE
  6392. Global.GetModuleName(module.module, s);
  6393. END;
  6394. IF i = 0 THEN
  6395. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6396. stringWriter.String(":");
  6397. END;
  6398. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6399. IF ~(expression IS SyntaxTree.StringValue) THEN
  6400. printout.Expression(expression);
  6401. stringWriter.Get(s);
  6402. Strings.Append(msg,s);
  6403. Strings.Append(msg,"= ");
  6404. ELSE stringWriter.Get(s); (* remove from string writer *)
  6405. Strings.Append(msg, s);
  6406. END;
  6407. String(msg);
  6408. IF SemanticChecker.IsStringType(expression.type) THEN
  6409. Designate(expression,res);
  6410. StringOperand(res, expression.type);
  6411. ELSE
  6412. Evaluate(expression,res);
  6413. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6414. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6415. Convert(res.op,int64);
  6416. END;
  6417. Integer(res.op);
  6418. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6419. Boolean(res.op);
  6420. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6421. Set(res.op);
  6422. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6423. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6424. Convert(res.op,float64);
  6425. END;
  6426. Float(res.op);
  6427. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6428. Char(res.op);
  6429. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6430. Address(res.op);String("H");
  6431. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6432. Size(res.op);
  6433. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6434. Address(res.op);String("H");
  6435. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6436. Address(res.op);String("H");
  6437. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6438. String("NIL");
  6439. ELSE HALT(200);
  6440. END;
  6441. END;
  6442. ReleaseOperand(res);
  6443. String("; ");
  6444. END;
  6445. IF GetProcedure("Exit") THEN
  6446. SaveRegisters();ReleaseUsedRegisters(saved);
  6447. CallProcedure;
  6448. RestoreRegisters(saved);
  6449. ELSE
  6450. Ln;
  6451. END;
  6452. END;
  6453. END SystemTrace;
  6454. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6455. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6456. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6457. BEGIN
  6458. type := type.resolved;
  6459. IF type IS SyntaxTree.RecordType THEN
  6460. WITH type: SyntaxTree.RecordType DO
  6461. baseType := type.baseType;
  6462. IF baseType # NIL THEN
  6463. baseType := baseType.resolved;
  6464. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6465. InitFields(baseType,adr,offset);
  6466. END;
  6467. variable := type.recordScope.firstVariable;
  6468. WHILE variable # NIL DO
  6469. IF variable.initializer # NIL THEN
  6470. Evaluate(variable.initializer,initializerOp);
  6471. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6472. Emit(Mov(position,mem,initializerOp.op));
  6473. ReleaseOperand(initializerOp);
  6474. ReleaseIntermediateOperand(mem);
  6475. END;
  6476. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6477. variable := variable.nextVariable
  6478. END;
  6479. END;
  6480. ELSIF type IS SyntaxTree.CellType THEN
  6481. WITH type: SyntaxTree.CellType DO
  6482. baseType := type.baseType;
  6483. IF baseType # NIL THEN
  6484. baseType := baseType.resolved;
  6485. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6486. InitFields(baseType,adr,offset);
  6487. END;
  6488. variable := type.cellScope.firstVariable;
  6489. WHILE variable # NIL DO
  6490. IF variable.initializer # NIL THEN
  6491. Evaluate(variable.initializer,initializerOp);
  6492. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6493. Emit(Mov(position,mem,initializerOp.op));
  6494. ReleaseOperand(initializerOp);
  6495. ReleaseIntermediateOperand(mem);
  6496. END;
  6497. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6498. variable := variable.nextVariable
  6499. END;
  6500. END;
  6501. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6502. WITH type: SyntaxTree.ArrayType DO
  6503. IF type.form = SyntaxTree.Static THEN
  6504. baseType := type.arrayBase;
  6505. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6506. FOR i := 0 TO type.staticLength-1 DO
  6507. InitFields(baseType,adr,offset+i*size);
  6508. END;
  6509. END;
  6510. END;
  6511. ELSIF type IS SyntaxTree.MathArrayType THEN
  6512. WITH type: SyntaxTree.MathArrayType DO
  6513. IF type.form = SyntaxTree.Open THEN
  6514. dim := DynamicDim(type);
  6515. imm := IntermediateCode.Immediate(addressType,dim);
  6516. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6517. baseType := SemanticChecker.ArrayBase(type,dim);
  6518. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6519. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6520. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6521. ReleaseIntermediateOperand(imm);
  6522. (* flags remain empty (=0) for open array *)
  6523. ELSIF type.form = SyntaxTree.Static THEN
  6524. baseType := type.arrayBase;
  6525. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6526. ASSERT(type.staticLength < 1024*1024*1024);
  6527. FOR i := 0 TO type.staticLength-1 DO
  6528. InitFields(baseType,adr,offset+i*size);
  6529. END;
  6530. END;
  6531. END;
  6532. END;
  6533. END InitFields;
  6534. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6535. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6536. saved: RegisterEntry;
  6537. BEGIN
  6538. type := variable.type.resolved;
  6539. IF (type IS SyntaxTree.MathArrayType) THEN
  6540. WITH type: SyntaxTree.MathArrayType DO
  6541. IF type.form = SyntaxTree.Open THEN
  6542. Symbol(variable,operand);
  6543. InitFields(type, operand.tag,0);
  6544. IF temporary THEN
  6545. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6546. END;
  6547. ELSIF type.form = SyntaxTree.Tensor THEN
  6548. IF temporary & backend.writeBarriers THEN
  6549. SaveRegisters();ReleaseUsedRegisters(saved);
  6550. Symbol(variable, operand);
  6551. Emit(Push(position,operand.op));
  6552. ReleaseOperand(operand);
  6553. Emit(Push(position,nil));
  6554. CallThis(position,"FoxArrayBase","Assign",2);
  6555. RestoreRegisters(saved);
  6556. ELSE
  6557. Symbol(variable, operand);
  6558. MakeMemory(tmp,operand.op,addressType,0);
  6559. ReleaseOperand(operand);
  6560. IF FALSE & temporary THEN
  6561. (* trick -- temporary object from array base *)
  6562. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6563. Symbol(symbol,operand);
  6564. MakeMemory(mem,operand.op,addressType,0);
  6565. ReleaseOperand(operand);
  6566. Emit(Mov(position,tmp, mem) );
  6567. ReleaseOperand(operand);
  6568. ELSE
  6569. Emit(Mov(position,tmp, nil ) );
  6570. END;
  6571. ReleaseIntermediateOperand(tmp)
  6572. END;
  6573. END;
  6574. END;
  6575. ELSE
  6576. Symbol(variable,operand);
  6577. IF variable.initializer # NIL THEN
  6578. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL, NIL,variable);
  6579. reference.SetType(variable.type.resolved);
  6580. reference.SetAssignable(TRUE);
  6581. Assign(reference,variable.initializer);
  6582. ELSIF temporary THEN
  6583. IF SemanticChecker.IsPointerType(variable.type) THEN
  6584. IF backend.cooperative THEN
  6585. SaveRegisters();ReleaseUsedRegisters(saved);
  6586. Symbol(variable, operand);
  6587. CallAssignPointer(operand.op, nil);
  6588. ReleaseOperand(operand);
  6589. RestoreRegisters(saved);
  6590. ELSIF backend.writeBarriers THEN
  6591. SaveRegisters();ReleaseUsedRegisters(saved);
  6592. Symbol(variable, operand);
  6593. Emit(Push(position,operand.op));
  6594. ReleaseOperand(operand);
  6595. Emit(Push(position,nil));
  6596. CallThis(position,"Heaps","Assign",2);
  6597. RestoreRegisters(saved);
  6598. ELSE
  6599. Symbol(variable, operand);
  6600. MakeMemory(tmp,operand.op,addressType,0);
  6601. ReleaseOperand(operand);
  6602. Emit(Mov(position,tmp, nil ) );
  6603. ReleaseIntermediateOperand(tmp);
  6604. END;
  6605. END;
  6606. END;
  6607. InitFields(type, operand.op,0);
  6608. ReleaseOperand(operand);
  6609. END;
  6610. END InitVariable;
  6611. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6612. VAR end: Label;
  6613. BEGIN
  6614. IF type.form = SyntaxTree.Tensor THEN
  6615. InitOperand(result,ModeValue);
  6616. ReuseCopy(result.op,base);
  6617. end := NewLabel();
  6618. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6619. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6620. SetLabel(end);
  6621. Convert(result.op,lenType);
  6622. ELSE
  6623. InitOperand(result,ModeValue);
  6624. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6625. END
  6626. END MathArrayDim;
  6627. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6628. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6629. BEGIN
  6630. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6631. MakeMemory(mem,base,addressType,offset);
  6632. Emit(Mov(position,mem,value));
  6633. ReleaseIntermediateOperand(mem);
  6634. END PutMathArrayField;
  6635. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6636. VAR mem: IntermediateCode.Operand;
  6637. BEGIN
  6638. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6639. MakeMemory(mem,base,addressType,offset);
  6640. Emit(Mov(position,mem,value));
  6641. ReleaseIntermediateOperand(mem);
  6642. END PutMathArrayFieldOffset;
  6643. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6644. BEGIN
  6645. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6646. MakeMemory(value,base,addressType,offset);
  6647. END GetMathArrayField;
  6648. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6649. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6650. BEGIN
  6651. IF incr THEN
  6652. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6653. ELSE
  6654. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6655. END;
  6656. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6657. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6658. ELSE
  6659. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6660. Emit(Mov(position,reg,dim));
  6661. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6662. Emit(Add(position,reg,reg,base));
  6663. MakeMemory(mem, reg, addressType, offset);
  6664. ReleaseIntermediateOperand(reg);
  6665. Emit(Mov(position,mem,value));
  6666. ReleaseIntermediateOperand(mem);
  6667. END;
  6668. END PutMathArrayLenOrIncr;
  6669. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6670. BEGIN
  6671. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6672. END PutMathArrayLength;
  6673. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6674. BEGIN
  6675. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6676. END PutMathArrayIncrement;
  6677. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6678. BEGIN
  6679. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6680. END GetMathArrayIncrement;
  6681. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6682. BEGIN
  6683. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6684. END GetMathArrayLength;
  6685. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6686. VAR dimOp: IntermediateCode.Operand;
  6687. BEGIN
  6688. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6689. GetMathArrayLength(type, operand, dimOp, check, result);
  6690. END GetMathArrayLengthAt;
  6691. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6692. VAR dimOp: IntermediateCode.Operand;
  6693. BEGIN
  6694. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6695. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6696. END GetMathArrayIncrementAt;
  6697. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6698. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6699. offset: LONGINT;
  6700. BEGIN
  6701. IF increment THEN
  6702. offset := MathIncrOffset;
  6703. ELSE
  6704. offset := MathLenOffset;
  6705. END;
  6706. INC(offset,operand.dimOffset*2);
  6707. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6708. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6709. END;
  6710. (* static dimension *)
  6711. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6712. IF check & (type.form = SyntaxTree.Tensor) THEN
  6713. DimensionCheck(operand.tag,dim,BrltL);
  6714. END;
  6715. val := SHORT(dim.intValue);
  6716. IF type.form # SyntaxTree.Tensor THEN
  6717. t := SemanticChecker.ArrayBase(type,val);
  6718. type := t.resolved(SyntaxTree.MathArrayType);
  6719. IF type.form = SyntaxTree.Static THEN
  6720. IF increment THEN
  6721. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6722. ELSE
  6723. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6724. END;
  6725. InitOperand(result,ModeValue);
  6726. result.op := res;
  6727. RETURN;
  6728. END;
  6729. END;
  6730. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6731. MakeMemory(res,operand.tag,addressType,offset);
  6732. (*
  6733. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6734. *)
  6735. InitOperand(result,ModeValue);
  6736. result.op := res;
  6737. ELSE
  6738. Convert(dim,addressType);
  6739. IF check THEN
  6740. IF type.form = SyntaxTree.Tensor THEN
  6741. DimensionCheck(operand.tag,dim,BrltL);
  6742. ELSIF isUnchecked THEN (* do nothing *)
  6743. ELSE
  6744. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6745. END;
  6746. END;
  6747. end := NewLabel(); next := NIL;
  6748. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6749. Emit(Mov(position,res,dim));
  6750. Convert(res,sizeType);
  6751. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6752. WHILE t IS SyntaxTree.MathArrayType DO
  6753. type := t(SyntaxTree.MathArrayType);
  6754. IF type.form = SyntaxTree.Static THEN
  6755. imm := IntermediateCode.Immediate(sizeType,val);
  6756. next := NewLabel();
  6757. BrneL(next,imm,res);
  6758. IF increment THEN
  6759. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6760. ELSE
  6761. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6762. END;
  6763. Emit(MovReplace(position,res,imm));
  6764. BrL(end);
  6765. ELSE hasDynamicPart := TRUE;
  6766. END;
  6767. t := type.arrayBase.resolved;
  6768. val := val + 1;
  6769. IF next # NIL THEN SetLabel(next) END;
  6770. END;
  6771. IF hasDynamicPart THEN
  6772. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6773. Emit(Mov(position,res2,dim));
  6774. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6775. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6776. Emit(Add(position,res2,res2,imm));
  6777. Emit(Add(position,res2,res2,operand.tag));
  6778. IntermediateCode.MakeMemory(res2,sizeType);
  6779. Emit(MovReplace(position,res,res2));
  6780. ReleaseIntermediateOperand(res2);
  6781. END;
  6782. SetLabel(end);
  6783. Convert(res,sizeType);
  6784. InitOperand(result,ModeValue);
  6785. result.op := res;
  6786. END;
  6787. END MathArrayLenOrIncr;
  6788. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6789. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6790. offset: LONGINT;
  6791. BEGIN
  6792. offset := operand.dimOffset+DynamicDim(type)-1;
  6793. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6794. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6795. val := SHORT(dim.intValue);
  6796. t := SemanticChecker.ArrayBase(type,val);
  6797. type := t.resolved(SyntaxTree.ArrayType);
  6798. IF type.form = SyntaxTree.Static THEN
  6799. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6800. ELSE
  6801. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6802. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6803. END;
  6804. UseIntermediateOperand(res);
  6805. InitOperand(result,ModeValue);
  6806. result.op := res;
  6807. ELSE
  6808. Convert(dim,addressType);
  6809. IF ~isUnchecked THEN
  6810. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6811. END;
  6812. end := NewLabel(); next := NIL;
  6813. (* ReuseCopy(dim,res); *)
  6814. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6815. Emit(Mov(position,res,dim));
  6816. Convert(res,sizeType);
  6817. Convert(res,sizeType);
  6818. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6819. WHILE t IS SyntaxTree.ArrayType DO
  6820. type := t(SyntaxTree.ArrayType);
  6821. IF type.form = SyntaxTree.Static THEN
  6822. imm := IntermediateCode.Immediate(sizeType,val);
  6823. next := NewLabel();
  6824. BrneL(next,imm,res);
  6825. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6826. Emit(MovReplace(position,res,imm));
  6827. BrL(end);
  6828. ELSE hasDynamicPart := TRUE;
  6829. END;
  6830. t := type.arrayBase.resolved;
  6831. val := val + 1;
  6832. IF next # NIL THEN SetLabel(next) END;
  6833. END;
  6834. IF hasDynamicPart THEN
  6835. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6836. Convert(res2,addressType);
  6837. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6838. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6839. Emit(Sub(position,res2,imm,res2));
  6840. Emit(Add(position,res2,res2,operand.tag));
  6841. IntermediateCode.MakeMemory(res2,sizeType);
  6842. Emit(MovReplace(position,res,res2));
  6843. ReleaseIntermediateOperand(res2);
  6844. END;
  6845. SetLabel(end);
  6846. Convert(res,sizeType);
  6847. InitOperand(result,ModeValue);
  6848. result.op := res;
  6849. END;
  6850. END ArrayLen;
  6851. (**
  6852. create a temporary variable in current scope
  6853. **)
  6854. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6855. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6856. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6857. BEGIN
  6858. IF ~register THEN
  6859. v := temporaries.GetFreeVariable(type, untraced, index);
  6860. ELSE
  6861. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6862. END;
  6863. scope := currentScope;
  6864. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6865. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6866. END;
  6867. (*
  6868. v := NIL; (* to disable free variable managemenet temporarily *)
  6869. *)
  6870. name := temporaries.GetUID();
  6871. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6872. variable.SetType(type);
  6873. variable.SetAccess(SyntaxTree.Hidden);
  6874. variable.SetUntraced(untraced);
  6875. IF v = NIL THEN
  6876. temporaries.AddVariable(variable);
  6877. IF ~register THEN
  6878. scope.AddVariable(variable(SyntaxTree.Variable));
  6879. ASSERT(system.GenerateVariableOffsets(scope));
  6880. scope.EnterSymbol(variable, duplicate);
  6881. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6882. ELSE
  6883. variable.PreferRegister(TRUE);
  6884. variable(SyntaxTree.Variable).SetOffset(0);
  6885. END;
  6886. ELSE (* v # NIL *)
  6887. (* reuse slot for new variable, do not create new slot ! *)
  6888. temporaries.SetVariable(index, variable);
  6889. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6890. ASSERT(~register);
  6891. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6892. ASSERT((v.offsetInBits # 0) & (v.offsetInBits # MIN(LONGINT)));
  6893. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6894. scope.EnterSymbol(variable, duplicate);
  6895. ASSERT(~duplicate);
  6896. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6897. END;
  6898. RETURN variable(SyntaxTree.Variable)
  6899. END GetTemporaryVariable;
  6900. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6901. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6902. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6903. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6904. i: LONGINT; duplicate: BOOLEAN;
  6905. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6906. VAR variable: SyntaxTree.Variable;
  6907. BEGIN
  6908. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6909. variable.SetType(type);
  6910. recordScope.AddVariable(variable);
  6911. END AddVariable;
  6912. BEGIN
  6913. name := "@ArrayDescriptor";
  6914. Basic.AppendNumber(name,dimensions);
  6915. identifier := SyntaxTree.NewIdentifier(name);
  6916. parentScope := module.module.moduleScope;
  6917. symbol := parentScope.FindSymbol(identifier);
  6918. IF symbol # NIL THEN
  6919. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6920. type := typeDeclaration.declaredType;
  6921. ELSE
  6922. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6923. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6924. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6925. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6926. recordType.SetTypeDeclaration(typeDeclaration);
  6927. recordType.SetState(SyntaxTree.Resolved);
  6928. typeDeclaration.SetDeclaredType(recordType);
  6929. AddVariable("@ptr",system.anyType);
  6930. AddVariable("@adr",system.addressType);
  6931. AddVariable("@flags",system.addressType);
  6932. AddVariable("@dim",system.addressType);
  6933. AddVariable("@elementSize",system.addressType);
  6934. FOR i := 0 TO dimensions-1 DO
  6935. name := "@len";
  6936. Basic.AppendNumber(name,i);
  6937. AddVariable(name,system.addressType);
  6938. name := "@incr";
  6939. Basic.AppendNumber(name,i);
  6940. AddVariable(name,system.addressType);
  6941. END;
  6942. parentScope.AddTypeDeclaration(typeDeclaration);
  6943. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6944. ASSERT(~duplicate);
  6945. type := recordType;
  6946. END;
  6947. RETURN type
  6948. END GetMathArrayDescriptorType;
  6949. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6950. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6951. BEGIN
  6952. NEW(string, LEN(s)); COPY(s, string^);
  6953. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6954. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6955. sv.SetType(type);
  6956. Designate(sv,res);
  6957. Emit(Push(position,res.tag));
  6958. Emit(Push(position,res.op));
  6959. ReleaseOperand(res);
  6960. END PushConstString;
  6961. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6962. BEGIN
  6963. IF b THEN
  6964. Emit(Push(Basic.invalidPosition, true));
  6965. ELSE
  6966. Emit(Push(Basic.invalidPosition, false));
  6967. END;
  6968. END PushConstBoolean;
  6969. PROCEDURE PushConstSet(v: SET);
  6970. VAR value: SyntaxTree.Value; op: Operand;
  6971. BEGIN
  6972. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6973. value.SetType(system.setType);
  6974. Evaluate(value, op);
  6975. Emit(Push(Basic.invalidPosition, op.op));
  6976. ReleaseOperand(op);
  6977. END PushConstSet;
  6978. PROCEDURE PushConstInteger(v: LONGINT);
  6979. VAR value: SyntaxTree.Value; op: Operand;
  6980. BEGIN
  6981. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6982. value.SetType(system.longintType);
  6983. Evaluate(value, op);
  6984. Emit(Push(Basic.invalidPosition, op.op));
  6985. ReleaseOperand(op);
  6986. END PushConstInteger;
  6987. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6988. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6989. section: IntermediateCode.Section;
  6990. BEGIN
  6991. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6992. Global.GetSymbolSegmentedName(symbol, name);
  6993. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6994. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6995. procedure.SetScope(moduleScope);
  6996. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6997. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6998. procedure.SetAccess(SyntaxTree.Hidden);
  6999. currentScope := procedureScope;
  7000. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7001. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7002. RETURN section;
  7003. END OpenInitializer;
  7004. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7005. BEGIN
  7006. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7007. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7008. section := prev;
  7009. END CloseInitializer;
  7010. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7011. VAR name: SyntaxTree.IdentifierString;
  7012. parameter: SyntaxTree.Parameter;
  7013. type: SyntaxTree.Type;
  7014. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7015. BEGIN
  7016. InitOperand(op,ModeReference);
  7017. op.op := fp;
  7018. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7019. Dereference(op, x, FALSE);
  7020. result := op;
  7021. Symbol(symbol, op);
  7022. END Field;
  7023. PROCEDURE Direction(direction: LONGINT): SET;
  7024. BEGIN
  7025. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7026. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7027. ELSE HALT(100);
  7028. END;
  7029. END Direction;
  7030. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7031. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7032. BEGIN
  7033. Field(port, op);
  7034. ToMemory(op.op,addressType,0);
  7035. Emit(Push(Basic.invalidPosition, op.op));
  7036. ReleaseOperand(op);
  7037. Basic.GetString(modifier.identifier, name);
  7038. PushConstString(name);
  7039. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7040. ASSERT(SemanticChecker.IsStringType(value.type));
  7041. Designate(value, op);
  7042. Emit(Push(modifier.position, op.tag));
  7043. Emit(Push(modifier.position, op.op));
  7044. ReleaseOperand(op);
  7045. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7046. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7047. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7048. Evaluate(value, op);
  7049. Emit(Push(modifier.position, op.op));
  7050. ReleaseOperand(op);
  7051. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7052. ELSE
  7053. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7054. END;
  7055. END AddPortProperty;
  7056. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7057. VAR modifier: SyntaxTree.Modifier;
  7058. BEGIN
  7059. modifier := parameter.modifiers;
  7060. WHILE modifier # NIL DO
  7061. AddPortProperty(parameter,modifier, modifier.expression);
  7062. modifier := modifier.nextModifier;
  7063. END;
  7064. END AddPortProperties;
  7065. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7066. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7067. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7068. PROCEDURE PushLens(type: SyntaxTree.Type);
  7069. BEGIN
  7070. IF IsSemiDynamicArray(type) THEN
  7071. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7072. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7073. Emit(Push(Basic.invalidPosition, op.op));
  7074. ReleaseOperand(op);
  7075. INC(dim);
  7076. ELSIF IsStaticArray(type) THEN
  7077. len := len * type(SyntaxTree.ArrayType).staticLength;
  7078. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7079. INC(dim);
  7080. ELSE
  7081. baseType := type;
  7082. END;
  7083. END PushLens;
  7084. BEGIN
  7085. (* cell *)
  7086. IF parameter.type IS SyntaxTree.ArrayType THEN
  7087. type := parameter.type;
  7088. dim := 0;
  7089. len := 1;
  7090. PushLens(type);
  7091. portType := baseType.resolved(SyntaxTree.PortType);
  7092. ELSE
  7093. portType := parameter.type(SyntaxTree.PortType);
  7094. END;
  7095. PushSelfPointer();
  7096. (* port / array of ports *)
  7097. IF IsStaticArray(type) THEN
  7098. PushConstInteger(len);
  7099. END;
  7100. Field(parameter, op);
  7101. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7102. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7103. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7104. Designate(d, op);*)
  7105. Emit(Push(Basic.invalidPosition, op.op));
  7106. ReleaseOperand(op);
  7107. (* name *)
  7108. PushConstString(name);
  7109. (* inout *)
  7110. PushConstSet(Direction(portType.direction));
  7111. (* width *)
  7112. PushConstInteger(portType.sizeInBits);
  7113. IF parameter.type IS SyntaxTree.PortType THEN
  7114. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7115. AddPortProperties(parameter);
  7116. ELSIF IsStaticArray(type)THEN
  7117. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7118. ELSIF IsSemiDynamicArray(type) THEN
  7119. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7120. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7121. Emit(Add(position,reg, sp, size));
  7122. (* dim *)
  7123. PushConstInteger(dim);
  7124. (* len array *)
  7125. Emit(Push(position, reg));
  7126. ReleaseIntermediateOperand(reg);
  7127. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7128. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7129. Emit(Add(position, sp,sp, size));
  7130. ELSE
  7131. HALT(100);
  7132. END;
  7133. END Parameter;
  7134. BEGIN
  7135. IF backend.cellsAreObjects THEN
  7136. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7137. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7138. END;
  7139. parameter := x.firstParameter;
  7140. WHILE (parameter # NIL) DO
  7141. type := parameter.type.resolved;
  7142. WHILE (type IS SyntaxTree.ArrayType) DO
  7143. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7144. END;
  7145. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7146. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7147. Parameter(name,parameter);
  7148. END;
  7149. parameter := parameter.nextParameter;
  7150. END;
  7151. ELSE HALT(200)
  7152. END;
  7153. END AddPorts;
  7154. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7155. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7156. BEGIN
  7157. Symbol(cell,op);
  7158. ToMemory(op.op,addressType,0);
  7159. Emit(Push(position,op.op));
  7160. ReleaseOperand(op);
  7161. property.GetName(name);
  7162. (* does not work when inheritance is used:
  7163. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7164. *)
  7165. PushConstString(name);
  7166. IF (value # NIL) THEN
  7167. ASSERT(
  7168. SemanticChecker.IsStringType(property.type)
  7169. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7170. OR (property.type.resolved IS SyntaxTree.FloatType)
  7171. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7172. OR (property.type.resolved IS SyntaxTree.SetType)
  7173. );
  7174. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,left,cell); left.SetType(system.anyType);
  7175. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, NIL,left); left.SetType(cellType);
  7176. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL,left, property); d.SetType(property.type);
  7177. Designate(d, op);
  7178. IF SemanticChecker.IsStringType(property.type) THEN
  7179. Emit(Push(Basic.invalidPosition, op.tag))
  7180. END;
  7181. Emit(Push(Basic.invalidPosition, op.op));
  7182. ReleaseOperand(op);
  7183. END;
  7184. IF value = NIL THEN
  7185. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7186. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7187. ASSERT(SemanticChecker.IsStringType(value.type));
  7188. Designate(value, op);
  7189. PushString(op, value.type);
  7190. ReleaseOperand(op);
  7191. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7192. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7193. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7194. Evaluate(value, op);
  7195. Emit(Push(property.position, op.op));
  7196. ReleaseOperand(op);
  7197. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7198. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7199. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7200. Evaluate(value, op);
  7201. Emit(Push(property.position, op.op));
  7202. ReleaseOperand(op);
  7203. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7204. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7205. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7206. Evaluate(value, op);
  7207. Emit(Push(property.position, op.op));
  7208. ReleaseOperand(op);
  7209. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7210. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7211. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7212. Evaluate(value, op);
  7213. Emit(Push(property.position, op.op));
  7214. ReleaseOperand(op);
  7215. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7216. ELSE
  7217. HALT(200);
  7218. END;
  7219. END AddProperty;
  7220. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7221. VAR symbol: SyntaxTree.Symbol;
  7222. BEGIN
  7223. WHILE modifier # NIL DO
  7224. symbol := cellType.FindProperty(modifier.identifier);
  7225. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7226. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7227. modifier := modifier.nextModifier;
  7228. END;
  7229. END AddModifiers;
  7230. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7231. VAR last: SyntaxTree.Modifier;
  7232. BEGIN
  7233. IF to = NIL THEN
  7234. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7235. ELSE
  7236. last := to;
  7237. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7238. last := last.nextModifier;
  7239. END;
  7240. IF last.identifier # this.identifier THEN
  7241. ASSERT(last.nextModifier = NIL);
  7242. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7243. END;
  7244. END;
  7245. END AppendModifier;
  7246. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7247. BEGIN
  7248. WHILE this # NIL DO
  7249. AppendModifier(to, this);
  7250. this := this.nextModifier;
  7251. END;
  7252. END AppendModifiers;
  7253. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7254. VAR base: SyntaxTree.Type;
  7255. BEGIN
  7256. AppendModifiers(to, c.modifiers);
  7257. base := c.GetBaseValueType();
  7258. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7259. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7260. END;
  7261. END AppendCellTypeModifiers;
  7262. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7263. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7264. BEGIN
  7265. Basic.GetString(modifier.identifier, name);
  7266. PushConstString(name);
  7267. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7268. ASSERT(SemanticChecker.IsStringType(value.type));
  7269. Designate(value, op);
  7270. PushString(op, value.type);
  7271. ReleaseOperand(op);
  7272. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7273. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7274. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7275. Evaluate(value, op);
  7276. Emit(Push(modifier.position, op.op));
  7277. ReleaseOperand(op);
  7278. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7279. ELSE
  7280. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7281. END;
  7282. END AddPortProperty;
  7283. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7284. BEGIN
  7285. WHILE modifier # NIL DO
  7286. AddPortProperty(modifier, modifier.expression);
  7287. modifier := modifier.nextModifier;
  7288. END;
  7289. END AddPortProperties;
  7290. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7291. VAR op: Operand;
  7292. BEGIN
  7293. Evaluate(p, op);
  7294. Emit(Push(p.position, op.op));
  7295. ReleaseOperand(op);
  7296. IF p IS SyntaxTree.Designator THEN
  7297. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7298. END;
  7299. END PushPort;
  7300. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7301. VAR tmp: IntermediateCode.Operand;
  7302. BEGIN
  7303. actualType := actualType.resolved;
  7304. IF actualType IS SyntaxTree.StringType THEN
  7305. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7306. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7307. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7308. ELSE
  7309. tmp := op.tag;
  7310. IntermediateCode.MakeMemory(tmp,addressType);
  7311. Emit(Push(position,tmp));
  7312. END;
  7313. Emit(Push(position,op.op))
  7314. END PushString;
  7315. (* conservative check if x is potentially on the heap, excluding the module heap
  7316. required for generational garbage collector
  7317. *)
  7318. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7319. BEGIN
  7320. RETURN TRUE;
  7321. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7322. passed by reference.
  7323. pos := x.position.start;
  7324. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7325. x := x(SyntaxTree.Designator).left;
  7326. END;
  7327. RETURN x # NIL;
  7328. *)
  7329. END OnHeap;
  7330. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7331. VAR
  7332. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7333. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7334. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7335. tmp:IntermediateCode.Operand;
  7336. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7337. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7338. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7339. dest: IntermediateCode.Operand;
  7340. staticLength: LONGINT; itype: IntermediateCode.Type;
  7341. convert,isTensor: BOOLEAN;
  7342. recordType: SyntaxTree.RecordType;
  7343. baseType: SyntaxTree.Type;
  7344. left: SyntaxTree.Expression;
  7345. call: SyntaxTree.Designator;
  7346. procedure: SyntaxTree.Procedure;
  7347. temporaryVariable: SyntaxTree.Variable;
  7348. dummy: IntermediateCode.Operand;
  7349. customBuiltin: SyntaxTree.CustomBuiltin;
  7350. isVarPar: ARRAY 3 OF BOOLEAN;
  7351. callsection: Sections.Section;
  7352. segmentedName: Basic.SegmentedName;
  7353. needsTrace: BOOLEAN;
  7354. n: ARRAY 256 OF CHAR;
  7355. modifier: SyntaxTree.Modifier;
  7356. previous, init: IntermediateCode.Section;
  7357. prevScope: SyntaxTree.Scope;
  7358. firstPar: LONGINT;
  7359. saved: RegisterEntry;
  7360. callingConvention: SyntaxTree.CallingConvention;
  7361. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7362. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7363. priority: IntermediateCode.Operand;
  7364. op,callop: Operand;
  7365. BEGIN
  7366. IF type = NIL THEN RETURN END;
  7367. type := type.resolved;
  7368. IF type IS SyntaxTree.PointerType THEN
  7369. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7370. END;
  7371. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7372. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7373. recordScope := type(SyntaxTree.RecordType).recordScope;
  7374. IF recordScope.bodyProcedure # NIL THEN
  7375. procedure := recordScope.bodyProcedure;
  7376. body := procedure.procedureScope.body;
  7377. Emit(Push(position,self));
  7378. IF body.isActive THEN
  7379. StaticCallOperand(callop,procedure);
  7380. Emit(Push(position,callop.op));
  7381. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7382. Convert(priority,sizeType);
  7383. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7384. END;
  7385. Emit(Push(position,priority));
  7386. ReleaseIntermediateOperand(priority);
  7387. IF backend.cooperative THEN
  7388. Emit(Push(position,self));
  7389. CallThis(position,"Activities","Create",3)
  7390. ELSE
  7391. flags := 0;
  7392. IF body.isSafe THEN
  7393. flags := 1;
  7394. END;
  7395. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7396. Emit(Push(position,self));
  7397. CallThis(position,"Objects","CreateProcess",4)
  7398. END;
  7399. ELSE
  7400. Emit(Push(position,self));
  7401. StaticCallOperand(callop,procedure);
  7402. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7403. END;
  7404. Emit(Pop(position,self));
  7405. END;
  7406. END CallBodies;
  7407. PROCEDURE PushTD(type: SyntaxTree.Type);
  7408. VAR op: IntermediateCode.Operand;
  7409. BEGIN
  7410. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7411. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7412. ELSE
  7413. IF type.resolved IS SyntaxTree.PointerType THEN
  7414. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7415. END;
  7416. op := TypeDescriptorAdr(type.resolved);
  7417. Emit(Push(position,op));
  7418. END
  7419. END PushTD;
  7420. BEGIN
  7421. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7422. dest := destination; destination := emptyOperand;
  7423. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7424. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7425. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7426. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7427. CASE x.id OF
  7428. (* ---- COPY ----- *)
  7429. |Global.Copy:
  7430. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7431. (* ---- EXCL, INCL----- *)
  7432. |Global.Excl,Global.Incl:
  7433. Evaluate(p0,s0);
  7434. Evaluate(p1,s1);
  7435. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7436. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7437. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7438. END;
  7439. ReuseCopy(res,s0.op);
  7440. ReleaseOperand(s0);
  7441. Reuse1(tmp,s1.op);
  7442. ReleaseOperand(s1);
  7443. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7444. IF x.id = Global.Excl THEN
  7445. Emit(Not(position,tmp,tmp));
  7446. Emit(And(position,res,res,tmp));
  7447. ELSE
  7448. Emit(Or(position,res,res,tmp));
  7449. END;
  7450. ReleaseIntermediateOperand(tmp);
  7451. Designate(p0,s0);
  7452. ToMemory(s0.op,s1.op.type,0);
  7453. Emit(Mov(position,s0.op,res));
  7454. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7455. (* ---- DISPOSE ----- *)
  7456. |Global.Dispose:
  7457. Designate(p0,s0);
  7458. Emit(Push(position,s0.op));
  7459. ReleaseOperand(s0);
  7460. CallThis(position,"Runtime","Dispose", 1);
  7461. (* ---- GETPROCEDURE ----- *)
  7462. |Global.GetProcedure:
  7463. Designate(p0,s0);
  7464. PushString(s0,p0.type);
  7465. Designate(p1,s1);
  7466. PushString(s1,p1.type);
  7467. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7468. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7469. ELSE PushTD(procedureType.firstParameter.type)
  7470. END;
  7471. PushTD(procedureType.returnType);
  7472. Designate(p2,s2);
  7473. Emit(Push(position,s2.op));
  7474. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7475. CallThis(position,"Modules","GetProcedure", 7);
  7476. (* ---- ASH, LSH, ROT ----- *)
  7477. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7478. Evaluate(p0,s0);
  7479. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7480. (* make unsigned arguments in order to produced a logical shift *)
  7481. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7482. convert:= TRUE;
  7483. itype := s0.op.type;
  7484. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7485. Convert(s0.op,itype);
  7486. ELSE
  7487. convert := FALSE;
  7488. END;
  7489. END;
  7490. Evaluate(p1,s1);
  7491. IF IsIntegerConstant(p1,hint) THEN
  7492. ReuseCopy(reg,s0.op);
  7493. IF hint > 0 THEN
  7494. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7495. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7496. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7497. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7498. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7499. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7500. END;
  7501. ELSIF hint < 0 THEN
  7502. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7503. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7504. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7505. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7506. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7507. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7508. END;
  7509. END;
  7510. ReleaseOperand(s0); ReleaseOperand(s1);
  7511. ELSE
  7512. exit := NewLabel();
  7513. end := NewLabel();
  7514. ReuseCopy(reg,s0.op);
  7515. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7516. Reuse1(tmp,s1.op);
  7517. Emit(Neg(position,tmp,s1.op));
  7518. Convert(tmp,s1.op.type);
  7519. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7520. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7521. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7522. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7523. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7524. END;
  7525. ReleaseIntermediateOperand(tmp);
  7526. BrL(end);
  7527. SetLabel(exit);
  7528. ReuseCopy(tmp,s1.op);
  7529. Convert(tmp,s1.op.type);
  7530. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7531. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7532. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7533. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7534. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7535. END;
  7536. ReleaseIntermediateOperand(tmp);
  7537. SetLabel(end);
  7538. ReleaseOperand(s0); ReleaseOperand(s1);
  7539. END;
  7540. InitOperand(result,ModeValue);
  7541. IF convert THEN
  7542. itype := reg.type;
  7543. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7544. Convert(reg,itype);
  7545. END;
  7546. result.op := reg;
  7547. (* ---- CAP ----- *)
  7548. |Global.Cap:
  7549. Evaluate(p0,result);
  7550. ReuseCopy(reg,result.op);
  7551. ReleaseIntermediateOperand(result.op);
  7552. ignore := NewLabel();
  7553. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7554. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7555. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7556. SetLabel(ignore);
  7557. result.op := reg;
  7558. (* ---- CHR ----- *)
  7559. |Global.Chr, Global.Chr32:
  7560. Evaluate(p0,result);
  7561. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7562. |Global.Entier, Global.EntierH:
  7563. Evaluate(p0,result);
  7564. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7565. (* ---- MIN and MAX ----- *)
  7566. |Global.Max,Global.Min:
  7567. Evaluate(p0,s0);
  7568. Evaluate(p1,s1);
  7569. Reuse2(res,s0.op,s1.op);
  7570. else := NewLabel();
  7571. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7572. ELSE BrltL(else,s1.op,s0.op) END;
  7573. Emit(Mov(position,res,s0.op));
  7574. ReleaseOperand(s0);
  7575. end := NewLabel();
  7576. BrL(end);
  7577. SetLabel(else);
  7578. Emit(MovReplace(position,res,s1.op));
  7579. SetLabel(end);
  7580. ReleaseOperand(s1);
  7581. InitOperand(result,ModeValue);
  7582. result.op := res;
  7583. (* ---- ODD ----- *)
  7584. |Global.Odd:
  7585. Evaluate(p0,result);
  7586. Reuse1(res,result.op);
  7587. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7588. ReleaseIntermediateOperand(result.op);
  7589. result.op := res;
  7590. Convert(result.op,bool);
  7591. (* ---- ORD ----- *)
  7592. |Global.Ord, Global.Ord32:
  7593. Evaluate(p0,result);
  7594. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7595. (* ---- SHORT, LONG ----- *)
  7596. |Global.Short, Global.Long:
  7597. Evaluate(p0,result);
  7598. IF x.type IS SyntaxTree.ComplexType THEN
  7599. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7600. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7601. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7602. ELSE
  7603. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7604. END
  7605. (* ---- HALT, SYSTEM.HALT----- *)
  7606. |Global.Halt, Global.systemHalt:
  7607. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7608. EmitTrap (position, val);
  7609. (* ---- ASSERT ----- *)
  7610. |Global.Assert:
  7611. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7612. trueL := NewLabel();
  7613. Condition(p0,trueL,TRUE);
  7614. IF p1 = NIL THEN val := AssertTrap
  7615. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7616. END;
  7617. EmitTrap(position,val);
  7618. SetLabel(trueL);
  7619. END;
  7620. (*
  7621. Emit(TrapC(result.op,val);
  7622. *)
  7623. (* ---- INC, DEC----- *)
  7624. |Global.Inc,Global.Dec:
  7625. Expression(p0); adr := result.op;
  7626. s0 := result;
  7627. LoadValue(result,p0.type);
  7628. (* EXPERIMENTAL *)
  7629. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7630. availableSymbols[s0.availability].inMemory := FALSE;
  7631. END;
  7632. l := result;
  7633. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7634. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7635. END;
  7636. IF x.id = Global.Inc THEN
  7637. Emit(Add(position,l.op,l.op,r.op));
  7638. ELSE
  7639. Emit(Sub(position,l.op,l.op,r.op));
  7640. END;
  7641. ReleaseOperand(l); ReleaseOperand(r);
  7642. (* ---- LEN ----- *)
  7643. |Global.Len: (* dynamic length, static length done by checker *)
  7644. Designate(p0,operand);
  7645. IF p1 = NIL THEN
  7646. InitOperand(l,ModeValue);
  7647. l.op := IntermediateCode.Immediate(sizeType,0);
  7648. ELSE
  7649. Evaluate(p1,l);
  7650. END;
  7651. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7652. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7653. Dereference(operand, p0.type.resolved, FALSE);
  7654. END;
  7655. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7656. ReleaseOperand(operand); ReleaseOperand(l);
  7657. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7658. ASSERT(p1 # NIL);
  7659. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7660. Dereference(operand,p0.type.resolved,FALSE);
  7661. END;
  7662. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7663. ReleaseOperand(operand); ReleaseOperand(l);
  7664. ELSE HALT(100);
  7665. END;
  7666. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7667. (* ---- FIRST ---- *)
  7668. |Global.First:
  7669. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7670. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7671. ELSE
  7672. Designate(p0, result)
  7673. END
  7674. (* ---- LAST ---- *)
  7675. |Global.Last:
  7676. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7677. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7678. ELSE
  7679. Designate(p0, result);
  7680. (* make sure result.op is a register *)
  7681. tmp := result.op;
  7682. ReuseCopy(result.op, result.op);
  7683. ReleaseIntermediateOperand(tmp);
  7684. (* add offset to result.op *)
  7685. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7686. END
  7687. (* ---- STEP ---- *)
  7688. |Global.Step:
  7689. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7690. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7691. ELSE
  7692. Designate(p0, result);
  7693. (* make sure result.op is a register *)
  7694. tmp := result.op;
  7695. ReuseCopy(result.op, result.op);
  7696. ReleaseIntermediateOperand(tmp);
  7697. (* add offset to result.op *)
  7698. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7699. END
  7700. (* ---- RE ---- *)
  7701. |Global.Re:
  7702. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7703. Designate(p0, result)
  7704. ELSE
  7705. Evaluate(p0, result)
  7706. END
  7707. (* ---- IM ---- *)
  7708. |Global.Im:
  7709. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7710. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7711. Designate(p0, result);
  7712. (* make sure result.op is a register *)
  7713. tmp := result.op;
  7714. ReuseCopy(result.op, result.op);
  7715. ReleaseIntermediateOperand(tmp);
  7716. (* add offset to result.op *)
  7717. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7718. (* ---- ABS ----- *)
  7719. |Global.Abs:
  7720. Evaluate(p0,operand);
  7721. type := p0.type.resolved;
  7722. InitOperand(result,ModeValue);
  7723. Reuse1a(result.op,operand.op,dest);
  7724. Emit(Abs(position,result.op,operand.op));
  7725. ReleaseOperand(operand);
  7726. (* ---- WAIT ----- *)
  7727. |Global.Wait:
  7728. Evaluate(p0,operand);
  7729. Emit(Push(position,operand.op));
  7730. ReleaseOperand(operand);
  7731. CallThis(position,"Activities","Wait", 1);
  7732. (* ---- NEW ----- *)
  7733. |Global.New:
  7734. (*! the following code is only correct for "standard" Oberon calling convention *)
  7735. IF x.type # NIL THEN
  7736. type := x.type.resolved;
  7737. firstPar := 0;
  7738. ELSE
  7739. type := p0.type.resolved;
  7740. firstPar := 1;
  7741. END;
  7742. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7743. THEN
  7744. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7745. IF backend.cooperative THEN
  7746. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7747. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7748. IF recordType.isObject THEN
  7749. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7750. IF recordType.IsActive() THEN
  7751. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7752. END;
  7753. IF recordType.IsProtected() THEN
  7754. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7755. END;
  7756. ELSE
  7757. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7758. END;
  7759. END;
  7760. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7761. CallThis(position,"Runtime","New", 1);
  7762. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7763. Emit(Result(position, pointer));
  7764. exit := NewLabel();
  7765. BreqL(exit,pointer,nil);
  7766. GetRecordTypeName (recordType,name);
  7767. IF ~recordType.isObject THEN
  7768. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7769. END;
  7770. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7771. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7772. IF recordType.isObject THEN
  7773. IF recordType.IsProtected() THEN
  7774. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7775. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7776. END;
  7777. IF recordType.IsActive() THEN
  7778. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7779. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7780. END;
  7781. END;
  7782. (* initialize fields *)
  7783. IF type(SyntaxTree.PointerType).isPlain THEN
  7784. size := 0;
  7785. ELSIF recordType.isObject THEN
  7786. size := BaseObjectTypeSize;
  7787. ELSE
  7788. size := BaseRecordTypeSize;
  7789. END;
  7790. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7791. (* call initializer *)
  7792. constructor := GetConstructor(recordType);
  7793. IF constructor # NIL THEN
  7794. (*! should be unified with ProcedureCallDesignator *)
  7795. Emit(Push(position,pointer));
  7796. ReleaseIntermediateOperand(pointer);
  7797. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7798. FOR i := firstPar TO x.parameters.Length()-1 DO
  7799. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7800. formalParameter := formalParameter.nextParameter;
  7801. END;
  7802. (* static call of the constructor *)
  7803. GetCodeSectionNameForSymbol(constructor,name);
  7804. ASSERT(~constructor.isInline);
  7805. IF constructor.scope.ownerModule # module.module THEN
  7806. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7807. ELSE
  7808. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7809. END;
  7810. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7811. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7812. Emit(Pop(position,pointer));
  7813. END;
  7814. (* call bodies *)
  7815. CallBodies(pointer,type);
  7816. SetLabel(exit);
  7817. needsTrace := p0.NeedsTrace();
  7818. IF needsTrace THEN ModifyAssignments(true) END;
  7819. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7820. Emit(Push(position, pointer));
  7821. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7822. Emit(Pop(position, pointer));
  7823. END;
  7824. Designate(p0,l);
  7825. IF needsTrace THEN
  7826. CallAssignPointer(l.op, pointer);
  7827. ELSE
  7828. ToMemory(l.op,addressType,0);
  7829. Emit(Mov(position,l.op,pointer));
  7830. END;
  7831. ReleaseIntermediateOperand(pointer);
  7832. ReleaseOperand(l);
  7833. IF needsTrace THEN ModifyAssignments(false) END;
  7834. ELSE (* not cooperative backend *)
  7835. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7836. IF temporaryVariable # NIL THEN
  7837. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7838. ELSE
  7839. Designate(p0,l);
  7840. END;
  7841. (* l.op contains address of pointer to record *)
  7842. Emit(Push(position,l.op)); (* address for use after syscall *)
  7843. Emit(Push(position,l.op));
  7844. ReleaseOperand(l);
  7845. (* push type descriptor *)
  7846. reg := TypeDescriptorAdr(recordType);
  7847. Emit(Push(position,reg));
  7848. ReleaseIntermediateOperand(reg);
  7849. (* push realtime flag *)
  7850. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7851. ELSE Emit(Push(position,false));
  7852. END;
  7853. CallThis(position,"Heaps","NewRec", 3);
  7854. (* check allocation success, if not successful then do not call initializers and bodies *)
  7855. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7856. Emit(Pop(position,pointer));
  7857. MakeMemory(reg,pointer,addressType,0);
  7858. ReleaseIntermediateOperand(pointer);
  7859. pointer := reg;
  7860. exit := NewLabel();
  7861. BreqL(exit,pointer,nil);
  7862. Emit(Push(position,pointer));
  7863. (* initialize fields *)
  7864. InitFields(recordType, pointer,0);
  7865. (* call initializer *)
  7866. constructor := GetConstructor(recordType);
  7867. IF constructor # NIL THEN
  7868. (*! should be unified with ProcedureCallDesignator *)
  7869. Emit(Push(position,pointer));
  7870. ReleaseIntermediateOperand(pointer);
  7871. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7872. FOR i := firstPar TO x.parameters.Length()-1 DO
  7873. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7874. formalParameter := formalParameter.nextParameter;
  7875. END;
  7876. (* static call of the constructor *)
  7877. GetCodeSectionNameForSymbol(constructor,name);
  7878. ASSERT(~constructor.isInline);
  7879. IF constructor.scope.ownerModule # module.module THEN
  7880. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7881. ELSE
  7882. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7883. END;
  7884. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7885. ELSE
  7886. ReleaseIntermediateOperand(pointer);
  7887. END;
  7888. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7889. Emit(Pop(position,pointer));
  7890. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7891. Designate(p0,l);
  7892. IF backend.writeBarriers & OnHeap(p0) THEN
  7893. SaveRegisters();ReleaseUsedRegisters(saved);
  7894. Emit(Push(position,l.op));
  7895. Emit(Push(position,pointer));
  7896. CallThis(position,"Heaps","Assign",2);
  7897. RestoreRegisters(saved);
  7898. ELSE
  7899. ToMemory(l.op,addressType,0);
  7900. Emit(Mov(position,l.op,pointer));
  7901. END;
  7902. ReleaseOperand(l);
  7903. result.tag := emptyOperand;
  7904. ELSIF (x.type # NIL) THEN
  7905. result := l; (* temporary variable is the result of NEW Type() *)
  7906. END;
  7907. (* call bodies *)
  7908. CallBodies(pointer,type);
  7909. ReleaseIntermediateOperand(pointer);
  7910. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7911. end := NewLabel();
  7912. BrL(end);
  7913. SetLabel(exit);
  7914. Designate(p0,l);
  7915. ToMemory(l.op,addressType,0);
  7916. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7917. ReleaseOperand(l);
  7918. SetLabel(end);
  7919. ELSE
  7920. SetLabel(exit);
  7921. END;
  7922. END;
  7923. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7924. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7925. IF ~backend.cooperative THEN (* simpler version *)
  7926. (*
  7927. push len0
  7928. push len1
  7929. push len2
  7930. push len_size
  7931. push len_adr
  7932. push tag
  7933. push static elements
  7934. push element size
  7935. push adr
  7936. *)
  7937. dim := 0;
  7938. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7939. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7940. parameter := x.parameters.GetExpression(i);
  7941. Evaluate(parameter,r);
  7942. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7943. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7944. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7945. END;
  7946. Emit(Push(position,r.op));
  7947. ReleaseOperand(r);
  7948. INC(dim);
  7949. END;
  7950. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7951. Emit(Mov(position, adr, sp));
  7952. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7953. Emit(Push(position, adr));
  7954. ReleaseIntermediateOperand(adr);
  7955. openDim := dim;
  7956. staticLength := 1;
  7957. IF type IS SyntaxTree.ArrayType THEN
  7958. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7959. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7960. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7961. END;
  7962. END;
  7963. IF SemanticChecker.ContainsPointer(type) THEN
  7964. tmp := TypeDescriptorAdr(type);
  7965. ELSE
  7966. tmp := nil;
  7967. END;
  7968. Emit(Push(position,tmp)); (* type descriptor *)
  7969. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7970. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7971. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7972. Designate(p0,l);
  7973. Emit(Push(position,l.op)); (* address *)
  7974. ReleaseOperand(l);
  7975. CallThis(position,"Heaps","NewArray", 6);
  7976. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7977. Emit(Add(position,sp,sp,tmp));
  7978. ELSE
  7979. dim := 0;
  7980. IntermediateCode.InitOperand(reg);
  7981. IF p1 # NIL THEN
  7982. FOR i := firstPar TO x.parameters.Length()-1 DO
  7983. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7984. parameter := x.parameters.GetExpression(i);
  7985. Evaluate(parameter,r);
  7986. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7987. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7988. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7989. END;
  7990. Emit(Push(position,r.op));
  7991. IF i=1 THEN
  7992. CopyInt(reg,r.op);
  7993. ELSE
  7994. MulInt(reg, reg, r.op);
  7995. END;
  7996. ReleaseOperand(r);
  7997. INC(dim);
  7998. END;
  7999. Convert(reg,addressType);
  8000. ELSE
  8001. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8002. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8003. END;
  8004. openDim := dim;
  8005. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8006. IF backend.cooperative THEN
  8007. size := ToMemoryUnits(system,system.SizeOf(type));
  8008. WHILE type IS SyntaxTree.ArrayType DO
  8009. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8010. END;
  8011. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8012. IF (size # 1) THEN
  8013. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8014. END;
  8015. Emit(Push(position,reg));
  8016. size := ToMemoryUnits(system,system.SizeOf(type));
  8017. IF (size # 1) THEN
  8018. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8019. END;
  8020. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8021. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8022. Emit(Push(position,reg));
  8023. ReleaseIntermediateOperand(reg);
  8024. CallThis(position,"Runtime","New", 1);
  8025. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8026. Emit(Result(position, pointer));
  8027. exit := NewLabel();
  8028. else := NewLabel();
  8029. BreqL(else,pointer,nil);
  8030. IF ~type.hasPointers THEN
  8031. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8032. ELSIF type IS SyntaxTree.RecordType THEN
  8033. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8034. ELSIF type IS SyntaxTree.ProcedureType THEN
  8035. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8036. ELSE
  8037. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8038. END;
  8039. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8040. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8041. 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))));
  8042. IF type IS SyntaxTree.RecordType THEN
  8043. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8044. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8045. ELSE
  8046. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8047. END;
  8048. i := openDim;
  8049. WHILE i > 0 DO
  8050. DEC (i);
  8051. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8052. END;
  8053. needsTrace := p0.NeedsTrace();
  8054. IF needsTrace THEN ModifyAssignments(true) END;
  8055. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8056. Emit(Push(position, pointer));
  8057. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8058. Emit(Pop(position, pointer));
  8059. END;
  8060. Designate(p0,l);
  8061. IF needsTrace THEN
  8062. CallAssignPointer(l.op, pointer);
  8063. ModifyAssignments(false);
  8064. ELSE
  8065. ToMemory(l.op,addressType,0);
  8066. Emit(Mov(position,l.op,pointer));
  8067. END;
  8068. ReleaseIntermediateOperand(pointer);
  8069. ReleaseOperand(l);
  8070. BrL(exit);
  8071. SetLabel(else);
  8072. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8073. Designate(p0,l);
  8074. IF needsTrace THEN
  8075. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8076. ELSE
  8077. ToMemory(l.op,addressType,0);
  8078. Emit(Mov(position,l.op,pointer));
  8079. END;
  8080. ReleaseOperand(l);
  8081. SetLabel(exit);
  8082. ELSE
  8083. (*! the following code is only correct for "standard" Oberon calling convention *)
  8084. IF SemanticChecker.ContainsPointer(type) THEN
  8085. IF type IS SyntaxTree.ArrayType THEN
  8086. staticLength := 1;
  8087. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8088. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8089. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8090. END;
  8091. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8092. MulInt(reg,reg,tmp);
  8093. END;
  8094. Designate(p0,l);
  8095. IF openDim > 0 THEN
  8096. Emit(Push(position,l.op)); (* address for use after syscall *)
  8097. END;
  8098. Emit(Push(position,l.op)); (* address *)
  8099. ReleaseOperand(l);
  8100. tmp := TypeDescriptorAdr(type);
  8101. Emit(Push(position,tmp)); (* type descriptor *)
  8102. ReleaseIntermediateOperand(tmp);
  8103. Emit(Push(position,reg)); (* number Elements *)
  8104. ReleaseIntermediateOperand(reg);
  8105. tmp := IntermediateCode.Immediate(addressType,dim);
  8106. Emit(Push(position,tmp)); (* dimensions *)
  8107. (* push realtime flag *)
  8108. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8109. ELSE Emit(Push(position,false));
  8110. END;
  8111. CallThis(position,"Heaps","NewArr",5)
  8112. ELSE
  8113. size := ToMemoryUnits(system,system.SizeOf(type));
  8114. IF (size # 1) THEN
  8115. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8116. (*
  8117. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8118. *)
  8119. END;
  8120. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8121. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8122. AddInt(reg, reg, tmp);
  8123. (*
  8124. Emit(Add(position,reg,reg,tmp));
  8125. *)
  8126. Designate(p0,l);
  8127. IF openDim >0 THEN
  8128. Emit(Push(position,l.op)); (* address for use after syscall *)
  8129. END;
  8130. Emit(Push(position,l.op)); (* address for syscall *)
  8131. ReleaseOperand(l); (* pointer address *)
  8132. Emit(Push(position,reg)); (* size *)
  8133. ReleaseIntermediateOperand(reg);
  8134. (* push realtime flag *)
  8135. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8136. ELSE Emit(Push(position,false));
  8137. END;
  8138. CallThis(position,"Heaps","NewSys", 3)
  8139. END;
  8140. IF openDim > 0 THEN
  8141. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8142. Emit(Pop(position,adr));
  8143. ToMemory(adr,addressType,0);
  8144. ReuseCopy(tmp,adr);
  8145. ReleaseIntermediateOperand(adr);
  8146. adr := tmp;
  8147. else := NewLabel();
  8148. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8149. i := openDim-1;
  8150. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8151. WHILE (i >= 0) DO
  8152. Emit(Pop(position,reg));
  8153. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8154. Emit(Mov(position,res,reg));
  8155. DEC(i);
  8156. END;
  8157. ReleaseIntermediateOperand(adr);
  8158. ReleaseIntermediateOperand(reg);
  8159. exit := NewLabel();
  8160. BrL(exit);
  8161. SetLabel(else);
  8162. (* else part: array could not be allocated *)
  8163. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8164. Emit(Add(position,sp,sp,tmp));
  8165. SetLabel(exit);
  8166. END;
  8167. END;
  8168. END;
  8169. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8170. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8171. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8172. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL, NIL,procedure);
  8173. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8174. callingConvention := procedureType.callingConvention;
  8175. left.SetType(procedure.type);
  8176. formalParameter := procedureType.firstParameter;
  8177. (* push array to allocate *)
  8178. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8179. formalParameter :=formalParameter.nextParameter;
  8180. (* push length array *)
  8181. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8182. (* push size *)
  8183. type := t0;
  8184. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8185. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8186. END;
  8187. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8188. Emit(Push(position,tmp));
  8189. (* *)
  8190. IF SemanticChecker.ContainsPointer(type) THEN
  8191. tmp := TypeDescriptorAdr(type);
  8192. ELSE
  8193. tmp := IntermediateCode.Immediate(addressType, 0);
  8194. END;
  8195. Emit(Push(position,tmp)); (* type descriptor *)
  8196. StaticCallOperand(result,procedure);
  8197. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8198. ReleaseOperand(result);
  8199. END;
  8200. (*
  8201. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8202. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8203. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8204. *)
  8205. ELSE
  8206. (*
  8207. push len0
  8208. push len1
  8209. push len2
  8210. push size
  8211. push len_adr
  8212. push element_size
  8213. push tag
  8214. push adr
  8215. *)
  8216. dim := 0;
  8217. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8218. isTensor := TRUE;
  8219. ELSE
  8220. isTensor := FALSE;
  8221. END;
  8222. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8223. IF ~isTensor THEN
  8224. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8225. END;
  8226. parameter := x.parameters.GetExpression(i);
  8227. Evaluate(parameter,r);
  8228. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8229. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8230. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8231. END;
  8232. Emit(Push(position,r.op));
  8233. ReleaseOperand(r);
  8234. INC(dim);
  8235. END;
  8236. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8237. Emit(Mov(position, adr, sp));
  8238. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8239. Emit(Push(position, adr));
  8240. ReleaseIntermediateOperand(adr);
  8241. openDim := dim;
  8242. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8243. IF isTensor THEN
  8244. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8245. ELSE
  8246. baseType := SemanticChecker.ArrayBase(type,openDim);
  8247. END;
  8248. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8249. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8250. IF SemanticChecker.ContainsPointer(baseType) THEN
  8251. tmp := TypeDescriptorAdr(baseType);
  8252. ELSE
  8253. tmp := nil;
  8254. END;
  8255. Emit(Push(position,tmp)); (* type descriptor *)
  8256. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8257. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8258. ELSE (* error message has already been emited *)
  8259. RETURN;
  8260. END;
  8261. Designate(p0,l);
  8262. IF isTensor THEN
  8263. Emit(Push(position,l.op)); (* address *)
  8264. ELSE
  8265. Emit(Push(position,l.tag)); (* address *)
  8266. END;
  8267. ReleaseOperand(l);
  8268. StaticCallOperand(result,procedure);
  8269. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8270. ReleaseOperand(result);
  8271. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8272. Emit(Add(position,sp,sp,tmp));
  8273. END;
  8274. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8275. THEN
  8276. IF ~backend.cellsAreObjects THEN RETURN END;
  8277. IF InCellScope(currentScope) THEN
  8278. PushSelfPointer()
  8279. ELSE
  8280. Emit(Push(position, nil));
  8281. END;
  8282. (* push temp address *)
  8283. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8284. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8285. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8286. (* l.op contains address of pointer to record *)
  8287. Emit(Push(position,l.op)); (* address for use after syscall *)
  8288. ReleaseOperand(l);
  8289. (* push type descriptor *)
  8290. reg := TypeDescriptorAdr(baseType);
  8291. Emit(Push(position,reg));
  8292. ReleaseIntermediateOperand(reg);
  8293. (* push name *)
  8294. (*Global.GetSymbolName(p0, n);*)
  8295. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8296. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8297. ELSE
  8298. Global.GetModuleName(module.module, n);
  8299. END;
  8300. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8301. (*type.typeDeclaration.GetName(n);*)
  8302. PushConstString(n);
  8303. (* push cellnet boolean *)
  8304. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8305. (* push engine boolean *)
  8306. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8307. (* allocate *)
  8308. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8309. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8310. (* l.op contains address of pointer to record *)
  8311. ToMemory(l.op,addressType,0);
  8312. (* l.op contains value of pointer to record *)
  8313. InitFields(baseType, l.op,0);
  8314. (* add capabilities *)
  8315. modifier := p0(SyntaxTree.Designator).modifiers;
  8316. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8317. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8318. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8319. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8320. END;
  8321. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8322. (*
  8323. modifier := baseType(SyntaxTree.CellType).modifiers;
  8324. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8325. modifier := p0(SyntaxTree.Designator).modifiers;
  8326. *)
  8327. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8328. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8329. (* l.op contains address of pointer to record *)
  8330. ToMemory(l.op,addressType,0);
  8331. (* l.op contains value of pointer to record *)
  8332. Emit(Push(position,l.op)); (* address for use after syscall *)
  8333. ReleaseOperand(l);
  8334. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8335. prevScope := currentScope;
  8336. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8337. previous := section;
  8338. section := init;
  8339. (* add ports *)
  8340. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8341. CloseInitializer(previous);
  8342. currentScope := prevScope;
  8343. Symbol(temporaryVariable,l);
  8344. ToMemory(l.op,addressType,0);
  8345. Emit(Push(position,l.op));
  8346. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8347. (*
  8348. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8349. IF constructor # NIL THEN
  8350. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8351. FOR i := 1 TO x.parameters.Length()-1 DO
  8352. p := x.parameters.GetExpression(i);
  8353. Global.GetSymbolName(parameter,name);
  8354. Evaluate(p, value);
  8355. ASSERT(value.type # NIL);
  8356. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8357. par := instance.AddParameter(name);
  8358. par.SetInteger(value.integer);
  8359. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8360. par := instance.AddParameter(name);
  8361. par.SetBoolean(value.boolean);
  8362. ELSE Error(x.position,NotYetImplemented)
  8363. END;
  8364. parameter := parameter.nextParameter
  8365. END;
  8366. END;
  8367. *)
  8368. (* call initializer *)
  8369. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8370. IF constructor # NIL THEN
  8371. (*! should be unified with ProcedureCallDesignator *)
  8372. IF backend.cellsAreObjects THEN
  8373. Symbol(temporaryVariable,l);
  8374. ToMemory(l.op,addressType,0);
  8375. Emit(Push(position,l.op));
  8376. ReleaseOperand(l);
  8377. END;
  8378. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8379. FOR i := firstPar TO x.parameters.Length()-1 DO
  8380. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8381. formalParameter := formalParameter.nextParameter;
  8382. END;
  8383. (* static call of the constructor *)
  8384. Global.GetSymbolSegmentedName(constructor,name);
  8385. ASSERT(~constructor.isInline);
  8386. IF constructor.scope.ownerModule # module.module THEN
  8387. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8388. ELSE
  8389. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8390. END;
  8391. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8392. (*ELSE
  8393. ReleaseIntermediateOperand(pointer);*)
  8394. END;
  8395. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8396. ToMemory(l.op, addressType, 0);
  8397. Designate(p0,s0);
  8398. ToMemory(s0.op,addressType,0);
  8399. Emit(Mov(position,s0.op,l.op));
  8400. ReleaseOperand(l);
  8401. ReleaseOperand(s0);
  8402. result.tag := emptyOperand;
  8403. (* start *)
  8404. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8405. (* push cell *)
  8406. Symbol(temporaryVariable, l);
  8407. ToMemory(l.op,addressType,0);
  8408. Emit(Push(Basic.invalidPosition,l.op));
  8409. (* push delegate *)
  8410. Emit(Push(Basic.invalidPosition,l.op));
  8411. ReleaseOperand(l);
  8412. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8413. Emit(Push(position, s1.op));
  8414. ReleaseOperand(s1);
  8415. CallThis(position,"ActiveCellsRuntime","Start",3);
  8416. END;
  8417. (*IF temporaryVariable # NIL THEN
  8418. end := NewLabel();
  8419. BrL(end);
  8420. SetLabel(exit);
  8421. Designate(p0,l);
  8422. ToMemory(l.op,addressType,0);
  8423. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8424. ReleaseOperand(l);
  8425. SetLabel(end);
  8426. ELSE
  8427. SetLabel(exit);
  8428. END;
  8429. *)
  8430. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8431. ELSE (* no pointer to record, no pointer to array *)
  8432. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8433. (* ignore new statement *)
  8434. Warning(p0.position, "cannot run on final hardware");
  8435. ELSE
  8436. HALT(200);
  8437. END;
  8438. END;
  8439. (* ---- ADDRESSOF----- *)
  8440. |Global.systemAdr:
  8441. Designate(p0,s0);
  8442. s0.mode := ModeValue;
  8443. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8444. ReleaseIntermediateOperand(s0.op);
  8445. s0.op := s0.tag;
  8446. IntermediateCode.InitOperand(s0.tag);
  8447. END;
  8448. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8449. result := s0;
  8450. (* ---- BIT ----- *)
  8451. |Global.systemBit:
  8452. Evaluate(p0,s0);
  8453. ToMemory(s0.op,addressType,0);
  8454. ReuseCopy(res,s0.op);
  8455. ReleaseOperand(s0);
  8456. Evaluate(p1,s1);
  8457. Emit(Ror(position,res,res,s1.op));
  8458. ReleaseOperand(s1);
  8459. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8460. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8461. InitOperand(result,ModeValue);
  8462. result.op := res;
  8463. (* --- MSK ----*)
  8464. |Global.systemMsk:
  8465. Evaluate(p0,s0);
  8466. Evaluate(p1,s1);
  8467. ReuseCopy(res,s0.op);
  8468. ReleaseOperand(s0);
  8469. Emit(And(position,res,res,s1.op));
  8470. ReleaseOperand(s1);
  8471. InitOperand(result,ModeValue);
  8472. result.op := res;
  8473. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8474. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8475. Evaluate(p0,s0);
  8476. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8477. ReleaseOperand(s0);
  8478. InitOperand(result,ModeValue);
  8479. result.op := res;
  8480. (* ---- SYSTEM.GetStackPointer ----- *)
  8481. |Global.systemGetStackPointer:
  8482. InitOperand(result,ModeValue);
  8483. result.op := sp;
  8484. (* ---- SYSTEM.GetFramePointer ----- *)
  8485. |Global.systemGetFramePointer:
  8486. InitOperand(result,ModeValue);
  8487. result.op := fp;
  8488. (* ---- SYSTEM.GetActivity ----- *)
  8489. |Global.systemGetActivity:
  8490. ASSERT(backend.cooperative);
  8491. InitOperand(result,ModeValue);
  8492. result.op := ap;
  8493. (* ---- SYSTEM.SetStackPointer ----- *)
  8494. |Global.systemSetStackPointer:
  8495. Evaluate(p0,s0); (* *)
  8496. Emit(Mov(position,sp,s0.op));
  8497. ReleaseOperand(s0);
  8498. (* ---- SYSTEM.SetFramePointer ----- *)
  8499. |Global.systemSetFramePointer:
  8500. Evaluate(p0,s0); (* *)
  8501. Emit(Mov(position,fp,s0.op));
  8502. ReleaseOperand(s0);
  8503. (* ---- SYSTEM.Activity ----- *)
  8504. |Global.systemSetActivity:
  8505. ASSERT(backend.cooperative);
  8506. Evaluate(p0,s0); (* *)
  8507. Emit(Mov(position,ap,s0.op));
  8508. ReleaseOperand(s0);
  8509. (* ---- SYSTEM.VAL ----- *)
  8510. |Global.systemVal:
  8511. Expression(p1);
  8512. s1 := result;
  8513. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8514. IF s1.mode = ModeReference THEN
  8515. (* nothing to be done if not record type, just take over new type *)
  8516. IF (type IS SyntaxTree.RecordType) THEN
  8517. ReleaseIntermediateOperand(s1.tag);
  8518. s1.tag := TypeDescriptorAdr(type);
  8519. UseIntermediateOperand(s1.tag);
  8520. END;
  8521. result := s1;
  8522. ELSE (* copy over result to different type, may not use convert *)
  8523. itype := IntermediateCode.GetType(system,type);
  8524. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8525. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8526. Emit(Mov(position,s0.op,s1.op));
  8527. ReleaseOperand(s1);
  8528. InitOperand(result,ModeValue);
  8529. result.op := s0.op;
  8530. ELSE (* different size, must convert *)
  8531. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8532. Convert(s1.op, IntermediateCode.GetType(system,type));
  8533. result := s1;
  8534. END;
  8535. END;
  8536. (* ---- SYSTEM.GET ----- *)
  8537. |Global.systemGet:
  8538. Evaluate(p0,s0); (* adr *)
  8539. Designate(p1,s1); (* variable *)
  8540. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8541. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8542. Emit(Mov(position,s1.op,s0.op));
  8543. ReleaseOperand(s1);
  8544. ReleaseOperand(s0);
  8545. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8546. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8547. Evaluate(p0,s0); (* *)
  8548. Evaluate(p1,s1); (* variable *)
  8549. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8550. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8551. (* real part *)
  8552. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8553. Emit(Mov(position,res, s1.op));
  8554. ReleaseIntermediateOperand(res);
  8555. (* imaginary part *)
  8556. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8557. Emit(Mov(position,res, s1.tag));
  8558. ReleaseIntermediateOperand(res);
  8559. ReleaseOperand(s1);
  8560. ReleaseOperand(s0);
  8561. ELSE
  8562. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8563. ReleaseOperand(s0);
  8564. Emit(Mov(position,res,s1.op));
  8565. ReleaseIntermediateOperand(res);
  8566. ReleaseOperand(s1);
  8567. END;
  8568. (* ---- SYSTEM.MOVE ----- *)
  8569. |Global.systemMove:
  8570. Evaluate(p0,s0);
  8571. Evaluate(p1,s1);
  8572. Evaluate(p2,s2);
  8573. Emit(Copy(position,s1.op,s0.op,s2.op));
  8574. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8575. (* ---- SYSTEM.NEW ----- *)
  8576. |Global.systemNew:
  8577. Designate(p0,s0);
  8578. Emit(Push(position,s0.op));
  8579. ReleaseOperand(s0);
  8580. Evaluate(p1,s1);
  8581. Emit(Push(position,s1.op));
  8582. ReleaseOperand(s1);
  8583. (* push realtime flag: false by default *)
  8584. Emit(Push(position,false));
  8585. CallThis(position,"Heaps","NewSys",3);
  8586. (* ---- SYSTEM.CALL ----- *)
  8587. |Global.systemRef:
  8588. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8589. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8590. s0.mode := ModeValue;
  8591. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8592. result := s0
  8593. (* ---- INCR ----- *)
  8594. |Global.Incr:
  8595. Designate(p0,operand);
  8596. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8597. Dereference(operand,p0.type.resolved,FALSE);
  8598. END;
  8599. ASSERT(p1 # NIL);
  8600. Evaluate(p1,l);
  8601. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8602. ReleaseOperand(operand); ReleaseOperand(l);
  8603. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8604. (* ---- SUM ----- *)
  8605. |Global.Sum: HALT(200);
  8606. (* ---- ALL ----- *)
  8607. |Global.All: HALT(200);
  8608. (* ---- CAS ----- *)
  8609. |Global.Cas:
  8610. needsTrace := backend.cooperative & p0.NeedsTrace();
  8611. IF needsTrace THEN ModifyAssignments(true) END;
  8612. Designate(p0,s0);
  8613. Evaluate(p1,s1);
  8614. Evaluate(p2,s2);
  8615. IF needsTrace THEN
  8616. Emit(Push(position, s0.op));
  8617. Emit(Push(position, s1.op));
  8618. Emit(Push(position, s2.op));
  8619. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8620. ELSE
  8621. Emit(Cas(position,s0.op,s1.op,s2.op));
  8622. END;
  8623. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8624. IF needsTrace THEN ModifyAssignments(false) END;
  8625. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8626. Emit(Result(position, res));
  8627. result.op := res;
  8628. result.mode := ModeValue;
  8629. (*
  8630. IF conditional THEN
  8631. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8632. BrL(falseLabel);
  8633. ReleaseIntermediateOperand(res);
  8634. END;
  8635. *)
  8636. (* ---- DIM ----- *)
  8637. |Global.Dim:
  8638. Designate(p0,s0);
  8639. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8640. Dereference(s0,p0.type.resolved,FALSE);
  8641. END;
  8642. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8643. ReleaseOperand(s0);
  8644. (* ---- RESHAPE ----- *)
  8645. |Global.Reshape:
  8646. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8647. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,NIL, procedure);
  8648. left.SetType(procedure.type);
  8649. call := SyntaxTree.NewProcedureCallDesignator(position,NIL,left(SyntaxTree.Designator),x.parameters);
  8650. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8651. END;
  8652. (* ---- SYSTEM.TYPECODE ----- *)
  8653. |Global.systemTypeCode:
  8654. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8655. IF type.resolved IS SyntaxTree.PointerType THEN
  8656. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8657. END;
  8658. result.op := TypeDescriptorAdr(type);
  8659. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8660. result.mode := ModeValue;
  8661. (* ---- SYSTEM.TRACE ----- *)
  8662. |Global.systemTrace:
  8663. SystemTrace(x.parameters, x.position);
  8664. (* ----- CONNECT ------*)
  8665. |Global.Connect:
  8666. IF backend.cellsAreObjects THEN
  8667. PushPort(p0);
  8668. PushPort(p1);
  8669. IF p2 # NIL THEN
  8670. Evaluate(p2, s2);
  8671. Emit(Push(p2.position, s2.op));
  8672. ReleaseOperand(s2);
  8673. ELSE
  8674. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8675. END;
  8676. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8677. ELSE
  8678. Warning(x.position, "cannot run on final hardware");
  8679. END;
  8680. (* ----- DELEGATE ------*)
  8681. |Global.Delegate:
  8682. IF backend.cellsAreObjects THEN
  8683. PushPort(p0);
  8684. PushPort(p1);
  8685. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8686. ELSE
  8687. Warning(x.position, "cannot run on final hardware");
  8688. END;
  8689. (* ----- SEND ------*)
  8690. |Global.Send:
  8691. Evaluate(p0,s0);
  8692. Evaluate(p1,s1);
  8693. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8694. Emit(Push(position,s0.op));
  8695. Emit(Push(position,s1.op));
  8696. (*
  8697. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8698. *)
  8699. IF ~backend.cellsAreObjects THEN
  8700. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8701. END;
  8702. ReleaseOperand(s0);
  8703. ReleaseOperand(s1);
  8704. IF backend.cellsAreObjects THEN
  8705. CallThis(position,"ActiveCellsRuntime","Send",2);
  8706. ELSE
  8707. CallThis(position,ChannelModuleName,"Send",2);
  8708. END;
  8709. (* ----- RECEIVE ------*)
  8710. |Global.Receive:
  8711. Evaluate(p0,s0);
  8712. Emit(Push(position,s0.op));
  8713. Designate(p1,s1);
  8714. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8715. Emit(Push(position,s1.op));
  8716. IF p2 # NIL THEN
  8717. Designate(p2,s2);
  8718. Emit(Push(position,s2.op));
  8719. END;
  8720. (*
  8721. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8722. *)
  8723. IF ~backend.cellsAreObjects THEN
  8724. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8725. END;
  8726. ReleaseOperand(s0);
  8727. ReleaseOperand(s1);
  8728. ReleaseOperand(s2);
  8729. IF backend.cellsAreObjects THEN
  8730. IF p2 = NIL THEN
  8731. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8732. ELSE
  8733. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8734. END;
  8735. ELSE
  8736. IF p2 = NIL THEN
  8737. CallThis(position,ChannelModuleName,"Receive",2)
  8738. ELSE
  8739. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8740. END;
  8741. END;
  8742. | Global.systemSpecial:
  8743. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8744. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8745. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8746. (* determine if parameters are of the VAR kind *)
  8747. ASSERT(x.parameters.Length() <= 3);
  8748. formalParameter := procedureType.firstParameter;
  8749. FOR i := 0 TO x.parameters.Length() - 1 DO
  8750. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8751. formalParameter := formalParameter.nextParameter
  8752. END;
  8753. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8754. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8755. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8756. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8757. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8758. IF procedureType.returnType # NIL THEN
  8759. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8760. Emit(Result(position, res));
  8761. (*InitOperand(result,ModeValue);
  8762. result.op := res;
  8763. *)
  8764. InitOperand(result,ModeValue); result.op := res;
  8765. END
  8766. ELSE (* function not yet implemented *)
  8767. Error(position,"not yet implemented");
  8768. END;
  8769. destination := dest;
  8770. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8771. END VisitBuiltinCallDesignator;
  8772. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8773. VAR
  8774. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8775. s0,s1,s2: Operand; hint: HUGEINT;
  8776. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8777. tmp:IntermediateCode.Operand;
  8778. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8779. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8780. operand: Operand;
  8781. dest: IntermediateCode.Operand;
  8782. itype: IntermediateCode.Type;
  8783. convert: BOOLEAN;
  8784. customBuiltin: SyntaxTree.CustomBuiltin;
  8785. isVarPar: ARRAY 3 OF BOOLEAN;
  8786. callsection: Sections.Section;
  8787. segmentedName: Basic.SegmentedName;
  8788. needsTrace: BOOLEAN;
  8789. BEGIN
  8790. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8791. dest := destination; destination := emptyOperand;
  8792. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8793. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8794. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8795. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8796. CASE x.id OF
  8797. (* ---- ASH, LSH, ROT ----- *)
  8798. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8799. EvaluateX(p0, s0);
  8800. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8801. (* make unsigned arguments in order to produced a logical shift *)
  8802. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8803. convert:= TRUE;
  8804. itype := s0.op.type;
  8805. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8806. Convert(s0.op,itype);
  8807. ELSE
  8808. convert := FALSE;
  8809. END;
  8810. END;
  8811. EvaluateX(p1,s1);
  8812. IF IsIntegerConstant(p1,hint) THEN
  8813. ReuseCopy(reg,s0.op);
  8814. IF hint > 0 THEN
  8815. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8816. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8817. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8818. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8819. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8820. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8821. END;
  8822. ELSIF hint < 0 THEN
  8823. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8824. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8825. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8826. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8827. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8828. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8829. END;
  8830. END;
  8831. ReleaseOperand(s0); ReleaseOperand(s1);
  8832. ELSE
  8833. exit := NewLabel();
  8834. end := NewLabel();
  8835. ReuseCopy(reg,s0.op);
  8836. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8837. Reuse1(tmp,s1.op);
  8838. Emit(Neg(position,tmp,s1.op));
  8839. Convert(tmp,s1.op.type);
  8840. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8841. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8842. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8843. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8844. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8845. END;
  8846. ReleaseIntermediateOperand(tmp);
  8847. BrL(end);
  8848. SetLabel(exit);
  8849. ReuseCopy(tmp,s1.op);
  8850. Convert(tmp,s1.op.type);
  8851. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8852. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8853. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8854. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8855. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8856. END;
  8857. ReleaseIntermediateOperand(tmp);
  8858. SetLabel(end);
  8859. ReleaseOperand(s0); ReleaseOperand(s1);
  8860. END;
  8861. InitOperand(result,ModeValue);
  8862. IF convert THEN
  8863. itype := reg.type;
  8864. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8865. Convert(reg,itype);
  8866. END;
  8867. result.op := reg;
  8868. (* ---- CAP ----- *)
  8869. |Global.Cap:
  8870. EvaluateX(p0,result);
  8871. ReuseCopy(reg,result.op);
  8872. ReleaseIntermediateOperand(result.op);
  8873. ignore := NewLabel();
  8874. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8875. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8876. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8877. SetLabel(ignore);
  8878. result.op := reg;
  8879. (* ---- CHR ----- *)
  8880. |Global.Chr, Global.Chr32:
  8881. EvaluateX(p0, result);
  8882. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8883. |Global.Entier, Global.EntierH:
  8884. EvaluateX(p0, result);
  8885. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8886. (* ---- MIN and MAX ----- *)
  8887. |Global.Max,Global.Min:
  8888. EvaluateX(p0, s0);
  8889. EvaluateX(p1, s1);
  8890. Reuse2(res,s0.op,s1.op);
  8891. else := NewLabel();
  8892. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8893. ELSE BrltL(else,s1.op,s0.op) END;
  8894. Emit(Mov(position,res,s0.op));
  8895. ReleaseOperand(s0);
  8896. end := NewLabel();
  8897. BrL(end);
  8898. SetLabel(else);
  8899. Emit(MovReplace(position,res,s1.op));
  8900. SetLabel(end);
  8901. ReleaseOperand(s1);
  8902. InitOperand(result,ModeValue);
  8903. result.op := res;
  8904. (* ---- ODD ----- *)
  8905. |Global.Odd:
  8906. EvaluateX(p0, result);
  8907. Reuse1(res,result.op);
  8908. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8909. ReleaseIntermediateOperand(result.op);
  8910. result.op := res;
  8911. Convert(result.op,bool);
  8912. (* ---- ORD ----- *)
  8913. |Global.Ord, Global.Ord32:
  8914. EvaluateX(p0, result);
  8915. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8916. (* ---- SHORT, LONG ----- *)
  8917. |Global.Short, Global.Long:
  8918. EvaluateX(p0, result);
  8919. IF x.type IS SyntaxTree.ComplexType THEN
  8920. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8921. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8922. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8923. ELSE
  8924. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8925. END
  8926. (* ---- LEN ----- *)
  8927. |Global.Len: (* dynamic length, static length done by checker *)
  8928. Designate(p0,operand);
  8929. IF p1 = NIL THEN
  8930. InitOperand(l,ModeValue);
  8931. l.op := IntermediateCode.Immediate(sizeType,0);
  8932. ELSE
  8933. Evaluate(p1,l);
  8934. END;
  8935. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  8936. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  8937. Dereference(operand, p0.type.resolved, FALSE);
  8938. END;
  8939. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  8940. ReleaseOperand(operand); ReleaseOperand(l);
  8941. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  8942. ASSERT(p1 # NIL);
  8943. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8944. Dereference(operand,p0.type.resolved,FALSE);
  8945. END;
  8946. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  8947. ReleaseOperand(operand); ReleaseOperand(l);
  8948. ELSE HALT(100);
  8949. END;
  8950. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8951. (* ---- FIRST ---- *)
  8952. |Global.First:
  8953. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  8954. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  8955. ELSE
  8956. Designate(p0, result)
  8957. END
  8958. (* ---- LAST ---- *)
  8959. |Global.Last:
  8960. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  8961. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  8962. ELSE
  8963. Designate(p0, result);
  8964. (* make sure result.op is a register *)
  8965. tmp := result.op;
  8966. ReuseCopy(result.op, result.op);
  8967. ReleaseIntermediateOperand(tmp);
  8968. (* add offset to result.op *)
  8969. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  8970. END
  8971. (* ---- STEP ---- *)
  8972. |Global.Step:
  8973. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  8974. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  8975. ELSE
  8976. Designate(p0, result);
  8977. (* make sure result.op is a register *)
  8978. tmp := result.op;
  8979. ReuseCopy(result.op, result.op);
  8980. ReleaseIntermediateOperand(tmp);
  8981. (* add offset to result.op *)
  8982. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  8983. END
  8984. (* ---- RE ---- *)
  8985. |Global.Re:
  8986. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  8987. Designate(p0, result)
  8988. ELSE
  8989. EvaluateX(p0, result)
  8990. END
  8991. (* ---- IM ---- *)
  8992. |Global.Im:
  8993. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  8994. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  8995. Designate(p0, result);
  8996. (* make sure result.op is a register *)
  8997. tmp := result.op;
  8998. ReuseCopy(result.op, result.op);
  8999. ReleaseIntermediateOperand(tmp);
  9000. (* add offset to result.op *)
  9001. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9002. (* ---- ABS ----- *)
  9003. |Global.Abs:
  9004. EvaluateX(p0,operand);
  9005. type := p0.type.resolved;
  9006. InitOperand(result,ModeValue);
  9007. Reuse1a(result.op,operand.op,dest);
  9008. Emit(Abs(position,result.op,operand.op));
  9009. ReleaseOperand(operand);
  9010. (* ---- ADDRESSOF----- *)
  9011. |Global.systemAdr:
  9012. Designate(p0,s0);
  9013. s0.mode := ModeValue;
  9014. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9015. ReleaseIntermediateOperand(s0.op);
  9016. s0.op := s0.tag;
  9017. IntermediateCode.InitOperand(s0.tag);
  9018. END;
  9019. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9020. result := s0;
  9021. (* ---- BIT ----- *)
  9022. |Global.systemBit:
  9023. EvaluateX(p0,s0);
  9024. ToMemory(s0.op,addressType,0);
  9025. ReuseCopy(res,s0.op);
  9026. ReleaseOperand(s0);
  9027. EvaluateX(p1, s1);
  9028. Emit(Ror(position,res,res,s1.op));
  9029. ReleaseOperand(s1);
  9030. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9031. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9032. InitOperand(result,ModeValue);
  9033. result.op := res;
  9034. (* --- MSK ----*)
  9035. |Global.systemMsk:
  9036. EvaluateX(p0, s0);
  9037. EvaluateX(p1, s1);
  9038. ReuseCopy(res,s0.op);
  9039. ReleaseOperand(s0);
  9040. Emit(And(position,res,res,s1.op));
  9041. ReleaseOperand(s1);
  9042. InitOperand(result,ModeValue);
  9043. result.op := res;
  9044. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9045. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9046. EvaluateX(p0, s0);
  9047. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9048. ReleaseOperand(s0);
  9049. InitOperand(result,ModeValue);
  9050. result.op := res;
  9051. (* ---- SYSTEM.GetStackPointer ----- *)
  9052. |Global.systemGetStackPointer:
  9053. InitOperand(result,ModeValue);
  9054. result.op := sp;
  9055. (* ---- SYSTEM.GetFramePointer ----- *)
  9056. |Global.systemGetFramePointer:
  9057. InitOperand(result,ModeValue);
  9058. result.op := fp;
  9059. (* ---- SYSTEM.GetActivity ----- *)
  9060. |Global.systemGetActivity:
  9061. ASSERT(backend.cooperative);
  9062. InitOperand(result,ModeValue);
  9063. result.op := ap;
  9064. (* ---- SYSTEM.SetStackPointer ----- *)
  9065. |Global.systemSetStackPointer:
  9066. Evaluate(p0,s0); (* *)
  9067. Emit(Mov(position,sp,s0.op));
  9068. ReleaseOperand(s0);
  9069. (* ---- SYSTEM.SetFramePointer ----- *)
  9070. |Global.systemSetFramePointer:
  9071. Evaluate(p0,s0); (* *)
  9072. Emit(Mov(position,fp,s0.op));
  9073. ReleaseOperand(s0);
  9074. (* ---- SYSTEM.Activity ----- *)
  9075. |Global.systemSetActivity:
  9076. ASSERT(backend.cooperative);
  9077. Evaluate(p0,s0); (* *)
  9078. Emit(Mov(position,ap,s0.op));
  9079. ReleaseOperand(s0);
  9080. (* ---- SYSTEM.VAL ----- *)
  9081. |Global.systemVal:
  9082. Expression(p1);
  9083. s1 := result;
  9084. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9085. IF s1.mode = ModeReference THEN
  9086. (* nothing to be done if not record type, just take over new type *)
  9087. IF (type IS SyntaxTree.RecordType) THEN
  9088. ReleaseIntermediateOperand(s1.tag);
  9089. s1.tag := TypeDescriptorAdr(type);
  9090. UseIntermediateOperand(s1.tag);
  9091. END;
  9092. result := s1;
  9093. ELSE (* copy over result to different type, may not use convert *)
  9094. itype := IntermediateCode.GetType(system,type);
  9095. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9096. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9097. Emit(Mov(position,s0.op,s1.op));
  9098. ReleaseOperand(s1);
  9099. InitOperand(result,ModeValue);
  9100. result.op := s0.op;
  9101. ELSE (* different size, must convert *)
  9102. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9103. Convert(s1.op, IntermediateCode.GetType(system,type));
  9104. result := s1;
  9105. END;
  9106. END;
  9107. (* ---- SYSTEM.GET ----- *)
  9108. |Global.systemGet:
  9109. Evaluate(p0,s0); (* adr *)
  9110. Designate(p1,s1); (* variable *)
  9111. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9112. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9113. Emit(Mov(position,s1.op,s0.op));
  9114. ReleaseOperand(s1);
  9115. ReleaseOperand(s0);
  9116. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9117. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9118. Evaluate(p0,s0); (* *)
  9119. Evaluate(p1,s1); (* variable *)
  9120. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9121. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9122. (* real part *)
  9123. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9124. Emit(Mov(position,res, s1.op));
  9125. ReleaseIntermediateOperand(res);
  9126. (* imaginary part *)
  9127. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9128. Emit(Mov(position,res, s1.tag));
  9129. ReleaseIntermediateOperand(res);
  9130. ReleaseOperand(s1);
  9131. ReleaseOperand(s0);
  9132. ELSE
  9133. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9134. ReleaseOperand(s0);
  9135. Emit(Mov(position,res,s1.op));
  9136. ReleaseIntermediateOperand(res);
  9137. ReleaseOperand(s1);
  9138. END;
  9139. (* ---- SYSTEM.MOVE ----- *)
  9140. |Global.systemMove:
  9141. Evaluate(p0,s0);
  9142. Evaluate(p1,s1);
  9143. Evaluate(p2,s2);
  9144. Emit(Copy(position,s1.op,s0.op,s2.op));
  9145. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9146. (* ---- SYSTEM.NEW ----- *)
  9147. |Global.systemNew:
  9148. Designate(p0,s0);
  9149. Emit(Push(position,s0.op));
  9150. ReleaseOperand(s0);
  9151. Evaluate(p1,s1);
  9152. Emit(Push(position,s1.op));
  9153. ReleaseOperand(s1);
  9154. (* push realtime flag: false by default *)
  9155. Emit(Push(position,false));
  9156. CallThis(position,"Heaps","NewSys",3);
  9157. (* ---- SYSTEM.CALL ----- *)
  9158. |Global.systemRef:
  9159. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9160. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9161. s0.mode := ModeValue;
  9162. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9163. result := s0
  9164. (* ---- INCR ----- *)
  9165. |Global.Incr:
  9166. Designate(p0,operand);
  9167. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9168. Dereference(operand,p0.type.resolved,FALSE);
  9169. END;
  9170. ASSERT(p1 # NIL);
  9171. Evaluate(p1,l);
  9172. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9173. ReleaseOperand(operand); ReleaseOperand(l);
  9174. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9175. (* ---- SUM ----- *)
  9176. |Global.Sum: HALT(200);
  9177. (* ---- ALL ----- *)
  9178. |Global.All: HALT(200);
  9179. (* ---- CAS ----- *)
  9180. |Global.Cas:
  9181. needsTrace := p0.NeedsTrace();
  9182. IF needsTrace THEN ModifyAssignments(true) END;
  9183. Designate(p0,s0);
  9184. Evaluate(p1,s1);
  9185. Evaluate(p2,s2);
  9186. IF needsTrace THEN
  9187. Emit(Push(position, s0.op));
  9188. Emit(Push(position, s1.op));
  9189. Emit(Push(position, s2.op));
  9190. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9191. ELSE
  9192. Emit(Cas(position,s0.op,s1.op,s2.op));
  9193. END;
  9194. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9195. IF needsTrace THEN ModifyAssignments(false) END;
  9196. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9197. Emit(Result(position, res));
  9198. result.op := res;
  9199. result.mode := ModeValue;
  9200. (*
  9201. IF conditional THEN
  9202. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9203. BrL(falseLabel);
  9204. ReleaseIntermediateOperand(res);
  9205. END;
  9206. *)
  9207. (* ---- DIM ----- *)
  9208. |Global.Dim:
  9209. Designate(p0,s0);
  9210. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9211. Dereference(s0,p0.type.resolved,FALSE);
  9212. END;
  9213. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9214. ReleaseOperand(s0);
  9215. (* ---- SYSTEM.TYPECODE ----- *)
  9216. |Global.systemTypeCode:
  9217. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9218. IF type.resolved IS SyntaxTree.PointerType THEN
  9219. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9220. END;
  9221. result.op := TypeDescriptorAdr(type);
  9222. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9223. result.mode := ModeValue;
  9224. (* ---- SYSTEM.TRACE ----- *)
  9225. |Global.systemTrace:
  9226. SystemTrace(x.parameters, x.position);
  9227. (* ----- CONNECT ------*)
  9228. |Global.Connect:
  9229. IF backend.cellsAreObjects THEN
  9230. PushPort(p0);
  9231. PushPort(p1);
  9232. IF p2 # NIL THEN
  9233. Evaluate(p2, s2);
  9234. Emit(Push(p2.position, s2.op));
  9235. ReleaseOperand(s2);
  9236. ELSE
  9237. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9238. END;
  9239. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9240. ELSE
  9241. Warning(x.position, "cannot run on final hardware");
  9242. END;
  9243. | Global.systemSpecial:
  9244. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9245. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9246. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9247. (* determine if parameters are of the VAR kind *)
  9248. ASSERT(x.parameters.Length() <= 3);
  9249. formalParameter := procedureType.firstParameter;
  9250. FOR i := 0 TO x.parameters.Length() - 1 DO
  9251. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9252. formalParameter := formalParameter.nextParameter
  9253. END;
  9254. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9255. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9256. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9257. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9258. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9259. IF procedureType.returnType # NIL THEN
  9260. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9261. Emit(Result(position, res));
  9262. (*InitOperand(result,ModeValue);
  9263. result.op := res;
  9264. *)
  9265. InitOperand(result,ModeValue); result.op := res;
  9266. END
  9267. ELSE (* function not yet implemented *)
  9268. Error(position,"not yet implemented");
  9269. END;
  9270. destination := dest;
  9271. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9272. END EvaluateBuiltinCallDesignator;
  9273. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9274. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9275. BEGIN
  9276. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9277. dest := destination; destination := emptyOperand;
  9278. Expression(x.left);
  9279. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9280. ELSIF isUnchecked THEN (* no check *)
  9281. ELSE
  9282. trueL := NewLabel();
  9283. IF IsPointerToRecord(x.left.type,recordType) THEN
  9284. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9285. Emit(Mov(position,tag, result.op));
  9286. IF result.mode # ModeValue THEN
  9287. ptr := tag;
  9288. IntermediateCode.MakeMemory(ptr,addressType);
  9289. Emit(Mov(position,tag, ptr));
  9290. END;
  9291. IF ~backend.cooperative THEN
  9292. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9293. END;
  9294. IntermediateCode.MakeMemory(tag,addressType);
  9295. ELSE
  9296. tag := result.tag;
  9297. UseIntermediateOperand(tag);
  9298. END;
  9299. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9300. ReleaseIntermediateOperand(tag);
  9301. EmitTrap(position,TypeCheckTrap);
  9302. SetLabel(trueL);
  9303. END;
  9304. destination := dest;
  9305. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9306. END VisitTypeGuardDesignator;
  9307. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9308. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9309. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9310. VAR label: Label; pc: LONGINT;
  9311. BEGIN
  9312. IF backend.cooperative & ~isUnchecked THEN
  9313. pc := section.pc;
  9314. label := NewLabel();
  9315. BrneL(label, operand.op, nil);
  9316. EmitTrap(position, NilPointerTrap);
  9317. SetLabel(label);
  9318. INC(statCoopNilCheck, section.pc - pc);
  9319. END;
  9320. END NilCheck;
  9321. BEGIN
  9322. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9323. ReuseCopy(dereferenced,operand.op);
  9324. ReleaseOperand(operand);
  9325. operand.mode := ModeReference;
  9326. operand.op := dereferenced;
  9327. operand.tag := dereferenced;
  9328. UseIntermediateOperand(operand.tag);
  9329. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9330. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9331. ReleaseIntermediateOperand(operand.tag);
  9332. operand.tag := TypeDescriptorAdr(type);
  9333. ELSE
  9334. IF ~backend.cooperative THEN
  9335. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9336. END;
  9337. IntermediateCode.MakeMemory(operand.tag,addressType);
  9338. END;
  9339. NilCheck(operand.op);
  9340. ELSIF type IS SyntaxTree.ArrayType THEN
  9341. IF isUnsafe THEN
  9342. NilCheck(operand.op);
  9343. ReleaseIntermediateOperand(operand.tag);
  9344. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9345. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9346. ELSE
  9347. operand.tag := emptyOperand;
  9348. END;
  9349. ELSE
  9350. NilCheck(operand.op);
  9351. IF backend.cooperative THEN
  9352. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9353. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9354. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9355. ELSE
  9356. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9357. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9358. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9359. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9360. END;
  9361. END;
  9362. ELSIF type IS SyntaxTree.MathArrayType THEN
  9363. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9364. IntermediateCode.MakeMemory(operand.op,addressType);
  9365. ELSE HALT(100);
  9366. END;
  9367. END Dereference;
  9368. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9369. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9370. BEGIN
  9371. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9372. dest := destination; destination := emptyOperand;
  9373. Evaluate(x.left,d);
  9374. type := x.type.resolved;
  9375. prevIsUnchecked := isUnchecked;
  9376. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9377. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9378. END;
  9379. Dereference(d,type,IsUnsafePointer(x.left.type));
  9380. isUnchecked := prevIsUnchecked;
  9381. result := d;
  9382. 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
  9383. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9384. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9385. END;
  9386. END;
  9387. destination := dest;
  9388. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9389. END VisitDereferenceDesignator;
  9390. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9391. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9392. BEGIN
  9393. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9394. dest := destination; destination := emptyOperand;
  9395. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9396. tag := result.op;
  9397. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9398. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9399. StaticCallOperand(result,procedure.super);
  9400. ReleaseIntermediateOperand(result.tag);
  9401. UseIntermediateOperand(tag); (* necessary ? *)
  9402. result.tag := tag;
  9403. destination := dest;
  9404. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9405. END VisitSupercallDesignator;
  9406. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9407. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9408. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9409. name: Basic.SegmentedName;
  9410. procedure: SyntaxTree.Procedure;
  9411. procedureType: SyntaxTree.ProcedureType;
  9412. BEGIN
  9413. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9414. dest := destination; destination := emptyOperand;
  9415. scope := currentScope;
  9416. WHILE (scope.outerScope # NIL) & ((scope.outerScope IS SyntaxTree.ProcedureScope) OR (scope.outerScope IS SyntaxTree.BlockScope)) DO
  9417. scope := scope.outerScope;
  9418. END;
  9419. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9420. moduleSection := meta.ModuleSection();
  9421. IF backend.cooperative THEN
  9422. moduleOffset := 0;
  9423. ELSE
  9424. moduleOffset := moduleSection.pc;
  9425. END;
  9426. result.mode := ModeValue;
  9427. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9428. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9429. result.mode := ModeValue;
  9430. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9431. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9432. ELSE
  9433. GetBaseRegister(basereg,currentScope,scope);
  9434. InitOperand(result,ModeReference);
  9435. result.op := basereg;
  9436. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9437. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9438. parametersSize := ProcParametersSize(procedure);
  9439. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9440. IF backend.cooperative THEN
  9441. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9442. END;
  9443. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9444. MakeMemory(result.op, result.op, addressType, 0);
  9445. END;
  9446. (* tag must be loaded when dereferencing SELF pointer *)
  9447. END;
  9448. destination := dest;
  9449. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9450. END VisitSelfDesignator;
  9451. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9452. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  9453. symbol: SyntaxTree.Symbol;
  9454. BEGIN
  9455. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9456. IF currentIsInline THEN
  9457. symbol := currentScope.FindSymbol(ResultDesignatorName);
  9458. VisitAlias(symbol(SyntaxTree.Alias));
  9459. ELSE
  9460. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9461. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9462. parameter := procedureType.returnParameter;
  9463. VisitParameter(parameter);
  9464. END;
  9465. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9466. END VisitResultDesignator;
  9467. (** values *)
  9468. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9469. BEGIN
  9470. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9471. InitOperand(result,ModeValue);
  9472. IF x.value THEN result.op := true ELSE result.op := false END;
  9473. END VisitBooleanValue;
  9474. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9475. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9476. BEGIN
  9477. Global.GetModuleSegmentedName(module.module, name);
  9478. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9479. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9480. RETURN section
  9481. END GetDataSection;
  9482. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9483. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9484. BEGIN
  9485. type := vop.type;
  9486. data := GetDataSection();
  9487. pc := EnterImmediate(data,vop);
  9488. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9489. IntermediateCode.MakeMemory(vop, type);
  9490. END GetImmediateMem;
  9491. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9492. BEGIN
  9493. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9494. InitOperand(result,ModeValue);
  9495. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9496. IF ~supportedImmediate(result.op) &~inData THEN
  9497. GetImmediateMem(result.op)
  9498. END;
  9499. END VisitIntegerValue;
  9500. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9501. BEGIN
  9502. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9503. InitOperand(result,ModeValue);
  9504. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9505. END VisitCharacterValue;
  9506. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9507. BEGIN
  9508. IF Trace THEN TraceEnter("VisitSetValue") END;
  9509. InitOperand(result,ModeValue);
  9510. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9511. END VisitSetValue;
  9512. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9513. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName; const: SyntaxTree.Constant;
  9514. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9515. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9516. BEGIN
  9517. numberElements := x.elements.Length();
  9518. FOR i := 0 TO numberElements-1 DO
  9519. expression := x.elements.GetExpression(i);
  9520. IF expression IS SyntaxTree.MathArrayExpression THEN
  9521. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9522. ELSE
  9523. inData := TRUE;
  9524. Evaluate(expression,op);
  9525. irv.Emit(Data(position,op.op));
  9526. inData := FALSE;
  9527. ReleaseOperand(op);
  9528. END;
  9529. END;
  9530. END RecursiveData;
  9531. BEGIN
  9532. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9533. const := BuildConstant(module.module,x,constId);
  9534. GetCodeSectionNameForSymbol(const,name);
  9535. IF (const.scope = NIL) OR (const.scope.ownerModule = module.module) THEN
  9536. irv := NewSection(module.allSections,Sections.ConstSection,name,const,commentPrintout # NIL);
  9537. ELSE
  9538. irv := NewSection(module.importedSections, Sections.ConstSection, name,const,commentPrintout # NIL);
  9539. END;
  9540. IF irv.pc = 0 THEN
  9541. RecursiveData(x.array);
  9542. END;
  9543. InitOperand(result,ModeReference);
  9544. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9545. END VisitMathArrayValue;
  9546. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9547. BEGIN
  9548. VExpression(x.value.resolved);
  9549. END VisitConstant;
  9550. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9551. BEGIN
  9552. IF Trace THEN TraceEnter("VisitRealValue") END;
  9553. InitOperand(result,ModeValue);
  9554. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9555. END VisitRealValue;
  9556. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9557. VAR
  9558. componentType: SyntaxTree.Type;
  9559. BEGIN
  9560. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9561. ASSERT(x.type IS SyntaxTree.ComplexType);
  9562. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9563. InitOperand(result,ModeValue);
  9564. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9565. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9566. END VisitComplexValue;
  9567. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9568. VAR i: LONGINT; name: Basic.SegmentedName;
  9569. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9570. const: SyntaxTree.Constant;
  9571. BEGIN
  9572. IF Trace THEN TraceEnter("VisitStringValue") END;
  9573. const := BuildConstant(module.module,x,constId);
  9574. GetCodeSectionNameForSymbol(const,name);
  9575. IF (const.scope = NIL) OR (const.scope.ownerModule = module.module) THEN
  9576. irv := NewSection(module.allSections, Sections.ConstSection, name,const,commentPrintout # NIL);
  9577. ELSE
  9578. irv := NewSection(module.importedSections, Sections.ConstSection, name,const,commentPrintout # NIL);
  9579. END;
  9580. IF irv.pc = 0 THEN
  9581. FOR i := 0 TO x.length-1 DO
  9582. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9583. irv.Emit(Data(position,op));
  9584. END;
  9585. END;
  9586. InitOperand(result,ModeReference);
  9587. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9588. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9589. END VisitStringValue;
  9590. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9591. BEGIN
  9592. IF Trace THEN TraceEnter("VisitNilValue") END;
  9593. InitOperand(result,ModeValue);
  9594. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9595. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9596. END VisitNilValue;
  9597. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9598. BEGIN
  9599. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9600. InitOperand(result,ModeValue);
  9601. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9602. END VisitEnumerationValue;
  9603. (** symbols *)
  9604. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9605. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9606. END VisitImport;
  9607. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9608. VAR left,right: IntermediateCode.Operand;level: LONGINT; s: SyntaxTree.Scope;
  9609. BEGIN
  9610. ASSERT(baseScope # NIL);
  9611. level := 0;
  9612. s := scope;
  9613. WHILE (scope # baseScope) DO
  9614. IF scope IS SyntaxTree.ProcedureScope THEN
  9615. INC(level);
  9616. ELSE
  9617. IF scope IS SyntaxTree.BlockScope THEN
  9618. ELSE
  9619. Printout.Info("scope",s);
  9620. Printout.Info("baseScope",baseScope);
  9621. END;
  9622. ASSERT(scope IS SyntaxTree.BlockScope);
  9623. END;
  9624. scope := scope.outerScope;
  9625. END;
  9626. (* now scope = baseScope *)
  9627. IF level > 0 THEN
  9628. (* left := [fp+8] *)
  9629. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9630. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9631. ReuseCopy(left,right);
  9632. ReleaseIntermediateOperand(right);
  9633. scope := scope.outerScope;
  9634. DEC(level);
  9635. (* { left := [left+8] } *)
  9636. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9637. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9638. WHILE (level > 0) DO
  9639. Emit(Mov(position,left,right));
  9640. DEC(level);
  9641. END;
  9642. result := left;
  9643. ELSE
  9644. result := fp
  9645. END;
  9646. (*
  9647. IF scope # baseScope THEN
  9648. (* left := [fp+8] *)
  9649. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9650. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9651. ReuseCopy(left,right);
  9652. ReleaseIntermediateOperand(right);
  9653. ASSERT(scope IS SyntaxTree.ProcedureScope);
  9654. scope := scope.outerScope; DEC(level);
  9655. (* { left := [left+8] } *)
  9656. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9657. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9658. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9659. Emit(Mov(position,left,right));
  9660. scope := scope.outerScope; DEC(level);
  9661. END;
  9662. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9663. result := left;
  9664. ELSE
  9665. result := fp;
  9666. END;
  9667. *)
  9668. END GetBaseRegister;
  9669. (* EXPERIMENTAL *)
  9670. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9671. VAR i: WORD;
  9672. BEGIN
  9673. IF ~backend.experiment THEN RETURN -1 END;
  9674. i := 0;
  9675. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9676. INC(i);
  9677. END;
  9678. IF availableSymbols[i].symbol = NIL THEN
  9679. availableSymbols[i].inRegister := FALSE;
  9680. availableSymbols[i].inMemory := TRUE;
  9681. availableSymbols[i].symbol := x;
  9682. END;
  9683. RETURN i;
  9684. END GetAvailability;
  9685. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9686. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType;
  9687. name: Basic.SegmentedName; temp, basereg: IntermediateCode.Operand; reg: LONGINT;
  9688. nm: ARRAY 256 OF CHAR;
  9689. BEGIN
  9690. IF Trace THEN TraceEnter("VisitVariable"); END;
  9691. type := x.type.resolved;
  9692. x.GetName(nm);
  9693. IF (x.preferRegister) THEN
  9694. InitOperand(result, ModeValue);
  9695. IF x.registerNumber < 0 THEN
  9696. x.RegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9697. reg := x.registerNumber;
  9698. ELSE
  9699. reg := registerUsageCount.Map(x.registerNumber);
  9700. UseRegister(reg);
  9701. END;
  9702. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9703. ELSIF x.externalName # NIL THEN
  9704. InitOperand(result,ModeReference);
  9705. Basic.ToSegmentedName(x.externalName^, name);
  9706. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9707. ELSIF (x.scope IS SyntaxTree.ProcedureScope) OR (x.scope IS SyntaxTree.BlockScope) THEN (* local variable (potentially via nested procedure) *)
  9708. InitOperand(result,ModeReference);
  9709. GetBaseRegister(basereg,currentScope,x.scope);
  9710. result.op := basereg;
  9711. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9712. IF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9713. IntermediateCode.MakeMemory(result.op,addressType);
  9714. END;
  9715. (* EXPERIMENTAL *)
  9716. result.availability := GetAvailability(x);
  9717. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9718. InitOperand(result,ModeReference);
  9719. GetCodeSectionNameForSymbol(x,name);
  9720. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9721. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9722. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9723. InitOperand(result,ModeReference);
  9724. GetCodeSectionNameForSymbol(x,name);
  9725. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9726. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9727. ELSE (* field, left designator must have been emitted *)
  9728. ASSERT(result.mode = ModeReference);
  9729. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9730. ReuseCopy(temp,result.op);
  9731. ReleaseIntermediateOperand(result.op);
  9732. result.op := temp;
  9733. END;
  9734. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9735. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9736. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9737. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9738. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9739. END;
  9740. END;
  9741. END;
  9742. IF type IS SyntaxTree.ProcedureType THEN
  9743. ReleaseIntermediateOperand(result.tag);
  9744. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9745. IF x.kind = SyntaxTree.VarParameter THEN
  9746. ReuseCopy(result.tag,result.op);
  9747. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9748. IntermediateCode.MakeMemory(result.tag,addressType);
  9749. ELSE
  9750. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9751. UseIntermediateOperand(result.tag);
  9752. END;
  9753. ELSE
  9754. result.tag := nil; (* nil *)
  9755. END;
  9756. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9757. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9758. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9759. ReleaseIntermediateOperand(result.tag);
  9760. Global.GetSymbolSegmentedName(x,name);
  9761. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9762. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9763. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9764. ELSE
  9765. END;
  9766. ELSE
  9767. ReleaseIntermediateOperand(result.tag);
  9768. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9769. END;
  9770. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9771. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9772. ReleaseIntermediateOperand(result.tag);
  9773. result.tag := result.op;
  9774. UseIntermediateOperand(result.tag);
  9775. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9776. IntermediateCode.MakeMemory(result.op,addressType);
  9777. END;
  9778. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9779. IF x.kind = SyntaxTree.ValueParameter THEN
  9780. ReleaseIntermediateOperand(result.tag);
  9781. result.tag := TypeDescriptorAdr(type);
  9782. UseIntermediateOperand(result.tag);
  9783. ELSE (* const or var *)
  9784. ReleaseIntermediateOperand(result.tag);
  9785. result.tag := basereg;
  9786. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9787. IntermediateCode.MakeMemory(result.tag,addressType);
  9788. UseIntermediateOperand(result.tag);
  9789. END;
  9790. END;
  9791. IF Trace THEN TraceExit("VisitVariable") END;
  9792. END VisitVariable;
  9793. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9794. BEGIN
  9795. VisitVariable(property);
  9796. END VisitProperty;
  9797. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9798. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9799. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand; reg: LONGINT;
  9800. BEGIN
  9801. type := x.type.resolved;
  9802. IF Trace THEN TraceEnter("VisitParameter") END;
  9803. IF (x.preferRegister) THEN
  9804. InitOperand(result, ModeValue);
  9805. IF x.registerNumber < 0 THEN
  9806. x.RegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9807. reg := x.registerNumber;
  9808. ELSE
  9809. reg := registerUsageCount.Map(x.registerNumber);
  9810. UseRegister(reg);
  9811. END;
  9812. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9813. RETURN;
  9814. ELSIF x.ownerType IS SyntaxTree.CellType THEN
  9815. ptype := x.type.resolved;
  9816. IF backend.cellsAreObjects THEN
  9817. ASSERT(result.mode = ModeReference);
  9818. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9819. ReuseCopy(temp,result.op);
  9820. ReleaseIntermediateOperand(result.op);
  9821. result.op := temp;
  9822. END;
  9823. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9824. RETURN;
  9825. ELSE
  9826. InitOperand(result,ModeReference);
  9827. GetCodeSectionNameForSymbol(x,name);
  9828. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9829. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9830. RETURN;
  9831. END;
  9832. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9833. InitOperand(result,ModeReference);
  9834. GetCodeSectionNameForSymbol(x,name);
  9835. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9836. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9837. RETURN
  9838. ELSE
  9839. GetBaseRegister(basereg,currentScope,x.scope);
  9840. InitOperand(result,ModeReference);
  9841. result.op := basereg;
  9842. END;
  9843. IF IsOpenArray(type) THEN
  9844. result.tag := basereg;
  9845. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9846. IntermediateCode.MakeMemory(result.op,addressType);
  9847. IF Global.IsOberonProcedure(x.ownerType) THEN
  9848. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9849. UseIntermediateOperand(result.tag);
  9850. ELSE
  9851. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9852. END;
  9853. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9854. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9855. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9856. ELSIF IsStaticArray(type) THEN
  9857. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9858. IntermediateCode.MakeMemory(result.op,addressType);
  9859. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9860. ELSIF type IS SyntaxTree.MathArrayType THEN
  9861. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9862. WITH type: SyntaxTree.MathArrayType DO
  9863. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9864. IF type.form = SyntaxTree.Tensor THEN
  9865. ELSIF type.form = SyntaxTree.Open THEN
  9866. result.tag := result.op;
  9867. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9868. IntermediateCode.MakeMemory(result.op,addressType);
  9869. UseIntermediateOperand(result.tag);
  9870. ELSIF type.form = SyntaxTree.Static THEN
  9871. IF x.kind = SyntaxTree.ConstParameter THEN
  9872. IntermediateCode.MakeMemory(result.op,addressType);
  9873. END;
  9874. ELSE HALT(100)
  9875. END;
  9876. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9877. IF type.form = SyntaxTree.Tensor THEN
  9878. ToMemory(result.op,addressType,0);
  9879. ELSIF type.form = SyntaxTree.Open THEN
  9880. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9881. ReuseCopy(result.tag, mem);
  9882. ReleaseIntermediateOperand(mem);
  9883. ReleaseIntermediateOperand(result.op);
  9884. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9885. ELSIF type.form = SyntaxTree.Static THEN
  9886. IntermediateCode.MakeMemory(result.op,addressType);
  9887. ELSE HALT(100)
  9888. END;
  9889. ELSE HALT(100)
  9890. END;
  9891. END;
  9892. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9893. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9894. IntermediateCode.MakeMemory(result.op,addressType);
  9895. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9896. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9897. END;
  9898. IF type IS SyntaxTree.ProcedureType THEN
  9899. ReleaseIntermediateOperand(result.tag);
  9900. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9901. IF x.kind = SyntaxTree.VarParameter THEN
  9902. ReuseCopy(result.tag,result.op);
  9903. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9904. IntermediateCode.MakeMemory(result.tag,addressType);
  9905. ELSE
  9906. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9907. UseIntermediateOperand(result.tag);
  9908. END;
  9909. ELSE
  9910. result.tag := nil;
  9911. END;
  9912. (* tag for pointer type computed not here but during dereferencing *)
  9913. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9914. ReleaseIntermediateOperand(result.tag);
  9915. result.tag := basereg;
  9916. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9917. IntermediateCode.MakeMemory(result.tag,addressType);
  9918. UseIntermediateOperand(result.tag);
  9919. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9920. ReleaseIntermediateOperand(result.tag);
  9921. result.tag := TypeDescriptorAdr(type);
  9922. UseIntermediateOperand(result.tag);
  9923. END;
  9924. IF Trace THEN TraceExit("VisitParameter") END;
  9925. END VisitParameter;
  9926. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9927. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9928. BEGIN
  9929. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9930. (* left.p: left already emitted *)
  9931. tag := result.op; (* value of pointer to left *)
  9932. (* get type desc *)
  9933. tmp := result.tag;
  9934. IntermediateCode.MakeMemory(tmp,addressType);
  9935. (* get method adr *)
  9936. Reuse1(reg,tmp);
  9937. ReleaseIntermediateOperand(tmp);
  9938. IF backend.cooperative THEN
  9939. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9940. WHILE recordType.baseType # NIL DO
  9941. recordType := recordType.GetBaseRecord ();
  9942. END;
  9943. GetRecordTypeName (recordType,name);
  9944. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9945. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9946. offset := 0;
  9947. ELSE
  9948. offset := 2;
  9949. END;
  9950. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9951. ELSIF meta.simple THEN
  9952. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9953. ELSE
  9954. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9955. END;
  9956. InitOperand(operand,ModeReference);
  9957. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9958. operand.op := reg;
  9959. operand.tag := tag;
  9960. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9961. END DynamicCallOperand;
  9962. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9963. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9964. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9965. BEGIN
  9966. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9967. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9968. tag := operand.op;
  9969. ReleaseIntermediateOperand(operand.tag);
  9970. ELSE tag := nil
  9971. END;
  9972. IF x.isInline THEN
  9973. sectionType := Sections.InlineCodeSection;
  9974. ELSE
  9975. sectionType := Sections.CodeSection;
  9976. END;
  9977. IF x.externalName # NIL THEN
  9978. Basic.ToSegmentedName(x.externalName^, name);
  9979. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9980. ELSE
  9981. GetCodeSectionNameForSymbol(x, name);
  9982. IF (x.scope.ownerModule = module.module) THEN
  9983. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9984. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9985. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9986. IF source.pc = 0 THEN (* no code yet *)
  9987. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL,x.procedureScope (*currentScope*)));
  9988. END;
  9989. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9990. bits := x.procedureScope.body.code.inlineCode;
  9991. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9992. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9993. binary.CopyBits(bits, 0, bits.GetSize());
  9994. source.SetResolved(binary);
  9995. ELSE
  9996. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9997. END;
  9998. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9999. END;
  10000. InitOperand(operand,ModeValue);
  10001. operand.op := reg;
  10002. operand.tag := tag;
  10003. IF Trace THEN TraceExit("StaticCallOperand") END;
  10004. END StaticCallOperand;
  10005. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10006. (* handle expressions of the form designator.procedure or procedure *)
  10007. BEGIN
  10008. IF Trace THEN TraceEnter("VisitProcedure") END;
  10009. EndBasicBlock;
  10010. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10011. DynamicCallOperand(result,x);
  10012. ELSIF x.isInline THEN
  10013. StaticCallOperand(result,x);
  10014. ELSE
  10015. StaticCallOperand(result,x);
  10016. END;
  10017. IF Trace THEN TraceExit("VisitProcedure") END;
  10018. END VisitProcedure;
  10019. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10020. BEGIN
  10021. VisitProcedure(x);
  10022. END VisitOperator;
  10023. PROCEDURE VisitAlias(x: SyntaxTree.Alias);
  10024. BEGIN
  10025. VExpression(x.expression);
  10026. END VisitAlias;
  10027. (** statements *)
  10028. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10029. BEGIN
  10030. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10031. Expression(x.call);
  10032. IF (x.call.type # NIL) THEN (* procedure returning ignored value *)
  10033. ReleaseOperand(result)
  10034. END;
  10035. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10036. END VisitProcedureCallStatement;
  10037. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10038. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10039. leftBase, rightBase: SyntaxTree.Type;
  10040. procedureName,s: SyntaxTree.IdentifierString;
  10041. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10042. size: LONGINT; rightKind: LONGINT;
  10043. dummy: IntermediateCode.Operand;
  10044. CONST moduleName = "FoxArrayBase";
  10045. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10046. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10047. BEGIN
  10048. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10049. IF base IS SyntaxTree.MathArrayType THEN
  10050. base := OpenArray(base(SyntaxTree.MathArrayType));
  10051. END;
  10052. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10053. result.SetArrayBase(base);
  10054. RETURN result
  10055. END OpenArray;
  10056. BEGIN
  10057. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10058. SaveRegisters();ReleaseUsedRegisters(saved);
  10059. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10060. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10061. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10062. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10063. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10064. IF leftType.form = SyntaxTree.Tensor THEN
  10065. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10066. ELSIF leftType.form = SyntaxTree.Open THEN
  10067. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10068. ELSIF leftType.form = SyntaxTree.Static THEN
  10069. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10070. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10071. END;
  10072. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10073. IF procedure = NIL THEN
  10074. s := "Instruction not supported on target, emulation procedure ";
  10075. Strings.Append(s,moduleName);
  10076. Strings.Append(s,".");
  10077. Strings.Append(s,procedureName);
  10078. Strings.Append(s," not present");
  10079. Error(position,s);
  10080. ELSE
  10081. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10082. parameter.SetType(leftType);
  10083. parameter.SetAccess(SyntaxTree.Internal);
  10084. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10085. parameter.SetKind(rightKind);
  10086. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10087. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10088. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10089. StaticCallOperand(result,procedure);
  10090. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10091. ReleaseOperand(result);
  10092. END;
  10093. RestoreRegisters(saved);
  10094. END;
  10095. END AssignMathArray;
  10096. VAR modifyAssignmentCounter := 0: LONGINT;
  10097. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10098. VAR processor,mem,dst: IntermediateCode.Operand;
  10099. BEGIN
  10100. IF value.intValue = true.intValue THEN
  10101. INC(modifyAssignmentCounter);
  10102. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10103. modifyAssignmentsPC := section.pc;
  10104. ELSE
  10105. DEC(modifyAssignmentCounter);
  10106. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10107. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10108. END;
  10109. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10110. dst := NewRegisterOperand (addressType);
  10111. Emit(Mov(position,dst, processor));
  10112. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10113. Emit(Mov(position,mem, value));
  10114. ReleaseIntermediateOperand(dst);
  10115. END ModifyAssignments;
  10116. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10117. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10118. BEGIN
  10119. type := left.type.resolved;
  10120. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10121. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10122. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10123. IF procedureType.returnParameter = parameter THEN
  10124. (* this is the only case where the destination can be dynamically smaller than the source
  10125. in all other cases the dynamic size has to be taken
  10126. *)
  10127. IF backend.cooperative THEN
  10128. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10129. ELSE
  10130. MakeMemory(mem, tag, addressType, 0);
  10131. END;
  10132. RETURN mem;
  10133. END;
  10134. END;
  10135. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10136. END CopySize;
  10137. PROCEDURE AssignReference(left, right: SyntaxTree.Expression);
  10138. VAR leftO, rightO: Operand;
  10139. BEGIN
  10140. Designate(right,rightO);
  10141. Designate(left,leftO);
  10142. Emit(Mov(position,leftO.op,rightO.op));
  10143. IF left.type.resolved IS SyntaxTree.RecordType THEN
  10144. Emit(Mov(position,leftO.tag,rightO.tag));
  10145. END;
  10146. ReleaseOperand(leftO);
  10147. ReleaseOperand(rightO);
  10148. END AssignReference
  10149. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10150. VAR
  10151. leftO, rightO: Operand;
  10152. arg,mem, sizeOp: IntermediateCode.Operand;
  10153. leftType, rightType, componentType, base: SyntaxTree.Type;
  10154. size: LONGINT;
  10155. parameters: SyntaxTree.ExpressionList;
  10156. procedure: SyntaxTree.Procedure;
  10157. call: SyntaxTree.ProcedureCallDesignator;
  10158. designator: SyntaxTree.Designator;
  10159. saved: RegisterEntry;
  10160. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10161. VAR procedureType: SyntaxTree.ProcedureType;
  10162. BEGIN
  10163. IF SemanticChecker.ReturnedAsParameter(system,right.type) THEN
  10164. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10165. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10166. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10167. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10168. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10169. IF right.id = Global.Reshape THEN RETURN TRUE
  10170. END;
  10171. END;
  10172. ELSIF right IS SyntaxTree.InlineCallDesignator THEN
  10173. RETURN TRUE;
  10174. END;
  10175. END;
  10176. RETURN FALSE
  10177. END CanPassAsResultParameter;
  10178. BEGIN
  10179. IF left = NIL THEN (* ignore result *)
  10180. Evaluate(right, rightO);
  10181. ReleaseOperand(rightO);
  10182. RETURN;
  10183. END;
  10184. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10185. leftType := left.type.resolved; rightType:= right.type.resolved;
  10186. IF backend.cooperative & left.NeedsTrace() THEN
  10187. ModifyAssignments(true);
  10188. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10189. Designate(right, rightO);
  10190. Designate(left, leftO);
  10191. ASSERT(leftO.mode = ModeReference);
  10192. TransferToRegister(leftO.op, leftO.op);
  10193. TransferToRegister(rightO.op, rightO.op);
  10194. Emit(Push(position, leftO.op));
  10195. Emit(Push(position, rightO.op));
  10196. CallAssignMethod(leftO.op, rightO.op, left.type);
  10197. Emit(Pop(position, rightO.op));
  10198. Emit(Pop(position, leftO.op));
  10199. sizeOp := CopySize(left, leftO.tag);
  10200. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10201. ReleaseIntermediateOperand(sizeOp);
  10202. ReleaseOperand(leftO);
  10203. ReleaseOperand(rightO);
  10204. ELSE
  10205. Evaluate(right,rightO);
  10206. Designate(left,leftO);
  10207. ASSERT(leftO.mode = ModeReference);
  10208. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10209. (* copy procedure address first *)
  10210. MakeMemory(mem,leftO.op,addressType,0);
  10211. Emit(Mov(position,mem,rightO.op));
  10212. ReleaseIntermediateOperand(mem);
  10213. (* copy pointer address *)
  10214. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10215. CallAssignPointer(leftO.tag, rightO.tag);
  10216. ELSE
  10217. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10218. CallAssignPointer(leftO.op, rightO.op);
  10219. END;
  10220. ReleaseOperand(leftO);
  10221. ReleaseOperand(rightO);
  10222. END;
  10223. ModifyAssignments(false);
  10224. RETURN;
  10225. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10226. SaveRegisters();ReleaseUsedRegisters(saved);
  10227. IF SemanticChecker.IsPointerType(leftType) THEN
  10228. Evaluate(right,rightO);
  10229. Designate(left,leftO);
  10230. Emit(Push(position,leftO.op));
  10231. ReleaseOperand(leftO);
  10232. Emit(Push(position,rightO.op));
  10233. ReleaseOperand(rightO);
  10234. CallThis(position,"Heaps","Assign",2);
  10235. ELSIF leftType.IsRecordType() THEN
  10236. Designate(right,rightO);
  10237. Designate(left,leftO);
  10238. Emit(Push(position,leftO.op));
  10239. Emit(Push(position,leftO.tag)); (* type desc *)
  10240. ReleaseOperand(leftO);
  10241. Emit(Push(position,rightO.op));
  10242. ReleaseOperand(rightO);
  10243. CallThis(position,"Heaps","AssignRecord",3);
  10244. ELSIF IsStaticArray(leftType) THEN
  10245. size := StaticArrayNumElements(leftType);
  10246. base := StaticArrayBaseType(leftType);
  10247. Designate(right,rightO);
  10248. Designate(left,leftO);
  10249. Emit(Push(position,leftO.op));
  10250. ReleaseOperand(leftO);
  10251. arg := TypeDescriptorAdr(base);
  10252. Emit(Push(position,arg));
  10253. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10254. Emit(Push(position,rightO.op));
  10255. ReleaseOperand(rightO);
  10256. CallThis(position,"Heaps","AssignArray",4);
  10257. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10258. size := StaticMathArrayNumElements(leftType);
  10259. base := StaticMathArrayBaseType(leftType);
  10260. Designate(right,rightO);
  10261. Designate(left,leftO);
  10262. Emit(Push(position,leftO.op));
  10263. ReleaseOperand(leftO);
  10264. arg := TypeDescriptorAdr(base);
  10265. Emit(Push(position,arg));
  10266. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10267. Emit(Push(position,rightO.op));
  10268. ReleaseOperand(rightO);
  10269. CallThis(position,"Heaps","AssignArray",4);
  10270. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10271. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10272. Evaluate(right,rightO);
  10273. Designate(left,leftO);
  10274. MakeMemory(mem,leftO.op,addressType,0);
  10275. Emit(Mov(position,mem,rightO.op));
  10276. ReleaseIntermediateOperand(mem);
  10277. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10278. Emit (Push(position, leftO.tag));
  10279. ReleaseOperand(leftO);
  10280. Emit (Push(position, rightO.tag));
  10281. ReleaseOperand(rightO);
  10282. CallThis(position,"Heaps","Assign", 2);
  10283. ELSE HALT(100); (* missing ? *)
  10284. END;
  10285. RestoreRegisters(saved);
  10286. RETURN;
  10287. END;
  10288. IF CanPassAsResultParameter(right) THEN
  10289. procedureResultDesignator := left(SyntaxTree.Designator);
  10290. Expression(right);
  10291. procedureResultDesignator := NIL;
  10292. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10293. (* left <-- ALIAS OF right: zerocopy *)
  10294. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10295. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, NIL, procedure);
  10296. designator.SetType(procedure.type);
  10297. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10298. call := SyntaxTree.NewProcedureCallDesignator(position,NIL,designator(SyntaxTree.Designator),parameters);
  10299. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10300. END;
  10301. ELSIF leftType IS SyntaxTree.RangeType THEN
  10302. (* LHS is of array range type *)
  10303. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10304. Evaluate(right, rightO);
  10305. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10306. (* first *)
  10307. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10308. Emit(Mov(position,mem, rightO.op));
  10309. ReleaseIntermediateOperand(mem);
  10310. (* last *)
  10311. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10312. Emit(Mov(position,mem, rightO.tag));
  10313. ReleaseIntermediateOperand(mem);
  10314. (* step *)
  10315. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10316. Emit(Mov(position,mem, rightO.extra));
  10317. ReleaseIntermediateOperand(mem);
  10318. ReleaseOperand(rightO);
  10319. ReleaseOperand(leftO)
  10320. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10321. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10322. Evaluate(right, rightO);
  10323. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10324. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10325. (* real part *)
  10326. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10327. Emit(Mov(position,mem, rightO.op));
  10328. ReleaseIntermediateOperand(mem);
  10329. (* imaginary part *)
  10330. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10331. Emit(Mov(position,mem, rightO.tag));
  10332. ReleaseIntermediateOperand(mem);
  10333. ReleaseOperand(rightO);
  10334. ReleaseOperand(leftO)
  10335. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10336. OR (leftType IS SyntaxTree.PortType) THEN
  10337. (* rightO := leftO;*)
  10338. Evaluate(right,rightO);
  10339. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10340. Designate(left,leftO);
  10341. IF leftO.mode = ModeReference THEN
  10342. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10343. destination := mem;
  10344. ELSE
  10345. destination := leftO.op;
  10346. END;
  10347. ReleaseOperand(leftO);
  10348. (* EXPERIMENTAL *)
  10349. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10350. ReleaseIntermediateOperand(destination);
  10351. destination := availableSymbols[leftO.availability].register;
  10352. UseIntermediateOperand(destination);
  10353. availableSymbols[leftO.availability].inMemory := FALSE;
  10354. END;
  10355. IF destination.mode # IntermediateCode.Undefined THEN
  10356. Emit(Mov(position,destination,rightO.op));
  10357. END;
  10358. ReleaseOperand(rightO);
  10359. ReleaseIntermediateOperand(mem);
  10360. IntermediateCode.InitOperand(destination);
  10361. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10362. Evaluate(right,rightO);
  10363. Designate(left,leftO);
  10364. MakeMemory(mem,leftO.op,addressType,0);
  10365. Emit(Mov(position,mem,rightO.op));
  10366. ReleaseIntermediateOperand(mem);
  10367. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10368. (* delegate *)
  10369. (*
  10370. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10371. *)
  10372. Emit(Mov(position,leftO.tag,rightO.tag));
  10373. END;
  10374. ReleaseOperand(leftO);
  10375. ReleaseOperand(rightO);
  10376. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10377. Designate(right,rightO);
  10378. Designate(left,leftO);
  10379. sizeOp := CopySize(left, leftO.tag);
  10380. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10381. ReleaseIntermediateOperand(sizeOp);
  10382. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10383. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10384. IF (rightType IS SyntaxTree.StringType) THEN
  10385. CopyString(left,right);
  10386. 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
  10387. Designate(right,rightO);
  10388. Designate(left,leftO);
  10389. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10390. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10391. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10392. ELSE
  10393. HALT(201)
  10394. END;
  10395. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10396. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10397. IF SemanticChecker.CanPassInRegister(system, right.type) THEN
  10398. Evaluate(right, rightO);
  10399. Designate(left, leftO);
  10400. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10401. Emit(Mov(position, leftO.op, rightO.op));
  10402. ELSE
  10403. MakeMemory(mem, leftO.op, rightO.op.type,0);
  10404. Emit(Mov(position, mem, rightO.op));
  10405. ReleaseIntermediateOperand(mem);
  10406. END;
  10407. ELSE
  10408. Designate(right, rightO);
  10409. Designate(left,leftO);
  10410. IF IntermediateCode.IsVectorRegister(rightO.op) & IntermediateCode.IsVectorRegister(leftO.op) THEN
  10411. Emit(Mov(position, leftO.op, rightO.op));
  10412. ELSIF IntermediateCode.IsVectorRegister(rightO.op) THEN
  10413. MakeMemory(mem, leftO.op, rightO.op.type,0);
  10414. Emit(Mov(position, mem, rightO.op));
  10415. ReleaseIntermediateOperand(mem);
  10416. ELSIF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10417. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10418. Emit(Mov(position, leftO.op, mem));
  10419. ReleaseIntermediateOperand(mem);
  10420. ELSE
  10421. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10422. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10423. END;
  10424. END;
  10425. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10426. ELSE
  10427. AssignMathArray(left,right);
  10428. END;
  10429. ELSE
  10430. HALT(200);
  10431. END;
  10432. END Assign;
  10433. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10434. BEGIN
  10435. IF Trace THEN TraceEnter("VisitAssignment") END;
  10436. Assign(x.left,x.right);
  10437. IF Trace THEN TraceExit("VisitAssignment") END;
  10438. END VisitAssignment;
  10439. PROCEDURE EmitCooperativeSwitch;
  10440. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10441. BEGIN
  10442. ASSERT (cooperativeSwitches);
  10443. pc := section.pc;
  10444. IF lastSwitchPC = section.pc THEN RETURN END;
  10445. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10446. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10447. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10448. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10449. INC(statCoopSwitch, section.pc - pc);
  10450. END EmitCooperativeSwitch;
  10451. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10452. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10453. BEGIN
  10454. p0 := communication.left; p1 := communication.right;
  10455. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10456. Evaluate(p0,s0);
  10457. Evaluate(p1,s1);
  10458. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10459. Emit(Push(position,s0.op));
  10460. Emit(Push(position,s1.op));
  10461. (*
  10462. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10463. *)
  10464. IF ~backend.cellsAreObjects THEN
  10465. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10466. END;
  10467. ReleaseOperand(s0);
  10468. ReleaseOperand(s1);
  10469. IF backend.cellsAreObjects THEN
  10470. CallThis(position,"ActiveCellsRuntime","Send",2);
  10471. ELSE
  10472. CallThis(position,ChannelModuleName,"Send",2);
  10473. END;
  10474. (* ----- RECEIVE ------*)
  10475. ELSE
  10476. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10477. tmp := p0; p0 := p1; p1 := tmp;
  10478. END;
  10479. Evaluate(p0,s0);
  10480. Emit(Push(position,s0.op));
  10481. Designate(p1,s1);
  10482. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10483. Emit(Push(position,s1.op));
  10484. (*
  10485. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10486. *)
  10487. IF ~backend.cellsAreObjects THEN
  10488. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10489. END;
  10490. ReleaseOperand(s0);
  10491. ReleaseOperand(s1);
  10492. IF backend.cellsAreObjects THEN
  10493. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10494. ELSE
  10495. CallThis(position,ChannelModuleName,"Receive",2)
  10496. END;
  10497. END;
  10498. END VisitCommunicationStatement;
  10499. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10500. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10501. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10502. VAR false: Label; condition, value: BOOLEAN;
  10503. BEGIN
  10504. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10505. IF condition THEN
  10506. false := NewLabel();
  10507. Condition(if.condition,false,FALSE);
  10508. StatementSequence(if.statements);
  10509. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10510. SetLabel(false);
  10511. ELSE
  10512. IF value THEN (* always true *)
  10513. escape := TRUE;
  10514. StatementSequence(if.statements);
  10515. (* no branch necessary -- rest skipped *)
  10516. END;
  10517. END;
  10518. END IfPart;
  10519. BEGIN
  10520. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10521. end := NewLabel();
  10522. elsifs := x.ElsifParts();
  10523. IfPart(x.ifPart,elsifs=0);
  10524. FOR i := 0 TO elsifs-1 DO
  10525. IF ~escape THEN
  10526. elsif := x.GetElsifPart(i);
  10527. IfPart(elsif, i=elsifs-1);
  10528. END;
  10529. END;
  10530. IF (x.elsePart # NIL) & ~escape THEN
  10531. StatementSequence(x.elsePart);
  10532. END;
  10533. SetLabel(end);
  10534. IF Trace THEN TraceExit("VisitIfStatement") END;
  10535. END VisitIfStatement;
  10536. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10537. VAR reg: IntermediateCode.Operand;
  10538. BEGIN
  10539. trueL := NewLabel();
  10540. IF backend.cooperative THEN
  10541. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10542. Emit(Mov(position,reg,tag));
  10543. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10544. ReleaseIntermediateOperand(reg);
  10545. ELSE
  10546. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10547. END;
  10548. END BrWithPart;
  10549. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10550. BEGIN
  10551. StatementSequence(x.statements);
  10552. END EmitWithPart;
  10553. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10554. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10555. tag: IntermediateCode.Operand;
  10556. BEGIN
  10557. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10558. endL := NewLabel();
  10559. elseL := NewLabel();
  10560. Designate(x.variable,res);
  10561. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10562. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10563. END;
  10564. ReuseCopy(tag, res.tag);
  10565. ReleaseOperand(res);
  10566. NEW(trueL, x.WithParts());
  10567. FOR i := 0 TO x.WithParts()-1 DO
  10568. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10569. END;
  10570. ReleaseIntermediateOperand(tag);
  10571. BrL(elseL);
  10572. FOR i := 0 TO x.WithParts()-1 DO
  10573. SetLabel(trueL[i]);
  10574. EmitWithPart(x.GetWithPart(i));
  10575. BrL(endL);
  10576. END;
  10577. SetLabel(elseL);
  10578. IF x.elsePart = NIL THEN
  10579. IF ~isUnchecked THEN
  10580. EmitTrap(position,WithTrap);
  10581. END;
  10582. ELSE
  10583. StatementSequence(x.elsePart)
  10584. END;
  10585. SetLabel(endL);
  10586. IF Trace THEN TraceExit("VisitWithStatement") END;
  10587. END VisitWithStatement;
  10588. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10589. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10590. out,else: Label; label: Label;
  10591. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10592. symbol: SyntaxTree.Symbol;
  10593. table: BOOLEAN;
  10594. BEGIN
  10595. (*! split case statement into if-elsif statements for large case label lists *)
  10596. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10597. range := x.max-x.min+1;
  10598. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10599. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10600. table := FALSE;
  10601. size := x.caseParts.Length();
  10602. ELSE
  10603. table := TRUE;
  10604. size := LONGINT(range);
  10605. END;
  10606. Evaluate(x.variable,var);
  10607. ReuseCopy(tmp,var.op);
  10608. ReleaseIntermediateOperand(var.op);
  10609. var.op := tmp;
  10610. (*
  10611. UniqueId(name,module.module,"case",caseId);
  10612. *)
  10613. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10614. else := NewLabel();
  10615. IF table THEN
  10616. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10617. Convert(var.op,addressType);
  10618. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10619. ReuseCopy(res,var.op);
  10620. ReleaseOperand(var);
  10621. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10622. Global.GetModuleSegmentedName(module.module, name);
  10623. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10624. symbol := SyntaxTree.NewSymbol(name[1]);
  10625. symbol.SetScope(moduleScope);
  10626. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10627. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10628. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10629. Emit(Add(position,res,res,jmp));
  10630. IntermediateCode.MakeMemory(res,addressType);
  10631. Emit(Br(position,res));
  10632. ReleaseIntermediateOperand(res);
  10633. ELSE
  10634. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10635. ReleaseOperand(var);
  10636. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10637. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10638. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10639. part := x.GetCasePart(i);
  10640. constant := part.firstConstant;
  10641. fixups[i] := NewLabel();
  10642. WHILE(constant # NIL) DO (* case labels for this case part *)
  10643. IF constant.min = constant.max THEN
  10644. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10645. ELSE
  10646. label := NewLabel();
  10647. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10648. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10649. BrL(fixups[i]);
  10650. SetLabel(label);
  10651. END;
  10652. constant := constant.next;
  10653. END;
  10654. END;
  10655. BrL(else);
  10656. ReleaseIntermediateOperand(res);
  10657. END;
  10658. out := NewLabel();
  10659. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10660. part := x.GetCasePart(i);
  10661. constant := part.firstConstant;
  10662. IF table THEN
  10663. label := NewLabel();
  10664. SetLabel(label);
  10665. WHILE(constant # NIL) DO (* case labels for this case part *)
  10666. FOR j := constant.min TO constant.max DO
  10667. fixups[j-x.min] := label;
  10668. END;
  10669. constant := constant.next;
  10670. END;
  10671. ELSE
  10672. SetLabel(fixups[i]);
  10673. END;
  10674. StatementSequence(part.statements);
  10675. BrL(out);
  10676. END;
  10677. SetLabel(else);
  10678. FOR i := 0 TO size-1 DO
  10679. IF fixups[i] = NIL THEN
  10680. fixups[i] := else;
  10681. END;
  10682. END;
  10683. IF x.elsePart # NIL THEN
  10684. StatementSequence(x.elsePart);
  10685. ELSIF ~isUnchecked THEN
  10686. EmitTrap(position,CaseTrap);
  10687. END;
  10688. SetLabel(out);
  10689. IF table THEN
  10690. FOR i := 0 TO size-1 DO
  10691. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10692. section.Emit(Data(position,op));
  10693. END;
  10694. END;
  10695. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10696. END VisitCaseStatement;
  10697. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10698. VAR startL,falseL: Label;
  10699. BEGIN
  10700. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10701. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10702. startL := NewLabel();
  10703. falseL := NewLabel();
  10704. SetLabel(startL);
  10705. Condition(x.condition,falseL,FALSE);
  10706. StatementSequence(x.statements);
  10707. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10708. BrL(startL);
  10709. SetLabel(falseL);
  10710. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10711. END VisitWhileStatement;
  10712. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10713. VAR falseL: Label;
  10714. BEGIN
  10715. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10716. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10717. falseL := NewLabel();
  10718. SetLabel(falseL);
  10719. StatementSequence(x.statements);
  10720. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10721. Condition(x.condition,falseL,FALSE);
  10722. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10723. END VisitRepeatStatement;
  10724. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10725. VAR
  10726. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10727. temporaryVariable: SyntaxTree.Variable;
  10728. temporaryVariableDesignator : SyntaxTree.Designator;
  10729. BEGIN
  10730. IF Trace THEN TraceEnter("VisitForStatement") END;
  10731. falseL := NewLabel();
  10732. startL := NewLabel();
  10733. Assign(x.variable,x.from);
  10734. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10735. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, NIL, temporaryVariable);
  10736. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10737. Assign(temporaryVariableDesignator,x.to);
  10738. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10739. IF by > 0 THEN
  10740. cmp := Scanner.LessEqual
  10741. ELSE
  10742. cmp := Scanner.GreaterEqual
  10743. END;
  10744. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10745. binary.SetType(system.booleanType);
  10746. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10747. SetLabel(startL);
  10748. Condition(binary,falseL, FALSE);
  10749. StatementSequence(x.statements);
  10750. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10751. binary.SetType(x.variable.type);
  10752. Assign(x.variable,binary);
  10753. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10754. BrL(startL);
  10755. SetLabel(falseL);
  10756. IF Trace THEN TraceExit("VisitForStatement") END;
  10757. END VisitForStatement;
  10758. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10759. VAR prevLoop: Label;
  10760. BEGIN
  10761. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10762. prevLoop := currentLoop;
  10763. currentLoop := NewLabel();
  10764. StatementSequence(x.statements);
  10765. SetLabel(currentLoop);
  10766. currentLoop := prevLoop;
  10767. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10768. END VisitExitableBlock;
  10769. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10770. VAR prevLoop,start: Label;
  10771. BEGIN
  10772. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10773. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10774. start := NewLabel();
  10775. prevLoop := currentLoop;
  10776. SetLabel(start);
  10777. currentLoop := NewLabel();
  10778. StatementSequence(x.statements);
  10779. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10780. BrL(start);
  10781. SetLabel(currentLoop);
  10782. currentLoop := prevLoop;
  10783. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10784. END VisitLoopStatement;
  10785. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10786. VAR outer: SyntaxTree.Statement;
  10787. BEGIN
  10788. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10789. IF locked THEN (* r if we jump out of an exclusive block *)
  10790. outer := x.outer;
  10791. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10792. outer := outer.outer;
  10793. END;
  10794. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10795. Lock(FALSE);
  10796. END;
  10797. END;
  10798. BrL(currentLoop);
  10799. IF Trace THEN TraceExit("VisitExitStatement") END;
  10800. END VisitExitStatement;
  10801. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10802. VAR
  10803. expression, parameterDesignator: SyntaxTree.Expression;
  10804. type, componentType: SyntaxTree.Type;
  10805. res, right: Operand;
  10806. left, mem, reg: IntermediateCode.Operand;
  10807. parameter: SyntaxTree.Parameter;
  10808. procedure: SyntaxTree.Procedure;
  10809. procedureType: SyntaxTree.ProcedureType;
  10810. returnTypeOffset: LONGINT;
  10811. delegate: BOOLEAN;
  10812. callingConvention, parametersSize: LONGINT;
  10813. symbol: SyntaxTree.Symbol;
  10814. BEGIN
  10815. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10816. expression := x.returnValue;
  10817. IF currentIsInline THEN
  10818. IF expression # NIL THEN
  10819. IF currentScope IS SyntaxTree.BlockScope THEN
  10820. symbol := currentScope.FindSymbol(ResultDesignatorName);
  10821. WITH symbol: SyntaxTree.Alias DO
  10822. Assign(symbol.expression, expression);
  10823. END;
  10824. ELSE
  10825. HALT(200);
  10826. (*
  10827. map := currentMapper.Get(NIL);
  10828. IF map # NIL THEN
  10829. Assign(map.to, expression);
  10830. ELSE
  10831. Evaluate(expression,res);
  10832. Emit(Return(position,res.op));
  10833. ReleaseOperand(res);
  10834. END;
  10835. *)
  10836. END;
  10837. END;
  10838. BrL(currentInlineExit);
  10839. RETURN;
  10840. END;
  10841. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10842. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10843. IF expression # NIL THEN
  10844. type := expression.type.resolved;
  10845. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10846. IF locked THEN Lock(FALSE) END;
  10847. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10848. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10849. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10850. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention)
  10851. OR (type IS SyntaxTree.MathArrayType) & SemanticChecker.CanPassInRegister(system,type) THEN
  10852. (* return without structured return parameter *)
  10853. Evaluate(expression,res);
  10854. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10855. IF locked OR profile THEN
  10856. Emit(Push(position,res.op));
  10857. IF delegate THEN HALT(200) END;
  10858. ReleaseOperand(res);
  10859. IF locked THEN Lock(FALSE) END;
  10860. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10861. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10862. reg := NewRegisterOperand(res.op.type);
  10863. Emit(Pop(position,reg));
  10864. Emit(Return(position,reg));
  10865. ReleaseIntermediateOperand(reg);
  10866. ELSE
  10867. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10868. Emit(Return(position,res.op));
  10869. ReleaseOperand(res);
  10870. END;
  10871. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.StringType) OR type.IsPointer()
  10872. THEN
  10873. (* return using structured return parameter *)
  10874. 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)
  10875. OR (type IS SyntaxTree.StringType)
  10876. OR SemanticChecker.IsPointerType(type));
  10877. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10878. parameter :=procedureType.returnParameter;
  10879. ASSERT(parameter # NIL);
  10880. returnTypeOffset := parameter.offsetInBits;
  10881. (*
  10882. IF parameter# NIL THEN
  10883. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10884. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10885. ELSE
  10886. returnTypeOffset := system.offsetFirstParameter
  10887. END;
  10888. *)
  10889. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10890. IF type IS SyntaxTree.RangeType THEN
  10891. (* array range type *)
  10892. Evaluate(expression, right);
  10893. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10894. Emit(Mov(position,mem, right.op)); (* first *)
  10895. ReleaseIntermediateOperand(mem);
  10896. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10897. Emit(Mov(position,mem, right.tag)); (* last *)
  10898. ReleaseIntermediateOperand(mem);
  10899. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10900. Emit(Mov(position,mem, right.extra)); (* step *)
  10901. ReleaseIntermediateOperand(mem);
  10902. ReleaseOperand(right);
  10903. ELSIF type IS SyntaxTree.ComplexType THEN
  10904. Evaluate(expression, right);
  10905. componentType := type(SyntaxTree.ComplexType).componentType;
  10906. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10907. Emit(Mov(position,mem, right.op)); (* real part *)
  10908. ReleaseIntermediateOperand(mem);
  10909. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10910. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10911. ReleaseIntermediateOperand(mem);
  10912. ReleaseOperand(right);
  10913. ELSE (* covers cases: pointer / record / array *)
  10914. parameter := procedureType.returnParameter;
  10915. checker.SetCurrentScope(currentScope);
  10916. ASSERT(parameter # NIL);
  10917. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,NIL, parameter);
  10918. Assign(parameterDesignator,expression);
  10919. END;
  10920. ReleaseIntermediateOperand(left);
  10921. IF locked THEN Lock(FALSE) END;
  10922. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10923. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10924. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10925. parameter := procedureType.returnParameter;
  10926. checker.SetCurrentScope(currentScope);
  10927. IF parameter = NIL THEN
  10928. Error(procedure.position, "structured return of parameter of procedure not found");
  10929. ELSE
  10930. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,NIL, parameter);
  10931. Assign(parameterDesignator,expression);
  10932. END;
  10933. IF locked THEN Lock(FALSE) END;
  10934. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10935. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10936. ELSE
  10937. HALT(200);
  10938. END;
  10939. ELSE
  10940. IF locked THEN Lock(FALSE) END;
  10941. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10942. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10943. END;
  10944. IF backend.cooperative THEN
  10945. BrL(exitLabel);
  10946. ELSE
  10947. callingConvention := procedureType.callingConvention;
  10948. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10949. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10950. ELSE
  10951. parametersSize := 0;
  10952. END;
  10953. EmitLeave(section, position,procedure, callingConvention);
  10954. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10955. END;
  10956. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10957. END VisitReturnStatement;
  10958. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10959. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10960. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10961. statements: SyntaxTree.StatementSequence;
  10962. name, suffix: SyntaxTree.IdentifierString;
  10963. BEGIN
  10964. Strings.IntToStr(awaitProcCounter,suffix);
  10965. Strings.Concat("@AwaitProcedure",suffix,name);
  10966. identifier := SyntaxTree.NewIdentifier(name);
  10967. INC(awaitProcCounter);
  10968. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10969. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10970. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10971. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10972. procedure.SetAccess(SyntaxTree.Hidden);
  10973. procedure.SetScope(currentScope);
  10974. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10975. procedureType.SetReturnType(system.booleanType);
  10976. procedure.SetType(procedureType);
  10977. body := SyntaxTree.NewBody(x.position,procedureScope);
  10978. procedureScope.SetBody(body);
  10979. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10980. returnStatement.SetReturnValue(x.condition);
  10981. statements := SyntaxTree.NewStatementSequence();
  10982. statements.AddStatement(returnStatement);
  10983. body.SetStatementSequence(statements);
  10984. currentScope.AddProcedure(procedure);
  10985. RETURN procedure
  10986. END MakeAwaitProcedure;
  10987. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10988. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10989. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10990. BEGIN
  10991. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10992. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10993. IF backend.cooperative THEN
  10994. startL := NewLabel();
  10995. trueL := NewLabel();
  10996. SetLabel(startL);
  10997. Condition(x.condition,trueL,TRUE);
  10998. PushSelfPointer();
  10999. CallThis(position,"ExclusiveBlocks","Await",1);
  11000. BrL(startL);
  11001. SetLabel(trueL);
  11002. PushSelfPointer();
  11003. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  11004. ELSE
  11005. proc := MakeAwaitProcedure(x);
  11006. Emit(Push(position,fp));
  11007. GetCodeSectionNameForSymbol(proc,name);
  11008. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  11009. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  11010. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  11011. Emit(Call(position,call,ProcParametersSize(proc)));
  11012. Emit(Result(position,res));
  11013. (*
  11014. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  11015. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  11016. *)
  11017. InitOperand(result,ModeValue);
  11018. result.op := res;
  11019. label := NewLabel();
  11020. BreqL(label, result.op, SELF.true);
  11021. ReleaseOperand(result);
  11022. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  11023. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  11024. Emit(Push(position,res));
  11025. Emit(Push(position,fp));
  11026. PushSelfPointer();
  11027. Emit(Push(position,nil));
  11028. CallThis(position,"Objects","Await",4);
  11029. SetLabel(label);
  11030. END;
  11031. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11032. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  11033. END VisitAwaitStatement;
  11034. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  11035. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  11036. BEGIN
  11037. FOR i := 0 TO x.Length() - 1 DO
  11038. statement := x.GetStatement( i );
  11039. Statement(statement);
  11040. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11041. END;
  11042. END StatementSequence;
  11043. PROCEDURE PushSelfPointer;
  11044. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11045. procedureType: SyntaxTree.ProcedureType;
  11046. BEGIN
  11047. scope := currentScope;
  11048. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11049. scope := scope.outerScope;
  11050. END;
  11051. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11052. moduleSection := meta.ModuleSection();
  11053. IF backend.cooperative THEN
  11054. moduleOffset := 0;
  11055. ELSE
  11056. moduleOffset := moduleSection.pc;
  11057. END;
  11058. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11059. ELSE
  11060. GetBaseRegister(op.op,currentScope,scope);
  11061. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11062. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11063. parametersSize := ProcParametersSize(procedure);
  11064. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11065. IF backend.cooperative THEN
  11066. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11067. END;
  11068. IntermediateCode.MakeMemory(op.op,addressType);
  11069. END;
  11070. Emit(Push(position,op.op));
  11071. ReleaseOperand(op);
  11072. END PushSelfPointer;
  11073. PROCEDURE Lock(lock: BOOLEAN);
  11074. BEGIN
  11075. IF Trace THEN TraceEnter("Lock") END;
  11076. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11077. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11078. ASSERT(modifyAssignmentCounter = 0);
  11079. IF dump # NIL THEN
  11080. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11081. dump.Ln;dump.Update;
  11082. END;
  11083. PushSelfPointer;
  11084. IF backend.cooperative THEN
  11085. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11086. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11087. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11088. END;
  11089. ELSE
  11090. Emit(Push(position,true));
  11091. IF lock THEN CallThis(position,"Objects","Lock",2)
  11092. ELSE CallThis(position,"Objects","Unlock",2);
  11093. END;
  11094. END;
  11095. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11096. IF Trace THEN TraceExit("Lock") END;
  11097. END Lock;
  11098. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11099. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11100. prevScope: SyntaxTree.Scope;
  11101. BEGIN
  11102. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11103. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11104. previouslyUnchecked := isUnchecked;
  11105. isUnchecked := isUnchecked OR x.isUnchecked;
  11106. previouslyCooperativeSwitches := cooperativeSwitches;
  11107. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11108. prevScope := currentScope;
  11109. IF x.scope # NIL THEN currentScope := x.scope END;
  11110. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11111. IF x.statements # NIL THEN
  11112. StatementSequence(x.statements);
  11113. END;
  11114. IF (x IS SyntaxTree.Body) THEN
  11115. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11116. section.SetFinally(section.pc);
  11117. StatementSequence(x(SyntaxTree.Body).finally)
  11118. ELSIF x.isExclusive THEN
  11119. end := NewLabel();
  11120. BrL(end);
  11121. section.SetFinally(section.pc);
  11122. Lock(FALSE);
  11123. EmitTrap(position,RethrowTrap);
  11124. SetLabel(end);
  11125. END;
  11126. END;
  11127. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11128. isUnchecked := previouslyUnchecked;
  11129. cooperativeSwitches := previouslyCooperativeSwitches;
  11130. currentScope := prevScope;
  11131. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11132. END VisitStatementBlock;
  11133. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11134. BEGIN
  11135. (*
  11136. scope := currentScope;
  11137. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11138. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11139. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11140. return := emptyOperand;
  11141. IF Trace THEN TraceEnter("VisitCode") END;
  11142. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11143. NEW(in, x.inRules.Length());
  11144. FOR i := 0 TO LEN(in)-1 DO
  11145. statement := x.inRules.GetStatement(i);
  11146. WITH statement: SyntaxTree.Assignment DO
  11147. Evaluate(statement.right, operand);
  11148. result := operand.op;
  11149. NEW(str, 64);
  11150. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11151. in[i] := result; IntermediateCode.SetString(in[i], str);
  11152. ReleaseIntermediateOperand(operand.tag);
  11153. END;
  11154. END;
  11155. ELSE in := NIL
  11156. END;
  11157. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11158. NEW(out, x.outRules.Length());
  11159. FOR i := 0 TO LEN(out)-1 DO
  11160. statement := x.outRules.GetStatement(i);
  11161. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11162. WITH statement:
  11163. SyntaxTree.Assignment DO
  11164. Designate(statement.left, operand);
  11165. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11166. NEW(str, 64);
  11167. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11168. out[i] := result; IntermediateCode.SetString(out[i], str);
  11169. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11170. | SyntaxTree.ReturnStatement DO
  11171. NEW(str, 64);
  11172. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11173. IF currentIsInline THEN
  11174. map := currentMapper.Get(NIL);
  11175. Designate(map.to, operand);
  11176. IF map.isAddress THEN
  11177. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11178. ELSE
  11179. result := operand.op;
  11180. END;
  11181. (*! only if it does not fit into register
  11182. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11183. *)
  11184. (*Evaluate(map.to, operand);*)
  11185. out[i] := result;
  11186. ELSE
  11187. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11188. END;
  11189. IntermediateCode.SetString(out[i], str);
  11190. ReleaseIntermediateOperand(operand.tag);
  11191. return := out[i];
  11192. ELSE
  11193. END;
  11194. END;
  11195. ELSE out := NIL
  11196. END;
  11197. *)
  11198. Emit(Asm(x.position,x.sourceCode, NIL, NIL, currentScope));
  11199. (*
  11200. IF in # NIL THEN
  11201. FOR i := 0 TO LEN(in)-1 DO
  11202. ReleaseIntermediateOperand(in[i]);
  11203. END;
  11204. END;
  11205. IF out # NIL THEN
  11206. FOR i := 0 TO LEN(out)-1 DO
  11207. WITH statement:
  11208. SyntaxTree.Assignment DO
  11209. ReleaseIntermediateOperand(out[i]);
  11210. |SyntaxTree.ReturnStatement DO
  11211. (* release happens below *)
  11212. ELSE
  11213. END;
  11214. statement := x.outRules.GetStatement(i);
  11215. END;
  11216. END;
  11217. IF return.mode # IntermediateCode.Undefined THEN
  11218. IF currentIsInline THEN
  11219. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11220. Symbol(procedureType.returnParameter, par);
  11221. MakeMemory(mem, par.op, return.type, 0);
  11222. ReleaseOperand(par);
  11223. Emit(Mov(position, mem, return));
  11224. ReleaseIntermediateOperand(mem);
  11225. ELSE
  11226. Emit(Return(position,return));
  11227. END;
  11228. ReleaseIntermediateOperand(return);
  11229. IF currentIsInline THEN RETURN END;
  11230. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11231. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11232. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11233. ELSE
  11234. parametersSize := 0;
  11235. END;
  11236. EmitLeave(section, position,procedure, callingConvention);
  11237. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11238. END;
  11239. *)
  11240. IF Trace THEN TraceExit("VisitCode") END;
  11241. END VisitCode;
  11242. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11243. BEGIN
  11244. RETURN ProcedureParametersSize(system, procedure);
  11245. END ProcParametersSize;
  11246. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11247. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11248. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11249. const, call: IntermediateCode.Operand;
  11250. parameterDesignator: SyntaxTree.Expression;
  11251. saved: RegisterEntry;
  11252. name: Basic.SegmentedName;
  11253. BEGIN
  11254. IF Trace THEN TraceEnter("ParameterCopies") END;
  11255. parameter := x.firstParameter;
  11256. WHILE parameter # NIL DO
  11257. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11258. type := parameter.type.resolved;
  11259. IF IsOpenArray(type) THEN
  11260. VisitParameter(parameter);
  11261. op := result;
  11262. IF backend.cooperative & parameter.NeedsTrace() THEN
  11263. length := GetArrayLength(type, op.tag);
  11264. size := NewRegisterOperand(addressType);
  11265. base := ArrayBaseType(type);
  11266. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11267. Emit(Mul(position, size, length, const));
  11268. dst := NewRegisterOperand (addressType);
  11269. Emit(Mov(position, dst, size));
  11270. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11271. Emit(Sub(position,dst,sp,dst));
  11272. Emit(And(position,dst,dst,const));
  11273. Emit(Mov(position,sp,dst));
  11274. par := fp;
  11275. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11276. IntermediateCode.InitImmediate(null, byteType, 0);
  11277. Emit(Fill(position, dst, size, null));
  11278. ReleaseIntermediateOperand(dst);
  11279. ReleaseIntermediateOperand(length);
  11280. SaveRegisters();ReleaseUsedRegisters(saved);
  11281. (* register dst has been freed before SaveRegisters already *)
  11282. base := ArrayBaseType(type);
  11283. (* assign method of open array *)
  11284. IF base.IsRecordType() THEN
  11285. Emit (Push(position, length));
  11286. Emit (Push(position, dst));
  11287. Emit (Push(position, op.op));
  11288. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11289. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11290. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11291. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11292. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11293. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11294. Emit (Push(position,length));
  11295. Emit (Push(position, dst));
  11296. Emit (Push(position, length));
  11297. Emit (Push(position, op.op));
  11298. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11299. ELSE
  11300. Emit (Push(position, length));
  11301. Emit (Push(position, dst));
  11302. Emit (Push(position, length));
  11303. Emit (Push(position, op.op));
  11304. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11305. ASSERT(ArrayBaseType(type).IsPointer());
  11306. END;
  11307. RestoreRegisters(saved);
  11308. ELSE
  11309. temp := GetDynamicSize(type,op.tag);
  11310. ReuseCopy(size,temp);
  11311. ReleaseIntermediateOperand(temp);
  11312. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11313. Emit(Sub(position,size,sp,size));
  11314. Emit(And(position,size,size,const));
  11315. Emit(Mov(position,sp,size));
  11316. par := fp;
  11317. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11318. ReleaseIntermediateOperand(size);
  11319. size := GetDynamicSize(type,op.tag);
  11320. END;
  11321. Emit(Copy(position,sp,op.op,size));
  11322. ReleaseIntermediateOperand(size);
  11323. ReleaseOperand(op);
  11324. IntermediateCode.MakeMemory(par,addressType);
  11325. Emit(Mov(position,par,sp));
  11326. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11327. checker.SetCurrentScope(currentScope);
  11328. parameterDesignator := checker.NewSymbolDesignator(position,NIL, NIL,parameter);
  11329. Assign(parameterDesignator,parameterDesignator);
  11330. END;
  11331. END;
  11332. parameter := parameter.nextParameter;
  11333. END;
  11334. IF Trace THEN TraceExit("ParameterCopies") END;
  11335. END ParameterCopies;
  11336. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11337. VAR x: SyntaxTree.Variable;
  11338. BEGIN
  11339. x := scope.firstVariable;
  11340. WHILE x # NIL DO
  11341. InitVariable(x,FALSE);
  11342. x := x.nextVariable;
  11343. END;
  11344. END InitVariables;
  11345. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): Basic.Fingerprint;
  11346. BEGIN
  11347. IF (symbol # NIL) THEN
  11348. RETURN fingerprinter.SymbolFP(symbol).public
  11349. ELSE
  11350. RETURN 0
  11351. END;
  11352. END GetFingerprint;
  11353. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11354. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11355. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11356. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11357. name: Basic.SegmentedName;
  11358. offset: LONGINT;
  11359. par: SyntaxTree.Parameter;
  11360. var: SyntaxTree.Variable;
  11361. src, dest: Operand;
  11362. symbol: SyntaxTree.Symbol;
  11363. name0: ARRAY 256 OF CHAR;
  11364. BEGIN
  11365. IF Trace THEN TraceEnter("Body") END;
  11366. ReleaseUsedRegisters(saved); (* just in case ... *)
  11367. section := ir;
  11368. exitLabel := NewLabel ();
  11369. IF moduleBody THEN moduleBodySection := section END;
  11370. IF ir.comments # NIL THEN
  11371. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11372. commentPrintout.SingleStatement(TRUE);
  11373. dump := ir.comments;
  11374. ELSE
  11375. commentPrintout := NIL;
  11376. dump := NIL;
  11377. END;
  11378. prevScope := currentScope;
  11379. currentScope := scope;
  11380. lastSwitchPC := 0;
  11381. cooperativeSwitches := backend.cooperative;
  11382. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11383. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11384. IF x # NIL THEN
  11385. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11386. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11387. IF moduleBody THEN
  11388. ProfilerInit();
  11389. ELSE
  11390. Basic.SegmentedNameToString(ir.name, string);
  11391. ProfilerAddProcedure(numberProcedures,string);
  11392. ProfilerEnterExit(numberProcedures,TRUE);
  11393. END;
  11394. END;
  11395. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11396. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11397. END;
  11398. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11399. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11400. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11401. IF procedure = cellScope.bodyProcedure THEN
  11402. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11403. StaticCallOperand(op, cellScope.constructor);
  11404. Emit(Call(position,op.op,0));
  11405. END;
  11406. END;
  11407. END;
  11408. var := scope.firstVariable;
  11409. WHILE var # NIL DO
  11410. IF var.preferRegister THEN
  11411. IF var.registerNumber < 0 THEN
  11412. var.RegisterNumber(AcquireRegister(IntermediateCode.GetType(system,var.type),IntermediateCode.GeneralPurposeRegister));
  11413. END;
  11414. END;
  11415. var := var.nextVariable;
  11416. END;
  11417. InitVariables(scope);
  11418. par := procedureType.firstParameter;
  11419. WHILE par # NIL DO
  11420. IF par.preferRegister THEN
  11421. IF par.registerNumber < 0 THEN
  11422. par.PreferRegister(FALSE);
  11423. Symbol(par, src);
  11424. MakeMemory(src.op,src.op,IntermediateCode.GetType(system,par.type),0);
  11425. par.PreferRegister(TRUE);
  11426. par.RegisterNumber(AcquireRegister(IntermediateCode.GetType(system,par.type),IntermediateCode.GeneralPurposeRegister));
  11427. Symbol(par, dest);
  11428. Emit(Mov(par.position, dest.op, src.op));
  11429. ReleaseOperand(src);
  11430. ReleaseOperand(dest);
  11431. END;
  11432. END;
  11433. par := par.nextParameter;
  11434. END;
  11435. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11436. GetCodeSectionNameForSymbol(procedure, name);
  11437. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11438. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11439. IF ProtectModulesPointers THEN
  11440. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11441. ELSE
  11442. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11443. END;
  11444. IntermediateCode.SetOffset(right,offset); (* tag *)
  11445. IntermediateCode.InitMemory(left,addressType,fp,0);
  11446. Emit(Mov(position, left, right));
  11447. END;
  11448. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11449. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11450. ParameterCopies(procedureType);
  11451. IF x.code = NIL THEN
  11452. VisitStatementBlock(x);
  11453. ELSE
  11454. VisitCode(x.code)
  11455. END;
  11456. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11457. IF ~backend.cooperative THEN
  11458. ProfilerEnterExit(numberProcedures,FALSE);
  11459. END;
  11460. INC(numberProcedures);
  11461. END;
  11462. END;
  11463. IF backend.cooperative THEN
  11464. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11465. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11466. END;
  11467. IF x # NIL THEN
  11468. SELF.position := x.position;
  11469. END;
  11470. EndBasicBlock;
  11471. var := scope.firstVariable;
  11472. WHILE var # NIL DO
  11473. IF var.preferRegister THEN
  11474. Emit(Use(var.position, IntermediateCode.Register(IntermediateCode.GetType(system,var.type),IntermediateCode.GeneralPurposeRegister, var.registerNumber)));
  11475. (* hint for backend that register is in use until here *)
  11476. UnuseRegister(var.registerNumber);
  11477. END;
  11478. var := var.nextVariable;
  11479. END;
  11480. par := procedureType.firstParameter;
  11481. WHILE par # NIL DO
  11482. IF par.preferRegister THEN
  11483. IF par.kind = SyntaxTree.VarParameter THEN
  11484. Symbol(par, src);
  11485. par.PreferRegister(FALSE);
  11486. Symbol(par, dest);
  11487. MakeMemory(dest.op,dest.op,IntermediateCode.GetType(system,par.type),0);
  11488. Emit(Mov(par.position, dest.op, src.op));
  11489. ReleaseOperand(dest);
  11490. ReleaseOperand(src);
  11491. ELSE
  11492. Emit(Use(par.position, IntermediateCode.Register(IntermediateCode.GetType(system,par.type),IntermediateCode.GeneralPurposeRegister, par.registerNumber)));
  11493. END;
  11494. (* hint for backend that register is in use until here *)
  11495. UnuseRegister(par.registerNumber);
  11496. END;
  11497. par := par.nextParameter;
  11498. END;
  11499. IF dump # NIL THEN
  11500. symbol := currentScope.firstSymbol;
  11501. WHILE (symbol # NIL) DO
  11502. symbol.GetName(name0);
  11503. dump.String(name0);
  11504. dump.String("@");
  11505. dump.Int(symbol.offsetInBits DIV 8,1);
  11506. dump.Ln;
  11507. dump.Update;
  11508. symbol := symbol.nextSymbol;
  11509. END;
  11510. END;
  11511. CheckRegistersFree();
  11512. ASSERT(modifyAssignmentCounter = 0);
  11513. currentScope := prevScope;
  11514. IF Trace THEN TraceExit("Body") END;
  11515. END Body;
  11516. END ImplementationVisitor;
  11517. MetaDataGenerator=OBJECT
  11518. VAR
  11519. implementationVisitor: ImplementationVisitor;
  11520. declarationVisitor: DeclarationVisitor;
  11521. module: Sections.Module;
  11522. moduleName: ARRAY 128 OF CHAR;
  11523. moduleNamePool: Basic.HashTableInt;
  11524. moduleNamePoolSection: IntermediateCode.Section;
  11525. modulePointerSection: IntermediateCode.Section;
  11526. modulePointerSizePC: LONGINT;
  11527. modulePointerSectionOffset: LONGINT;
  11528. modulePointers: LONGINT;
  11529. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11530. RecordBaseOffset: LONGINT;
  11531. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11532. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11533. TypeTags: LONGINT; (* type extension level support *)
  11534. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11535. patchInfoPC: LONGINT;
  11536. patchCRC: LONGINT;
  11537. CONST
  11538. EmptyBlockOffset = 2;
  11539. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11540. BEGIN
  11541. IF implementationVisitor.backend.cooperative THEN
  11542. TypeTags := MAX(LONGINT);
  11543. BaseTypesTableOffset := 0;
  11544. MethodTableOffset := 2;
  11545. TypeRecordBaseOffset := 0;
  11546. RecordBaseOffset := 0;
  11547. ELSIF simple THEN
  11548. TypeTags := 3; (* only 3 extensions allowed *)
  11549. BaseTypesTableOffset := 1;
  11550. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11551. TypeRecordBaseOffset := 0;
  11552. RecordBaseOffset := 1;
  11553. ELSE
  11554. TypeTags := 16;
  11555. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11556. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11557. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11558. (* change this when Heaps.HeapBlock is modified *)
  11559. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11560. RecordBaseOffset := 8; (* addresses *)
  11561. ELSE
  11562. RecordBaseOffset := 9; (* addresses *)
  11563. END;
  11564. END;
  11565. SELF.simple := simple;
  11566. SELF.implementationVisitor := implementationVisitor;
  11567. SELF.declarationVisitor := declarationVisitor;
  11568. implementationVisitor.meta := SELF;
  11569. declarationVisitor.meta := SELF;
  11570. END InitMetaDataGenerator;
  11571. PROCEDURE SetModule(module: Sections.Module);
  11572. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11573. BEGIN
  11574. SELF.module := module;
  11575. Global.GetModuleName(module.module,moduleName);
  11576. Global.GetSymbolSegmentedName(module.module, name);
  11577. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11578. NEW(moduleNamePool, 32);
  11579. (*! require GC protection *)
  11580. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11581. IF ProtectModulesPointers THEN
  11582. name := "Heaps.AnyPtr";
  11583. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11584. (* set base pointer *)
  11585. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11586. END;
  11587. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11588. modulePointers := 0;
  11589. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11590. AddPointer(moduleNamePoolSection, namePoolOffset);
  11591. END;
  11592. END SetModule;
  11593. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11594. BEGIN
  11595. IF ~implementationVisitor.backend.cooperative THEN
  11596. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11597. INC(modulePointers);
  11598. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11599. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11600. END;
  11601. END AddPointer;
  11602. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11603. BEGIN
  11604. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11605. END GetTypeRecordBaseOffset;
  11606. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11607. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11608. BEGIN
  11609. (* change this when Heaps.HeapBlock is modified *)
  11610. INC(dataAdrOffset,7);
  11611. Info(section,"headerAdr");
  11612. Address(section,0);
  11613. Info(section,"typeDesc");
  11614. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11615. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11616. NamedSymbol(section, name, symbol, 0, offset);
  11617. Info(section,"mark: LONGINT;");
  11618. Longint(section,-1);
  11619. Info(section,"refCount: LONGINT;");
  11620. Longint(section,0);
  11621. (*
  11622. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11623. *)
  11624. Info(section,"dataAdr-: ADDRESS");
  11625. Symbol(section,section, dataAdrOffset,0);
  11626. Info(section,"size-: SIZE");
  11627. Address(section,0);
  11628. Info(section,"nextMark: HeapBlock;");
  11629. Address(section,0);
  11630. END HeapBlock;
  11631. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11632. VAR i: LONGINT;
  11633. BEGIN
  11634. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11635. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11636. Info(section,"count*: LONGINT");
  11637. Longint(section,0);
  11638. Info(section,"locked*: BOOLEAN");
  11639. Longint(section,0);
  11640. Info(section,"awaitingLock*: ProcessQueue");
  11641. Address(section,0);
  11642. Address(section,0);
  11643. Info(section,"awaitingCond*: ProcessQueue");
  11644. Address(section,0);
  11645. Address(section,0);
  11646. Info(section,"lockedBy*: ANY");
  11647. Address(section,0);
  11648. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11649. Longint(section,1);
  11650. FOR i := 2 TO 6 DO
  11651. Longint(section,0);
  11652. END;
  11653. Info(section,"lock*: ANY");
  11654. Address(section,0);
  11655. END ProtectedHeapBlock;
  11656. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11657. BEGIN
  11658. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11659. END Info;
  11660. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11661. VAR op: IntermediateCode.Operand;
  11662. BEGIN
  11663. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11664. section.Emit(Data(Basic.invalidPosition,op));
  11665. END Address;
  11666. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11667. VAR op: IntermediateCode.Operand;
  11668. BEGIN
  11669. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11670. section.Emit(Data(Basic.invalidPosition,op));
  11671. END Size;
  11672. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11673. VAR op: IntermediateCode.Operand;
  11674. BEGIN
  11675. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11676. section.Emit(Data(Basic.invalidPosition,op));
  11677. END Set;
  11678. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11679. VAR op: IntermediateCode.Operand;
  11680. BEGIN
  11681. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11682. section.Emit(Data(Basic.invalidPosition,op));
  11683. END Longint;
  11684. PROCEDURE Hugeint(section: IntermediateCode.Section; value: HUGEINT);
  11685. VAR op: IntermediateCode.Operand;
  11686. BEGIN
  11687. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.hugeintType),value);
  11688. section.Emit(Data(Basic.invalidPosition,op));
  11689. END Hugeint;
  11690. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11691. VAR op,noOperand: IntermediateCode.Operand;
  11692. BEGIN
  11693. IntermediateCode.InitOperand(noOperand);
  11694. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11695. section.PatchOperands(pc,op,noOperand,noOperand);
  11696. END PatchSize;
  11697. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11698. VAR op,noOperand: IntermediateCode.Operand;
  11699. BEGIN
  11700. IntermediateCode.InitOperand(noOperand);
  11701. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11702. section.PatchOperands(pc,op,noOperand,noOperand);
  11703. END PatchLongint;
  11704. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11705. VAR op, noOperand: IntermediateCode.Operand;
  11706. BEGIN
  11707. IntermediateCode.InitOperand(noOperand);
  11708. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11709. section.PatchOperands(pc,op,noOperand,noOperand);
  11710. END PatchSymbol;
  11711. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11712. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11713. BEGIN
  11714. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11715. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11716. section.Emit(Data(Basic.invalidPosition,op));
  11717. END Boolean;
  11718. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11719. VAR op: IntermediateCode.Operand;
  11720. BEGIN
  11721. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11722. section.Emit(Data(Basic.invalidPosition,op));
  11723. END Char;
  11724. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11725. VAR i: LONGINT;
  11726. BEGIN
  11727. Info(section,str);
  11728. i := 0;
  11729. WHILE(str[i] # 0X) DO
  11730. Char(section,str[i]);
  11731. INC(i);
  11732. END;
  11733. Char(section,0X);
  11734. END String;
  11735. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11736. VAR s: Basic.SectionName;
  11737. BEGIN
  11738. StringPool.GetString(str, s);
  11739. String(section, s);
  11740. END String0;
  11741. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11742. VAR op: IntermediateCode.Operand;
  11743. BEGIN
  11744. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11745. IntermediateCode.SetOffset(op,realOffset);
  11746. section.Emit(Data(Basic.invalidPosition,op));
  11747. END NamedSymbol;
  11748. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11749. VAR op: IntermediateCode.Operand;
  11750. BEGIN
  11751. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11752. IntermediateCode.SetOffset(op,realOffset);
  11753. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11754. END NamedSymbolAt;
  11755. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11756. BEGIN
  11757. IF symbol= NIL THEN
  11758. Address( section, realOffset);
  11759. ASSERT(virtualOffset = 0);
  11760. ELSE
  11761. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11762. END;
  11763. END Symbol;
  11764. (* OutPointers delivers
  11765. {pointerOffset}
  11766. *)
  11767. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11768. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11769. BEGIN
  11770. type := type.resolved;
  11771. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11772. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11773. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11774. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11775. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11776. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11777. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11778. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11779. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11780. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11781. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11782. ELSIF (type IS SyntaxTree.RecordType) THEN
  11783. (* never treat a record like a pointer, even if the pointer field is set! *)
  11784. WITH type: SyntaxTree.RecordType DO
  11785. base := type.GetBaseRecord();
  11786. IF base # NIL THEN
  11787. Pointers(offset,symbol,section, base,numberPointers);
  11788. END;
  11789. variable := type.recordScope.firstVariable;
  11790. WHILE(variable # NIL) DO
  11791. IF ~(variable.untraced) THEN
  11792. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11793. END;
  11794. variable := variable.nextVariable;
  11795. END;
  11796. END;
  11797. ELSIF (type IS SyntaxTree.CellType) THEN
  11798. WITH type: SyntaxTree.CellType DO
  11799. base := type.GetBaseRecord();
  11800. IF base # NIL THEN
  11801. Pointers(offset,symbol,section, base,numberPointers);
  11802. END;
  11803. variable := type.cellScope.firstVariable;
  11804. WHILE(variable # NIL) DO
  11805. IF ~(variable.untraced) THEN
  11806. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11807. END;
  11808. variable := variable.nextVariable;
  11809. END;
  11810. property := type.firstProperty;
  11811. WHILE(property # NIL) DO
  11812. IF ~(property.untraced) THEN
  11813. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11814. END;
  11815. property := property.nextProperty;
  11816. END;
  11817. parameter := type.firstParameter;
  11818. WHILE(parameter # NIL) DO
  11819. IF ~(parameter.untraced) THEN
  11820. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11821. END;
  11822. parameter := parameter.nextParameter;
  11823. END;
  11824. END;
  11825. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11826. WITH type: SyntaxTree.ArrayType DO
  11827. IF type.form= SyntaxTree.Static THEN
  11828. n := type.staticLength;
  11829. base := type.arrayBase.resolved;
  11830. WHILE(base IS SyntaxTree.ArrayType) DO
  11831. type := base(SyntaxTree.ArrayType);
  11832. n := n* type.staticLength;
  11833. base := type.arrayBase.resolved;
  11834. END;
  11835. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11836. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11837. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11838. FOR i := 0 TO n-1 DO
  11839. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11840. END;
  11841. END;
  11842. ELSE
  11843. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11844. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11845. END;
  11846. END;
  11847. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11848. WITH type: SyntaxTree.MathArrayType DO
  11849. IF type.form = SyntaxTree.Static THEN
  11850. n := type.staticLength;
  11851. base := type.arrayBase.resolved;
  11852. WHILE(base IS SyntaxTree.MathArrayType) DO
  11853. type := base(SyntaxTree.MathArrayType);
  11854. n := n* type.staticLength;
  11855. base := type.arrayBase.resolved;
  11856. END;
  11857. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11858. IF SemanticChecker.ContainsPointer(base) THEN
  11859. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11860. FOR i := 0 TO n-1 DO
  11861. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11862. END;
  11863. END;
  11864. ELSE
  11865. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11866. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11867. END
  11868. END;
  11869. (* ELSE no pointers in type *)
  11870. END;
  11871. END Pointers;
  11872. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11873. VAR position,i: LONGINT; ch: CHAR;
  11874. BEGIN
  11875. IF pool.Has(index) THEN
  11876. RETURN pool.GetInt(index)
  11877. ELSE
  11878. position := source.pc;
  11879. pool.PutInt(index, position);
  11880. Info(source, name);
  11881. i := 0;
  11882. REPEAT
  11883. ch := name[i]; INC(i);
  11884. Char( source, ch);
  11885. UNTIL ch = 0X;
  11886. END;
  11887. RETURN position;
  11888. END EnterDynamicName;
  11889. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11890. VAR name: Basic.SectionName; position: LONGINT;
  11891. BEGIN
  11892. IF pool.Has(index) THEN
  11893. RETURN pool.GetInt(index)
  11894. ELSE
  11895. StringPool.GetString(index, name);
  11896. position := EnterDynamicName(source,name,index, pool);
  11897. END;
  11898. RETURN position;
  11899. END DynamicName;
  11900. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11901. VAR section: IntermediateCode.Section;
  11902. BEGIN
  11903. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11904. IF implementationVisitor.backend.cooperative THEN
  11905. Info(section, "TypeDescriptor");
  11906. Basic.ToSegmentedName("BaseTypes.Array", name);
  11907. NamedSymbol(section, name,NIL, 0, 0);
  11908. BasePointer(section);
  11909. offset := 0;
  11910. ELSE
  11911. IF ProtectModulesPointers THEN
  11912. HeapBlock(mName,typeName,section,2);
  11913. END;
  11914. Info(section, "HeapBlock");
  11915. IF ProtectModulesPointers THEN
  11916. Symbol(section,section,2,0);
  11917. ELSE
  11918. Address(section,0);
  11919. END;
  11920. Info(section, "TypeDescriptor");
  11921. Address(section,0);
  11922. offset := section.pc;
  11923. END;
  11924. RETURN section
  11925. END NamedBlock;
  11926. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11927. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11928. BEGIN
  11929. COPY(moduleName,name);
  11930. Strings.Append(name,suffix);
  11931. Basic.ToSegmentedName(name, pooledName);
  11932. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11933. END Block;
  11934. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11935. VAR name: Basic.SegmentedName;
  11936. BEGIN
  11937. Info(source,"ArrayHeader");
  11938. IF implementationVisitor.backend.cooperative THEN
  11939. sizePC := source.pc;
  11940. Address(source,0);
  11941. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11942. IF baseType # "" THEN
  11943. Basic.ToSegmentedName(baseType, name);
  11944. NamedSymbol(source, name,NIL, 0, 0);
  11945. ELSE
  11946. Address(source,0);
  11947. END;
  11948. Address(source,0);
  11949. ELSE
  11950. Address(source,0);
  11951. Address(source,0);
  11952. (* first pointer for GC *)
  11953. IF hasPointer THEN
  11954. (* points to first element in the array, this is NOT the base type descriptor *)
  11955. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11956. ELSE
  11957. Address(source,0);
  11958. END;
  11959. sizePC := source.pc;
  11960. Address(source,0);
  11961. Info(source,"array data");
  11962. END;
  11963. END ArrayBlock;
  11964. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11965. BEGIN
  11966. IF implementationVisitor.backend.cooperative THEN
  11967. PatchSize(section, pc, size);
  11968. PatchSize(section, pc + 3, size);
  11969. ELSE
  11970. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11971. PatchSize(section, pc, size);
  11972. END;
  11973. END PatchArray;
  11974. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11975. VAR
  11976. i: LONGINT; section: Sections.Section; fingerprinter : Fingerprinter.Fingerprinter;
  11977. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11978. poolMap: Basic.HashTableInt;
  11979. namePool: IntermediateCode.Section;
  11980. namePoolOffset: LONGINT;
  11981. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11982. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11983. BEGIN
  11984. Basic.SegmentedNameToString(s1.name,n1);
  11985. Basic.SegmentedNameToString(s2.name,n2);
  11986. index := 0;
  11987. ch1 := n1[index];
  11988. ch2 := n2[index];
  11989. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11990. INC(index);
  11991. ch1 := n1[index];
  11992. ch2 := n2[index];
  11993. END;
  11994. RETURN ch1 < ch2;
  11995. END Compare;
  11996. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11997. VAR
  11998. i, j: LONGINT;
  11999. x, t: Sections.Section;
  12000. BEGIN
  12001. IF lo < hi THEN
  12002. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  12003. WHILE i <= j DO
  12004. WHILE Compare(list[i], x) DO INC(i) END;
  12005. WHILE Compare(x, list[j]) DO DEC(j) END;
  12006. IF i <= j THEN
  12007. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  12008. INC(i); DEC(j)
  12009. END
  12010. END;
  12011. IF lo < j THEN QuickSort(list, lo, j) END;
  12012. IF i < hi THEN QuickSort(list, i, hi) END
  12013. END;
  12014. END QuickSort;
  12015. (*
  12016. ExportDesc* = RECORD
  12017. fp*: HUGEINT;
  12018. name* {UNTRACED}: DynamicName;
  12019. adr*: ADDRESS;
  12020. exports*: LONGINT;
  12021. dsc* {UNTRACED}: ExportArray
  12022. END;
  12023. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  12024. *)
  12025. PROCEDURE ExportDesc2(
  12026. source: IntermediateCode.Section;
  12027. namePool: IntermediateCode.Section;
  12028. fingerprinter: Fingerprinter.Fingerprinter;
  12029. symbol: Sections.Section;
  12030. name: StringPool.Index;
  12031. VAR patchAdr: LONGINT
  12032. ): BOOLEAN;
  12033. VAR fingerprint: SyntaxTree.Fingerprint;
  12034. BEGIN
  12035. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  12036. & (symbol.type # Sections.InlineCodeSection)
  12037. THEN
  12038. *)
  12039. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  12040. & (symbol.type # Sections.ExitCodeSection)
  12041. & (symbol.type # Sections.InlineCodeSection))
  12042. THEN
  12043. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  12044. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  12045. fingerprint := fingerprinter.SymbolFP(symbol.symbol);
  12046. Hugeint(source,fingerprint.public);
  12047. ELSE
  12048. Hugeint(source, 0);
  12049. END;
  12050. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  12051. Symbol(source, symbol,0,0);
  12052. patchAdr := source.pc;
  12053. Longint(source, 0);
  12054. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12055. Address(source,0);
  12056. END;
  12057. RETURN TRUE
  12058. ELSE
  12059. RETURN FALSE
  12060. END;
  12061. END ExportDesc2;
  12062. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  12063. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  12064. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  12065. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  12066. nextPatch: LONGINT;
  12067. TYPE
  12068. Scope = RECORD
  12069. elements: LONGINT;
  12070. gelements: LONGINT;
  12071. section: IntermediateCode.Section;
  12072. patchAdr: LONGINT;
  12073. arraySizePC: LONGINT;
  12074. beginPC: LONGINT; (* current scope start pc *)
  12075. END;
  12076. BEGIN
  12077. Basic.InitSegmentedName(prev);
  12078. olevel := -1;
  12079. scopes[0].section := source;
  12080. scopes[0].arraySizePC := MIN(LONGINT);
  12081. FOR s := 0 TO LEN(sections)-1 DO
  12082. symbol := sections[s];
  12083. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  12084. this := sections[s].name;
  12085. level := 0;
  12086. WHILE (level < LEN(this)) & (this[level] > 0) DO
  12087. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  12088. INC(level);
  12089. END;
  12090. WHILE level < olevel DO
  12091. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12092. IF olevel > 0 THEN
  12093. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12094. nextPatch := scopes[olevel-1].patchAdr+1;
  12095. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12096. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12097. END;
  12098. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12099. DEC(olevel);
  12100. END;
  12101. IF (level < LEN(this)) & (this[level] > 0) THEN
  12102. IF level > olevel THEN
  12103. (*TRACE("opening",level); *)
  12104. IF scopes[level].section = NIL THEN
  12105. arrayName := ".@ExportArray";
  12106. Strings.AppendInt(arrayName, level);
  12107. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  12108. AddPointer(scopes[level].section,offset);
  12109. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  12110. END;
  12111. scopes[level].beginPC := scopes[level].section.pc;
  12112. olevel := level;
  12113. scopes[olevel].elements := 0;
  12114. END;
  12115. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12116. sym := sections[s];
  12117. ELSE
  12118. sym := NIL;
  12119. END;
  12120. IF ExportDesc2(scopes[level].section, namePool, fingerprinter, sym, this[level], scopes[level].patchAdr)
  12121. THEN
  12122. INC(scopes[olevel].elements);
  12123. END;
  12124. (* enter string in scope *)
  12125. INC(level);
  12126. END;
  12127. END;
  12128. Basic.SegmentedNameToString(this, name);
  12129. prev := this;
  12130. END;
  12131. END;
  12132. WHILE 0 <= olevel DO
  12133. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12134. IF olevel > 0 THEN
  12135. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12136. nextPatch := scopes[olevel-1].patchAdr+1;
  12137. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12138. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12139. END;
  12140. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12141. DEC(olevel);
  12142. END;
  12143. level := 0;
  12144. WHILE (level < LEN(scopes)) DO
  12145. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12146. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12147. END;
  12148. INC(level);
  12149. END;
  12150. END Export;
  12151. BEGIN
  12152. NEW(fingerprinter);
  12153. NEW(poolMap, 64);
  12154. (* 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 *)
  12155. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12156. NEW(sectionArray, module.allSections.Length());
  12157. FOR i := 0 TO module.allSections.Length() - 1 DO
  12158. section := module.allSections.GetSection(i);
  12159. sectionArray[i] := section;
  12160. END;
  12161. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12162. Export(sectionArray^);
  12163. END ExportDesc;
  12164. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12165. VAR
  12166. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12167. BEGIN
  12168. Info(source, "exception table offsets array descriptor");
  12169. size := 0;
  12170. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12171. Info(source, "exception table content");
  12172. FOR i := 0 TO module.allSections.Length() - 1 DO
  12173. p := module.allSections.GetSection(i);
  12174. IF p.type = Sections.CodeSection THEN
  12175. finallyPC := p(IntermediateCode.Section).finally;
  12176. IF finallyPC>=0 THEN
  12177. Symbol( source, p, 0,0);
  12178. Symbol( source, p, finallyPC, 0);
  12179. Symbol( source, p, finallyPC,0);
  12180. INC(size);
  12181. END;
  12182. END
  12183. END;
  12184. PatchArray(source,sizePC,size);
  12185. END ExceptionArray;
  12186. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12187. VAR i: LONGINT; ch: CHAR;
  12188. BEGIN
  12189. i := 0;
  12190. REPEAT
  12191. ch := name[i]; INC(i);
  12192. Char( section, ch);
  12193. UNTIL ch = 0X;
  12194. WHILE i < 32 DO
  12195. Char( section, 0X); INC(i);
  12196. END;
  12197. END Name;
  12198. PROCEDURE References(section: IntermediateCode.Section);
  12199. CONST
  12200. sfTypeNone = 0X;
  12201. sfTypeCHAR = 01X;
  12202. sfTypeCHAR8 = 02X;
  12203. sfTypeCHAR16 = 03X;
  12204. sfTypeCHAR32 = 04X;
  12205. sfTypeRANGE = 05X;
  12206. sfTypeSHORTINT = 06X;
  12207. sfTypeINTEGER = 07X;
  12208. sfTypeLONGINT = 08X;
  12209. sfTypeHUGEINT = 09X;
  12210. sfTypeWORD = 0AX;
  12211. sfTypeLONGWORD = 0BX;
  12212. sfTypeSIGNED8 = 0CX;
  12213. sfTypeSIGNED16 = 0DX;
  12214. sfTypeSIGNED32 = 0EX;
  12215. sfTypeSIGNED64 = 0FX;
  12216. sfTypeUNSIGNED8 = 10X;
  12217. sfTypeUNSIGNED16 = 11X;
  12218. sfTypeUNSIGNED32 = 12X;
  12219. sfTypeUNSIGNED64 = 13X;
  12220. sfTypeREAL = 14X;
  12221. sfTypeLONGREAL = 15X;
  12222. sfTypeCOMPLEX = 16X;
  12223. sfTypeLONGCOMPLEX = 17X;
  12224. sfTypeBOOLEAN = 18X;
  12225. sfTypeSET = 19X;
  12226. sfTypeANY = 1AX;
  12227. sfTypeOBJECT = 1BX;
  12228. sfTypeBYTE = 1CX;
  12229. sfTypeADDRESS = 1DX;
  12230. sfTypeSIZE = 1EX;
  12231. sfTypeIndirect = 1FX;
  12232. sfTypeRecord = 20X;
  12233. sfTypePointerToRecord = 21X;
  12234. sfTypePointerToArray = 22X;
  12235. sfTypeOpenArray = 23X;
  12236. sfTypeStaticArray = 24X;
  12237. sfTypeDynamicArray = 25X;
  12238. sfTypeMathStaticArray = 26X;
  12239. sfTypeMathOpenArray = 27X;
  12240. sfTypeMathTensor = 28X;
  12241. sfTypeProcedure = 29X;
  12242. sfTypeDelegate = 2AX;
  12243. sfTypeENUM = 2BX;
  12244. (* sfTypeCELL = 2CX; *)
  12245. sfTypePORT = 2DX;
  12246. sfIN = 0X;
  12247. sfOUT = 1X;
  12248. flagDelegate = 0;
  12249. flagConstructor = 1;
  12250. (* variable / parameter addressing modes *)
  12251. sfAbsolute = 0X; (* global vars *)
  12252. sfRelative = 1X; (* variables, value parameters *)
  12253. sfIndirect = 2X; (* var parameters *)
  12254. sfScopeBegin = 0F0X;
  12255. sfScopeEnd = 0F1X;
  12256. sfProcedure = 0F2X;
  12257. sfVariable = 0F3X;
  12258. sfTypeDeclaration = 0F4X;
  12259. sfModule = 0FFX;
  12260. RefInfo = TRUE;
  12261. VAR
  12262. sizePC, startPC, lastOffset: LONGINT;
  12263. indirectTypes: Basic.HashTable;
  12264. PROCEDURE CurrentIndex(): LONGINT;
  12265. VAR i: LONGINT;
  12266. BEGIN
  12267. FOR i := startPC TO section.pc -1 DO
  12268. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12269. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12270. END;
  12271. startPC := section.pc;
  12272. RETURN lastOffset;
  12273. END CurrentIndex;
  12274. (*
  12275. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12276. Module = sfModule prevSymbol:SIZE name:String Scope.
  12277. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12278. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12279. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12280. Type =
  12281. sfTypePointerToRecord
  12282. | sfTypePointerToArray Type
  12283. | sfTypeOpenArray Type
  12284. | sfTypeDynamicArray Type
  12285. | sfTypeStaticArray length:SIZE Type
  12286. | sfTypeMathOpenArray Type
  12287. | sfTypeMathStaticArray length:SIZE Type
  12288. | sfTypeMathTensor Type
  12289. | sfTypeRecord tdAdr:ADDRESS
  12290. | sfTypeProcedure {Parameter} return:Type
  12291. | sfTypeDelegate {Parameter} return:Type
  12292. | sfTypePort (sfIN | sfOUT)
  12293. | sfTypeBOOLEAN
  12294. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12295. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12296. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12297. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12298. | sfTypeWORD | sfTypeLONGWORD
  12299. | sfTypeREAL | sfTypeLONGREAL
  12300. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12301. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12302. | sfTypeIndirect offset:SIZE.
  12303. *)
  12304. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12305. VAR offset: SIZE;
  12306. BEGIN
  12307. IF indirectTypes.Has(type) THEN
  12308. offset := indirectTypes.GetInt(type);
  12309. Char(section, sfTypeIndirect);
  12310. Size(section, offset);
  12311. RETURN TRUE;
  12312. ELSE
  12313. indirectTypes.PutInt(type, CurrentIndex());
  12314. RETURN FALSE;
  12315. END;
  12316. END Indirect;
  12317. PROCEDURE NType(type: SyntaxTree.Type);
  12318. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12319. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12320. BEGIN
  12321. IF type = NIL THEN
  12322. Char(section, sfTypeNone)
  12323. ELSE
  12324. type := type.resolved;
  12325. size := type.sizeInBits;
  12326. WITH type:
  12327. SyntaxTree.PointerType DO
  12328. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12329. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12330. Char(section, sfTypePointerToRecord);
  12331. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12332. ELSE
  12333. IF RefInfo THEN Info(section,"PointerToArray") END;
  12334. Char(section, sfTypePointerToArray);
  12335. NType(type.pointerBase);
  12336. END;
  12337. | SyntaxTree.ArrayType DO
  12338. IF ~Indirect(type) THEN
  12339. IF type.form = SyntaxTree.Open THEN
  12340. IF RefInfo THEN Info(section,"OpenArray") END;
  12341. Char(section, sfTypeOpenArray);
  12342. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12343. IF RefInfo THEN Info(section,"DynamicArray") END;
  12344. Char(section, sfTypeDynamicArray);
  12345. ELSIF type.form = SyntaxTree.Static THEN
  12346. IF RefInfo THEN Info(section,"StaticArray") END;
  12347. Char(section, sfTypeStaticArray);
  12348. Size(section, type.staticLength);
  12349. ELSE
  12350. HALT(100);
  12351. END;
  12352. NType(type.arrayBase);
  12353. END;
  12354. | SyntaxTree.MathArrayType DO
  12355. IF ~Indirect(type) THEN
  12356. IF type.form = SyntaxTree.Open THEN
  12357. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12358. Char(section, sfTypeMathOpenArray);
  12359. ELSIF type.form = SyntaxTree.Static THEN
  12360. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12361. Char(section, sfTypeMathStaticArray);
  12362. Size(section, type.staticLength);
  12363. ELSIF type.form = SyntaxTree.Tensor THEN
  12364. IF RefInfo THEN Info(section,"MathTensor") END;
  12365. Char(section, sfTypeMathTensor);
  12366. ELSE
  12367. HALT(100);
  12368. END;
  12369. NType(type.arrayBase);
  12370. END;
  12371. | SyntaxTree.RecordType DO
  12372. IF ~Indirect(type) THEN
  12373. IF type.pointerType # NIL (* OBJECT *) THEN
  12374. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12375. Char(section, sfTypePointerToRecord)
  12376. ELSE
  12377. IF RefInfo THEN Info(section,"Record") END;
  12378. Char(section, sfTypeRecord);
  12379. td := type.typeDeclaration;
  12380. IF RefInfo THEN Info(section,"TD") END;
  12381. IF (td # NIL) THEN
  12382. Global.GetSymbolSegmentedName(td,segmentedName);
  12383. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12384. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12385. ELSE
  12386. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12387. END;
  12388. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12389. Symbol(section, tir, 0, offset);
  12390. ELSE
  12391. Address(section, 0);
  12392. END;
  12393. END;
  12394. END;
  12395. | SyntaxTree.CellType DO
  12396. IF ~Indirect(type) THEN
  12397. IF RefInfo THEN Info(section,"Record") END;
  12398. Char(section, sfTypeRecord);
  12399. td := type.typeDeclaration;
  12400. IF RefInfo THEN Info(section,"TD") END;
  12401. IF (td # NIL) THEN
  12402. Global.GetSymbolSegmentedName(td,segmentedName);
  12403. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12404. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12405. ELSE
  12406. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12407. END;
  12408. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12409. Symbol(section, tir, 0, offset);
  12410. ELSE
  12411. Address(section, 0);
  12412. END;
  12413. END;
  12414. | SyntaxTree.PortType DO
  12415. Char(section, sfTypePORT);
  12416. IF type.direction = SyntaxTree.OutPort THEN
  12417. Char(section, sfOUT)
  12418. ELSE
  12419. Char(section, sfIN)
  12420. END;
  12421. | SyntaxTree.ProcedureType DO
  12422. IF ~Indirect(type) THEN
  12423. IF type.isDelegate THEN
  12424. Char(section, sfTypeDelegate);
  12425. ELSE
  12426. Char(section, sfTypeProcedure);
  12427. END;
  12428. parameter := type.firstParameter;
  12429. WHILE(parameter # NIL) DO
  12430. NParameter(parameter, -1);
  12431. parameter := parameter.nextParameter;
  12432. END;
  12433. NType(type.returnType);
  12434. END;
  12435. | SyntaxTree.EnumerationType DO
  12436. Char(section, sfTypeENUM);
  12437. | SyntaxTree.BasicType DO
  12438. WITH type:
  12439. SyntaxTree.BooleanType DO
  12440. IF RefInfo THEN Info(section,"Boolean") END;
  12441. Char(section, sfTypeBOOLEAN);
  12442. | SyntaxTree.CharacterType DO
  12443. IF type = module.system.characterType THEN
  12444. IF RefInfo THEN Info(section,"CHAR") END;
  12445. Char(section, sfTypeCHAR);
  12446. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12447. IF RefInfo THEN Info(section,"CHAR8") END;
  12448. Char(section, sfTypeCHAR8)
  12449. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12450. IF RefInfo THEN Info(section,"CHAR16") END;
  12451. Char(section, sfTypeCHAR16);
  12452. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12453. IF RefInfo THEN Info(section,"CHAR32") END;
  12454. Char(section, sfTypeCHAR32);
  12455. ELSE
  12456. HALT(100);
  12457. END;
  12458. |SyntaxTree.IntegerType DO
  12459. IF type(SyntaxTree.IntegerType).signed THEN
  12460. IF (type = module.system.shortintType) THEN
  12461. IF RefInfo THEN Info(section,"SHORTINT") END;
  12462. Char(section, sfTypeSHORTINT)
  12463. ELSIF (type = module.system.integerType) THEN
  12464. IF RefInfo THEN Info(section,"INTEGER") END;
  12465. Char(section, sfTypeINTEGER)
  12466. ELSIF (type = module.system.longintType) THEN
  12467. IF RefInfo THEN Info(section,"LONGINT") END;
  12468. Char(section, sfTypeLONGINT)
  12469. ELSIF (type = module.system.hugeintType) THEN
  12470. IF RefInfo THEN Info(section,"HUGEINT") END;
  12471. Char(section, sfTypeHUGEINT)
  12472. ELSIF (type = module.system.wordType) THEN
  12473. IF RefInfo THEN Info(section,"WORD") END;
  12474. Char(section, sfTypeWORD)
  12475. ELSIF (type = module.system.longWordType) THEN
  12476. IF RefInfo THEN Info(section,"LONGWORD") END;
  12477. Char(section, sfTypeLONGWORD);
  12478. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12479. IF RefInfo THEN Info(section,"SIGNED8") END;
  12480. Char(section, sfTypeSIGNED8)
  12481. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12482. IF RefInfo THEN Info(section,"SIGNED16") END;
  12483. Char(section, sfTypeSIGNED16)
  12484. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12485. IF RefInfo THEN Info(section,"SIGNED32") END;
  12486. Char(section, sfTypeSIGNED32)
  12487. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12488. IF RefInfo THEN Info(section,"SIGNED64") END;
  12489. Char(section, sfTypeSIGNED64)
  12490. ELSE
  12491. HALT(100);
  12492. END
  12493. ELSE (* unsigned *)
  12494. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12495. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12496. Char(section, sfTypeUNSIGNED8)
  12497. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12498. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12499. Char(section, sfTypeUNSIGNED16)
  12500. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12501. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12502. Char(section, sfTypeUNSIGNED32)
  12503. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12504. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12505. Char(section, sfTypeUNSIGNED64)
  12506. ELSE
  12507. HALT(100)
  12508. END
  12509. END;
  12510. | SyntaxTree.FloatType DO
  12511. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12512. IF RefInfo THEN Info(section,"REAL") END;
  12513. Char(section, sfTypeREAL);
  12514. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12515. IF RefInfo THEN Info(section,"LONGREAL") END;
  12516. Char(section, sfTypeLONGREAL);
  12517. ELSE
  12518. HALT(100);
  12519. END;
  12520. | SyntaxTree.ComplexType DO
  12521. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12522. IF RefInfo THEN Info(section,"COMPLEX") END;
  12523. Char(section, sfTypeCOMPLEX);
  12524. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12525. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12526. Char(section, sfTypeLONGCOMPLEX);
  12527. ELSE
  12528. HALT(100);
  12529. END;
  12530. |SyntaxTree.SetType DO
  12531. IF RefInfo THEN Info(section,"SET") END;
  12532. Char(section, sfTypeSET);
  12533. |SyntaxTree.AnyType DO
  12534. IF RefInfo THEN Info(section,"ANY") END;
  12535. Char(section, sfTypeANY);
  12536. |SyntaxTree.ObjectType DO
  12537. IF RefInfo THEN Info(section,"OBJECT") END;
  12538. Char(section, sfTypeOBJECT);
  12539. |SyntaxTree.ByteType DO
  12540. IF RefInfo THEN Info(section,"BYTE") END;
  12541. Char(section, sfTypeBYTE);
  12542. |SyntaxTree.RangeType DO
  12543. IF RefInfo THEN Info(section,"RANGE") END;
  12544. Char(section, sfTypeRANGE)
  12545. |SyntaxTree.AddressType DO
  12546. IF RefInfo THEN Info(section,"ADDRESS") END;
  12547. Char(section, sfTypeADDRESS)
  12548. |SyntaxTree.SizeType DO
  12549. IF RefInfo THEN Info(section,"SIZE") END;
  12550. Char(section, sfTypeSIZE)
  12551. ELSE
  12552. HALT(100)
  12553. END;
  12554. ELSE HALT(101);
  12555. END;
  12556. END;
  12557. END NType;
  12558. (*
  12559. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12560. *)
  12561. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12562. VAR type: SyntaxTree.Type;
  12563. BEGIN
  12564. IF RefInfo THEN Info(section, "Parameter") END;
  12565. Char(section, sfVariable);
  12566. Size(section, procOffset);
  12567. String0(section, parameter.name);
  12568. type := parameter.type.resolved;
  12569. IF parameter.kind = SyntaxTree.VarParameter THEN
  12570. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12571. ELSE Char(section, sfIndirect)
  12572. END;
  12573. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12574. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12575. Char(section, sfIndirect);
  12576. ELSE
  12577. Char(section, sfRelative);
  12578. END;
  12579. ELSE
  12580. Char(section, sfRelative);
  12581. END;
  12582. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12583. NType(parameter.type);
  12584. END NParameter;
  12585. (*
  12586. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12587. *)
  12588. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12589. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12590. flags: SET;
  12591. BEGIN
  12592. IF procedure.externalName # NIL THEN RETURN END;
  12593. IF RefInfo THEN Info(section, "Procedure") END;
  12594. pos := CurrentIndex();
  12595. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12596. Char(section, sfProcedure);
  12597. Size(section, scopeOffset);
  12598. String0(section,procedure.name);
  12599. s := module.allSections.FindBySymbol(procedure);
  12600. Symbol(section,s,0,0); (* start *)
  12601. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12602. flags := {};
  12603. IF procedureType.isDelegate THEN
  12604. INCL(flags, flagDelegate);
  12605. END;
  12606. IF procedure.isConstructor THEN
  12607. INCL(flags, flagConstructor);
  12608. END;
  12609. Set(section, flags);
  12610. IF RefInfo THEN Info(section, "Parameters") END;
  12611. parameter := procedureType.firstParameter;
  12612. WHILE(parameter # NIL) DO
  12613. NParameter(parameter, pos);
  12614. parameter := parameter.nextParameter;
  12615. END;
  12616. IF procedureType.returnParameter # NIL THEN
  12617. NParameter(procedureType.returnParameter, pos);
  12618. END;
  12619. IF procedureType.selfParameter # NIL THEN
  12620. NParameter(procedureType.selfParameter, pos);
  12621. END;
  12622. IF RefInfo THEN Info(section, "ReturnType") END;
  12623. NType(procedureType.returnType);
  12624. NScope(procedure.procedureScope, pos);
  12625. END NProcedure;
  12626. (*
  12627. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12628. *)
  12629. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12630. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12631. BEGIN
  12632. IF RefInfo THEN Info(section, "Variable") END;
  12633. pos := CurrentIndex();
  12634. Char(section, sfVariable);
  12635. Size(section, scopeOffset);
  12636. String0(section, variable.name);
  12637. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12638. Char(section, sfAbsolute);
  12639. IF variable.externalName # NIL THEN
  12640. sn := variable.externalName^;
  12641. NamedSymbol(section, sn,NIL, 0,0);
  12642. ELSE
  12643. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12644. NamedSymbol(section, sn,variable, 0,0);
  12645. END;
  12646. ELSE
  12647. Char(section, sfRelative);
  12648. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12649. END;
  12650. NType(variable.type);
  12651. s := module.allSections.FindBySymbol(variable);
  12652. END NVariable;
  12653. (*
  12654. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12655. *)
  12656. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12657. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12658. BEGIN
  12659. IF typeDeclaration = NIL THEN RETURN END;
  12660. pos := CurrentIndex();
  12661. s := module.allSections.FindBySymbol(typeDeclaration);
  12662. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12663. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12664. Char(section, sfTypeDeclaration);
  12665. Size(section, scopeOffset);
  12666. String0(section, typeDeclaration.name);
  12667. declared := typeDeclaration.declaredType.resolved;
  12668. IF (declared IS SyntaxTree.PointerType) THEN
  12669. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12670. END;
  12671. WITH declared:
  12672. SyntaxTree.RecordType DO
  12673. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12674. Symbol(section, s, 0, offset);
  12675. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12676. Basic.AppendToSegmentedName(name,".@Info");
  12677. s := module.allSections.FindByName(name);
  12678. IF s # NIL THEN (* does not work for coop *)
  12679. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12680. END;
  12681. NScope(declared.recordScope, pos);
  12682. |SyntaxTree.CellType DO
  12683. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12684. Symbol(section, s, 0, offset);
  12685. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12686. Basic.AppendToSegmentedName(name,".@Info");
  12687. s := module.allSections.FindByName(name);
  12688. IF s # NIL THEN
  12689. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12690. END;
  12691. NScope(declared.cellScope, pos);
  12692. ELSE
  12693. Address(section, 0);
  12694. END;
  12695. END NTypeDeclaration;
  12696. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12697. VAR pos: LONGINT;
  12698. BEGIN
  12699. pos := CurrentIndex();
  12700. Char(section,sfModule);
  12701. Size(section, prevSymbol);
  12702. String0(section, module.name);
  12703. NScope(module.moduleScope, pos);
  12704. END NModule;
  12705. (*
  12706. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12707. *)
  12708. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12709. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12710. BEGIN
  12711. IF scope = NIL THEN RETURN END;
  12712. IF RefInfo THEN Info(section, "Scope") END;
  12713. Char(section, sfScopeBegin);
  12714. variable := scope.firstVariable;
  12715. WHILE (variable # NIL) DO
  12716. NVariable(variable, prevSymbol);
  12717. variable := variable.nextVariable;
  12718. END;
  12719. WITH scope:
  12720. SyntaxTree.ModuleScope DO
  12721. bodyProcedure := scope.bodyProcedure;
  12722. |SyntaxTree.RecordScope DO
  12723. bodyProcedure := scope.bodyProcedure;
  12724. ELSE
  12725. bodyProcedure := NIL;
  12726. END;
  12727. IF bodyProcedure # NIL THEN
  12728. NProcedure(bodyProcedure, prevSymbol)
  12729. END;
  12730. procedure := scope.firstProcedure;
  12731. WHILE procedure # NIL DO
  12732. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12733. procedure := procedure.nextProcedure;
  12734. END;
  12735. typeDeclaration := scope.firstTypeDeclaration;
  12736. WHILE typeDeclaration # NIL DO
  12737. NTypeDeclaration(typeDeclaration, prevSymbol);
  12738. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12739. END;
  12740. Char(section, sfScopeEnd); (* scope ends *)
  12741. END NScope;
  12742. BEGIN
  12743. NEW(indirectTypes, 32);
  12744. ArrayBlock(section,sizePC,"", FALSE);
  12745. startPC := section.pc;
  12746. NModule(module.module, -1);
  12747. PatchArray(section,sizePC,CurrentIndex());
  12748. END References;
  12749. (*
  12750. Command* = RECORD
  12751. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12752. name*: Name; (* name of the procedure *)
  12753. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12754. entryAdr* : ADDRESS; (* entry address of procedure *)
  12755. END;
  12756. *)
  12757. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12758. VAR
  12759. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12760. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12761. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12762. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12763. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12764. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12765. BEGIN
  12766. RETURN
  12767. (type = NIL) OR
  12768. (type.resolved IS SyntaxTree.RecordType) OR
  12769. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12770. (type.resolved IS SyntaxTree.AnyType);
  12771. END TypeAllowed;
  12772. BEGIN
  12773. numberParameters := procedureType.numberParameters;
  12774. RETURN
  12775. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12776. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12777. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12778. END GetProcedureAllowed;
  12779. PROCEDURE WriteType(type : SyntaxTree.Type);
  12780. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12781. name: Basic.SegmentedName; offset: LONGINT;
  12782. BEGIN
  12783. IF type = NIL THEN
  12784. Address(source,0);
  12785. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12786. Address(source,1);
  12787. ELSE
  12788. type := type.resolved;
  12789. IF type IS SyntaxTree.PointerType THEN
  12790. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12791. END;
  12792. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12793. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12794. name[0] := typeDeclaration.name; name[1] := -1;
  12795. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12796. ASSERT(section # NIL);
  12797. ELSE
  12798. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12799. (* TODO *)
  12800. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12801. END;
  12802. IF implementationVisitor.backend.cooperative THEN
  12803. offset := 0;
  12804. ELSE
  12805. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12806. END;
  12807. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12808. END;
  12809. END WriteType;
  12810. BEGIN
  12811. Info(source, "command array descriptor");
  12812. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12813. numberCommands := 0;
  12814. Info(source, "command array content");
  12815. FOR i := 0 TO module.allSections.Length() - 1 DO
  12816. p := module.allSections.GetSection(i);
  12817. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12818. procedure := p.symbol(SyntaxTree.Procedure);
  12819. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12820. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12821. procedure.GetName(name);
  12822. Name(source,name);
  12823. numberParameters := procedureType.numberParameters;
  12824. (* offset of type of first parameter *)
  12825. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12826. ELSE WriteType(procedureType.firstParameter.type)
  12827. END;
  12828. (* offset of type of return parameter *)
  12829. WriteType(procedureType.returnType);
  12830. (* command name *)
  12831. (* command code offset *)
  12832. Symbol(source,p,0,0);
  12833. INC(numberCommands);
  12834. IF Trace THEN
  12835. D.Ln;
  12836. END;
  12837. END;
  12838. END
  12839. END;
  12840. PatchArray(source,sizePC,numberCommands);
  12841. END CommandArray;
  12842. (* to prevent from double import of different module aliases *)
  12843. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12844. VAR i: SyntaxTree.Import;
  12845. BEGIN
  12846. i := module.module.moduleScope.firstImport;
  12847. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12848. i := i.nextImport;
  12849. END;
  12850. RETURN i = import
  12851. END IsFirstDirectOccurence;
  12852. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12853. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12854. BEGIN
  12855. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12856. ArrayBlock(source,pc,"", FALSE);
  12857. Info(source, "import module array data");
  12858. IF implementationVisitor.backend.cooperative THEN
  12859. offset := 0;
  12860. ELSE
  12861. IF module.system.addressType.sizeInBits = 64 THEN
  12862. (* change this when Heaps.HeapBlock is modified *)
  12863. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12864. ELSE
  12865. (* change this when Heaps.HeapBlock is modified *)
  12866. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12867. END;
  12868. END;
  12869. import := module.module.moduleScope.firstImport;
  12870. numberImports := 0;
  12871. WHILE import # NIL DO
  12872. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12873. Global.GetModuleSegmentedName(import.module,name);
  12874. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12875. NamedSymbol(source, name, NIL, 0, offset);
  12876. INC(numberImports);
  12877. END;
  12878. import := import.nextImport
  12879. END;
  12880. PatchArray(source,pc,numberImports);
  12881. END ImportsArray;
  12882. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12883. VAR
  12884. p: Sections.Section; sizePC, size, i: LONGINT;
  12885. BEGIN
  12886. Info(source, "Type info section");
  12887. size := 0;
  12888. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12889. FOR i := 0 TO module.allSections.Length() - 1 DO
  12890. p := module.allSections.GetSection(i);
  12891. WITH p: IntermediateCode.Section DO
  12892. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12893. Symbol(source,p,EmptyBlockOffset,0);
  12894. INC(size);
  12895. END;
  12896. END
  12897. END;
  12898. PatchArray(source,sizePC,size);
  12899. END TypeInfoSection;
  12900. (*
  12901. ProcTableEntry* = RECORD
  12902. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12903. noPtr*: LONGINT;
  12904. END;
  12905. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12906. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12907. *)
  12908. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12909. VAR
  12910. numberPointers: LONGINT;
  12911. procedure: SyntaxTree.Procedure;
  12912. BEGIN
  12913. Info(section,"pcFrom");
  12914. Symbol(section,procedureSection,0,0);
  12915. Info(section,"pcTo");
  12916. Symbol(section, procedureSection, procedureSection.pc, 0);
  12917. Info(section,"pointer to offsets array");
  12918. Symbol(section, section,section.pc+1,0);
  12919. Info(section,"offsets array");
  12920. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12921. PointerArray(section, procedure.procedureScope, numberPointers);
  12922. END ProcedureDescriptor;
  12923. (* only for tracing, the descriptor is otherwise not complete ! *)
  12924. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12925. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12926. BEGIN
  12927. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12928. name := procedureSection.name;
  12929. Basic.AppendToSegmentedName(name,".@Info");
  12930. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12931. Address(section,0);
  12932. Symbol(section,section,2,0);
  12933. (*
  12934. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12935. descSize: SIZE;
  12936. sentinel: ADDRESS; (* = MPO-4 *)
  12937. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12938. flags*: SET;
  12939. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12940. name*: Name;
  12941. END;
  12942. *)
  12943. Size(section, 0);
  12944. Address(section,0);
  12945. Address(section,0);
  12946. Set(section,{});
  12947. moduleSection := ModuleSection();
  12948. Symbol( section, moduleSection, moduleSection.pc,0);
  12949. IF procedureSection.symbol = NIL THEN
  12950. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12951. ELSE
  12952. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12953. END;
  12954. Name(section, infoName);
  12955. Size(section, 0);
  12956. RETURN section;
  12957. END MakeProcedureDescriptorTag;
  12958. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12959. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12960. BEGIN
  12961. name := procedureSection.name;
  12962. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12963. IF implementationVisitor.backend.cooperative THEN
  12964. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12965. Info(section, "TypeDescriptor");
  12966. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12967. NamedSymbol(dest, name,NIL, 0, 0);
  12968. BaseRecord(dest);
  12969. offset := 0;
  12970. ELSIF CreateProcedureDescInfo THEN
  12971. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12972. Address(dest,0);
  12973. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12974. offset := dest.pc;
  12975. ELSE
  12976. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12977. END;
  12978. ProcedureDescriptor(dest, procedureSection);
  12979. Symbol(section, dest, offset, 0);
  12980. END ProcedureDescriptorPointer;
  12981. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12982. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12983. BEGIN
  12984. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12985. numberProcs := 0;
  12986. FOR i := 0 TO module.allSections.Length() - 1 DO
  12987. destination := module.allSections.GetSection(i);
  12988. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12989. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12990. INC(numberProcs);
  12991. END
  12992. END;
  12993. PatchArray(section, sizePC, numberProcs);
  12994. END ProcedureDescriptorArray;
  12995. (*
  12996. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12997. VAR
  12998. next*: Module; (** once a module is published, all fields are read-only *)
  12999. name*: Name;
  13000. init, published: BOOLEAN;
  13001. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  13002. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  13003. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  13004. command*: POINTER TO ARRAY OF Command;
  13005. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  13006. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  13007. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  13008. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  13009. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  13010. data*, code*: Bytes;
  13011. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  13012. export*: ExportDesc;
  13013. term*: TerminationHandler;
  13014. exTable*: ExceptionTable;
  13015. noProcs*: LONGINT;
  13016. firstProc*: ADDRESS; <- done by loader
  13017. maxPtrs*: LONGINT;
  13018. crc*: LONGINT;
  13019. *)
  13020. PROCEDURE BasePointer (section: IntermediateCode.Section);
  13021. BEGIN
  13022. Info(section, "cycle");
  13023. Size(section,0);
  13024. Info(section, "references");
  13025. Size(section,0);
  13026. Info(section, "nextMarked");
  13027. Address(section,0);
  13028. Info(section, "nextWatched");
  13029. Address(section,0);
  13030. END BasePointer;
  13031. PROCEDURE BaseObject (section: IntermediateCode.Section);
  13032. BEGIN
  13033. BasePointer(section);
  13034. Info(section, "action");
  13035. Address(section,0);
  13036. Info(section, "monitor");
  13037. Address(section,0);
  13038. END BaseObject;
  13039. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  13040. BEGIN
  13041. BasePointer(section);
  13042. Info(section, "action");
  13043. Address(section,0);
  13044. Info(section, "monitor");
  13045. Address(section,0);
  13046. END BaseRecord;
  13047. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  13048. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  13049. pooledName: Basic.SegmentedName;
  13050. symbol: SyntaxTree.Symbol;
  13051. BEGIN
  13052. Global.GetModuleName(module.module,name);
  13053. Strings.Append(name,".@Module.@Descriptor");
  13054. Basic.ToSegmentedName(name, pooledName);
  13055. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  13056. Symbol(section,descriptorSection,0,0);
  13057. Info(descriptorSection, "descriptor");
  13058. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  13059. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  13060. Address(descriptorSection,0);
  13061. Global.GetModuleName(module.module,name);
  13062. Strings.Append(name,".@Trace");
  13063. Basic.ToSegmentedName(name, pooledName);
  13064. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  13065. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  13066. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  13067. END ModuleDescriptor;
  13068. PROCEDURE ModuleSection(): IntermediateCode.Section;
  13069. VAR name: ARRAY 128 OF CHAR;
  13070. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  13071. symbol: SyntaxTree.Symbol;
  13072. BEGIN
  13073. Global.GetModuleName(module.module,name);
  13074. Strings.Append(name,".@Module");
  13075. Basic.ToSegmentedName(name, pooledName);
  13076. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  13077. moduleSection.SetExported(TRUE);
  13078. IF moduleSection.pc = 0 THEN
  13079. IF implementationVisitor.backend.cooperative THEN
  13080. Info(moduleSection, "descriptor");
  13081. ModuleDescriptor(moduleSection);
  13082. BaseObject(moduleSection);
  13083. implementationVisitor.CreateTraceModuleMethod(module.module);
  13084. ELSE
  13085. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  13086. Info(moduleSection, "HeapBlock");
  13087. Symbol(moduleSection,moduleSection,2,0);
  13088. Info(moduleSection, "TypeDescriptor");
  13089. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  13090. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  13091. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  13092. END;
  13093. END;
  13094. RETURN moduleSection;
  13095. END ModuleSection;
  13096. PROCEDURE NewModuleInfo();
  13097. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13098. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13099. sectionName: Basic.SectionName;
  13100. CONST MPO=-40000000H;
  13101. BEGIN
  13102. (*
  13103. TypeDesc* = POINTER TO RECORD
  13104. descSize: SIZE;
  13105. sentinel: LONGINT; (* = MPO-4 *)
  13106. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13107. flags*: SET;
  13108. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13109. name*: Name;
  13110. refsOffset: SIZE;
  13111. END;
  13112. *)
  13113. (*name is missing prefixes sometimes*)
  13114. Global.GetModuleSegmentedName(module.module,name);
  13115. Basic.AppendToSegmentedName(name,".@Info");
  13116. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13117. IF ~implementationVisitor.backend.cooperative THEN
  13118. Info(source, "HeapBlock");
  13119. Address(source,0); (* an empty heap block prevents GC marking *)
  13120. Info(source, "TypeDescriptor");
  13121. Address(source,0);
  13122. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13123. END;
  13124. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13125. Address(source,MPO-4);
  13126. Info(source, "type tag pointer");
  13127. Address( source,0);
  13128. Info(source, "type flags");
  13129. flags := {};
  13130. Set( source, flags);
  13131. Info(source, "pointer to module");
  13132. moduleSection := ModuleSection();
  13133. Symbol( source, moduleSection, moduleSection.pc,0);
  13134. Info(source, "type name");
  13135. i := 0;
  13136. sectionName := "@Self";
  13137. (*
  13138. Global.GetSymbolSegmentedName(td,name);
  13139. Basic.SegmentedNameToString(name, sectionName);
  13140. *)
  13141. Name(source,sectionName);
  13142. patchInfoPC := source.pc;
  13143. Size(source, 0);
  13144. END NewModuleInfo;
  13145. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13146. VAR
  13147. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13148. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13149. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13150. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13151. referenceSectionOffset : LONGINT;
  13152. name: Basic.SegmentedName; offset: LONGINT;
  13153. flags: SET;
  13154. BEGIN
  13155. NewModuleInfo();
  13156. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13157. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13158. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13159. ImportsArray(importSection);
  13160. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13161. CommandArray(commandsSection);
  13162. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13163. ExceptionArray(exceptionSection);
  13164. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13165. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13166. TypeInfoSection(typeInfoSection);
  13167. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13168. referenceSection.SetExported(TRUE);
  13169. References(referenceSection);
  13170. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13171. ProcedureDescriptorArray(procTableSection, numberProcs);
  13172. IF ProtectModulesPointers THEN
  13173. name := "Heaps.AnyPtr";
  13174. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13175. (* set base pointer *)
  13176. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13177. END;
  13178. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13179. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13180. moduleSection := ModuleSection();
  13181. Info(moduleSection, "nextRoot*: RootObject");
  13182. Address(moduleSection,0);
  13183. Info(moduleSection, "next*: Module");
  13184. Address(moduleSection,0);
  13185. Info(moduleSection, "name*: Name");
  13186. Name(moduleSection,moduleName);
  13187. Info(moduleSection, "init, published: BOOLEAN");
  13188. Boolean(moduleSection,FALSE);
  13189. Boolean(moduleSection,FALSE);
  13190. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13191. Boolean(moduleSection,FALSE);
  13192. Boolean(moduleSection,FALSE);
  13193. Info(moduleSection, "refcnt*: LONGINT");
  13194. Longint(moduleSection,0);
  13195. Info(moduleSection, "sb*: ADDRESS");
  13196. Address(moduleSection,0);
  13197. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13198. Address(moduleSection,0);
  13199. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13200. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13201. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13202. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13203. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13204. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13205. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13206. Symbol(moduleSection,importSection,importSectionOffset,0);
  13207. Info(moduleSection, "procTable*: ProcTable");
  13208. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13209. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13210. Address(moduleSection,0);
  13211. Address(moduleSection,0);
  13212. Address(moduleSection,0);
  13213. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13214. Info(moduleSection, "export*: ExportDesc");
  13215. ExportDesc(moduleSection);
  13216. Info(moduleSection, "term*: TerminationHandler");
  13217. Address(moduleSection,0);
  13218. Info(moduleSection, "exTable*: ExceptionTable");
  13219. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13220. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13221. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13222. Info(moduleSection, "crc*: LONGINT");
  13223. patchCRC:= moduleSection.pc;
  13224. Longint(moduleSection, 0); (*! must be implemented *)
  13225. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13226. Info(moduleSection, "body*: ADDRESS");
  13227. Symbol(moduleSection, bodyProc, 0,0);
  13228. Info(moduleSection, "module flags");
  13229. flags := {};
  13230. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13231. Set( moduleSection, flags);
  13232. IF implementationVisitor.backend.cooperative THEN
  13233. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13234. Info(moduleSection, "monitor.owner");
  13235. Address(moduleSection,0);
  13236. Info(moduleSection, "monitor.nestingLevel");
  13237. Address(moduleSection,0);
  13238. Info(moduleSection, "monitor.blockedQueue");
  13239. Address(moduleSection,0); Address(moduleSection,0);
  13240. Info(moduleSection, "monitor.waitingQueue");
  13241. Address(moduleSection,0); Address(moduleSection,0);
  13242. Info(moduleSection, "monitor.waitingSentinel");
  13243. Address(moduleSection,0);
  13244. END;
  13245. END Module;
  13246. PROCEDURE PatchCRC(crc: LONGINT);
  13247. BEGIN
  13248. IF ~simple THEN
  13249. PatchLongint(ModuleSection(), patchCRC, crc);
  13250. END;
  13251. END PatchCRC;
  13252. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13253. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter;
  13254. BEGIN
  13255. ArrayBlock(source,pc,"",FALSE);
  13256. Info(source, "pointer offsets array data");
  13257. IF scope IS SyntaxTree.RecordScope THEN
  13258. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13259. ELSIF scope IS SyntaxTree.CellScope THEN
  13260. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13261. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13262. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13263. WHILE variable # NIL DO
  13264. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13265. symbol := module.allSections.FindBySymbol(variable);
  13266. ASSERT(symbol # NIL);
  13267. Pointers(0,symbol, source,variable.type,numberPointers);
  13268. END;
  13269. variable := variable.nextVariable;
  13270. END;
  13271. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13272. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13273. WHILE parameter # NIL DO
  13274. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13275. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13276. END;
  13277. parameter := parameter.nextParameter;
  13278. END;
  13279. (* a self parameter does not need to be traced *)
  13280. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13281. WHILE(variable # NIL) DO
  13282. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13283. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13284. END;
  13285. variable := variable.nextVariable
  13286. END;
  13287. END;
  13288. PatchArray(source,pc,numberPointers);
  13289. END PointerArray;
  13290. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13291. VAR recordType: SyntaxTree.RecordType;
  13292. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13293. section: Sections.Section; cellType: SyntaxTree.CellType;
  13294. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13295. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13296. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13297. sectionName: Basic.SectionName;
  13298. CONST MPO=-40000000H;
  13299. BEGIN
  13300. (*
  13301. TypeDesc* = POINTER TO RECORD
  13302. descSize: SIZE;
  13303. sentinel: LONGINT; (* = MPO-4 *)
  13304. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13305. flags*: SET;
  13306. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13307. name*: Name;
  13308. refsOffset: SIZE;
  13309. END;
  13310. *)
  13311. (* source := module.sections.FindByName(...) *)
  13312. Global.GetSymbolSegmentedName(td,name);
  13313. Basic.AppendToSegmentedName(name,".@Info");
  13314. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13315. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13316. Address(source,0);
  13317. Info(source, "TypeDescriptor");
  13318. Address(source,0);
  13319. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13320. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13321. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13322. Info(source, "type tag pointer");
  13323. Symbol( source, tag, offset, 0);
  13324. Info(source, "type flags");
  13325. flags := {};
  13326. IF isProtected THEN INCL(flags,31) END;
  13327. Set( source, flags);
  13328. Info(source, "pointer to module");
  13329. moduleSection := ModuleSection();
  13330. Symbol( source, moduleSection, moduleSection.pc,0);
  13331. Info(source, "type name");
  13332. i := 0;
  13333. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13334. (*
  13335. Global.GetSymbolSegmentedName(td,name);
  13336. Basic.SegmentedNameToString(name, sectionName);
  13337. *)
  13338. Name(source,sectionName);
  13339. Size(source, 0);
  13340. RETURN source;
  13341. END NewTypeDescriptorInfo;
  13342. PROCEDURE NewTypeDescriptor;
  13343. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13344. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13345. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13346. numberPointers: LONGINT; padding, i: LONGINT;
  13347. CONST MPO=-40000000H;
  13348. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13349. VAR i: LONGINT;
  13350. PROCEDURE Td(record: SyntaxTree.RecordType);
  13351. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13352. BEGIN
  13353. IF record # NIL THEN
  13354. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13355. baseTD := record.typeDeclaration;
  13356. Global.GetSymbolSegmentedName(baseTD,name);
  13357. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13358. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13359. ELSE
  13360. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13361. END;
  13362. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13363. Symbol(source, tir, 0, offset);
  13364. IF reverse THEN Td(record.GetBaseRecord()) END;
  13365. END;
  13366. END Td;
  13367. BEGIN
  13368. Info(source, "tag table");
  13369. baseRecord := recordType;
  13370. i := 0;
  13371. WHILE baseRecord # NIL DO
  13372. INC(i);
  13373. baseRecord := baseRecord.GetBaseRecord();
  13374. END;
  13375. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13376. IF ~reverse THEN Td(recordType) END;
  13377. WHILE i < size DO
  13378. Address(source,0);
  13379. INC(i);
  13380. END;
  13381. IF reverse THEN Td(recordType) END;
  13382. END TdTable;
  13383. PROCEDURE MethodTable(reverse: BOOLEAN);
  13384. VAR i,methods: LONGINT;
  13385. BEGIN
  13386. Info(source, "method table");
  13387. IF recordType # NIL THEN
  13388. methods := recordType.recordScope.numberMethods;
  13389. IF reverse THEN
  13390. FOR i := methods-1 TO 0 BY -1 DO
  13391. procedure := recordType.recordScope.FindMethod(i);
  13392. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13393. NamedSymbol(source, name,procedure, 0,0);
  13394. END;
  13395. ELSE
  13396. FOR i := 0 TO methods-1 DO
  13397. procedure := recordType.recordScope.FindMethod(i);
  13398. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13399. NamedSymbol(source, name,procedure, 0,0);
  13400. END;
  13401. END;
  13402. END;
  13403. END MethodTable;
  13404. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13405. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13406. BEGIN
  13407. Info(source, "method table");
  13408. baseRecord := recordType;
  13409. WHILE baseRecord.baseType # NIL DO
  13410. baseRecord := baseRecord.GetBaseRecord ();
  13411. END;
  13412. GetRecordTypeName (baseRecord, name);
  13413. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13414. IF name = stackFrame THEN
  13415. start := 0;
  13416. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13417. baseRecord := recordType;
  13418. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13419. baseRecord := baseRecord.GetBaseRecord ();
  13420. END;
  13421. IF baseRecord # NIL THEN
  13422. GetRecordTypeName (baseRecord, name);
  13423. IF pointer & ~baseRecord.isObject THEN
  13424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13425. END;
  13426. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13427. ELSIF recordType.isObject THEN
  13428. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13429. ELSIF pointer THEN
  13430. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13431. ELSE
  13432. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13433. END;
  13434. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13435. Symbol(source, tir, 0, 0);
  13436. start := 0;
  13437. baseRecord := recordType;
  13438. WHILE (baseRecord # NIL) DO
  13439. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13440. baseRecord := baseRecord.GetBaseRecord ();
  13441. END;
  13442. ELSE
  13443. (* explicit trace method: *)
  13444. procedure := recordType.recordScope.FindMethod(0);
  13445. IF ~procedure.isFinalizer THEN
  13446. Global.GetSymbolSegmentedName(procedure, name);
  13447. NamedSymbol(source, name,procedure, 0,0);
  13448. END;
  13449. start := 1;
  13450. END;
  13451. IF (name # stackFrame) & recordType.isObject THEN
  13452. baseRecord := recordType;
  13453. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13454. baseRecord := baseRecord.GetBaseRecord ();
  13455. END;
  13456. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13457. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13458. ELSE
  13459. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13460. END;
  13461. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13462. Symbol(source, tir, 0, 0);
  13463. END;
  13464. methods := recordType.recordScope.numberMethods;
  13465. FOR i := start TO methods-1 DO
  13466. procedure := recordType.recordScope.FindMethod(i);
  13467. IF ~procedure.isFinalizer THEN
  13468. Global.GetSymbolSegmentedName(procedure, name);
  13469. NamedSymbol(source, name,procedure, 0,0);
  13470. END;
  13471. END;
  13472. END CooperativeMethodTable;
  13473. BEGIN
  13474. Global.GetSymbolSegmentedName(td,name);
  13475. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13476. source.SetExported(IsExported(td));
  13477. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13478. IF implementationVisitor.backend.cooperative THEN
  13479. base := NIL;
  13480. baseRecord := recordType.GetBaseRecord();
  13481. IF baseRecord # NIL THEN
  13482. baseTD := baseRecord.typeDeclaration;
  13483. END;
  13484. IF ~recordType.isObject THEN
  13485. Info(source, "parent");
  13486. IF baseRecord # NIL THEN
  13487. Global.GetSymbolSegmentedName(baseTD,name);
  13488. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13489. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13490. ELSE
  13491. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13492. END;
  13493. Symbol(source, tir, 0, 0);
  13494. ELSE
  13495. Address(source,0);
  13496. END;
  13497. Info(source, "record size");
  13498. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13499. CooperativeMethodTable(FALSE);
  13500. base := source;
  13501. Global.GetSymbolSegmentedName(td,name);
  13502. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13503. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13504. source.SetExported(IsExported(td));
  13505. END;
  13506. Info(source, "parent");
  13507. IF baseRecord # NIL THEN
  13508. Global.GetSymbolSegmentedName(baseTD,name);
  13509. sym := baseTD;
  13510. IF ~recordType.isObject THEN
  13511. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13512. sym := NIL;
  13513. END;
  13514. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13515. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13516. tir.SetExported(IsExported(td));
  13517. ELSE
  13518. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13519. END;
  13520. Symbol(source, tir, 0, 0);
  13521. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13522. Address(source,0);
  13523. ELSE
  13524. IF recordType.isObject THEN
  13525. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13526. ELSE
  13527. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13528. END;
  13529. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13530. Symbol(source, tir, 0, 0);
  13531. END;
  13532. Info(source, "base record descriptor");
  13533. Symbol(source, base, 0, 0);
  13534. CooperativeMethodTable(TRUE);
  13535. IF recordType.hasPointers THEN
  13536. IF ~HasExplicitTraceMethod (recordType) THEN
  13537. implementationVisitor.CreateTraceMethod(recordType);
  13538. END;
  13539. implementationVisitor.CreateResetProcedure(recordType);
  13540. implementationVisitor.CreateAssignProcedure(recordType);
  13541. END;
  13542. ELSIF ~simple THEN
  13543. (*
  13544. MethodEnd = MPO
  13545. ---
  13546. methods (# methods)
  13547. ---
  13548. tags (16)
  13549. ---
  13550. TypeDesc = TypeInfoAdr
  13551. ---
  13552. td adr ---> rec size
  13553. ----
  13554. pointer offsets
  13555. ----
  13556. (padding)
  13557. -----
  13558. empty [2 addresses aligned]
  13559. empty
  13560. empty
  13561. numPtrs
  13562. ---
  13563. pointer offsets
  13564. ---
  13565. *)
  13566. Info(source, "MethodEnd = MPO");
  13567. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13568. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13569. MethodTable(TRUE);
  13570. TdTable(TypeTags, TRUE);
  13571. Info(source, "type descriptor info pointer");
  13572. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13573. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13574. IF (cellType # NIL) THEN
  13575. IF cellType.sizeInBits < 0 THEN
  13576. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13577. END;
  13578. Info(source, "cell size");
  13579. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13580. ELSE
  13581. Info(source, "record size");
  13582. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13583. END;
  13584. Info(source, "pointer offsets pointer");
  13585. padding := 1- source.pc MOD 2;
  13586. Symbol(source, source, source.pc+1+padding,0);
  13587. IF padding >0 THEN
  13588. Info(source, "padding");
  13589. FOR i := 1 TO padding DO Address(source,0) END;
  13590. END;
  13591. IF cellType # NIL THEN
  13592. PointerArray(source, cellType.cellScope, numberPointers);
  13593. ELSE
  13594. PointerArray(source, recordType.recordScope, numberPointers);
  13595. END;
  13596. ELSE
  13597. (*
  13598. simple:
  13599. td adr --> size
  13600. tag(1)
  13601. tag(2)
  13602. tag(3)
  13603. methods ->
  13604. *)
  13605. Info(source, "record size");
  13606. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13607. TdTable(TypeTags, FALSE);
  13608. MethodTable(FALSE);
  13609. END;
  13610. END NewTypeDescriptor;
  13611. BEGIN
  13612. x := x.resolved;
  13613. IF (x IS SyntaxTree.PointerType) THEN
  13614. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13615. END;
  13616. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13617. recordType := x(SyntaxTree.RecordType);
  13618. td := x.typeDeclaration;
  13619. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13620. ASSERT(td # NIL);
  13621. section := module.allSections.FindBySymbol(td); (* TODO *)
  13622. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13623. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13624. NewTypeDescriptor
  13625. END;
  13626. END;
  13627. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13628. cellType := x(SyntaxTree.CellType);
  13629. td := x.typeDeclaration;
  13630. section := module.allSections.FindBySymbol(td); (* TODO *)
  13631. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13632. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13633. NewTypeDescriptor
  13634. END;
  13635. END;
  13636. END
  13637. END CheckTypeDeclaration
  13638. END MetaDataGenerator;
  13639. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13640. VAR
  13641. trace-: BOOLEAN;
  13642. traceString-: SyntaxTree.IdentifierString;
  13643. traceModuleName-: SyntaxTree.IdentifierString;
  13644. profile-: BOOLEAN;
  13645. noRuntimeChecks: BOOLEAN;
  13646. simpleMetaData-: BOOLEAN;
  13647. noAsserts: BOOLEAN;
  13648. optimize-: BOOLEAN;
  13649. cooperative-: BOOLEAN;
  13650. preregisterStatic-: BOOLEAN;
  13651. dump-: Basic.Writer;
  13652. cellsAreObjects: BOOLEAN;
  13653. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13654. experiment: BOOLEAN;
  13655. PROCEDURE &InitIntermediateBackend*;
  13656. BEGIN
  13657. simpleMetaData := FALSE;
  13658. InitBackend;
  13659. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13660. SetTraceModuleName(DefaultTraceModuleName);
  13661. END InitIntermediateBackend;
  13662. (* must be overwritten by actual backend, if parameter registers should be used *)
  13663. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13664. BEGIN
  13665. register := -1;
  13666. RETURN FALSE;
  13667. END GetParameterRegister;
  13668. PROCEDURE ResetParameterRegisters*;
  13669. BEGIN
  13670. END ResetParameterRegisters;
  13671. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13672. VAR
  13673. declarationVisitor: DeclarationVisitor;
  13674. implementationVisitor: ImplementationVisitor;
  13675. module: Sections.Module;
  13676. name, platformName: SyntaxTree.IdentifierString;
  13677. meta: MetaDataGenerator;
  13678. crc: CRC.CRC32Stream;
  13679. BEGIN
  13680. ResetError;
  13681. Global.GetSymbolName(x,name);
  13682. NEW(module,x,system); (* backend structures *)
  13683. Global.GetModuleName(x, name);
  13684. module.SetModuleName(name);
  13685. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13686. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13687. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13688. declarationVisitor.Module(x,module);
  13689. IF ~meta.simple THEN
  13690. meta.Module(implementationVisitor.moduleBodySection);
  13691. END;
  13692. GetDescription(platformName);
  13693. module.SetPlatformName(platformName);
  13694. NEW(crc);
  13695. module.allSections.WriteRaw(crc);
  13696. crc.Update;
  13697. meta.PatchCRC(crc.GetCRC());
  13698. RETURN module
  13699. END GenerateIntermediate;
  13700. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13701. BEGIN RETURN TRUE
  13702. END SupportedImmediate;
  13703. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13704. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13705. END ProcessSyntaxTreeModule;
  13706. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13707. VAR
  13708. result: Sections.Module;
  13709. traceName: Basic.MessageString;
  13710. BEGIN
  13711. ASSERT(intermediateCodeModule IS Sections.Module);
  13712. result := intermediateCodeModule(Sections.Module);
  13713. IF trace THEN
  13714. traceName := "intermediate code trace: ";
  13715. Strings.Append(traceName,traceString);
  13716. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13717. IF (traceString="") OR (traceString="*") THEN
  13718. result.Dump(dump);
  13719. dump.Update
  13720. ELSE
  13721. Sections.DumpFiltered(dump, result, traceString);
  13722. END
  13723. END;
  13724. RETURN result
  13725. END ProcessIntermediateCodeModule;
  13726. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13727. BEGIN instructionSet := "Intermediate";
  13728. END GetDescription;
  13729. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13730. BEGIN
  13731. SELF.simpleMetaData := simpleMetaData;
  13732. END SetSimpleMetaData;
  13733. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13734. BEGIN COPY(name, traceModuleName)
  13735. END SetTraceModuleName;
  13736. PROCEDURE DefineOptions*(options: Options.Options);
  13737. BEGIN
  13738. DefineOptions^(options);
  13739. options.Add(0X,"trace",Options.String);
  13740. options.Add(0X,"builtinsModule",Options.String);
  13741. options.Add(0X,"traceModule",Options.String);
  13742. options.Add(0X,"profile",Options.Flag);
  13743. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13744. options.Add(0X,"noAsserts",Options.Flag);
  13745. options.Add(0X,"metaData",Options.String);
  13746. options.Add('o',"optimize", Options.Flag);
  13747. options.Add(0X,"preregisterStatic", Options.Flag);
  13748. options.Add(0X,"cellsAreObjects", Options.Flag);
  13749. options.Add(0X,"preciseGC", Options.Flag);
  13750. options.Add(0X,"trackLeave", Options.Flag);
  13751. options.Add(0X,"writeBarriers", Options.Flag);
  13752. options.Add(0X,"experiment", Options.Flag);
  13753. END DefineOptions;
  13754. PROCEDURE GetOptions*(options: Options.Options);
  13755. VAR name,string: SyntaxTree.IdentifierString;
  13756. BEGIN
  13757. GetOptions^(options);
  13758. trace := options.GetString("trace",traceString);
  13759. profile := options.GetFlag("profile");
  13760. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13761. noAsserts := options.GetFlag("noAsserts");
  13762. cooperative := options.GetFlag("cooperative");
  13763. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13764. simpleMetaData := TRUE
  13765. END;
  13766. IF options.GetString("metaData",string) THEN
  13767. IF string = "simple" THEN simpleMetaData := TRUE
  13768. ELSIF string ="full" THEN simpleMetaData := FALSE
  13769. END;
  13770. END;
  13771. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13772. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13773. optimize := options.GetFlag("optimize");
  13774. preregisterStatic := options.GetFlag("preregisterStatic");
  13775. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13776. preciseGC := options.GetFlag("preciseGC");
  13777. trackLeave := options.GetFlag("trackLeave");
  13778. writeBarriers := options.GetFlag("writeBarriers");
  13779. experiment := options.GetFlag("experiment");
  13780. IF simpleMetaData THEN preciseGC := FALSE END;
  13781. END GetOptions;
  13782. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13783. BEGIN RETURN SymbolFileFormat.Get()
  13784. END DefaultSymbolFileFormat;
  13785. END IntermediateBackend;
  13786. (* ----------------------------------- register allocation ------------------------------------- *)
  13787. (* register mapping scheme
  13788. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13789. spill offset
  13790. part(n) --> ticket <--> physical register
  13791. spill offset
  13792. *)
  13793. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13794. emptyOperand: IntermediateCode.Operand;
  13795. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13796. statCoopResetVariables: LONGINT;
  13797. statCoopModifyAssignments: LONGINT;
  13798. modifyAssignmentsPC : LONGINT;
  13799. statCoopNilCheck: LONGINT;
  13800. statCoopSwitch: LONGINT;
  13801. statCoopAssignProcedure: LONGINT;
  13802. statCoopTraceMethod: LONGINT;
  13803. statCoopResetProcedure: LONGINT;
  13804. statCoopTraceModule: LONGINT;
  13805. ResultDesignatorName: SyntaxTree.Identifier;
  13806. PROCEDURE ResetStatistics*;
  13807. BEGIN
  13808. statCoopResetVariables := 0;
  13809. statCoopModifyAssignments := 0;
  13810. statCoopNilCheck:= 0;
  13811. statCoopSwitch:= 0;
  13812. statCoopAssignProcedure:= 0;
  13813. statCoopTraceMethod:= 0;
  13814. statCoopResetProcedure:= 0;
  13815. statCoopTraceModule:= 0;
  13816. END ResetStatistics;
  13817. PROCEDURE Statistics*;
  13818. BEGIN
  13819. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13820. TRACE(statCoopNilCheck, statCoopSwitch);
  13821. TRACE(statCoopAssignProcedure,
  13822. statCoopTraceMethod,
  13823. statCoopResetProcedure,
  13824. statCoopTraceModule)
  13825. END Statistics;
  13826. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13827. VAR h: LONGINT;
  13828. BEGIN
  13829. WHILE b # 0 DO
  13830. h := a MOD b;
  13831. a := b;
  13832. b := h;
  13833. END;
  13834. RETURN a
  13835. END GCD;
  13836. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13837. BEGIN
  13838. RETURN a*b DIV GCD(a,b)
  13839. END SCM;
  13840. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13841. BEGIN
  13842. (*TRACE(a,b);*)
  13843. IF a = 0 THEN RETURN b
  13844. ELSIF b = 0 THEN RETURN a
  13845. ELSE RETURN SCM(a,b)
  13846. END;
  13847. END CommonAlignment;
  13848. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13849. BEGIN
  13850. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13851. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13852. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13853. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13854. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13855. END
  13856. END PassBySingleReference;
  13857. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13858. BEGIN
  13859. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13860. END PassInRegister;
  13861. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13862. VAR new: RegisterEntry;
  13863. BEGIN
  13864. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13865. IF queue = NIL THEN
  13866. queue := new
  13867. ELSE
  13868. new.next := queue;
  13869. IF queue#NIL THEN queue.prev := new END;
  13870. queue := new
  13871. END;
  13872. END AddRegisterEntry;
  13873. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13874. VAR this: RegisterEntry;
  13875. BEGIN
  13876. this := queue;
  13877. WHILE (this # NIL) & (this.register # register) DO
  13878. this := this.next;
  13879. END;
  13880. IF this = NIL THEN
  13881. RETURN FALSE
  13882. END;
  13883. ASSERT(this # NIL);
  13884. IF this = queue THEN queue := queue.next END;
  13885. IF this.prev # NIL THEN this.prev.next := this.next END;
  13886. IF this.next # NIL THEN this.next.prev := this.prev END;
  13887. RETURN TRUE
  13888. END RemoveRegisterEntry;
  13889. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13890. BEGIN ASSERT(cond);
  13891. END Assert;
  13892. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13893. BEGIN
  13894. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13895. END ReusableRegister;
  13896. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13897. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13898. BEGIN
  13899. procedure := moduleScope.bodyProcedure;
  13900. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13901. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13902. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13903. procedure.SetScope(moduleScope);
  13904. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13905. procedure.SetAccess(SyntaxTree.Hidden);
  13906. moduleScope.SetBodyProcedure(procedure);
  13907. moduleScope.AddProcedure(procedure);
  13908. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13909. END;
  13910. END EnsureBodyProcedure;
  13911. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13912. VAR import: SyntaxTree.Import;
  13913. selfName: SyntaxTree.IdentifierString;
  13914. module: SyntaxTree.Module;
  13915. BEGIN
  13916. scope.ownerModule.GetName(selfName);
  13917. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13918. module := scope.ownerModule
  13919. ELSE
  13920. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13921. IF import = NIL THEN
  13922. RETURN NIL
  13923. ELSIF import.module = NIL THEN
  13924. RETURN NIL
  13925. ELSE module := import.module
  13926. END;
  13927. END;
  13928. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13929. END GetSymbol;
  13930. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13931. BEGIN
  13932. op.mode := mode;
  13933. IntermediateCode.InitOperand(op.op);
  13934. IntermediateCode.InitOperand(op.tag);
  13935. IntermediateCode.InitOperand(op.extra);
  13936. op.dimOffset := 0;
  13937. op.availability := -1;
  13938. END InitOperand;
  13939. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13940. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13941. BEGIN RETURN IntermediateCode.GetType(system, type)
  13942. END GetType;
  13943. PROCEDURE FindConstant(module: SyntaxTree.Module; value: SyntaxTree.Value): SyntaxTree.Constant;
  13944. VAR constant: SyntaxTree.Constant;
  13945. BEGIN
  13946. constant := module.moduleScope.firstConstant;
  13947. WHILE (constant # NIL) & ~value.Equals(constant.value) DO
  13948. constant := constant.nextConstant;
  13949. END;
  13950. RETURN constant
  13951. END FindConstant;
  13952. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13953. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13954. BEGIN
  13955. (*
  13956. UniqueId(name,module,name,adr);
  13957. *)
  13958. constant := FindConstant(module, value);
  13959. IF constant = NIL THEN
  13960. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13961. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13962. constant.SetValue(value);
  13963. constant.SetAccess(SyntaxTree.Hidden);
  13964. module.moduleScope.AddConstant(constant);
  13965. constant.SetScope(module.moduleScope);
  13966. END;
  13967. RETURN constant
  13968. END BuildConstant;
  13969. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13970. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13971. BEGIN
  13972. variable := scope.firstVariable;
  13973. WHILE variable # NIL DO
  13974. IF variable.NeedsTrace() THEN
  13975. RETURN TRUE;
  13976. END;
  13977. variable := variable.nextVariable;
  13978. END;
  13979. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13980. WHILE parameter # NIL DO
  13981. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13982. RETURN TRUE;
  13983. END;
  13984. parameter := parameter.nextParameter;
  13985. END;
  13986. RETURN FALSE;
  13987. END HasPointers;
  13988. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13989. 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));
  13990. END IsVariableParameter;
  13991. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13992. VAR parameter: SyntaxTree.Parameter;
  13993. BEGIN
  13994. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13995. WHILE parameter # NIL DO
  13996. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13997. IF parameter.movable THEN RETURN TRUE END;
  13998. parameter := parameter.nextParameter;
  13999. END;
  14000. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  14001. END HasVariableParameters;
  14002. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  14003. BEGIN
  14004. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  14005. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  14006. END HasExplicitTraceMethod;
  14007. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  14008. BEGIN
  14009. IF expression.resolved # NIL THEN expression := expression.resolved END;
  14010. IF (expression IS SyntaxTree.IntegerValue) THEN
  14011. val := expression(SyntaxTree.IntegerValue).value;
  14012. RETURN TRUE
  14013. ELSE
  14014. RETURN FALSE
  14015. END;
  14016. END IsIntegerConstant;
  14017. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  14018. BEGIN
  14019. IF val <= 0 THEN RETURN FALSE END;
  14020. exp := 0;
  14021. WHILE ~ODD(val) DO
  14022. val := val DIV 2;
  14023. INC(exp)
  14024. END;
  14025. RETURN val = 1
  14026. END PowerOf2;
  14027. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  14028. VAR procedure: SyntaxTree.Procedure;
  14029. BEGIN
  14030. procedure := record.recordScope.constructor;
  14031. IF procedure = NIL THEN
  14032. record := record.GetBaseRecord();
  14033. IF record # NIL THEN
  14034. procedure := GetConstructor(record)
  14035. END;
  14036. END;
  14037. RETURN procedure;
  14038. END GetConstructor;
  14039. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  14040. BEGIN
  14041. value := SHORT(op.intValue);
  14042. RETURN op.mode = IntermediateCode.ModeImmediate;
  14043. END IsIntegerImmediate;
  14044. (** whether a type strictily is a pointer to record or object type
  14045. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  14046. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  14047. BEGIN
  14048. IF type = NIL THEN
  14049. RETURN FALSE
  14050. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  14051. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  14052. ELSE
  14053. RETURN FALSE
  14054. END
  14055. END IsStrictlyPointerToRecord;
  14056. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  14057. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  14058. END IsUnsafePointer;
  14059. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  14060. BEGIN type := type.resolved;
  14061. IF type IS SyntaxTree.PointerType THEN
  14062. type := type(SyntaxTree.PointerType).pointerBase;
  14063. type := type.resolved;
  14064. IF type IS SyntaxTree.RecordType THEN
  14065. recordType := type(SyntaxTree.RecordType);
  14066. RETURN TRUE
  14067. ELSE
  14068. RETURN FALSE
  14069. END
  14070. ELSIF type IS SyntaxTree.RecordType THEN
  14071. recordType := type(SyntaxTree.RecordType);
  14072. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  14073. ELSIF type IS SyntaxTree.ObjectType THEN
  14074. RETURN TRUE
  14075. ELSIF type IS SyntaxTree.AnyType THEN
  14076. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  14077. ELSE
  14078. RETURN FALSE
  14079. END;
  14080. END IsPointerToRecord;
  14081. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  14082. BEGIN
  14083. type := type.resolved;
  14084. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  14085. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  14086. END IsArrayOfSystemByte;
  14087. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  14088. BEGIN
  14089. IF type = NIL THEN RETURN FALSE END;
  14090. type := type.resolved;
  14091. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  14092. END IsOpenArray;
  14093. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  14094. BEGIN
  14095. IF type = NIL THEN RETURN FALSE END;
  14096. type := type.resolved;
  14097. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  14098. END IsSemiDynamicArray;
  14099. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  14100. BEGIN
  14101. IF type = NIL THEN RETURN FALSE END;
  14102. type := type.resolved;
  14103. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  14104. END IsStaticArray;
  14105. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  14106. BEGIN
  14107. IF type = NIL THEN RETURN FALSE END;
  14108. type := type.resolved;
  14109. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  14110. END IsStaticMathArray;
  14111. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14112. BEGIN
  14113. WHILE (IsStaticMathArray(type)) DO
  14114. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14115. END;
  14116. RETURN type;
  14117. END StaticMathArrayBaseType;
  14118. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14119. VAR size: LONGINT;
  14120. BEGIN
  14121. size := 1;
  14122. WHILE (IsStaticArray(type)) DO
  14123. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14124. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14125. END;
  14126. RETURN size;
  14127. END StaticArrayNumElements;
  14128. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14129. VAR size: LONGINT;
  14130. BEGIN
  14131. size := 1;
  14132. WHILE (IsStaticMathArray(type)) DO
  14133. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14134. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14135. END;
  14136. RETURN size;
  14137. END StaticMathArrayNumElements;
  14138. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14139. BEGIN
  14140. WHILE (IsStaticArray(type)) DO
  14141. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14142. END;
  14143. RETURN type;
  14144. END StaticArrayBaseType;
  14145. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14146. BEGIN
  14147. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14148. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14149. END;
  14150. RETURN type;
  14151. END ArrayBaseType;
  14152. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14153. BEGIN
  14154. IF type = NIL THEN RETURN FALSE END;
  14155. type := type.resolved;
  14156. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14157. END IsDelegate;
  14158. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14159. VAR i: LONGINT;
  14160. BEGIN
  14161. i := 0; type := type.resolved;
  14162. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14163. INC(i);
  14164. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14165. END;
  14166. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14167. INC(i);
  14168. type := type(SyntaxTree.MathArrayType).arrayBase;
  14169. IF type # NIL THEN type := type.resolved END;
  14170. END;
  14171. RETURN i
  14172. END DynamicDim;
  14173. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14174. BEGIN
  14175. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14176. type := type(SyntaxTree.ArrayType).arrayBase;
  14177. END;
  14178. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14179. type := type(SyntaxTree.MathArrayType).arrayBase;
  14180. END;
  14181. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14182. END StaticSize;
  14183. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14184. BEGIN
  14185. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14186. END IsImmediate;
  14187. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14188. BEGIN
  14189. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14190. END IsAddress;
  14191. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14192. BEGIN
  14193. RETURN (x.mode = IntermediateCode.ModeRegister);
  14194. END IsRegister;
  14195. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14196. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14197. BEGIN
  14198. typeDeclaration := recordType.typeDeclaration;
  14199. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14200. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14201. END GetRecordTypeName;
  14202. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14203. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14204. BEGIN
  14205. parSize := 0;
  14206. IF SemanticChecker.StructuredReturnType(system,procedureType) THEN
  14207. parameter := procedureType.returnParameter;
  14208. INC(parSize,system.SizeOfParameter(parameter));
  14209. parSize := parSize + (-parSize) MOD system.addressSize;
  14210. END;
  14211. parameter :=procedureType.lastParameter;
  14212. WHILE (parameter # NIL) DO
  14213. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14214. INC(parSize, system.addressSize);
  14215. ELSE
  14216. INC(parSize,system.SizeOfParameter(parameter));
  14217. parSize := parSize + (-parSize) MOD system.addressSize;
  14218. END;
  14219. parameter := parameter.prevParameter;
  14220. END;
  14221. IF procedureType.selfParameter # NIL THEN
  14222. parameter := procedureType.selfParameter;
  14223. INC(parSize,system.SizeOfParameter(parameter));
  14224. parSize := parSize + (-parSize) MOD system.addressSize;
  14225. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14226. END; (* method => self pointer *)
  14227. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14228. RETURN ToMemoryUnits(system,parSize)
  14229. END ParametersSize;
  14230. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14231. BEGIN
  14232. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14233. END IsNested;
  14234. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14235. BEGIN
  14236. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14237. scope := scope.outerScope;
  14238. END;
  14239. RETURN scope # NIL;
  14240. END InCellScope;
  14241. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14242. BEGIN
  14243. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14244. END ProcedureParametersSize;
  14245. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14246. VAR dataUnit: LONGINT;
  14247. BEGIN dataUnit := system.dataUnit;
  14248. ASSERT(size MOD system.dataUnit = 0);
  14249. RETURN LONGINT(size DIV system.dataUnit)
  14250. END ToMemoryUnits;
  14251. PROCEDURE Get*(): Backend.Backend;
  14252. VAR backend: IntermediateBackend;
  14253. BEGIN NEW(backend); RETURN backend
  14254. END Get;
  14255. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14256. VAR instruction: IntermediateCode.Instruction;
  14257. BEGIN
  14258. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14259. RETURN instruction
  14260. END Nop;
  14261. PROCEDURE Use(position: Basic.Position; reg: IntermediateCode.Operand):IntermediateCode.Instruction;
  14262. VAR instruction: IntermediateCode.Instruction;
  14263. BEGIN
  14264. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,reg,emptyOperand,emptyOperand);
  14265. RETURN instruction
  14266. END Use;
  14267. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14268. VAR instruction: IntermediateCode.Instruction;
  14269. BEGIN
  14270. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14271. RETURN instruction
  14272. END Mov;
  14273. (* like Mov but ensures that no new register will be allocated for dest *)
  14274. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14275. VAR instruction: IntermediateCode.Instruction;
  14276. BEGIN
  14277. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14278. RETURN instruction
  14279. END MovReplace;
  14280. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14281. VAR instruction: IntermediateCode.Instruction;
  14282. BEGIN
  14283. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14284. RETURN instruction
  14285. END Conv;
  14286. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14287. VAR instruction: IntermediateCode.Instruction;
  14288. BEGIN
  14289. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14290. RETURN instruction
  14291. END Call;
  14292. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14293. VAR op1, op2, op3: IntermediateCode.Operand;
  14294. VAR instruction: IntermediateCode.Instruction;
  14295. BEGIN
  14296. IntermediateCode.InitNumber(op1,pcOffset);
  14297. IntermediateCode.InitNumber(op2,callingConvention);
  14298. IntermediateCode.InitNumber(op3,unwind);
  14299. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14300. RETURN instruction
  14301. END Exit;
  14302. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14303. VAR instruction: IntermediateCode.Instruction;
  14304. BEGIN
  14305. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14306. RETURN instruction
  14307. END Return;
  14308. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14309. VAR instruction: IntermediateCode.Instruction;
  14310. BEGIN
  14311. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14312. RETURN instruction
  14313. END Result;
  14314. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14315. VAR op1: IntermediateCode.Operand;
  14316. VAR instruction: IntermediateCode.Instruction;
  14317. BEGIN
  14318. IntermediateCode.InitNumber(op1,nr);
  14319. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14320. RETURN instruction
  14321. END Trap;
  14322. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14323. VAR instruction: IntermediateCode.Instruction;
  14324. BEGIN
  14325. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14326. RETURN instruction
  14327. END Br;
  14328. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14329. VAR instruction: IntermediateCode.Instruction;
  14330. BEGIN
  14331. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14332. RETURN instruction
  14333. END Breq;
  14334. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14335. VAR instruction: IntermediateCode.Instruction;
  14336. BEGIN
  14337. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14338. RETURN instruction
  14339. END Brne;
  14340. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14341. VAR instruction: IntermediateCode.Instruction;
  14342. BEGIN
  14343. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14344. RETURN instruction
  14345. END Brge;
  14346. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14347. VAR instruction: IntermediateCode.Instruction;
  14348. BEGIN
  14349. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14350. RETURN instruction
  14351. END Brlt;
  14352. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14353. VAR instruction: IntermediateCode.Instruction;
  14354. BEGIN
  14355. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14356. RETURN instruction
  14357. END Pop;
  14358. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14359. VAR instruction: IntermediateCode.Instruction;
  14360. BEGIN
  14361. ASSERT(op.mode # IntermediateCode.Undefined);
  14362. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14363. RETURN instruction
  14364. END Push;
  14365. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14366. VAR instruction: IntermediateCode.Instruction;
  14367. BEGIN
  14368. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14369. RETURN instruction
  14370. END Neg;
  14371. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14372. VAR instruction: IntermediateCode.Instruction;
  14373. BEGIN
  14374. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14375. RETURN instruction
  14376. END Not;
  14377. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14378. VAR instruction: IntermediateCode.Instruction;
  14379. BEGIN
  14380. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14381. RETURN instruction
  14382. END Abs;
  14383. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14384. VAR instruction: IntermediateCode.Instruction;
  14385. BEGIN
  14386. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14387. ASSERT(~IsImmediate(instruction.op1));
  14388. RETURN instruction
  14389. END Mul;
  14390. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14391. VAR instruction: IntermediateCode.Instruction;
  14392. BEGIN
  14393. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14394. RETURN instruction
  14395. END Div;
  14396. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14397. VAR instruction: IntermediateCode.Instruction;
  14398. BEGIN
  14399. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14400. RETURN instruction
  14401. END Mod;
  14402. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14403. VAR instruction: IntermediateCode.Instruction;
  14404. BEGIN
  14405. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14406. RETURN instruction
  14407. END Sub;
  14408. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14409. VAR instruction: IntermediateCode.Instruction;
  14410. BEGIN
  14411. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14412. RETURN instruction
  14413. END Add;
  14414. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14415. VAR instruction: IntermediateCode.Instruction;
  14416. BEGIN
  14417. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14418. RETURN instruction
  14419. END And;
  14420. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14421. VAR instruction: IntermediateCode.Instruction;
  14422. BEGIN
  14423. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14424. RETURN instruction
  14425. END Or;
  14426. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14427. VAR instruction: IntermediateCode.Instruction;
  14428. BEGIN
  14429. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14430. RETURN instruction
  14431. END Xor;
  14432. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14433. VAR instruction: IntermediateCode.Instruction;
  14434. BEGIN
  14435. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14436. RETURN instruction
  14437. END Shl;
  14438. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14439. VAR instruction: IntermediateCode.Instruction;
  14440. BEGIN
  14441. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14442. RETURN instruction
  14443. END Shr;
  14444. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14445. VAR instruction: IntermediateCode.Instruction;
  14446. BEGIN
  14447. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14448. RETURN instruction
  14449. END Rol;
  14450. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14451. VAR instruction: IntermediateCode.Instruction;
  14452. BEGIN
  14453. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14454. RETURN instruction
  14455. END Ror;
  14456. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14457. VAR instruction: IntermediateCode.Instruction;
  14458. BEGIN
  14459. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14460. RETURN instruction
  14461. END Cas;
  14462. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14463. VAR instruction: IntermediateCode.Instruction;
  14464. BEGIN
  14465. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14466. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14467. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14468. RETURN instruction
  14469. END Copy;
  14470. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14471. VAR instruction: IntermediateCode.Instruction;
  14472. BEGIN
  14473. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14474. RETURN instruction
  14475. END Fill;
  14476. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules; scope: SyntaxTree.Scope): IntermediateCode.Instruction;
  14477. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14478. BEGIN
  14479. string := IntermediateCode.String(s);
  14480. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14481. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14482. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14483. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14484. IntermediateCode.SetScope(instruction, scope);
  14485. RETURN instruction
  14486. END Asm;
  14487. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14488. VAR instruction: IntermediateCode.Instruction;
  14489. BEGIN
  14490. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14491. RETURN instruction
  14492. END Data;
  14493. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14494. VAR instruction: IntermediateCode.Instruction;
  14495. BEGIN
  14496. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14497. IntermediateCode.SetSubType(instruction, subtype);
  14498. RETURN instruction
  14499. END SpecialInstruction;
  14500. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14501. VAR op1: IntermediateCode.Operand;
  14502. VAR instruction: IntermediateCode.Instruction;
  14503. BEGIN
  14504. (*! generate a warning if size exceeds a certain limit *)
  14505. (*
  14506. ASSERT(bytes < 1000000); (* sanity check *)
  14507. *)
  14508. ASSERT(0 <= units); (* sanity check *)
  14509. IntermediateCode.InitNumber(op1,units);
  14510. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14511. RETURN instruction
  14512. END Reserve;
  14513. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14514. VAR op1: IntermediateCode.Operand;
  14515. VAR instruction: IntermediateCode.Instruction;
  14516. BEGIN
  14517. IntermediateCode.InitNumber(op1,position.start);
  14518. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14519. RETURN instruction
  14520. END LabelInstruction;
  14521. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14522. VAR pc: LONGINT;
  14523. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14524. BEGIN
  14525. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14526. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14527. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14528. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14529. IF instr.op1.type.form = IntermediateCode.Float THEN
  14530. RETURN instr.op1.floatValue = op.floatValue
  14531. ELSE
  14532. RETURN instr.op1.intValue = op.intValue
  14533. END;
  14534. END ProvidesValue;
  14535. BEGIN
  14536. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14537. pc := 0;
  14538. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14539. INC(pc);
  14540. END;
  14541. IF pc = data.pc THEN
  14542. data.Emit(Data(Basic.invalidPosition,vop));
  14543. END;
  14544. RETURN pc
  14545. END EnterImmediate;
  14546. PROCEDURE Init;
  14547. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14548. BEGIN
  14549. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14550. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14551. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14552. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14553. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14554. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14555. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14556. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14557. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14558. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14559. IntermediateCode.InitOperand(emptyOperand);
  14560. FOR i := 0 TO NumberSystemCalls-1 DO
  14561. name := "@SystemCall";
  14562. Basic.AppendNumber(name,i);
  14563. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14564. END;
  14565. ResultDesignatorName := SyntaxTree.NewIdentifier("@Result");
  14566. END Init;
  14567. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14568. BEGIN
  14569. RETURN (symbol # NIL) & symbol.NeedsSection();
  14570. END IsExported;
  14571. BEGIN
  14572. Init;
  14573. END FoxIntermediateBackend.
  14574. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14575. # Release.Build --path="/temp/obg/" Win32 ~
  14576. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  14577. FStols.CloseFiles A2Z.exe ~
  14578. System.FreeDownTo FoxIntermediateBackend ~
  14579. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14580. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14581. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14582. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14583. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14584. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14585. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14586. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14587. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14588. GenericLinker.Mod Loader.Mod BootConsole.Mod